{"version":3,"sources":["webpack://Recharts/webpack/universalModuleDefinition","webpack://Recharts/webpack/bootstrap","webpack://Recharts/./node_modules/@babel/runtime/helpers/interopRequireDefault.js","webpack://Recharts/./node_modules/classnames/index.js","webpack://Recharts/./node_modules/core-js/es/math/index.js","webpack://Recharts/./node_modules/core-js/es/number/index.js","webpack://Recharts/./node_modules/core-js/internals/a-possible-prototype.js","webpack://Recharts/./node_modules/core-js/internals/an-object.js","webpack://Recharts/./node_modules/core-js/internals/array-includes.js","webpack://Recharts/./node_modules/core-js/internals/classof-raw.js","webpack://Recharts/./node_modules/core-js/internals/copy-constructor-properties.js","webpack://Recharts/./node_modules/core-js/internals/create-non-enumerable-property.js","webpack://Recharts/./node_modules/core-js/internals/create-property-descriptor.js","webpack://Recharts/./node_modules/core-js/internals/descriptors.js","webpack://Recharts/./node_modules/core-js/internals/document-create-element.js","webpack://Recharts/./node_modules/core-js/internals/enum-bug-keys.js","webpack://Recharts/./node_modules/core-js/internals/export.js","webpack://Recharts/./node_modules/core-js/internals/fails.js","webpack://Recharts/./node_modules/core-js/internals/get-built-in.js","webpack://Recharts/./node_modules/core-js/internals/global.js","webpack://Recharts/./node_modules/core-js/internals/has.js","webpack://Recharts/./node_modules/core-js/internals/hidden-keys.js","webpack://Recharts/./node_modules/core-js/internals/html.js","webpack://Recharts/./node_modules/core-js/internals/ie8-dom-define.js","webpack://Recharts/./node_modules/core-js/internals/indexed-object.js","webpack://Recharts/./node_modules/core-js/internals/inherit-if-required.js","webpack://Recharts/./node_modules/core-js/internals/inspect-source.js","webpack://Recharts/./node_modules/core-js/internals/internal-state.js","webpack://Recharts/./node_modules/core-js/internals/is-forced.js","webpack://Recharts/./node_modules/core-js/internals/is-integer.js","webpack://Recharts/./node_modules/core-js/internals/is-object.js","webpack://Recharts/./node_modules/core-js/internals/is-pure.js","webpack://Recharts/./node_modules/core-js/internals/math-expm1.js","webpack://Recharts/./node_modules/core-js/internals/math-fround.js","webpack://Recharts/./node_modules/core-js/internals/math-log1p.js","webpack://Recharts/./node_modules/core-js/internals/math-sign.js","webpack://Recharts/./node_modules/core-js/internals/native-symbol.js","webpack://Recharts/./node_modules/core-js/internals/native-weak-map.js","webpack://Recharts/./node_modules/core-js/internals/number-is-finite.js","webpack://Recharts/./node_modules/core-js/internals/number-parse-float.js","webpack://Recharts/./node_modules/core-js/internals/number-parse-int.js","webpack://Recharts/./node_modules/core-js/internals/object-create.js","webpack://Recharts/./node_modules/core-js/internals/object-define-properties.js","webpack://Recharts/./node_modules/core-js/internals/object-define-property.js","webpack://Recharts/./node_modules/core-js/internals/object-get-own-property-descriptor.js","webpack://Recharts/./node_modules/core-js/internals/object-get-own-property-names.js","webpack://Recharts/./node_modules/core-js/internals/object-get-own-property-symbols.js","webpack://Recharts/./node_modules/core-js/internals/object-keys-internal.js","webpack://Recharts/./node_modules/core-js/internals/object-keys.js","webpack://Recharts/./node_modules/core-js/internals/object-property-is-enumerable.js","webpack://Recharts/./node_modules/core-js/internals/object-set-prototype-of.js","webpack://Recharts/./node_modules/core-js/internals/own-keys.js","webpack://Recharts/./node_modules/core-js/internals/path.js","webpack://Recharts/./node_modules/core-js/internals/redefine.js","webpack://Recharts/./node_modules/core-js/internals/require-object-coercible.js","webpack://Recharts/./node_modules/core-js/internals/set-global.js","webpack://Recharts/./node_modules/core-js/internals/set-to-string-tag.js","webpack://Recharts/./node_modules/core-js/internals/shared-key.js","webpack://Recharts/./node_modules/core-js/internals/shared-store.js","webpack://Recharts/./node_modules/core-js/internals/shared.js","webpack://Recharts/./node_modules/core-js/internals/string-repeat.js","webpack://Recharts/./node_modules/core-js/internals/string-trim.js","webpack://Recharts/./node_modules/core-js/internals/this-number-value.js","webpack://Recharts/./node_modules/core-js/internals/to-absolute-index.js","webpack://Recharts/./node_modules/core-js/internals/to-indexed-object.js","webpack://Recharts/./node_modules/core-js/internals/to-integer.js","webpack://Recharts/./node_modules/core-js/internals/to-length.js","webpack://Recharts/./node_modules/core-js/internals/to-primitive.js","webpack://Recharts/./node_modules/core-js/internals/uid.js","webpack://Recharts/./node_modules/core-js/internals/use-symbol-as-uid.js","webpack://Recharts/./node_modules/core-js/internals/well-known-symbol.js","webpack://Recharts/./node_modules/core-js/internals/whitespaces.js","webpack://Recharts/./node_modules/core-js/modules/es.math.acosh.js","webpack://Recharts/./node_modules/core-js/modules/es.math.asinh.js","webpack://Recharts/./node_modules/core-js/modules/es.math.atanh.js","webpack://Recharts/./node_modules/core-js/modules/es.math.cbrt.js","webpack://Recharts/./node_modules/core-js/modules/es.math.clz32.js","webpack://Recharts/./node_modules/core-js/modules/es.math.cosh.js","webpack://Recharts/./node_modules/core-js/modules/es.math.expm1.js","webpack://Recharts/./node_modules/core-js/modules/es.math.fround.js","webpack://Recharts/./node_modules/core-js/modules/es.math.hypot.js","webpack://Recharts/./node_modules/core-js/modules/es.math.imul.js","webpack://Recharts/./node_modules/core-js/modules/es.math.log10.js","webpack://Recharts/./node_modules/core-js/modules/es.math.log1p.js","webpack://Recharts/./node_modules/core-js/modules/es.math.log2.js","webpack://Recharts/./node_modules/core-js/modules/es.math.sign.js","webpack://Recharts/./node_modules/core-js/modules/es.math.sinh.js","webpack://Recharts/./node_modules/core-js/modules/es.math.tanh.js","webpack://Recharts/./node_modules/core-js/modules/es.math.to-string-tag.js","webpack://Recharts/./node_modules/core-js/modules/es.math.trunc.js","webpack://Recharts/./node_modules/core-js/modules/es.number.constructor.js","webpack://Recharts/./node_modules/core-js/modules/es.number.epsilon.js","webpack://Recharts/./node_modules/core-js/modules/es.number.is-finite.js","webpack://Recharts/./node_modules/core-js/modules/es.number.is-integer.js","webpack://Recharts/./node_modules/core-js/modules/es.number.is-nan.js","webpack://Recharts/./node_modules/core-js/modules/es.number.is-safe-integer.js","webpack://Recharts/./node_modules/core-js/modules/es.number.max-safe-integer.js","webpack://Recharts/./node_modules/core-js/modules/es.number.min-safe-integer.js","webpack://Recharts/./node_modules/core-js/modules/es.number.parse-float.js","webpack://Recharts/./node_modules/core-js/modules/es.number.parse-int.js","webpack://Recharts/./node_modules/core-js/modules/es.number.to-fixed.js","webpack://Recharts/./node_modules/core-js/modules/es.number.to-precision.js","webpack://Recharts/./node_modules/css-unit-converter/index.js","webpack://Recharts/./node_modules/d3-array/src/array.js","webpack://Recharts/./node_modules/d3-array/src/ascending.js","webpack://Recharts/./node_modules/d3-array/src/bin.js","webpack://Recharts/./node_modules/d3-array/src/bisect.js","webpack://Recharts/./node_modules/d3-array/src/bisector.js","webpack://Recharts/./node_modules/d3-array/src/constant.js","webpack://Recharts/./node_modules/d3-array/src/count.js","webpack://Recharts/./node_modules/d3-array/src/cross.js","webpack://Recharts/./node_modules/d3-array/src/cumsum.js","webpack://Recharts/./node_modules/d3-array/src/descending.js","webpack://Recharts/./node_modules/d3-array/src/deviation.js","webpack://Recharts/./node_modules/d3-array/src/extent.js","webpack://Recharts/./node_modules/d3-array/src/greatest.js","webpack://Recharts/./node_modules/d3-array/src/greatestIndex.js","webpack://Recharts/./node_modules/d3-array/src/group.js","webpack://Recharts/./node_modules/d3-array/src/identity.js","webpack://Recharts/./node_modules/d3-array/src/index.js","webpack://Recharts/./node_modules/d3-array/src/least.js","webpack://Recharts/./node_modules/d3-array/src/leastIndex.js","webpack://Recharts/./node_modules/d3-array/src/max.js","webpack://Recharts/./node_modules/d3-array/src/maxIndex.js","webpack://Recharts/./node_modules/d3-array/src/mean.js","webpack://Recharts/./node_modules/d3-array/src/median.js","webpack://Recharts/./node_modules/d3-array/src/merge.js","webpack://Recharts/./node_modules/d3-array/src/min.js","webpack://Recharts/./node_modules/d3-array/src/minIndex.js","webpack://Recharts/./node_modules/d3-array/src/number.js","webpack://Recharts/./node_modules/d3-array/src/pairs.js","webpack://Recharts/./node_modules/d3-array/src/permute.js","webpack://Recharts/./node_modules/d3-array/src/quantile.js","webpack://Recharts/./node_modules/d3-array/src/quickselect.js","webpack://Recharts/./node_modules/d3-array/src/range.js","webpack://Recharts/./node_modules/d3-array/src/scan.js","webpack://Recharts/./node_modules/d3-array/src/shuffle.js","webpack://Recharts/./node_modules/d3-array/src/sum.js","webpack://Recharts/./node_modules/d3-array/src/threshold/freedmanDiaconis.js","webpack://Recharts/./node_modules/d3-array/src/threshold/scott.js","webpack://Recharts/./node_modules/d3-array/src/threshold/sturges.js","webpack://Recharts/./node_modules/d3-array/src/ticks.js","webpack://Recharts/./node_modules/d3-array/src/transpose.js","webpack://Recharts/./node_modules/d3-array/src/variance.js","webpack://Recharts/./node_modules/d3-array/src/zip.js","webpack://Recharts/./node_modules/d3-color/src/color.js","webpack://Recharts/./node_modules/d3-color/src/cubehelix.js","webpack://Recharts/./node_modules/d3-color/src/define.js","webpack://Recharts/./node_modules/d3-color/src/index.js","webpack://Recharts/./node_modules/d3-color/src/lab.js","webpack://Recharts/./node_modules/d3-color/src/math.js","webpack://Recharts/./node_modules/d3-format/src/defaultLocale.js","webpack://Recharts/./node_modules/d3-format/src/exponent.js","webpack://Recharts/./node_modules/d3-format/src/formatDecimal.js","webpack://Recharts/./node_modules/d3-format/src/formatGroup.js","webpack://Recharts/./node_modules/d3-format/src/formatNumerals.js","webpack://Recharts/./node_modules/d3-format/src/formatPrefixAuto.js","webpack://Recharts/./node_modules/d3-format/src/formatRounded.js","webpack://Recharts/./node_modules/d3-format/src/formatSpecifier.js","webpack://Recharts/./node_modules/d3-format/src/formatTrim.js","webpack://Recharts/./node_modules/d3-format/src/formatTypes.js","webpack://Recharts/./node_modules/d3-format/src/identity.js","webpack://Recharts/./node_modules/d3-format/src/index.js","webpack://Recharts/./node_modules/d3-format/src/locale.js","webpack://Recharts/./node_modules/d3-format/src/precisionFixed.js","webpack://Recharts/./node_modules/d3-format/src/precisionPrefix.js","webpack://Recharts/./node_modules/d3-format/src/precisionRound.js","webpack://Recharts/./node_modules/d3-interpolate/src/array.js","webpack://Recharts/./node_modules/d3-interpolate/src/basis.js","webpack://Recharts/./node_modules/d3-interpolate/src/basisClosed.js","webpack://Recharts/./node_modules/d3-interpolate/src/color.js","webpack://Recharts/./node_modules/d3-interpolate/src/constant.js","webpack://Recharts/./node_modules/d3-interpolate/src/cubehelix.js","webpack://Recharts/./node_modules/d3-interpolate/src/date.js","webpack://Recharts/./node_modules/d3-interpolate/src/discrete.js","webpack://Recharts/./node_modules/d3-interpolate/src/hcl.js","webpack://Recharts/./node_modules/d3-interpolate/src/hsl.js","webpack://Recharts/./node_modules/d3-interpolate/src/hue.js","webpack://Recharts/./node_modules/d3-interpolate/src/index.js","webpack://Recharts/./node_modules/d3-interpolate/src/lab.js","webpack://Recharts/./node_modules/d3-interpolate/src/number.js","webpack://Recharts/./node_modules/d3-interpolate/src/numberArray.js","webpack://Recharts/./node_modules/d3-interpolate/src/object.js","webpack://Recharts/./node_modules/d3-interpolate/src/piecewise.js","webpack://Recharts/./node_modules/d3-interpolate/src/quantize.js","webpack://Recharts/./node_modules/d3-interpolate/src/rgb.js","webpack://Recharts/./node_modules/d3-interpolate/src/round.js","webpack://Recharts/./node_modules/d3-interpolate/src/string.js","webpack://Recharts/./node_modules/d3-interpolate/src/transform/decompose.js","webpack://Recharts/./node_modules/d3-interpolate/src/transform/index.js","webpack://Recharts/./node_modules/d3-interpolate/src/transform/parse.js","webpack://Recharts/./node_modules/d3-interpolate/src/value.js","webpack://Recharts/./node_modules/d3-interpolate/src/zoom.js","webpack://Recharts/./node_modules/d3-path/src/index.js","webpack://Recharts/./node_modules/d3-path/src/path.js","webpack://Recharts/./node_modules/d3-scale/src/band.js","webpack://Recharts/./node_modules/d3-scale/src/constant.js","webpack://Recharts/./node_modules/d3-scale/src/continuous.js","webpack://Recharts/./node_modules/d3-scale/src/diverging.js","webpack://Recharts/./node_modules/d3-scale/src/identity.js","webpack://Recharts/./node_modules/d3-scale/src/index.js","webpack://Recharts/./node_modules/d3-scale/src/init.js","webpack://Recharts/./node_modules/d3-scale/src/linear.js","webpack://Recharts/./node_modules/d3-scale/src/log.js","webpack://Recharts/./node_modules/d3-scale/src/nice.js","webpack://Recharts/./node_modules/d3-scale/src/number.js","webpack://Recharts/./node_modules/d3-scale/src/ordinal.js","webpack://Recharts/./node_modules/d3-scale/src/pow.js","webpack://Recharts/./node_modules/d3-scale/src/quantile.js","webpack://Recharts/./node_modules/d3-scale/src/quantize.js","webpack://Recharts/./node_modules/d3-scale/src/radial.js","webpack://Recharts/./node_modules/d3-scale/src/sequential.js","webpack://Recharts/./node_modules/d3-scale/src/sequentialQuantile.js","webpack://Recharts/./node_modules/d3-scale/src/symlog.js","webpack://Recharts/./node_modules/d3-scale/src/threshold.js","webpack://Recharts/./node_modules/d3-scale/src/tickFormat.js","webpack://Recharts/./node_modules/d3-scale/src/time.js","webpack://Recharts/./node_modules/d3-scale/src/utcTime.js","webpack://Recharts/./node_modules/d3-shape/src/arc.js","webpack://Recharts/./node_modules/d3-shape/src/area.js","webpack://Recharts/./node_modules/d3-shape/src/areaRadial.js","webpack://Recharts/./node_modules/d3-shape/src/array.js","webpack://Recharts/./node_modules/d3-shape/src/constant.js","webpack://Recharts/./node_modules/d3-shape/src/curve/basis.js","webpack://Recharts/./node_modules/d3-shape/src/curve/basisClosed.js","webpack://Recharts/./node_modules/d3-shape/src/curve/basisOpen.js","webpack://Recharts/./node_modules/d3-shape/src/curve/bundle.js","webpack://Recharts/./node_modules/d3-shape/src/curve/cardinal.js","webpack://Recharts/./node_modules/d3-shape/src/curve/cardinalClosed.js","webpack://Recharts/./node_modules/d3-shape/src/curve/cardinalOpen.js","webpack://Recharts/./node_modules/d3-shape/src/curve/catmullRom.js","webpack://Recharts/./node_modules/d3-shape/src/curve/catmullRomClosed.js","webpack://Recharts/./node_modules/d3-shape/src/curve/catmullRomOpen.js","webpack://Recharts/./node_modules/d3-shape/src/curve/linear.js","webpack://Recharts/./node_modules/d3-shape/src/curve/linearClosed.js","webpack://Recharts/./node_modules/d3-shape/src/curve/monotone.js","webpack://Recharts/./node_modules/d3-shape/src/curve/natural.js","webpack://Recharts/./node_modules/d3-shape/src/curve/radial.js","webpack://Recharts/./node_modules/d3-shape/src/curve/step.js","webpack://Recharts/./node_modules/d3-shape/src/descending.js","webpack://Recharts/./node_modules/d3-shape/src/identity.js","webpack://Recharts/./node_modules/d3-shape/src/index.js","webpack://Recharts/./node_modules/d3-shape/src/line.js","webpack://Recharts/./node_modules/d3-shape/src/lineRadial.js","webpack://Recharts/./node_modules/d3-shape/src/link/index.js","webpack://Recharts/./node_modules/d3-shape/src/math.js","webpack://Recharts/./node_modules/d3-shape/src/noop.js","webpack://Recharts/./node_modules/d3-shape/src/offset/diverging.js","webpack://Recharts/./node_modules/d3-shape/src/offset/expand.js","webpack://Recharts/./node_modules/d3-shape/src/offset/none.js","webpack://Recharts/./node_modules/d3-shape/src/offset/silhouette.js","webpack://Recharts/./node_modules/d3-shape/src/offset/wiggle.js","webpack://Recharts/./node_modules/d3-shape/src/order/appearance.js","webpack://Recharts/./node_modules/d3-shape/src/order/ascending.js","webpack://Recharts/./node_modules/d3-shape/src/order/descending.js","webpack://Recharts/./node_modules/d3-shape/src/order/insideOut.js","webpack://Recharts/./node_modules/d3-shape/src/order/none.js","webpack://Recharts/./node_modules/d3-shape/src/order/reverse.js","webpack://Recharts/./node_modules/d3-shape/src/pie.js","webpack://Recharts/./node_modules/d3-shape/src/point.js","webpack://Recharts/./node_modules/d3-shape/src/pointRadial.js","webpack://Recharts/./node_modules/d3-shape/src/stack.js","webpack://Recharts/./node_modules/d3-shape/src/symbol.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/circle.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/cross.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/diamond.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/square.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/star.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/triangle.js","webpack://Recharts/./node_modules/d3-shape/src/symbol/wye.js","webpack://Recharts/./node_modules/d3-time-format/src/defaultLocale.js","webpack://Recharts/./node_modules/d3-time-format/src/index.js","webpack://Recharts/./node_modules/d3-time-format/src/isoFormat.js","webpack://Recharts/./node_modules/d3-time-format/src/isoParse.js","webpack://Recharts/./node_modules/d3-time-format/src/locale.js","webpack://Recharts/./node_modules/d3-time/src/day.js","webpack://Recharts/./node_modules/d3-time/src/duration.js","webpack://Recharts/./node_modules/d3-time/src/hour.js","webpack://Recharts/./node_modules/d3-time/src/index.js","webpack://Recharts/./node_modules/d3-time/src/interval.js","webpack://Recharts/./node_modules/d3-time/src/millisecond.js","webpack://Recharts/./node_modules/d3-time/src/minute.js","webpack://Recharts/./node_modules/d3-time/src/month.js","webpack://Recharts/./node_modules/d3-time/src/second.js","webpack://Recharts/./node_modules/d3-time/src/utcDay.js","webpack://Recharts/./node_modules/d3-time/src/utcHour.js","webpack://Recharts/./node_modules/d3-time/src/utcMinute.js","webpack://Recharts/./node_modules/d3-time/src/utcMonth.js","webpack://Recharts/./node_modules/d3-time/src/utcWeek.js","webpack://Recharts/./node_modules/d3-time/src/utcYear.js","webpack://Recharts/./node_modules/d3-time/src/week.js","webpack://Recharts/./node_modules/d3-time/src/year.js","webpack://Recharts/./node_modules/decimal.js-light/decimal.js","webpack://Recharts/./node_modules/dom-helpers/class/addClass.js","webpack://Recharts/./node_modules/dom-helpers/class/hasClass.js","webpack://Recharts/./node_modules/dom-helpers/class/removeClass.js","webpack://Recharts/./node_modules/eventemitter3/index.js","webpack://Recharts/./node_modules/lodash-es/_Symbol.js","webpack://Recharts/./node_modules/lodash-es/_baseGetTag.js","webpack://Recharts/./node_modules/lodash-es/_freeGlobal.js","webpack://Recharts/./node_modules/lodash-es/_getRawTag.js","webpack://Recharts/./node_modules/lodash-es/_objectToString.js","webpack://Recharts/./node_modules/lodash-es/_root.js","webpack://Recharts/./node_modules/lodash-es/debounce.js","webpack://Recharts/./node_modules/lodash-es/isObject.js","webpack://Recharts/./node_modules/lodash-es/isObjectLike.js","webpack://Recharts/./node_modules/lodash-es/isSymbol.js","webpack://Recharts/./node_modules/lodash-es/now.js","webpack://Recharts/./node_modules/lodash-es/throttle.js","webpack://Recharts/./node_modules/lodash-es/toNumber.js","webpack://Recharts/./node_modules/lodash/_DataView.js","webpack://Recharts/./node_modules/lodash/_Hash.js","webpack://Recharts/./node_modules/lodash/_ListCache.js","webpack://Recharts/./node_modules/lodash/_Map.js","webpack://Recharts/./node_modules/lodash/_MapCache.js","webpack://Recharts/./node_modules/lodash/_Promise.js","webpack://Recharts/./node_modules/lodash/_Set.js","webpack://Recharts/./node_modules/lodash/_SetCache.js","webpack://Recharts/./node_modules/lodash/_Stack.js","webpack://Recharts/./node_modules/lodash/_Symbol.js","webpack://Recharts/./node_modules/lodash/_Uint8Array.js","webpack://Recharts/./node_modules/lodash/_WeakMap.js","webpack://Recharts/./node_modules/lodash/_apply.js","webpack://Recharts/./node_modules/lodash/_arrayFilter.js","webpack://Recharts/./node_modules/lodash/_arrayIncludes.js","webpack://Recharts/./node_modules/lodash/_arrayIncludesWith.js","webpack://Recharts/./node_modules/lodash/_arrayLikeKeys.js","webpack://Recharts/./node_modules/lodash/_arrayMap.js","webpack://Recharts/./node_modules/lodash/_arrayPush.js","webpack://Recharts/./node_modules/lodash/_arraySome.js","webpack://Recharts/./node_modules/lodash/_assocIndexOf.js","webpack://Recharts/./node_modules/lodash/_baseEach.js","webpack://Recharts/./node_modules/lodash/_baseFilter.js","webpack://Recharts/./node_modules/lodash/_baseFindIndex.js","webpack://Recharts/./node_modules/lodash/_baseFor.js","webpack://Recharts/./node_modules/lodash/_baseForOwn.js","webpack://Recharts/./node_modules/lodash/_baseGet.js","webpack://Recharts/./node_modules/lodash/_baseGetAllKeys.js","webpack://Recharts/./node_modules/lodash/_baseGetTag.js","webpack://Recharts/./node_modules/lodash/_baseHasIn.js","webpack://Recharts/./node_modules/lodash/_baseIndexOf.js","webpack://Recharts/./node_modules/lodash/_baseIntersection.js","webpack://Recharts/./node_modules/lodash/_baseIsArguments.js","webpack://Recharts/./node_modules/lodash/_baseIsEqual.js","webpack://Recharts/./node_modules/lodash/_baseIsEqualDeep.js","webpack://Recharts/./node_modules/lodash/_baseIsMatch.js","webpack://Recharts/./node_modules/lodash/_baseIsNaN.js","webpack://Recharts/./node_modules/lodash/_baseIsNative.js","webpack://Recharts/./node_modules/lodash/_baseIsTypedArray.js","webpack://Recharts/./node_modules/lodash/_baseIteratee.js","webpack://Recharts/./node_modules/lodash/_baseKeys.js","webpack://Recharts/./node_modules/lodash/_baseMatches.js","webpack://Recharts/./node_modules/lodash/_baseMatchesProperty.js","webpack://Recharts/./node_modules/lodash/_baseProperty.js","webpack://Recharts/./node_modules/lodash/_basePropertyDeep.js","webpack://Recharts/./node_modules/lodash/_baseRest.js","webpack://Recharts/./node_modules/lodash/_baseSetToString.js","webpack://Recharts/./node_modules/lodash/_baseTimes.js","webpack://Recharts/./node_modules/lodash/_baseToString.js","webpack://Recharts/./node_modules/lodash/_baseUnary.js","webpack://Recharts/./node_modules/lodash/_cacheHas.js","webpack://Recharts/./node_modules/lodash/_castArrayLikeObject.js","webpack://Recharts/./node_modules/lodash/_castPath.js","webpack://Recharts/./node_modules/lodash/_coreJsData.js","webpack://Recharts/./node_modules/lodash/_createBaseEach.js","webpack://Recharts/./node_modules/lodash/_createBaseFor.js","webpack://Recharts/./node_modules/lodash/_defineProperty.js","webpack://Recharts/./node_modules/lodash/_equalArrays.js","webpack://Recharts/./node_modules/lodash/_equalByTag.js","webpack://Recharts/./node_modules/lodash/_equalObjects.js","webpack://Recharts/./node_modules/lodash/_freeGlobal.js","webpack://Recharts/./node_modules/lodash/_getAllKeys.js","webpack://Recharts/./node_modules/lodash/_getMapData.js","webpack://Recharts/./node_modules/lodash/_getMatchData.js","webpack://Recharts/./node_modules/lodash/_getNative.js","webpack://Recharts/./node_modules/lodash/_getRawTag.js","webpack://Recharts/./node_modules/lodash/_getSymbols.js","webpack://Recharts/./node_modules/lodash/_getTag.js","webpack://Recharts/./node_modules/lodash/_getValue.js","webpack://Recharts/./node_modules/lodash/_hasPath.js","webpack://Recharts/./node_modules/lodash/_hashClear.js","webpack://Recharts/./node_modules/lodash/_hashDelete.js","webpack://Recharts/./node_modules/lodash/_hashGet.js","webpack://Recharts/./node_modules/lodash/_hashHas.js","webpack://Recharts/./node_modules/lodash/_hashSet.js","webpack://Recharts/./node_modules/lodash/_isIndex.js","webpack://Recharts/./node_modules/lodash/_isKey.js","webpack://Recharts/./node_modules/lodash/_isKeyable.js","webpack://Recharts/./node_modules/lodash/_isMasked.js","webpack://Recharts/./node_modules/lodash/_isPrototype.js","webpack://Recharts/./node_modules/lodash/_isStrictComparable.js","webpack://Recharts/./node_modules/lodash/_listCacheClear.js","webpack://Recharts/./node_modules/lodash/_listCacheDelete.js","webpack://Recharts/./node_modules/lodash/_listCacheGet.js","webpack://Recharts/./node_modules/lodash/_listCacheHas.js","webpack://Recharts/./node_modules/lodash/_listCacheSet.js","webpack://Recharts/./node_modules/lodash/_mapCacheClear.js","webpack://Recharts/./node_modules/lodash/_mapCacheDelete.js","webpack://Recharts/./node_modules/lodash/_mapCacheGet.js","webpack://Recharts/./node_modules/lodash/_mapCacheHas.js","webpack://Recharts/./node_modules/lodash/_mapCacheSet.js","webpack://Recharts/./node_modules/lodash/_mapToArray.js","webpack://Recharts/./node_modules/lodash/_matchesStrictComparable.js","webpack://Recharts/./node_modules/lodash/_memoizeCapped.js","webpack://Recharts/./node_modules/lodash/_nativeCreate.js","webpack://Recharts/./node_modules/lodash/_nativeKeys.js","webpack://Recharts/./node_modules/lodash/_nodeUtil.js","webpack://Recharts/./node_modules/lodash/_objectToString.js","webpack://Recharts/./node_modules/lodash/_overArg.js","webpack://Recharts/./node_modules/lodash/_overRest.js","webpack://Recharts/./node_modules/lodash/_root.js","webpack://Recharts/./node_modules/lodash/_setCacheAdd.js","webpack://Recharts/./node_modules/lodash/_setCacheHas.js","webpack://Recharts/./node_modules/lodash/_setToArray.js","webpack://Recharts/./node_modules/lodash/_setToString.js","webpack://Recharts/./node_modules/lodash/_shortOut.js","webpack://Recharts/./node_modules/lodash/_stackClear.js","webpack://Recharts/./node_modules/lodash/_stackDelete.js","webpack://Recharts/./node_modules/lodash/_stackGet.js","webpack://Recharts/./node_modules/lodash/_stackHas.js","webpack://Recharts/./node_modules/lodash/_stackSet.js","webpack://Recharts/./node_modules/lodash/_strictIndexOf.js","webpack://Recharts/./node_modules/lodash/_stringToPath.js","webpack://Recharts/./node_modules/lodash/_toKey.js","webpack://Recharts/./node_modules/lodash/_toSource.js","webpack://Recharts/./node_modules/lodash/constant.js","webpack://Recharts/./node_modules/lodash/eq.js","webpack://Recharts/./node_modules/lodash/filter.js","webpack://Recharts/./node_modules/lodash/get.js","webpack://Recharts/./node_modules/lodash/hasIn.js","webpack://Recharts/./node_modules/lodash/identity.js","webpack://Recharts/./node_modules/lodash/intersection.js","webpack://Recharts/./node_modules/lodash/isArguments.js","webpack://Recharts/./node_modules/lodash/isArray.js","webpack://Recharts/./node_modules/lodash/isArrayLike.js","webpack://Recharts/./node_modules/lodash/isArrayLikeObject.js","webpack://Recharts/./node_modules/lodash/isBuffer.js","webpack://Recharts/./node_modules/lodash/isEqual.js","webpack://Recharts/./node_modules/lodash/isFunction.js","webpack://Recharts/./node_modules/lodash/isLength.js","webpack://Recharts/./node_modules/lodash/isNumber.js","webpack://Recharts/./node_modules/lodash/isObject.js","webpack://Recharts/./node_modules/lodash/isObjectLike.js","webpack://Recharts/./node_modules/lodash/isSymbol.js","webpack://Recharts/./node_modules/lodash/isTypedArray.js","webpack://Recharts/./node_modules/lodash/keys.js","webpack://Recharts/./node_modules/lodash/lodash.js","webpack://Recharts/./node_modules/lodash/memoize.js","webpack://Recharts/./node_modules/lodash/property.js","webpack://Recharts/./node_modules/lodash/stubArray.js","webpack://Recharts/./node_modules/lodash/stubFalse.js","webpack://Recharts/./node_modules/lodash/toString.js","webpack://Recharts/./node_modules/performance-now/lib/performance-now.js","webpack://Recharts/./node_modules/postcss-value-parser/lib/index.js","webpack://Recharts/./node_modules/postcss-value-parser/lib/parse.js","webpack://Recharts/./node_modules/postcss-value-parser/lib/stringify.js","webpack://Recharts/./node_modules/postcss-value-parser/lib/unit.js","webpack://Recharts/./node_modules/postcss-value-parser/lib/walk.js","webpack://Recharts/./node_modules/process/browser.js","webpack://Recharts/./node_modules/raf-schd/dist/raf-schd.esm.js","webpack://Recharts/./node_modules/raf/index.js","webpack://Recharts/./node_modules/react-lifecycles-compat/react-lifecycles-compat.es.js","webpack://Recharts/./node_modules/react-resize-detector/lib/esm/components/ChildWrapper.js","webpack://Recharts/./node_modules/react-resize-detector/lib/esm/components/ResizeDetector.js","webpack://Recharts/./node_modules/react-resize-detector/lib/esm/hoc/withResizeDetector.js","webpack://Recharts/./node_modules/react-resize-detector/lib/esm/index.js","webpack://Recharts/./node_modules/react-resize-detector/lib/esm/lib/utils.js","webpack://Recharts/./node_modules/react-smooth/es6/Animate.js","webpack://Recharts/./node_modules/react-smooth/es6/AnimateGroup.js","webpack://Recharts/./node_modules/react-smooth/es6/AnimateGroupChild.js","webpack://Recharts/./node_modules/react-smooth/es6/AnimateManager.js","webpack://Recharts/./node_modules/react-smooth/es6/configUpdate.js","webpack://Recharts/./node_modules/react-smooth/es6/easing.js","webpack://Recharts/./node_modules/react-smooth/es6/index.js","webpack://Recharts/./node_modules/react-smooth/es6/setRafTimeout.js","webpack://Recharts/./node_modules/react-smooth/es6/util.js","webpack://Recharts/./node_modules/react-transition-group/CSSTransition.js","webpack://Recharts/./node_modules/react-transition-group/ReplaceTransition.js","webpack://Recharts/./node_modules/react-transition-group/Transition.js","webpack://Recharts/./node_modules/react-transition-group/TransitionGroup.js","webpack://Recharts/./node_modules/react-transition-group/index.js","webpack://Recharts/./node_modules/react-transition-group/utils/ChildMapping.js","webpack://Recharts/./node_modules/react-transition-group/utils/PropTypes.js","webpack://Recharts/./node_modules/recharts-scale/lib/getNiceTickValues.js","webpack://Recharts/./node_modules/recharts-scale/lib/index.js","webpack://Recharts/./node_modules/recharts-scale/lib/util/arithmetic.js","webpack://Recharts/./node_modules/recharts-scale/lib/util/utils.js","webpack://Recharts/./node_modules/reduce-css-calc/dist/index.js","webpack://Recharts/./node_modules/reduce-css-calc/dist/lib/convert.js","webpack://Recharts/./node_modules/reduce-css-calc/dist/lib/reducer.js","webpack://Recharts/./node_modules/reduce-css-calc/dist/lib/stringifier.js","webpack://Recharts/./node_modules/reduce-css-calc/dist/parser.js","webpack://Recharts/./node_modules/resize-observer-polyfill/dist/ResizeObserver.es.js","webpack://Recharts/(webpack)/buildin/global.js","webpack://Recharts/(webpack)/buildin/module.js","webpack://Recharts/./src/cartesian/Area.tsx","webpack://Recharts/./src/cartesian/Bar.tsx","webpack://Recharts/./src/cartesian/Brush.tsx","webpack://Recharts/./src/cartesian/CartesianAxis.tsx","webpack://Recharts/./src/cartesian/CartesianGrid.tsx","webpack://Recharts/./src/cartesian/ErrorBar.tsx","webpack://Recharts/./src/cartesian/Line.tsx","webpack://Recharts/./src/cartesian/ReferenceArea.tsx","webpack://Recharts/./src/cartesian/ReferenceDot.tsx","webpack://Recharts/./src/cartesian/ReferenceLine.tsx","webpack://Recharts/./src/cartesian/Scatter.tsx","webpack://Recharts/./src/cartesian/XAxis.tsx","webpack://Recharts/./src/cartesian/YAxis.tsx","webpack://Recharts/./src/cartesian/ZAxis.tsx","webpack://Recharts/./src/chart/AreaChart.tsx","webpack://Recharts/./src/chart/BarChart.tsx","webpack://Recharts/./src/chart/ComposedChart.tsx","webpack://Recharts/./src/chart/FunnelChart.tsx","webpack://Recharts/./src/chart/LineChart.tsx","webpack://Recharts/./src/chart/PieChart.tsx","webpack://Recharts/./src/chart/RadarChart.tsx","webpack://Recharts/./src/chart/RadialBarChart.tsx","webpack://Recharts/./src/chart/Sankey.tsx","webpack://Recharts/./src/chart/ScatterChart.tsx","webpack://Recharts/./src/chart/Treemap.tsx","webpack://Recharts/./src/chart/generateCategoricalChart.tsx","webpack://Recharts/./src/component/Cell.tsx","webpack://Recharts/./src/component/Customized.tsx","webpack://Recharts/./src/component/DefaultLegendContent.tsx","webpack://Recharts/./src/component/DefaultTooltipContent.tsx","webpack://Recharts/./src/component/Label.tsx","webpack://Recharts/./src/component/LabelList.tsx","webpack://Recharts/./src/component/Legend.tsx","webpack://Recharts/./src/component/ResponsiveContainer.tsx","webpack://Recharts/./src/component/Text.tsx","webpack://Recharts/./src/component/Tooltip.tsx","webpack://Recharts/./src/container/Layer.tsx","webpack://Recharts/./src/container/Surface.tsx","webpack://Recharts/./src/index.ts","webpack://Recharts/./src/numberAxis/Funnel.tsx","webpack://Recharts/./src/polar/Pie.tsx","webpack://Recharts/./src/polar/PolarAngleAxis.tsx","webpack://Recharts/./src/polar/PolarGrid.tsx","webpack://Recharts/./src/polar/PolarRadiusAxis.tsx","webpack://Recharts/./src/polar/Radar.tsx","webpack://Recharts/./src/polar/RadialBar.tsx","webpack://Recharts/./src/polyfill.ts","webpack://Recharts/./src/shape/Cross.tsx","webpack://Recharts/./src/shape/Curve.tsx","webpack://Recharts/./src/shape/Dot.tsx","webpack://Recharts/./src/shape/Polygon.tsx","webpack://Recharts/./src/shape/Rectangle.tsx","webpack://Recharts/./src/shape/Sector.tsx","webpack://Recharts/./src/shape/Symbols.tsx","webpack://Recharts/./src/shape/Trapezoid.tsx","webpack://Recharts/./src/util/CartesianUtils.ts","webpack://Recharts/./src/util/ChartUtils.ts","webpack://Recharts/./src/util/Constants.ts","webpack://Recharts/./src/util/CssPrefixUtils.ts","webpack://Recharts/./src/util/DOMUtils.ts","webpack://Recharts/./src/util/DataUtils.ts","webpack://Recharts/./src/util/DetectReferenceElementsDomain.ts","webpack://Recharts/./src/util/Events.ts","webpack://Recharts/./src/util/Global.ts","webpack://Recharts/./src/util/IfOverflowMatches.ts","webpack://Recharts/./src/util/LogUtils.ts","webpack://Recharts/./src/util/PolarUtils.ts","webpack://Recharts/./src/util/ReactUtils.ts","webpack://Recharts/./src/util/ShallowEqual.ts","webpack://Recharts/./src/util/types.ts","webpack://Recharts/external {\"root\":\"PropTypes\",\"commonjs2\":\"prop-types\",\"commonjs\":\"prop-types\",\"amd\":\"prop-types\"}","webpack://Recharts/external {\"root\":\"React\",\"commonjs2\":\"react\",\"commonjs\":\"react\",\"amd\":\"react\"}","webpack://Recharts/external {\"root\":\"ReactDOM\",\"commonjs2\":\"react-dom\",\"commonjs\":\"react-dom\",\"amd\":\"react-dom\"}"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,O;QCVA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;;QAEA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;;;QAGA;QACA;;QAEA;QACA;;QAEA;QACA;QACA;QACA,0CAA0C,gCAAgC;QAC1E;QACA;;QAEA;QACA;QACA;QACA,wDAAwD,kBAAkB;QAC1E;QACA,iDAAiD,cAAc;QAC/D;;QAEA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA,yCAAyC,iCAAiC;QAC1E,gHAAgH,mBAAmB,EAAE;QACrI;QACA;;QAEA;QACA;QACA;QACA,2BAA2B,0BAA0B,EAAE;QACvD,iCAAiC,eAAe;QAChD;QACA;QACA;;QAEA;QACA,sDAAsD,+DAA+D;;QAErH;QACA;;;QAGA;QACA;;;;;;;;;;;;AClFA;AACA;AACA;AACA;AACA;;AAEA,wC;;;;;;;;;;;ACNA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,gBAAgB;;AAEhB;AACA;;AAEA,iBAAiB,sBAAsB;AACvC;AACA;;AAEA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,KAAK,KAA6B;AAClC;AACA;AACA,EAAE,UAAU,IAA4E;AACxF;AACA,EAAE,iCAAqB,EAAE,mCAAE;AAC3B;AACA,GAAG;AAAA,oGAAC;AACJ,EAAE,MAAM,EAEN;AACF,CAAC;;;;;;;;;;;;ACnDD,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,sFAA8B;AACtC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,oFAA6B;AACrC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,kFAA4B;AACpC,mBAAO,CAAC,oGAAqC;AAC7C,mBAAO,CAAC,oFAA6B;AACrC,WAAW,mBAAO,CAAC,sEAAsB;;AAEzC;;;;;;;;;;;;ACpBA,mBAAO,CAAC,oGAAqC;AAC7C,mBAAO,CAAC,4FAAiC;AACzC,mBAAO,CAAC,gGAAmC;AAC3C,mBAAO,CAAC,kGAAoC;AAC5C,mBAAO,CAAC,0FAAgC;AACxC,mBAAO,CAAC,4GAAyC;AACjD,mBAAO,CAAC,8GAA0C;AAClD,mBAAO,CAAC,8GAA0C;AAClD,mBAAO,CAAC,oGAAqC;AAC7C,mBAAO,CAAC,gGAAmC;AAC3C,mBAAO,CAAC,8FAAkC;AAC1C,mBAAO,CAAC,sGAAsC;AAC9C,WAAW,mBAAO,CAAC,sEAAsB;;AAEzC;;;;;;;;;;;;ACdA,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;AACA;AACA;AACA,GAAG;AACH;;;;;;;;;;;;ACNA,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;AACA;AACA;AACA,GAAG;AACH;;;;;;;;;;;;ACNA,sBAAsB,mBAAO,CAAC,6FAAgC;AAC9D,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,sBAAsB,mBAAO,CAAC,6FAAgC;;AAE9D,qBAAqB,oBAAoB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,YAAY,eAAe;AAChC;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC/BA,iBAAiB;;AAEjB;AACA;AACA;;;;;;;;;;;;ACJA,UAAU,mBAAO,CAAC,iEAAkB;AACpC,cAAc,mBAAO,CAAC,2EAAuB;AAC7C,qCAAqC,mBAAO,CAAC,+HAAiD;AAC9F,2BAA2B,mBAAO,CAAC,uGAAqC;;AAExE;AACA;AACA;AACA;AACA,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;;;;;;;;;;;;ACbA,kBAAkB,mBAAO,CAAC,iFAA0B;AACpD,2BAA2B,mBAAO,CAAC,uGAAqC;AACxE,+BAA+B,mBAAO,CAAC,+GAAyC;;AAEhF;AACA;AACA,CAAC;AACD;AACA;AACA;;;;;;;;;;;;ACTA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACPA,YAAY,mBAAO,CAAC,qEAAoB;;AAExC;AACA;AACA,iCAAiC,MAAM,mBAAmB,UAAU,EAAE,EAAE;AACxE,CAAC;;;;;;;;;;;;ACLD,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACTA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACTA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,+BAA+B,mBAAO,CAAC,+HAAiD;AACxF,kCAAkC,mBAAO,CAAC,uHAA6C;AACvF,eAAe,mBAAO,CAAC,2EAAuB;AAC9C,gBAAgB,mBAAO,CAAC,+EAAyB;AACjD,gCAAgC,mBAAO,CAAC,iHAA0C;AAClF,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,mDAAmD;AACnD,GAAG;AACH,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACrDA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;;;;;;;;;;;ACNA,WAAW,mBAAO,CAAC,mEAAmB;AACtC,aAAa,mBAAO,CAAC,uEAAqB;;AAE1C;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;ACVA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACZA,uBAAuB;;AAEvB;AACA;AACA;;;;;;;;;;;;ACJA;;;;;;;;;;;;ACAA,iBAAiB,mBAAO,CAAC,mFAA2B;;AAEpD;;;;;;;;;;;;ACFA,kBAAkB,mBAAO,CAAC,iFAA0B;AACpD,YAAY,mBAAO,CAAC,qEAAoB;AACxC,oBAAoB,mBAAO,CAAC,yGAAsC;;AAElE;AACA;AACA;AACA,sBAAsB,UAAU;AAChC,GAAG;AACH,CAAC;;;;;;;;;;;;ACTD,YAAY,mBAAO,CAAC,qEAAoB;AACxC,cAAc,mBAAO,CAAC,iFAA0B;;AAEhD;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA,CAAC;;;;;;;;;;;;ACZD,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,qBAAqB,mBAAO,CAAC,yGAAsC;;AAEnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AChBA,YAAY,mBAAO,CAAC,mFAA2B;;AAE/C;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACXA,sBAAsB,mBAAO,CAAC,yFAA8B;AAC5D,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,kCAAkC,mBAAO,CAAC,uHAA6C;AACvF,gBAAgB,mBAAO,CAAC,iEAAkB;AAC1C,gBAAgB,mBAAO,CAAC,+EAAyB;AACjD,iBAAiB,mBAAO,CAAC,iFAA0B;;AAEnD;AACA;;AAEA;AACA,uCAAuC;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC5DA,YAAY,mBAAO,CAAC,qEAAoB;;AAExC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACRA;AACA;AACA;;;;;;;;;;;;ACFA;;;;;;;;;;;;ACAA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACZD,WAAW,mBAAO,CAAC,6EAAwB;;AAE3C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzBA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACNA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACLA,YAAY,mBAAO,CAAC,qEAAoB;;AAExC;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACND,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,oBAAoB,mBAAO,CAAC,uFAA6B;;AAEzD;;AAEA;;;;;;;;;;;;ACLA,aAAa,mBAAO,CAAC,uEAAqB;;AAE1C;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACRA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,WAAW,mBAAO,CAAC,iFAA0B;AAC7C,kBAAkB,mBAAO,CAAC,iFAA0B;;AAEpD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACbD,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,WAAW,mBAAO,CAAC,iFAA0B;AAC7C,kBAAkB,mBAAO,CAAC,iFAA0B;;AAEpD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACbD,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,uBAAuB,mBAAO,CAAC,2GAAuC;AACtE,kBAAkB,mBAAO,CAAC,qFAA4B;AACtD,iBAAiB,mBAAO,CAAC,iFAA0B;AACnD,WAAW,mBAAO,CAAC,mEAAmB;AACtC,4BAA4B,mBAAO,CAAC,yGAAsC;AAC1E,gBAAgB,mBAAO,CAAC,+EAAyB;;AAEjD;AACA;AACA;AACA;AACA;;AAEA,oCAAoC;;AAEpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,gBAAgB;AACnB;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;;;;;;;;;;;AC7EA,kBAAkB,mBAAO,CAAC,iFAA0B;AACpD,2BAA2B,mBAAO,CAAC,uGAAqC;AACxE,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,iBAAiB,mBAAO,CAAC,iFAA0B;;AAEnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACfA,kBAAkB,mBAAO,CAAC,iFAA0B;AACpD,qBAAqB,mBAAO,CAAC,uFAA6B;AAC1D,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,kBAAkB,mBAAO,CAAC,mFAA2B;;AAErD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,gBAAgB;AACnB;AACA;AACA;AACA;;;;;;;;;;;;ACnBA,kBAAkB,mBAAO,CAAC,iFAA0B;AACpD,iCAAiC,mBAAO,CAAC,qHAA4C;AACrF,+BAA+B,mBAAO,CAAC,+GAAyC;AAChF,sBAAsB,mBAAO,CAAC,6FAAgC;AAC9D,kBAAkB,mBAAO,CAAC,mFAA2B;AACrD,UAAU,mBAAO,CAAC,iEAAkB;AACpC,qBAAqB,mBAAO,CAAC,uFAA6B;;AAE1D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,gBAAgB;AACnB;AACA;;;;;;;;;;;;ACnBA,yBAAyB,mBAAO,CAAC,mGAAmC;AACpE,kBAAkB,mBAAO,CAAC,qFAA4B;;AAEtD;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACTA;;;;;;;;;;;;ACAA,UAAU,mBAAO,CAAC,iEAAkB;AACpC,sBAAsB,mBAAO,CAAC,6FAAgC;AAC9D,cAAc,mBAAO,CAAC,uFAA6B;AACnD,iBAAiB,mBAAO,CAAC,iFAA0B;;AAEnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AChBA,yBAAyB,mBAAO,CAAC,mGAAmC;AACpE,kBAAkB,mBAAO,CAAC,qFAA4B;;AAEtD;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACPa;AACb,mCAAmC;AACnC;;AAEA;AACA,gFAAgF,OAAO;;AAEvF;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACZD,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,yBAAyB,mBAAO,CAAC,mGAAmC;;AAEpE;AACA;AACA;AACA;AACA,4DAA4D;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG,gBAAgB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACvBD,iBAAiB,mBAAO,CAAC,mFAA2B;AACpD,gCAAgC,mBAAO,CAAC,qHAA4C;AACpF,kCAAkC,mBAAO,CAAC,yHAA8C;AACxF,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACVA,aAAa,mBAAO,CAAC,uEAAqB;;AAE1C;;;;;;;;;;;;ACFA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,kCAAkC,mBAAO,CAAC,uHAA6C;AACvF,UAAU,mBAAO,CAAC,iEAAkB;AACpC,gBAAgB,mBAAO,CAAC,+EAAyB;AACjD,oBAAoB,mBAAO,CAAC,uFAA6B;AACzD,0BAA0B,mBAAO,CAAC,uFAA6B;;AAE/D;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA,CAAC;;;;;;;;;;;;ACjCD;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACLA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,kCAAkC,mBAAO,CAAC,uHAA6C;;AAEvF;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;;;;;;;;;;;;ACTA,qBAAqB,mBAAO,CAAC,uGAAqC;AAClE,UAAU,mBAAO,CAAC,iEAAkB;AACpC,sBAAsB,mBAAO,CAAC,6FAAgC;;AAE9D;;AAEA;AACA;AACA,uCAAuC,iCAAiC;AACxE;AACA;;;;;;;;;;;;ACVA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,UAAU,mBAAO,CAAC,iEAAkB;;AAEpC;;AAEA;AACA;AACA;;;;;;;;;;;;ACPA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,gBAAgB,mBAAO,CAAC,+EAAyB;;AAEjD;AACA,kDAAkD;;AAElD;;;;;;;;;;;;ACNA,cAAc,mBAAO,CAAC,yEAAsB;AAC5C,YAAY,mBAAO,CAAC,mFAA2B;;AAE/C;AACA,qEAAqE;AACrE,CAAC;AACD;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACTY;AACb,gBAAgB,mBAAO,CAAC,+EAAyB;AACjD,6BAA6B,mBAAO,CAAC,2GAAuC;;AAE5E;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd;AACA;;;;;;;;;;;;ACbA,6BAA6B,mBAAO,CAAC,2GAAuC;AAC5E,kBAAkB,mBAAO,CAAC,iFAA0B;;AAEpD;AACA;AACA;;AAEA,sBAAsB,gDAAgD;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,sBAAsB;AAC9C;AACA;AACA,wBAAwB,qBAAqB;AAC7C;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC3BA,cAAc,mBAAO,CAAC,iFAA0B;;AAEhD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACTA,gBAAgB,mBAAO,CAAC,+EAAyB;;AAEjD;AACA;;AAEA;AACA;AACA,4DAA4D;AAC5D;AACA;AACA;AACA;;;;;;;;;;;;ACXA;AACA,oBAAoB,mBAAO,CAAC,uFAA6B;AACzD,6BAA6B,mBAAO,CAAC,2GAAuC;;AAE5E;AACA;AACA;;;;;;;;;;;;ACNA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACPA,gBAAgB,mBAAO,CAAC,+EAAyB;;AAEjD;;AAEA;AACA;AACA;AACA,uEAAuE;AACvE;;;;;;;;;;;;ACRA,eAAe,mBAAO,CAAC,6EAAwB;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACbA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACLA,oBAAoB,mBAAO,CAAC,qFAA4B;;AAExD;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACNA,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,UAAU,mBAAO,CAAC,iEAAkB;AACpC,UAAU,mBAAO,CAAC,iEAAkB;AACpC,oBAAoB,mBAAO,CAAC,qFAA4B;AACxD,wBAAwB,mBAAO,CAAC,6FAAgC;;AAEhE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;;;;;;;;;;;;AChBA;AACA;AACA;;;;;;;;;;;;ACFA,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,+EAAyB;;AAE7C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG,6CAA6C;AAChD;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACtBD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG,+EAA+E;AAClF;AACA,CAAC;;;;;;;;;;;;ACfD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;;AAEA;AACA;AACA;AACA,GAAG,gFAAgF;AACnF;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACZD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,WAAW,mBAAO,CAAC,6EAAwB;;AAE3C;AACA;;AAEA;AACA;AACA,GAAG,6BAA6B;AAChC;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACZD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA;;AAEA;AACA;AACA,GAAG,6BAA6B;AAChC;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACZD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,+EAAyB;;AAE7C;AACA;AACA;;AAEA;AACA;AACA,GAAG,kFAAkF;AACrF;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACdD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,+EAAyB;;AAE7C;AACA;AACA,GAAG,0DAA0D,GAAG,eAAe;;;;;;;;;;;;ACL/E,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,aAAa,mBAAO,CAAC,iFAA0B;;AAE/C;AACA;AACA,GAAG,6BAA6B,GAAG,iBAAiB;;;;;;;;;;;;ACLpD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,GAAG,4CAA4C;AAC/C,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,CAAC;;;;;;;;;;;;AChCD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,qEAAoB;;AAExC;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,GAAG,6CAA6C;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACrBD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;;AAEA;AACA;AACA,GAAG,6BAA6B;AAChC;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACXD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,+EAAyB;;AAE7C;AACA;AACA,GAAG,6BAA6B,GAAG,eAAe;;;;;;;;;;;;ACLlD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;;AAEA;AACA;AACA,GAAG,6BAA6B;AAChC;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACXD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,WAAW,mBAAO,CAAC,6EAAwB;;AAE3C;AACA;AACA,GAAG,6BAA6B;AAChC;AACA,CAAC;;;;;;;;;;;;ACPD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,qEAAoB;AACxC,YAAY,mBAAO,CAAC,+EAAyB;;AAE7C;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,GAAG,6CAA6C;AAChD;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACnBD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,+EAAyB;;AAE7C;;AAEA;AACA;AACA,GAAG,6BAA6B;AAChC;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACbD,qBAAqB,mBAAO,CAAC,6FAAgC;;AAE7D;AACA;AACA;;;;;;;;;;;;ACJA,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;;AAEA;AACA;AACA,GAAG,6BAA6B;AAChC;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACXY;AACb,kBAAkB,mBAAO,CAAC,iFAA0B;AACpD,aAAa,mBAAO,CAAC,uEAAqB;AAC1C,eAAe,mBAAO,CAAC,6EAAwB;AAC/C,eAAe,mBAAO,CAAC,2EAAuB;AAC9C,UAAU,mBAAO,CAAC,iEAAkB;AACpC,cAAc,mBAAO,CAAC,iFAA0B;AAChD,wBAAwB,mBAAO,CAAC,iGAAkC;AAClE,kBAAkB,mBAAO,CAAC,mFAA2B;AACrD,YAAY,mBAAO,CAAC,qEAAoB;AACxC,aAAa,mBAAO,CAAC,qFAA4B;AACjD,0BAA0B,mBAAO,CAAC,qHAA4C;AAC9E,+BAA+B,mBAAO,CAAC,+HAAiD;AACxF,qBAAqB,mBAAO,CAAC,uGAAqC;AAClE,WAAW,mBAAO,CAAC,iFAA0B;;AAE7C;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD,KAAK;AACL;AACA,oCAAoC,cAAc,OAAO;AACzD,qCAAqC,cAAc,OAAO;AAC1D;AACA;AACA;AACA;AACA,qBAAqB,gBAAgB;AACrC;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C,qCAAqC,EAAE;AACrF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC7EA,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA,GAAG,+BAA+B;AAClC;AACA,CAAC;;;;;;;;;;;;ACND,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,qBAAqB,mBAAO,CAAC,2FAA+B;;AAE5D;AACA;AACA,GAAG,+BAA+B,GAAG,2BAA2B;;;;;;;;;;;;ACLhE,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,gBAAgB,mBAAO,CAAC,+EAAyB;;AAEjD;AACA;AACA,GAAG,+BAA+B;AAClC;AACA,CAAC;;;;;;;;;;;;ACPD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA,GAAG,+BAA+B;AAClC;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACTD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,gBAAgB,mBAAO,CAAC,+EAAyB;;AAEjD;;AAEA;AACA;AACA,GAAG,+BAA+B;AAClC;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACXD,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA,GAAG,+BAA+B;AAClC;AACA,CAAC;;;;;;;;;;;;ACND,QAAQ,mBAAO,CAAC,uEAAqB;;AAErC;AACA;AACA,GAAG,+BAA+B;AAClC;AACA,CAAC;;;;;;;;;;;;ACND,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,iBAAiB,mBAAO,CAAC,+FAAiC;;AAE1D;AACA;AACA,GAAG,wEAAwE;AAC3E;AACA,CAAC;;;;;;;;;;;;ACPD,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,eAAe,mBAAO,CAAC,2FAA+B;;AAEtD;AACA;AACA,GAAG,oEAAoE;AACvE;AACA,CAAC;;;;;;;;;;;;;ACPY;AACb,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,gBAAgB,mBAAO,CAAC,+EAAyB;AACjD,sBAAsB,mBAAO,CAAC,6FAAgC;AAC9D,aAAa,mBAAO,CAAC,qFAA4B;AACjD,YAAY,mBAAO,CAAC,qEAAoB;;AAExC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,CAAC;;AAED;AACA;AACA,GAAG,gDAAgD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,CAAC;;;;;;;;;;;;;AC7HY;AACb,QAAQ,mBAAO,CAAC,uEAAqB;AACrC,YAAY,mBAAO,CAAC,qEAAoB;AACxC,sBAAsB,mBAAO,CAAC,6FAAgC;;AAE9D;;AAEA;AACA;AACA;AACA,CAAC;AACD;AACA,2BAA2B;AAC3B,CAAC;;AAED;AACA;AACA,GAAG,gDAAgD;AACnD;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACvBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;;ACxHA;AAAA;AAAA;AAAA;;AAEO;AACA;;;;;;;;;;;;;ACHP;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAiC;AACA;AACI;AACJ;AACI;AACN;AACK;AACS;;AAE9B;AACf,cAAc,oDAAQ;AACtB,eAAe,kDAAM;AACrB,kBAAkB,6DAAO;;AAEzB;AACA;;AAEA;AACA;AACA;AACA;;AAEA,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,0DAAQ;AACnB,WAAW,yDAAK,kCAAkC;AAClD;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA,eAAe,OAAO;AACtB;AACA;AACA,aAAa,0DAAM;AACnB;AACA;;AAEA;AACA;;AAEA;AACA,qEAAqE,4DAAQ;AAC7E;;AAEA;AACA,sEAAsE,4DAAQ;AAC9E;;AAEA;AACA,4FAA4F,4DAAQ,CAAC,+CAAK,YAAY,4DAAQ;AAC9H;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC5ED;AAAA;AAAA;AAAA;AAAA;AAAuC;AACF;;AAErC,sBAAsB,4DAAQ,CAAC,qDAAS;AACjC;AACA;AACQ,0EAAW,EAAC;;;;;;;;;;;;;ACN3B;AAAA;AAAuC;;AAExB;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,WAAW,6DAAS;AACpB;AACA;;;;;;;;;;;;;AChCA;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACjBA;AAAA;AAAA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AChCA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA,C;;;;;;;;;;;;ACLA;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAqC;;AAEtB;AACf,YAAY,4DAAQ;AACpB;AACA;;;;;;;;;;;;;ACLA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;AC5BD;AAAA;AAAA;AAAuC;;AAExB,oCAAoC,qDAAS;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,6DAAS;AACrB,YAAY,6DAAS;AACrB;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5BA;AAAA;AAAA;AAAA;AAAuC;AACF;;AAEtB,yCAAyC,qDAAS;AACjE,mCAAmC,4DAAQ;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AClBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAqC;;AAEtB;AACf,sBAAsB,oDAAQ,EAAE,oDAAQ;AACxC;;AAEO;AACP,kCAAkC,oDAAQ;AAC1C;;AAEO;AACP,sBAAsB,oDAAQ;AAC9B;;AAEO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;;;;;;;;;;;;ACnCA;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAuE;AACnB;AACF;AACN;AACA;AACE;AACQ;AACF;AACN;AACuB;AACP,eAAe;AACQ;AACtB;AACI;AAC3B;AACU;AACR;AACI;AACF;AACJ;AACU;AACN;AACI;AACkB;AACV;AACZ;AACA;AACU;AACJ;AACU;AAClB,eAAe;AACT;AACR;AAC6B;AACjB;AACF;AACV;;;;;;;;;;;;;ACpCxC;AAAA;AAAA;AAAuC;;AAExB,iCAAiC,qDAAS;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,6DAAS;AACrB,YAAY,6DAAS;AACrB;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5BA;AAAA;AAAA;AAAA;AAAuC;AACF;;AAEtB,sCAAsC,qDAAS;AAC9D,mCAAmC,4DAAQ;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AClBA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACrBA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AClBA;AAAA;AAAqC;;AAEtB;AACf,SAAS,4DAAQ;AACjB,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA;;;;;;;;;;;;;ACRA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACrBA;AAAA;AAAe;AACf;AACA,CAAC;;AAEM;AACP;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACdA;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA2B;AACA;AACgB;AACC;;AAE7B;AACf,6BAA6B,0DAAO;AACpC;AACA,qCAAqC,uDAAG;AACxC,qBAAqB,uDAAG;AACxB;AACA;AACA;AACA,eAAe,uDAAG,CAAC,+DAAW;AAC9B,eAAe,uDAAG;AAClB;AACA;;AAEO,6CAA6C,kDAAM;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5BA;AAAA;AAAA;AAAuC;;AAEvC;AACA;AACe,6EAA6E,qDAAS;AACrG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC3CA;AAAe;AACf;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;;;;;;;;;;;;;ACZD;AAAA;AAAA;AAAyC;;AAE1B;AACf,gBAAgB,8DAAU;AAC1B;AACA;;;;;;;;;;;;;ACLA;AAAA;AAAe;AACf;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;;ACbA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACjBA;AAAA;AAAA;AAAgC;AACM;;AAEvB;AACf,uCAAuC,4DAAQ,iBAAiB,4DAAQ,2BAA2B,yDAAK;AACxG,CAAC;;;;;;;;;;;;;ACLD;AAAA;AAAA;AAAgC;AACQ;;AAEzB;AACf,wCAAwC,6DAAS,oBAAoB,yDAAK;AAC1E,CAAC;;;;;;;;;;;;;ACLD;AAAA;AAAgC;;AAEjB;AACf,4BAA4B,yDAAK;AACjC,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,CAAC;;AAEM;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AClDA;AAAA;AAA2B;;AAEZ;AACf;AACA,uBAAuB,uDAAG,2CAA2C,SAAS;AAC9E,0DAA0D,SAAS;AACnE;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;;;;;;;;;;;;ACdA;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACxBA;AAAA;AAAuC;;AAExB;AACf,SAAS,6DAAS;AAClB,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA2C;;AAEpC;;AAEA;AACA;;AAEP;AACA;AACA;AACA,yBAAyB,IAAI;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,0DAAM;AACN;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEA,0DAAM,WAAW,yDAAM;AACvB;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,0DAAM,WAAW,yDAAM;AACvB;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AClXA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA2C;AACyB;AACzB;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qBAAqB,6CAAG,OAAO,4DAAU;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,gDAAO;AACzC;AACA;;AAEe;AACf;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEA,0DAAM,uBAAuB,yDAAM,CAAC,+CAAK;AACzC;AACA,oBAAoB,kDAAQ,YAAY,kDAAQ;AAChD;AACA,GAAG;AACH;AACA,oBAAoB,gDAAM,YAAY,gDAAM;AAC5C;AACA,GAAG;AACH;AACA,iDAAiD,gDAAO;AACxD;AACA;AACA;AACA;AACA,eAAe,6CAAG;AAClB;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;AC5DD;AAAA;AAAe;AACf;AACA;AACA,CAAC;;AAEM;AACP;AACA;AACA;AACA;;;;;;;;;;;;;ACTA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAsD;AACE;AACJ;;;;;;;;;;;;;ACFpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA2C;AACO;AACP;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB,6CAAG,OAAO,4DAAU;AACzC;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;;AAEe;AACf;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEA,0DAAM,WAAW,yDAAM,CAAC,+CAAK;AAC7B;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,6CAAG;AAClB;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iCAAiC,gDAAO;AACxC;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,gDAAO;AACvB;AACA;;AAEA,0DAAM,WAAW,yDAAM,CAAC,+CAAK;AAC7B;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;AC1HD;AAAA;AAAA;AAAO;AACA;;;;;;;;;;;;;ACDP;AAAA;AAAA;AAAA;AAAA;AAAuC;;AAEvC;AACO;AACA;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAEc;AACf,WAAW,0DAAY;AACvB;AACA;AACA;AACA;;;;;;;;;;;;;ACnBA;AAAA;AAA+C;;AAEhC;AACf,aAAa,iEAAa;AAC1B,CAAC;;;;;;;;;;;;;ACJD;AAAA;AACA;AACA;AACe;AACf,+FAA+F;AAC/F;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACbD;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;;;;;;;;;;;;ACjBD;AAAe;AACf;AACA;AACA;AACA,KAAK;AACL;AACA,CAAC;;;;;;;;;;;;;ACND;AAAA;AAAA;AAA+C;;AAExC;;AAEQ;AACf,UAAU,iEAAa;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C,iEAAa,+BAA+B;AACxF,CAAC;;;;;;;;;;;;;ACfD;AAAA;AAA+C;;AAEhC;AACf,UAAU,iEAAa;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACVD;AAAA;AAAA;AAAA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA,sDAAsD;;AAE/C;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC9CA;AAAA;AACe;AACf,iDAAiD,OAAO;AACxD;AACA,4BAA4B;AAC5B,qCAAqC,QAAQ;AAC7C,qCAAqC,oBAAoB;AACzD;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACVD;AAAA;AAAA;AAAqD;AACN;;AAEhC;AACf,uBAAuB,6BAA6B,EAAE;AACtD,oBAAoB,kCAAkC,EAAE;AACxD,oBAAoB,eAAe,EAAE;AACrC,oBAAoB,mCAAmC,EAAE;AACzD,uBAAuB,2BAA2B,EAAE;AACpD,uBAAuB,qBAAqB,EAAE;AAC9C,uBAAuB,yBAAyB,EAAE;AAClD,oBAAoB,kCAAkC,EAAE;AACxD,uBAAuB,QAAQ,iEAAa,aAAa,EAAE;AAC3D,OAAO,yDAAa;AACpB,OAAO,4DAAgB;AACvB,oBAAoB,iDAAiD,EAAE;AACvE,oBAAoB,mCAAmC;AACvD,CAAC,EAAC;;;;;;;;;;;;;ACjBF;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAwF;AACpC;AAC6B;AACnB;AACE;AACF;;;;;;;;;;;;;ACL9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAqC;AACM;AACM;AACE;AACV;AACE;AACU;AAChB;;AAErC;AACA;;AAEe;AACf,gFAAgF,oDAAQ,GAAG,+DAAW;AACtG;AACA;AACA;AACA,iDAAiD,oDAAQ,GAAG,kEAAc;AAC1E;AACA;AACA;;AAEA;AACA,gBAAgB,mEAAe;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,cAAc,uDAAW;;AAEzB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB,uDAAW;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;AACA,0BAA0B,8DAAU;;AAEpC;AACA;;AAEA;AACA;;AAEA,mDAAmD,mEAAc;;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sEAAsE;AACtE,sEAAsE;AACtE,qIAAqI;AACrI,qEAAqE;AACrE;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,mCAAmC,mEAAe;AAClD,gDAAgD,4DAAQ;AACxD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;AClJD;AAAA;AAAqC;;AAEtB;AACf,sBAAsB,4DAAQ;AAC9B,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAqC;;AAEtB;AACf,yDAAyD,4DAAQ,qBAAqB,4DAAQ;AAC9F,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAqC;;AAEtB;AACf;AACA,qBAAqB,4DAAQ,QAAQ,4DAAQ;AAC7C,CAAC;;;;;;;;;;;;;ACLD;AAAA;AAAA;AAAA;AAA+B;AAC6B;;AAE7C;AACf,UAAU,qEAAa,MAAM,uDAAW;AACxC,CAAC;;AAEM;AACP;AACA;AACA;AACA;AACA;;AAEA,aAAa,QAAQ,aAAa,yDAAK;AACvC,QAAQ,QAAQ;;AAEhB;AACA,eAAe,QAAQ;AACvB;AACA;AACA;;;;;;;;;;;;;ACrBA;AAAA;AAAO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;AClBD;AAAA;AAAiC;;AAElB;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,uDAAK;AAChB;AACA,CAAC;;;;;;;;;;;;;ACZD;AAAA;AAAA;AAAA;AAAA;AAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA,kFAAkF,4DAAQ;AAC1F;;AAEO;AACP;AACA,0CAA0C,4DAAQ;AAClD;AACA;;AAEe;AACf;AACA,4BAA4B,4DAAQ;AACpC;;;;;;;;;;;;;AC5BA;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAA;AAAqD;AACf;;AAEtC;AACA;AACA;;AAEA;AACA,2BAA2B,0DAAc,mBAAmB,0DAAc;AAC1E,cAAc,yDAAK;AACnB,cAAc,yDAAK;AACnB,oBAAoB,yDAAK;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,GAAG;AACH;;AAEe,yEAAU,6CAAG,CAAC,EAAC;AACvB,8BAA8B,iDAAK;;;;;;;;;;;;;AC5B1C;AAAe;AACf;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACLD;AAAe;AACf;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACLD;AAAA;AAAA;AAAA;AAAyC;AACH;;AAEtC;AACA;AACA,yBAAyB,oDAAQ,mBAAmB,oDAAQ;AAC5D,YAAY,yDAAK;AACjB,YAAY,yDAAK;AACjB,kBAAkB,yDAAK;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,mEAAI,6CAAG,CAAC,EAAC;AACjB,kBAAkB,iDAAK;;;;;;;;;;;;;ACpB9B;AAAA;AAAA;AAAA;AAAyC;AACH;;AAEtC;AACA;AACA,yBAAyB,oDAAQ,mBAAmB,oDAAQ;AAC5D,YAAY,yDAAK;AACjB,YAAY,yDAAK;AACjB,kBAAkB,yDAAK;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,mEAAI,6CAAG,CAAC,EAAC;AACjB,kBAAkB,iDAAK;;;;;;;;;;;;;ACpB9B;AAAA;AAA+B;;AAEhB;AACf,UAAU,qDAAG;AACb;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACRD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAkD;AACK;AACA;AACY;AACd;AACQ;AACV;AACM;AACU;AACV;AACF;AACE;AAC6B;AACjC;AAC4E;AAC/C;AAC/B;AAC+B;AACwB;AACtD;AACF;;;;;;;;;;;;;ACpBlD;AAAA;AAAA;AAAA;AAAyC;AACV;;AAEhB;AACf,UAAU,yDAAK,UAAU,oDAAQ,mBAAmB,oDAAQ;AAC5D,UAAU,yDAAK;AACf,UAAU,yDAAK;AACf,gBAAgB,yDAAK;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACfA;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB;AACA;AACA,CAAC;;AAEM;AACP;AACA;;;;;;;;;;;;;ACbA;AAAA;AAA+B;;AAEhB;AACf,YAAY;AACZ,YAAY;AACZ;;AAEA;AACA;;AAEA;AACA;AACA,aAAa,yDAAK;AAClB,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACtBD;AAAA;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACPA;AAAe;AACf;AACA,iBAAiB,OAAO;AACxB;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAyC;AACV;AACY;AACD;;AAE3B;AACf,cAAc,uDAAK;;AAEnB;AACA,2BAA2B,oDAAQ,mBAAmB,oDAAQ;AAC9D;AACA;AACA,kBAAkB,yDAAO;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,CAAC,IAAI,EAAC;;AAEN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,cAAc,oDAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO,yBAAyB,iDAAK;AAC9B,+BAA+B,uDAAW;;;;;;;;;;;;;ACtDjD;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAiC;;AAEjC;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;;AAEA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA,2BAA2B;AAC3B;AACA;AACA,wCAAwC;AACxC,2BAA2B;AAC3B;AACA,KAAK,OAAO;AACZ;AACA,cAAc,SAAS,0DAAM,SAAS;AACtC;AACA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,OAAO;AACnC;AACA,SAAS;AACT,CAAC;;;;;;;;;;;;;AC/DD;AAAA;AAAA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACzBD;AAAA;AAAA;AAAA;AAAA;AAAkC;AACY;;AAE9C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,aAAa,0DAAM,SAAS,GAAG,aAAa,0DAAM,SAAS;AACzE,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA,gCAAgC,gCAAgC;AAChE,cAAc,sDAAsD,0DAAM,OAAO;AACjF,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA,cAAc,qDAAqD,0DAAM,OAAO;AAChF,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,aAAa,0DAAM,SAAS,GAAG,aAAa,0DAAM,SAAS;AACzE,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO,mDAAmD,kDAAQ;AAC3D,mDAAmD,kDAAQ;;;;;;;;;;;;;AC9DlE;AAAA;AAAA;AAAA;AAAmD;;AAEnD;AACA;AACA;AACA;;AAEO;AACP,+BAA+B,sDAAQ;AACvC;AACA;AACA;AACA;AACA;AACA,SAAS,6DAAS;AAClB;;AAEO;AACP,4BAA4B,sDAAQ;AACpC;AACA;AACA,iEAAiE,sDAAQ;AACzE;AACA,SAAS,6DAAS;AAClB;;;;;;;;;;;;;ACxBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA+B;AACJ;AACa;AACX;AACI;AACA;AACA;AACI;AACuB;;AAE7C;AACf;AACA,wCAAwC,4DAAQ;AAChD,0BAA0B,kDAAM;AAChC,+BAA+B,sDAAK,eAAe,+CAAG,IAAI,kDAAM;AAChE,qBAAqB,8CAAK,GAAG,+CAAG;AAChC,4BAA4B,gDAAI;AAChC,QAAQ,qEAAa,MAAM,uDAAW;AACtC,2BAA2B,sDAAY;AACvC,0FAA0F,kDAAM;AAChG,QAAQ,kDAAM;AACd,CAAC;;;;;;;;;;;;;ACrBD;AAAA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC/DD;AAAA;AAAA;AAAA;AAA0C;;;;;;;;;;;;;ACA1C;AAAA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEe,mEAAI,EAAC;;;;;;;;;;;;;ACjIpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAA2C;AACP;AACD;;AAEpB;AACf,cAAc,2DAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,sDAAQ,qBAAqB,yBAAyB,EAAE;AACzE;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,kDAAS;AAClB;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACpGA;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAgC;AACoE;AAC/D;AACJ;;AAEjC;;AAEO;AACP;AACA;;AAEA;AACA;AACA,qBAAqB,oBAAoB;AACzC,QAAQ,4DAAQ;AAChB;;AAEA;AACA;AACA;AACA,sBAAsB,oCAAoC;AAC1D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,kBAAkB;AACxC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,YAAY,uDAAM;AAClB;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA,oBAAoB,0DAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wFAAwF,gEAAiB;AACzG;;AAEA;AACA,sDAAsD,kDAAM;AAC5D;;AAEA;AACA;AACA;;AAEA;AACA,gDAAgD,+DAAgB;AAChE;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA;;;;;;;;;;;;;AC5HA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAwE;AAC/B;AACE;AACL;AACL;AACI;AACC;AACN;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,uDAAQ;AAC7B;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,kEAAkE,gEAAS;AAC3E;AACA;;AAEA,sBAAsB,0DAAW;;AAEjC,2BAA2B,+DAAgB;;AAE3C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEe;AACf,cAAc,4DAAS,eAAe,uDAAQ;;AAE9C;AACA,WAAW,2DAAI;AACf;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP,cAAc,uDAAO;;AAErB;AACA,WAAW,2DAAI;AACf;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP,cAAc,4DAAS;;AAEvB;AACA,WAAW,2DAAI;AACf;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP,cAAc,sDAAM;;AAEpB;AACA,WAAW,2DAAI;AACf;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP;AACA;;;;;;;;;;;;;ACvGA;AAAA;AAAA;AAAA;AAAsC;AACL;;AAElB;AACf;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,sDAAsD,kDAAM;AAC5D;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iDAAiD,kDAAM;;AAEvD,SAAS,4DAAS;AAClB;;;;;;;;;;;;;AC3BA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAGmB;;AAII;;AAIF;;AAIH;;AAIG;;AAKC;;AAKJ;;AAIG;;AAIE;;AAIA;;AAIC;;AAIL;;AAIG;;AAQG;;AAIQ;;AAQT;;AAIC;;;;;;;;;;;;;AC7EzB;AAAA;AAAA;AAAO;AACP;AACA;AACA,+BAA+B;AAC/B,8CAA8C;AAC9C;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACzBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA8C;AACG;AACb;AACK;;AAElC;AACP;;AAEA;AACA;AACA,WAAW,sDAAK;AAChB;;AAEA;AACA;AACA,WAAW,8DAAU;AACrB;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,WAAW,8DAAa;;AAExB;AACA;AACA;AACA,aAAa,8DAAa;AAC1B,KAAK;AACL;AACA;AACA,aAAa,8DAAa;AAC1B;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEe;AACf,cAAc,8DAAU;;AAExB;AACA,WAAW,2DAAI;AACf;;AAEA,EAAE,kDAAS;;AAEX;AACA;;;;;;;;;;;;;ACvEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA+B;AACE;AACJ;AACqB;AACd;;AAEpC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB,0BAA0B;AAC/C;;AAEA;AACA;AACA;AACA;AACA,8CAA8C,2BAA2B,EAAE;AAC3E;;AAEA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,uBAAuB,QAAQ;AAC/B,gCAAgC,UAAU;AAC1C;AACA;AACA;AACA;AACA;AACA,OAAO,YAAY,QAAQ;AAC3B,uCAAuC,QAAQ;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,sDAAK;AACrC,KAAK;AACL,UAAU,sDAAK;AACf;;AAEA;AACA;;AAEA;AACA;AACA,qDAAqD,wDAAM;AAC3D;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,wDAAI;AACtB,0BAA0B,kCAAkC,EAAE;AAC9D,yBAAyB,iCAAiC;AAC1D,KAAK;AACL;;AAEA;AACA;;AAEe;AACf,sBAAsB,kEAAW;;AAEjC;AACA,WAAW,2DAAI;AACf;;AAEA,EAAE,kDAAS;;AAEX;AACA;;;;;;;;;;;;;ACjJA;AAAe;AACf;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACjBD;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAoC;;AAE7B;;AAEQ;AACf;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,EAAE,kDAAS;;AAEX;AACA;;;;;;;;;;;;;AC7CA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAsC;AACsB;AACxB;;AAEpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEO;AACP,wBAAwB,uDAAQ,EAAE,uDAAQ;AAC1C;;AAEA;AACA,sCAAsC,uDAAQ,EAAE,uDAAQ;AACxD;AACA;AACA;;AAEA;AACA;AACA;;AAEA,SAAS,4DAAS;AAClB;;AAEe;AACf,qBAAqB,kEAAW;;AAEhC;AACA,WAAW,2DAAI;AACf;;AAEA,EAAE,kDAAS;;AAEX;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACjDA;AAAA;AAAA;AAAA;AAAkE;AAC9B;;AAErB;AACf;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,wCAAwC,yDAAS;AACjD;AACA;;AAEA;AACA,2CAA2C,uDAAM;AACjD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,kDAAS;AACzB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,kDAAS;AAClB;;;;;;;;;;;;;ACxDA;AAAA;AAAA;AAAA;AAAA;AAAgC;AACM;AACF;;AAErB;AACf;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0BAA0B,uDAAM;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,kDAAS,OAAO,4DAAS;AAClC;;;;;;;;;;;;;ACvDA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAyC;AACL;AACE;AACL;;AAEjC;AACA;AACA;;AAEA;AACA;AACA;;AAEe;AACf,gBAAgB,8DAAU;AAC1B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oEAAoE,kDAAM;AAC1E;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,EAAE,kDAAS;;AAEX,SAAS,4DAAS;AAClB;;;;;;;;;;;;;AC9DA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA6D;AACpB;AACE;AACL;AACL;AACK;AACN;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,uDAAQ;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB,0DAAW;;AAEjC,2BAA2B,+DAAgB;;AAE3C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEe;AACf,cAAc,4DAAS,eAAe,uDAAQ;;AAE9C;AACA;AACA;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP,cAAc,uDAAO;;AAErB;AACA;AACA;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP,cAAc,4DAAS;;AAEvB;AACA;AACA;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP,cAAc,sDAAM;;AAEpB;AACA;AACA;;AAEA,SAAS,yDAAgB;AACzB;;AAEO;AACP;AACA;;;;;;;;;;;;;AC1GA;AAAA;AAAA;AAAA;AAAA;AAAqD;AACZ;AACE;;AAE5B;AACf;AACA,qBAAqB,uDAAQ;;AAE7B;AACA,6CAA6C,uDAAM;AACnD;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,kDAAS;AACzB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,uBAAuB,cAAc,YAAY,yDAAQ;AACzD;;AAEA;AACA;AACA;;AAEA,SAAS,yDAAgB;AACzB;;;;;;;;;;;;;ACrCA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAsC;AACY;AACd;;AAEpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEO;AACP;;AAEA;AACA;AACA;;AAEA,SAAS,4DAAS;AAClB;;AAEe;AACf,wBAAwB,kEAAW;;AAEnC;AACA,WAAW,2DAAI;AACf;;AAEA,SAAS,kDAAS;AAClB;;;;;;;;;;;;;AClCA;AAAA;AAAA;AAAA;AAAgC;AACI;;AAErB;AACf;AACA;AACA;AACA;;AAEA;AACA,0BAA0B,uDAAM;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAAS,kDAAS;AAClB;;;;;;;;;;;;;ACtCA;AAAA;AAAA;AAAkC;AAC+E;;AAElG;AACf,aAAa,yDAAQ;AACrB;AACA,cAAc,iEAAe;AAC7B;AACA;AACA;AACA,4DAA4D,iEAAe;AAC3E,aAAa,8DAAY;AACzB;AACA;AACA;AACA;AACA;AACA;AACA,4DAA4D,gEAAc;AAC1E;AACA;AACA;AACA;AACA,4DAA4D,gEAAc;AAC1E;AACA;AACA;AACA,SAAS,wDAAM;AACf,CAAC;;;;;;;;;;;;;AC5BD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA4C;AACsE;AACxE;AACO;AACb;AACP;;AAE7B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEO;AACP,cAAc,8DAAU;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc,yDAAQ,cAAc,aAAa,EAAE;AACnD;AACA;AACA,eAAe,yDAAQ;AACvB;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP,wBAAwB,yDAAQ;AAChC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,wDAAI;AACrB;AACA;;AAEA;AACA,WAAW,2DAAI;AACf;;AAEA;AACA;;AAEe;AACf,SAAS,kDAAS,gBAAgB,gDAAQ,EAAE,iDAAS,EAAE,gDAAQ,EAAE,+CAAO,EAAE,gDAAQ,EAAE,kDAAU,EAAE,kDAAU,EAAE,uDAAe,EAAE,yDAAU;AACvI,CAAC;;;;;;;;;;;;;ACvID;AAAA;AAAA;AAAA;AAAA;AAAmC;AACM;AACiE;AACtE;;AAErB;AACf,SAAS,kDAAS,OAAO,yDAAQ,CAAC,+CAAO,EAAE,gDAAQ,EAAE,+CAAO,EAAE,8CAAM,EAAE,+CAAO,EAAE,iDAAS,EAAE,iDAAS,EAAE,sDAAc,EAAE,wDAAS;AAC9H,CAAC;;;;;;;;;;;;;ACPD;AAAA;AAAA;AAAA;AAA6B;AACQ;AACgE;;AAErG;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,yBAAyB;AACzB;;AAEA;AACA;AACA;AACA;AACA,cAAc,gDAAO;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,6BAA6B,qDAAI;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,qDAAI,CAAC,oDAAG;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA;AACA,qBAAqB,4DAAQ;AAC7B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,iDAAiD,+CAAM;AACvD,+CAA+C,+CAAM;AACrD,aAAa,oDAAG;AAChB;;AAEA,qCAAqC,oDAAI;;AAEzC;AACA;;AAEA;AACA,eAAe,gDAAO;;AAEtB;AACA,kBAAkB,4CAAG,GAAG,gDAAO;AAC/B,0BAA0B,oDAAG,WAAW,oDAAG;AAC3C;AACA,eAAe,gDAAO;AACtB,4BAA4B,oDAAG,WAAW,oDAAG;AAC7C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,gDAAO,sDAAsD,qDAAI;AACtF,eAAe,oDAAG,CAAC,oDAAG;AACtB;AACA;AACA;AACA;;AAEA;AACA,eAAe,gDAAO;AACtB,iBAAiB,qDAAI,WAAW,oDAAG;AACnC,iBAAiB,qDAAI,WAAW,oDAAG;AACnC,8BAA8B,gDAAO;AACrC;AACA,8BAA8B,gDAAO;AACrC;AACA;;AAEA,qBAAqB,oDAAG;AACxB,qBAAqB,oDAAG;AACxB,qBAAqB,oDAAG;AACxB,qBAAqB,oDAAG;;AAExB;AACA,eAAe,gDAAO;AACtB,uBAAuB,oDAAG;AAC1B,uBAAuB,oDAAG;AAC1B,uBAAuB,oDAAG;AAC1B,uBAAuB,oDAAG;AAC1B;;AAEA;AACA,iBAAiB,2CAAE;AACnB;AACA;AACA;AACA;AACA,uBAAuB,oDAAG,CAAC,qDAAI,wBAAwB,qDAAI,sBAAsB,qDAAI;AACrF,mBAAmB,qDAAI;AACvB,gBAAgB,oDAAG;AACnB,gBAAgB,oDAAG;AACnB;AACA;;AAEA;AACA,kBAAkB,gDAAO;;AAEzB;AACA,qBAAqB,gDAAO;AAC5B;AACA;;AAEA;;AAEA;AACA,qDAAqD,sDAAK,kBAAkB,sDAAK;;AAEjF;AACA;AACA,yCAAyC,sDAAK,kBAAkB,sDAAK;AACrE,gCAAgC,sDAAK,kCAAkC,sDAAK;AAC5E,yCAAyC,sDAAK,kBAAkB,sDAAK;AACrE;AACA;;AAEA;AACA;;AAEA;AACA;AACA,iBAAiB,gDAAO,aAAa,gDAAO;;AAE5C;AACA,qBAAqB,gDAAO;AAC5B;AACA;;AAEA;;AAEA;AACA,qDAAqD,sDAAK,kBAAkB,sDAAK;;AAEjF;AACA;AACA,yCAAyC,sDAAK,kBAAkB,sDAAK;AACrE,gCAAgC,sDAAK,kCAAkC,sDAAK;AAC5E,yCAAyC,sDAAK,kBAAkB,sDAAK;AACrE;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,0FAA0F,2CAAE;AAC5F,YAAY,oDAAG,SAAS,oDAAG;AAC3B;;AAEA;AACA,2EAA2E,4DAAQ;AACnF;;AAEA;AACA,2EAA2E,4DAAQ;AACnF;;AAEA;AACA,4EAA4E,4DAAQ;AACpF;;AAEA;AACA,4FAA4F,4DAAQ;AACpG;;AAEA;AACA,0EAA0E,4DAAQ;AAClF;;AAEA;AACA,wEAAwE,4DAAQ;AAChF;;AAEA;AACA,wEAAwE,4DAAQ;AAChF;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;;;;;;;;;;;;;ACpQD;AAAA;AAAA;AAAA;AAAA;AAAA;AAA6B;AACQ;AACO;AACf;AACuB;;AAErC;AACf,WAAW,2CAAM;AACjB;AACA,WAAW,4DAAQ;AACnB,WAAW,2CAAM;AACjB,gBAAgB,4DAAQ;AACxB;AACA,cAAc,wDAAW;AACzB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iDAAiD,oDAAI;;AAErD,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,yBAAyB,QAAQ;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,WAAW,wDAAI;AACf;;AAEA;AACA,kEAAkE,4DAAQ;AAC1E;;AAEA;AACA,kEAAkE,4DAAQ;AAC1E;;AAEA;AACA,qFAAqF,4DAAQ;AAC7F;;AAEA;AACA,kEAAkE,4DAAQ;AAC1E;;AAEA;AACA,kEAAkE,4DAAQ;AAC1E;;AAEA;AACA,qFAAqF,4DAAQ;AAC7F;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,uEAAuE,4DAAQ;AAC/E;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC5GD;AAAA;AAAA;AAAA;AAAiE;AACpC;AACc;;AAE5B;AACf,UAAU,wDAAI,SAAS,kEAAiB;AACxC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,QAAQ,iEAAU,OAAO,EAAE;AAC5D,+BAA+B,QAAQ,iEAAU,OAAO,EAAE;AAC1D,kCAAkC,QAAQ,iEAAU,OAAO,EAAE;AAC7D,kCAAkC,QAAQ,iEAAU,OAAO,EAAE;;AAE7D;AACA,gCAAgC,gEAAW;AAC3C;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC5BD;AAAA;AAAO;;;;;;;;;;;;;ACAP;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,8CAA8C;AAC9C,uDAAuD;AACvD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B,sEAAsE;AACpG,8BAA8B;AAC9B,8BAA8B,oFAAoF;AAClH,iCAAiC;AACjC;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA,CAAC;;;;;;;;;;;;;AClDD;AAAA;AAAA;AAA8B;AACG;;AAEjC;AACA;AACA;;AAEA;AACA,aAAa,gDAAI;AACjB,WAAW,gDAAI;AACf;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B,4BAA4B;AAC1D,8BAA8B,4BAA4B;AAC1D,8BAA8B,4BAA4B,4FAA4F;AACtJ,eAAe,uDAAK,aAAa;AACjC;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA,CAAC;;;;;;;;;;;;;ACnDD;AAAA;AAAiC;;AAEjC;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B,oFAAoF,0EAA0E;AAC5L,8BAA8B;AAC9B,eAAe,uDAAK,aAAa;AACjC;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA,CAAC;;;;;;;;;;;;;ACtCD;AAAA;AAAiC;;AAEjC;AACA,oBAAoB,+CAAK;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA,4BAA4B,+CAAK;AACjC;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,OAAO,EAAC;;;;;;;;;;;;;ACvDT;AAAA;AAAA;AAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,uDAAuD;AACvD,8CAA8C;AAC9C;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B,sEAAsE;AACpG,8BAA8B,4BAA4B;AAC1D,8BAA8B;AAC9B,iCAAiC;AACjC;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,IAAI,EAAC;;;;;;;;;;;;;AC5DN;AAAA;AAAA;AAAA;AAA8B;AACM;;AAE7B;AACP;AACA;AACA;;AAEA;AACA,aAAa,gDAAI;AACjB,WAAW,gDAAI;AACf;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B,4BAA4B;AAC1D,8BAA8B,kDAAkD;AAChF,8BAA8B,4BAA4B;AAC1D,eAAe,0DAAK,aAAa;AACjC;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,IAAI,EAAC;;;;;;;;;;;;;AC5DN;AAAA;AAAA;AAAoC;;AAE7B;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B,kGAAkG;AAChI,8BAA8B;AAC9B,eAAe,0DAAK,aAAa;AACjC;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,IAAI,EAAC;;;;;;;;;;;;;AChDN;AAAA;AAAA;AAAA;AAAmC;AACI;;AAEhC;AACP;AACA;AACA;AACA;;AAEA,oBAAoB,gDAAO;AAC3B;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gDAAO;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,uDAAuD;AACvD,6CAA6C;AAC7C;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,8BAA8B,sEAAsE;AACpG,8BAA8B;AAC9B,8BAA8B;AAC9B,iCAAiC;AACjC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA,wDAAwD,qDAAQ;AAChE;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,MAAM,EAAC;;;;;;;;;;;;;ACvFR;AAAA;AAAA;AAAA;AAAmD;AACrB;AACQ;;AAEtC;AACA;AACA;AACA;;AAEA;AACA,aAAa,gDAAI;AACjB,WAAW,gDAAI;AACf;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,8BAA8B,4BAA4B;AAC1D,8BAA8B,kDAAkD;AAChF,8BAA8B,4BAA4B;AAC1D,eAAe,4DAAK,aAAa;AACjC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA,8DAA8D,iEAAc;AAC5E;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,MAAM,EAAC;;;;;;;;;;;;;ACzER;AAAA;AAAA;AAA+C;AACT;;AAEtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B,kGAAkG;AAChI,8BAA8B;AAC9B,eAAe,4DAAK,aAAa;AACjC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEe;;AAEf;AACA,4DAA4D,6DAAY;AACxE;;AAEA;AACA;AACA;;AAEA;AACA,CAAC,MAAM,EAAC;;;;;;;;;;;;;AC7DR;AAAA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B,sEAAsE;AACpG,8BAA8B;AAC9B,0CAA0C;AAC1C;AACA;AACA;;AAEe;AACf;AACA,CAAC;;;;;;;;;;;;;AC9BD;AAAA;AAA8B;;AAE9B;AACA;AACA;;AAEA;AACA,aAAa,gDAAI;AACjB,WAAW,gDAAI;AACf;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA,CAAC;;;;;;;;;;;;;ACxBD;AAAA;AAAA;AAAA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,uDAAuD;AACvD,4DAA4D;AAC5D;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA,iDAAiD;AACjD;AACA,8BAA8B,sEAAsE;AACpG,8BAA8B;AAC9B,8BAA8B,wDAAwD;AACtF,8DAA8D;AAC9D;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,0BAA0B,4BAA4B,EAAE;AACxD,yBAAyB,2BAA2B,EAAE;AACtD,0BAA0B,4BAA4B,EAAE;AACxD,iDAAiD,mDAAmD;AACpG;;AAEO;AACP;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACvGA;AAAA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,WAAW;AACxB;AACA,aAAa,OAAO;AACpB;AACA,iBAAiB,QAAQ;AACzB;AACA,aAAa,WAAW;AACxB;AACA;;AAEe;AACf;AACA,CAAC;;;;;;;;;;;;;AChED;AAAA;AAAA;AAAA;AAAsC;;AAE/B,oCAAoC,kDAAW;;AAEtD;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEe;;AAEf;AACA;AACA;;AAEA;;AAEA;AACA;;;;;;;;;;;;;ACnCA;AAAA;AAAA;AAAA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,8BAA8B,sEAAsE;AACpG,8BAA8B;AAC9B;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe;AACf;AACA,CAAC;;AAEM;AACP;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACpDA;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAwC;AACE;AACA;AACF;AACqC;AACA;AACrB;AACiB;;AAElB;AACI;AACF;AACI;AACF;AACJ;AACQ;AACV;;AAEc;AACJ;AACR;AACE;AACgB;AACJ;AACR;AACgB;AACJ;AACR;AACI;AACZ;AACoC;AAClC;AACsD;;AAErE;AACoB;AACM;AACV;AACY;AACR;AACM;AACF;AACE;AACF;AACV;AACM;;;;;;;;;;;;;AC7ChE;AAAA;AAAA;AAAA;AAAA;AAA6B;AACQ;AACO;AACQ;;AAErC;AACf,UAAU,2CAAM;AAChB,UAAU,2CAAM;AAChB,gBAAgB,4DAAQ;AACxB;AACA,cAAc,wDAAW;AACzB;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,iDAAiD,oDAAI;;AAErD,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,iEAAiE,4DAAQ;AACzE;;AAEA;AACA,iEAAiE,4DAAQ;AACzE;;AAEA;AACA,uEAAuE,4DAAQ;AAC/E;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;;;;;;;;;;;;;ACtDD;AAAA;AAAA;AAAA;AAAiE;AACpC;;AAEtB;AACP;;AAEA;AACA;;AAEA;AACA,gCAAgC,gEAAW;AAC3C;;AAEA;AACA;;AAEe;AACf,oBAAoB,wDAAI,SAAS,kEAAiB;AAClD,CAAC;;;;;;;;;;;;;AClBD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA6B;AACK;AACI;AACe;AACT;;AAE5C;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU,2CAAM;AAChB,UAAU,2CAAM;AAChB;;AAEA;AACA,uBAAuB,+CAAK;AAC5B,qCAAqC,oDAAI;AACzC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,iEAAiE,4DAAQ;AACzE;;AAEA;AACA,iEAAiE,4DAAQ;AACzE;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,WAAW,+DAAW;AACtB,WAAW,+DAAW;AACtB,WAAW,+DAAW;AACtB,WAAW,+DAAW;AACtB;AACA;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACnFA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAO;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACP;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACnBA;AAAe,4EAAa;;;;;;;;;;;;;ACA5B;AAAe;AACf;AACA,mEAAmE,OAAO;AAC1E,4BAA4B,OAAO;AACnC;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACbD;AAAA;AAA6B;;AAEd;AACf;AACA,gDAAgD,OAAO;AACvD,mBAAmB,OAAO;AAC1B,sBAAsB,OAAO;AAC7B;AACA,EAAE,wDAAI;AACN,CAAC;;;;;;;;;;;;;ACTD;AAAe;AACf;AACA,iEAAiE,OAAO;AACxE;AACA,eAAe,OAAO;AACtB;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACRD;AAAA;AAA6B;;AAEd;AACf;AACA,0DAA0D,OAAO;AACjE,0BAA0B,OAAO;AACjC;AACA;AACA,EAAE,wDAAI;AACN,CAAC;;;;;;;;;;;;;ACTD;AAAA;AAA6B;;AAEd;AACf;AACA,kCAAkC,OAAO;AACzC,mCAAmC,OAAO;AAC1C;AACA;AACA;AACA;AACA,qBAAqB,OAAO;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,wDAAI;AACN,CAAC;;;;;;;;;;;;;ACvBD;AAAA;AAA6B;;AAEd;AACf;AACA,SAAS,wDAAI,8BAA8B,4BAA4B,EAAE;AACzE,CAAC;;AAED;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACXA;AAAA;AAAA;AAA6B;;AAEd;AACf;AACA,SAAS,wDAAI,8BAA8B,0BAA0B,EAAE;AACvE,CAAC;;AAEM;AACP;AACA;AACA;AACA;;;;;;;;;;;;;ACXA;AAAA;AAAuC;;AAExB;AACf,SAAS,6DAAS;AAClB,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAyC;AACN;;AAEpB;AACf;AACA;AACA;AACA,wBAAwB,iDAAG;AAC3B,cAAc,8DAAU;AACxB;AACA;AACA;AACA;;AAEA,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC1BD;AAAe;AACf;AACA;AACA;AACA,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAA6B;;AAEd;AACf,SAAS,wDAAI;AACb,CAAC;;;;;;;;;;;;;ACJD;AAAA;AAAA;AAAA;AAAA;AAAqC;AACI;AACJ;AACP;;AAEf;AACf,cAAc,oDAAQ;AACtB,mBAAmB,sDAAU;AAC7B;AACA,mBAAmB,4DAAQ;AAC3B,iBAAiB,4DAAQ,CAAC,4CAAG;AAC7B,iBAAiB,4DAAQ;;AAEzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,4CAAG,YAAY,4CAAG;AACxC;AACA;AACA;AACA;;AAEA,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA,uDAAuD,qCAAqC,EAAE;AAC9F,sDAAsD,+BAA+B,EAAE;;AAEvF;AACA,kDAAkD,OAAO;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,qEAAqE,4DAAQ;AAC7E;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,0EAA0E,4DAAQ;AAClF;;AAEA;AACA,wEAAwE,4DAAQ;AAChF;;AAEA;AACA,wEAAwE,4DAAQ;AAChF;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC9ED;AAAA;AAAA;AAAO;AACP;AACA;;AAEO;AACP;AACA;;;;;;;;;;;;;ACNA;AAAe;AACf;AACA,CAAC;;;;;;;;;;;;;ACFD;AAAA;AAAA;AAAA;AAAA;AAAiC;AACI;AACK;AACF;;AAExC;AACA;AACA;;AAEe;AACf,aAAa,4DAAQ;AACrB,cAAc,sDAAS;AACvB,eAAe,uDAAU;AACzB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,OAAO;AACtB,iEAAiE,OAAO;AACxE;AACA;AACA;AACA;AACA;;AAEA,+BAA+B,OAAO;AACtC;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oEAAoE,4DAAQ,CAAC,+CAAK;AAClF;;AAEA;AACA,qEAAqE,4DAAQ;AAC7E;;AAEA;AACA,mDAAmD,sDAAS,iCAAiC,4DAAQ,CAAC,+CAAK;AAC3G;;AAEA;AACA,oDAAoD,uDAAU;AAC9D;;AAEA;AACA,CAAC;;;;;;;;;;;;;ACxDD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA6B;AACW;AACF;AACI;AACN;AACI;AACI;AACV;AACG;;AAE9B;AACP,EAAE,yDAAM;AACR,EAAE,wDAAK;AACP,EAAE,0DAAO;AACT,EAAE,yDAAM;AACR,EAAE,uDAAI;AACN,EAAE,2DAAQ;AACV,EAAE,sDAAG;AACL;;AAEe;AACf,aAAa,4DAAQ,CAAC,yDAAM;AAC5B,aAAa,4DAAQ;AACrB;;AAEA;AACA;AACA,qCAAqC,oDAAI;AACzC;AACA;AACA;;AAEA;AACA,oEAAoE,4DAAQ;AAC5E;;AAEA;AACA,oEAAoE,4DAAQ;AAC5E;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;;;;;;;;;;;;;AC7CD;AAAA;AAAmC;;AAEpB;AACf;AACA,6BAA6B,2CAAE;AAC/B;AACA,4BAA4B,4CAAG;AAC/B;AACA,CAAC,EAAC;;;;;;;;;;;;;ACRF;AAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;;;;;;;;;;;ACjBF;AAAA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;;;;;;;;;;;ACbF;AAAe;AACf;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;;;;;;;;;;;ACNF;AAAA;AAAmC;;AAEnC;AACA,kBAAkB,2CAAE,sBAAsB,2CAAE;AAC5C,kBAAkB,4CAAG;AACrB,mBAAmB,4CAAG;;AAEP;AACf;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,OAAO;AAC1B,cAAc,4CAAG;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;;;;;;;;;;;ACvBF;AAAA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;;;;;;;;;;;ACVF;AAAA;AACA;AACA;AACA;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAC;;;;;;;;;;;;;ACzBF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAuC;;AAEvC;AACO;AACA;AACA;AACA;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAEc;AACf,WAAW,0DAAY;AACvB;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC1BA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAkH;AAC1D;AACJ;AACF;;;;;;;;;;;;;ACHlD;AAAA;AAAA;AAA6C;;AAEtC;;AAEP;AACA;AACA;;AAEA;AACA;AACA,MAAM,mEAAS;;AAEA,wEAAS,EAAC;;;;;;;;;;;;;ACZzB;AAAA;AAAA;AAA4C;AACA;;AAE5C;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM,kEAAQ,CAAC,0DAAY;;AAEZ,uEAAQ,EAAC;;;;;;;;;;;;;ACZxB;AAAA;AAAA;AAWiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,UAAU;AACV;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC,iDAAS,cAAc,yDAAS;AACxE,iBAAiB,8CAAM;AACvB;AACA;AACA;AACA,SAAS;AACT;AACA,wCAAwC,kDAAU,cAAc,0DAAU;AAC1E,iBAAiB,+CAAO;AACxB;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,+BAA+B,kBAAkB;AACjD;AACA,KAAK;AACL;AACA;AACA,+BAA+B,kBAAkB;AACjD;AACA,KAAK;AACL;AACA;AACA,+BAA+B,kBAAkB;AACjD;AACA,KAAK;AACL;AACA;AACA,+BAA+B,kBAAkB;AACjD;AACA;AACA;AACA;;AAEA,YAAY,4BAA4B;AACxC;AACA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,iBAAiB,+CAAO,OAAO,wDAAQ;AACvC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,aAAa,kDAAU,OAAO,wDAAQ;AACtC;;AAEA;AACA;AACA,gCAAgC,4DAAY,MAAM,oDAAY;AAC9D,aAAa,oDAAY,OAAO,wDAAQ,WAAW,wDAAQ;AAC3D;;AAEA;AACA;AACA;;AAEA;AACA,aAAa,kDAAU,OAAO,wDAAQ;AACtC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,iBAAiB,8CAAM,OAAO,uDAAO;AACrC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,aAAa,iDAAS,OAAO,uDAAO;AACpC;;AAEA;AACA;AACA,gCAAgC,2DAAW,MAAM,mDAAW;AAC5D,aAAa,mDAAW,OAAO,uDAAO,WAAW,uDAAO;AACxD;;AAEA;AACA;AACA;;AAEA;AACA,aAAa,iDAAS,OAAO,uDAAO;AACpC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;;ACtpBA;AAAA;AAAA;AAAA;AAAqC;AACqB;;AAE1D,UAAU,4DAAQ;AAClB;AACA,CAAC;AACD;AACA,CAAC;AACD,gFAAgF,2DAAc,IAAI,wDAAW;AAC7G,CAAC;AACD;AACA,CAAC;;AAEc,kEAAG,EAAC;AACZ;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAO;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACJP;AAAA;AAAA;AAAA;AAAqC;AACsC;;AAE3E,WAAW,4DAAQ;AACnB,mEAAmE,2DAAc,uBAAuB,2DAAc;AACtH,CAAC;AACD,8BAA8B,yDAAY;AAC1C,CAAC;AACD,yBAAyB,yDAAY;AACrC,CAAC;AACD;AACA,CAAC;;AAEc,mEAAI,EAAC;AACb;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAEuB;;AAOG;;AAOL;;AAKA;;AAKF;;AAKD;;AAmBC;;AAKC;;AAKD;;AAKK;;AAKF;;AAKD;;AAmBC;;AAKC;;AAKD;;;;;;;;;;;;;ACxGtB;AAAA;AAAA;AACA;;AAEe;;AAEf;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qDAAqD;AACrD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,mDAAmD;AACnD,SAAS;AACT,mDAAmD;AACnD;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,6BAA6B,8BAA8B;AAC3D,6BAA6B,0CAA0C,EAAE;AACzE;AACA;;AAEA;AACA;;;;;;;;;;;;;ACrEA;AAAA;AAAA;AAAqC;;AAErC,kBAAkB,4DAAQ;AAC1B;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,SAAS,4DAAQ;AACjB;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA,GAAG;AACH;;AAEe,0EAAW,EAAC;AACpB;;;;;;;;;;;;;ACzBP;AAAA;AAAA;AAAA;AAAqC;AACwB;;AAE7D,aAAa,4DAAQ;AACrB,mEAAmE,2DAAc;AACjF,CAAC;AACD,8BAA8B,2DAAc;AAC5C,CAAC;AACD,yBAAyB,2DAAc;AACvC,CAAC;AACD;AACA,CAAC;;AAEc,qEAAM,EAAC;AACf;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAqC;;AAErC,YAAY,4DAAQ;AACpB;AACA;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;;AAEc,oEAAK,EAAC;AACd;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAqC;AACQ;;AAE7C,aAAa,4DAAQ;AACrB;AACA,CAAC;AACD,8BAA8B,2DAAc;AAC5C,CAAC;AACD,yBAAyB,2DAAc;AACvC,CAAC;AACD;AACA,CAAC;;AAEc,qEAAM,EAAC;AACf;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAqC;AACK;;AAE1C,aAAa,4DAAQ;AACrB;AACA,CAAC;AACD;AACA,CAAC;AACD,yBAAyB,wDAAW;AACpC,CAAC;AACD;AACA,CAAC;;AAEc,qEAAM,EAAC;AACf;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAqC;AACM;;AAE3C,cAAc,4DAAQ;AACtB;AACA,CAAC;AACD,8BAA8B,yDAAY;AAC1C,CAAC;AACD,yBAAyB,yDAAY;AACrC,CAAC;AACD;AACA,CAAC;;AAEc,sEAAO,EAAC;AAChB;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAqC;AACQ;;AAE7C,gBAAgB,4DAAQ;AACxB;AACA,CAAC;AACD,8BAA8B,2DAAc;AAC5C,CAAC;AACD,yBAAyB,2DAAc;AACvC,CAAC;AACD;AACA,CAAC;;AAEc,wEAAS,EAAC;AAClB;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAqC;;AAErC,eAAe,4DAAQ;AACvB;AACA;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;;AAEc,uEAAQ,EAAC;AACjB;;;;;;;;;;;;;ACdP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAqC;AACM;;AAE3C;AACA,SAAS,4DAAQ;AACjB;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH,2BAA2B,yDAAY;AACvC,GAAG;AACH;;AAEO;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5BP;AAAA;AAAA;AAAqC;;AAErC,cAAc,4DAAQ;AACtB;AACA;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;;AAED;AACA;AACA,2DAA2D,4DAAQ;AACnE;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;;AAEe,sEAAO,EAAC;AAChB;;;;;;;;;;;;;ACzBP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAqC;AACsB;;AAE3D;AACA,SAAS,4DAAQ;AACjB;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH,kFAAkF,2DAAc,IAAI,yDAAY;AAChH,GAAG;AACH;;AAEO;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5BP;AAAA;AAAA;AAAqC;;AAErC,WAAW,4DAAQ;AACnB;AACA;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;AACD;AACA,CAAC;;AAED;AACA;AACA,2DAA2D,4DAAQ;AACnE;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;;AAEe,mEAAI,EAAC;AACb;;;;;;;;;;;;ACzBP;AACA,CAAC;AACD;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;;AAGA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA,+BAA+B,gBAAgB,EAAE;AACjD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B,mDAAmD;AACnD;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;;AAGL;;;AAGA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,0CAA0C,OAAO;AACjD;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,aAAa;;AAE9B;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,sBAAsB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,UAAU,eAAe;AACzB;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,YAAY,aAAa;;AAEzB;AACA,sBAAsB,SAAS;AAC/B;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA,WAAW;AACX;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,KAAK;;AAErB;AACA,iBAAiB,UAAU;AAC3B;AACA,uBAAuB,OAAO;AAC9B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU,UAAU;;AAEpB;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,sBAAsB;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA,KAAK;AACL;;AAEA;AACA,qCAAqC;AACrC;;AAEA;;AAEA,aAAa;AACb;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,KAAK;AACjB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,GAAG;AACtB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,yBAAyB,gBAAgB;;AAEzC;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA,UAAU,cAAc;;AAExB;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,yBAAyB,KAAK;AAC9B;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,OAAO;AACP,uBAAuB,QAAQ;AAC/B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,YAAY,MAAM;AAClB;AACA;AACA;AACA;;AAEA;AACA,YAAY,uBAAuB;AACnC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,uBAAuB;AACxC;;AAEA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc,uBAAuB;AACrC;AACA;AACA;AACA;;AAEA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,cAAc,WAAW;;AAEzB;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,WAAW;AACX;AACA;AACA,WAAW;;AAEX;AACA;;AAEA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;;AAEA,SAAS;AACT;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,GAAG;;;AAGH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA,qBAAqB;AACrB;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,WAAW;AACX;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA,UAAU,SAAS;AACnB;AACA;;;AAGA;;AAEA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA,UAAU,KAAK;AACf;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,WAAW;AACX;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA,eAAe,0BAA0B;;AAEzC;AACA,0BAA0B,gCAAgC;AAC1D;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,SAAS;AACtC;AACA;AACA,OAAO;AACP;AACA;;AAEA,YAAY,KAAK;AACjB;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0BAA0B,SAAS;AACnC;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,SAAS;;AAE1B;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uBAAuB,eAAe;;AAEtC;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,KAAK;AACtB;;AAEA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;;AAEA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,6BAA6B,OAAO;;AAEpC;AACA,uBAAuB,OAAO;AAC9B;AACA,mBAAmB,oBAAoB;AACvC;AACA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU,iBAAiB;;AAE3B;AACA,UAAU,aAAa;;AAEvB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;;AAGA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,sBAAsB;AACpC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,eAAe;AAChC;;AAEA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB,mBAAmB;AACnB,mBAAmB;AACnB,mBAAmB;AACnB;AACA,0BAA0B,6BAA6B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,eAAe;AAC9B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;;AAEA;;AAEA;AACA;;;AAGA;;;AAGA;AACA,MAAM,IAAyC;AAC/C,IAAI,mCAAO;AACX;AACA,KAAK;AAAA,oGAAC;;AAEN;AACA,GAAG,MAAM,EAWN;AACH,CAAC;;;;;;;;;;;;;AC79DY;;AAEb,6BAA6B,mBAAO,CAAC,oHAA8C;;AAEnF;AACA;;AAEA,uCAAuC,mBAAO,CAAC,gEAAY;;AAE3D;AACA,0DAA0D,yJAAyJ;AACnN;;AAEA,oC;;;;;;;;;;;;ACba;;AAEb;AACA;;AAEA;AACA,qFAAqF;AACrF;;AAEA,oC;;;;;;;;;;;;ACTa;;AAEb;AACA;AACA;;AAEA;AACA,6DAA6D,mHAAmH;AAChL,E;;;;;;;;;;;;ACRa;;AAEb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,aAAa;AACxB,WAAW,gBAAgB;AAC3B,WAAW,SAAS;AACpB,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,aAAa;AACxB,WAAW,gBAAgB;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,yDAAyD,OAAO;AAChE;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,yCAAyC,SAAS;AAClD;AACA;;AAEA;AACA,GAAG;AACH;AACA;;AAEA,eAAe,YAAY;AAC3B;;AAEA;AACA,2DAA2D;AAC3D,+DAA+D;AAC/D,mEAAmE;AACnE,uEAAuE;AACvE;AACA,0DAA0D,SAAS;AACnE;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,SAAS;AACpB,WAAW,EAAE;AACb,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,SAAS;AACpB,WAAW,EAAE;AACb,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,WAAW,SAAS;AACpB,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB,aAAa,aAAa;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,2DAA2D,YAAY;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,gBAAgB;AAC3B,aAAa,aAAa;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI,IAA6B;AACjC;AACA;;;;;;;;;;;;;AC/UA;AAAA;AAA8B;;AAE9B;AACA,aAAa,gDAAI;;AAEF,qEAAM,EAAC;;;;;;;;;;;;;ACLtB;AAAA;AAAA;AAAA;AAAkC;AACM;AACU;;AAElD;AACA;AACA;;AAEA;AACA,qBAAqB,kDAAM,GAAG,kDAAM;;AAEpC;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,6DAAS;AACf,MAAM,kEAAc;AACpB;;AAEe,yEAAU,EAAC;;;;;;;;;;;;;AC3B1B;AAAA;AACA;;AAEe,yEAAU,EAAC;;;;;;;;;;;;;;ACH1B;AAAA;AAAkC;;AAElC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qBAAqB,kDAAM,GAAG,kDAAM;;AAEpC;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEe,wEAAS,EAAC;;;;;;;;;;;;;AC7CzB;AAAA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEe,6EAAc,EAAC;;;;;;;;;;;;;ACrB9B;AAAA;AAA0C;;AAE1C;AACA;;AAEA;AACA,WAAW,sDAAU;;AAEN,mEAAI,EAAC;;;;;;;;;;;;;ACRpB;AAAA;AAAA;AAAA;AAAqC;AACV;AACU;;AAErC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,OAAO,YAAY;AAC9B,WAAW,QAAQ;AACnB;AACA,WAAW,OAAO;AAClB;AACA,WAAW,QAAQ;AACnB;AACA,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,8CAA8C,kBAAkB;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS,4DAAQ;AACjB,MAAM,4DAAQ;AACd;AACA;AACA,iCAAiC,4DAAQ;AACzC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,uDAAG;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yDAAyD,uDAAG;AAC5D;;AAEA;AACA,eAAe,uDAAG;AAClB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,uEAAQ,EAAC;;;;;;;;;;;;;AC9LxB;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,uEAAQ,EAAC;;;;;;;;;;;;;AC9BxB;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,2EAAY,EAAC;;;;;;;;;;;;;AC5B5B;AAAA;AAAA;AAA0C;AACG;;AAE7C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,gEAAY,WAAW,8DAAU;AACtC;;AAEe,uEAAQ,EAAC;;;;;;;;;;;;;AC5BxB;AAAA;AAA8B;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,SAAS,gDAAI;AACb;;AAEe,kEAAG,EAAC;;;;;;;;;;;;;ACtBnB;AAAA;AAAA;AAAqC;AACA;;AAErC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,OAAO,YAAY;AAC9B,WAAW,QAAQ;AACnB;AACA,WAAW,QAAQ;AACnB;AACA,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD,oBAAoB;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM,4DAAQ;AACd;AACA;AACA;AACA,SAAS,4DAAQ;AACjB;AACA;AACA;AACA,GAAG;AACH;;AAEe,uEAAQ,EAAC;;;;;;;;;;;;;ACpExB;AAAA;AAAA;AAAqC;AACA;;AAErC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,4DAAQ;AACd;AACA;AACA,MAAM,4DAAQ;AACd;AACA,YAAY,4DAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,uEAAQ,EAAC;;;;;;;;;;;;ACjExB,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACNA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,cAAc,mBAAO,CAAC,qDAAY;AAClC,cAAc,mBAAO,CAAC,qDAAY;AAClC,cAAc,mBAAO,CAAC,qDAAY;;AAElC;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/BA,qBAAqB,mBAAO,CAAC,mEAAmB;AAChD,sBAAsB,mBAAO,CAAC,qEAAoB;AAClD,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/BA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACNA,oBAAoB,mBAAO,CAAC,iEAAkB;AAC9C,qBAAqB,mBAAO,CAAC,mEAAmB;AAChD,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,kBAAkB,mBAAO,CAAC,6DAAgB;;AAE1C;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/BA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACNA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACNA,eAAe,mBAAO,CAAC,uDAAa;AACpC,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,kBAAkB,mBAAO,CAAC,6DAAgB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;AC1BA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,eAAe,mBAAO,CAAC,uDAAa;AACpC,eAAe,mBAAO,CAAC,uDAAa;AACpC,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC1BA,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACLA,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACLA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACNA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,EAAE;AACb,WAAW,MAAM;AACjB,aAAa,EAAE;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACxBA,kBAAkB,mBAAO,CAAC,6DAAgB;;AAE1C;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChBA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,EAAE;AACb,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACrBA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,kBAAkB,mBAAO,CAAC,2DAAe;AACzC,cAAc,mBAAO,CAAC,mDAAW;AACjC,eAAe,mBAAO,CAAC,qDAAY;AACnC,cAAc,mBAAO,CAAC,qDAAY;AAClC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChDA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,MAAM;AACjB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnBA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACtBA,SAAS,mBAAO,CAAC,yCAAM;;AAEvB;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,qBAAqB,mBAAO,CAAC,mEAAmB;;AAEhD;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB,WAAW,SAAS;AACpB,aAAa,aAAa;AAC1B;AACA;;AAEA;;;;;;;;;;;;ACbA,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;;;;;;;;;;;;ACpBA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,QAAQ;AACnB,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACvBA,oBAAoB,mBAAO,CAAC,iEAAkB;;AAE9C;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,OAAO;AACpB;AACA;;AAEA;;;;;;;;;;;;ACfA,cAAc,mBAAO,CAAC,qDAAY;AAClC,WAAW,mBAAO,CAAC,6CAAQ;;AAE3B;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACfA,eAAe,mBAAO,CAAC,uDAAa;AACpC,YAAY,mBAAO,CAAC,iDAAU;;AAE9B;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,aAAa;AACxB,aAAa,EAAE;AACf;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACvBA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,cAAc,mBAAO,CAAC,mDAAW;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnBA,aAAa,mBAAO,CAAC,mDAAW;AAChC,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,qBAAqB,mBAAO,CAAC,mEAAmB;;AAEhD;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC3BA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,aAAa;AACxB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACZA,oBAAoB,mBAAO,CAAC,iEAAkB;AAC9C,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,oBAAoB,mBAAO,CAAC,iEAAkB;;AAE9C;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,EAAE;AACb,WAAW,OAAO;AAClB,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnBA,eAAe,mBAAO,CAAC,uDAAa;AACpC,oBAAoB,mBAAO,CAAC,iEAAkB;AAC9C,wBAAwB,mBAAO,CAAC,yEAAsB;AACtD,eAAe,mBAAO,CAAC,uDAAa;AACpC,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACzEA,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjBA,sBAAsB,mBAAO,CAAC,qEAAoB;AAClD,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,WAAW,QAAQ;AACnB;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC3BA,YAAY,mBAAO,CAAC,iDAAU;AAC9B,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,aAAa,mBAAO,CAAC,mDAAW;AAChC,cAAc,mBAAO,CAAC,mDAAW;AACjC,eAAe,mBAAO,CAAC,qDAAY;AACnC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClFA,YAAY,mBAAO,CAAC,iDAAU;AAC9B,kBAAkB,mBAAO,CAAC,6DAAgB;;AAE1C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,MAAM;AACjB,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC7DA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACXA,iBAAiB,mBAAO,CAAC,yDAAc;AACvC,eAAe,mBAAO,CAAC,uDAAa;AACpC,eAAe,mBAAO,CAAC,qDAAY;AACnC,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;AACA;AACA,oCAAoC;;AAEpC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC9CA,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,eAAe,mBAAO,CAAC,qDAAY;AACnC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC3DA,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,0BAA0B,mBAAO,CAAC,6EAAwB;AAC1D,eAAe,mBAAO,CAAC,qDAAY;AACnC,cAAc,mBAAO,CAAC,mDAAW;AACjC,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC9BA,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC7BA,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,8BAA8B,mBAAO,CAAC,qFAA4B;;AAElE;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACrBA,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,UAAU,mBAAO,CAAC,2CAAO;AACzB,YAAY,mBAAO,CAAC,+CAAS;AAC7B,YAAY,mBAAO,CAAC,iDAAU;AAC9B,yBAAyB,mBAAO,CAAC,2EAAuB;AACxD,8BAA8B,mBAAO,CAAC,qFAA4B;AAClE,YAAY,mBAAO,CAAC,iDAAU;;AAE9B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChCA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACbA,cAAc,mBAAO,CAAC,qDAAY;;AAElC;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACfA,eAAe,mBAAO,CAAC,qDAAY;AACnC,eAAe,mBAAO,CAAC,uDAAa;AACpC,kBAAkB,mBAAO,CAAC,6DAAgB;;AAE1C;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChBA,eAAe,mBAAO,CAAC,qDAAY;AACnC,qBAAqB,mBAAO,CAAC,mEAAmB;AAChD,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;;;;;;;;;;;;ACrBA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnBA,aAAa,mBAAO,CAAC,mDAAW;AAChC,eAAe,mBAAO,CAAC,uDAAa;AACpC,cAAc,mBAAO,CAAC,mDAAW;AACjC,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpCA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACbA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACZA,wBAAwB,mBAAO,CAAC,uEAAqB;;AAErD;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,aAAa;AAC1B;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACbA,cAAc,mBAAO,CAAC,mDAAW;AACjC,YAAY,mBAAO,CAAC,iDAAU;AAC9B,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA,WAAW,mBAAO,CAAC,+CAAS;;AAE5B;AACA;;AAEA;;;;;;;;;;;;ACLA,kBAAkB,mBAAO,CAAC,2DAAe;;AAEzC;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/BA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACxBA,gBAAgB,mBAAO,CAAC,yDAAc;;AAEtC;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA,GAAG;AACH,CAAC;;AAED;;;;;;;;;;;;ACVA,eAAe,mBAAO,CAAC,uDAAa;AACpC,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,MAAM;AACjB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClFA,aAAa,mBAAO,CAAC,mDAAW;AAChC,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,SAAS,mBAAO,CAAC,yCAAM;AACvB,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/GA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACxFA;AACA;;AAEA;;;;;;;;;;;;;ACHA,qBAAqB,mBAAO,CAAC,mEAAmB;AAChD,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,WAAW,mBAAO,CAAC,6CAAQ;;AAE3B;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACfA,gBAAgB,mBAAO,CAAC,yDAAc;;AAEtC;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjBA,yBAAyB,mBAAO,CAAC,2EAAuB;AACxD,WAAW,mBAAO,CAAC,6CAAQ;;AAE3B;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACvBA,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChBA,aAAa,mBAAO,CAAC,mDAAW;;AAEhC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC7CA,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,gBAAgB,mBAAO,CAAC,uDAAa;;AAErC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;;;;;;;;;;;;AC7BA,eAAe,mBAAO,CAAC,uDAAa;AACpC,UAAU,mBAAO,CAAC,6CAAQ;AAC1B,cAAc,mBAAO,CAAC,qDAAY;AAClC,UAAU,mBAAO,CAAC,6CAAQ;AAC1B,cAAc,mBAAO,CAAC,qDAAY;AAClC,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACzDA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACZA,eAAe,mBAAO,CAAC,uDAAa;AACpC,kBAAkB,mBAAO,CAAC,2DAAe;AACzC,cAAc,mBAAO,CAAC,mDAAW;AACjC,cAAc,mBAAO,CAAC,qDAAY;AAClC,eAAe,mBAAO,CAAC,qDAAY;AACnC,YAAY,mBAAO,CAAC,iDAAU;;AAE9B;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,aAAa;AACxB,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACtCA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChBA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC7BA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACtBA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACtBA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACxBA,cAAc,mBAAO,CAAC,mDAAW;AACjC,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC5BA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACdA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnBA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;;ACjBA,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACZA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClCA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;;AClBA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACfA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACzBA,WAAW,mBAAO,CAAC,+CAAS;AAC5B,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,UAAU,mBAAO,CAAC,6CAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjBA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACfA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACfA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACrBA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;;AAEA;;;;;;;;;;;;ACjBA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnBA,cAAc,mBAAO,CAAC,mDAAW;;AAEjC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;;AAEA;;;;;;;;;;;;ACzBA,gBAAgB,mBAAO,CAAC,yDAAc;;AAEtC;AACA;;AAEA;;;;;;;;;;;;ACLA,cAAc,mBAAO,CAAC,qDAAY;;AAElC;AACA;;AAEA;;;;;;;;;;;;ACLA,+DAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA,kBAAkB,KAA0B;;AAE5C;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH,CAAC;;AAED;;;;;;;;;;;;;AC7BA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACrBA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACdA,YAAY,mBAAO,CAAC,iDAAU;;AAE9B;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACnCA,iBAAiB,mBAAO,CAAC,2DAAe;;AAExC;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;;ACRA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClBA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACbA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;;AAEA;;;;;;;;;;;;ACjBA,sBAAsB,mBAAO,CAAC,qEAAoB;AAClD,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;;AAEA;;;;;;;;;;;;ACbA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpCA,gBAAgB,mBAAO,CAAC,yDAAc;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACdA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjBA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,EAAE;AACf;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACbA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,UAAU,mBAAO,CAAC,6CAAQ;AAC1B,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjCA;AACA;AACA;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,EAAE;AACb,WAAW,OAAO;AAClB,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACtBA,oBAAoB,mBAAO,CAAC,iEAAkB;;AAE9C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,CAAC;;AAED;;;;;;;;;;;;AC1BA,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,cAAc;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;;;;;;;;;;;;ACzBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,SAAS;AACtB;AACA;AACA,wCAAwC,SAAS;AACjD;AACA;AACA,WAAW,SAAS,GAAG,SAAS;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACzBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA,iBAAiB;AACjB,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpCA,kBAAkB,mBAAO,CAAC,6DAAgB;AAC1C,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,cAAc,mBAAO,CAAC,mDAAW;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA,MAAM,8CAA8C;AACpD,MAAM;AACN;AACA;AACA,gCAAgC,kBAAkB,EAAE;AACpD;AACA;AACA;AACA,oBAAoB,4BAA4B;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/CA,cAAc,mBAAO,CAAC,qDAAY;;AAElC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,aAAa;AACxB,WAAW,EAAE;AACb,aAAa,EAAE;AACf;AACA;AACA,iBAAiB,QAAQ,OAAO,SAAS,EAAE;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChCA,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,cAAc,mBAAO,CAAC,qDAAY;;AAElC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,aAAa;AACxB,aAAa,QAAQ;AACrB;AACA;AACA,0BAA0B,gBAAgB,SAAS,GAAG;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,EAAE;AACf;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpBA,eAAe,mBAAO,CAAC,uDAAa;AACpC,uBAAuB,mBAAO,CAAC,uEAAqB;AACpD,eAAe,mBAAO,CAAC,uDAAa;AACpC,0BAA0B,mBAAO,CAAC,6EAAwB;;AAE1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;;;;;;;;;;;AC7BA,sBAAsB,mBAAO,CAAC,qEAAoB;AAClD,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA,6BAA6B,kBAAkB,EAAE;AACjD;AACA;AACA;AACA;AACA;AACA,8CAA8C,kBAAkB,EAAE;AAClE;AACA;AACA;;AAEA;;;;;;;;;;;;ACnCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACzBA,iBAAiB,mBAAO,CAAC,yDAAc;AACvC,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChCA,kBAAkB,mBAAO,CAAC,2DAAe;AACzC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AChCA,yDAAW,mBAAO,CAAC,+CAAS;AAC5B,gBAAgB,mBAAO,CAAC,uDAAa;;AAErC;AACA,kBAAkB,KAA0B;;AAE5C;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;;ACrCA,kBAAkB,mBAAO,CAAC,6DAAgB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA,iBAAiB;AACjB,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClCA,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,eAAe,mBAAO,CAAC,qDAAY;;AAEnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpCA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClCA,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACrCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC5BA,iBAAiB,mBAAO,CAAC,2DAAe;AACxC,mBAAmB,mBAAO,CAAC,6DAAgB;;AAE3C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC5BA,uBAAuB,mBAAO,CAAC,uEAAqB;AACpD,gBAAgB,mBAAO,CAAC,yDAAc;AACtC,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC1BA,oBAAoB,mBAAO,CAAC,iEAAkB;AAC9C,eAAe,mBAAO,CAAC,uDAAa;AACpC,kBAAkB,mBAAO,CAAC,2DAAe;;AAEzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C;AAC3C;AACA,2DAA2D;;AAE3D;AACA,+CAA+C;AAC/C;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;AACA;AACA;;AAEA;AACA,yBAAyB;AACzB,yBAAyB;AACzB;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,0BAA0B,MAAM,aAAa,OAAO;;AAEpD;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,EAAE;AACnD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,2CAA2C,EAAE;;AAE7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,eAAe;AACf,cAAc;AACd,cAAc;AACd,gBAAgB;AAChB,eAAe;AACf;;AAEA;AACA;AACA,UAAU;AACV,SAAS;AACT,SAAS;AACT,WAAW;AACX,UAAU;AACV;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,KAA0B;;AAE9C;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,MAAM;AACnB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,SAAS;AACtB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,MAAM;AACnB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,QAAQ;AACrB;AACA,eAAe,EAAE;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,QAAQ;AACrB;AACA,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,aAAa,OAAO;AACpB,aAAa,QAAQ;AACrB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,aAAa,SAAS;AACtB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,EAAE;AACf,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,aAAa;AAC1B,aAAa,SAAS;AACtB,aAAa,EAAE;AACf,aAAa,QAAQ;AACrB;AACA,aAAa,SAAS;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,SAAS;AACtB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,SAAS;AACtB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,aAAa,SAAS;AACtB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,MAAM;AACnB,eAAe,OAAO;AACtB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,aAAa,OAAO;AACpB,eAAe,EAAE;AACjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB,aAAa,EAAE;AACf,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB,eAAe,SAAS;AACxB;AACA;AACA,cAAc,2BAA2B;AACzC;AACA;AACA,mBAAmB,gCAAgC;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,6BAA6B;AAC9D;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe,QAAQ;AACvB;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kEAAkE;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW;AACX;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;AACA;AACA,oCAAoC,6BAA6B,EAAE;AACnE;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,eAAe,QAAQ;AACvB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,EAAE;AACnB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,6BAA6B;AAC5C,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT,gBAAgB;AAChB,OAAO;;AAEP;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qEAAqE;AACrE;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,QAAQ;AACvB,eAAe,QAAQ;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,YAAY;AAC3B,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,mBAAmB;AAClC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,gBAAgB,QAAQ;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,gBAAgB,QAAQ;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,eAAe,OAAO,WAAW;AACjC,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,4BAA4B;;AAE5B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,WAAW;AACjC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,WAAW;AACjC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC,+CAA+C;AACpF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,oEAAoE;AACpE;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,eAAe,OAAO;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB;AACA,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,0CAA0C;AAC1C,wCAAwC;AACxC,+DAA+D;AAC/D,iEAAiE;AACjE;AACA;AACA,cAAc;AACd;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,cAAc;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB,MAAM;AACvB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,SAAS,GAAG,SAAS,KAAK,SAAS;AAC3D,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D;AACA,mCAAmC,iBAAiB;AACpD,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,oCAAoC;AAC9C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,4CAA4C,kBAAkB,EAAE;AAChE;AACA;AACA;AACA,gCAAgC,qCAAqC;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,qCAAqC;AAC/C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,uCAAuC,kBAAkB,EAAE;AAC3D;AACA;AACA;AACA,2BAA2B,oCAAoC;AAC/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,qCAAqC;AAC/C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,uCAAuC,2BAA2B,EAAE;AACpE;AACA;AACA;AACA,2BAA2B,kCAAkC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,oCAAoC;AAC9C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,2CAA2C,4BAA4B,EAAE;AACzE;AACA;AACA;AACA,+BAA+B,mCAAmC;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,SAAS,KAAK,SAAS,GAAG,SAAS;AAC7D,eAAe,SAAS;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D,sBAAsB,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,qBAAqB,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS;AAClE;AACA,4BAA4B,SAAS,GAAG,SAAS;AACjD;AACA,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,qBAAqB,iBAAiB,GAAG,iBAAiB,GAAG,iBAAiB;AAC9E;AACA,8BAA8B,iBAAiB;AAC/C;AACA,eAAe,iBAAiB,GAAG,iBAAiB;AACpD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,qBAAqB;AACpC,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;;AAEP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,iCAAiC,SAAS,eAAe,YAAY,EAAE;AACvE;AACA;AACA;AACA,iCAAiC,SAAS;AAC1C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,qCAAqC,SAAS,eAAe,YAAY,EAAE;AAC3E;AACA;AACA;AACA,qCAAqC,SAAS;AAC9C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,oCAAoC;AAC9C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,4CAA4C,kBAAkB,EAAE;AAChE;AACA;AACA;AACA,gCAAgC,qCAAqC;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,qCAAqC;AAC/C,UAAU,qCAAqC;AAC/C,UAAU;AACV;AACA;AACA,uCAAuC,kBAAkB,EAAE;AAC3D;AACA;AACA;AACA,2BAA2B,oCAAoC;AAC/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS,KAAK,SAAS,GAAG,SAAS;AACtD,eAAe,SAAS,GAAG,SAAS;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D,sBAAsB,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA,eAAe,iBAAiB,GAAG,iBAAiB,GAAG,iBAAiB;AACxE;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS,GAAG,SAAS,GAAG,SAAS;AACnD,eAAe,SAAS,GAAG,SAAS;AACpC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB,GAAG,iBAAiB;AAChF;AACA;AACA,eAAe,iBAAiB,GAAG,iBAAiB;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS,KAAK,SAAS,GAAG,SAAS;AACpD,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA,uBAAuB,iBAAiB,GAAG,iBAAiB;AAC5D,sBAAsB,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA,eAAe,iBAAiB,GAAG,iBAAiB;AACpD;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc,OAAO,QAAQ,SAAS,GAAG,SAAS,GAAG;AACrD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,+BAA+B;AACzC,UAAU,+BAA+B;AACzC,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,8BAA8B;;AAExE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,8BAA8B;AACxC,UAAU;AACV;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA,cAAc;AACd;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,gBAAgB,OAAO;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,+CAA+C;AACzD,UAAU;AACV;AACA;AACA;AACA,uBAAuB,oCAAoC;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,UAAU,8CAA8C;AACxD,UAAU;AACV;AACA;AACA,oCAAoC,kBAAkB,EAAE;AACxD;AACA;AACA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA,UAAU,+CAA+C;AACzD,UAAU,gDAAgD;AAC1D,UAAU;AACV;AACA;AACA,kCAAkC,mBAAmB,EAAE;AACvD;AACA;AACA;AACA,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,aAAa;AAC9B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,oBAAoB;AACnC,eAAe,EAAE;AACjB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,sBAAsB;AACrC;AACA,eAAe,KAAK;AACpB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,UAAU,4BAA4B;AACtC,UAAU;AACV;AACA;AACA;AACA;AACA,QAAQ;AACR,cAAc,OAAO,4BAA4B,QAAQ,8BAA8B;AACvF;AACA;AACA,cAAc,UAAU,4BAA4B,YAAY,8BAA8B;AAC9F;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,iBAAiB;AAC/B;AACA;AACA;AACA,UAAU,mBAAmB;AAC7B,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,qCAAqC;AACpD;AACA,eAAe,SAAS;AACxB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,gDAAgD;AAC1D,UAAU,+CAA+C;AACzD,UAAU;AACV;AACA;AACA,uCAAuC,iBAAiB,EAAE;AAC1D;AACA;AACA;AACA,2BAA2B,4BAA4B;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,cAAc,iBAAiB,EAAE;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,iBAAiB,yBAAyB;AAC1C;AACA;AACA,QAAQ,IAAI;AACZ,cAAc,8BAA8B;AAC5C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA,UAAU,+CAA+C;AACzD,UAAU;AACV;AACA;AACA,oCAAoC,kBAAkB,EAAE;AACxD;AACA;AACA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,oBAAoB;AACnC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,gBAAgB,OAAO;AACvB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,mCAAmC;AAC7C,UAAU;AACV;AACA;AACA;AACA,sBAAsB,oCAAoC;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,yBAAyB;AACxC;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU,8BAA8B;AACxC,UAAU;AACV;AACA;AACA,qCAAqC,eAAe,EAAE;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,oBAAoB,iCAAiC;AACrD,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,QAAQ;AACvB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,QAAQ;AACvB;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,kDAAkD,kBAAkB;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,KAAK;AACpB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,qBAAqB;AACpC,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,QAAQ;AACvB;AACA,eAAe,QAAQ;AACvB;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA,uDAAuD,oBAAoB;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB;AACA,6BAA6B,mBAAmB,cAAc,EAAE,EAAE;AAClE;AACA;AACA,6BAA6B,mBAAmB,cAAc,EAAE,EAAE;AAClE;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA,iCAAiC,kBAAkB,EAAE;AACrD;AACA;AACA;AACA;AACA;AACA,kDAAkD,kBAAkB,EAAE;AACtE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB;AACrB;AACA,0BAA0B,SAAS;AACnC;AACA;AACA,0BAA0B,SAAS;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,iBAAiB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,MAAM;AACvB;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS;AAC1B,cAAc;AACd;AACA,iBAAiB,SAAS;AAC1B,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS;AAC1B,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS,GAAG,SAAS,GAAG,SAAS;AAClD,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS,GAAG,SAAS,GAAG,SAAS;AAClD,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,MAAM;AACvB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,mBAAmB,SAAS,GAAG,SAAS,GAAG,SAAS;AACpD,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,uBAAuB,OAAO,SAAS,EAAE,GAAG,OAAO,iBAAiB,EAAE;AACtE,cAAc,OAAO,iBAAiB;AACtC;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA,qBAAqB,4BAA4B;AACjD,qBAAqB,6BAA6B;AAClD,qBAAqB;AACrB;AACA;AACA,qCAAqC,mBAAmB,EAAE;AAC1D;AACA;AACA;AACA,yBAAyB,2BAA2B;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA,qBAAqB,4BAA4B;AACjD,qBAAqB,6BAA6B;AAClD,qBAAqB;AACrB;AACA;AACA,yCAAyC,mBAAmB,EAAE;AAC9D;AACA;AACA;AACA,6BAA6B,4BAA4B;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB,OAAO,SAAS;AACrC,6BAA6B,gBAAgB,SAAS,GAAG;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA,8BAA8B,gBAAgB,SAAS,GAAG;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,QAAQ;AACR,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,KAAK;AACpB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB,QAAQ,OAAO,oBAAoB,EAAE;AAC1D;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA,QAAQ;AACR,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA,qBAAqB,+BAA+B;AACpD,qBAAqB;AACrB;AACA;AACA,uCAAuC,cAAc,EAAE;AACvD,cAAc,2BAA2B;AACzC;AACA;AACA;AACA,cAAc,2BAA2B;AACzC;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,gBAAgB,SAAS,GAAG,SAAS;AACrC;AACA;AACA;AACA,gBAAgB,SAAS,GAAG,SAAS;AACrC;AACA;AACA;AACA,cAAc,QAAQ,iBAAiB,GAAG,iBAAiB;AAC3D;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,UAAU;AACzB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,oBAAoB;AACpB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA,gCAAgC;AAChC,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB;AACrB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB,QAAQ,OAAO,+BAA+B,EAAE;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,cAAc,OAAO,WAAW;AAChC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,oBAAoB,yBAAyB;AAC7C;AACA,QAAQ,IAAI;AACZ,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,iBAAiB,QAAQ;AACzB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA;AACA;AACA;AACA,cAAc,QAAQ,QAAQ,EAAE;AAChC;AACA;AACA;AACA;AACA;AACA,cAAc,QAAQ,QAAQ,EAAE;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,qBAAqB,QAAQ,OAAO,SAAS,EAAE;AAC/C;AACA,iDAAiD,cAAc,EAAE;AACjE;AACA;AACA;AACA,iDAAiD,sBAAsB,EAAE;AACzE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,aAAa;AAC5B,eAAe,SAAS;AACxB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,cAAc,OAAO,WAAW;AAChC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,QAAQ;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,KAAK;AACvC;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,eAAe,gBAAgB;AAC/B,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,eAAe,OAAO;AACtB;AACA,gBAAgB,OAAO;AACvB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA,iBAAiB,iBAAiB;AAClC;AACA;AACA;AACA;AACA,iBAAiB,sBAAsB;AACvC,qBAAqB,UAAU;AAC/B;AACA;AACA,sEAAsE,2BAA2B,EAAE;AACnG,iBAAiB,8BAA8B;AAC/C;AACA;AACA;AACA,4DAA4D;AAC5D,iBAAiB,mBAAmB;AACpC;AACA;AACA;AACA;AACA,0CAA0C,OAAO;AACjD,iBAAiB,oBAAoB;AACrC;AACA;AACA;AACA;AACA,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA,qDAAqD,2BAA2B,EAAE;AAClF,wCAAwC,aAAa,eAAe,EAAE;AACtE,iBAAiB,8BAA8B;AAC/C;AACA;AACA;AACA,wDAAwD,qCAAqC;AAC7F;AACA;AACA;AACA;AACA,0DAA0D,qBAAqB;AAC/E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C,YAAY;AACvD,0CAA0C,QAAQ;AAClD,iBAAiB,qBAAqB;AACtC;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+BAA+B;;AAE/B,mCAAmC;AACnC;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,wBAAwB;AAC/C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;;AAEP,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,mBAAmB;AACjD;AACA;AACA;AACA;AACA,4CAA4C;;AAE5C;AACA,uDAAuD;AACvD;AACA;AACA,6BAA6B,EAAE;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C,+BAA+B,iCAAiC;AAChE,cAAc;AACd;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,gBAAgB,OAAO;AACvB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC;AACjC,aAAa,QAAQ,QAAQ,UAAU,aAAa;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,cAAc;AAC7B,gBAAgB,OAAO;AACvB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAAS;AACxB,eAAe,KAAK;AACpB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,qBAAqB;AACpC,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,qBAAqB,SAAS;AAC9B,sBAAsB,kBAAkB;AACxC;AACA;AACA;AACA,aAAa,iBAAiB;AAC9B;AACA;AACA,aAAa,iBAAiB;AAC9B;AACA;AACA,aAAa,qBAAqB;AAClC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,iBAAiB;AAC3B,UAAU;AACV;AACA;AACA,qCAAqC,mBAAmB,cAAc,EAAE,EAAE;AAC1E,eAAe,iBAAiB;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA,4CAA4C,SAAS;AACrD;AACA;AACA,eAAe,SAAS,GAAG,SAAS;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,EAAE;AACnB;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,8CAA8C;AACxD,UAAU;AACV;AACA;AACA;AACA,mCAAmC,mCAAmC;AACtE,eAAe,8CAA8C;AAC7D;AACA;AACA;AACA,eAAe,4BAA4B;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,yBAAyB;AACnC,UAAU;AACV;AACA;AACA,oCAAoC,iBAAiB;AACrD,eAAe,yBAAyB;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,yBAAyB;AACnC,UAAU;AACV;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,OAAO,qBAAqB,EAAE;AACxC,UAAU,OAAO,qBAAqB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,KAAK;AACpB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,eAAe,OAAO;AACtB,eAAe,OAAO,YAAY;AAClC,eAAe,QAAQ;AACvB,iBAAiB,gBAAgB;AACjC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,gBAAgB,mBAAmB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,mBAAmB,GAAG,iBAAiB;AACvD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4BAA4B,qDAAqD;AACjF;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,yBAAyB;AACxC;AACA,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,UAAU,OAAO,SAAS,EAAE;AAC5B,UAAU,OAAO,SAAS;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,SAAS;AAC1B;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA,gBAAgB,IAAI;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kEAAkE;AAClE;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,SAAS;AACxB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,EAAE;AACjB,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,qCAAqC,YAAY,EAAE;AACnD,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS;AACpE;AACA,sCAAsC,YAAY,EAAE;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,EAAE;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,EAAE;AACnB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS;AAC5C;AACA,qCAAqC,YAAY,EAAE;AACnD,cAAc;AACd;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,OAAO;AACtB,eAAe,OAAO;AACtB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB,eAAe,SAAS;AACxB,iBAAiB,OAAO;AACxB;AACA;AACA,uBAAuB,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS;AACpE;AACA,qCAAqC,YAAY,EAAE;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK,MAAM,iBAAiB;;AAE5B;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,mCAAmC,4DAA4D;AAC/F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,yCAAyC;AACtE;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;;AAEH;;AAEA;AACA;;AAEA;AACA,MAAM,IAA0E;AAChF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI,mCAAO;AACX;AACA,KAAK;AAAA,oGAAC;AACN;AACA;AACA,OAAO,EASJ;AACH,CAAC;;;;;;;;;;;;;ACvthBD,eAAe,mBAAO,CAAC,uDAAa;;AAEpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB,aAAa,SAAS;AACtB;AACA;AACA,iBAAiB;AACjB,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;;ACxEA,mBAAmB,mBAAO,CAAC,+DAAiB;AAC5C,uBAAuB,mBAAO,CAAC,uEAAqB;AACpD,YAAY,mBAAO,CAAC,iDAAU;AAC9B,YAAY,mBAAO,CAAC,iDAAU;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB,aAAa,SAAS;AACtB;AACA;AACA;AACA,MAAM,OAAO,SAAS,EAAE;AACxB,MAAM,OAAO,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACtBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACjBA,mBAAmB,mBAAO,CAAC,+DAAiB;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,EAAE;AACb,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC3BA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA,CAAC;;AAED;;;;;;;;;;;;;ACnCA,YAAY,mBAAO,CAAC,iEAAS;AAC7B,WAAW,mBAAO,CAAC,+DAAQ;AAC3B,gBAAgB,mBAAO,CAAC,yEAAa;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,mBAAmB,mBAAO,CAAC,+DAAQ;;AAEnC;;AAEA;;AAEA;;;;;;;;;;;;AC3BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;;AAEA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;;AAEA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;;AAEA,8BAA8B,KAAK;AACnC;AACA;;AAEA;AACA;;;;;;;;;;;;AC1PA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,8BAA8B,IAAI;AAClC;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/CA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AChDA;AACA;;AAEA,iCAAiC,SAAS;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACrBA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,sBAAsB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qCAAqC;;AAErC;AACA;AACA;;AAEA,2BAA2B;AAC3B;AACA;AACA;AACA,4BAA4B,UAAU;;;;;;;;;;;;;ACvLtC;AAAA;AACA;AACA;;AAEA;AACA,uEAAuE,aAAa;AACpF;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEe,sEAAO,EAAC;;;;;;;;;;;;ACjCvB,wDAAU,mBAAO,CAAC,8EAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA,cAAc,4BAA4B;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,eAAe;AACrC;AACA;AACA;AACA,aAAa;AACb,qCAAqC,UAAU;AAC/C;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA,kBAAkB,kBAAkB;AACpC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;AC1EA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEoB;;;;;;;;;;;;;AC7JpB;AAAA;AAAA;AAAA,uBAAuB,2EAA2E,kCAAkC,mBAAmB,GAAG,EAAE,OAAO,kCAAkC,8HAA8H,GAAG,EAAE,qBAAqB;;AAE7V,iDAAiD,0CAA0C,0DAA0D,EAAE;;AAEvJ,2CAA2C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD,2DAA2D,EAAE;;AAE3T,6DAA6D,sEAAsE,8DAA8D,oBAAoB;;AAErN,iDAAiD,0EAA0E,aAAa,EAAE,qCAAqC;;AAE/K,uCAAuC,uBAAuB,uFAAuF,EAAE,aAAa;;AAEpK,6BAA6B,gGAAgG,gDAAgD,GAAG,2BAA2B;;AAE3M,0CAA0C,+DAA+D,2EAA2E,EAAE,yEAAyE,eAAe,sDAAsD,EAAE,EAAE,uDAAuD;;AAE/X,gCAAgC,4EAA4E,iBAAiB,UAAU,GAAG,8BAA8B;;AAElI;;AAEtC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA,CAAC,CAAC,mDAAa;;AAEA,2EAAY,E;;;;;;;;;;;;AC1C3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAuB,2EAA2E,kCAAkC,mBAAmB,GAAG,EAAE,OAAO,kCAAkC,8HAA8H,GAAG,EAAE,qBAAqB;;AAE7V,iDAAiD,0CAA0C,0DAA0D,EAAE;;AAEvJ,2CAA2C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD,2DAA2D,EAAE;;AAE3T,6DAA6D,sEAAsE,8DAA8D,oBAAoB;;AAErN,iDAAiD,0EAA0E,aAAa,EAAE,qCAAqC;;AAE/K,6BAA6B,gGAAgG,gDAAgD,GAAG,2BAA2B;;AAE3M,uCAAuC,uBAAuB,uFAAuF,EAAE,aAAa;;AAEpK,0CAA0C,+DAA+D,2EAA2E,EAAE,yEAAyE,eAAe,sDAAsD,EAAE,EAAE,uDAAuD;;AAE/X,gCAAgC,4EAA4E,iBAAiB,UAAU,GAAG,8BAA8B;;AAExK,2CAA2C,kBAAkB,kCAAkC,qEAAqE,EAAE,EAAE,OAAO,kBAAkB,EAAE,YAAY;;AAErH;AAClD;AACc;AACvB;AAC2C;AACA;AAChC;;AAE1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,UAAU,wDAAK;AACf;AACA,yBAAyB,+DAAY,kCAAkC;;AAEvE,4CAA4C,6DAAW;AACvD;AACA;AACA,KAAK;;AAEL;AACA;;AAEA,kBAAkB,wDAAO;AACzB;AACA;AACA;;AAEA,YAAY,6DAAU;AACtB;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,oDAAoD;AACpD;AACA;;AAEA;AACA;AACA;AACA,oEAAoE,wDAAK;;AAEzE;AACA;AACA;AACA;AACA,WAAW;AACX;;AAEA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA,UAAU,6DAAU;AACpB;AACA;;AAEA,UAAU,6DAAU;AACpB;AACA;;AAEA,UAAU,4DAAc;AACxB;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,iBAAiB,0DAAY;AAC7B;AACA,WAAW;;AAEX;AACA,iBAAiB,0DAAY;;AAE7B;AACA,iBAAiB,0DAAY;;AAE7B;AACA;AACA,2BAA2B,0DAAY;AACvC,WAAW;;AAEX;AACA,iBAAiB,2DAAa;AAC9B;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,4DAAS;AAC1B;AACA,+BAA+B,gEAAc;AAC7C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,aAAa,4CAAK,eAAe,qDAAY;AAC7C;AACA,OAAO;AACP;AACA,GAAG;;AAEH;AACA,CAAC,CAAC,mDAAa;;AAEf;AACA,eAAe,+CAAI;AACnB,gBAAgB,+CAAI;AACpB,eAAe,+CAAI;AACnB,eAAe,iDAAM;AACrB,eAAe,iDAAM;AACrB,kBAAkB,wDAAK;AACvB,aAAa,+CAAI;AACjB,cAAc,+CAAI;AAClB,GAAG;AACH,iBAAiB,iDAAM;AACvB,eAAe,8CAAG;AAClB;AACA,YAAY,+CAAI;AAChB,UAAU,+CAAI;AACd,YAAY,8CAAG;AACf;AACA,YAAY,+CAAI;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,6EAAc,E;;;;;;;;;;;;AC/Q7B;AAAA;AAAA;AAAA;AAAA,uBAAuB,2EAA2E,kCAAkC,mBAAmB,GAAG,EAAE,OAAO,kCAAkC,8HAA8H,GAAG,EAAE,qBAAqB;;AAE7V,iDAAiD,0CAA0C,0DAA0D,EAAE;;AAEvJ,2CAA2C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD,2DAA2D,EAAE;;AAE3T,6DAA6D,sEAAsE,8DAA8D,oBAAoB;;AAErN,iDAAiD,0EAA0E,aAAa,EAAE,qCAAqC;;AAE/K,uCAAuC,uBAAuB,uFAAuF,EAAE,aAAa;;AAEpK,6BAA6B,gGAAgG,gDAAgD,GAAG,2BAA2B;;AAE3M,0CAA0C,+DAA+D,2EAA2E,EAAE,yEAAyE,eAAe,sDAAsD,EAAE,EAAE,uDAAuD;;AAE/X,gCAAgC,4EAA4E,iBAAiB,UAAU,GAAG,8BAA8B;;AAE/H;AACiB;;AAE1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB,4CAAK,eAAe,kEAAc,SAAS,4CAAK;AACjE;AACA,OAAO;;AAEP;AACA,KAAK,CAAC,+CAAS;AACf;AACA;;AAEe,iFAAkB,E;;;;;;;;;;;;AClDjC;AAAA;AAAA;AAAA;AAAA;AAAyD;AACC;AAC5B;AACf,iIAAc,E;;;;;;;;;;;;ACH7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAA0C;AACA;AACnC;AACP,YAAY,0DAAQ;AACpB,YAAY,0DAAQ;AACpB;AACO;AACP;AACA;AACO;AACP;AACA;AACO;AACP;AACA;AACO;AACP;AACA,E;;;;;;;;;;;;ACjBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAsC;;AAEtC,uBAAuB,2EAA2E,kCAAkC,mBAAmB,GAAG,EAAE,OAAO,kCAAkC,8HAA8H,GAAG,EAAE,qBAAqB;;AAE7V,qDAAqD,+BAA+B,8DAA8D,YAAY,oCAAoC,6DAA6D,YAAY,6BAA6B,OAAO,2BAA2B,0CAA0C,wEAAwE,2BAA2B,EAAE,EAAE,eAAe;;AAE1e,0DAA0D,+BAA+B,iBAAiB,sCAAsC,YAAY,YAAY,uBAAuB,OAAO,qBAAqB,0CAA0C,2BAA2B,EAAE,eAAe;;AAEjT,kCAAkC,iFAAiF;;AAEnH,+BAA+B,wEAAwE;;AAEvG,iCAAiC,+HAA+H;;AAEhK,kCAAkC,0BAA0B,8CAA8C,gBAAgB,OAAO,kBAAkB,EAAE,aAAa,EAAE;;AAEpK,gCAAgC,gBAAgB,sBAAsB,OAAO,uDAAuD,mCAAmC,0DAA0D,sFAAsF,gEAAgE,EAAE,GAAG,EAAE,iCAAiC,2CAA2C,EAAE,EAAE,EAAE,eAAe;;AAE/d,2CAA2C,kBAAkB,kCAAkC,qEAAqE,EAAE,EAAE,OAAO,kBAAkB,EAAE,YAAY;;AAE/M,iDAAiD,0CAA0C,0DAA0D,EAAE;;AAEvJ,2CAA2C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD,2DAA2D,EAAE;;AAE3T,6DAA6D,sEAAsE,8DAA8D,oBAAoB;;AAErN,iDAAiD,0EAA0E,aAAa,EAAE,qCAAqC;;AAE/K,6BAA6B,gGAAgG,gDAAgD,GAAG,2BAA2B;;AAE3M,0CAA0C,+DAA+D,2EAA2E,EAAE,yEAAyE,eAAe,sDAAsD,EAAE,EAAE,uDAAuD;;AAE/X,gCAAgC,4EAA4E,iBAAiB,UAAU,GAAG,8BAA8B;;AAExK,uCAAuC,uBAAuB,uFAAuF,EAAE,aAAa;;AAE/F;AAClC;AACiB;AACZ;AACE;AAC0B;;AAEpE;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iDAAiD;AACjD;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,mDAAmD;AACnD,SAAS;AACT;AACA;;AAEA,UAAU,qDAAQ;AAClB;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iFAAiF;;AAEjF;AACA,iDAAiD;AACjD,OAAO;AACP,wCAAwC;AACxC;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,6DAAY,WAAW,4DAAY;;AAE9D;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;;AAEA,yBAAyB,8DAAgB;;AAEzC,uCAAuC;AACvC;AACA,SAAS;;AAET,gGAAgG,8CAAQ;AACxG;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,uBAAuB,+DAAoB;AAC3C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,iDAAiD;AACjD,uBAAuB,8DAAgB;AACvC,8DAA8D;AAC9D;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,8CAAQ;AAC1B,uBAAuB,4DAAc;;AAErC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,yDAAyD;AACzD;AACA,kBAAkB,0DAAY,4BAA4B;AAC1D,iCAAiC;AACjC;AACA,SAAS;AACT;AACA;;AAEA;AACA,8BAA8B,8CAAQ;AACtC;;AAEA,aAAa,4CAAK,4BAA4B,8CAAQ;AACtD;AACA,OAAO;AACP;AACA,GAAG;;AAEH;AACA,CAAC,CAAC,mDAAa;;AAEf;AACA;AACA,QAAQ,iDAAS,YAAY,iDAAS,SAAS,iDAAS;AACxD,MAAM,iDAAS,YAAY,iDAAS,SAAS,iDAAS;AACtD,iBAAiB,iDAAS;AAC1B;AACA,YAAY,iDAAS;AACrB,SAAS,iDAAS;AAClB,UAAU,iDAAS,YAAY,iDAAS,SAAS,iDAAS;AAC1D,SAAS,iDAAS,SAAS,iDAAS;AACpC,cAAc,iDAAS;AACvB,WAAW,iDAAS;AACpB,YAAY,iDAAS,YAAY,iDAAS,kEAAkE,iDAAS;AACrH;AACA,gBAAgB,iDAAS;AACzB,oBAAoB,iDAAS;AAC7B,GAAG;AACH,YAAY,iDAAS,YAAY,iDAAS,OAAO,iDAAS;AAC1D,YAAY,iDAAS;AACrB,YAAY,iDAAS;AACrB,kBAAkB,iDAAS;AAC3B;AACA,mBAAmB,iDAAS;AAC5B,oBAAoB,iDAAS;AAC7B,sBAAsB,iDAAS;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACe,sEAAO,E;;;;;;;;;;;;ACrYtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAwC;AACiB;AACtB;AACiB;;AAEpD;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,4CAAK,eAAe,sEAAe;AAC5C;AACA,GAAG,EAAE,8CAAQ;AACb,WAAW,4CAAK,eAAe,0DAAiB;AAChD;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA,UAAU,iDAAS;AACnB,SAAS,iDAAS;AAClB,SAAS,iDAAS;AAClB,YAAY,iDAAS,YAAY,iDAAS,QAAQ,iDAAS;AAC3D,aAAa,iDAAS;AACtB;AACA;AACA;AACA;AACe,2EAAY,E;;;;;;;;;;;;ACjC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAwC;;AAExC,uBAAuB,2EAA2E,kCAAkC,mBAAmB,GAAG,EAAE,OAAO,kCAAkC,8HAA8H,GAAG,EAAE,qBAAqB;;AAE7V,qBAAqB,gDAAgD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe,GAAG,wCAAwC;;AAE3T,qDAAqD,+BAA+B,8DAA8D,YAAY,oCAAoC,6DAA6D,YAAY,6BAA6B,OAAO,2BAA2B,0CAA0C,wEAAwE,2BAA2B,EAAE,EAAE,eAAe;;AAE1e,0DAA0D,+BAA+B,iBAAiB,sCAAsC,YAAY,YAAY,uBAAuB,OAAO,qBAAqB,0CAA0C,2BAA2B,EAAE,eAAe;;AAEjT,gCAAgC,gBAAgB,sBAAsB,OAAO,uDAAuD,mCAAmC,0DAA0D,sFAAsF,gEAAgE,EAAE,GAAG,EAAE,iCAAiC,2CAA2C,EAAE,EAAE,EAAE,eAAe;;AAE/d,2CAA2C,kBAAkB,kCAAkC,qEAAqE,EAAE,EAAE,OAAO,kBAAkB,EAAE,YAAY;;AAE/M,iDAAiD,0CAA0C,0DAA0D,EAAE;;AAEvJ,2CAA2C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD,2DAA2D,EAAE;;AAE3T,6DAA6D,sEAAsE,8DAA8D,oBAAoB;;AAErN,iDAAiD,0EAA0E,aAAa,EAAE,qCAAqC;;AAE/K,uCAAuC,uBAAuB,uFAAuF,EAAE,aAAa;;AAEpK,6BAA6B,gGAAgG,gDAAgD,GAAG,2BAA2B;;AAE3M,0CAA0C,+DAA+D,2EAA2E,EAAE,yEAAyE,eAAe,sDAAsD,EAAE,EAAE,uDAAuD;;AAE/X,gCAAgC,4EAA4E,iBAAiB,UAAU,GAAG,8BAA8B;;AAErH;AACC;AACjB;AACH;;AAEhC;AACA;AACA;AACA;;AAEA;AACA;AACA,uBAAuB,sDAAS;AAChC,KAAK;AACL;;AAEA,MAAM,sDAAS;AACf;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA,uEAAuE,aAAa;AACpF;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,sCAAsC;AACtC;AACA;AACA,SAAS;AACT;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa,4CAAK,eAAe,iEAAU,aAAa;AACxD;AACA;AACA;AACA,OAAO;AACP,eAAe,4CAAK,eAAe,gDAAO,gBAAgB,8CAAQ;AAClE,OAAO;AACP;AACA,GAAG;;AAEH;AACA,CAAC,CAAC,+CAAS;;AAEX;AACA,iBAAiB,iDAAS;AAC1B,gBAAgB,iDAAS;AACzB,gBAAgB,iDAAS;AACzB,YAAY,iDAAS;AACrB;AACe,gFAAiB,E;;;;;;;;;;;;AC9IhC;AAAA;AAAA;AAAA,uBAAuB,2EAA2E,kCAAkC,mBAAmB,GAAG,EAAE,OAAO,kCAAkC,8HAA8H,GAAG,EAAE,qBAAqB;;AAE7V,wBAAwB,4EAA4E;;AAEpG,6BAA6B,6EAA6E;;AAE1G,iCAAiC,+HAA+H;;AAEhK,+BAA+B,oCAAoC;;AAEvB;AAC7B;AACf;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ,8DAAa;AACrB;AACA;;AAEA;AACA,MAAM,8DAAa;AACnB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,C;;;;;;;;;;;;ACzEA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAoC;;AAEpC,kCAAkC,iFAAiF;;AAEnH,+BAA+B,wEAAwE;;AAEvG,iCAAiC,+HAA+H;;AAEhK,kCAAkC,0BAA0B,8CAA8C,gBAAgB,OAAO,kBAAkB,EAAE,aAAa,EAAE;;AAEpK,gCAAgC,gBAAgB,sBAAsB,OAAO,uDAAuD,mCAAmC,0DAA0D,sFAAsF,gEAAgE,EAAE,GAAG,EAAE,iCAAiC,2CAA2C,EAAE,EAAE,EAAE,eAAe;;AAE/d,2CAA2C,kBAAkB,kCAAkC,qEAAqE,EAAE,EAAE,OAAO,kBAAkB,EAAE,YAAY;;AAE/M,iCAAiC,oFAAoF;;AAErH,6BAA6B,6EAA6E;;AAE1G,wCAAwC,eAAe,eAAe,gBAAgB,oBAAoB,MAAM,0CAA0C,+BAA+B,aAAa,qBAAqB,mCAAmC,EAAE,EAAE,cAAc,WAAW,UAAU,EAAE,UAAU,MAAM,iDAAiD,EAAE,UAAU,kBAAkB,EAAE,EAAE,aAAa;;AAEvZ,+BAA+B,oCAAoC;;AAE1B;AACe;;AAExD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,mBAAmB,qBAAqB;AACrD;;;AAGA;AACA,qBAAqB,uDAAS;AAC9B;AACA;AACA;AACA;AACA;;AAEA,6BAA6B;AAC7B;AACA;AACA,OAAO;AACP;;AAEA;AACA,GAAG;;AAEH;AACA,WAAW,uDAAS;AACpB;AACA,+BAA+B;AAC/B;AACA;AACA,SAAS;AACT;;AAEA;AACA,KAAK;AACL;;AAEA;AACA,EAAE;;;AAGc;AAChB,kBAAkB,iEAAmB;AACrC;AACA,2BAA2B,yBAAyB;AACpD,GAAG,IAAI;AACP;AACA,2BAA2B,yBAAyB;AACpD;AACA;AACA;AACA,KAAK;AACL,GAAG,IAAI;AACP;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,WAAW,uDAAS;AACpB;AACA,KAAK;AACL;;AAEA;AACA,YAAY,oDAAO;AACnB,IAAI;;;AAGJ;AACA;AACA;AACA;;AAEA;AACA;AACA,+DAA+D;;AAE/D,2BAA2B;AAC3B;;AAEA;AACA,cAAc,0CAAG;AACjB;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,uDAAS;AAC7B;AACA,KAAK,eAAe;;AAEpB,2BAA2B;;AAE3B;AACA,cAAc,0CAAG;AACjB,KAAK;AACL,uBAAuB,uDAAS;AAChC;AACA,OAAO;AACP,6BAA6B;AAC7B;AACA;;AAEA,2DAA2D;;AAE3D;AACA,IAAI,0CAAG,SAAS;;AAEhB;AACA,MAAM,kDAAG;AACT;AACA;AACA,CAAC,E;;;;;;;;;;;;AC1JD;AAAA;AAAA;AAAA;AAAA;AAAA,iCAAiC,oFAAoF;;AAErH,6BAA6B,6EAA6E;;AAE1G,wCAAwC,eAAe,eAAe,gBAAgB,oBAAoB,MAAM,0CAA0C,+BAA+B,aAAa,qBAAqB,mCAAmC,EAAE,EAAE,cAAc,WAAW,UAAU,EAAE,UAAU,MAAM,iDAAiD,EAAE,UAAU,kBAAkB,EAAE,EAAE,aAAa;;AAEvZ,+BAA+B,oCAAoC;;AAEnE,kCAAkC,iFAAiF;;AAEnH,+BAA+B,wEAAwE;;AAEvG,iCAAiC,+HAA+H;;AAEhK,kCAAkC,0BAA0B,8CAA8C,gBAAgB,OAAO,kBAAkB,EAAE,aAAa,EAAE;;AAEtI;AAC9B;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA,EAAE;;;AAGK;AACP,qEAAqE,aAAa;AAClF;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa;;AAEb;;AAEA;AACA;AACA;AACA;AACA,WAAW;AACX,YAAY,kDAAI;AAChB;AACA;AACA;AACA;;AAEA,EAAE,kDAAI;AACN;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,mBAAmB,OAAO;AAC1B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACO;AACP,wEAAwE,eAAe;AACvF;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,QAAQ,kDAAI;AACZ;AACA;;AAEA;AACA;AACA;;AAEA,EAAE,kDAAI;AACN;AACA,E;;;;;;;;;;;;AC1NA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAgC;AACsB;AACd;AACE;AAC0B;AACrD,+GAAO,E;;;;;;;;;;;;ACLtB;AAAA;AAAA;AAAA;AAAsB;AACP;AACf;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL,MAAM,0CAAG;AACT;AACA;;AAEA,EAAE,0CAAG;AACL,C;;;;;;;;;;;;ACnBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAgD;;AAEhD,gCAAgC,gBAAgB,sBAAsB,OAAO,uDAAuD,mCAAmC,0DAA0D,sFAAsF,gEAAgE,EAAE,GAAG,EAAE,iCAAiC,2CAA2C,EAAE,EAAE,EAAE,eAAe;;AAE/d,2CAA2C,kBAAkB,kCAAkC,qEAAqE,EAAE,EAAE,OAAO,kBAAkB,EAAE,YAAY;;AAE/M;AACA;AACA;AACA;AACO;AACP,SAAS,0DAAa;AACtB;AACO;AACP;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA,6BAA6B;AAC7B;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA,2BAA2B,4BAA4B;AACvD,GAAG,IAAI;AACP;AACO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA,uEAAuE,aAAa;AACpF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA,2BAA2B,yBAAyB;AACpD,GAAG,IAAI;AACP;AACA;AACA;AACA;AACA;;AAEO;AACP;AACA,2BAA2B;AAC3B,GAAG;AACH;AACO;AACP,wEAAwE,eAAe;AACvF;AACA;;AAEA;AACA;AACA;;AAEA,2BAA2B;;AAE3B;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACO;AACP;AACA;AACA,GAAG;AACH;AACA,YAAY,aAAoB;AACzB;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA,kDAAkD;AAClD,OAAO;AACP;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,E;;;;;;;;;;;;AClJa;;AAEb;AACA;;AAEA,wCAAwC,mBAAO,CAAC,8BAAY;;AAE5D,uCAAuC,mBAAO,CAAC,gFAA4B;;AAE3E,0CAA0C,mBAAO,CAAC,sFAA+B;;AAEjF,oCAAoC,mBAAO,CAAC,oBAAO;;AAEnD,yCAAyC,mBAAO,CAAC,yEAAc;;AAE/D,iBAAiB,mBAAO,CAAC,mFAAmB;;AAE5C,sCAAsC,uCAAuC,gBAAgB;;AAE7F,uCAAuC,6BAA6B,YAAY,EAAE,OAAO,iBAAiB,mBAAmB,uBAAuB,sDAAsD,sHAAsH,4BAA4B,0CAA0C,EAAE,OAAO,wBAAwB,EAAE,EAAE,EAAE,EAAE,sBAAsB,eAAe,EAAE;;AAEtd,qBAAqB,gDAAgD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe,GAAG,wCAAwC;;AAE3T,+CAA+C,0DAA0D,2CAA2C,iCAAiC;;AAErL;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,OAAO,UAAU,IAAI;AACjD;AACA,cAAc;AACd;AACA;AACA,wCAAwC,sBAAsB;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,uEAAuE,aAAa;AACpF;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,2BAA2B;;AAE3B;AACA,wEAAwE;AACxE;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA,CAAC;;AAED;AACA;AACA;AACA,0BAA0B,KAAqC,cAAc;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,IAAI,SAAE;AACP;AACA;AACA,oC;;;;;;;;;;;;AC3Wa;;AAEb;AACA;;AAEA,wCAAwC,mBAAO,CAAC,8BAAY;;AAE5D,oCAAoC,mBAAO,CAAC,oBAAO;;AAEnD,gBAAgB,mBAAO,CAAC,4BAAW;;AAEnC,8CAA8C,mBAAO,CAAC,mFAAmB;;AAEzE,sCAAsC,uCAAuC,gBAAgB;;AAE7F,0DAA0D,+BAA+B,iBAAiB,sCAAsC,YAAY,YAAY,uBAAuB,OAAO,qBAAqB,0CAA0C,2BAA2B,EAAE,eAAe;;AAEjT,+CAA+C,0DAA0D,2CAA2C,iCAAiC;;AAErL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,wEAAwE,aAAa;AACrF;AACA;;AAEA;;AAEA;AACA,4EAA4E,eAAe;AAC3F;AACA;;AAEA;AACA;;AAEA;AACA,4EAA4E,eAAe;AAC3F;AACA;;AAEA;AACA;;AAEA;AACA,4EAA4E,eAAe;AAC3F;AACA;;AAEA;AACA;;AAEA;AACA,4EAA4E,eAAe;AAC3F;AACA;;AAEA;AACA;;AAEA;AACA,4EAA4E,eAAe;AAC3F;AACA;;AAEA;AACA;;AAEA;AACA,4EAA4E,eAAe;AAC3F;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA,CAAC;;AAED,8BAA8B,KAAqC;AACnE;AACA;AACA;AACA;AACA;AACA,CAAC,GAAG,SAAE;AACN;AACA;AACA,oC;;;;;;;;;;;;ACrJa;;AAEb;AACA;;AAEA,wCAAwC,mBAAO,CAAC,8BAAY;;AAE5D,oCAAoC,mBAAO,CAAC,oBAAO;;AAEnD,uCAAuC,mBAAO,CAAC,4BAAW;;AAE1D,6BAA6B,mBAAO,CAAC,qGAAyB;;AAE9D,iBAAiB,mBAAO,CAAC,mFAAmB;;AAE5C,sCAAsC,uCAAuC,gBAAgB;;AAE7F,uCAAuC,6BAA6B,YAAY,EAAE,OAAO,iBAAiB,mBAAmB,uBAAuB,sDAAsD,sHAAsH,4BAA4B,0CAA0C,EAAE,OAAO,wBAAwB,EAAE,EAAE,EAAE,EAAE,sBAAsB,eAAe,EAAE;;AAEtd,0DAA0D,+BAA+B,iBAAiB,sCAAsC,YAAY,YAAY,uBAAuB,OAAO,qBAAqB,0CAA0C,2BAA2B,EAAE,eAAe;;AAEjT,+CAA+C,0DAA0D,2CAA2C,iCAAiC;;AAErL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB;AACA;AACA;AACA;AACA,4BAA4B,SAAS;AACrC;AACA;AACA;AACA;AACA,gBAAgB,aAAa;AAC7B,gBAAgB,aAAa;AAC7B;AACA;AACA,kBAAkB,aAAa;AAC/B,qBAAqB,OAAO,UAAU,SAAS;AAC/C,QAAQ;AACR;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,OAAO,UAAU,IAAI;AAC9C,YAAY;AACZ;AACA;AACA;AACA,0BAA0B,sBAAsB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8CAA8C;;AAE9C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;AACL;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;;;AAGA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,4BAA4B;;AAE5B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;AACL;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oEAAoE;AACpE;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT,OAAO;AACP,KAAK;AACL;;AAEA;AACA;;AAEA;AACA,sCAAsC;;AAEtC;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,8EAA8E;;;AAG9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,KAAqC;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,cAAc,UAAU,IAAI;AACjD,QAAQ;AACR,iCAAiC,aAAa,MAAM,EAAE;AACtD;AACA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB;AACxB;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,KAAK;AACrB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,UAAU;AACtB;AACA;AACA;AACA;;AAEA,0FAA0F,aAAa;AACvG;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,CAAC,GAAG,SAAE;;AAEN;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,2B;;;;;;;;;;;;AChmBa;;AAEb;AACA;;AAEA,wCAAwC,mBAAO,CAAC,8BAAY;;AAE5D,oCAAoC,mBAAO,CAAC,oBAAO;;AAEnD,6BAA6B,mBAAO,CAAC,qGAAyB;;AAE9D,oBAAoB,mBAAO,CAAC,yFAAsB;;AAElD,sCAAsC,uCAAuC,gBAAgB;;AAE7F,0DAA0D,+BAA+B,iBAAiB,sCAAsC,YAAY,YAAY,uBAAuB,OAAO,qBAAqB,0CAA0C,2BAA2B,EAAE,eAAe;;AAEjT,qBAAqB,gDAAgD,gBAAgB,sBAAsB,OAAO,2BAA2B,0BAA0B,yDAAyD,2BAA2B,EAAE,EAAE,EAAE,eAAe,GAAG,wCAAwC;;AAE3T,+CAA+C,0DAA0D,2CAA2C,iCAAiC;;AAErL,uCAAuC,uBAAuB,uFAAuF,EAAE,aAAa;;AAEpK;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA,sGAAsG;;;AAGtG;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA;AACA,4BAA4B,KAAqC;AACjE;AACA;AACA;AACA;AACA,iCAAiC,KAAK;AACtC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,GAAG,SAAE;AACN;;AAEA;;AAEA;AACA,oC;;;;;;;;;;;;AC/Ma;;AAEb,4CAA4C,mBAAO,CAAC,+EAAiB;;AAErE,gDAAgD,mBAAO,CAAC,uFAAqB;;AAE7E,8CAA8C,mBAAO,CAAC,mFAAmB;;AAEzE,yCAAyC,mBAAO,CAAC,yEAAc;;AAE/D,sCAAsC,uCAAuC,gBAAgB;;AAE7F;AACA;AACA;AACA;AACA;AACA,E;;;;;;;;;;;;ACjBa;;AAEb;AACA;AACA;AACA;AACA;;AAEA,aAAa,mBAAO,CAAC,oBAAO;;AAE5B;AACA;AACA;AACA,WAAW,EAAE;AACb,YAAY,OAAO;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB;AACA,WAAW,OAAO;AAClB;AACA,YAAY,OAAO;AACnB;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,iBAAiB,qCAAqC;AACtD;AACA;AACA;AACA;;AAEA;AACA,GAAG;;;AAGH,aAAa,wBAAwB;AACrC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iFAAiF;;AAEjF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACA,C;;;;;;;;;;;;ACrJa;;AAEb;AACA;;AAEA,wCAAwC,mBAAO,CAAC,8BAAY;;AAE5D,sCAAsC,uCAAuC,gBAAgB;;AAE7F,oBAAoB,KAAqC;AACzD;AACA;AACA;AACA,CAAC,iBAAiB,SAAI;AACtB;AACA,sBAAsB,KAAqC;AAC3D;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,MAAM,SAAI;AACX,0C;;;;;;;;;;;;AC3Ba;;AAEb;AACA;AACA,CAAC;AACD;;AAEA,sCAAsC,mBAAO,CAAC,oEAAkB;;AAEhE,aAAa,mBAAO,CAAC,qEAAc;;AAEnC,yCAAyC,mBAAO,CAAC,+EAAmB;;AAEpE,sCAAsC,uCAAuC,gBAAgB;;AAE7F,kCAAkC,iFAAiF;;AAEnH,+BAA+B,wEAAwE;;AAEvG,iCAAiC,+HAA+H;;AAEhK,kCAAkC,0BAA0B,8CAA8C,gBAAgB,OAAO,kBAAkB,EAAE,aAAa,EAAE;;AAEpK,iCAAiC,oFAAoF;;AAErH,6BAA6B,6EAA6E;;AAE1G,wCAAwC,eAAe,eAAe,gBAAgB,oBAAoB,MAAM,0CAA0C,+BAA+B,aAAa,qBAAqB,mCAAmC,EAAE,EAAE,cAAc,WAAW,UAAU,EAAE,UAAU,MAAM,iDAAiD,EAAE,UAAU,kBAAkB,EAAE,EAAE,aAAa;;AAEvZ,+BAA+B,oCAAoC;;AAEnE;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,MAAM;AAClB;AACA;AACA;AACA;AACA;;AAEA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB;AACA,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB;;;AAGA;AACA;AACA;AACA;;AAEA,2EAA2E;AAC3E;;;AAGA;AACA,iDAAiD;;AAEjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,MAAM;AAClB;;;AAGA;AACA,eAAe;;AAEf;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;;AAGH,mHAAmH;;AAEnH,aAAa;;AAEb;AACA;AACA,GAAG;AACH;AACA,uDAAuD;;AAEvD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,MAAM;AAClB;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA,GAAG;;;AAGH;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,MAAM;AAClB;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,MAAM;AAClB;;;AAGA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,4D;;;;;;;;;;;;AC1Ta;;AAEb;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED,yBAAyB,mBAAO,CAAC,mFAAqB,E;;;;;;;;;;;;ACxBzC;;AAEb;AACA;AACA,CAAC;AACD;;AAEA,sCAAsC,mBAAO,CAAC,oEAAkB;;AAEhE,aAAa,mBAAO,CAAC,gEAAS;;AAE9B,sCAAsC,uCAAuC,gBAAgB;;AAE7F;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,QAAQ;AACpB;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,MAAM;AAClB;;;AAGA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB;;;AAGA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB;;AAEA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB,YAAY,OAAO;AACnB;AACA;;AAEA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2B;;;;;;;;;;;;AClHa;;AAEb;AACA;AACA,CAAC;AACD;;AAEA,kCAAkC,iFAAiF;;AAEnH,+BAA+B,wEAAwE;;AAEvG,iCAAiC,+HAA+H;;AAEhK,kCAAkC,0BAA0B,8CAA8C,gBAAgB,OAAO,kBAAkB,EAAE,aAAa,EAAE;;AAEpK;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uEAAuE,aAAa;AACpF;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA,gFAAgF,eAAe;AAC/F;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA,qBAAqB,SAAS;AAC9B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH,CAAC;AACD;;AAEA;AACA,wEAAwE,eAAe;AACvF;AACA;;AAEA;AACA;AACA;;AAEA,2BAA2B;;AAE3B;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;AACA,GAAG;;;AAGH;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,0EAA0E,eAAe;AACzF;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,0B;;;;;;;;;;;;ACtJa;;AAEb;AACA;AACA,CAAC;;AAED,0BAA0B,mBAAO,CAAC,8EAAsB;;AAExD;;AAEA,cAAc,mBAAO,CAAC,+DAAU;;AAEhC,eAAe,mBAAO,CAAC,yEAAe;;AAEtC;;AAEA,mBAAmB,mBAAO,CAAC,iFAAmB;;AAE9C;;AAEA,sCAAsC,uCAAuC,gBAAgB;;AAE7F;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA,oC;;;;;;;;;;;;AClDa;;AAEb;AACA;AACA,CAAC;;AAED,wBAAwB,mBAAO,CAAC,sEAAoB;;AAEpD;;AAEA,sCAAsC,uCAAuC,gBAAgB;;AAE7F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;;AAEA;AACA,oC;;;;;;;;;;;;ACrCa;;AAEb;AACA;AACA,CAAC;AACD;;AAEA,eAAe,mBAAO,CAAC,qEAAW;;AAElC;;AAEA,sCAAsC,uCAAuC,gBAAgB;;AAE7F;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA,6GAA6G;;AAE7G;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,uDAAuD;AACvD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,2BAA2B;AAC3B,0DAA0D;AAC1D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,yB;;;;;;;;;;;;AChQa;;AAEb;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,mBAAO,CAAC,qEAAW;;AAElC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,yHAAyH;;AAEzH;;AAEA,4HAA4H;AAC5H;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oC;;;;;;;;;;;;AChEA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,kCAAkC;AACnD,mBAAmB,kCAAkC;AACrD,qBAAqB,iCAAiC,uCAAuC;AAC7F,kDAAkD,yCAAyC;AAC3F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,IAAI;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mEAAmE;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,0BAA0B;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,IAAI;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,yBAAyB;AAC7C;AACA;AACA;AACA,uBAAuB,+BAA+B;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B,4BAA4B;AAC5B;AACA;AACA;AACA,2EAA2E;AAC3E;AACA,gFAAgF;AAChF;AACA,iFAAiF;AACjF;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD,eAAe;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,eAAe;AACpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,cAAc;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;AAIA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;;;;;AAKA;AACA;AACA;AACA;AACA;AACA,yCAAyC,OAAO;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;AACA,yCAAyC,OAAO;AAChD;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,OAAO;AAChD;AACA;AACA,+BAA+B,OAAO;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;AACA;AACA,2BAA2B,OAAO;AAClC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,OAAO;AAChD;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,+BAA+B,EAAE;AACjC;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;;AAEA;;AAEA;AACA;AACA;AACA;;;;AAIA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA,8BAA8B,kBAAkB;AAChD;;AAEA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,+BAA+B;AAC/B,gCAAgC;;AAEhC,gCAAgC;;AAEhC;AACA,eAAe;;;;;;AAMf;;;;AAIA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;;;;;;;;AASA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA,mCAAmC;AACnC;AACA,kEAAkE,MAAM;AACxE;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,gEAAgE;;AAEhE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,yBAAyB;AACzB;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,uDAAuD,QAAQ;AAC/D;AACA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;AAcA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,S;;;;AAIA;AACA;AACA;AACA;;;;;;AAMA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe;AACf;AACA,6BAA6B;;AAE7B;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AAYA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;;;;;;;;;;;AAWA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,sCAAsC;;AAEtC;AACA;;;;;AAKA;;;;;AAKA;;AAEA;AACA;;;;AAIA,kEAAkE;AAClE;;;;;;;;;;;AAWA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kDAAkD;AAClD;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;AAUA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,SAAS,SAAS;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;AACA;AACA,4DAA4D;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kEAAkE;AAClE;AACA;AACA;AACA;AACA,gBAAgB,yBAAyB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,+BAA+B;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,cAAc;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA,kBAAkB;;AAElB;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sEAAsE;AACtE;AACA;AACA;AACA,yJAAyJ;AACzJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,0BAA0B;;AAE1B;AACA;AACA;AACA;AACA,mDAAmD,QAAQ;AAC3D;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA,qCAAqC;AACrC;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,2CAA2C,SAAS;AACpD;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,gDAAgD,iCAAiC;AACjF;;AAEA,yBAAyB,SAAS;AAClC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA,S;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,2BAA2B;AAC3B;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,+BAA+B;AAC/B;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B;AAC3B;AACA;;AAEA;AACA;AACA;AACA;AACA,0DAA0D;AAC1D;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,qB;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;;AAEA;AACA,mBAAmB,0BAA0B;AAC7C,SAAS;AACT,mBAAmB,8CAA8C;AACjE;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;;AAEX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,sEAAsE;AACtE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA,qBAAqB;AACrB,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,sJAAsJ;AACtJ;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,qBAAqB,UAAU;AAC/B;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,aAAa;AACb;AACA,uBAAuB;AACvB,aAAa;AACb;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,CAAC;AACD;;;;AAIA;AACA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;;;;AAKD,IAAI,IAAgE;AACpE;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;;ACntHA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,aAAa;AAC5B,eAAe,EAAE;AACjB,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,SAAS;AACT;AACA,mBAAmB,EAAE;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,EAAE;AACrB,mBAAmB,EAAE;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,EAAE;AACrB,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,mBAAmB,SAAS;AAC5B,mBAAmB,EAAE;AACrB,qBAAqB;AACrB;AACA;AACA,iCAAiC,YAAY;AAC7C,mDAAmD,gBAAgB;AACnE;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,gCAAgC,6BAA6B,EAAE,aAAa;AAC5G,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,SAAS;AACpB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,kBAAkB;AACjC,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,kBAAkB;AACjC,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,QAAQ;AACzB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,qDAAqD,mCAAmC,EAAE;AAC1F;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,gBAAgB;AAC/B,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa,OAAO;AACpB;AACA;AACA,6CAA6C,gBAAgB;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,WAAW,cAAc;AACzB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,oBAAoB;AAC/B,WAAW,UAAU;AACrB,aAAa;AACb;AACA;AACA;AACA,oBAAoB,uBAAuB;AAC3C;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,WAAW,oBAAoB;AAC/B,aAAa,OAAO;AACpB;AACA;AACA;AACA;AACA,6CAA6C,yBAAyB;AACtE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,mBAAmB;AAC9B;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA,kCAAkC,iEAAiE;AACnG;AACA;AACA;AACA;AACA,8BAA8B;AAC9B,8CAA8C;AAC9C,CAAC;AACD;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,YAAY;AACvB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,WAAW,OAAO;AAClB,aAAa;AACb;AACA;AACA,YAAY;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,YAAY;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,eAAe,YAAY;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,2CAA2C;AAC7E;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,eAAe,uBAAuB;AACtC;AACA,eAAe,yBAAyB;AACxC;AACA,eAAe,eAAe;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,QAAQ;AACvB,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,uBAAuB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAEc,oEAAK,EAAC;;;;;;;;;;;;;AC/5BrB;;AAEA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;;AAEA;AACA;AACA,4CAA4C;;AAE5C;;;;;;;;;;;;ACnBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClBA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAGA;;AA0EA;AAAmB;;AAAnB;AAAA;;AA+JE,kBAAe;AAAE,yBAAmB,EAAE;AAAvB,KAAf;AAWA,eAAK,qBAAS,gBAAT,CAAL;;AAEA,0BAAgB,UAAC,MAAD,EAA0B,QAA1B,EAAqD;AACnE,WAAI,CAAC,QAAL,CAAc;AACZ,kBAAU,EAAE,MADA;AAEZ,oBAAY,EAAE;AAFF,OAAd;AAID,KALD;;AAOA,+BAAqB;AACX;;AAER,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc;AACf;AACF,KARD;;AAUA,iCAAuB;AACb;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,wBAAgB;AACjB;AACF,KAPD;;;AAuRD;;AAlTC,8DAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,kBAAf;AAAA,QAAuB,sBAAvB;;AAEN,QAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AACzC,WAAK,aAAL,CAAmB,MAAnB,EAA2B,QAA3B;AACD;AACF,GAND;;AAoCA,wCAAW,QAAX,EAA8B,UAA9B,EAAgD;AACtC;AACA;;AAER,QAAI,iBAAiB,IAAI,CAAC,mBAA1B,EAA+C;AAC7C,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,YAAF;AAAA,QAAO,kBAAP;AAAA,QAAe,oBAAf;AACN,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AACA,QAAM,cAAc,GAAG,oBAAY,GAAZ,EAAiB,IAAjB,CAAvB;AAEA,QAAM,IAAI,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC/B,UAAM,QAAQ;AACZ,WAAG,EAAE,SAAO,CADA;AAEZ,SAAC,EAAE;AAFS,SAGT,SAHS,GAIT,cAJS,GAIK;AACjB,eAAO,SADU;AAEjB,UAAE,EAAE,KAAK,CAAC,CAFO;AAGjB,UAAE,EAAE,KAAK,CAAC,CAHO;AAIjB,aAAK,EAAE,CAJU;AAKjB,aAAK,EAAE,KAAK,CAAC,KALI;AAMjB,eAAO,EAAE,KAAK,CAAC;AANE,OAJL,CAAd;;AAaA,aAAO,IAAI,CAAC,aAAL,CAAmB,GAAnB,EAAwB,QAAxB,CAAP;AACD,KAfY,CAAb;AAgBA,QAAM,SAAS,GAAG;AAChB,cAAQ,EAAE,QAAQ,GAAG,mBAAiB,UAAjB,GAA2B,GAA9B,GAAoC;AADtC,KAAlB;AAGA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,OAAoC,SAApC,CAAN,EACG,IADH,CADF;AAKD,GApCD;;AAsCA,kDAAqB,KAArB,EAAkC;AAC1B;AAAA,QAAE,sBAAF;AAAA,QAAY,kBAAZ;AAAA,QAAoB,4BAApB;AACN,QAAM,MAAM,GAAG,MAAM,CAAC,CAAD,CAAN,CAAU,CAAzB;AACA,QAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAP,GAAgB,CAAjB,CAAN,CAA0B,CAAvC;AACA,QAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,GAAG,IAAlB,CAAtB;AACA,QAAI,IAAI,GAAG,oBAAE,GAAF,CAAM,MAAM,CAAC,GAAP,CAAW,iBAAK;AAAI,kBAAK,CAAC,CAAN;AAAY,KAAhC,CAAN,CAAX;;AAEA,QAAI,qBAAS,QAAT,KAAsB,OAAO,QAAP,KAAoB,QAA9C,EAAwD;AACtD,UAAI,GAAG,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,IAAnB,CAAP;AACD,KAFD,MAEO,IAAI,QAAQ,IAAI,oBAAE,OAAF,CAAU,QAAV,CAAZ,IAAmC,QAAQ,CAAC,MAAhD,EAAwD;AAC7D,UAAI,GAAG,IAAI,CAAC,GAAL,CAAS,oBAAE,GAAF,CAAM,QAAQ,CAAC,GAAT,CAAa,iBAAK;AAAI,oBAAK,CAAC,CAAN;AAAY,OAAlC,CAAN,CAAT,EAAqD,IAArD,CAAP;AACD;;AAED,QAAI,qBAAS,IAAT,CAAJ,EAAoB;AAClB,aACE;AACE,SAAC,EAAE,MAAM,GAAG,IAAT,GAAgB,MAAhB,GAAyB,MAAM,GAAG,KADvC;AAEE,SAAC,EAAE,CAFL;AAGE,aAAK,EAAE,KAHT;AAIE,cAAM,EAAE,IAAI,CAAC,KAAL,CAAW,IAAI,IAAI,WAAW,GAAG,QAAQ,CAAC,KAAG,WAAJ,EAAmB,EAAnB,CAAX,GAAoC,CAAnD,CAAf;AAJV,QADF;AAQD;;AAED,WAAO,IAAP;AACD,GAzBD;;AA2BA,gDAAmB,KAAnB,EAAgC;AACxB;AAAA,QAAE,sBAAF;AAAA,QAAY,kBAAZ;AAAA,QAAoB,4BAApB;AACN,QAAM,MAAM,GAAG,MAAM,CAAC,CAAD,CAAN,CAAU,CAAzB;AACA,QAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAP,GAAgB,CAAjB,CAAN,CAA0B,CAAvC;AACA,QAAM,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,GAAG,IAAlB,CAAvB;AACA,QAAI,IAAI,GAAG,oBAAE,GAAF,CAAM,MAAM,CAAC,GAAP,CAAW,iBAAK;AAAI,kBAAK,CAAC,CAAN;AAAY,KAAhC,CAAN,CAAX;;AAEA,QAAI,qBAAS,QAAT,KAAsB,OAAO,QAAP,KAAoB,QAA9C,EAAwD;AACtD,UAAI,GAAG,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,IAAnB,CAAP;AACD,KAFD,MAEO,IAAI,QAAQ,IAAI,oBAAE,OAAF,CAAU,QAAV,CAAZ,IAAmC,QAAQ,CAAC,MAAhD,EAAwD;AAC7D,UAAI,GAAG,IAAI,CAAC,GAAL,CAAS,oBAAE,GAAF,CAAM,QAAQ,CAAC,GAAT,CAAa,iBAAK;AAAI,oBAAK,CAAC,CAAN;AAAY,OAAlC,CAAN,CAAT,EAAqD,IAArD,CAAP;AACD;;AAED,QAAI,qBAAS,IAAT,CAAJ,EAAoB;AAClB,aACE;AACE,SAAC,EAAE,CADL;AAEE,SAAC,EAAE,MAAM,GAAG,IAAT,GAAgB,MAAhB,GAAyB,MAAM,GAAG,MAFvC;AAGE,aAAK,EAAE,IAAI,IAAI,WAAW,GAAG,QAAQ,CAAC,KAAG,WAAJ,EAAmB,EAAnB,CAAX,GAAoC,CAAnD,CAHb;AAIE,cAAM,EAAE,IAAI,CAAC,KAAL,CAAW,MAAX;AAJV,QADF;AAQD;;AAED,WAAO,IAAP;AACD,GAzBD;;AA2BA,4CAAe,KAAf,EAA4B;AAClB;;AAER,QAAI,MAAM,KAAK,UAAf,EAA2B;AACzB,aAAO,KAAK,kBAAL,CAAwB,KAAxB,CAAP;AACD;;AAED,WAAO,KAAK,oBAAL,CAA0B,KAA1B,CAAP;AACD,GARD;;AAUA,kDAAqB,MAArB,EAA8C,QAA9C,EAA2E,QAA3E,EAA8F,UAA9F,EAAgH;AAE9G,QAAM,eAAN;AAAA,QAAQ,kBAAR;AAAA,QAAgB,cAAhB;AAAA,QAAsB,kBAAtB;AAAA,QAA8B,8BAA9B;AAAA,QAA4C,oBAA5C;AAAA,QAAqD,YAArD;AAAA,QAA0D,mFAA1D;;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,cAAQ,EAAE,QAAQ,GAAG,mBAAiB,UAAjB,GAA2B,GAA9B,GAAoC;AAAvD,KAAN,EACE,iCAAC,kBAAD,EAAM,aACA,oBAAY,MAAZ,EAAoB,IAApB,CADA,EACyB;AAC7B,YAAM,EAAE,MADqB;AAE7B,kBAAY,EAAE,YAFe;AAG7B,UAAI,EAAE,IAHuB;AAI7B,cAAQ,EAAE,QAJmB;AAK7B,YAAM,EAAE,MALqB;AAM7B,YAAM,EAAC,MANsB;AAO7B,eAAS,EAAC;AAPmB,KADzB,CAAN,CADF,EAWG,MAAM,KAAK,MAAX,IACC,iCAAC,kBAAD,EAAM,aACA,oBAAY,KAAK,KAAjB,CADA,EACuB;AAC3B,eAAS,EAAC,qBADiB;AAE3B,YAAM,EAAE,MAFmB;AAG3B,UAAI,EAAE,IAHqB;AAI3B,kBAAY,EAAE,YAJa;AAK3B,UAAI,EAAC,MALsB;AAM3B,YAAM,EAAE;AANmB,KADvB,CAAN,CAZJ,EAsBG,MAAM,KAAK,MAAX,IAAqB,OAArB,IACC,iCAAC,kBAAD,EAAM,aACA,oBAAY,KAAK,KAAjB,CADA,EACuB;AAC3B,eAAS,EAAC,qBADiB;AAE3B,YAAM,EAAE,MAFmB;AAG3B,UAAI,EAAE,IAHqB;AAI3B,kBAAY,EAAE,YAJa;AAK3B,UAAI,EAAC,MALsB;AAM3B,YAAM,EAAE;AANmB,KADvB,CAAN,CAvBJ,CADF;AAoCD,GAxCD;;AA0CA,qDAAwB,QAAxB,EAA2C,UAA3C,EAA6D;AAA7D;;AACQ;AAAA,QACJ,kBADI;AAAA,QAEJ,sBAFI;AAAA,QAGJ,wCAHI;AAAA,QAIJ,kCAJI;AAAA,QAKJ,wCALI;AAAA,QAMJ,oCANI;AAAA,QAOJ,4BAPI;AASA;AAAA,QAAE,0BAAF;AAAA,QAAc,8BAAd;AAGN,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,UAAQ,WAPP;AAQN,oBAAc,EAAE,KAAK,kBARf;AASN,sBAAgB,EAAE,KAAK;AATjB,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;;AACF,UAAI,UAAJ,EAAgB;AACd,YAAM,sBAAoB,GAAG,UAAU,CAAC,MAAX,GAAoB,MAAM,CAAC,MAAxD;AAEA,YAAM,UAAU,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,KAAR,EAAa;AACzC,cAAM,cAAc,GAAG,IAAI,CAAC,KAAL,CAAW,KAAK,GAAG,sBAAnB,CAAvB;;AACA,cAAI,UAAU,CAAC,cAAD,CAAd,EAAgC;AAC9B,gBAAM,IAAI,GAAG,UAAU,CAAC,cAAD,CAAvB;AACA,gBAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,gBAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AAEA,yCAAY,KAAZ,GAAiB;AAAE,eAAC,EAAE,aAAa,CAAC,CAAD,CAAlB;AAAuB,eAAC,EAAE,aAAa,CAAC,CAAD;AAAvC,aAAjB;AACD;;AAED,iBAAO,KAAP;AACD,SAXkB,CAAnB;AAYA,YAAI,YAAY,SAAhB;;AAEA,YAAI,qBAAS,QAAT,KAAsB,OAAO,QAAP,KAAoB,QAA9C,EAAwD;AACtD,cAAM,YAAY,GAAG,8BAAkB,YAAlB,EAA0C,QAA1C,CAArB;AACA,sBAAY,GAAG,YAAY,CAAC,CAAD,CAA3B;AACD,SAHD,MAGO,IAAI,oBAAE,KAAF,CAAQ,QAAR,KAAqB,oBAAE,KAAF,CAAQ,QAAR,CAAzB,EAA4C;AACjD,cAAM,YAAY,GAAG,8BAAkB,YAAlB,EAA0C,CAA1C,CAArB;AACA,sBAAY,GAAG,YAAY,CAAC,CAAD,CAA3B;AACD,SAHM,MAGA;AACL,sBAAY,GAAI,QAAyB,CAAC,GAA1B,CAA8B,UAAC,KAAD,EAAQ,KAAR,EAAa;AACzD,gBAAM,cAAc,GAAG,IAAI,CAAC,KAAL,CAAW,KAAK,GAAG,sBAAnB,CAAvB;;AACA,gBAAK,YAA6B,CAAC,cAAD,CAAlC,EAAoD;AAClD,kBAAM,IAAI,GAAI,YAA6B,CAAC,cAAD,CAA3C;AACA,kBAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,kBAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AAEA,2CAAY,KAAZ,GAAiB;AAAE,iBAAC,EAAE,aAAa,CAAC,CAAD,CAAlB;AAAuB,iBAAC,EAAE,aAAa,CAAC,CAAD;AAAvC,eAAjB;AACD;;AAED,mBAAO,KAAP;AACD,WAXe,CAAhB;AAYD;;AAED,eAAO,KAAI,CAAC,oBAAL,CAA0B,UAA1B,EAAsC,YAAtC,EAAoD,QAApD,EAA8D,UAA9D,CAAP;AACD;;AAED,aACE,iCAAC,kBAAD,EAAM,IAAN,EACE,+CACE;AAAU,UAAE,EAAE,uBAAqB;AAAnC,SAAkD,KAAI,CAAC,cAAL,CAAoB,CAApB,CAAlD,CADF,CADF,EAIE,iCAAC,kBAAD,EAAM;AAAC,gBAAQ,EAAE,4BAA0B,UAA1B,GAAoC;AAA/C,OAAN,EACG,KAAI,CAAC,oBAAL,CAA0B,MAA1B,EAAkC,QAAlC,EAA4C,QAA5C,EAAsD,UAAtD,CADH,CAJF,CADF;AAUD,KA/DH,CADF;AAmED,GAhFD;;AAkFA,wCAAW,QAAX,EAA8B,UAA9B,EAAgD;AACxC;AAAA,QAAE,kBAAF;AAAA,QAAU,sBAAV;AAAA,QAAoB,wCAApB;AACA;AAAA,QAAE,0BAAF;AAAA,QAAc,8BAAd;AAAA,QAA4B,4BAA5B;;AAEN,QACE,iBAAiB,IACjB,MADA,IAEA,MAAM,CAAC,MAFP,KAGE,CAAC,UAAD,IAAe,WAAW,GAAG,CAA9B,IAAoC,CAAC,oBAAE,OAAF,CAAU,UAAV,EAAsB,MAAtB,CAArC,IAAsE,CAAC,oBAAE,OAAF,CAAU,YAAV,EAAwB,QAAxB,CAHxE,CADF,EAKE;AACA,aAAO,KAAK,uBAAL,CAA6B,QAA7B,EAAuC,UAAvC,CAAP;AACD;;AAED,WAAO,KAAK,oBAAL,CAA0B,MAA1B,EAAkC,QAAlC,EAA4C,QAA5C,EAAsD,UAAtD,CAAP;AACD,GAdD;;AAgBA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,YAAR;AAAA,QAAa,kBAAb;AAAA,QAAqB,wBAArB;AAAA,QAAgC,YAAhC;AAAA,QAAqC,cAArC;AAAA,QAA2C,gBAA3C;AAAA,QAAkD,gBAAlD;AAAA,QAAyD,gBAAzD;AAAA,QAAgE,kBAAhE;AAAA,QAAwE,wCAAxE;AAAA,QAA2F,UAA3F;;AAEN,QAAI,IAAI,IAAI,CAAC,MAAT,IAAmB,CAAC,MAAM,CAAC,MAA/B,EAAuC;AACrC,aAAO,IAAP;AACD;;AAEO;AACR,QAAM,cAAc,GAAG,MAAM,CAAC,MAAP,KAAkB,CAAzC;AACA,QAAM,UAAU,GAAG,wBAAW,eAAX,EAA4B,SAA5B,CAAnB;AACA,QAAM,QAAQ,GAAI,KAAK,IAAI,KAAK,CAAC,iBAAhB,IAAuC,KAAK,IAAI,KAAK,CAAC,iBAAvE;AACA,QAAM,UAAU,GAAG,oBAAE,KAAF,CAAQ,EAAR,IAAc,KAAK,EAAnB,GAAwB,EAA3C;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,QAAQ,GACP,+CACE;AAAU,QAAE,EAAE,cAAY;AAA1B,OACE;AAAM,OAAC,EAAE,IAAT;AAAe,OAAC,EAAE,GAAlB;AAAuB,WAAK,EAAE,KAA9B;AAAqC,YAAM,EAAE,IAAI,CAAC,KAAL,CAAW,MAAX;AAA7C,MADF,CADF,CADO,GAML,IAPN,EAQG,CAAC,cAAD,GAAkB,KAAK,UAAL,CAAgB,QAAhB,EAA0B,UAA1B,CAAlB,GAA0D,IAR7D,EASG,CAAC,GAAG,IAAI,cAAR,KAA2B,KAAK,UAAL,CAAgB,QAAhB,EAA0B,UAA1B,CAT9B,EAUG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KAA+C,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,MAAzC,CAVlD,CADF;AAcD,GA3BD;;AAvbO,qBAAc,MAAd;AAEA,sBAAe;AACpB,UAAM,EAAE,SADY;AAEpB,QAAI,EAAE,SAFc;AAGpB,eAAW,EAAE,GAHO;AAIpB,WAAO,EAAE,CAJW;AAKpB,WAAO,EAAE,CALW;AAMpB,cAAU,EAAE,MANQ;AAOpB,gBAAY,EAAE,KAPM;AASpB,UAAM,EAAE,EATY;AAUpB,OAAG,EAAE,KAVe;AAWpB,aAAS,EAAE,IAXS;AAYpB,QAAI,EAAE,KAZc;AAcpB,qBAAiB,EAAE,CAAC,oBAAO,KAdP;AAepB,kBAAc,EAAE,CAfI;AAgBpB,qBAAiB,EAAE,IAhBC;AAiBpB,mBAAe,EAAE;AAjBG,GAAf;;AAoBA,sBAAe,UAAC,KAAD,EAAe,KAAf,EAAsC,KAAtC,EAA2D;AACvE;AAAA,QAAQ,2BAAR;;AAER,QAAI,qBAAS,SAAT,KAAuB,OAAO,SAAP,KAAqB,QAAhD,EAA0D;AACxD,aAAO,SAAP;AACD;;AAED,QAAM,WAAW,GAAG,MAAM,KAAK,YAAX,GAA0B,KAA1B,GAAkC,KAAtD;AACA,QAAM,MAAM,GAAG,WAAW,CAAC,KAAZ,CAAkB,MAAlB,EAAf;;AAEA,QAAI,WAAW,CAAC,IAAZ,KAAqB,QAAzB,EAAmC;AACjC,UAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAZ;AACA,UAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAZ;;AAEA,UAAI,SAAS,KAAK,SAAlB,EAA6B;AAC3B,eAAO,GAAP;AACD;;AACD,UAAI,SAAS,KAAK,SAAlB,EAA6B;AAC3B,eAAO,GAAP;AACD;;AAED,aAAO,GAAG,GAAG,CAAN,GAAU,GAAV,GAAgB,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAT,EAAyC,CAAzC,CAAvB;AACD;;AAED,QAAI,SAAS,KAAK,SAAlB,EAA6B;AAC3B,aAAO,MAAM,CAAC,CAAD,CAAb;AACD;;AACD,QAAI,SAAS,KAAK,SAAlB,EAA6B;AAC3B,aAAO,MAAM,CAAC,CAAD,CAAb;AACD;;AAED,WAAO,MAAM,CAAC,CAAD,CAAb;AACD,GAhCM;;AAkCA,yBAAkB,UAAC,EAAD,EAyBxB;QAxBC,gB;QACA,gB;QACA,gB;QACA,0B;QACA,0B;QACA,sB;QACA,oB;QACA,4B;QACA,kC;QACA,gC;QACA,kB;AAeQ;AACR,QAAM,QAAQ,GAAG,WAAW,IAAI,WAAW,CAAC,MAA5C;AACA,QAAM,SAAS,GAAG,IAAI,CAAC,YAAL,CAAkB,KAAlB,EAAyB,KAAzB,EAAgC,KAAhC,CAAlB;AACA,QAAI,OAAO,GAAG,KAAd;AAEA,QAAM,MAAM,GAAG,aAAa,CAAC,GAAd,CAAkB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAC5C,UAAM,aAAa,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,CAAtB;AACA,UAAI,KAAJ;;AAEA,UAAI,QAAJ,EAAc;AACZ,aAAK,GAAG,WAAW,CAAC,cAAc,GAAG,KAAlB,CAAnB;AACD,OAFD,MAEO;AACL,aAAK,GAAG,aAAR;;AAEA,YAAI,CAAC,oBAAE,OAAF,CAAU,KAAV,CAAL,EAAuB;AACrB,eAAK,GAAG,CAAC,SAAD,EAAY,KAAZ,CAAR;AACD,SAFD,MAEO;AACL,iBAAO,GAAG,IAAV;AACD;AACF;;AAED,UAAM,YAAY,GAAG,oBAAE,KAAF,CAAQ,KAAK,CAAC,CAAD,CAAb,KAAsB,QAAQ,IAAI,oBAAE,KAAF,CAAQ,aAAR,CAAvD;;AACA,UAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,eAAO;AACL,WAAC,EAAE,qCAAwB;AAAE,gBAAI,EAAE,KAAR;AAAe,iBAAK,EAAE,UAAtB;AAAkC,oBAAQ,UAA1C;AAA4C,iBAAK,OAAjD;AAAmD,iBAAK;AAAxD,WAAxB,CADE;AAEL,WAAC,EAAE,YAAY,GAAG,IAAH,GAAU,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,CAFpB;AAGL,eAAK,OAHA;AAIL,iBAAO,EAAE;AAJJ,SAAP;AAMD;;AAED,aAAO;AACL,SAAC,EAAE,YAAY,GAAG,IAAH,GAAU,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,CADpB;AAEL,SAAC,EAAE,qCAAwB;AAAE,cAAI,EAAE,KAAR;AAAe,eAAK,EAAE,UAAtB;AAAkC,kBAAQ,UAA1C;AAA4C,eAAK,OAAjD;AAAmD,eAAK;AAAxD,SAAxB,CAFE;AAGL,aAAK,OAHA;AAIL,eAAO,EAAE;AAJJ,OAAP;AAMD,KAhCc,CAAf;AAkCA,QAAI,QAAJ;;AACA,QAAI,QAAQ,IAAI,OAAhB,EAAyB;AACvB,cAAQ,GAAG,MAAM,CAAC,GAAP,CAAW,iBAAK;AACzB,YAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,iBAAO;AACL,aAAC,EAAE,KAAK,CAAC,CADJ;AAEL,aAAC,EAAE,CAAC,oBAAE,KAAF,CAAQ,oBAAE,GAAF,CAAM,KAAN,EAAa,UAAb,CAAR,CAAD,GAAqC,KAAK,CAAC,KAAN,CAAY,oBAAE,GAAF,CAAM,KAAN,EAAa,UAAb,CAAZ,CAArC,GAA6E;AAF3E,WAAP;AAID;;AACD,eAAO;AACL,WAAC,EAAE,CAAC,oBAAE,KAAF,CAAQ,oBAAE,GAAF,CAAM,KAAN,EAAa,UAAb,CAAR,CAAD,GAAqC,KAAK,CAAC,KAAN,CAAY,oBAAE,GAAF,CAAM,KAAN,EAAa,UAAb,CAAZ,CAArC,GAA6E,IAD3E;AAEL,WAAC,EAAE,KAAK,CAAC;AAFJ,SAAP;AAID,OAXU,CAAX;AAYD,KAbD,MAaO,IAAI,MAAM,KAAK,YAAf,EAA6B;AAClC,cAAQ,GAAG,KAAK,CAAC,KAAN,CAAY,SAAZ,CAAX;AACD,KAFM,MAEA;AACL,cAAQ,GAAG,KAAK,CAAC,KAAN,CAAY,SAAZ,CAAX;AACD;;AAED;AAAS,YAAM,QAAf;AAAiB,cAAQ,UAAzB;AAA2B,YAAM,QAAjC;AAAmC,aAAO;AAA1C,OAA+C,MAA/C;AACD,GAtFM;;AAwFA,uBAAgB,UAAC,MAAD,EAAkB,KAAlB,EAA4B;AACjD,QAAI,OAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAV;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,aAAO,GAAG,MAAM,CAAC,KAAD,CAAhB;AACD,KAFM,MAEA;AACL,aAAO,GAAG,iCAAC,gBAAD,EAAI,aAAK,KAAL,EAAU;AAAE,iBAAS,EAAC;AAAZ,OAAV,CAAJ,CAAV;AACD;;AAED,WAAO,OAAP;AACD,GAZM;;AAmUT;AAAC,CApdD,CAAmB,qBAAnB;;AAsdA,qBAAe,IAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC7iBA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AASA;;AAsEA;AAAkB;;AAAlB;AAAA;;AAwIE,kBAAe;AAAE,yBAAmB,EAAE;AAAvB,KAAf;AAWA,eAAK,qBAAS,eAAT,CAAL;;AAEA,0BAAgB,UAAC,IAAD,EAAyB;AACvC,WAAI,CAAC,QAAL,CAAc;AAAE,gBAAQ,EAAE;AAAZ,OAAd;AACD,KAFD;;AAIA,+BAAqB;AACX;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,cAAJ,EAAoB;AAClB,sBAAc;AACf;AACF,KAPD;;AASA,iCAAuB;AACb;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,gBAAJ,EAAsB;AACpB,wBAAgB;AACjB;AACF,KAPD;;;AAmOD;;AA1PC,6DAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,cAAf;;AAEN,QAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AACzC,WAAK,aAAL,CAAmB,IAAnB;AACD;AACF,GAND;;AAgCO,wBAAP,UAAuB,MAAvB,EAAmD,KAAnD,EAA6D;AAC3D,QAAI,SAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,eAAS,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAZ;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,eAAS,GAAG,MAAM,CAAC,KAAD,CAAlB;AACD,KAFM,MAEA;AACL,eAAS,GAAG,iCAAC,sBAAD,EAAU,aAAK,KAAL,CAAV,CAAZ;AACD;;AAED,WAAO,SAAP;AACD,GAZM;;AAcP,uDAA2B,IAA3B,EAAmD;AAAnD;;AACU;AACR,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AAEA,WACE,IAAI,IACJ,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,CAAR,EAAS;AAChB,UAAM,KAAK,kCAAQ,SAAR,GAAsB,KAAtB,GAA2B;AAAE,aAAK,EAAE;AAAT,OAA3B,CAAX;;AAEA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC;AADN,SAEA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAFA,EAEwC;AAC5C,WAAG,EAAE,eAAa;AAD0B,OAFxC,CAAN,EAKG,GAAG,CAAC,eAAJ,CAAoB,KAApB,EAA2B,KAA3B,CALH,CADF;AASD,KAZD,CAFF;AAgBD,GApBD;;AAsBA;AAAA;;AACQ;AAAA,QACJ,cADI;AAAA,QAEJ,kBAFI;AAAA,QAGJ,wCAHI;AAAA,QAIJ,kCAJI;AAAA,QAKJ,wCALI;AAAA,QAMJ,oCANI;AAAA,QAOJ,4BAPI;AASE;AAER,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,SAAO,WAPN;AAQN,oBAAc,EAAE,KAAK,kBARf;AASN,sBAAgB,EAAE,KAAK;AATjB,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;AACF,UAAM,QAAQ,GAAG,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,KAAR,EAAa;AACrC,YAAM,IAAI,GAAG,QAAQ,IAAI,QAAQ,CAAC,KAAD,CAAjC;;AAEA,YAAI,IAAJ,EAAU;AACR,cAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,cAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,cAAM,iBAAiB,GAAG,8BAAkB,IAAI,CAAC,KAAvB,EAA8B,KAAK,CAAC,KAApC,CAA1B;AACA,cAAM,kBAAkB,GAAG,8BAAkB,IAAI,CAAC,MAAvB,EAA+B,KAAK,CAAC,MAArC,CAA3B;AAEA,uCACK,KADL,GACU;AACR,aAAC,EAAE,aAAa,CAAC,CAAD,CADR;AAER,aAAC,EAAE,aAAa,CAAC,CAAD,CAFR;AAGR,iBAAK,EAAE,iBAAiB,CAAC,CAAD,CAHhB;AAIR,kBAAM,EAAE,kBAAkB,CAAC,CAAD;AAJlB,WADV;AAOD;;AAED,YAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,cAAM,kBAAkB,GAAG,8BAAkB,CAAlB,EAAqB,KAAK,CAAC,MAA3B,CAA3B;AACA,cAAM,CAAC,GAAG,kBAAkB,CAAC,CAAD,CAA5B;AAEA,uCACK,KADL,GACU;AACR,aAAC,EAAE,KAAK,CAAC,CAAN,GAAU,KAAK,CAAC,MAAhB,GAAyB,CADpB;AAER,kBAAM,EAAE;AAFA,WADV;AAKD;;AAED,YAAM,YAAY,GAAG,8BAAkB,CAAlB,EAAqB,KAAK,CAAC,KAA3B,CAArB;AACA,YAAM,CAAC,GAAG,YAAY,CAAC,CAAD,CAAtB;AAEA,qCAAY,KAAZ,GAAiB;AAAE,eAAK,EAAE;AAAT,SAAjB;AACD,OAjCgB,CAAjB;AAmCA,aAAO,iCAAC,kBAAD,EAAM,IAAN,EAAQ,KAAI,CAAC,0BAAL,CAAgC,QAAhC,CAAR,CAAP;AACD,KAhDH,CADF;AAoDD,GAhED;;AAkEA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,wCAAR;AACE;;AAER,QAAI,iBAAiB,IAAI,IAArB,IAA6B,IAAI,CAAC,MAAlC,KAA6C,CAAC,QAAD,IAAa,CAAC,oBAAE,OAAF,CAAU,QAAV,EAAoB,IAApB,CAA3D,CAAJ,EAA2F;AACzF,aAAO,KAAK,6BAAL,EAAP;AACD;;AAED,WAAO,KAAK,0BAAL,CAAgC,IAAhC,CAAP;AACD,GATD;;AAWA;AAAA;;AACU;AACR,QAAM,eAAe,GAAG,oBAAY,KAAK,KAAL,CAAW,UAAvB,CAAxB;AAEA,WAAO,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,CAAR,EAAS;AAEf;AAAA,UAAO,6BAAP;AAAA,UAAmB,6CAAnB;;AAER,UAAI,CAAC,UAAL,EAAiB;AACf,eAAO,IAAP;AACD;;AAED,UAAM,KAAK,6DACN,IADM,GACF;AACP,YAAI,EAAE;AADC,OADE,GAGN,UAHM,GAIN,eAJM,GAKN,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CALM,GAKkC;AAC3C,aAAK,EAAE,CADoC;AAE3C,WAAG,EAAE,oBAAkB,CAFoB;AAG3C,iBAAS,EAAE;AAHgC,OALlC,CAAX;;AAWA,aAAO,GAAG,CAAC,eAAJ,CAAoB,KAAI,CAAC,KAAL,CAAW,UAA/B,EAA2C,KAA3C,CAAP;AACD,KApBM,CAAP;AAqBD,GAzBD;;AA2BA;AACE,QAAI,KAAK,KAAL,CAAW,iBAAX,IAAgC,CAAC,KAAK,KAAL,CAAW,mBAAhD,EAAqE;AACnE,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,cAAF;AAAA,QAAQ,gBAAR;AAAA,QAAe,gBAAf;AAAA,QAAsB,kBAAtB;AAAA,QAA8B,sBAA9B;AACN,QAAM,aAAa,GAAG,2BAAc,QAAd,EAAwB,sBAAS,WAAjC,CAAtB;;AAEA,QAAI,CAAC,aAAL,EAAoB;AAClB,aAAO,IAAP;AACD;;AAED,QAAM,MAAM,GAAG,MAAM,KAAK,UAAX,GAAwB,IAAI,CAAC,CAAD,CAAJ,CAAQ,MAAR,GAAiB,CAAzC,GAA6C,IAAI,CAAC,CAAD,CAAJ,CAAQ,KAAR,GAAgB,CAA5E;;AAEA,aAAS,kBAAT,CAA4B,SAA5B,EAAyD,OAAzD,EAAkF;AAChF,aAAO;AACL,SAAC,EAAE,SAAS,CAAC,CADR;AAEL,SAAC,EAAE,SAAS,CAAC,CAFR;AAGL,aAAK,EAAE,SAAS,CAAC,KAHZ;AAIL,gBAAQ,EAAE,+BAAkB,SAAlB,EAA6B,OAA7B;AAJL,OAAP;AAMD;;AAED,WAAO,aAAa,CAAC,GAAd,CAAkB,UAAC,IAAD,EAAoC,CAApC,EAA6C;AACpE,gCAAM,YAAN,CAAmB,IAAnB,EAAyB;AACvB,WAAG,EAAE,eAAa,CADK;AAEvB,YAAI,MAFmB;AAGvB,aAAK,OAHkB;AAIvB,aAAK,OAJkB;AAKvB,cAAM,QALiB;AAMvB,cAAM,QANiB;AAOvB,0BAAkB;AAPK,OAAzB;AAQE,KATG,CAAP;AAWD,GAlCD;;AAoCA;AACQ;AAAA,QACJ,cADI;AAAA,QAEJ,cAFI;AAAA,QAGJ,wBAHI;AAAA,QAIJ,gBAJI;AAAA,QAKJ,gBALI;AAAA,QAMJ,cANI;AAAA,QAOJ,YAPI;AAAA,QAQJ,gBARI;AAAA,QASJ,kBATI;AAAA,QAUJ,wCAVI;AAAA,QAWJ,0BAXI;AAAA,QAYJ,UAZI;;AAcN,QAAI,IAAI,IAAI,CAAC,IAAT,IAAiB,CAAC,IAAI,CAAC,MAA3B,EAAmC;AACjC,aAAO,IAAP;AACD;;AAEO;AACR,QAAM,UAAU,GAAG,wBAAW,cAAX,EAA2B,SAA3B,CAAnB;AACA,QAAM,QAAQ,GAAI,KAAK,IAAI,KAAK,CAAC,iBAAhB,IAAuC,KAAK,IAAI,KAAK,CAAC,iBAAvE;AACA,QAAM,UAAU,GAAG,oBAAE,KAAF,CAAQ,EAAR,IAAc,KAAK,EAAnB,GAAwB,EAA3C;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,QAAQ,GACP,+CACE;AAAU,QAAE,EAAE,cAAY;AAA1B,OACE;AAAM,OAAC,EAAE,IAAT;AAAe,OAAC,EAAE,GAAlB;AAAuB,WAAK,EAAE,KAA9B;AAAqC,YAAM,EAAE;AAA7C,MADF,CADF,CADO,GAML,IAPN,EAQE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC,yBAAX;AAAqC,cAAQ,EAAE,QAAQ,GAAG,mBAAiB,UAAjB,GAA2B,GAA9B,GAAoC;AAA3F,KAAN,EACG,UAAU,GAAG,KAAK,gBAAL,EAAH,GAA6B,IAD1C,EAEG,KAAK,gBAAL,EAFH,CARF,EAYG,KAAK,cAAL,EAZH,EAaG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KAA+C,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,IAAzC,CAblD,CADF;AAiBD,GAzCD;;AA1VO,oBAAc,KAAd;AAEA,qBAAe;AACpB,WAAO,EAAE,CADW;AAEpB,WAAO,EAAE,CAFW;AAGpB,cAAU,EAAE,MAHQ;AAIpB,gBAAY,EAAE,CAJM;AAKpB,QAAI,EAAE,KALc;AAOpB,QAAI,EAAE,EAPc;AAQpB,UAAM,EAAE,UARY;AASpB,qBAAiB,EAAE,CAAC,oBAAO,KATP;AAUpB,kBAAc,EAAE,CAVI;AAWpB,qBAAiB,EAAE,GAXC;AAYpB,mBAAe,EAAE;AAZG,GAAf;;AAyBA,wBAAkB,UAAC,EAAD,EA0BxB;QAzBC,gB;QACA,c;QACA,4B;QACA,sB;QACA,gB;QACA,gB;QACA,0B;QACA,0B;QACA,4B;QACA,kC;QACA,gC;QACA,kB;AAeA,QAAM,GAAG,GAAG,+BAAkB,WAAlB,EAA+B,IAA/B,CAAZ;;AACA,QAAI,CAAC,GAAL,EAAU;AACR,aAAO,IAAP;AACD;;AAEO;AACF;AAAA,QAAE,oBAAF;AAAA,QAAW,sBAAX;AAAA,QAAqB,8BAArB;AACN,QAAM,WAAW,GAAG,MAAM,KAAK,YAAX,GAA0B,KAA1B,GAAkC,KAAtD;AACA,QAAM,aAAa,GAAG,WAAW,GAAG,WAAW,CAAC,KAAZ,CAAkB,MAAlB,EAAH,GAAgC,IAAjE;AACA,QAAM,SAAS,GAAG,+BAAkB;AAAE,iBAAW;AAAb,KAAlB,CAAlB;AACA,QAAM,KAAK,GAAG,2BAAc,QAAd,EAAwB,kBAAK,WAA7B,CAAd;AAEA,QAAM,KAAK,GAAG,aAAa,CAAC,GAAd,CAAkB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAC3C,UAAI,KAAJ,EAAW,CAAX,EAAc,CAAd,EAAiB,KAAjB,EAAwB,MAAxB,EAAgC,UAAhC;;AAEA,UAAI,WAAJ,EAAiB;AACf,aAAK,GAAG,8BAAiB,WAAW,CAAC,cAAc,GAAG,KAAlB,CAA5B,EAAsD,aAAtD,CAAR;AACD,OAFD,MAEO;AACL,aAAK,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,CAAR;;AAEA,YAAI,CAAC,oBAAE,OAAF,CAAU,KAAV,CAAL,EAAuB;AACrB,eAAK,GAAG,CAAC,SAAD,EAAY,KAAZ,CAAR;AACD;AACF;;AAED,UAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,SAAC,GAAG,oCAAuB;AACzB,cAAI,EAAE,KADmB;AAEzB,eAAK,EAAE,UAFkB;AAGzB,kBAAQ,UAHiB;AAIzB,gBAAM,EAAE,GAAG,CAAC,MAJa;AAKzB,eAAK,OALoB;AAMzB,eAAK;AANoB,SAAvB,CAAJ;AAQA,SAAC,GAAG,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,CAAJ;AACA,aAAK,GAAG,GAAG,CAAC,IAAZ;AACA,cAAM,GAAG,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,IAAwB,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,CAAjC;AACA,kBAAU,GAAG;AAAE,WAAC,GAAH;AAAK,WAAC,EAAE,KAAK,CAAC,CAAd;AAAiB,eAAK,OAAtB;AAAwB,gBAAM,EAAE,KAAK,CAAC;AAAtC,SAAb;;AAEA,YAAI,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,CAAzB,IAA8B,IAAI,CAAC,GAAL,CAAS,MAAT,IAAmB,IAAI,CAAC,GAAL,CAAS,YAAT,CAArD,EAA6E;AAC3E,cAAM,KAAK,GAAG,qBAAS,MAAM,IAAI,YAAnB,KAAoC,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,IAAI,CAAC,GAAL,CAAS,MAAT,CAA7D,CAAd;AAEA,WAAC,IAAI,KAAL;AACA,gBAAM,IAAI,KAAV;AACD;AACF,OApBD,MAoBO;AACL,SAAC,GAAG,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,CAAJ;AACA,SAAC,GAAG,oCAAuB;AACzB,cAAI,EAAE,KADmB;AAEzB,eAAK,EAAE,UAFkB;AAGzB,kBAAQ,UAHiB;AAIzB,gBAAM,EAAE,GAAG,CAAC,MAJa;AAKzB,eAAK,OALoB;AAMzB,eAAK;AANoB,SAAvB,CAAJ;AAQA,aAAK,GAAG,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,IAAwB,KAAK,CAAC,KAAN,CAAY,KAAK,CAAC,CAAD,CAAjB,CAAhC;AACA,cAAM,GAAG,GAAG,CAAC,IAAb;AACA,kBAAU,GAAG;AAAE,WAAC,EAAE,KAAK,CAAC,CAAX;AAAc,WAAC,GAAf;AAAiB,eAAK,EAAE,KAAK,CAAC,KAA9B;AAAqC,gBAAM;AAA3C,SAAb;;AAEA,YAAI,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,CAAzB,IAA8B,IAAI,CAAC,GAAL,CAAS,KAAT,IAAkB,IAAI,CAAC,GAAL,CAAS,YAAT,CAApD,EAA4E;AAC1E,cAAM,KAAK,GAAG,qBAAS,KAAK,IAAI,YAAlB,KAAmC,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,IAAI,CAAC,GAAL,CAAS,KAAT,CAA5D,CAAd;AACA,eAAK,IAAI,KAAT;AACD;AACF;;AAED,4CACK,KADL,GACU;AACR,SAAC,GADO;AAER,SAAC,GAFO;AAGR,aAAK,OAHG;AAIR,cAAM,QAJE;AAKR,aAAK,EAAE,WAAW,GAAG,KAAH,GAAW,KAAK,CAAC,CAAD,CAL1B;AAMR,eAAO,EAAE,KAND;AAOR,kBAAU;AAPF,OADV,GASM,KAAK,IAAI,KAAK,CAAC,KAAD,CAAd,IAAyB,KAAK,CAAC,KAAD,CAAL,CAAa,KAT5C;AAWD,KAhEa,CAAd;AAkEA;AAAS,UAAI,EAAE,KAAf;AAAsB,YAAM;AAA5B,OAAiC,MAAjC;AACD,GA1GM;;AAyWT;AAAC,CArYD,CAAkB,qBAAlB;;AAuYA,qBAAe,GAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACleA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEA;;AAqDA,IAAM,OAAO,GAAG,SAAV,OAAU,CAAC,CAAD,EAAmD;AACjE,SAAC,CAA4B,CAAC,cAA7B,IAA+C,CAAC,CAAE,CAA4B,CAAC,cAA7B,CAA4C,MAA/F;AAAqG,CADvG;;AAGA;AAAoB;;AAclB,iBAAY,KAAZ,EAAwB;AAAxB,gBACE,kBAAM,KAAN,KAAY,IADd;;AAsHA,uBAAa,UAAC,CAAD,EAAyC;AACpD,UAAI,KAAI,CAAC,UAAT,EAAqB;AACnB,oBAAY,CAAC,KAAI,CAAC,UAAN,CAAZ;AACA,aAAI,CAAC,UAAL,GAAkB,IAAlB;AACD;;AAED,UAAI,KAAI,CAAC,KAAL,CAAW,iBAAf,EAAkC;AAChC,aAAI,CAAC,mBAAL,CAAyB,CAAzB;AACD,OAFD,MAEO,IAAI,KAAI,CAAC,KAAL,CAAW,aAAf,EAA8B;AACnC,aAAI,CAAC,eAAL,CAAqB,CAArB;AACD;AACF,KAXD;;AAaA,4BAAkB,UAAC,CAAD,EAA2B;AAC3C,UAAI,CAAC,CAAC,cAAF,IAAoB,IAApB,IAA4B,CAAC,CAAC,cAAF,CAAiB,MAAjB,GAA0B,CAA1D,EAA6D;AAC3D,aAAI,CAAC,UAAL,CAAgB,CAAC,CAAC,cAAF,CAAiB,CAAjB,CAAhB;AACD;AACF,KAJD;;AAgBA,0BAAgB;AACd,WAAI,CAAC,QAAL,CAAc;AACZ,yBAAiB,EAAE,KADP;AAEZ,qBAAa,EAAE;AAFH,OAAd;;AAIA,WAAI,CAAC,qBAAL;AACD,KAND;;AAQA,+BAAqB;AACnB,UAAI,KAAI,CAAC,KAAL,CAAW,iBAAX,IAAgC,KAAI,CAAC,KAAL,CAAW,aAA/C,EAA8D;AAC5D,aAAI,CAAC,UAAL,GAAkB,MAAM,CAAC,UAAP,CAAkB,KAAI,CAAC,aAAvB,EAAsC,KAAI,CAAC,KAAL,CAAW,YAAjD,CAAlB;AACD;AACF,KAJD;;AAMA,wCAA8B;AAC5B,WAAI,CAAC,QAAL,CAAc;AACZ,oBAAY,EAAE;AADF,OAAd;AAGD,KAJD;;AAMA,wCAA8B;AAC5B,WAAI,CAAC,QAAL,CAAc;AACZ,oBAAY,EAAE;AADF,OAAd;AAGD,KAJD;;AAMA,iCAAuB,UAAC,CAAD,EAA2D;AAChF,UAAM,KAAK,GAAG,OAAO,CAAC,CAAD,CAAP,GAAa,CAAC,CAAC,cAAF,CAAiB,CAAjB,CAAb,GAAmC,CAAjD;;AAEA,WAAI,CAAC,QAAL,CAAc;AACZ,yBAAiB,EAAE,KADP;AAEZ,qBAAa,EAAE,IAFH;AAGZ,uBAAe,EAAE,KAAK,CAAC;AAHX,OAAd;;AAMA,WAAI,CAAC,qBAAL;AACD,KAVD;;AA1KE,SAAI,CAAC,0BAAL,GAAkC;AAChC,YAAM,EAAE,KAAI,CAAC,wBAAL,CAA8B,IAA9B,CAAmC,KAAnC,EAAyC,QAAzC,CADwB;AAEhC,UAAI,EAAE,KAAI,CAAC,wBAAL,CAA8B,IAA9B,CAAmC,KAAnC,EAAyC,MAAzC;AAF0B,KAAlC;AAKA,SAAI,CAAC,KAAL,GAAa,KAAK,CAAC,IAAN,IAAc,KAAK,CAAC,IAAN,CAAW,MAAzB,GAAkC,KAAI,CAAC,WAAL,CAAiB,KAAjB,CAAlC,GAA4D,EAAzE;;AACD;;AAaM,iCAAP,UAA8B,KAA9B,EAAwC;AAC9B;AAAA,QAAG,WAAH;AAAA,QAAM,mBAAN;AAAA,QAAa,qBAAb;AAAA,QAAqB,qBAArB;AACR,QAAM,KAAK,GAAG,IAAI,CAAC,KAAL,CAAW,CAAC,GAAG,MAAM,GAAG,CAAxB,IAA6B,CAA3C;AAEA,WACE,oEACE;AAAM,OAAC,EAAE,CAAT;AAAY,OAAC,EAAE,CAAf;AAAkB,WAAK,EAAE,KAAzB;AAAgC,YAAM,EAAE,MAAxC;AAAgD,UAAI,EAAE,MAAtD;AAA8D,YAAM,EAAC;AAArE,MADF,EAEE;AAAM,QAAE,EAAE,CAAC,GAAG,CAAd;AAAiB,QAAE,EAAE,KAArB;AAA4B,QAAE,EAAE,CAAC,GAAG,KAAJ,GAAY,CAA5C;AAA+C,QAAE,EAAE,KAAnD;AAA0D,UAAI,EAAC,MAA/D;AAAsE,YAAM,EAAC;AAA7E,MAFF,EAGE;AAAM,QAAE,EAAE,CAAC,GAAG,CAAd;AAAiB,QAAE,EAAE,KAAK,GAAG,CAA7B;AAAgC,QAAE,EAAE,CAAC,GAAG,KAAJ,GAAY,CAAhD;AAAmD,QAAE,EAAE,KAAK,GAAG,CAA/D;AAAkE,UAAI,EAAC,MAAvE;AAA8E,YAAM,EAAC;AAArF,MAHF,CADF;AAOD,GAXM;;AAaA,0BAAP,UAAuB,MAAvB,EAAmD,KAAnD,EAA6D;AAC3D,QAAI,SAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,eAAS,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAZ;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,eAAS,GAAG,MAAM,CAAC,KAAD,CAAlB;AACD,KAFM,MAEA;AACL,eAAS,GAAG,KAAK,CAAC,sBAAN,CAA6B,KAA7B,CAAZ;AACD;;AAED,WAAO,SAAP;AACD,GAZM;;AAeP,+DAAiC,SAAjC,EAAiD;AAAjD;;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,gBAAR;AAAA,QAAe,QAAf;AAAA,QAAkB,kCAAlB;AAAA,QAAkC,sBAAlC;;AAEN,QAAK,SAAS,CAAC,IAAV,KAAmB,IAAnB,IAA2B,SAAS,CAAC,QAAV,KAAuB,QAAvD,EAAkE;AAChE,UAAI,SAAS,CAAC,IAAV,IAAkB,SAAS,CAAC,IAAV,CAAe,MAArC,EAA6C;AAC3C,aAAK,QAAL,CAAc,KAAK,WAAL,CAAiB,SAAjB,CAAd;AACD,OAFD,MAEO;AACL,aAAK,WAAL;AACD;AACF,KAND,MAMO,IAAI,KAAK,KAAL,IAAc,SAAS,CAAC,KAAV,KAAoB,KAAlC,IAA2C,SAAS,CAAC,CAAV,KAAgB,CAA3D,IAAgE,SAAS,CAAC,cAAV,KAA6B,cAAjG,EAAiH;AACtH,WAAK,KAAL,CAAW,KAAX,CAAiB,CAAC,SAAS,CAAC,CAAX,EAAc,SAAS,CAAC,CAAV,GAAc,SAAS,CAAC,KAAxB,GAAgC,SAAS,CAAC,cAAxD,CAAjB;AACA,WAAK,WAAL,GAAmB,KAAK,KAAL,CAAW,MAAX,GAAoB,GAApB,CAAwB,iBAAK;AAAI,oBAAI,CAAC,KAAL;AAAiB,OAAlD,CAAnB;AAEA,WAAK,QAAL,CAAc;AACZ,cAAM,EAAE,KAAK,KAAL,CAAW,SAAS,CAAC,UAArB,CADI;AAEZ,YAAI,EAAE,KAAK,KAAL,CAAW,SAAS,CAAC,QAArB;AAFM,OAAd;AAID;AACF,GAlBD;;AAoBA;AACE,SAAK,WAAL;;AACA,QAAI,KAAK,UAAT,EAAqB;AACnB,kBAAY,CAAC,KAAK,UAAN,CAAZ;AACA,WAAK,UAAL,GAAkB,IAAlB;AACD;;AAED,SAAK,qBAAL;AACD,GARD;;AAUO,0BAAP,UAAuB,KAAvB,EAAwC,CAAxC,EAAiD;AAC/C,QAAM,GAAG,GAAG,KAAK,CAAC,MAAlB;AACA,QAAI,KAAK,GAAG,CAAZ;AACA,QAAI,GAAG,GAAG,GAAG,GAAG,CAAhB;;AAEA,WAAO,GAAG,GAAG,KAAN,GAAc,CAArB,EAAwB;AACtB,UAAM,MAAM,GAAG,IAAI,CAAC,KAAL,CAAW,CAAC,KAAK,GAAG,GAAT,IAAgB,CAA3B,CAAf;;AAEA,UAAI,KAAK,CAAC,MAAD,CAAL,GAAgB,CAApB,EAAuB;AACrB,WAAG,GAAG,MAAN;AACD,OAFD,MAEO;AACL,aAAK,GAAG,MAAR;AACD;AACF;;AAED,WAAO,CAAC,IAAI,KAAK,CAAC,GAAD,CAAV,GAAkB,GAAlB,GAAwB,KAA/B;AACD,GAhBM;;AAkBP,uCAAS,EAAT,EAA2D;QAAhD,kB;QAAQ,c;AACX;AAAA,QAAE,YAAF;AAAA,QAAO,cAAP;AACN,QAAM,SAAS,GAAG,IAAI,CAAC,MAAL,GAAc,CAAhC;AACA,QAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,IAAjB,CAAZ;AACA,QAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,IAAjB,CAAZ;AACA,QAAM,QAAQ,GAAG,KAAK,CAAC,eAAN,CAAsB,KAAK,WAA3B,EAAwC,GAAxC,CAAjB;AACA,QAAM,QAAQ,GAAG,KAAK,CAAC,eAAN,CAAsB,KAAK,WAA3B,EAAwC,GAAxC,CAAjB;AACA,WAAO;AACL,gBAAU,EAAE,QAAQ,GAAI,QAAQ,GAAG,GAD9B;AAEL,cAAQ,EAAE,QAAQ,KAAK,SAAb,GAAyB,SAAzB,GAAqC,QAAQ,GAAI,QAAQ,GAAG;AAFjE,KAAP;AAID,GAXD;;AAaA,4CAAc,KAAd,EAA2B;AACnB;AAAA,QAAE,cAAF;AAAA,QAAQ,gCAAR;AAAA,QAAuB,oBAAvB;AACN,QAAM,IAAI,GAAG,+BAAkB,IAAI,CAAC,KAAD,CAAtB,EAA+B,OAA/B,EAAwC,KAAxC,CAAb;AAEA,WAAO,oBAAE,UAAF,CAAa,aAAb,IAA8B,aAAa,CAAC,IAAD,EAAO,KAAP,CAA3C,GAA2D,IAAlE;AACD,GALD;;AA0BA;AACE,UAAM,CAAC,gBAAP,CAAwB,SAAxB,EAAmC,KAAK,aAAxC,EAAuD,IAAvD;AACA,UAAM,CAAC,gBAAP,CAAwB,UAAxB,EAAoC,KAAK,aAAzC,EAAwD,IAAxD;AACD,GAHD;;AAKA;AACE,UAAM,CAAC,mBAAP,CAA2B,SAA3B,EAAsC,KAAK,aAA3C,EAA0D,IAA1D;AACA,UAAM,CAAC,mBAAP,CAA2B,UAA3B,EAAuC,KAAK,aAA5C,EAA2D,IAA3D;AACD,GAHD;;AA2CA,8CAAgB,CAAhB,EAAwD;AAChD;AAAA,QAAE,oCAAF;AAAA,QAAmB,kBAAnB;AAAA,QAA2B,cAA3B;AACA;AAAA,QAAE,QAAF;AAAA,QAAK,gBAAL;AAAA,QAAY,kCAAZ;AAAA,QAA4B,0BAA5B;AAAA,QAAwC,sBAAxC;AAAA,QAAkD,sBAAlD;AACN,QAAI,KAAK,GAAG,CAAC,CAAC,KAAF,GAAU,eAAtB;;AAEA,QAAI,KAAK,GAAG,CAAZ,EAAe;AACb,WAAK,GAAG,IAAI,CAAC,GAAL,CAAS,KAAT,EAAgB,CAAC,GAAG,KAAJ,GAAY,cAAZ,GAA6B,IAA7C,EAAmD,CAAC,GAAG,KAAJ,GAAY,cAAZ,GAA6B,MAAhF,CAAR;AACD,KAFD,MAEO,IAAI,KAAK,GAAG,CAAZ,EAAe;AACpB,WAAK,GAAG,IAAI,CAAC,GAAL,CAAS,KAAT,EAAgB,CAAC,GAAG,MAApB,EAA4B,CAAC,GAAG,IAAhC,CAAR;AACD;;AACD,QAAM,QAAQ,GAAG,KAAK,QAAL,CAAc;AAC7B,YAAM,EAAE,MAAM,GAAG,KADY;AAE7B,UAAI,EAAE,IAAI,GAAG;AAFgB,KAAd,CAAjB;;AAKA,QAAI,CAAC,QAAQ,CAAC,UAAT,KAAwB,UAAxB,IAAsC,QAAQ,CAAC,QAAT,KAAsB,QAA7D,KAA0E,QAA9E,EAAwF;AACtF,cAAQ,CAAC,QAAD,CAAR;AACD;;AAED,SAAK,QAAL,CAAc;AACZ,YAAM,EAAE,MAAM,GAAG,KADL;AAEZ,UAAI,EAAE,IAAI,GAAG,KAFD;AAGZ,qBAAe,EAAE,CAAC,CAAC;AAHP,KAAd;AAKD,GAxBD;;AA0BA,uDAAyB,EAAzB,EAA+C,CAA/C,EAAmG;AACjG,QAAM,KAAK,GAAG,OAAO,CAAC,CAAD,CAAP,GAAa,CAAC,CAAC,cAAF,CAAiB,CAAjB,CAAb,GAAmC,CAAjD;AAEA,SAAK,QAAL,CAAc;AACZ,mBAAa,EAAE,KADH;AAEZ,uBAAiB,EAAE,IAFP;AAGZ,uBAAiB,EAAE,EAHP;AAIZ,qBAAe,EAAE,KAAK,CAAC;AAJX,KAAd;AAOA,SAAK,qBAAL;AACD,GAXD;;AAaA,kDAAoB,CAApB,EAA4D;;;AACpD;AAAA,QAAE,oCAAF;AAAA,QAAmB,wCAAnB;AAAA,QAAsC,cAAtC;AAAA,QAA4C,kBAA5C;AACN,QAAM,SAAS,GAAG,KAAK,KAAL,CAAW,iBAAX,CAAlB;AAEM;AAAA,QAAE,QAAF;AAAA,QAAK,gBAAL;AAAA,QAAY,kCAAZ;AAAA,QAA4B,sBAA5B;AAAA,QAAsC,YAAtC;AAAA,QAA2C,cAA3C;AACN,QAAM,MAAM,GAAG;AAAE,YAAM,EAAE,KAAK,KAAL,CAAW,MAArB;AAA6B,UAAI,EAAE,KAAK,KAAL,CAAW;AAA9C,KAAf;AAEA,QAAI,KAAK,GAAG,CAAC,CAAC,KAAF,GAAU,eAAtB;;AACA,QAAI,KAAK,GAAG,CAAZ,EAAe;AACb,WAAK,GAAG,IAAI,CAAC,GAAL,CAAS,KAAT,EAAgB,CAAC,GAAG,KAAJ,GAAY,cAAZ,GAA6B,SAA7C,CAAR;AACD,KAFD,MAEO,IAAI,KAAK,GAAG,CAAZ,EAAe;AACpB,WAAK,GAAG,IAAI,CAAC,GAAL,CAAS,KAAT,EAAgB,CAAC,GAAG,SAApB,CAAR;AACD;;AAED,UAAM,CAAC,iBAAD,CAAN,GAA4B,SAAS,GAAG,KAAxC;AAEA,QAAM,QAAQ,GAAG,KAAK,QAAL,CAAc,MAAd,CAAjB;AACQ;AAAA,QAAY,4BAAZ;;AACR,QAAM,SAAS,GAAG,SAAZ,SAAY;AAChB,UAAM,SAAS,GAAG,IAAI,CAAC,MAAL,GAAc,CAAhC;;AACA,UACG,iBAAiB,KAAK,QAAtB,KAAmC,IAAI,GAAG,MAAP,GAAgB,UAAU,GAAG,GAAb,KAAqB,CAArC,GAAyC,QAAQ,GAAG,GAAX,KAAmB,CAA/F,CAAD,IACC,IAAI,GAAG,MAAP,IAAiB,QAAQ,KAAK,SAD/B,IAEC,iBAAiB,KAAK,MAAtB,KAAiC,IAAI,GAAG,MAAP,GAAgB,QAAQ,GAAG,GAAX,KAAmB,CAAnC,GAAuC,UAAU,GAAG,GAAb,KAAqB,CAA7F,CAFD,IAGC,IAAI,GAAG,MAAP,IAAiB,QAAQ,KAAK,SAJjC,EAKE;AACA,eAAO,IAAP;AACD;;AACD,aAAO,KAAP;AACD,KAXD;;AAaA,SAAK,QAAL,EAAa,SAET,GAAC,iBAAD,IAAqB,SAAS,GAAG,KAFxB,EAGT,qBAAiB,CAAC,CAAC,KAHV,E,EAAb,GAKE;AACE,UAAI,QAAJ,EAAc;AACZ,YAAI,SAAS,EAAb,EAAiB;AACf,kBAAQ,CAAC,QAAD,CAAR;AACD;AACF;AACF,KAXH;AAaD,GA5CD;;AA8CA,0CAAY,KAAZ,EAAwB;AAAxB;;AACU;AAAA,QAAM,6BAAN;AAAA,QAAkB,yBAAlB;AAAA,QAA4B,WAA5B;AAAA,QAA+B,mBAA/B;AAAA,QAAsC,qCAAtC;AACR,QAAM,GAAG,GAAG,IAAI,CAAC,MAAjB;AACA,SAAK,KAAL,GAAa,wBACV,MADU,CACH,oBAAE,KAAF,CAAQ,CAAR,EAAW,GAAX,CADG,EAEV,KAFU,CAEJ,CAAC,CAAD,EAAI,CAAC,GAAG,KAAJ,GAAY,cAAhB,CAFI,CAAb;AAGA,SAAK,WAAL,GAAmB,KAAK,KAAL,CAAW,MAAX,GAAoB,GAApB,CAAwB,iBAAK;AAAI,kBAAI,CAAC,KAAL;AAAiB,KAAlD,CAAnB;AACA,WAAO;AACL,kBAAY,EAAE,KADT;AAEL,mBAAa,EAAE,KAFV;AAGL,uBAAiB,EAAE,KAHd;AAIL,YAAM,EAAE,KAAK,KAAL,CAAW,UAAX,CAJH;AAKL,UAAI,EAAE,KAAK,KAAL,CAAW,QAAX;AALD,KAAP;AAOD,GAdD;;AAgBA;AACE,SAAK,KAAL,GAAa,IAAb;AACA,SAAK,WAAL,GAAmB,IAAnB;AACD,GAHD;;AAKA;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,cAAvB;AAAA,QAA6B,kBAA7B;AAEN,WAAO;AAAM,YAAM,EAAE,MAAd;AAAsB,UAAI,EAAE,IAA5B;AAAkC,OAAC,EAAE,CAArC;AAAwC,OAAC,EAAE,CAA3C;AAA8C,WAAK,EAAE,KAArD;AAA4D,YAAM,EAAE;AAApE,MAAP;AACD,GAJD;;AAMA;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,cAAvB;AAAA,QAA6B,sBAA7B;AAAA,QAAuC,oBAAvC;AACN,QAAM,YAAY,GAAG,iBAAS,IAAT,CAAc,QAAd,CAArB;;AAEA,QAAI,CAAC,YAAL,EAAmB;AACjB,aAAO,IAAP;AACD;;AAED,WAAO,mBAAM,YAAN,CAAmB,YAAnB,EAAiC;AACtC,OAAC,GADqC;AAEtC,OAAC,GAFqC;AAGtC,WAAK,OAHiC;AAItC,YAAM,QAJgC;AAKtC,YAAM,EAAE,OAL8B;AAMtC,aAAO,EAAE,IAN6B;AAOtC,UAAI;AAPkC,KAAjC,CAAP;AASD,GAjBD;;AAmBA,mDAAqB,UAArB,EAAyC,EAAzC,EAA6D;AACrD;AAAA,QAAE,QAAF;AAAA,QAAK,kCAAL;AAAA,QAAqB,kBAArB;AAAA,QAA6B,wBAA7B;AACN,QAAM,CAAC,GAAG,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,KAAK,KAAL,CAAW,CAAhC,CAAV;;AACA,QAAM,cAAc,yBACf,oBAAY,KAAK,KAAjB,CADe,GACQ;AAC1B,OAAC,GADyB;AAE1B,OAAC,GAFyB;AAG1B,WAAK,EAAE,cAHmB;AAI1B,YAAM;AAJoB,KADR,CAApB;;AAQA,WACE,iCAAC,kBAAD,EAAM;AACJ,eAAS,EAAC,0BADN;AAEJ,kBAAY,EAAE,KAAK,2BAFf;AAGJ,kBAAY,EAAE,KAAK,2BAHf;AAIJ,iBAAW,EAAE,KAAK,0BAAL,CAAgC,EAAhC,CAJT;AAKJ,kBAAY,EAAE,KAAK,0BAAL,CAAgC,EAAhC,CALV;AAMJ,WAAK,EAAE;AAAE,cAAM,EAAE;AAAV;AANH,KAAN,EAQG,KAAK,CAAC,eAAN,CAAsB,SAAtB,EAAiC,cAAjC,CARH,CADF;AAYD,GAvBD;;AAyBA,0CAAY,MAAZ,EAA4B,IAA5B,EAAwC;AAChC;AAAA,QAAE,QAAF;AAAA,QAAK,kBAAL;AAAA,QAAa,kBAAb;AAAA,QAAqB,kCAArB;AACN,QAAM,CAAC,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,IAAjB,IAAyB,cAAnC;AACA,QAAM,KAAK,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,IAAI,GAAG,MAAhB,IAA0B,cAAnC,EAAmD,CAAnD,CAAd;AAEA,WACE;AACE,eAAS,EAAC,sBADZ;AAEE,kBAAY,EAAE,KAAK,2BAFrB;AAGE,kBAAY,EAAE,KAAK,2BAHrB;AAIE,iBAAW,EAAE,KAAK,oBAJpB;AAKE,kBAAY,EAAE,KAAK,oBALrB;AAME,WAAK,EAAE;AAAE,cAAM,EAAE;AAAV,OANT;AAOE,YAAM,EAAC,MAPT;AAQE,UAAI,EAAE,MARR;AASE,iBAAW,EAAE,GATf;AAUE,OAAC,EAAE,CAVL;AAWE,OAAC,EAAE,CAXL;AAYE,WAAK,EAAE,KAZT;AAaE,YAAM,EAAE;AAbV,MADF;AAiBD,GAtBD;;AAwBA;AACQ;AAAA,QAAE,0BAAF;AAAA,QAAc,sBAAd;AAAA,QAAwB,QAAxB;AAAA,QAA2B,kBAA3B;AAAA,QAAmC,kCAAnC;AAAA,QAAmD,kBAAnD;AACA;AAAA,QAAE,kBAAF;AAAA,QAAU,cAAV;AACN,QAAM,MAAM,GAAG,CAAf;AACA,QAAM,KAAK,GAAG;AACZ,mBAAa,EAAE,MADH;AAEZ,UAAI,EAAE;AAFM,KAAd;AAKA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EACE,iCAAC,iBAAD,EAAK;AACH,gBAAU,EAAC,KADR;AAEH,oBAAc,EAAC,QAFZ;AAGH,OAAC,EAAE,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,IAAjB,IAAyB,MAHzB;AAIH,OAAC,EAAE,CAAC,GAAG,MAAM,GAAG;AAJb,OAKC,KALD,CAAL,EAOG,KAAK,aAAL,CAAmB,UAAnB,CAPH,CADF,EAUE,iCAAC,iBAAD,EAAK;AACH,gBAAU,EAAC,OADR;AAEH,oBAAc,EAAC,QAFZ;AAGH,OAAC,EAAE,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,IAAjB,IAAyB,cAAzB,GAA0C,MAH1C;AAIH,OAAC,EAAE,CAAC,GAAG,MAAM,GAAG;AAJb,OAKC,KALD,CAAL,EAOG,KAAK,aAAL,CAAmB,QAAnB,CAPH,CAVF,CADF;AAsBD,GA/BD;;AAiCA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,wBAAR;AAAA,QAAmB,sBAAnB;AAAA,QAA6B,QAA7B;AAAA,QAAgC,QAAhC;AAAA,QAAmC,gBAAnC;AAAA,QAA0C,kBAA1C;AAAA,QAAkD,kCAAlD;AACA;AAAA,QAAE,kBAAF;AAAA,QAAU,cAAV;AAAA,QAAgB,8BAAhB;AAAA,QAA8B,gCAA9B;AAAA,QAA6C,wCAA7C;;AAEN,QACE,CAAC,IAAD,IACA,CAAC,IAAI,CAAC,MADN,IAEA,CAAC,qBAAS,CAAT,CAFD,IAGA,CAAC,qBAAS,CAAT,CAHD,IAIA,CAAC,qBAAS,KAAT,CAJD,IAKA,CAAC,qBAAS,MAAT,CALD,IAMA,KAAK,IAAI,CANT,IAOA,MAAM,IAAI,CARZ,EASE;AACA,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,gBAAX,EAA6B,SAA7B,CAAnB;AACA,QAAM,WAAW,GAAG,mBAAM,QAAN,CAAe,KAAf,CAAqB,QAArB,MAAmC,CAAvD;AACA,QAAM,KAAK,GAAG,qCAAoB,YAApB,EAAkC,MAAlC,CAAd;AAEA,WACE,iCAAC,kBAAD,EAAM;AACJ,eAAS,EAAE,UADP;AAEJ,iBAAW,EAAE,KAAK,UAFd;AAGJ,kBAAY,EAAE,KAAK,kBAHf;AAIJ,iBAAW,EAAE,KAAK,eAJd;AAKJ,WAAK,EAAE;AALH,KAAN,EAOG,KAAK,gBAAL,EAPH,EAQG,WAAW,IAAI,KAAK,cAAL,EARlB,EASG,KAAK,WAAL,CAAiB,MAAjB,EAAyB,IAAzB,CATH,EAUG,KAAK,oBAAL,CAA0B,MAA1B,EAAkC,QAAlC,CAVH,EAWG,KAAK,oBAAL,CAA0B,IAA1B,EAAgC,MAAhC,CAXH,EAYG,CAAC,YAAY,IAAI,aAAhB,IAAiC,iBAAjC,IAAsD,cAAvD,KAA0E,KAAK,UAAL,EAZ7E,CADF;AAgBD,GArCD;;AA3ZO,sBAAc,OAAd;AAEA,uBAAe;AACpB,UAAM,EAAE,EADY;AAEpB,kBAAc,EAAE,CAFI;AAGpB,OAAG,EAAE,CAHe;AAIpB,QAAI,EAAE,MAJc;AAKpB,UAAM,EAAE,MALY;AAMpB,WAAO,EAAE;AAAE,SAAG,EAAE,CAAP;AAAU,WAAK,EAAE,CAAjB;AAAoB,YAAM,EAAE,CAA5B;AAA+B,UAAI,EAAE;AAArC,KANW;AAOpB,gBAAY,EAAE,IAPM;AAQpB,kBAAc,EAAE;AARI,GAAf;AA+bT;AAAC,CAlcD,CAAoB,qBAApB;;AAocA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtgBA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAoCA;AAA4B;;AAA5B;;AA0aC;;AA9YQ,2BAAP,UAAgB,KAAhB,EAA4B;AAClB;AAAA,QAAM,mBAAN;AAAA,QAAa,uBAAb;AAAA,QAAsB,6BAAtB;AAAA,QAAkC,+BAAlC;AAAA,QAA+C,yBAA/C;AAAA,QAAyD,mCAAzD;AAAA,QAAwE,iBAAxE;;AAER,QAAI,CAAC,KAAD,IAAU,CAAC,KAAK,CAAC,MAAjB,IAA2B,CAAC,IAAhC,EAAsC;AACpC,aAAO,EAAP;AACD;;AAED,QAAI,qBAAS,QAAT,KAAsB,oBAAO,KAAjC,EAAwC;AACtC,aAAO,aAAa,CAAC,sBAAd,CACL,KADK,EAEL,OAAO,QAAP,KAAoB,QAApB,IAAgC,qBAAS,QAAT,CAAhC,GAAqD,QAArD,GAAgE,CAF3D,CAAP;AAID;;AAED,QAAI,QAAQ,KAAK,kBAAjB,EAAqC;AACnC,aAAO,aAAa,CAAC,aAAd,CACL;AACE,aAAK,OADP;AAEE,qBAAa,eAFf;AAGE,eAAO,SAHT;AAIE,mBAAW,aAJb;AAKE,kBAAU,YALZ;AAME,YAAI;AANN,OADK,EASL,IATK,CAAP;AAWD;;AACD,QAAI,QAAQ,KAAK,eAAjB,EAAkC;AAChC,aAAO,aAAa,CAAC,aAAd,CAA4B;AACjC,aAAK,OAD4B;AAEjC,qBAAa,eAFoB;AAGjC,eAAO,SAH0B;AAIjC,mBAAW,aAJsB;AAKjC,kBAAU,YALuB;AAMjC,YAAI;AAN6B,OAA5B,CAAP;AAQD;;AAED,WAAO,aAAa,CAAC,WAAd,CAA0B;AAC/B,WAAK,OAD0B;AAE/B,mBAAa,eAFkB;AAG/B,aAAO,SAHwB;AAI/B,iBAAW,aAJoB;AAK/B,gBAAU,YALqB;AAM/B,UAAI;AAN2B,KAA1B,CAAP;AAQD,GA9CM;;AAgDA,yCAAP,UAA8B,KAA9B,EAA0D,QAA1D,EAA0E;AACxE,WAAO,KAAK,CAAC,MAAN,CAAa,UAAC,KAAD,EAAQ,CAAR,EAAS;AAAK,cAAC,IAAI,QAAQ,GAAG,CAAf,CAAD;AAAwB,KAAnD,CAAP;AACD,GAFM;;AAIA,gCAAP,UACE,EADF,EAEE,WAFF,EAEuB;QADnB,gB;QAAO,gC;QAAe,oB;QAAS,4B;QAAa,0B;QAAY,c;AAGlD;AAAA,QAAG,aAAH;AAAA,QAAM,qBAAN;AAAA,QAAa,uBAAb;AACR,QAAM,OAAO,GAAG,WAAW,KAAK,KAAhB,IAAyB,WAAW,KAAK,QAAzC,GAAoD,OAApD,GAA8D,QAA9E;AACA,QAAM,MAAM,GAAG,CAAC,KAAK,IAAI,EAAV,EAAc,KAAd,EAAf;AAEA,QAAM,QAAQ,GAAG,IAAI,IAAI,OAAO,KAAK,OAApB,GAA8B,yBAAc,IAAd,EAAoB,OAApB,CAA9B,GAA6D,CAA9E;AACA,QAAM,GAAG,GAAG,MAAM,CAAC,MAAnB;AACA,QAAM,IAAI,GAAG,GAAG,IAAI,CAAP,GAAW,qBAAS,MAAM,CAAC,CAAD,CAAN,CAAU,UAAV,GAAuB,MAAM,CAAC,CAAD,CAAN,CAAU,UAA1C,CAAX,GAAmE,CAAhF;AAEA,QAAI,KAAJ,EAAW,GAAX;;AAEA,QAAI,IAAI,KAAK,CAAb,EAAgB;AACd,WAAK,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAtB,GAA0B,CAAlC;AACA,SAAG,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAC,GAAG,KAA1B,GAAkC,CAAC,GAAG,MAA5C;AACD,KAHD,MAGO;AACL,WAAK,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAC,GAAG,KAA1B,GAAkC,CAAC,GAAG,MAA9C;AACA,SAAG,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAtB,GAA0B,CAAhC;AACD;;AAED,QAAI,WAAJ,EAAiB;AAEf,UAAI,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,CAAP,CAAhB;AACA,UAAM,WAAW,GAAG,oBAAE,UAAF,CAAa,aAAb,IAA8B,aAAa,CAAC,IAAI,CAAC,KAAN,EAAa,GAAG,GAAG,CAAnB,CAA3C,GAAmE,IAAI,CAAC,KAA5F;AACA,UAAM,QAAQ,GAAG,yBAAc,WAAd,EAA2B,OAA3B,IAAsC,QAAvD;AACA,UAAM,OAAO,GAAG,IAAI,IAAI,IAAI,CAAC,UAAL,GAAmB,IAAI,GAAG,QAAR,GAAoB,CAAtC,GAA0C,GAA9C,CAApB;AACA,YAAM,CAAC,GAAG,GAAG,CAAP,CAAN,GAAkB,IAAI,yBACjB,IADiB,GACb;AACP,iBAAS,EAAE,OAAO,GAAG,CAAV,GAAc,IAAI,CAAC,UAAL,GAAkB,OAAO,GAAG,IAA1C,GAAiD,IAAI,CAAC;AAD1D,OADa,CAAtB;AAKA,UAAM,UAAU,GACd,IAAI,IAAI,IAAI,CAAC,SAAL,GAAkB,IAAI,GAAG,QAAR,GAAoB,CAArC,GAAyC,KAA7C,CAAJ,IAA2D,CAA3D,IACA,IAAI,IAAI,IAAI,CAAC,SAAL,GAAkB,IAAI,GAAG,QAAR,GAAoB,CAArC,GAAyC,GAA7C,CAAJ,IAAyD,CAF3D;;AAIA,UAAI,UAAJ,EAAgB;AACd,WAAG,GAAG,IAAI,CAAC,SAAL,GAAiB,IAAI,IAAI,QAAQ,GAAG,CAAX,GAAe,UAAnB,CAA3B;AACA,cAAM,CAAC,GAAG,GAAG,CAAP,CAAN,GAAe,sBAAQ,IAAR,GAAY;AAAE,gBAAM,EAAE;AAAV,SAAZ,CAAf;AACD;AACF;;AAED,QAAM,KAAK,GAAG,WAAW,GAAG,GAAG,GAAG,CAAT,GAAa,GAAtC;;AACA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAApB,EAA2B,CAAC,EAA5B,EAAgC;AAC9B,UAAI,KAAK,GAAG,MAAM,CAAC,CAAD,CAAlB;AACA,UAAM,OAAO,GAAG,oBAAE,UAAF,CAAa,aAAb,IAA8B,aAAa,CAAC,KAAK,CAAC,KAAP,EAAc,CAAd,CAA3C,GAA8D,KAAK,CAAC,KAApF;AACA,UAAM,IAAI,GAAG,yBAAc,OAAd,EAAuB,OAAvB,IAAkC,QAA/C;;AAEA,UAAI,CAAC,KAAK,CAAV,EAAa;AACX,YAAM,GAAG,GAAG,IAAI,IAAI,KAAK,CAAC,UAAN,GAAoB,IAAI,GAAG,IAAR,GAAgB,CAAnC,GAAuC,KAA3C,CAAhB;AACA,cAAM,CAAC,CAAD,CAAN,GAAY,KAAK,yBACZ,KADY,GACP;AACR,mBAAS,EAAE,GAAG,GAAG,CAAN,GAAU,KAAK,CAAC,UAAN,GAAmB,GAAG,GAAG,IAAnC,GAA0C,KAAK,CAAC;AADnD,SADO,CAAjB;AAID,OAND,MAMO;AACL,cAAM,CAAC,CAAD,CAAN,GAAY,KAAK,yBAAQ,KAAR,GAAa;AAAE,mBAAS,EAAE,KAAK,CAAC;AAAnB,SAAb,CAAjB;AACD;;AAED,UAAM,MAAM,GACV,IAAI,IAAI,KAAK,CAAC,SAAN,GAAmB,IAAI,GAAG,IAAR,GAAgB,CAAlC,GAAsC,KAA1C,CAAJ,IAAwD,CAAxD,IACA,IAAI,IAAI,KAAK,CAAC,SAAN,GAAmB,IAAI,GAAG,IAAR,GAAgB,CAAlC,GAAsC,GAA1C,CAAJ,IAAsD,CAFxD;;AAIA,UAAI,MAAJ,EAAY;AACV,aAAK,GAAG,KAAK,CAAC,SAAN,GAAkB,IAAI,IAAI,IAAI,GAAG,CAAP,GAAW,UAAf,CAA9B;AACA,cAAM,CAAC,CAAD,CAAN,GAAS,sBAAQ,KAAR,GAAa;AAAE,gBAAM,EAAE;AAAV,SAAb,CAAT;AACD;AACF;;AAED,WAAO,MAAM,CAAC,MAAP,CAAc,iBAAK;AAAI,kBAAK,CAAL;AAAY,KAAnC,CAAP;AACD,GAtEM;;AAwEA,8BAAP,UAAmB,EAAnB,EAA8G;QAAzF,gB;QAAO,gC;QAAe,oB;QAAS,4B;QAAa,0B;QAAY,c;AACnE;AAAA,QAAG,aAAH;AAAA,QAAM,qBAAN;AAAA,QAAa,uBAAb;AACR,QAAM,OAAO,GAAG,WAAW,KAAK,KAAhB,IAAyB,WAAW,KAAK,QAAzC,GAAoD,OAApD,GAA8D,QAA9E;AAEA,QAAM,QAAQ,GAAG,IAAI,IAAI,OAAO,KAAK,OAApB,GAA8B,yBAAc,IAAd,EAAoB,OAApB,CAA9B,GAA6D,CAA9E;AACA,QAAM,MAAM,GAAG,CAAC,KAAK,IAAI,EAAV,EAAc,KAAd,EAAf;AACA,QAAM,GAAG,GAAG,MAAM,CAAC,MAAnB;AACA,QAAM,IAAI,GAAG,GAAG,IAAI,CAAP,GAAW,qBAAS,MAAM,CAAC,CAAD,CAAN,CAAU,UAAV,GAAuB,MAAM,CAAC,CAAD,CAAN,CAAU,UAA1C,CAAX,GAAmE,CAAhF;AAEA,QAAI,KAAJ,EAAW,GAAX;;AAEA,QAAI,IAAI,KAAK,CAAb,EAAgB;AACd,WAAK,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAtB,GAA0B,CAAlC;AACA,SAAG,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAC,GAAG,KAA1B,GAAkC,CAAC,GAAG,MAA5C;AACD,KAHD,MAGO;AACL,WAAK,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAC,GAAG,KAA1B,GAAkC,CAAC,GAAG,MAA9C;AACA,SAAG,GAAG,OAAO,KAAK,OAAZ,GAAsB,CAAtB,GAA0B,CAAhC;AACD;;AAED,SAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAnB,EAAsB,CAAC,IAAI,CAA3B,EAA8B,CAAC,EAA/B,EAAmC;AACjC,UAAI,KAAK,GAAG,MAAM,CAAC,CAAD,CAAlB;AACA,UAAM,OAAO,GAAG,oBAAE,UAAF,CAAa,aAAb,IAA8B,aAAa,CAAC,KAAK,CAAC,KAAP,EAAc,GAAG,GAAG,CAAN,GAAU,CAAxB,CAA3C,GAAwE,KAAK,CAAC,KAA9F;AACA,UAAM,IAAI,GAAG,yBAAc,OAAd,EAAuB,OAAvB,IAAkC,QAA/C;;AAEA,UAAI,CAAC,KAAK,GAAG,GAAG,CAAhB,EAAmB;AACjB,YAAM,GAAG,GAAG,IAAI,IAAI,KAAK,CAAC,UAAN,GAAoB,IAAI,GAAG,IAAR,GAAgB,CAAnC,GAAuC,GAA3C,CAAhB;AACA,cAAM,CAAC,CAAD,CAAN,GAAY,KAAK,yBACZ,KADY,GACP;AACR,mBAAS,EAAE,GAAG,GAAG,CAAN,GAAU,KAAK,CAAC,UAAN,GAAmB,GAAG,GAAG,IAAnC,GAA0C,KAAK,CAAC;AADnD,SADO,CAAjB;AAID,OAND,MAMO;AACL,cAAM,CAAC,CAAD,CAAN,GAAY,KAAK,yBAAQ,KAAR,GAAa;AAAE,mBAAS,EAAE,KAAK,CAAC;AAAnB,SAAb,CAAjB;AACD;;AAED,UAAM,MAAM,GACV,IAAI,IAAI,KAAK,CAAC,SAAN,GAAmB,IAAI,GAAG,IAAR,GAAgB,CAAlC,GAAsC,KAA1C,CAAJ,IAAwD,CAAxD,IACA,IAAI,IAAI,KAAK,CAAC,SAAN,GAAmB,IAAI,GAAG,IAAR,GAAgB,CAAlC,GAAsC,GAA1C,CAAJ,IAAsD,CAFxD;;AAIA,UAAI,MAAJ,EAAY;AACV,WAAG,GAAG,KAAK,CAAC,SAAN,GAAkB,IAAI,IAAI,IAAI,GAAG,CAAP,GAAW,UAAf,CAA5B;AACA,cAAM,CAAC,CAAD,CAAN,GAAS,sBAAQ,KAAR,GAAa;AAAE,gBAAM,EAAE;AAAV,SAAb,CAAT;AACD;AACF;;AAED,WAAO,MAAM,CAAC,MAAP,CAAc,iBAAK;AAAI,kBAAK,CAAL;AAAY,KAAnC,CAAP;AACD,GA7CM;;AA+CP,4DAAsB,EAAtB,EAAsD;AAA9B;AAAA,QAAS,mCAAT;;AAGtB,QAAM,eAAN;AAAA,QAAQ,uBAAR;AAAA,QAA6B,sCAA7B;;AACA,WAAO,CAAC,4BAAa,OAAb,EAAsB,UAAtB,CAAD,IAAsC,CAAC,4BAAa,SAAb,EAAwB,YAAxB,CAA9C;AACD,GALD;;AAaA,uDAAiB,IAAjB,EAAwC;AAChC;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,4BAAvB;AAAA,QAAoC,sBAApC;AAAA,QAA8C,kBAA9C;AAAA,QAAsD,0BAAtD;AACN,QAAI,EAAJ,EAAQ,EAAR,EAAY,EAAZ,EAAgB,EAAhB,EAAoB,EAApB,EAAwB,EAAxB;AAEA,QAAM,IAAI,GAAG,MAAM,GAAG,CAAC,CAAJ,GAAQ,CAA3B;AACA,QAAM,aAAa,GAAG,IAAI,CAAC,QAAL,IAAiB,QAAvC;AACA,QAAM,SAAS,GAAG,qBAAS,IAAI,CAAC,SAAd,IAA2B,IAAI,CAAC,SAAhC,GAA4C,IAAI,CAAC,UAAnE;;AAEA,YAAQ,WAAR;AACE,WAAK,KAAL;AACE,UAAE,GAAG,EAAE,GAAG,IAAI,CAAC,UAAf;AACA,UAAE,GAAG,CAAC,GAAG,CAAC,CAAC,MAAF,GAAW,MAApB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,aAAjB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,UAAjB;AACA,UAAE,GAAG,SAAL;AACA;;AACF,WAAK,MAAL;AACE,UAAE,GAAG,EAAE,GAAG,IAAI,CAAC,UAAf;AACA,UAAE,GAAG,CAAC,GAAG,CAAC,CAAC,MAAF,GAAW,KAApB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,aAAjB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,UAAjB;AACA,UAAE,GAAG,SAAL;AACA;;AACF,WAAK,OAAL;AACE,UAAE,GAAG,EAAE,GAAG,IAAI,CAAC,UAAf;AACA,UAAE,GAAG,CAAC,GAAG,CAAC,MAAD,GAAU,KAAnB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,aAAjB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,UAAjB;AACA,UAAE,GAAG,SAAL;AACA;;AACF;AACE,UAAE,GAAG,EAAE,GAAG,IAAI,CAAC,UAAf;AACA,UAAE,GAAG,CAAC,GAAG,CAAC,MAAD,GAAU,MAAnB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,aAAjB;AACA,UAAE,GAAG,EAAE,GAAG,IAAI,GAAG,UAAjB;AACA,UAAE,GAAG,SAAL;AACA;AA5BJ;;AA+BA,WAAO;AAAE,UAAI,EAAE;AAAE,UAAE,IAAJ;AAAM,UAAE,IAAR;AAAU,UAAE,IAAZ;AAAc,UAAE;AAAhB,OAAR;AAA4B,UAAI,EAAE;AAAE,SAAC,EAAE,EAAL;AAAS,SAAC,EAAE;AAAZ;AAAlC,KAAP;AACD,GAxCD;;AA0CA;AACQ;AAAA,QAAE,4BAAF;AAAA,QAAe,kBAAf;AACN,QAAI,UAAJ;;AAEA,YAAQ,WAAR;AACE,WAAK,MAAL;AACE,kBAAU,GAAG,MAAM,GAAG,OAAH,GAAa,KAAhC;AACA;;AACF,WAAK,OAAL;AACE,kBAAU,GAAG,MAAM,GAAG,KAAH,GAAW,OAA9B;AACA;;AACF;AACE,kBAAU,GAAG,QAAb;AACA;AATJ;;AAYA,WAAO,UAAP;AACD,GAjBD;;AAmBA;AACQ;AAAA,QAAE,4BAAF;AAAA,QAAe,kBAAf;AACN,QAAI,cAAc,GAAG,KAArB;;AAEA,YAAQ,WAAR;AACE,WAAK,MAAL;AACA,WAAK,OAAL;AACE,sBAAc,GAAG,QAAjB;AACA;;AACF,WAAK,KAAL;AACE,sBAAc,GAAG,MAAM,GAAG,OAAH,GAAa,KAApC;AACA;;AACF;AACE,sBAAc,GAAG,MAAM,GAAG,KAAH,GAAW,OAAlC;AACA;AAVJ;;AAaA,WAAO,cAAP;AACD,GAlBD;;AAoBA;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,4BAAvB;AAAA,QAAoC,kBAApC;AAAA,QAA4C,sBAA5C;;AACN,QAAI,KAAK,kCACJ,oBAAY,KAAK,KAAjB,CADI,GAEJ,oBAAY,QAAZ,CAFI,GAEiB;AACxB,UAAI,EAAE;AADkB,KAFjB,CAAT;;AAMA,QAAI,WAAW,KAAK,KAAhB,IAAyB,WAAW,KAAK,QAA7C,EAAuD;AACrD,UAAM,UAAU,GAAG,EAAG,WAAW,KAAK,KAAhB,IAAyB,CAAC,MAA3B,IAAuC,WAAW,KAAK,QAAhB,IAA4B,MAArE,CAAnB;AACA,WAAK,yBACA,KADA,GACK;AACR,UAAE,EAAE,CADI;AAER,UAAE,EAAE,CAAC,GAAG,UAAU,GAAG,MAFb;AAGR,UAAE,EAAE,CAAC,GAAG,KAHA;AAIR,UAAE,EAAE,CAAC,GAAG,UAAU,GAAG;AAJb,OADL,CAAL;AAOD,KATD,MASO;AACL,UAAM,SAAS,GAAG,EAAG,WAAW,KAAK,MAAhB,IAA0B,CAAC,MAA5B,IAAwC,WAAW,KAAK,OAAhB,IAA2B,MAArE,CAAlB;AACA,WAAK,yBACA,KADA,GACK;AACR,UAAE,EAAE,CAAC,GAAG,SAAS,GAAG,KADZ;AAER,UAAE,EAAE,CAFI;AAGR,UAAE,EAAE,CAAC,GAAG,SAAS,GAAG,KAHZ;AAIR,UAAE,EAAE,CAAC,GAAG;AAJA,OADL,CAAL;AAOD;;AAED,WAAO,sDAAU,KAAV,EAAe;AAAE,eAAS,EAAE,wBAAW,8BAAX,EAA2C,oBAAE,GAAF,CAAM,QAAN,EAAgB,WAAhB,CAA3C;AAAb,KAAf,EAAP;AACD,GA7BD;;AA+BO,iCAAP,UAAsB,MAAtB,EAA6C,KAA7C,EAAyD,KAAzD,EAAyE;AACvE,QAAI,QAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,cAAQ,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAX;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,cAAQ,GAAG,MAAM,CAAC,KAAD,CAAjB;AACD,KAFM,MAEA;AACL,cAAQ,GACN,iCAAC,iBAAD,EAAK,aAAK,KAAL,EAAU;AAAE,iBAAS,EAAC;AAAZ,OAAV,CAAL,EACG,KADH,CADF;AAKD;;AAED,WAAO,QAAP;AACD,GAhBM;;AAuBP,kDAAY,KAAZ,EAAsC;AAAtC;;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,kBAAZ;AAAA,QAAoB,cAApB;AAAA,QAA0B,gCAA1B;AAAA,QAAyC,cAAzC;AACN,QAAM,UAAU,GAAG,aAAa,CAAC,QAAd,CAAsB,sBAAM,KAAK,KAAX,GAAgB;AAAE,WAAK;AAAP,KAAhB,CAAtB,CAAnB;AACA,QAAM,UAAU,GAAG,KAAK,iBAAL,EAAnB;AACA,QAAM,cAAc,GAAG,KAAK,qBAAL,EAAvB;AACA,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AACA,QAAM,eAAe,GAAG,oBAAY,IAAZ,CAAxB;;AACA,QAAM,aAAa,kCACd,SADc,GACL;AACZ,UAAI,EAAE;AADM,KADK,GAGd,oBAAY,QAAZ,CAHc,CAAnB;;AAKA,QAAM,KAAK,GAAG,UAAU,CAAC,GAAX,CAAe,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC9B;AAAA,UAAE,mBAAF;AAAA,UAAmB,mBAAnB;;AACN,UAAM,SAAS;AACb,kBAAU,YADG;AAEb,sBAAc;AAFD,SAGV,SAHU,GAGD;AACZ,cAAM,EAAE,MADI;AAEZ,YAAI,EAAE;AAFM,OAHC,GAMV,eANU,GAOV,SAPU,GAOD;AACZ,aAAK,EAAE,CADK;AAEZ,eAAO,EAAE,KAFG;AAGZ,yBAAiB,EAAE,UAAU,CAAC;AAHlB,OAPC,CAAf;;AAaA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC,8BADN;AAEJ,WAAG,EAAE,UAAQ;AAFT,SAGA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAHA,CAAN,EAKG,QAAQ,IACP,sDACM,aADN,EAEM,SAFN,EAEe;AACb,iBAAS,EAAE,wBAAW,mCAAX,EAAgD,oBAAE,GAAF,CAAM,QAAN,EAAgB,WAAhB,CAAhD;AADE,OAFf,EANJ,EAYG,IAAI,IACH,aAAa,CAAC,cAAd,CACE,IADF,EAEE,SAFF,EAGE,MAAG,oBAAE,UAAF,CAAa,aAAb,IAA8B,aAAa,CAAC,KAAK,CAAC,KAAP,EAAc,CAAd,CAA3C,GAA8D,KAAK,CAAC,KAAvE,KAA+E,IAAI,IAAI,EAAvF,CAHF,CAbJ,CADF;AAqBD,KApCa,CAAd;AAsCA,WAAO;AAAG,eAAS,EAAC;AAAb,OAA8C,KAA9C,CAAP;AACD,GAnDD;;AAqDA;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,gBAAZ;AAAA,QAAmB,kBAAnB;AAAA,QAA2B,kCAA3B;AAAA,QAA2C,wBAA3C;AAAA,QAAsD,cAAtD;;AAEN,QAAI,IAAJ,EAAU;AACR,aAAO,IAAP;AACD;;AAED,QAAM,eAAN;AAAA,QAAQ,gBAAR;AAAA,QAAe,oCAAf;;AACA,QAAI,UAAU,GAAG,KAAjB;;AAEA,QAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,gBAAU,GAAG,KAAK,IAAI,KAAK,CAAC,MAAN,GAAe,CAAxB,GAA4B,cAAc,CAAC,KAAK,KAAN,CAA1C,GAAyD,cAAc,CAAC,YAAD,CAApF;AACD;;AAED,QAAI,KAAK,IAAI,CAAT,IAAc,MAAM,IAAI,CAAxB,IAA6B,CAAC,UAA9B,IAA4C,CAAC,UAAU,CAAC,MAA5D,EAAoE;AAClE,aAAO,IAAP;AACD;;AAED,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE,wBAAW,yBAAX,EAAsC,SAAtC;AAAZ,KAAN,EACG,QAAQ,IAAI,KAAK,cAAL,EADf,EAEG,KAAK,WAAL,CAAiB,UAAjB,CAFH,EAGG,mBAAM,kBAAN,CAAyB,KAAK,KAA9B,CAHH,CADF;AAOD,GAzBD;;AA/YO,8BAAc,eAAd;AAEA,+BAAe;AACpB,KAAC,EAAE,CADiB;AAEpB,KAAC,EAAE,CAFiB;AAGpB,SAAK,EAAE,CAHa;AAIpB,UAAM,EAAE,CAJY;AAKpB,WAAO,EAAE;AAAE,OAAC,EAAE,CAAL;AAAQ,OAAC,EAAE,CAAX;AAAc,WAAK,EAAE,CAArB;AAAwB,YAAM,EAAE;AAAhC,KALW;AAOpB,eAAW,EAAE,QAPO;AASpB,SAAK,EAAE,EATa;AAWpB,UAAM,EAAE,MAXY;AAYpB,YAAQ,EAAE,IAZU;AAapB,YAAQ,EAAE,IAbU;AAcpB,QAAI,EAAE,IAdc;AAepB,UAAM,EAAE,KAfY;AAiBpB,cAAU,EAAE,CAjBQ;AAmBpB,YAAQ,EAAE,CAnBU;AAoBpB,cAAU,EAAE,CApBQ;AAqBpB,YAAQ,EAAE;AArBU,GAAf;AAuaT;AAAC,CA1aD,CAA4B,iBAA5B;;AA4aA,qBAAe,aAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1dA;;AACA;;AACA;;AACA;;AAoCA;AAA4B;;AAA5B;;AA2PC;;AAzOQ,iCAAP,UAAsB,MAAtB,EAA4C,KAA5C,EAAsD;AACpD,QAAI,QAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,cAAQ,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAX;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,cAAQ,GAAG,MAAM,CAAC,KAAD,CAAjB;AACD,KAFM,MAEA;AACG;AAAA,UAAI,aAAJ;AAAA,UAAQ,aAAR;AAAA,UAAY,aAAZ;AAAA,UAAgB,eAAhB;AAAA,UAAqB,uDAArB;;AAER,cAAQ,GAAG,sDAAU,oBAAY,MAAZ,CAAV,EAA6B;AAAE,UAAE,EAAE,EAAN;AAAU,UAAE,EAAE,EAAd;AAAkB,UAAE,EAAE,EAAtB;AAA0B,UAAE,EAAE,EAA9B;AAAkC,YAAI,EAAC,MAAvC;AAA8C,WAAG,EAAE;AAAnD,OAA7B,EAAX;AACD;;AAED,WAAO,QAAP;AACD,GAdM;;AAqBP,uDAAiB,gBAAjB,EAA2C;AAA3C;;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,gBAAL;AAAA,QAAY,0BAAZ;;AAEN,QAAI,CAAC,gBAAD,IAAqB,CAAC,gBAAgB,CAAC,MAA3C,EAAmD;AACjD,aAAO,IAAP;AACD;;AAED,QAAM,KAAK,GAAG,gBAAgB,CAAC,GAAjB,CAAqB,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC1C,UAAM,KAAK,yBACN,KAAI,CAAC,KADC,GACI;AACb,UAAE,EAAE,CADS;AAEb,UAAE,EAAE,KAFS;AAGb,UAAE,EAAE,CAAC,GAAG,KAHK;AAIb,UAAE,EAAE,KAJS;AAKb,WAAG,EAAE,UAAQ,CALA;AAMb,aAAK,EAAE;AANM,OADJ,CAAX;;AAUA,aAAO,aAAa,CAAC,cAAd,CAA6B,UAA7B,EAAyC,KAAzC,CAAP;AACD,KAZa,CAAd;AAcA,WAAO;AAAG,eAAS,EAAC;AAAb,OAAmD,KAAnD,CAAP;AACD,GAtBD;;AA6BA,qDAAe,cAAf,EAAuC;AAAvC;;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,kBAAL;AAAA,QAAa,sBAAb;;AAEN,QAAI,CAAC,cAAD,IAAmB,CAAC,cAAc,CAAC,MAAvC,EAA+C;AAC7C,aAAO,IAAP;AACD;;AAED,QAAM,KAAK,GAAG,cAAc,CAAC,GAAf,CAAmB,UAAC,KAAD,EAAQ,CAAR,EAAS;AACxC,UAAM,KAAK,yBACN,KAAI,CAAC,KADC,GACI;AACb,UAAE,EAAE,KADS;AAEb,UAAE,EAAE,CAFS;AAGb,UAAE,EAAE,KAHS;AAIb,UAAE,EAAE,CAAC,GAAG,MAJK;AAKb,WAAG,EAAE,UAAQ,CALA;AAMb,aAAK,EAAE;AANM,OADJ,CAAX;;AAUA,aAAO,aAAa,CAAC,cAAd,CAA6B,QAA7B,EAAuC,KAAvC,CAAP;AACD,KAZa,CAAd;AAcA,WAAO;AAAG,eAAS,EAAC;AAAb,OAAiD,KAAjD,CAAP;AACD,GAtBD;;AA6BA,4DAAsB,cAAtB,EAA8C;AACpC;;AACR,QAAI,CAAC,YAAD,IAAiB,CAAC,YAAY,CAAC,MAAnC,EAA2C;AACzC,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,4BAAF;AAAA,QAAe,QAAf;AAAA,QAAkB,QAAlB;AAAA,QAAqB,gBAArB;AAAA,QAA4B,kBAA5B;AACN,QAAM,qBAAqB,GAAG,cAAc,CAAC,KAAf,GAAuB,IAAvB,CAA4B,UAAC,CAAD,EAAI,CAAJ,EAAK;AAAK,cAAC,GAAD;AAAK,KAA3C,CAA9B;;AAEA,QAAI,CAAC,KAAK,qBAAqB,CAAC,CAAD,CAA/B,EAAoC;AAClC,2BAAqB,CAAC,OAAtB,CAA8B,CAA9B;AACD;;AAED,QAAM,KAAK,GAAG,qBAAqB,CAAC,GAAtB,CAA0B,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC/C,UAAM,SAAS,GAAG,qBAAqB,CAAC,CAAC,GAAG,CAAL,CAArB,GAA+B,qBAAqB,CAAC,CAAC,GAAG,CAAL,CAArB,GAA+B,KAA9D,GAAsE,CAAC,GAAG,KAAJ,GAAY,KAApG;;AACA,UAAI,SAAS,IAAI,CAAjB,EAAoB;AAClB,eAAO,IAAP;AACD;;AACD,UAAM,UAAU,GAAG,CAAC,GAAG,YAAY,CAAC,MAApC;AACA,aACE;AACE,WAAG,EAAE,WAAS,CADhB;AAEE,SAAC,EAAE,IAAI,CAAC,KAAL,CAAW,KAAK,GAAG,CAAR,GAAY,CAAvB,CAFL;AAGE,SAAC,EAAE,CAHL;AAIE,aAAK,EAAE,SAJT;AAKE,cAAM,EAAE,MALV;AAME,cAAM,EAAC,MANT;AAOE,YAAI,EAAE,YAAY,CAAC,UAAD,CAPpB;AAQE,mBAAW,EAAE,WARf;AASE,iBAAS,EAAC;AATZ,QADF;AAaD,KAnBa,CAAd;AAqBA,WAAO;AAAG,eAAS,EAAC;AAAb,OAAwD,KAAxD,CAAP;AACD,GAnCD;;AA0CA,8DAAwB,gBAAxB,EAAkD;AACxC;;AACR,QAAI,CAAC,cAAD,IAAmB,CAAC,cAAc,CAAC,MAAvC,EAA+C;AAC7C,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,4BAAF;AAAA,QAAe,QAAf;AAAA,QAAkB,QAAlB;AAAA,QAAqB,gBAArB;AAAA,QAA4B,kBAA5B;AACN,QAAM,uBAAuB,GAAG,gBAAgB,CAAC,KAAjB,GAAyB,IAAzB,CAA8B,UAAC,CAAD,EAAI,CAAJ,EAAK;AAAK,cAAC,GAAD;AAAK,KAA7C,CAAhC;;AACA,QAAI,CAAC,KAAK,uBAAuB,CAAC,CAAD,CAAjC,EAAsC;AACpC,6BAAuB,CAAC,OAAxB,CAAgC,CAAhC;AACD;;AAED,QAAM,KAAK,GAAG,uBAAuB,CAAC,GAAxB,CAA4B,UAAC,KAAD,EAAQ,CAAR,EAAS;AACjD,UAAM,UAAU,GAAG,uBAAuB,CAAC,CAAC,GAAG,CAAL,CAAvB,GAAiC,uBAAuB,CAAC,CAAC,GAAG,CAAL,CAAvB,GAAiC,KAAlE,GAA0E,CAAC,GAAG,MAAJ,GAAa,KAA1G;;AACA,UAAI,UAAU,IAAI,CAAlB,EAAqB;AACnB,eAAO,IAAP;AACD;;AACD,UAAM,UAAU,GAAG,CAAC,GAAG,cAAc,CAAC,MAAtC;AACA,aACE;AACE,WAAG,EAAE,WAAS,CADhB;AAEE,SAAC,EAAE,IAAI,CAAC,KAAL,CAAW,KAAK,GAAG,CAAR,GAAY,CAAvB,CAFL;AAGE,SAAC,EAAE,CAHL;AAIE,cAAM,EAAE,UAJV;AAKE,aAAK,EAAE,KALT;AAME,cAAM,EAAC,MANT;AAOE,YAAI,EAAE,cAAc,CAAC,UAAD,CAPtB;AAQE,mBAAW,EAAE,WARf;AASE,iBAAS,EAAC;AATZ,QADF;AAaD,KAnBa,CAAd;AAqBA,WAAO;AAAG,eAAS,EAAC;AAAb,OAA0D,KAA1D,CAAP;AACD,GAlCD;;AAoCA;AACU;;AAER,QAAI,CAAC,IAAD,IAAS,IAAI,KAAK,MAAtB,EAA8B;AAC5B,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,4BAAF;AAAA,QAAe,QAAf;AAAA,QAAkB,QAAlB;AAAA,QAAqB,gBAArB;AAAA,QAA4B,kBAA5B;AAEN,WACE;AACE,OAAC,EAAE,CADL;AAEE,OAAC,EAAE,CAFL;AAGE,WAAK,EAAE,KAHT;AAIE,YAAM,EAAE,MAJV;AAKE,YAAM,EAAC,MALT;AAME,UAAI,EAAE,IANR;AAOE,iBAAW,EAAE,WAPf;AAQE,eAAS,EAAC;AARZ,MADF;AAYD,GArBD;;AAuBA;AACQ;AAAA,QACJ,QADI;AAAA,QAEJ,QAFI;AAAA,QAGJ,gBAHI;AAAA,QAIJ,kBAJI;AAAA,QAKJ,0BALI;AAAA,QAMJ,sBANI;AAAA,QAOJ,kEAPI;AAAA,QAQJ,8DARI;AAAA,QASJ,gBATI;AAAA,QAUJ,gBAVI;AAAA,QAWJ,kBAXI;AAAA,QAYJ,0BAZI;AAAA,QAaJ,4BAbI;;AAgBN,QACE,CAAC,qBAAS,KAAT,CAAD,IACA,KAAK,IAAI,CADT,IAEA,CAAC,qBAAS,MAAT,CAFD,IAGA,MAAM,IAAI,CAHV,IAIA,CAAC,qBAAS,CAAT,CAJD,IAKA,CAAC,KAAK,CAAC,CALP,IAMA,CAAC,qBAAS,CAAT,CAND,IAOA,CAAC,KAAK,CAAC,CART,EASE;AACA,aAAO,IAAP;AACD;;AAEG;AAAA,QAAE,sCAAF;AAAA,QAAoB,kCAApB;;AAGJ,QAAI,CAAC,CAAC,gBAAD,IAAqB,CAAC,gBAAgB,CAAC,MAAxC,KAAmD,oBAAE,UAAF,CAAa,8BAAb,CAAvD,EAAqG;AACnG,sBAAgB,GAAG,8BAA8B,CAAC;AAAE,aAAK,OAAP;AAAS,aAAK,EAAE,UAAhB;AAA4B,cAAM,EAAE,WAApC;AAAiD,cAAM;AAAvD,OAAD,CAAjD;AACD;;AAGD,QAAI,CAAC,CAAC,cAAD,IAAmB,CAAC,cAAc,CAAC,MAApC,KAA+C,oBAAE,UAAF,CAAa,4BAAb,CAAnD,EAA+F;AAC7F,oBAAc,GAAG,4BAA4B,CAAC;AAAE,aAAK,OAAP;AAAS,aAAK,EAAE,UAAhB;AAA4B,cAAM,EAAE,WAApC;AAAiD,cAAM;AAAvD,OAAD,CAA7C;AACD;;AAED,WACE;AAAG,eAAS,EAAC;AAAb,OACG,KAAK,gBAAL,EADH,EAEG,UAAU,IAAI,KAAK,gBAAL,CAAsB,gBAAtB,CAFjB,EAGG,QAAQ,IAAI,KAAK,cAAL,CAAoB,cAApB,CAHf,EAKG,UAAU,IAAI,KAAK,uBAAL,CAA6B,gBAA7B,CALjB,EAMG,QAAQ,IAAI,KAAK,qBAAL,CAA2B,cAA3B,CANf,CADF;AAUD,GApDD;;AArMO,8BAAc,eAAd;AAEA,+BAAe;AACpB,cAAU,EAAE,IADQ;AAEpB,YAAQ,EAAE,IAFU;AAIpB,oBAAgB,EAAE,EAJE;AAMpB,kBAAc,EAAE,EANI;AAQpB,UAAM,EAAE,MARY;AASpB,QAAI,EAAE,MATc;AAWpB,gBAAY,EAAE,EAXM;AAYpB,kBAAc,EAAE;AAZI,GAAf;AAwPT;AAAC,CA3PD,CAA4B,qBAA5B;;AA6PA,qBAAe,aAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpSA;;AACA;;AAGA;;AAgCA,SAAS,QAAT,CAAkB,KAAlB,EAA8B;AACpB;AAAA,MAAQ,qBAAR;AAAA,MAAgB,mBAAhB;AAAA,MAAuB,uBAAvB;AAAA,MAAgC,iBAAhC;AAAA,MAAsC,6CAAtC;AAAA,MAA0D,mBAA1D;AAAA,MAAiE,mBAAjE;AAAA,MAAwE,gHAAxE;;AACR,MAAM,QAAQ,GAAG,oBAAY,MAAZ,CAAjB;AACA,MAAM,SAAS,GAAG,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC5B;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,sBAAf;;AAEN,QAAI,CAAC,QAAL,EAAe;AACb,aAAO,IAAP;AACD;;AAED,QAAM,eAAe,GAAG,EAAxB;AACA,QAAI,QAAJ,EAAc,SAAd;;AAEA,QAAI,KAAK,CAAC,OAAN,CAAc,QAAd,CAAJ,EAA6B;AAC1B,8BAAU,uBAAV;AACF,KAFD,MAEO;AACL,cAAQ,GAAG,SAAS,GAAG,QAAvB;AACD;;AAED,QAAI,MAAM,KAAK,UAAf,EAA2B;AAEjB;AAER,UAAM,IAAI,GAAG,CAAC,GAAG,MAAjB;AACA,UAAM,IAAI,GAAG,IAAI,GAAG,KAApB;AACA,UAAM,IAAI,GAAG,IAAI,GAAG,KAApB;AAEA,UAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,QAAT,CAAlB;AACA,UAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,SAAT,CAAlB;AAGA,qBAAe,CAAC,IAAhB,CAAqB;AAAE,UAAE,EAAE,IAAN;AAAY,UAAE,EAAE,IAAhB;AAAsB,UAAE,EAAE,IAA1B;AAAgC,UAAE,EAAE;AAApC,OAArB;AAEA,qBAAe,CAAC,IAAhB,CAAqB;AAAE,UAAE,EAAE,IAAN;AAAY,UAAE,EAAE,IAAhB;AAAsB,UAAE,EAAE,IAA1B;AAAgC,UAAE,EAAE;AAApC,OAArB;AAEA,qBAAe,CAAC,IAAhB,CAAqB;AAAE,UAAE,EAAE,IAAN;AAAY,UAAE,EAAE,IAAhB;AAAsB,UAAE,EAAE,IAA1B;AAAgC,UAAE,EAAE;AAApC,OAArB;AACD,KAjBD,MAiBO,IAAI,MAAM,KAAK,YAAf,EAA6B;AAE1B;AAER,UAAM,IAAI,GAAG,CAAC,GAAG,MAAjB;AACA,UAAM,IAAI,GAAG,IAAI,GAAG,KAApB;AACA,UAAM,IAAI,GAAG,IAAI,GAAG,KAApB;AAEA,UAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,QAAT,CAAlB;AACA,UAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,SAAT,CAAlB;AAGA,qBAAe,CAAC,IAAhB,CAAqB;AAAE,UAAE,EAAE,IAAN;AAAY,UAAE,EAAE,IAAhB;AAAsB,UAAE,EAAE,IAA1B;AAAgC,UAAE,EAAE;AAApC,OAArB;AAEA,qBAAe,CAAC,IAAhB,CAAqB;AAAE,UAAE,EAAE,IAAN;AAAY,UAAE,EAAE,IAAhB;AAAsB,UAAE,EAAE,IAA1B;AAAgC,UAAE,EAAE;AAApC,OAArB;AAEA,qBAAe,CAAC,IAAhB,CAAqB;AAAE,UAAE,EAAE,IAAN;AAAY,UAAE,EAAE,IAAhB;AAAsB,UAAE,EAAE,IAA1B;AAAgC,UAAE,EAAE;AAApC,OAArB;AACD;;AAED,WAEE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC,mBAAX;AAA+B,SAAG,EAAE,SAAO;AAA3C,OAAoD,QAApD,CAAN,EACG,eAAe,CAAC,GAAhB,CAAoB,UAAC,WAAD,EAAc,KAAd,EAAmB;AAAK,aAC3C,sDAAU,WAAV,EAAqB;AAAE,WAAG,EAAE,UADe;AACtB,OAArB,EAD2C;AAE5C,KAFA,CADH,CAFF;AAQD,GA5DiB,CAAlB;AA8DA,SAAO,iCAAC,kBAAD,EAAM;AAAC,aAAS,EAAC;AAAX,GAAN,EAAuC,SAAvC,CAAP;AACD;;AAED,QAAQ,CAAC,YAAT,GAAwB;AACtB,QAAM,EAAE,OADc;AAEtB,aAAW,EAAE,GAFS;AAGtB,OAAK,EAAE,CAHe;AAItB,QAAM,EAAE,CAJc;AAKtB,QAAM,EAAE;AALc,CAAxB;AAOA,QAAQ,CAAC,WAAT,GAAuB,UAAvB;AAEA,qBAAe,QAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACjHA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAGA;;AAkEA;AAAmB;;AAAnB;AAAA;;AA8EE,kBAAe;AACb,yBAAmB,EAAE,IADR;AAEb,iBAAW,EAAE;AAFA,KAAf;;AAkCA,+BAAqB,UAAC,MAAD,EAAiB,WAAjB,EAAsC,KAAtC,EAAqD;AACxE,UAAM,UAAU,GAAG,KAAK,CAAC,MAAN,CAAa,UAAC,GAAD,EAAM,IAAN,EAAU;AAAK,kBAAG,GAAH;AAAU,OAAtC,CAAnB;AAEA,UAAM,KAAK,GAAG,IAAI,CAAC,KAAL,CAAW,MAAM,GAAG,UAApB,CAAd;AACA,UAAM,YAAY,GAAG,MAAM,GAAG,UAA9B;AACA,UAAM,UAAU,GAAG,WAAW,GAAG,MAAjC;AAEA,UAAI,WAAW,GAAG,EAAlB;;AACA,WAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,CAAtB,GAA2B,GAAG,IAAI,KAAK,CAAC,CAAD,CAAZ,EAAiB,EAAE,CAA9C,EAAiD;AAC/C,YAAI,GAAG,GAAG,KAAK,CAAC,CAAD,CAAX,GAAiB,YAArB,EAAmC;AACjC,qBAAW,kBAAO,KAAK,CAAC,KAAN,CAAY,CAAZ,EAAe,CAAf,CAAP,EAAwB,CAAE,YAAY,GAAG,GAAjB,CAAxB,CAAX;AACA;AACD;AACF;;AAED,UAAM,UAAU,GAAG,WAAW,CAAC,MAAZ,GAAqB,CAArB,KAA2B,CAA3B,GAA+B,CAAC,CAAD,EAAI,UAAJ,CAA/B,GAAiD,CAAC,UAAD,CAApE;AAEA,aAAO,eAAI,IAAI,CAAC,MAAL,CAAY,KAAZ,EAAmB,KAAnB,CAAJ,EAAkC,WAAlC,EAAkD,UAAlD,EAA8D,GAA9D,CAAkE,gBAAI;AAAI,eAAG,IAAI,GAAP;AAAW,OAArF,EAAuF,IAAvF,CAA4F,IAA5F,CAAP;AACD,KAlBD;;AAoBA,eAAK,qBAAS,gBAAT,CAAL;;AAEA,0BAAgB,UAAC,MAAD,EAAwB;AACtC,WAAI,CAAC,QAAL,CAAc;AAAE,kBAAU,EAAE;AAAd,OAAd;AACD,KAFD;;AAIA,oBAAU,UAAC,IAAD,EAAqB;AAC7B,WAAI,CAAC,SAAL,GAAiB,IAAjB;AACD,KAFD;;AAeA,+BAAqB;AACnB,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,KAAI,CAAC,KAAL,CAAW,cAAf,EAA+B;AAC7B,aAAI,CAAC,KAAL,CAAW,cAAX;AACD;AACF,KAND;;AAQA,iCAAuB;AACrB,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,KAAI,CAAC,KAAL,CAAW,gBAAf,EAAiC;AAC/B,aAAI,CAAC,KAAL,CAAW,gBAAX;AACD;AACF,KAND;;;AAqOD;;AAlTC;AACE,QAAI,CAAC,KAAK,KAAL,CAAW,iBAAhB,EAAmC;AACjC;AACD;;AAED,QAAM,WAAW,GAAG,KAAK,cAAL,EAApB;AACA,SAAK,QAAL,CAAc;AAAE,iBAAW;AAAb,KAAd;AACD,GAPD;;AAUA,8DAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,kBAAf;;AAEN,QAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AACzC,WAAK,aAAL,CAAmB,MAAnB;AACD;AACF,GAND;;AAQA;AACE,QAAM,QAAQ,GAAG,KAAK,SAAtB;;AAEA,QAAI;AACF,aAAQ,QAAQ,IAAI,QAAQ,CAAC,cAArB,IAAuC,QAAQ,CAAC,cAAT,EAAxC,IAAsE,CAA7E;AACD,KAFD,CAEE,OAAO,GAAP,EAAY;AACZ,aAAO,CAAP;AACD;AACF,GARD;;AAwCO,gBAAP,UAAc,KAAd,EAA+B,KAA/B,EAA4C;AAC1C,QAAM,SAAS,GAAG,KAAK,CAAC,MAAN,GAAe,CAAf,KAAqB,CAArB,GAAwB,eAAK,KAAL,EAAU,CAAE,CAAF,CAAV,CAAxB,GAAyC,KAA3D;AACA,QAAI,MAAM,GAAa,EAAvB;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAApB,EAA2B,EAAE,CAA7B,EAAgC;AAC9B,YAAM,kBAAO,MAAP,EAAkB,SAAlB,CAAN;AACD;;AAED,WAAO,MAAP;AACD,GATM;;AA2BP;AACE,QAAI,KAAK,KAAL,CAAW,iBAAX,IAAgC,CAAC,KAAK,KAAL,CAAW,mBAAhD,EAAqE;AACnE,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,kBAAF;AAAA,QAAU,gBAAV;AAAA,QAAiB,gBAAjB;AAAA,QAAwB,kBAAxB;AAAA,QAAgC,sBAAhC;AACN,QAAM,aAAa,GAAG,2BAAc,QAAd,EAAwB,sBAAS,WAAjC,CAAtB;;AAEA,QAAI,CAAC,aAAL,EAAoB;AAClB,aAAO,IAAP;AACD;;AAED,aAAS,kBAAT,CAA4B,SAA5B,EAAsD,OAAtD,EAA+E;AAC7E,aAAO;AACL,SAAC,EAAE,SAAS,CAAC,CADR;AAEL,SAAC,EAAE,SAAS,CAAC,CAFR;AAGL,aAAK,EAAE,SAAS,CAAC,KAHZ;AAIL,gBAAQ,EAAE,+BAAkB,SAAS,CAAC,OAA5B,EAAqC,OAArC;AAJL,OAAP;AAMD;;AAED,WAAO,aAAa,CAAC,GAAd,CAAkB,UAAC,IAAD,EAAoC,CAApC,EAA6C;AACpE,gCAAM,YAAN,CAAmB,IAAnB,EAAyB;AACvB,WAAG,EAAE,SAAO,CADW;AAEvB,YAAI,EAAE,MAFiB;AAGvB,aAAK,OAHkB;AAIvB,aAAK,OAJkB;AAKvB,cAAM,QALiB;AAMvB,0BAAkB;AANK,OAAzB;AAOE,KARG,CAAP;AAUD,GA/BD;;AAiCO,uBAAP,UAAqB,MAArB,EAAsC,KAAtC,EAAgD;AAC9C,QAAI,OAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAV;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,aAAO,GAAG,MAAM,CAAC,KAAD,CAAhB;AACD,KAFM,MAEA;AACL,UAAM,SAAS,GAAG,wBAAW,mBAAX,EAAgC,MAAM,GAAI,MAAmB,CAAC,SAAxB,GAAoC,EAA1E,CAAlB;AACA,aAAO,GAAG,iCAAC,gBAAD,EAAI,aAAK,KAAL,EAAU;AAAE,iBAAS,EAAE;AAAb,OAAV,CAAJ,CAAV;AACD;;AAED,WAAO,OAAP;AACD,GAbM;;AAeP,wCAAW,QAAX,EAA8B,UAA9B,EAAgD;AACtC;;AAER,QAAI,iBAAiB,IAAI,CAAC,KAAK,KAAL,CAAW,mBAArC,EAA0D;AACxD,aAAO,IAAP;AACD;;AACK;AAAA,QAAE,YAAF;AAAA,QAAO,kBAAP;AAAA,QAAe,oBAAf;AACN,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AACA,QAAM,cAAc,GAAG,oBAAY,GAAZ,EAAiB,IAAjB,CAAvB;AACA,QAAM,IAAI,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC/B,UAAM,QAAQ;AACZ,WAAG,EAAE,SAAO,CADA;AAEZ,SAAC,EAAE;AAFS,SAGT,SAHS,GAIT,cAJS,GAIK;AACjB,aAAK,EAAE,KAAK,CAAC,KADI;AAEjB,eAAO,SAFU;AAGjB,UAAE,EAAE,KAAK,CAAC,CAHO;AAIjB,UAAE,EAAE,KAAK,CAAC,CAJO;AAKjB,aAAK,EAAE,CALU;AAMjB,eAAO,EAAE,KAAK,CAAC;AANE,OAJL,CAAd;;AAaA,aAAO,IAAI,CAAC,aAAL,CAAmB,GAAnB,EAAwB,QAAxB,CAAP;AACD,KAfY,CAAb;AAgBA,QAAM,SAAS,GAAG;AAChB,cAAQ,EAAE,QAAQ,GAAG,mBAAiB,UAAjB,GAA2B,GAA9B,GAAoC;AADtC,KAAlB;AAIA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC,oBAAX;AAAgC,SAAG,EAAC;AAApC,OAA+C,SAA/C,CAAN,EACG,IADH,CADF;AAKD,GAlCD;;AAoCA,mDACE,MADF,EAEE,QAFF,EAGE,UAHF,EAIE,KAJF,EAIqC;AAGnC,QAAM,eAAN;AAAA,QAAQ,cAAR;AAAA,QAAc,kBAAd;AAAA,QAAsB,8BAAtB;AAAA,QAAoC,YAApC;AAAA,QAAyC,8DAAzC;;AACA,QAAM,UAAU,2CACX,oBAAY,MAAZ,EAAoB,IAApB,CADW,GACc;AAC5B,UAAI,EAAE,MADsB;AAE5B,eAAS,EAAE,qBAFiB;AAG5B,cAAQ,EAAE,QAAQ,GAAG,mBAAiB,UAAjB,GAA2B,GAA9B,GAAoC,IAH1B;AAI5B,YAAM;AAJsB,KADd,GAMX,KANW,GAMN;AACR,UAAI,MADI;AAER,YAAM,QAFE;AAGR,kBAAY;AAHJ,KANM,CAAhB;;AAYA,WAAO,iCAAC,kBAAD,EAAM,aAAK,UAAL,EAAe;AAAE,aAAO,EAAE,KAAK;AAAhB,KAAf,CAAN,CAAP;AACD,GArBD;;AAuBA,sDAAyB,QAAzB,EAA4C,UAA5C,EAA8D;AAA9D;;AACQ;AAAA,QACJ,kBADI;AAAA,QAEJ,oCAFI;AAAA,QAGJ,wCAHI;AAAA,QAIJ,kCAJI;AAAA,QAKJ,wCALI;AAAA,QAMJ,oCANI;AAAA,QAOJ,4BAPI;AAAA,QAQJ,sCARI;AAAA,QASJ,gBATI;AAAA,QAUJ,kBAVI;AAYA;AAAA,QAAE,0BAAF;AAAA,QAAc,4BAAd;AAEN,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,UAAQ,WAPP;AAQN,oBAAc,EAAE,KAAK,kBARf;AASN,sBAAgB,EAAE,KAAK;AATjB,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;;AACF,UAAI,UAAJ,EAAgB;AACd,YAAM,sBAAoB,GAAG,UAAU,CAAC,MAAX,GAAoB,MAAM,CAAC,MAAxD;AACA,YAAM,QAAQ,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,KAAR,EAAa;AACvC,cAAM,cAAc,GAAG,IAAI,CAAC,KAAL,CAAW,KAAK,GAAG,sBAAnB,CAAvB;;AACA,cAAI,UAAU,CAAC,cAAD,CAAd,EAAgC;AAC9B,gBAAM,IAAI,GAAG,UAAU,CAAC,cAAD,CAAvB;AACA,gBAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,gBAAM,aAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AAEA,yCAAY,KAAZ,GAAiB;AAAE,eAAC,EAAE,aAAa,CAAC,CAAD,CAAlB;AAAuB,eAAC,EAAE,aAAa,CAAC,CAAD;AAAvC,aAAjB;AACD;;AAGD,cAAI,gBAAJ,EAAsB;AACpB,gBAAM,aAAa,GAAG,8BAAkB,KAAK,GAAG,CAA1B,EAA6B,KAAK,CAAC,CAAnC,CAAtB;AACA,gBAAM,aAAa,GAAG,8BAAkB,MAAM,GAAG,CAA3B,EAA8B,KAAK,CAAC,CAApC,CAAtB;AACA,yCAAY,KAAZ,GAAiB;AAAE,eAAC,EAAE,aAAa,CAAC,CAAD,CAAlB;AAAuB,eAAC,EAAE,aAAa,CAAC,CAAD;AAAvC,aAAjB;AACD;;AACD,uCAAY,KAAZ,GAAiB;AAAE,aAAC,EAAE,KAAK,CAAC,CAAX;AAAc,aAAC,EAAE,KAAK,CAAC;AAAvB,WAAjB;AACD,SAjBgB,CAAjB;AAkBA,eAAO,KAAI,CAAC,qBAAL,CAA2B,QAA3B,EAAqC,QAArC,EAA+C,UAA/C,CAAP;AACD;;AACD,UAAM,YAAY,GAAG,8BAAkB,CAAlB,EAAqB,WAArB,CAArB;AACA,UAAM,SAAS,GAAG,YAAY,CAAC,CAAD,CAA9B;AACA,UAAI,sBAAJ;;AAEA,UAAI,eAAJ,EAAqB;AACnB,YAAM,KAAK,GAAG,MAAG,eAAH,EAAqB,KAArB,CAA2B,WAA3B,EAAwC,GAAxC,CAA4C,eAAG;AAAI,2BAAU,CAAV,GAAU,CAAV;AAAe,SAAlE,CAAd;AACA,8BAAsB,GAAG,KAAI,CAAC,kBAAL,CAAwB,SAAxB,EAAmC,WAAnC,EAAgD,KAAhD,CAAzB;AACD,OAHD,MAGO;AACL,8BAAsB,GAAM,SAAS,QAAT,IAAe,WAAW,GAAG,SAA7B,IAAsC,IAAlE;AACD;;AAED,aAAO,KAAI,CAAC,qBAAL,CAA2B,MAA3B,EAAmC,QAAnC,EAA6C,UAA7C,EAAyD;AAC9D,uBAAe,EAAE;AAD6C,OAAzD,CAAP;AAGD,KAhDH,CADF;AAoDD,GAnED;;AAqEA,yCAAY,QAAZ,EAA+B,UAA/B,EAAiD;AACzC;AAAA,QAAE,kBAAF;AAAA,QAAU,wCAAV;AACA;AAAA,QAAE,0BAAF;AAAA,QAAc,4BAAd;;AAEN,QACE,iBAAiB,IACjB,MADA,IAEA,MAAM,CAAC,MAFP,KAGE,CAAC,UAAD,IAAe,WAAW,GAAG,CAA9B,IAAoC,CAAC,oBAAE,OAAF,CAAU,UAAV,EAAsB,MAAtB,CAHtC,CADF,EAKE;AACA,aAAO,KAAK,wBAAL,CAA8B,QAA9B,EAAwC,UAAxC,CAAP;AACD;;AAED,WAAO,KAAK,qBAAL,CAA2B,MAA3B,EAAmC,QAAnC,EAA6C,UAA7C,CAAP;AACD,GAdD;;AAgBA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,YAAR;AAAA,QAAa,kBAAb;AAAA,QAAqB,wBAArB;AAAA,QAAgC,gBAAhC;AAAA,QAAuC,gBAAvC;AAAA,QAA8C,YAA9C;AAAA,QAAmD,cAAnD;AAAA,QAAyD,gBAAzD;AAAA,QAAgE,kBAAhE;AAAA,QAAwE,wCAAxE;AAAA,QAA2F,UAA3F;;AAEN,QAAI,IAAI,IAAI,CAAC,MAAT,IAAmB,CAAC,MAAM,CAAC,MAA/B,EAAuC;AACrC,aAAO,IAAP;AACD;;AAEO;AACR,QAAM,cAAc,GAAG,MAAM,CAAC,MAAP,KAAkB,CAAzC;AACA,QAAM,UAAU,GAAG,wBAAW,eAAX,EAA4B,SAA5B,CAAnB;AACA,QAAM,QAAQ,GAAI,KAAK,IAAI,KAAK,CAAC,iBAAhB,IAAuC,KAAK,IAAI,KAAK,CAAC,iBAAvE;AACA,QAAM,UAAU,GAAG,oBAAE,KAAF,CAAQ,EAAR,IAAc,KAAK,EAAnB,GAAwB,EAA3C;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,QAAQ,GACP,+CACE;AAAU,QAAE,EAAE,cAAY;AAA1B,OACE;AAAM,OAAC,EAAE,IAAT;AAAe,OAAC,EAAE,GAAlB;AAAuB,WAAK,EAAE,KAA9B;AAAqC,YAAM,EAAE;AAA7C,MADF,CADF,CADO,GAML,IAPN,EAQG,CAAC,cAAD,IAAmB,KAAK,WAAL,CAAiB,QAAjB,EAA2B,UAA3B,CARtB,EASG,KAAK,cAAL,EATH,EAUG,CAAC,cAAc,IAAI,GAAnB,KAA2B,KAAK,UAAL,CAAgB,QAAhB,EAA0B,UAA1B,CAV9B,EAWG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KAA+C,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,MAAzC,CAXlD,CADF;AAeD,GA5BD;;AAxWO,qBAAc,MAAd;AAEA,sBAAe;AACpB,WAAO,EAAE,CADW;AAEpB,WAAO,EAAE,CAFW;AAGpB,gBAAY,EAAE,KAHM;AAIpB,aAAS,EAAE,IAJS;AAKpB,OAAG,EAAE,IALe;AAMpB,cAAU,EAAE,MANQ;AAOpB,UAAM,EAAE,SAPY;AAQpB,eAAW,EAAE,CARO;AASpB,QAAI,EAAE,MATc;AAUpB,UAAM,EAAE,EAVY;AAWpB,qBAAiB,EAAE,CAAC,oBAAO,KAXP;AAYpB,oBAAgB,EAAE,IAZE;AAapB,kBAAc,EAAE,CAbI;AAcpB,qBAAiB,EAAE,IAdC;AAepB,mBAAe,EAAE,MAfG;AAgBpB,QAAI,EAAE;AAhBc,GAAf;;AA2BA,yBAAkB,UAAC,EAAD,EAoBxB;QAnBC,gB;QACA,gB;QACA,gB;QACA,0B;QACA,0B;QACA,oB;QACA,sB;QACA,gC;QACA,kB;AAYQ;AAER,QAAM,MAAM,GAAG,aAAa,CAAC,GAAd,CAAkB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAC5C,UAAM,KAAK,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,CAAd;;AAEA,UAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,eAAO;AACL,WAAC,EAAE,qCAAwB;AAAE,gBAAI,EAAE,KAAR;AAAe,iBAAK,EAAE,UAAtB;AAAkC,oBAAQ,UAA1C;AAA4C,iBAAK,OAAjD;AAAmD,iBAAK;AAAxD,WAAxB,CADE;AAEL,WAAC,EAAE,oBAAE,KAAF,CAAQ,KAAR,IAAiB,IAAjB,GAAwB,KAAK,CAAC,KAAN,CAAY,KAAZ,CAFtB;AAGL,eAAK,OAHA;AAIL,iBAAO,EAAE;AAJJ,SAAP;AAMD;;AAED,aAAO;AACL,SAAC,EAAE,oBAAE,KAAF,CAAQ,KAAR,IAAiB,IAAjB,GAAwB,KAAK,CAAC,KAAN,CAAY,KAAZ,CADtB;AAEL,SAAC,EAAE,qCAAwB;AAAE,cAAI,EAAE,KAAR;AAAe,eAAK,EAAE,UAAtB;AAAkC,kBAAQ,UAA1C;AAA4C,eAAK,OAAjD;AAAmD,eAAK;AAAxD,SAAxB,CAFE;AAGL,aAAK,OAHA;AAIL,eAAO,EAAE;AAJJ,OAAP;AAMD,KAlBc,CAAf;AAoBA;AAAS,YAAM,QAAf;AAAiB,YAAM;AAAvB,OAA4B,MAA5B;AACD,GA5CM;;AAwWT;AAAC,CAtYD,CAAmB,qBAAnB;;AAwYA,qBAAe,IAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzdA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AA6BA,IAAM,OAAO,GAAG,SAAV,OAAU,CAAC,KAAD,EAAiB,KAAjB,EAAiC,KAAjC,EAAiD,KAAjD,EAAiE,KAAjE,EAA6E;AACnF;AAAA,MAAa,kBAAb;AAAA,MAA0B,kBAA1B;AAAA,MAAuC,kBAAvC;AAAA,MAAoD,mBAApD;AAAA,MAA2D,mBAA3D;AAER,MAAM,MAAM,GAAG,oCAAmB;AAAE,KAAC,EAAE,KAAK,CAAC,KAAX;AAAkB,KAAC,EAAE,KAAK,CAAC;AAA3B,GAAnB,CAAf;AAEA,MAAM,EAAE,GAAG;AACT,KAAC,EAAE,KAAK,GAAG,MAAM,CAAC,CAAP,CAAS,KAAT,CAAe,OAAf,EAAwB;AAAE,cAAQ,EAAE;AAAZ,KAAxB,CAAH,GAAoD,MAAM,CAAC,CAAP,CAAS,QAD5D;AAET,KAAC,EAAE,KAAK,GAAG,MAAM,CAAC,CAAP,CAAS,KAAT,CAAe,OAAf,EAAwB;AAAE,cAAQ,EAAE;AAAZ,KAAxB,CAAH,GAAoD,MAAM,CAAC,CAAP,CAAS;AAF5D,GAAX;AAKA,MAAM,EAAE,GAAG;AACT,KAAC,EAAE,KAAK,GAAG,MAAM,CAAC,CAAP,CAAS,KAAT,CAAe,OAAf,EAAwB;AAAE,cAAQ,EAAE;AAAZ,KAAxB,CAAH,GAAkD,MAAM,CAAC,CAAP,CAAS,QAD1D;AAET,KAAC,EAAE,KAAK,GAAG,MAAM,CAAC,CAAP,CAAS,KAAT,CAAe,OAAf,EAAwB;AAAE,cAAQ,EAAE;AAAZ,KAAxB,CAAH,GAAkD,MAAM,CAAC,CAAP,CAAS;AAF1D,GAAX;;AAKA,MAAI,sCAAkB,KAAlB,EAAyB,SAAzB,MAAwC,CAAC,MAAM,CAAC,SAAP,CAAiB,EAAjB,CAAD,IAAyB,CAAC,MAAM,CAAC,SAAP,CAAiB,EAAjB,CAAlE,CAAJ,EAA6F;AAC3F,WAAO,IAAP;AACD;;AAED,SAAO,gCAAe,EAAf,EAAmB,EAAnB,CAAP;AACD,CApBD;;AAsBA,SAAS,aAAT,CAAuB,KAAvB,EAAmC;AACzB;AAAA,MAAI,aAAJ;AAAA,MAAQ,aAAR;AAAA,MAAY,aAAZ;AAAA,MAAgB,2BAAhB;AAAA,MAA2B,6BAA3B;AAAA,MAAuC,6BAAvC;AAER,kBAAK,UAAU,KAAK,SAApB,EAA+B,kFAA/B;AAEA,MAAM,KAAK,GAAG,uBAAW,EAAX,CAAd;AACA,MAAM,KAAK,GAAG,uBAAW,EAAX,CAAd;AACA,MAAM,KAAK,GAAG,uBAAW,EAAX,CAAd;AACA,MAAM,KAAK,GAAG,uBAAW,EAAX,CAAd;AAEQ;;AAER,MAAI,CAAC,KAAD,IAAU,CAAC,KAAX,IAAoB,CAAC,KAArB,IAA8B,CAAC,KAA/B,IAAwC,CAAC,KAA7C,EAAoD;AAClD,WAAO,IAAP;AACD;;AAED,MAAM,IAAI,GAAG,OAAO,CAAC,KAAD,EAAQ,KAAR,EAAe,KAAf,EAAsB,KAAtB,EAA6B,KAA7B,CAApB;;AAEA,MAAI,CAAC,IAAD,IAAS,CAAC,KAAd,EAAqB;AACnB,WAAO,IAAP;AACD;;AAED,MAAM,QAAQ,GAAG,sCAAkB,KAAlB,EAAyB,QAAzB,IAAqC,UAAQ,UAAR,GAAkB,GAAvD,GAA6D,SAA9E;AAEA,SACE,iCAAC,kBAAD,EAAM;AAAC,aAAS,EAAE,wBAAW,yBAAX,EAAsC,SAAtC;AAAZ,GAAN,EACG,aAAa,CAAC,UAAd,CAAyB,KAAzB,EAA8B;AAAI,YAAQ;AAAZ,KAAiB,oBAAY,KAAZ,EAAmB,IAAnB,CAAjB,GAA8C,IAA9C,CAA9B,CADH,EAEG,mBAAM,kBAAN,CAAyB,KAAzB,EAAgC,IAAhC,CAFH,CADF;AAMD;;AAED,aAAa,CAAC,WAAd,GAA4B,eAA5B;AACA,aAAa,CAAC,YAAd,GAA6B;AAC3B,SAAO,EAAE,KADkB;AAE3B,YAAU,EAAE,SAFe;AAG3B,SAAO,EAAE,CAHkB;AAI3B,SAAO,EAAE,CAJkB;AAK3B,GAAC,EAAE,EALwB;AAM3B,MAAI,EAAE,MANqB;AAO3B,aAAW,EAAE,GAPc;AAQ3B,QAAM,EAAE,MARmB;AAS3B,aAAW,EAAE;AATc,CAA7B;;AAYA,aAAa,CAAC,UAAd,GAA2B,UAAC,MAAD,EAAsC,KAAtC,EAAgD;AACzE,MAAI,IAAJ;;AAEA,MAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,QAAI,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD,GAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,QAAI,GAAG,MAAM,CAAC,KAAD,CAAb;AACD,GAFM,MAEA;AACL,QAAI,GAAG,iCAAC,sBAAD,EAAU,aAAK,KAAL,EAAU;AAAE,eAAS,EAAC;AAAZ,KAAV,CAAV,CAAP;AACD;;AAED,SAAO,IAAP;AACD,CAZD;;AAcA,qBAAe,aAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxHA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AA2BA,IAAM,aAAa,GAAG,SAAhB,aAAgB,CAAC,KAAD,EAAa;AACzB;AAAA,MAAG,WAAH;AAAA,MAAM,mBAAN;AAAA,MAAa,mBAAb;AACR,MAAM,MAAM,GAAG,oCAAmB;AAAE,KAAC,EAAE,KAAK,CAAC,KAAX;AAAkB,KAAC,EAAE,KAAK,CAAC;AAA3B,GAAnB,CAAf;AAEA,MAAM,MAAM,GAAG,MAAM,CAAC,KAAP,CAAa;AAAE,KAAC,GAAH;AAAK,KAAC;AAAN,GAAb,EAAuB;AAAE,aAAS,EAAE;AAAb,GAAvB,CAAf;;AAEA,MAAI,sCAAkB,KAAlB,EAAyB,SAAzB,KAAuC,CAAC,MAAM,CAAC,SAAP,CAAiB,MAAjB,CAA5C,EAAsE;AACpE,WAAO,IAAP;AACD;;AAED,SAAO,MAAP;AACD,CAXD;;AAaA,SAAS,YAAT,CAAsB,KAAtB,EAAkC;AACxB;AAAA,MAAG,WAAH;AAAA,MAAM,WAAN;AAAA,MAAS,6BAAT;AAAA,MAAqB,6BAArB;AACR,MAAM,GAAG,GAAG,uBAAW,CAAX,CAAZ;AACA,MAAM,GAAG,GAAG,uBAAW,CAAX,CAAZ;AAEA,kBAAK,UAAU,KAAK,SAApB,EAA+B,kFAA/B;;AAEA,MAAI,CAAC,GAAD,IAAQ,CAAC,GAAb,EAAkB;AAChB,WAAO,IAAP;AACD;;AAED,MAAM,UAAU,GAAG,aAAa,CAAC,KAAD,CAAhC;;AAEA,MAAI,CAAC,UAAL,EAAiB;AACf,WAAO,IAAP;AACD;;AAEO;AAAA,MAAO,iBAAP;AAEA;AAAA,MAAO,2BAAP;AAER,MAAM,QAAQ,GAAG,sCAAkB,KAAlB,EAAyB,QAAzB,IAAqC,UAAQ,UAAR,GAAkB,GAAvD,GAA6D,SAA9E;;AAEA,MAAM,QAAQ;AACZ,YAAQ;AADI,KAET,oBAAY,KAAZ,EAAmB,IAAnB,CAFS,GAEe;AAC3B,MAAE,IADyB;AAE3B,MAAE;AAFyB,GAFf,CAAd;;AAOA,SACE,iCAAC,kBAAD,EAAM;AAAC,aAAS,EAAE,wBAAW,wBAAX,EAAqC,SAArC;AAAZ,GAAN,EACG,YAAY,CAAC,SAAb,CAAuB,KAAvB,EAA8B,QAA9B,CADH,EAEG,mBAAM,kBAAN,CAAyB,KAAzB,EAAgC;AAC/B,KAAC,EAAE,EAAE,GAAG,CADuB;AAE/B,KAAC,EAAE,EAAE,GAAG,CAFuB;AAG/B,SAAK,EAAE,IAAI,CAHoB;AAI/B,UAAM,EAAE,IAAI;AAJmB,GAAhC,CAFH,CADF;AAWD;;AAED,YAAY,CAAC,WAAb,GAA2B,cAA3B;AACA,YAAY,CAAC,YAAb,GAA4B;AAC1B,SAAO,EAAE,KADiB;AAE1B,YAAU,EAAE,SAFc;AAG1B,SAAO,EAAE,CAHiB;AAI1B,SAAO,EAAE,CAJiB;AAK1B,GAAC,EAAE,EALuB;AAM1B,MAAI,EAAE,MANoB;AAO1B,QAAM,EAAE,MAPkB;AAQ1B,aAAW,EAAE,CARa;AAS1B,aAAW,EAAE;AATa,CAA5B;;AAWA,YAAY,CAAC,SAAb,GAAyB,UAAC,MAAD,EAAyB,KAAzB,EAAmC;AAC1D,MAAI,GAAJ;;AAEA,MAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,OAAG,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAN;AACD,GAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,OAAG,GAAG,MAAM,CAAC,KAAD,CAAZ;AACD,GAFM,MAEA;AACL,OAAG,GAAG,iCAAC,gBAAD,EAAI,aAAK,KAAL,EAAU;AAAE,QAAE,EAAE,KAAK,CAAC,EAAZ;AAAgB,QAAE,EAAE,KAAK,CAAC,EAA1B;AAA8B,eAAS,EAAC;AAAxC,KAAV,CAAJ,CAAN;AACD;;AAED,SAAO,GAAP;AACD,CAZD;;AAcA,qBAAe,YAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvHA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAkCA,IAAM,UAAU,GAAG,SAAb,UAAa,CAAC,MAAD,EAAsC,KAAtC,EAAgD;AACjE,MAAI,IAAJ;;AAEA,MAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,QAAI,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD,GAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,QAAI,GAAG,MAAM,CAAC,KAAD,CAAb;AACD,GAFM,MAEA;AACL,QAAI,GAAG,sDAAU,KAAV,EAAe;AAAE,eAAS,EAAC;AAAZ,KAAf,EAAP;AACD;;AAED,SAAO,IAAP;AACD,CAZD;;AAeA,IAAM,YAAY,GAAG,SAAf,YAAe,CAAC,MAAD,EAAc,QAAd,EAAiC,QAAjC,EAAoD,SAApD,EAAwE,KAAxE,EAAoF;AAErG;AAAA,MAAW,QAAX;AAAA,MAAc,QAAd;AAAA,MAAiB,gBAAjB;AAAA,MAAwB,kBAAxB;AAAA,MACA,yBADA;;AAIF,MAAI,QAAJ,EAAc;AAEV;AAAA,QACS,uCADT;AAGF,QAAM,KAAK,GAAG,MAAM,CAAC,CAAP,CAAS,KAAT,CAAe,MAAf,EAAuB;AAAE,cAAQ;AAAV,KAAvB,CAAd;;AAEA,QAAI,sCAAkB,KAAlB,EAAyB,SAAzB,KAAuC,CAAC,MAAM,CAAC,CAAP,CAAS,SAAT,CAAmB,KAAnB,CAA5C,EAAuE;AACrE,aAAO,IAAP;AACD;;AAED,QAAM,MAAM,GAAG,CACb;AAAE,OAAC,EAAE,CAAC,GAAG,KAAT;AAAgB,OAAC,EAAE;AAAnB,KADa,EAEb;AAAE,OAAC,GAAH;AAAK,OAAC,EAAE;AAAR,KAFa,CAAf;AAIA,WAAO,aAAW,KAAK,MAAhB,GAAyB,MAAM,CAAC,OAAP,EAAzB,GAA4C,MAAnD;AACD;;AACD,MAAI,QAAJ,EAAc;AAEV;AAAA,QACS,uCADT;AAGF,QAAM,KAAK,GAAG,MAAM,CAAC,CAAP,CAAS,KAAT,CAAe,MAAf,EAAuB;AAAE,cAAQ;AAAV,KAAvB,CAAd;;AAEA,QAAI,sCAAkB,KAAlB,EAAyB,SAAzB,KAAuC,CAAC,MAAM,CAAC,CAAP,CAAS,SAAT,CAAmB,KAAnB,CAA5C,EAAuE;AACrE,aAAO,IAAP;AACD;;AAED,QAAM,MAAM,GAAG,CACb;AAAE,OAAC,EAAE,KAAL;AAAY,OAAC,EAAE,CAAC,GAAG;AAAnB,KADa,EAEb;AAAE,OAAC,EAAE,KAAL;AAAY,OAAC;AAAb,KAFa,CAAf;AAIA,WAAO,aAAW,KAAK,KAAhB,GAAwB,MAAM,CAAC,OAAP,EAAxB,GAA2C,MAAlD;AACD;;AACD,MAAI,SAAJ,EAAe;AACL;AAER,QAAM,MAAM,GAAG,OAAO,CAAC,GAAR,CAAY,aAAC;AAAI,mBAAM,CAAC,KAAP,CAAa,CAAb,EAAgB;AAAE,gBAAQ,EAA1B;AAAgB,OAAhB;AAA6B,KAA9C,CAAf;;AAEA,QAAI,sCAAkB,KAAlB,EAAyB,SAAzB,KAAuC,oBAAE,IAAF,CAAO,MAAP,EAAe,aAAC;AAAI,cAAC,MAAM,CAAC,SAAP,CAAD,CAAC,CAAD;AAAoB,KAAxC,CAA3C,EAAsF;AACpF,aAAO,IAAP;AACD;;AAED,WAAO,MAAP;AACD;;AAED,SAAO,IAAP;AACD,CArDD;;AAuDA,SAAS,aAAT,CAAuB,KAAvB,EAAmC;AACzB;AAAA,MAAW,gBAAX;AAAA,MAAsB,uBAAtB;AAAA,MAA+B,mBAA/B;AAAA,MAAsC,mBAAtC;AAAA,MAA6C,mBAA7C;AAAA,MAAoD,2BAApD;AAAA,MAA+D,6BAA/D;AAAA,MAA2E,6BAA3E;AAER,kBAAK,UAAU,KAAK,SAApB,EAA+B,kFAA/B;AAEA,MAAM,MAAM,GAAG,oCAAmB;AAAE,KAAC,EAAE,KAAK,CAAC,KAAX;AAAkB,KAAC,EAAE,KAAK,CAAC;AAA3B,GAAnB,CAAf;AAEA,MAAM,GAAG,GAAG,uBAAW,MAAX,CAAZ;AACA,MAAM,GAAG,GAAG,uBAAW,MAAX,CAAZ;AACA,MAAM,SAAS,GAAG,OAAO,IAAI,OAAO,CAAC,MAAR,KAAmB,CAAhD;AAEA,MAAM,SAAS,GAAG,YAAY,CAAC,MAAD,EAAS,GAAT,EAAc,GAAd,EAAmB,SAAnB,EAA8B,KAA9B,CAA9B;;AACA,MAAI,CAAC,SAAL,EAAgB;AACd,WAAO,IAAP;AACD;;AAEM;AAAA,MAAE,SAAF;AAAA,MAAS,SAAT;AAAA,MAAkB,iBAAlB;AAAA,MAAoB,SAApB;AAAA,MAA2B,SAA3B;AAEP,MAAM,QAAQ,GAAG,sCAAkB,KAAlB,EAAyB,QAAzB,IAAqC,UAAQ,UAAR,GAAkB,GAAvD,GAA6D,SAA9E;;AAEA,MAAM,SAAS;AACb,YAAQ;AADK,KAEV,oBAAY,KAAZ,EAAmB,IAAnB,CAFU,GAEc;AAC3B,MAAE,IADyB;AAE3B,MAAE,IAFyB;AAG3B,MAAE,IAHyB;AAI3B,MAAE;AAJyB,GAFd,CAAf;;AASA,SACE,iCAAC,kBAAD,EAAM;AAAC,aAAS,EAAE,wBAAW,yBAAX,EAAsC,SAAtC;AAAZ,GAAN,EACG,UAAU,CAAC,KAAD,EAAQ,SAAR,CADb,EAEG,mBAAM,kBAAN,CAAyB,KAAzB,EAAgC,gCAAe;AAAE,MAAE,IAAJ;AAAM,MAAE,IAAR;AAAU,MAAE,IAAZ;AAAc,MAAE;AAAhB,GAAf,CAAhC,CAFH,CADF;AAMD;;AAED,aAAa,CAAC,WAAd,GAA4B,eAA5B;AACA,aAAa,CAAC,YAAd,GAA6B;AAC3B,SAAO,EAAE,KADkB;AAE3B,YAAU,EAAE,SAFe;AAG3B,SAAO,EAAE,CAHkB;AAI3B,SAAO,EAAE,CAJkB;AAK3B,MAAI,EAAE,MALqB;AAM3B,QAAM,EAAE,MANmB;AAO3B,aAAW,EAAE,CAPc;AAQ3B,aAAW,EAAE,CARc;AAS3B,UAAQ,EAAE;AATiB,CAA7B;AAYA,qBAAe,aAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnKA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAyEA;AAAsB;;AAAtB;AAAA;;AAgJE,kBAAe;AAAE,yBAAmB,EAAE;AAAvB,KAAf;;AAWA,4BAAkB,UAAC,MAAD,EAA2B;AAC3C,WAAI,CAAC,QAAL,CAAc;AAAE,kBAAU,EAAE;AAAd,OAAd;AACD,KAFD;;AAIA,+BAAqB;AACnB,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;AACD,KAFD;;AAIA,iCAAuB;AACrB,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;AACD,KAFD;;AAIA,eAAK,qBAAS,mBAAT,CAAL;;AAwMD;;AA5NC,iEAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,kBAAf;;AAEN,QAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AACzC,WAAK,eAAL,CAAqB,MAArB;AACD;AACF,GAND;;AAsBO,6BAAP,UAAwB,MAAxB,EAAuE,KAAvE,EAAiF;AAC/E,QAAI,MAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,YAAM,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAT;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,YAAM,GAAG,MAAM,CAAC,KAAD,CAAf;AACD,KAFM,MAEA,IAAI,OAAO,MAAP,KAAkB,QAAtB,EAAgC;AACrC,YAAM,GAAG,iCAAC,oBAAD,EAAQ,aAAK,KAAL,EAAU;AAAE,YAAI,EAAE;AAAR,OAAV,CAAR,CAAT;AACD;;AAED,WAAO,MAAP;AACD,GAZM;;AAcP,wDAAwB,MAAxB,EAAkD;AAAlD;;AACQ;AAAA,QAAE,gBAAF;AAAA,QAAS,4BAAT;AAAA,QAAsB,4BAAtB;AACN,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AAEA,WAAO,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,CAAR,EAAS;AACzB,UAAM,KAAK;AAAK,WAAG,EAAE,YAAU;AAApB,SAA4B,SAA5B,GAA0C,KAA1C,CAAX;;AAEA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC;AADN,SAEA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAFA,EAEwC;AAC5C,WAAG,EAAE,YAAU;AAD6B,OAFxC,CAAN,EAKG,OAAO,CAAC,gBAAR,CAAyB,WAAW,KAAK,CAAhB,GAAoB,WAApB,GAAkC,KAA3D,EAAkE,KAAlE,CALH,CADF;AASD,KAZM,CAAP;AAaD,GAjBD;;AAmBA;AAAA;;AACQ;AAAA,QAAE,kBAAF;AAAA,QAAU,wCAAV;AAAA,QAA6B,kCAA7B;AAAA,QAA6C,wCAA7C;AAAA,QAAgE,oCAAhE;AAAA,QAAiF,4BAAjF;AACE;AAER,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,SAAO,WAPN;AAQN,oBAAc,EAAE,KAAK,kBARf;AASN,sBAAgB,EAAE,KAAK;AATjB,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;AACF,UAAM,QAAQ,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,KAAR,EAAa;AACvC,YAAM,IAAI,GAAG,UAAU,IAAI,UAAU,CAAC,KAAD,CAArC;;AAEA,YAAI,IAAJ,EAAU;AACR,cAAM,cAAc,GAAG,8BAAkB,IAAI,CAAC,EAAvB,EAA2B,KAAK,CAAC,EAAjC,CAAvB;AACA,cAAM,cAAc,GAAG,8BAAkB,IAAI,CAAC,EAAvB,EAA2B,KAAK,CAAC,EAAjC,CAAvB;AACA,cAAM,gBAAgB,GAAG,8BAAkB,IAAI,CAAC,IAAvB,EAA6B,KAAK,CAAC,IAAnC,CAAzB;AAEA,uCACK,KADL,GACU;AACR,cAAE,EAAE,cAAc,CAAC,CAAD,CADV;AAER,cAAE,EAAE,cAAc,CAAC,CAAD,CAFV;AAGR,gBAAI,EAAE,gBAAgB,CAAC,CAAD;AAHd,WADV;AAMD;;AAED,YAAM,YAAY,GAAG,8BAAkB,CAAlB,EAAqB,KAAK,CAAC,IAA3B,CAArB;AAEA,qCAAY,KAAZ,GAAiB;AAAE,cAAI,EAAE,YAAY,CAAC,CAAD;AAApB,SAAjB;AACD,OAnBgB,CAAjB;AAqBA,aAAO,iCAAC,kBAAD,EAAM,IAAN,EAAQ,KAAI,CAAC,uBAAL,CAA6B,QAA7B,CAAR,CAAP;AACD,KAlCH,CADF;AAsCD,GA1CD;;AA4CA;AACQ;AAAA,QAAE,kBAAF;AAAA,QAAU,wCAAV;AACE;;AAER,QAAI,iBAAiB,IAAI,MAArB,IAA+B,MAAM,CAAC,MAAtC,KAAiD,CAAC,UAAD,IAAe,CAAC,oBAAE,OAAF,CAAU,UAAV,EAAsB,MAAtB,CAAjE,CAAJ,EAAqG;AACnG,aAAO,KAAK,0BAAL,EAAP;AACD;;AAED,WAAO,KAAK,uBAAL,CAA6B,MAA7B,CAAP;AACD,GATD;;AAWA;AACU;;AACR,QAAI,iBAAiB,IAAI,CAAC,KAAK,KAAL,CAAW,mBAArC,EAA0D;AACxD,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,kBAAF;AAAA,QAAU,gBAAV;AAAA,QAAiB,gBAAjB;AAAA,QAAwB,sBAAxB;AACN,QAAM,aAAa,GAAG,2BAAc,QAAd,EAAwB,sBAAS,WAAjC,CAAtB;;AAEA,QAAI,CAAC,aAAL,EAAoB;AAClB,aAAO,IAAP;AACD;;AAED,aAAS,mBAAT,CAA6B,SAA7B,EAA0D,OAA1D,EAAmF;AACjF,aAAO;AACL,SAAC,EAAE,SAAS,CAAC,EADR;AAEL,SAAC,EAAE,SAAS,CAAC,EAFR;AAGL,aAAK,EAAE,CAAC,SAAS,CAAC,IAAV,CAAe,CAHlB;AAIL,gBAAQ,EAAE,+BAAkB,SAAlB,EAA6B,OAA7B;AAJL,OAAP;AAMD;;AAED,aAAS,mBAAT,CAA6B,SAA7B,EAA0D,OAA1D,EAAmF;AACjF,aAAO;AACL,SAAC,EAAE,SAAS,CAAC,EADR;AAEL,SAAC,EAAE,SAAS,CAAC,EAFR;AAGL,aAAK,EAAE,CAAC,SAAS,CAAC,IAAV,CAAe,CAHlB;AAIL,gBAAQ,EAAE,+BAAkB,SAAlB,EAA6B,OAA7B;AAJL,OAAP;AAMD;;AAED,WAAO,aAAa,CAAC,GAAd,CAAkB,UAAC,IAAD,EAAoC,CAApC,EAA6C;AAC5D;AAER,aAAO,mBAAM,YAAN,CAAmB,IAAnB,EAAyB;AAC9B,WAAG,EAAE,CADyB;AAE9B,YAAI,EAAE,MAFwB;AAG9B,aAAK,OAHyB;AAI9B,aAAK,OAJyB;AAK9B,cAAM,EAAE,SAAS,KAAK,GAAd,GAAoB,UAApB,GAAiC,YALX;AAM9B,0BAAkB,EAAE,SAAS,KAAK,GAAd,GAAoB,mBAApB,GAA0C;AANhC,OAAzB,CAAP;AAQD,KAXM,CAAP;AAYD,GA3CD;;AA6CA;AACQ;AAAA,QAAE,kBAAF;AAAA,QAAU,cAAV;AAAA,QAAgB,sBAAhB;AAAA,QAA0B,gCAA1B;AACN,QAAM,YAAY,GAAG,oBAAY,KAAK,KAAjB,CAArB;AACA,QAAM,eAAe,GAAG,oBAAY,IAAZ,CAAxB;AACA,QAAI,UAAJ,EAAgB,QAAhB;;AAEA,QAAI,QAAQ,KAAK,OAAjB,EAA0B;AACxB,gBAAU,GAAG,MAAM,CAAC,GAAP,CAAW,iBAAK;AAAI,eAAC;AAAE,WAAC,EAAE,KAAK,CAAC,EAAX;AAAe,WAAC,EAAE,KAAK,CAAxB;AAAC,SAAD;AAA8B,OAAlD,CAAb;AACD,KAFD,MAEO,IAAI,QAAQ,KAAK,SAAjB,EAA4B;AAC3B;AAAA,UAAE,cAAF;AAAA,UAAQ,cAAR;AAAA,UAAc,UAAd;AAAA,UAAiB,UAAjB;;AACN,UAAM,SAAS,GAAG,SAAZ,SAAY,CAAC,CAAD,EAAU;AAAK,kBAAC,GAAG,CAAJ;AAAS,OAA1C;;AACA,gBAAU,GAAG,CACX;AAAE,SAAC,EAAE,IAAL;AAAW,SAAC,EAAE,SAAS,CAAC,IAAD;AAAvB,OADW,EAEX;AAAE,SAAC,EAAE,IAAL;AAAW,SAAC,EAAE,SAAS,CAAC,IAAD;AAAvB,OAFW,CAAb;AAID;;AACD,QAAM,SAAS,2CACV,YADU,GACE;AACf,UAAI,EAAE,MADS;AAEf,YAAM,EAAE,YAAY,IAAI,YAAY,CAAC;AAFtB,KADF,GAIV,eAJU,GAIK;AAClB,YAAM,EAAE;AADU,KAJL,CAAf;;AAQA,QAAI,mBAAM,cAAN,CAAqB,IAArB,CAAJ,EAAgC;AAC9B,cAAQ,GAAG,mBAAM,YAAN,CAAmB,IAAnB,EAAgC,SAAhC,CAAX;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,IAAb,CAAJ,EAAwB;AAC7B,cAAQ,GAAG,IAAI,CAAC,SAAD,CAAf;AACD,KAFM,MAEA;AACL,cAAQ,GAAG,iCAAC,kBAAD,EAAM,aAAK,SAAL,EAAc;AAAE,YAAI,EAAE;AAAR,OAAd,CAAN,CAAX;AACD;;AAED,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC,uBAAX;AAAmC,SAAG,EAAC;AAAvC,KAAN,EACG,QADH,CADF;AAKD,GArCD;;AAuCA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,kBAAR;AAAA,QAAgB,cAAhB;AAAA,QAAsB,wBAAtB;AAAA,QAAiC,gBAAjC;AAAA,QAAwC,gBAAxC;AAAA,QAA+C,cAA/C;AAAA,QAAqD,YAArD;AAAA,QAA0D,gBAA1D;AAAA,QAAiE,kBAAjE;AAAA,QAAyE,UAAzE;AAAA,QAA6E,wCAA7E;;AACN,QAAI,IAAI,IAAI,CAAC,MAAT,IAAmB,CAAC,MAAM,CAAC,MAA/B,EAAuC;AACrC,aAAO,IAAP;AACD;;AACO;AACR,QAAM,UAAU,GAAG,wBAAW,kBAAX,EAA+B,SAA/B,CAAnB;AACA,QAAM,QAAQ,GAAI,KAAK,IAAI,KAAK,CAAC,iBAAhB,IAAuC,KAAK,IAAI,KAAK,CAAC,iBAAvE;AACA,QAAM,UAAU,GAAG,oBAAE,KAAF,CAAQ,EAAR,IAAc,KAAK,EAAnB,GAAwB,EAA3C;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE,UAAZ;AAAwB,cAAQ,EAAE,QAAQ,GAAG,mBAAiB,UAAjB,GAA2B,GAA9B,GAAoC;AAA9E,KAAN,EACG,QAAQ,GACP,+CACE;AAAU,QAAE,EAAE,cAAY;AAA1B,OACE;AAAM,OAAC,EAAE,IAAT;AAAe,OAAC,EAAE,GAAlB;AAAuB,WAAK,EAAE,KAA9B;AAAqC,YAAM,EAAE;AAA7C,MADF,CADF,CADO,GAML,IAPN,EAQG,IAAI,IAAI,KAAK,UAAL,EARX,EASG,KAAK,cAAL,EATH,EAUE,iCAAC,kBAAD,EAAM;AAAC,SAAG,EAAC;AAAL,KAAN,EAAuC,KAAK,aAAL,EAAvC,CAVF,EAWG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KAA+C,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,MAAzC,CAXlD,CADF;AAeD,GAzBD;;AApVO,wBAAc,SAAd;AAEA,yBAAe;AACpB,WAAO,EAAE,CADW;AAEpB,WAAO,EAAE,CAFW;AAGpB,WAAO,EAAE,CAHW;AAIpB,cAAU,EAAE,QAJQ;AAKpB,YAAQ,EAAE,OALU;AAMpB,iBAAa,EAAE,QANK;AAOpB,QAAI,EAAE,EAPc;AAQpB,SAAK,EAAE,QARa;AASpB,QAAI,EAAE,KATc;AAWpB,qBAAiB,EAAE,CAAC,oBAAO,KAXP;AAYpB,kBAAc,EAAE,CAZI;AAapB,qBAAiB,EAAE,GAbC;AAcpB,mBAAe,EAAE;AAdG,GAAf;;AAwBA,4BAAkB,UAAC,EAAD,EA0BxB;QAzBC,gB;QACA,gB;QACA,gB;QACA,c;QACA,gC;QACA,sC;QACA,sC;QACA,4B;QACA,0B;QACA,0B;QACA,kB;AAgBQ;AACR,QAAM,KAAK,GAAG,2BAAc,IAAI,CAAC,KAAL,CAAW,QAAzB,EAAmC,kBAAK,WAAxC,CAAd;AACA,QAAM,YAAY,GAAG,oBAAE,KAAF,CAAQ,KAAK,CAAC,OAAd,IAAyB,IAAI,CAAC,KAAL,CAAW,OAApC,GAA8C,KAAK,CAAC,OAAzE;AACA,QAAM,YAAY,GAAG,oBAAE,KAAF,CAAQ,KAAK,CAAC,OAAd,IAAyB,IAAI,CAAC,KAAL,CAAW,OAApC,GAA8C,KAAK,CAAC,OAAzE;AACA,QAAM,YAAY,GAAG,KAAK,IAAI,KAAK,CAAC,OAApC;AACA,QAAM,aAAa,GAAG,KAAK,GAAG,KAAK,CAAC,KAAT,GAAiB,mBAAM,YAAN,CAAmB,KAA/D;AACA,QAAM,QAAQ,GAAG,aAAa,IAAI,aAAa,CAAC,CAAD,CAA/C;AACA,QAAM,SAAS,GAAI,KAAK,CAAC,KAAN,CAAoB,SAApB,GAAiC,KAAK,CAAC,KAAN,CAAoB,SAApB,EAAjC,GAAmE,CAAtF;AACA,QAAM,SAAS,GAAI,KAAK,CAAC,KAAN,CAAoB,SAApB,GAAiC,KAAK,CAAC,KAAN,CAAoB,SAApB,EAAjC,GAAmE,CAAtF;AACA,QAAM,MAAM,GAAG,aAAa,CAAC,GAAd,CAAkB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAC5C,UAAM,CAAC,GAAG,+BAAkB,KAAlB,EAAyB,YAAzB,CAAV;AACA,UAAM,CAAC,GAAG,+BAAkB,KAAlB,EAAyB,YAAzB,CAAV;AACA,UAAM,CAAC,GAAI,CAAC,oBAAE,KAAF,CAAQ,YAAR,CAAD,IAA0B,+BAAkB,KAAlB,EAAyB,YAAzB,CAA3B,IAAsE,GAAhF;AACA,UAAM,cAAc,GAAG,CACrB;AACE,YAAI,EAAE,oBAAE,KAAF,CAAQ,KAAK,CAAC,OAAd,IAAyB,IAAI,CAAC,KAAL,CAAW,IAApC,GAA2C,KAAK,CAAC,IAAN,IAAc,KAAK,CAAC,OADvE;AAEE,YAAI,EAAE,KAAK,CAAC,IAAN,IAAc,EAFtB;AAGE,aAAK,EAAE,CAHT;AAIE,eAAO,EAAE,KAJX;AAKE,eAAO,EAAE,YALX;AAME,YAAI,EAAE;AANR,OADqB,EASrB;AACE,YAAI,EAAE,oBAAE,KAAF,CAAQ,KAAK,CAAC,OAAd,IAAyB,IAAI,CAAC,KAAL,CAAW,IAApC,GAA2C,KAAK,CAAC,IAAN,IAAc,KAAK,CAAC,OADvE;AAEE,YAAI,EAAE,KAAK,CAAC,IAAN,IAAc,EAFtB;AAGE,aAAK,EAAE,CAHT;AAIE,eAAO,EAAE,KAJX;AAKE,eAAO,EAAE,YALX;AAME,YAAI,EAAE;AANR,OATqB,CAAvB;;AAmBA,UAAI,CAAC,KAAK,GAAV,EAAe;AACb,sBAAc,CAAC,IAAf,CAAoB;AAClB,cAAI,EAAE,KAAK,CAAC,IAAN,IAAc,KAAK,CAAC,OADR;AAElB,cAAI,EAAE,KAAK,CAAC,IAAN,IAAc,EAFF;AAGlB,eAAK,EAAE,CAHW;AAIlB,iBAAO,EAAE,KAJS;AAKlB,iBAAO,EAAE,YALS;AAMlB,cAAI,EAAE;AANY,SAApB;AAQD;;AACD,UAAM,EAAE,GAAG,qCAAwB;AACjC,YAAI,EAAE,KAD2B;AAEjC,aAAK,EAAE,UAF0B;AAGjC,gBAAQ,EAAE,SAHuB;AAIjC,aAAK,OAJ4B;AAKjC,aAAK,OAL4B;AAMjC,eAAO,EAAE;AANwB,OAAxB,CAAX;AAQA,UAAM,EAAE,GAAG,qCAAwB;AACjC,YAAI,EAAE,KAD2B;AAEjC,aAAK,EAAE,UAF0B;AAGjC,gBAAQ,EAAE,SAHuB;AAIjC,aAAK,OAJ4B;AAKjC,aAAK,OAL4B;AAMjC,eAAO,EAAE;AANwB,OAAxB,CAAX;AAQA,UAAM,IAAI,GAAG,CAAC,KAAK,GAAN,GAAY,KAAK,CAAC,KAAN,CAAY,CAAZ,CAAZ,GAA6B,QAA1C;AACA,UAAM,MAAM,GAAG,IAAI,CAAC,IAAL,CAAU,IAAI,CAAC,GAAL,CAAS,IAAT,EAAe,CAAf,IAAoB,IAAI,CAAC,EAAnC,CAAf;AAEA,4CACK,KADL,GACU;AACR,UAAE,IADM;AAER,UAAE,IAFM;AAGR,SAAC,EAAE,EAAE,GAAG,MAHA;AAIR,SAAC,EAAE,EAAE,GAAG,MAJA;AAKR,aAAK,OALG;AAMR,aAAK,OANG;AAOR,aAAK,OAPG;AAQR,aAAK,EAAE,IAAI,MARH;AASR,cAAM,EAAE,IAAI,MATJ;AAUR,YAAI,MAVI;AAWR,YAAI,EAAE;AAAE,WAAC,GAAH;AAAK,WAAC,GAAN;AAAQ,WAAC;AAAT,SAXE;AAYR,sBAAc,gBAZN;AAaR,uBAAe,EAAE;AAAE,WAAC,EAAE,EAAL;AAAS,WAAC,EAAE;AAAZ,SAbT;AAcR,eAAO,EAAE;AAdD,OADV,GAgBM,KAAK,IAAI,KAAK,CAAC,KAAD,CAAd,IAAyB,KAAK,CAAC,KAAD,CAAL,CAAa,KAhB5C;AAkBD,KAtEc,CAAf;AAwEA;AACE,kBAAY,EAAE,oBAAE,UAAF,CAAa,gBAAb,IAAiC,gBAAjC,GAAoD,IAAI,CAAC,KAAL,CAAW,YAD/E;AAEE,kBAAY,EAAE,oBAAE,UAAF,CAAa,gBAAb,IAAiC,gBAAjC,GAAoD,IAAI,CAAC,KAAL,CAAW,YAF/E;AAGE,aAAO,EAAE,oBAAE,UAAF,CAAa,WAAb,IAA4B,WAA5B,GAA0C,IAAI,CAAC,KAAL,CAAW,OAHhE;AAIE,YAAM;AAJR,OAKK,MALL;AAOD,GAnHM;;AAoVT;AAAC,CA/WD,CAAsB,qBAAtB;;AAiXA,qBAAe,OAAf,C;;;;;;;;;;;;;;;;;;AClbA,SAAS,KAAT,CAAe,KAAf,EAA2B;AACzB,SAAO,IAAP;AACD;;AAED,KAAK,CAAC,WAAN,GAAoB,OAApB;AACA,KAAK,CAAC,YAAN,GAAqB;AACnB,eAAa,EAAE,IADI;AAEnB,MAAI,EAAE,KAFa;AAGnB,aAAW,EAAE,QAHM;AAInB,OAAK,EAAE,CAJY;AAKnB,QAAM,EAAE,EALW;AAMnB,QAAM,EAAE,KANW;AAOnB,SAAO,EAAE,CAPU;AAQnB,WAAS,EAAE,CARQ;AASnB,MAAI,EAAE,UATa;AAUnB,QAAM,EAAE,CAAC,CAAD,EAAI,MAAJ,CAVW;AAWnB,SAAO,EAAE;AAAE,QAAI,EAAE,CAAR;AAAW,SAAK,EAAE;AAAlB,GAXU;AAYnB,mBAAiB,EAAE,KAZA;AAanB,OAAK,EAAE,MAbY;AAcnB,UAAQ,EAAE,KAdS;AAenB,yBAAuB,EAAE;AAfN,CAArB;AAkBA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;ACpBA,SAAS,KAAT,CAAe,KAAf,EAA2B;AACzB,SAAO,IAAP;AACD;;AAED,KAAK,CAAC,WAAN,GAAoB,OAApB;AACA,KAAK,CAAC,YAAN,GAAqB;AACnB,yBAAuB,EAAE,IADN;AAEnB,eAAa,EAAE,IAFI;AAGnB,MAAI,EAAE,KAHa;AAInB,aAAW,EAAE,MAJM;AAKnB,OAAK,EAAE,EALY;AAMnB,QAAM,EAAE,CANW;AAOnB,QAAM,EAAE,KAPW;AAQnB,SAAO,EAAE,CARU;AASnB,WAAS,EAAE,CATQ;AAUnB,MAAI,EAAE,QAVa;AAWnB,QAAM,EAAE,CAAC,CAAD,EAAI,MAAJ,CAXW;AAYnB,SAAO,EAAE;AAAE,OAAG,EAAE,CAAP;AAAU,UAAM,EAAE;AAAlB,GAZU;AAanB,mBAAiB,EAAE,KAbA;AAcnB,OAAK,EAAE,MAdY;AAenB,UAAQ,EAAE;AAfS,CAArB;AAkBA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;AChCA,SAAS,KAAT,CAAe,KAAf,EAA2B;AACzB,SAAO,IAAP;AACD;;AAED,KAAK,CAAC,WAAN,GAAoB,OAApB;AACA,KAAK,CAAC,YAAN,GAAqB;AACnB,SAAO,EAAE,CADU;AAEnB,OAAK,EAAE,CAAC,EAAD,EAAK,EAAL,CAFY;AAGnB,OAAK,EAAE,MAHY;AAInB,MAAI,EAAE;AAJa,CAArB;AAOA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;AC7BA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,WAD2B;AAEtC,gBAAc,EAAE,iBAFsB;AAGtC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GADc,EAEd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAFc,CAHsB;AAOtC,eAAa;AAPyB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,UAD2B;AAEtC,gBAAc,EAAE,gBAFsB;AAGtC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GADc,EAEd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAFc,CAHsB;AAOtC,eAAa;AAPyB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,eAD2B;AAEtC,gBAAc,EAAE,CAAC,iBAAD,EAAO,iBAAP,EAAa,gBAAb,EAAkB,oBAAlB,CAFsB;AAGtC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GADc,EAEd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAFc,EAGd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAHc,CAHsB;AAQtC,eAAa;AARyB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACXA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,aAD2B;AAEtC,gBAAc,EAAE,mBAFsB;AAGtC,WAAS,EAAE,MAH2B;AAItC,gBAAc,EAAE,EAJsB;AAKtC,cAAY,EAAE;AACZ,UAAM,EAAE;AADI;AALwB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACJA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,WAD2B;AAEtC,gBAAc,EAAE,iBAFsB;AAGtC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GADc,EAEd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAFc,CAHsB;AAOtC,eAAa;AAPyB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,UAD2B;AAEtC,gBAAc,EAAE,gBAFsB;AAGtC,WAAS,EAAE,MAH2B;AAItC,eAAa,EAAE,UAJuB;AAKtC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,WAAZ;AAAyB,YAAQ,EAAE;AAAnC,GADc,EAEd;AAAE,YAAQ,EAAE,YAAZ;AAA0B,YAAQ,EAAE;AAApC,GAFc,CALsB;AAStC,eAAa,4BATyB;AAUtC,cAAY,EAAE;AACZ,UAAM,EAAE,SADI;AAEZ,cAAU,EAAE,CAFA;AAGZ,YAAQ,EAAE,GAHE;AAIZ,MAAE,EAAE,KAJQ;AAKZ,MAAE,EAAE,KALQ;AAMZ,eAAW,EAAE,CAND;AAOZ,eAAW,EAAE;AAPD;AAVwB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,YAD2B;AAEtC,gBAAc,EAAE,kBAFsB;AAGtC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,WAAZ;AAAyB,YAAQ,EAAE;AAAnC,GADc,EAEd;AAAE,YAAQ,EAAE,YAAZ;AAA0B,YAAQ,EAAE;AAApC,GAFc,CAHsB;AAOtC,eAAa,4BAPyB;AAQtC,cAAY,EAAE;AACZ,UAAM,EAAE,SADI;AAEZ,cAAU,EAAE,EAFA;AAGZ,YAAQ,EAAE,CAAC,GAHC;AAIZ,MAAE,EAAE,KAJQ;AAKZ,MAAE,EAAE,KALQ;AAMZ,eAAW,EAAE,CAND;AAOZ,eAAW,EAAE;AAPD;AARwB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,gBAD2B;AAEtC,gBAAc,EAAE,sBAFsB;AAGtC,eAAa,EAAE,UAHuB;AAItC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,WAAZ;AAAyB,YAAQ,EAAE;AAAnC,GADc,EAEd;AAAE,YAAQ,EAAE,YAAZ;AAA0B,YAAQ,EAAE;AAApC,GAFc,CAJsB;AAQtC,eAAa,4BARyB;AAStC,cAAY,EAAE;AACZ,UAAM,EAAE,QADI;AAEZ,cAAU,EAAE,CAFA;AAGZ,YAAQ,EAAE,GAHE;AAIZ,MAAE,EAAE,KAJQ;AAKZ,MAAE,EAAE,KALQ;AAMZ,eAAW,EAAE,CAND;AAOZ,eAAW,EAAE;AAPD;AATwB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEA,IAAM,0BAA0B,GAAG;AAAE,GAAC,EAAE,CAAL;AAAQ,GAAC,EAAE;AAAX,CAAnC;;AAEA,IAAM,sBAAsB,GAAG,SAAzB,sBAAyB,CAAC,CAAD,EAAY,CAAZ,EAAqB;AAClD,MAAM,EAAE,GAAG,CAAC,CAAZ;AACA,MAAM,EAAE,GAAG,CAAC,GAAG,EAAf;AACA,SAAO,UAAC,CAAD,EAAO;AAAK,aAAE,GAAG,EAAE,GAAP;AAAW,GAA9B;AACD,CAJD;;AAKA,IAAM,OAAO,GAAG,SAAV,OAAU,CAAC,IAAD,EAAiB;AAAK,aAAI,CAAC,CAAL,GAAS,IAAI,CAAC,EAAL,GAAT;AAAoB,CAA1D;;AACA,IAAM,QAAQ,GAAG,SAAX,QAAW,CAAC,KAAD,EAAkB;AAAK,SAAC,KAAK,IAAI,KAAK,CAAC,KAAhB;AAA2B,CAAnE;;AACA,IAAM,WAAW,GAAG,SAAd,WAAc,CAAC,KAAD,EAAsB,GAAtB,EAAmC;AACrD,YAAG,CAAC,MAAJ,CAAW,UAAC,MAAD,EAAc,EAAd,EAAqB;AAAK,iBAAM,GAAG,QAAQ,CAAC,KAAK,CAAvB,EAAuB,CAAN,CAAjB;AAA4B,GAAjE,EAAmE,CAAnE;AAAqE,CADvE;;AAEA,IAAM,wBAAwB,GAAG,SAA3B,wBAA2B,CAAC,IAAD,EAAY,KAAZ,EAAiC,GAAjC,EAA8C;AAC7E,YAAG,CAAC,MAAJ,CAAW,UAAC,MAAD,EAAc,EAAd,EAAqB;AAC9B,QAAM,IAAI,GAAG,KAAK,CAAC,EAAD,CAAlB;AACA,QAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAN,CAAvB;AAEA,WAAO,MAAM,GAAG,OAAO,CAAC,UAAD,CAAP,GAAsB,QAAQ,CAAC,KAAK,CAAC,EAAD,CAAN,CAA9C;AACD,GALD,EAKG,CALH;AAKK,CANP;;AAOA,IAAM,wBAAwB,GAAG,SAA3B,wBAA2B,CAAC,IAAD,EAAY,KAAZ,EAAiC,GAAjC,EAA8C;AAC7E,YAAG,CAAC,MAAJ,CAAW,UAAC,MAAD,EAAiB,EAAjB,EAA2B;AACpC,QAAM,IAAI,GAAG,KAAK,CAAC,EAAD,CAAlB;AACA,QAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAN,CAAvB;AAEA,WAAO,MAAM,GAAG,OAAO,CAAC,UAAD,CAAP,GAAsB,QAAQ,CAAC,KAAK,CAAC,EAAD,CAAN,CAA9C;AACD,GALD,EAKG,CALH;AAKK,CANP;;AAOA,IAAM,UAAU,GAAG,SAAb,UAAa,CAAC,CAAD,EAAS,CAAT,EAAe;AAAK,UAAC,CAAC,CAAF,GAAM,CAAC,CAAP;AAAS,CAAhD;;AAEA,IAAM,uBAAuB,GAAG,SAA1B,uBAA0B,CAAC,KAAD,EAAsB,EAAtB,EAAgC;AAC9D,MAAM,WAAW,GAAa,EAA9B;AACA,MAAM,WAAW,GAAa,EAA9B;AACA,MAAM,WAAW,GAAa,EAA9B;AACA,MAAM,WAAW,GAAa,EAA9B;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,KAAK,CAAC,MAA5B,EAAoC,CAAC,GAAG,GAAxC,EAA6C,CAAC,EAA9C,EAAkD;AAChD,QAAM,IAAI,GAAG,KAAK,CAAC,CAAD,CAAlB;;AAEA,QAAI,IAAI,CAAC,MAAL,KAAgB,EAApB,EAAwB;AACtB,iBAAW,CAAC,IAAZ,CAAiB,IAAI,CAAC,MAAtB;AACA,iBAAW,CAAC,IAAZ,CAAiB,CAAjB;AACD;;AAED,QAAI,IAAI,CAAC,MAAL,KAAgB,EAApB,EAAwB;AACtB,iBAAW,CAAC,IAAZ,CAAiB,IAAI,CAAC,MAAtB;AACA,iBAAW,CAAC,IAAZ,CAAiB,CAAjB;AACD;AACF;;AAED,SAAO;AAAE,eAAW,aAAb;AAAe,eAAW,aAA1B;AAA4B,eAAW,aAAvC;AAAyC,eAAW;AAApD,GAAP;AACD,CArBD;;AAuBA,IAAM,oBAAoB,GAAG,SAAvB,oBAAuB,CAAC,IAAD,EAAY,OAAZ,EAAwB;AAC3C;;AAER,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,WAAW,CAAC,MAAlC,EAA0C,CAAC,GAAG,GAA9C,EAAmD,CAAC,EAApD,EAAwD;AACtD,QAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAD,CAAZ,CAAnB;;AAEA,QAAI,MAAJ,EAAY;AACV,YAAM,CAAC,KAAP,GAAe,IAAI,CAAC,GAAL,CAAS,OAAO,CAAC,KAAR,GAAgB,CAAzB,EAA4B,MAAM,CAAC,KAAnC,CAAf;AAEA,0BAAoB,CAAC,IAAD,EAAO,MAAP,CAApB;AACD;AACF;AACF,CAZD;;AAcA,IAAM,YAAY,GAAG,SAAf,YAAe,CAAC,EAAD,EAAwB,KAAxB,EAAuC,SAAvC,EAAwD;MAArD,gB;MAAO,gB;AAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAN,CAAU,UAAC,KAAD,EAAa,KAAb,EAA0B;AAC/C,QAAM,MAAM,GAAG,uBAAuB,CAAC,KAAD,EAAQ,KAAR,CAAtC;AAEA,0CACK,KADL,GAEK,MAFL,GAEW;AACT,WAAK,EAAE,IAAI,CAAC,GAAL,CAAS,WAAW,CAAC,KAAD,EAAQ,MAAM,CAAC,WAAf,CAApB,EAAiD,WAAW,CAAC,KAAD,EAAQ,MAAM,CAAC,WAAf,CAA5D,CADE;AAET,WAAK,EAAE;AAFE,KAFX;AAMD,GATY,CAAb;;AAWA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,IAAI,CAAC,MAA3B,EAAmC,CAAC,GAAG,GAAvC,EAA4C,CAAC,EAA7C,EAAiD;AAC/C,QAAM,IAAI,GAAG,IAAI,CAAC,CAAD,CAAjB;;AAEA,QAAI,CAAC,IAAI,CAAC,WAAL,CAAiB,MAAtB,EAA8B;AAC5B,0BAAoB,CAAC,IAAD,EAAO,IAAP,CAApB;AACD;AACF;;AACD,MAAM,QAAQ,GAAG,oBAAE,KAAF,CAAQ,IAAR,EAAc,UAAC,KAAD,EAAkB;AAAK,gBAAK,CAAL;AAAW,GAAhD,EAAkD,KAAnE;;AAEA,MAAI,QAAQ,IAAI,CAAhB,EAAmB;AACjB,QAAM,UAAU,GAAG,CAAC,KAAK,GAAG,SAAT,IAAsB,QAAzC;;AACA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,IAAI,CAAC,MAA3B,EAAmC,CAAC,GAAG,GAAvC,EAA4C,CAAC,EAA7C,EAAiD;AAC/C,UAAM,IAAI,GAAG,IAAI,CAAC,CAAD,CAAjB;;AAEA,UAAI,CAAC,IAAI,CAAC,WAAL,CAAiB,MAAtB,EAA8B;AAC5B,YAAI,CAAC,KAAL,GAAa,QAAb;AACD;;AACD,UAAI,CAAC,CAAL,GAAS,IAAI,CAAC,KAAL,GAAa,UAAtB;AACA,UAAI,CAAC,EAAL,GAAU,SAAV;AACD;AACF;;AAED,SAAO;AAAE,QAAI,MAAN;AAAQ,YAAQ;AAAhB,GAAP;AACD,CAnCD;;AAqCA,IAAM,YAAY,GAAG,SAAf,YAAe,CAAC,IAAD,EAAU;AAC7B,MAAM,MAAM,GAAG,EAAf;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,IAAI,CAAC,MAA3B,EAAmC,CAAC,GAAG,GAAvC,EAA4C,CAAC,EAA7C,EAAiD;AAC/C,QAAM,IAAI,GAAG,IAAI,CAAC,CAAD,CAAjB;;AAEA,QAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAN,CAAX,EAAyB;AACvB,YAAM,CAAC,IAAI,CAAC,KAAN,CAAN,GAAqB,EAArB;AACD;;AAED,UAAM,CAAC,IAAI,CAAC,KAAN,CAAN,CAAmB,IAAnB,CAAwB,IAAxB;AACD;;AAED,SAAO,MAAP;AACD,CAdD;;AAgBA,IAAM,aAAa,GAAG,SAAhB,aAAgB,CAAC,SAAD,EAAiB,MAAjB,EAAiC,WAAjC,EAAsD,KAAtD,EAAgE;AACpF,MAAM,MAAM,GAAW,oBAAE,GAAF,CACrB,SAAS,CAAC,GAAV,CAAc,UAAC,KAAD,EAAW;AAAK,YAAC,MAAM,GAAG,CAAC,KAAK,CAAC,MAAN,GAAe,CAAhB,IAAqB,WAA/B,IAA8C,oBAAE,KAAF,CAAQ,KAAR,EAA9C,QAA8C,CAA9C;AAAsE,GAApG,CADqB,CAAvB;;AAIA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,QAAQ,GAAG,SAAS,CAAC,MAArC,EAA6C,CAAC,GAAG,QAAjD,EAA2D,CAAC,EAA5D,EAAgE;AAC9D,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,SAAS,CAAC,CAAD,CAAT,CAAa,MAAnC,EAA2C,CAAC,GAAG,GAA/C,EAAoD,CAAC,EAArD,EAAyD;AACvD,UAAM,IAAI,GAAG,SAAS,CAAC,CAAD,CAAT,CAAa,CAAb,CAAb;AAEA,UAAI,CAAC,CAAL,GAAS,CAAT;AACA,UAAI,CAAC,EAAL,GAAU,IAAI,CAAC,KAAL,GAAa,MAAvB;AACD;AACF;;AAED,SAAO,KAAK,CAAC,GAAN,CAAU,UAAC,IAAD,EAAU;AAAK,iCAAM,IAAN,GAAU;AAAE,QAAE,EAAE,QAAQ,CAAC,IAAD,CAAR,GAAhB;AAAU,KAAV;AAA0C,GAAnE,CAAP;AACD,CAfD;;AAiBA,IAAM,iBAAiB,GAAG,SAApB,iBAAoB,CAAC,SAAD,EAAmB,MAAnB,EAAmC,WAAnC,EAAsD;AAC9E,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,SAAS,CAAC,MAAhC,EAAwC,CAAC,GAAG,GAA5C,EAAiD,CAAC,EAAlD,EAAsD;AACpD,QAAM,KAAK,GAAG,SAAS,CAAC,CAAD,CAAvB;AACA,QAAM,CAAC,GAAG,KAAK,CAAC,MAAhB;AAGA,SAAK,CAAC,IAAN,CAAW,UAAX;AAEA,QAAI,EAAE,GAAG,CAAT;;AACA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,CAApB,EAAuB,CAAC,EAAxB,EAA4B;AAC1B,UAAM,IAAI,GAAG,KAAK,CAAC,CAAD,CAAlB;AACA,UAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAArB;;AAEA,UAAI,EAAE,GAAG,CAAT,EAAY;AACV,YAAI,CAAC,CAAL,IAAU,EAAV;AACD;;AAED,QAAE,GAAG,IAAI,CAAC,CAAL,GAAS,IAAI,CAAC,EAAd,GAAmB,WAAxB;AACD;;AAED,MAAE,GAAG,MAAM,GAAG,WAAd;;AACA,SAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAjB,EAAoB,CAAC,IAAI,CAAzB,EAA4B,CAAC,EAA7B,EAAiC;AAC/B,UAAM,IAAI,GAAG,KAAK,CAAC,CAAD,CAAlB;AACA,UAAM,EAAE,GAAG,IAAI,CAAC,CAAL,GAAS,IAAI,CAAC,EAAd,GAAmB,WAAnB,GAAiC,EAA5C;;AAEA,UAAI,EAAE,GAAG,CAAT,EAAY;AACV,YAAI,CAAC,CAAL,IAAU,EAAV;AACA,UAAE,GAAG,IAAI,CAAC,CAAV;AACD,OAHD,MAGO;AACL;AACD;AACF;AACF;AACF,CAjCD;;AAmCA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,IAAD,EAAY,SAAZ,EAA4B,KAA5B,EAAwC,KAAxC,EAAkD;AACzE,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,QAAQ,GAAG,SAAS,CAAC,MAArC,EAA6C,CAAC,GAAG,QAAjD,EAA2D,CAAC,EAA5D,EAAgE;AAC9D,QAAM,KAAK,GAAG,SAAS,CAAC,CAAD,CAAvB;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,KAAK,CAAC,MAA5B,EAAoC,CAAC,GAAG,GAAxC,EAA6C,CAAC,EAA9C,EAAkD;AAChD,UAAM,IAAI,GAAG,KAAK,CAAC,CAAD,CAAlB;;AAEA,UAAI,IAAI,CAAC,WAAL,CAAiB,MAArB,EAA6B;AAC3B,YAAM,SAAS,GAAG,WAAW,CAAC,KAAD,EAAQ,IAAI,CAAC,WAAb,CAA7B;AACA,YAAM,WAAW,GAAG,wBAAwB,CAAC,IAAD,EAAO,KAAP,EAAc,IAAI,CAAC,WAAnB,CAA5C;AACA,YAAM,CAAC,GAAG,WAAW,GAAG,SAAxB;AAEA,YAAI,CAAC,CAAL,IAAU,CAAC,CAAC,GAAG,OAAO,CAAC,IAAD,CAAZ,IAAsB,KAAhC;AACD;AACF;AACF;AACF,CAhBD;;AAiBA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,IAAD,EAAY,SAAZ,EAA4B,KAA5B,EAAwC,KAAxC,EAAkD;AACzE,OAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAV,GAAmB,CAAhC,EAAmC,CAAC,IAAI,CAAxC,EAA2C,CAAC,EAA5C,EAAgD;AAC9C,QAAM,KAAK,GAAG,SAAS,CAAC,CAAD,CAAvB;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,KAAK,CAAC,MAA5B,EAAoC,CAAC,GAAG,GAAxC,EAA6C,CAAC,EAA9C,EAAkD;AAChD,UAAM,IAAI,GAAG,KAAK,CAAC,CAAD,CAAlB;;AAEA,UAAI,IAAI,CAAC,WAAL,CAAiB,MAArB,EAA6B;AAC3B,YAAM,SAAS,GAAG,WAAW,CAAC,KAAD,EAAQ,IAAI,CAAC,WAAb,CAA7B;AACA,YAAM,WAAW,GAAG,wBAAwB,CAAC,IAAD,EAAO,KAAP,EAAc,IAAI,CAAC,WAAnB,CAA5C;AACA,YAAM,CAAC,GAAG,WAAW,GAAG,SAAxB;AAEA,YAAI,CAAC,CAAL,IAAU,CAAC,CAAC,GAAG,OAAO,CAAC,IAAD,CAAZ,IAAsB,KAAhC;AACD;AACF;AACF;AACF,CAhBD;;AAiBA,IAAM,cAAc,GAAG,SAAjB,cAAiB,CAAC,IAAD,EAAY,KAAZ,EAAsB;AAC3C,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,IAAI,CAAC,MAA3B,EAAmC,CAAC,GAAG,GAAvC,EAA4C,CAAC,EAA7C,EAAiD;AAC/C,QAAM,IAAI,GAAG,IAAI,CAAC,CAAD,CAAjB;AACA,QAAI,EAAE,GAAG,CAAT;AACA,QAAI,EAAE,GAAG,CAAT;AAEA,QAAI,CAAC,WAAL,CAAiB,IAAjB,CAAsB,UAAC,CAAD,EAAS,CAAT,EAAe;AAAK,iBAAI,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,MAAV,CAAJ,CAAsB,CAAtB,GAA0B,IAAI,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,MAAV,CAAJ,CAA1B;AAAiD,KAA3F;AACA,QAAI,CAAC,WAAL,CAAiB,IAAjB,CAAsB,UAAC,CAAD,EAAS,CAAT,EAAe;AAAK,iBAAI,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,MAAV,CAAJ,CAAsB,CAAtB,GAA0B,IAAI,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,MAAV,CAAJ,CAA1B;AAAiD,KAA3F;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,IAAI,GAAG,IAAI,CAAC,WAAL,CAAiB,MAAxC,EAAgD,CAAC,GAAG,IAApD,EAA0D,CAAC,EAA3D,EAA+D;AAC7D,UAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,WAAL,CAAiB,CAAjB,CAAD,CAAlB;;AAEA,UAAI,IAAJ,EAAU;AACR,YAAI,CAAC,EAAL,GAAU,EAAV;AACA,UAAE,IAAI,IAAI,CAAC,EAAX;AACD;AACF;;AAED,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,IAAI,GAAG,IAAI,CAAC,WAAL,CAAiB,MAAxC,EAAgD,CAAC,GAAG,IAApD,EAA0D,CAAC,EAA3D,EAA+D;AAC7D,UAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,WAAL,CAAiB,CAAjB,CAAD,CAAlB;;AAEA,UAAI,IAAJ,EAAU;AACR,YAAI,CAAC,EAAL,GAAU,EAAV;AACA,UAAE,IAAI,IAAI,CAAC,EAAX;AACD;AACF;AACF;AACF,CA3BD;;AA6BA,IAAM,WAAW,GAAG,SAAd,WAAc,CAAC,EAAD,EAcnB;MAbC,c;MACA,gB;MACA,kB;MACA,0B;MACA,wB;MACA,4B;AAYQ;AACA;AACR,MAAM,SAAS,GAAG,YAAY,CAAC,IAAD,CAA9B;AACA,MAAM,QAAQ,GAAG,aAAa,CAAC,SAAD,EAAY,MAAZ,EAAoB,WAApB,EAAiC,KAAjC,CAA9B;AAEA,mBAAiB,CAAC,SAAD,EAAY,MAAZ,EAAoB,WAApB,CAAjB;AAEA,MAAI,KAAK,GAAG,CAAZ;;AACA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,IAAI,UAArB,EAAiC,CAAC,EAAlC,EAAsC;AACpC,oBAAgB,CAAC,IAAD,EAAO,SAAP,EAAkB,QAAlB,EAA6B,KAAK,IAAI,IAAtC,CAAhB;AAEA,qBAAiB,CAAC,SAAD,EAAY,MAAZ,EAAoB,WAApB,CAAjB;AAEA,oBAAgB,CAAC,IAAD,EAAO,SAAP,EAAkB,QAAlB,EAA4B,KAA5B,CAAhB;AAEA,qBAAiB,CAAC,SAAD,EAAY,MAAZ,EAAoB,WAApB,CAAjB;AACD;;AAED,gBAAc,CAAC,IAAD,EAAO,QAAP,CAAd;AAEA,SAAO;AAAE,SAAK,EAAE,IAAT;AAAe,SAAK,EAAE;AAAtB,GAAP;AACD,CAvCD;;AAyCA,IAAM,sBAAsB,GAAG,SAAzB,sBAAyB,CAAC,EAAD,EAAU,IAAV,EAAsB;AACnD,MAAI,IAAI,KAAK,MAAb,EAAqB;AACnB,WAAO;AAAE,OAAC,EAAE,EAAE,CAAC,CAAH,GAAO,EAAE,CAAC,KAAH,GAAW,CAAvB;AAA0B,OAAC,EAAE,EAAE,CAAC,CAAH,GAAO,EAAE,CAAC,MAAH,GAAY;AAAhD,KAAP;AACD;;AAED,SAAO;AACL,KAAC,EAAE,CAAC,EAAE,CAAC,OAAH,GAAa,EAAE,CAAC,OAAjB,IAA4B,CAD1B;AAEL,KAAC,EAAE,CAAC,EAAE,CAAC,OAAH,GAAa,EAAE,CAAC,OAAjB,IAA4B;AAF1B,GAAP;AAID,CATD;;AAWA,IAAM,mBAAmB,GAAG,SAAtB,mBAAsB,CAAC,EAAD,EAAU,IAAV,EAAwB,OAAxB,EAA6C;AAC/D;;AACR,MAAI,IAAI,KAAK,MAAb,EAAqB;AACnB,WAAO,CACL;AACE,aAAO,EAAE,EADX;AAEE,UAAI,EAAE,+BAAkB,OAAlB,EAA2B,OAA3B,EAAoC,EAApC,CAFR;AAGE,WAAK,EAAE,+BAAkB,OAAlB,EAA2B,OAA3B;AAHT,KADK,CAAP;AAOD;;AACD,MAAI,OAAO,CAAC,MAAR,IAAkB,OAAO,CAAC,MAA9B,EAAsC;AACpC,QAAM,UAAU,GAAG,+BAAkB,OAAO,CAAC,MAA1B,EAAkC,OAAlC,EAA2C,EAA3C,CAAnB;AACA,QAAM,UAAU,GAAG,+BAAkB,OAAO,CAAC,MAA1B,EAAkC,OAAlC,EAA2C,EAA3C,CAAnB;AAEA,WAAO,CACL;AACE,aAAO,EAAE,EADX;AAEE,UAAI,EAAK,UAAU,QAAV,GAAgB,UAF3B;AAGE,WAAK,EAAE,+BAAkB,OAAlB,EAA2B,OAA3B;AAHT,KADK,CAAP;AAOD;;AAED,SAAO,EAAP;AACD,CAzBD;;AA+EA;AAAqB;;AAqBnB,kBAAY,KAAZ,EAAwB;AAAxB,gBACE,kBAAM,KAAN,KAAY,IADd;;AARA,kBAAQ;AACN,mBAAa,EAAE,IADT;AAEN,uBAAiB,EAAE,IAFb;AAGN,qBAAe,EAAE,KAHX;AAIN,WAAK,EAAE,EAJD;AAKN,WAAK,EAAE;AALD,KAAR;AAWE,SAAI,CAAC,KAAL,GAAc,KAAI,CAAC,WAAL,CAAyB,kBAAzB,CAA4C,KAA5C,CAAd;;AACD;;AAGD,gEAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,cAAF;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,kBAAvB;AAAA,QAA+B,0BAA/B;AAAA,QAA2C,wBAA3C;AAAA,QAAsD,4BAAtD;AAAA,QAAmE,oBAAnE;;AACN,QACE,SAAS,CAAC,IAAV,KAAmB,IAAnB,IACA,SAAS,CAAC,KAAV,KAAoB,KADpB,IAEA,SAAS,CAAC,MAAV,KAAqB,MAFrB,IAGA,CAAC,4BAAa,SAAS,CAAC,MAAvB,EAA+B,MAA/B,CAHD,IAIA,SAAS,CAAC,UAAV,KAAyB,UAJzB,IAKA,SAAS,CAAC,SAAV,KAAwB,SALxB,IAMA,SAAS,CAAC,WAAV,KAA0B,WAN1B,IAOA,SAAS,CAAC,OAAV,KAAsB,OARxB,EASE;AACA,WAAK,QAAL,CAAe,KAAK,WAAL,CAAyB,kBAAzB,CAA4C,SAA5C,CAAf;AACD;AACF,GAdD;;AAqBO,8BAAP,UAA0B,KAA1B,EAAsC;AAC5B;AAAA,QAAM,mBAAN;AAAA,QAAa,qBAAb;AAAA,QAAqB,qBAArB;AAAA,QAA6B,6BAA7B;AAAA,QAAyC,2BAAzC;AAAA,QAAoD,+BAApD;AACR,QAAM,YAAY,GAAG,KAAK,IAAK,MAAM,IAAI,MAAM,CAAC,IAAlB,IAA2B,CAA/B,CAAL,IAA2C,MAAM,IAAI,MAAM,CAAC,KAAlB,IAA4B,CAAtE,CAArB;AACA,QAAM,aAAa,GAAG,MAAM,IAAK,MAAM,IAAI,MAAM,CAAC,GAAlB,IAA0B,CAA9B,CAAN,IAA2C,MAAM,IAAI,MAAM,CAAC,MAAlB,IAA6B,CAAvE,CAAtB;;AACM;gBAAA;yBAAA;2BAAA;4BAAA;0BAAA;;AAAA;AAAA,QAAE,gBAAF;AAAA,QAAS,gBAAT;;AASN,WAAO;AACL,mBAAa,EAAE,IADV;AAEL,uBAAiB,EAAE,IAFd;AAGL,qBAAe,EAAE,KAHZ;AAIL,WAAK,OAJA;AAKL,WAAK;AALA,KAAP;AAOD,GApBM;;AAsBP,gDAAiB,EAAjB,EAAyC,IAAzC,EAAuD,CAAvD,EAA6D;AACrD;AAAA,QAAE,8BAAF;AAAA,QAAgB,sBAAhB;AACN,QAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,QAAI,WAAJ,EAAiB;AACf,WAAK,QAAL,CACE;AACE,qBAAa,EAAE,EADjB;AAEE,yBAAiB,EAAE,IAFrB;AAGE,uBAAe,EAAE;AAHnB,OADF,EAME;AACE,YAAI,YAAJ,EAAkB;AAChB,sBAAY,CAAC,EAAD,EAAK,IAAL,EAAW,CAAX,CAAZ;AACD;AACF,OAVH;AAYD,KAbD,MAaO,IAAI,YAAJ,EAAkB;AACvB,kBAAY,CAAC,EAAD,EAAK,IAAL,EAAW,CAAX,CAAZ;AACD;AACF,GApBD;;AAsBA,gDAAiB,EAAjB,EAAyC,IAAzC,EAAuD,CAAvD,EAA6D;AACrD;AAAA,QAAE,8BAAF;AAAA,QAAgB,sBAAhB;AACN,QAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,QAAI,WAAJ,EAAiB;AACf,WAAK,QAAL,CACE;AACE,uBAAe,EAAE;AADnB,OADF,EAIE;AACE,YAAI,YAAJ,EAAkB;AAChB,sBAAY,CAAC,EAAD,EAAK,IAAL,EAAW,CAAX,CAAZ;AACD;AACF,OARH;AAUD,KAXD,MAWO,IAAI,YAAJ,EAAkB;AACvB,kBAAY,CAAC,EAAD,EAAK,IAAL,EAAW,CAAX,CAAZ;AACD;AACF,GAlBD;;AAoBA,2CAAY,EAAZ,EAAoC,IAApC,EAAkD,CAAlD,EAAwD;AAC9C;AACR,QAAI,OAAJ,EAAa,OAAO,CAAC,EAAD,EAAK,IAAL,EAAW,CAAX,CAAP;AACd,GAHD;;AAKO,0BAAP,UAAsB,MAAtB,EAAmC,KAAnC,EAA6C;AAC3C,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD;;AACD,QAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,aAAO,MAAM,CAAC,KAAD,CAAb;AACD;;AAEO;AAAA,QAAS,uBAAT;AAAA,QAAkB,qCAAlB;AAAA,QAAkC,uBAAlC;AAAA,QAA2C,uBAA3C;AAAA,QAAoD,qCAApD;AAAA,QAAoE,2BAApE;AAAA,QAA+E,qHAA/E;;AAER,WACE;AACE,eAAS,EAAC,sBADZ;AAEE,OAAC,EAAE,kBACE,OADF,GACS,GADT,GACa,OADb,GACoB,eADpB,GAEE,cAFF,GAEgB,GAFhB,GAEoB,OAFpB,GAE2B,GAF3B,GAE+B,cAF/B,GAE6C,GAF7C,GAEiD,OAFjD,GAEwD,GAFxD,GAE4D,OAF5D,GAEmE,GAFnE,GAEuE,OAFvE,GAE8E,YAJnF;AAME,UAAI,EAAC,MANP;AAOE,YAAM,EAAC,MAPT;AAQE,iBAAW,EAAE,SARf;AASE,mBAAa,EAAC;AAThB,OAUM,oBAAY,MAAZ,CAVN,EADF;AAcD,GAxBM;;AA0BP,2CAAY,KAAZ,EAAiC,KAAjC,EAAoD;AAApD;;AACQ;AAAA,QAAE,gCAAF;AAAA,QAAiB,qBAAjB;AAAA,QAAoC,kBAApC;AACN,QAAM,GAAG,GAAG,oBAAE,GAAF,CAAM,MAAN,EAAc,KAAd,KAAwB,CAApC;AACA,QAAM,IAAI,GAAG,oBAAE,GAAF,CAAM,MAAN,EAAc,MAAd,KAAyB,CAAtC;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC,uBAAX;AAAmC,SAAG,EAAC;AAAvC,KAAN,EACG,KAAK,CAAC,GAAN,CAAU,UAAC,IAAD,EAAmB,CAAnB,EAA4B;AAC7B;AAAA,UAAqB,yBAArB;AAAA,UAA0C,mBAA1C;AACR,UAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAN,CAApB;AACA,UAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAN,CAApB;AACA,UAAM,OAAO,GAAG,MAAM,CAAC,CAAP,GAAW,MAAM,CAAC,EAAlB,GAAuB,IAAvC;AACA,UAAM,OAAO,GAAG,MAAM,CAAC,CAAP,GAAW,IAA3B;AACA,UAAM,iBAAiB,GAAG,sBAAsB,CAAC,OAAD,EAAU,OAAV,CAAhD;AACA,UAAM,cAAc,GAAG,iBAAiB,CAAC,aAAD,CAAxC;AACA,UAAM,cAAc,GAAG,iBAAiB,CAAC,IAAI,aAAL,CAAxC;AACA,UAAM,OAAO,GAAG,MAAM,CAAC,CAAP,GAAW,eAAX,GAA6B,SAAS,GAAG,CAAzC,GAA6C,GAA7D;AACA,UAAM,OAAO,GAAG,MAAM,CAAC,CAAP,GAAW,eAAX,GAA6B,SAAS,GAAG,CAAzC,GAA6C,GAA7D;;AAEA,UAAM,SAAS;AACb,eAAO,SADM;AAEb,eAAO,SAFM;AAGb,eAAO,SAHM;AAIb,eAAO,SAJM;AAKb,sBAAc,gBALD;AAMb,sBAAc,gBAND;AAOb,uBAAe,iBAPF;AAQb,uBAAe,iBARF;AASb,iBAAS,WATI;AAUb,aAAK,EAAE,CAVM;AAWb,eAAO,wBAAO,IAAP,GAAW;AAAE,gBAAM,QAAR;AAAU,gBAAM;AAAhB,SAAX;AAXM,SAYV,oBAAY,WAAZ,CAZU,CAAf;;AAcA,UAAM,MAAM,GAAG;AACb,oBAAY,EAAE,KAAI,CAAC,gBAAL,CAAsB,IAAtB,CAA2B,KAA3B,EAAiC,SAAjC,EAA4C,MAA5C,CADD;AAEb,oBAAY,EAAE,KAAI,CAAC,gBAAL,CAAsB,IAAtB,CAA2B,KAA3B,EAAiC,SAAjC,EAA4C,MAA5C,CAFD;AAGb,eAAO,EAAE,KAAI,CAAC,WAAL,CAAiB,IAAjB,CAAsB,KAAtB,EAA4B,SAA5B,EAAuC,MAAvC;AAHI,OAAf;AAMA,aAEE,iCAAC,kBAAD,EAAM;AAAC,WAAG,EAAE,SAAO;AAAb,SAAsB,MAAtB,CAAN,EACI,KAAI,CAAC,WAAL,CAAyB,cAAzB,CAAwC,WAAxC,EAAqD,SAArD,CADJ,CAFF;AAMD,KAtCA,CADH,CADF;AA2CD,GAhDD;;AAkDO,0BAAP,UAAsB,MAAtB,EAAmC,KAAnC,EAA+C;AAC7C,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD;;AACD,QAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,aAAO,MAAM,CAAC,KAAD,CAAb;AACD;;AAED,WAAO,iCAAC,sBAAD,EAAU;AAAC,eAAS,EAAC,sBAAX;AAAkC,UAAI,EAAC,SAAvC;AAAiD,iBAAW,EAAC;AAA7D,OAAuE,oBAAY,KAAZ,CAAvE,CAAV,CAAP;AACD,GATM;;AAWP,2CAAY,KAAZ,EAA+B;AAA/B;;AACQ;AAAA,QAAE,qBAAF;AAAA,QAAqB,kBAArB;AACN,QAAM,GAAG,GAAG,oBAAE,GAAF,CAAM,MAAN,EAAc,KAAd,KAAwB,CAApC;AACA,QAAM,IAAI,GAAG,oBAAE,GAAF,CAAM,MAAN,EAAc,MAAd,KAAyB,CAAtC;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC,uBAAX;AAAmC,SAAG,EAAC;AAAvC,KAAN,EACG,KAAK,CAAC,GAAN,CAAU,UAAC,IAAD,EAAO,CAAP,EAAQ;AACT;AAAA,UAAG,UAAH;AAAA,UAAM,YAAN;AAAA,UAAU,YAAV;;AACR,UAAM,SAAS,yBACV,oBAAY,WAAZ,CADU,GACc;AAC3B,SAAC,EAAE,CAAC,GAAG,IADoB;AAE3B,SAAC,EAAE,CAAC,GAAG,GAFoB;AAG3B,aAAK,EAAE,EAHoB;AAI3B,cAAM,EAAE,EAJmB;AAK3B,aAAK,EAAE,CALoB;AAM3B,eAAO,EAAE;AANkB,OADd,CAAf;;AASA,UAAM,MAAM,GAAG;AACb,oBAAY,EAAE,KAAI,CAAC,gBAAL,CAAsB,IAAtB,CAA2B,KAA3B,EAAiC,SAAjC,EAA4C,MAA5C,CADD;AAEb,oBAAY,EAAE,KAAI,CAAC,gBAAL,CAAsB,IAAtB,CAA2B,KAA3B,EAAiC,SAAjC,EAA4C,MAA5C,CAFD;AAGb,eAAO,EAAE,KAAI,CAAC,WAAL,CAAiB,IAAjB,CAAsB,KAAtB,EAA4B,SAA5B,EAAuC,MAAvC;AAHI,OAAf;AAMA,aAEE,iCAAC,kBAAD,EAAM;AAAC,WAAG,EAAE,SAAO;AAAb,SAAsB,MAAtB,CAAN,EACI,KAAI,CAAC,WAAL,CAAyB,cAAzB,CAAwC,WAAxC,EAAqD,SAArD,CADJ,CAFF;AAMD,KAvBA,CADH,CADF;AA4BD,GAjCD;;AAmCA;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,gBAAZ;AAAA,QAAmB,kBAAnB;AAAA,QAA2B,oBAA3B;AACN,QAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,QAAI,CAAC,WAAL,EAAkB;AAChB,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,oCAAF;AAAA,QAAmB,gCAAnB;AAAA,QAAkC,wCAAlC;AACN,QAAM,OAAO,GAAG;AAAE,OAAC,EAAE,CAAL;AAAQ,OAAC,EAAE,CAAX;AAAc,WAAK,OAAnB;AAAqB,YAAM;AAA3B,KAAhB;AACA,QAAM,UAAU,GAAG,aAAa,GAC5B,sBAAsB,CAAC,aAAD,EAAgB,iBAAhB,CADM,GAE5B,0BAFJ;AAGA,QAAM,OAAO,GAAG,aAAa,GAAG,mBAAmB,CAAC,aAAD,EAAgB,iBAAhB,EAAmC,OAAnC,CAAtB,GAAoE,EAAjG;AAEA,WAAO,mBAAM,YAAN,CAAmB,WAAnB,EAAgC;AACrC,aAAO,SAD8B;AAErC,YAAM,EAAE,eAF6B;AAGrC,gBAAU,YAH2B;AAIrC,WAAK,EAAE,EAJ8B;AAKrC,aAAO;AAL8B,KAAhC,CAAP;AAOD,GAtBD;;AAwBA;AACE,QAAI,CAAC,iCAAoB,IAApB,CAAL,EAAgC;AAC9B,aAAO,IAAP;AACD;;AAED,QAAM,eAAN;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,wBAAvB;AAAA,QAAkC,gBAAlC;AAAA,QAAyC,sBAAzC;AAAA,QAAmD,0EAAnD;;AACM;AAAA,QAAE,gBAAF;AAAA,QAAS,gBAAT;AACN,QAAM,KAAK,GAAG,oBAAY,MAAZ,CAAd;AAEA,WACE;AACE,eAAS,EAAE,wBAAW,kBAAX,EAA+B,SAA/B,CADb;AAEE,WAAK,wBAAO,KAAP,GAAY;AAAE,gBAAQ,EAAE,UAAZ;AAAwB,cAAM,EAAE,SAAhC;AAA2C,aAAK,OAAhD;AAAkD,cAAM;AAAxD,OAAZ;AAFP,OAIE,iCAAC,oBAAD,EAAQ,aAAK,KAAL,EAAU;AAAE,WAAK,EAAE,KAAT;AAAgB,YAAM,EAAE;AAAxB,KAAV,CAAR,EACG,+BAAkB,QAAlB,CADH,EAEG,KAAK,WAAL,CAAiB,KAAjB,EAAwB,KAAxB,CAFH,EAGG,KAAK,WAAL,CAAiB,KAAjB,CAHH,CAJF,EASG,KAAK,aAAL,EATH,CADF;AAaD,GAtBD;;AAvQO,uBAAc,QAAd;AAEA,wBAAe;AACpB,WAAO,EAAE,MADW;AAEpB,WAAO,EAAE,OAFW;AAGpB,eAAW,EAAE,EAHO;AAIpB,aAAS,EAAE,EAJS;AAKpB,iBAAa,EAAE,GALK;AAMpB,cAAU,EAAE,EANQ;AAOpB,UAAM,EAAE;AAAE,SAAG,EAAE,CAAP;AAAU,WAAK,EAAE,CAAjB;AAAoB,YAAM,EAAE,CAA5B;AAA+B,UAAI,EAAE;AAArC;AAPY,GAAf;AA4RT;AAAC,CA/RD,CAAqB,qBAArB;;AAiSA,qBAAe,MAAf,C;;;;;;;;;;;;;;;;;;;;;;;;ACxpBA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAGA,qBAAe,sCAAyB;AACtC,WAAS,EAAE,cAD2B;AAEtC,gBAAc,EAAE,oBAFsB;AAGtC,WAAS,EAAE,QAH2B;AAItC,gBAAc,EAAE,CACd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GADc,EAEd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAFc,EAGd;AAAE,YAAQ,EAAE,OAAZ;AAAqB,YAAQ,EAAE;AAA/B,GAHc,CAJsB;AAStC,eAAa;AATyB,CAAzB,CAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACPA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEA,IAAM,WAAW,GAAG,SAAd,WAAc,CAAC,EAAD,EAUnB;MATC,gB;MACA,c;MACA,gB;MACA,sB;AAOQ;AACR,MAAM,UAAU,GAAG,KAAK,GAAG,CAA3B;AACA,MAAM,gBAAgB,GACpB,QAAQ,IAAI,QAAQ,CAAC,MAArB,GACI,QAAQ,CAAC,GAAT,CAAa,UAAC,KAAD,EAAqB,CAArB,EAA8B;AACzC,sBAAW,CAAC;AAAE,WAAK,EAAE,UAAT;AAAqB,UAAI,EAAE,KAA3B;AAAkC,WAAK,EAAE,CAAzC;AAA4C,cAAQ;AAApD,KAAD,CAAX;AAAmE,GADrE,CADJ,GAII,IALN;AAMA,MAAI,KAAJ;;AAEA,MAAI,QAAQ,IAAI,QAAQ,CAAC,MAAzB,EAAiC;AAC/B,SAAK,GAAG,gBAAgB,CAAC,MAAjB,CAAwB,UAAC,MAAD,EAAc,KAAd,EAAgC;AAAK,mBAAM,GAAG,KAAK,CAAd;AAAoB,KAAjF,EAAmF,CAAnF,CAAR;AACD,GAFD,MAEO;AAEL,SAAK,GAAG,oBAAE,KAAF,CAAQ,IAAI,CAAC,QAAD,CAAZ,KAAqC,IAAI,CAAC,QAAD,CAAJ,IAA4B,CAAjE,GAAqE,CAArE,GAAyE,IAAI,CAAC,QAAD,CAArF;AACD;;AAED,+BACK,IADL,GACS;AACP,YAAQ,EAAE,gBADH;AAEP,SAAK,OAFE;AAGP,SAAK,OAHE;AAIP,SAAK;AAJE,GADT;AAOD,CAnCD;;AAqCA,IAAM,UAAU,GAAG,SAAb,UAAa,CAAC,IAAD,EAAkB;AAAK,SAAC;AAAE,KAAC,EAAE,IAAI,CAAC,CAAV;AAAa,KAAC,EAAE,IAAI,CAAC,CAArB;AAAwB,SAAK,EAAE,IAAI,CAAC,KAApC;AAA2C,UAAM,EAAE,IAAI,CAAxD;AAAC,GAAD;AAAkE,CAA5G;;AAGA,IAAM,iBAAiB,GAAG,SAApB,iBAAoB,CAAC,QAAD,EAA0B,cAA1B,EAAgD;AACxE,MAAM,KAAK,GAAG,cAAc,GAAG,CAAjB,GAAqB,CAArB,GAAyB,cAAvC;AAEA,SAAO,QAAQ,CAAC,GAAT,CAAa,UAAC,KAAD,EAAmB;AACrC,QAAM,IAAI,GAAG,KAAK,CAAC,KAAN,GAAc,KAA3B;AAEA,iCACK,KADL,GACU;AACR,UAAI,EAAE,oBAAE,KAAF,CAAQ,IAAR,KAAiB,IAAI,IAAI,CAAzB,GAA6B,CAA7B,GAAiC;AAD/B,KADV;AAID,GAPM,CAAP;AAQD,CAXD;;AAcA,IAAM,aAAa,GAAG,SAAhB,aAAgB,CAAC,GAAD,EAAW,UAAX,EAA+B,WAA/B,EAAkD;AACtE,MAAM,UAAU,GAAG,UAAU,GAAG,UAAhC;AACA,MAAM,OAAO,GAAG,GAAG,CAAC,IAAJ,GAAW,GAAG,CAAC,IAA/B;;AACM;AAAA;2CAAA;;AAAA;GAAA,E;;SAML;GANK;AAAA,MAAE,YAAF;AAAA,MAAO,YAAP;;AAQN,SAAO,OAAO,GACV,IAAI,CAAC,GAAL,CAAU,UAAU,GAAG,GAAb,GAAmB,WAApB,GAAmC,OAA5C,EAAqD,OAAO,IAAI,UAAU,GAAG,GAAb,GAAmB,WAAvB,CAA5D,CADU,GAEV,QAFJ;AAGD,CAdD;;AAgBA,IAAM,kBAAkB,GAAG,SAArB,kBAAqB,CAAC,GAAD,EAAW,UAAX,EAA+B,UAA/B,EAAwD,OAAxD,EAAwE;AACjG,MAAI,SAAS,GAAG,UAAU,GAAG,IAAI,CAAC,KAAL,CAAW,GAAG,CAAC,IAAJ,GAAW,UAAtB,CAAH,GAAuC,CAAjE;;AAEA,MAAI,OAAO,IAAI,SAAS,GAAG,UAAU,CAAC,MAAtC,EAA8C;AAC5C,aAAS,GAAG,UAAU,CAAC,MAAvB;AACD;;AAED,MAAI,IAAI,GAAG,UAAU,CAAC,CAAtB;AACA,MAAI,KAAJ;;AACA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,GAAG,CAAC,MAA1B,EAAkC,CAAC,GAAG,GAAtC,EAA2C,CAAC,EAA5C,EAAgD;AAC9C,SAAK,GAAG,GAAG,CAAC,CAAD,CAAX;AACA,SAAK,CAAC,CAAN,GAAU,IAAV;AACA,SAAK,CAAC,CAAN,GAAU,UAAU,CAAC,CAArB;AACA,SAAK,CAAC,MAAN,GAAe,SAAf;AACA,SAAK,CAAC,KAAN,GAAc,IAAI,CAAC,GAAL,CAAS,SAAS,GAAG,IAAI,CAAC,KAAL,CAAW,KAAK,CAAC,IAAN,GAAa,SAAxB,CAAH,GAAwC,CAA1D,EAA6D,UAAU,CAAC,CAAX,GAAe,UAAU,CAAC,KAA1B,GAAkC,IAA/F,CAAd;AACA,QAAI,IAAI,KAAK,CAAC,KAAd;AACD;;AAED,OAAK,CAAC,CAAN,GAAU,IAAV;AAEA,OAAK,CAAC,KAAN,IAAe,UAAU,CAAC,CAAX,GAAe,UAAU,CAAC,KAA1B,GAAkC,IAAjD;AAEA,+BACK,UADL,GACe;AACb,KAAC,EAAE,UAAU,CAAC,CAAX,GAAe,SADL;AAEb,UAAM,EAAE,UAAU,CAAC,MAAX,GAAoB;AAFf,GADf;AAKD,CA3BD;;AA6BA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,GAAD,EAAW,UAAX,EAA+B,UAA/B,EAAwD,OAAxD,EAAwE;AAC/F,MAAI,QAAQ,GAAG,UAAU,GAAG,IAAI,CAAC,KAAL,CAAW,GAAG,CAAC,IAAJ,GAAW,UAAtB,CAAH,GAAuC,CAAhE;;AAEA,MAAI,OAAO,IAAI,QAAQ,GAAG,UAAU,CAAC,KAArC,EAA4C;AAC1C,YAAQ,GAAG,UAAU,CAAC,KAAtB;AACD;;AAED,MAAI,IAAI,GAAG,UAAU,CAAC,CAAtB;AACA,MAAI,KAAJ;;AACA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,GAAG,CAAC,MAA1B,EAAkC,CAAC,GAAG,GAAtC,EAA2C,CAAC,EAA5C,EAAgD;AAC9C,SAAK,GAAG,GAAG,CAAC,CAAD,CAAX;AACA,SAAK,CAAC,CAAN,GAAU,UAAU,CAAC,CAArB;AACA,SAAK,CAAC,CAAN,GAAU,IAAV;AACA,SAAK,CAAC,KAAN,GAAc,QAAd;AACA,SAAK,CAAC,MAAN,GAAe,IAAI,CAAC,GAAL,CAAS,QAAQ,GAAG,IAAI,CAAC,KAAL,CAAW,KAAK,CAAC,IAAN,GAAa,QAAxB,CAAH,GAAuC,CAAxD,EAA2D,UAAU,CAAC,CAAX,GAAe,UAAU,CAAC,MAA1B,GAAmC,IAA9F,CAAf;AACA,QAAI,IAAI,KAAK,CAAC,MAAd;AACD;;AACD,MAAI,KAAJ,EAAW;AACT,SAAK,CAAC,CAAN,GAAU,KAAV;AACA,SAAK,CAAC,MAAN,IAAgB,UAAU,CAAC,CAAX,GAAe,UAAU,CAAC,MAA1B,GAAmC,IAAnD;AACD;;AAED,+BACK,UADL,GACe;AACb,KAAC,EAAE,UAAU,CAAC,CAAX,GAAe,QADL;AAEb,SAAK,EAAE,UAAU,CAAC,KAAX,GAAmB;AAFb,GADf;AAKD,CA3BD;;AA6BA,IAAM,QAAQ,GAAG,SAAX,QAAW,CAAC,GAAD,EAAW,UAAX,EAA+B,UAA/B,EAAwD,OAAxD,EAAwE;AACvF,MAAI,UAAU,KAAK,UAAU,CAAC,KAA9B,EAAqC;AACnC,WAAO,kBAAkB,CAAC,GAAD,EAAM,UAAN,EAAkB,UAAlB,EAA8B,OAA9B,CAAzB;AACD;;AAED,SAAO,gBAAgB,CAAC,GAAD,EAAM,UAAN,EAAkB,UAAlB,EAA8B,OAA9B,CAAvB;AACD,CAND;;AASA,IAAM,QAAQ,GAAG,SAAX,QAAW,CAAC,IAAD,EAAoB,WAApB,EAAuC;AAC9C;;AAER,MAAI,QAAQ,IAAI,QAAQ,CAAC,MAAzB,EAAiC;AAC/B,QAAI,IAAI,GAAG,UAAU,CAAC,IAAD,CAArB;AAEA,QAAM,GAAG,GAAG,EAAZ;AACA,QAAI,IAAI,GAAG,QAAX;AACA,QAAI,KAAK,SAAT;AAAA,QAAW,KAAK,SAAhB;AACA,QAAI,IAAI,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,KAAd,EAAqB,IAAI,CAAC,MAA1B,CAAX;AACA,QAAM,aAAa,GAAG,iBAAiB,CAAC,QAAD,EAAY,IAAI,CAAC,KAAL,GAAa,IAAI,CAAC,MAAnB,GAA6B,IAAI,CAAC,KAA7C,CAAvC;AACA,QAAM,YAAY,GAAG,aAAa,CAAC,KAAd,EAArB;AAEA,OAAG,CAAC,IAAJ,GAAW,CAAX;;AAEA,WAAO,YAAY,CAAC,MAAb,GAAsB,CAA7B,EAAgC;AAG9B,SAAG,CAAC,IAAJ,CAAU,KAAK,GAAG,YAAY,CAAC,CAAD,CAA9B;AACA,SAAG,CAAC,IAAJ,IAAY,KAAK,CAAC,IAAlB;AAEA,WAAK,GAAG,aAAa,CAAC,GAAD,EAAM,IAAN,EAAY,WAAZ,CAArB;;AACA,UAAI,KAAK,IAAI,IAAb,EAAmB;AAEjB,oBAAY,CAAC,KAAb;AACA,YAAI,GAAG,KAAP;AACD,OAJD,MAIO;AAEL,WAAG,CAAC,IAAJ,IAAY,GAAG,CAAC,GAAJ,GAAU,IAAtB;AACA,YAAI,GAAG,QAAQ,CAAC,GAAD,EAAM,IAAN,EAAY,IAAZ,EAAkB,KAAlB,CAAf;AACA,YAAI,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,KAAd,EAAqB,IAAI,CAAC,MAA1B,CAAP;AACA,WAAG,CAAC,MAAJ,GAAa,GAAG,CAAC,IAAJ,GAAW,CAAxB;AACA,YAAI,GAAG,QAAP;AACD;AACF;;AAED,QAAI,GAAG,CAAC,MAAR,EAAgB;AACd,UAAI,GAAG,QAAQ,CAAC,GAAD,EAAM,IAAN,EAAY,IAAZ,EAAkB,IAAlB,CAAf;AACA,SAAG,CAAC,MAAJ,GAAa,GAAG,CAAC,IAAJ,GAAW,CAAxB;AACD;;AAED,iCACK,IADL,GACS;AACP,cAAQ,EAAE,aAAa,CAAC,GAAd,CAAkB,aAAC;AAAI,uBAAQ,CAAC,CAAD,EAAR,WAAQ,CAAR;AAAwB,OAA/C;AADH,KADT;AAID;;AAED,SAAO,IAAP;AACD,CAhDD;;AAwHA,IAAM,YAAY,GAAU;AAC1B,iBAAe,EAAE,KADS;AAG1B,qBAAmB,EAAE,KAHK;AAK1B,YAAU,EAAE,IALc;AAO1B,YAAU,EAAE,IAPc;AAS1B,aAAW,EAAE,IATa;AAW1B,WAAS,EAAE;AAXe,CAA5B;;AAcA;AAAsB;;AAAtB;AAAA;;AAcE,kBAAK,aACA,YADA,CAAL;;AAwHA,+BAAqB;AACX;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc;AACf;AACF,KAPD;;AASA,iCAAuB;AACb;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,wBAAgB;AACjB;AACF,KAPD;;;AAgVD;;AA7cC;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,cAAvB;AAAA,QAA6B,oBAA7B;AAAA,QAAsC,4BAAtC;;AACA;gBAAA;kBAAA;oBAAA;gBAAA;sBAAA;;AAAA;AAAA,QAAE,0BAAF;AAAA,QAAc,4BAAd;AAAA,QAA2B,wBAA3B;;AASN,SAAK,QAAL,CAAc;AACZ,gBAAU,YADE;AAEZ,iBAAW,aAFC;AAGZ,eAAS;AAHG,KAAd;AAKD,GAhBD;;AAkBA,4CAAY,EAAZ,EAcC;QAbC,c;QACA,gB;QACA,kB;QACA,c;QACA,oB;QACA,4B;AASA,QAAM,IAAI,GAAG,WAAW,CAAC;AACvB,WAAK,EAAE,CADgB;AAEvB,UAAI,EAAE;AAAE,gBAAQ,EAAE,IAAZ;AAAkB,SAAC,EAAE,CAArB;AAAwB,SAAC,EAAE,CAA3B;AAA8B,aAAK,OAAnC;AAAqC,cAAM;AAA3C,OAFiB;AAGvB,WAAK,EAAE,CAHgB;AAIvB,cAAQ,EAAE;AAJa,KAAD,CAAxB;AAOA,QAAM,UAAU,GAAG,QAAQ,CAAC,IAAD,EAAO,WAAP,CAA3B;AACQ;;AACR,QAAI,IAAI,KAAK,MAAb,EAAqB;AACnB,eAAS,CAAC,IAAV,CAAe,IAAf;AACD;;AAED,WAAO;AACL,gBAAU,YADL;AAEL,iBAAW,EAAE,IAFR;AAGL,eAAS;AAHJ,KAAP;AAKD,GAjCD;;AAoCA,iEAAiC,SAAjC,EAAiD;AACvC;AAAA,QAAM,uBAAN;AAAA,QAAa,yBAAb;AAAA,QAAqB,qBAArB;AAAA,QAA2B,2BAA3B;AAAA,QAAoC,mCAApC;;AAER,QACE,IAAI,KAAK,KAAK,KAAL,CAAW,IAApB,IACA,IAAI,KAAK,KAAK,KAAL,CAAW,IADpB,IAEA,KAAK,KAAK,KAAK,KAAL,CAAW,KAFrB,IAGA,MAAM,KAAK,KAAK,KAAL,CAAW,MAHtB,IAIA,OAAO,KAAK,KAAK,KAAL,CAAW,OAJvB,IAKA,WAAW,KAAK,KAAK,KAAL,CAAW,WAN7B,EAOE;AACA,UAAM,QAAQ,GAAG,KAAK,WAAL,CAAiB;AAAE,YAAI,MAAN;AAAQ,aAAK,OAAb;AAAe,cAAM,QAArB;AAAuB,YAAI,MAA3B;AAA6B,eAAO,SAApC;AAAsC,mBAAW;AAAjD,OAAjB,CAAjB;AACA,WAAK,QAAL,CAAa,+BACR,YADQ,GAER,QAFQ,GAEA;AACX,iBAAS,EAAE,CAAC,QAAQ,CAAC,WAAV;AADA,OAFA,CAAb;AAKD;AACF,GAlBD;;AAoBA,iDAAiB,IAAjB,EAAoC,CAApC,EAA0C;AAClC;AAAA,QAAE,8BAAF;AAAA,QAAgB,sBAAhB;AACN,QAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,QAAI,WAAJ,EAAiB;AACf,WAAK,QAAL,CACE;AACE,uBAAe,EAAE,IADnB;AAEE,kBAAU,EAAE;AAFd,OADF,EAKE;AACE,YAAI,YAAJ,EAAkB;AAChB,sBAAY,CAAC,IAAD,EAAO,CAAP,CAAZ;AACD;AACF,OATH;AAWD,KAZD,MAYO,IAAI,YAAJ,EAAkB;AACvB,kBAAY,CAAC,IAAD,EAAO,CAAP,CAAZ;AACD;AACF,GAnBD;;AAqBA,iDAAiB,IAAjB,EAAoC,CAApC,EAA0C;AAClC;AAAA,QAAE,8BAAF;AAAA,QAAgB,sBAAhB;AACN,QAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,QAAI,WAAJ,EAAiB;AACf,WAAK,QAAL,CACE;AACE,uBAAe,EAAE,KADnB;AAEE,kBAAU,EAAE;AAFd,OADF,EAKE;AACE,YAAI,YAAJ,EAAkB;AAChB,sBAAY,CAAC,IAAD,EAAO,CAAP,CAAZ;AACD;AACF,OATH;AAWD,KAZD,MAYO,IAAI,YAAJ,EAAkB;AACvB,kBAAY,CAAC,IAAD,EAAO,CAAP,CAAZ;AACD;AACF,GAnBD;;AAuCA,4CAAY,IAAZ,EAA6B;AACrB;AAAA,QAAE,oBAAF;AAAA,QAAW,cAAX;;AACN,QAAI,IAAI,KAAK,MAAT,IAAmB,IAAI,CAAC,QAA5B,EAAsC;AAC9B;AAAA,UAAE,gBAAF;AAAA,UAAS,kBAAT;AAAA,UAAiB,oBAAjB;AAAA,UAA0B,4BAA1B;AACN,UAAM,IAAI,GAAG,WAAW,CAAC;AACvB,aAAK,EAAE,CADgB;AAEvB,YAAI,wBAAO,IAAP,GAAW;AAAE,WAAC,EAAE,CAAL;AAAQ,WAAC,EAAE,CAAX;AAAc,eAAK,OAAnB;AAAqB,gBAAM;AAA3B,SAAX,CAFmB;AAGvB,aAAK,EAAE,CAHgB;AAIvB,gBAAQ,EAAE;AAJa,OAAD,CAAxB;AAOA,UAAM,UAAU,GAAG,QAAQ,CAAC,IAAD,EAAO,WAAP,CAA3B;AAEQ;AACR,eAAS,CAAC,IAAV,CAAe,IAAf;AAEA,WAAK,QAAL,CAAc;AACZ,kBAAU,YADE;AAEZ,mBAAW,EAAE,IAFD;AAGZ,iBAAS;AAHG,OAAd;AAKD;;AACD,QAAI,OAAJ,EAAa;AACX,aAAO,CAAC,IAAD,CAAP;AACD;AACF,GAzBD;;AA2BA,gDAAgB,IAAhB,EAAmC,CAAnC,EAA4C;AACpC;AACA;AAAA,QAAE,gBAAF;AAAA,QAAS,kBAAT;AAAA,QAAiB,oBAAjB;AAAA,QAA0B,4BAA1B;AACN,QAAM,IAAI,GAAG,WAAW,CAAC;AACvB,WAAK,EAAE,CADgB;AAEvB,UAAI,wBAAO,IAAP,GAAW;AAAE,SAAC,EAAE,CAAL;AAAQ,SAAC,EAAE,CAAX;AAAc,aAAK,OAAnB;AAAqB,cAAM;AAA3B,OAAX,CAFmB;AAGvB,WAAK,EAAE,CAHgB;AAIvB,cAAQ,EAAE;AAJa,KAAD,CAAxB;AAOA,QAAM,UAAU,GAAG,QAAQ,CAAC,IAAD,EAAO,WAAP,CAA3B;AAEA,aAAS,GAAG,SAAS,CAAC,KAAV,CAAgB,CAAhB,EAAmB,CAAC,GAAG,CAAvB,CAAZ;AACA,SAAK,QAAL,CAAc;AACZ,gBAAU,YADE;AAEZ,iBAAW,EAAE,IAFD;AAGZ,eAAS;AAHG,KAAd;AAKD,GAlBD;;AAoBA,2CAAW,OAAX,EAAyB,SAAzB,EAAiD,MAAjD,EAAgE;AAAhE;;AACQ;AAAA,QACJ,wCADI;AAAA,QAEJ,kCAFI;AAAA,QAGJ,wCAHI;AAAA,QAIJ,oCAJI;AAAA,QAKJ,oDALI;AAAA,QAMJ,cANI;AAAA,QAOJ,4BAPI;AAAA,QAQJ,0BARI;AAUE;AACA;AAAA,QAAO,yBAAP;AAAA,QAAe,eAAf;AAAA,QAAkB,eAAlB;AAAA,QAAqB,uBAArB;AACR,QAAM,UAAU,GAAG,QAAQ,CAAC,KAAG,CAAC,IAAI,CAAC,MAAL,KAAgB,CAAhB,GAAoB,CAArB,IAA0B,KAA9B,EAAuC,EAAvC,CAA3B;AACA,QAAI,KAAK,GAAG,EAAZ;;AACA,QAAI,MAAM,IAAI,IAAI,KAAK,MAAvB,EAA+B;AAC7B,WAAK,GAAG;AACN,oBAAY,EAAE,KAAK,gBAAL,CAAsB,IAAtB,CAA2B,IAA3B,EAAiC,SAAjC,CADR;AAEN,oBAAY,EAAE,KAAK,gBAAL,CAAsB,IAAtB,CAA2B,IAA3B,EAAiC,SAAjC,CAFR;AAGN,eAAO,EAAE,KAAK,WAAL,CAAiB,IAAjB,CAAsB,IAAtB,EAA4B,SAA5B;AAHH,OAAR;AAKD;;AAED,QAAI,CAAC,iBAAL,EAAwB;AACtB,aACE,iCAAC,kBAAD,EAAM,aAAK,KAAL,CAAN,EACI,KAAK,WAAL,CAAyB,iBAAzB,CACA,OADA,EACO,sBAEF,SAFE,GAEO;AACZ,yBAAiB,EAAE,KADP;AAEZ,+BAAuB,EAAE,KAFb;AAGZ,aAAK,OAHO;AAIZ,cAAM,QAJM;AAKZ,SAAC,GALW;AAMZ,SAAC;AANW,OAFP,CADP,EAWA,IAXA,EAYA,UAZA,CADJ,CADF;AAkBD;;AAED,WACE,iCAAC,yBAAD,EAAO;AACL,WAAK,EAAE,cADF;AAEL,cAAQ,EAAE,iBAFL;AAGL,cAAQ,EAAE,iBAHL;AAIL,YAAM,EAAE,eAJH;AAKL,SAAG,EAAE,aAAW,WALX;AAML,UAAI,EAAE;AAAE,SAAC,GAAH;AAAK,SAAC,GAAN;AAAQ,aAAK,OAAb;AAAe,cAAM;AAArB,OAND;AAOL,QAAE,EAAE;AAAE,SAAC,GAAH;AAAK,SAAC,GAAN;AAAQ,aAAK,OAAb;AAAe,cAAM;AAArB,OAPC;AAQL,sBAAgB,EAAE,KAAK,oBARlB;AASL,oBAAc,EAAE,KAAK;AAThB,KAAP,EAWG,UAAC,EAAD,EAA0E;UAAvE,Y;UAAU,Y;UAAU,oB;UAAkB,sB;AAAsC,aAC9E,iCAAC,yBAAD,EAAO;AACL,YAAI,EAAE,eAAa,UAAb,GAAuB,MAAvB,GAA8B,UAA9B,GAAwC,KADzC;AAEL,UAAE,EAAC,iBAFE;AAGL,qBAAa,EAAC,WAHT;AAIL,aAAK,EAAE,cAJF;AAKL,cAAM,EAAE,eALH;AAML,gBAAQ,EAAE,iBANL;AAOL,gBAAQ,EAAE;AAPL,OAAP,EASE,iCAAC,kBAAD,EAAM,aAAK,KAAL,CAAN,EACI;AAEA,YAAI,KAAK,GAAG,CAAR,IAAa,CAAC,mBAAlB,EAAuC;AACrC,iBAAO,IAAP;AACD;;AACD,eAAQ,KAAI,CAAC,WAAL,CAAyB,iBAAzB,CACN,OADM,EACC,sBAEF,SAFE,GAEO;AACZ,2BAAiB,mBADL;AAEZ,iCAAuB,EAAE,CAAC,uBAFd;AAGZ,eAAK,EAAE,SAHK;AAIZ,gBAAM,EAAE,UAJI;AAKZ,WAAC,EAAE,KALS;AAMZ,WAAC,EAAE;AANS,SAFP,CADD,EAWN,IAXM,EAYN,UAZM,CAAR;AAcD,OAnBA,EADH,CATF,CAD8E;AAiC/E,KA5CH,CADF;AAgDD,GA5FD;;AA8FO,8BAAP,UACE,OADF,EAEE,SAFF,EAGE,IAHF,EAIE,UAJF,EAIsB;AAEpB,QAAI,mBAAM,cAAN,CAAqB,OAArB,CAAJ,EAAmC;AACjC,aAAO,mBAAM,YAAN,CAAmB,OAAnB,EAA4B,SAA5B,CAAP;AACD;;AACD,QAAI,oBAAE,UAAF,CAAa,OAAb,CAAJ,EAA2B;AACzB,aAAO,OAAO,CAAC,SAAD,CAAd;AACD;;AAEO;AAAA,QAAG,eAAH;AAAA,QAAM,uBAAN;AAAA,QAAa,yBAAb;AAAA,QAAqB,uBAArB;AACR,QAAI,KAAK,GAAG,IAAZ;;AACA,QAAI,KAAK,GAAG,EAAR,IAAc,MAAM,GAAG,EAAvB,IAA6B,SAAS,CAAC,QAAvC,IAAmD,IAAI,KAAK,MAAhE,EAAwE;AACtE,WAAK,GACH,iCAAC,oBAAD,EAAQ;AACN,cAAM,EAAE,CACN;AAAE,WAAC,EAAE,CAAC,GAAG,CAAT;AAAY,WAAC,EAAE,CAAC,GAAG,MAAM,GAAG;AAA5B,SADM,EAEN;AAAE,WAAC,EAAE,CAAC,GAAG,CAAT;AAAY,WAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAb,GAAiB;AAAhC,SAFM,EAGN;AAAE,WAAC,EAAE,CAAC,GAAG,CAAT;AAAY,WAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAb,GAAiB;AAAhC,SAHM;AADF,OAAR,CADF;AASD;;AACD,QAAI,IAAI,GAAG,IAAX;AACA,QAAM,QAAQ,GAAG,yBAAc,SAAS,CAAC,IAAxB,CAAjB;;AACA,QAAI,KAAK,GAAG,EAAR,IAAc,MAAM,GAAG,EAAvB,IAA6B,QAAQ,CAAC,KAAT,GAAiB,KAA9C,IAAuD,QAAQ,CAAC,MAAT,GAAkB,MAA7E,EAAqF;AACnF,UAAI,GACF;AAAM,SAAC,EAAE,CAAC,GAAG,CAAb;AAAgB,SAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAb,GAAiB,CAApC;AAAuC,gBAAQ,EAAE;AAAjD,SACG,SAAS,CAAC,IADb,CADF;AAKD;;AAED,QAAM,MAAM,GAAG,UAAU,IAAI,uBAA7B;AACA,WACE,4CACE,iCAAC,sBAAD,EAAU;AACR,UAAI,EAAE,SAAS,CAAC,KAAV,GAAkB,CAAlB,GAAsB,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,MAAhB,CAA5B,GAAsD,qBADpD;AAER,YAAM,EAAC;AAFC,OAGJ,oBAAE,IAAF,CAAO,SAAP,EAAkB,UAAlB,CAHI,CAAV,CADF,EAMG,KANH,EAOG,IAPH,CADF;AAWD,GAhDM;;AAkDP,2CAAW,IAAX,EAA8B,IAA9B,EAAiD,CAAjD,EAA0D;AAA1D;;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,cAAX;;AACN,QAAM,SAAS,kCAAQ,oBAAY,KAAK,KAAjB,CAAR,GAAoC,IAApC,GAAwC;AAAE,UAAI;AAAN,KAAxC,CAAf;;AACA,QAAM,MAAM,GAAG,CAAC,IAAI,CAAC,QAAN,IAAkB,CAAC,IAAI,CAAC,QAAL,CAAc,MAAhD;AAEQ;AACR,QAAM,kBAAkB,GAAG,CAAC,WAAW,CAAC,QAAZ,IAAwB,EAAzB,EAA6B,MAA7B,CACzB,UAAC,IAAD,EAAkB;AAAK,iBAAI,CAAC,KAAL,KAAe,IAAI,CAAC,KAApB,IAA6B,IAAI,CAAC,IAAL,KAAc,IAAI,CAA/C;AAAoD,KADlD,CAA3B;;AAIA,QAAI,CAAC,kBAAkB,CAAC,MAApB,IAA8B,IAAI,CAAC,KAAnC,IAA4C,IAAI,KAAK,MAAzD,EAAiE;AAC/D,aAAO,IAAP;AACD;;AACD,WAEE,iCAAC,kBAAD,EAAM;AAAC,SAAG,EAAE,2BAAyB,CAA/B;AAAoC,eAAS,EAAE,4BAA0B,IAAI,CAAC;AAA9E,KAAN,EACG,KAAK,UAAL,CAAgB,OAAhB,EAAyB,SAAzB,EAAoC,MAApC,CADH,EAEG,IAAI,CAAC,QAAL,IAAiB,IAAI,CAAC,QAAL,CAAc,MAA/B,GACG,IAAI,CAAC,QAAL,CAAc,GAAd,CAAkB,UAAC,KAAD,EAAqB,KAArB,EAAkC;AAAK,kBAAI,CAAC,UAAL,CAAgB,IAAhB,EAAsB,KAAtB;AAAmC,KAA5F,CADH,GAEG,IAJN,CAFF;AASD,GAtBD;;AAwBA;AACU;;AAER,QAAI,CAAC,UAAL,EAAiB;AACf,aAAO,IAAP;AACD;;AAED,WAAO,KAAK,UAAL,CAAgB,UAAhB,EAA4B,UAA5B,EAAwC,CAAxC,CAAP;AACD,GARD;;AAUA;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,oBAAZ;AACN,QAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,QAAI,CAAC,WAAL,EAAkB;AAChB,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,gBAAF;AAAA,QAAS,kBAAT;AAAA,QAAiB,oBAAjB;AACA;AAAA,QAAE,oCAAF;AAAA,QAAmB,0BAAnB;AACN,QAAM,OAAO,GAAG;AAAE,OAAC,EAAE,CAAL;AAAQ,OAAC,EAAE,CAAX;AAAc,WAAK,OAAnB;AAAqB,YAAM;AAA3B,KAAhB;AACA,QAAM,UAAU,GAAG,UAAU,GACzB;AACE,OAAC,EAAE,UAAU,CAAC,CAAX,GAAe,UAAU,CAAC,KAAX,GAAmB,CADvC;AAEE,OAAC,EAAE,UAAU,CAAC,CAAX,GAAe,UAAU,CAAC,MAAX,GAAoB;AAFxC,KADyB,GAKzB,IALJ;AAMA,QAAM,OAAO,GACX,eAAe,IAAI,UAAnB,GACI,CACE;AACE,aAAO,EAAE,UADX;AAEE,UAAI,EAAE,+BAAkB,UAAlB,EAA8B,OAA9B,EAAuC,EAAvC,CAFR;AAGE,WAAK,EAAE,+BAAkB,UAAlB,EAA8B,OAA9B;AAHT,KADF,CADJ,GAQI,EATN;AAWA,WAAO,mBAAM,YAAN,CAAmB,WAAnB,EAAoF;AACzF,aAAO,SADkF;AAEzF,YAAM,EAAE,eAFiF;AAGzF,gBAAU,YAH+E;AAIzF,WAAK,EAAE,EAJkF;AAKzF,aAAO;AALkF,KAApF,CAAP;AAOD,GAnCD;;AAsCA;AAAA;;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,sCAAX;AACE;AAER,WACE;AAAK,eAAS,EAAC,qCAAf;AAAqD,WAAK,EAAE;AAAE,iBAAS,EAAE,KAAb;AAAoB,iBAAS,EAAE;AAA/B;AAA5D,OACG,SAAS,CAAC,GAAV,CAAc,UAAC,IAAD,EAAoB,CAApB,EAA6B;AAE1C,UAAM,IAAI,GAAG,oBAAE,GAAF,CAAM,IAAN,EAAY,OAAZ,EAA+B,MAA/B,CAAb;AACA,UAAI,OAAO,GAAG,IAAd;;AACA,UAAI,mBAAM,cAAN,CAAqB,gBAArB,CAAJ,EAA4C;AAC1C,eAAO,GAAG,mBAAM,YAAN,CAAmB,gBAAnB,EAAqC,IAArC,EAA2C,CAA3C,CAAV;AACD;;AACD,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,eAAO,GAAG,gBAAgB,CAAC,IAAD,EAAO,CAAP,CAA1B;AACD,OAFD,MAEO;AACL,eAAO,GAAG,IAAV;AACD;;AAED,aAEE;AACE,eAAO,EAAE,KAAI,CAAC,eAAL,CAAqB,IAArB,CAA0B,KAA1B,EAAgC,IAAhC,EAAsC,CAAtC,CADX;AAEE,WAAG,EAAE,gBAAc,sBAFrB;AAGE,iBAAS,EAAC,iCAHZ;AAIE,aAAK,EAAE;AACL,gBAAM,EAAE,SADH;AAEL,iBAAO,EAAE,cAFJ;AAGL,iBAAO,EAAE,OAHJ;AAIL,oBAAU,EAAE,MAJP;AAKL,eAAK,EAAE,MALF;AAML,qBAAW,EAAE;AANR;AAJT,SAaG,OAbH,CAFF;AAkBD,KA/BA,CADH,CADF;AAoCD,GAxCD;;AA0CA;AACE,QAAI,CAAC,iCAAoB,IAApB,CAAL,EAAgC;AAC9B,aAAO,IAAP;AACD;;AAED,QAAM,eAAN;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,wBAAvB;AAAA,QAAkC,gBAAlC;AAAA,QAAyC,sBAAzC;AAAA,QAAmD,cAAnD;AAAA,QAAyD,kFAAzD;;AACA,QAAM,KAAK,GAAG,oBAAY,MAAZ,CAAd;AAEA,WACE;AACE,eAAS,EAAE,wBAAW,kBAAX,EAA+B,SAA/B,CADb;AAEE,WAAK,wBAAO,KAAP,GAAY;AAAE,gBAAQ,EAAE,UAAZ;AAAwB,cAAM,EAAE,SAAhC;AAA2C,aAAK,OAAhD;AAAkD,cAAM;AAAxD,OAAZ;AAFP,OAIE,iCAAC,oBAAD,EAAQ,aAAK,KAAL,EAAU;AAAE,WAAK,EAAE,KAAT;AAAgB,YAAM,EAAE,IAAI,KAAK,MAAT,GAAkB,MAAM,GAAG,EAA3B,GAAgC;AAAxD,KAAV,CAAR,EACG,KAAK,cAAL,EADH,EAEG,+BAAkB,QAAlB,CAFH,CAJF,EAQG,KAAK,aAAL,EARH,EASG,IAAI,KAAK,MAAT,IAAmB,KAAK,eAAL,EATtB,CADF;AAaD,GArBD;;AAxcO,wBAAc,SAAd;AAEA,yBAAe;AACpB,eAAW,EAAE,OAAO,IAAI,IAAI,CAAC,IAAL,CAAU,CAAV,CAAX,CADO;AAEpB,WAAO,EAAE,OAFW;AAGpB,QAAI,EAAE,MAHc;AAIpB,qBAAiB,EAAE,CAAC,oBAAO,KAJP;AAKpB,2BAAuB,EAAE,CAAC,oBAAO,KALb;AAMpB,kBAAc,EAAE,CANI;AAOpB,qBAAiB,EAAE,IAPC;AAQpB,mBAAe,EAAE;AARG,GAAf;AA4dT;AAAC,CA/dD,CAAsB,qBAAtB;;AAieA,qBAAe,OAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACrwBA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEA;;AAWA;;AACA;;AACA;;AACA;;AACA;;AAsBA;;AACA;;AACA;;AACA;;AACA;;AAcA,IAAM,UAAU,GAAG;AACjB,OAAK,EAAE,CAAC,QAAD,EAAW,KAAX,CADU;AAEjB,OAAK,EAAE,CAAC,MAAD,EAAS,OAAT;AAFU,CAAnB;AAKA,IAAM,gBAAgB,GAAe;AAAE,GAAC,EAAE,CAAL;AAAQ,GAAC,EAAE;AAAX,CAArC;;AA8FA,IAAM,wBAAwB,GAAG,SAA3B,wBAA2B,CAAC,EAAD,EAQP;MAPxB,wB;MACA,kC;MACA,iB;MAAA,uC;MACA,kC;MACA,gC;MACA,gC;MACA,8B;;;;;AAEsC;;AAsFpC,qCAAY,KAAZ,EAAwC;AAAxC,kBACE,kBAAM,KAAN,KAAY,IADd;;AAgJA,+BAAmB,UACjB,KADiB,EAEjB,EAFiB,EAE4E;YAA3F,c;YAAM,kC;YAAgB,sB;YAAU,wB;YAAW,4B;YAAa,kC;YAAgB,8B;AAElE;AAAA,YAAQ,yBAAR;AAAA,YAAkB,+BAAlB;AACR,YAAM,aAAa,GAAG,+BAAkB,MAAlB,EAA0B,QAA1B,CAAtB;AAGA,YAAM,OAAO,GAAG,IAAI,CAAC,MAAL,CAAY,UAAC,MAAD,EAAc,KAAd,EAAwB;;;AAC5C;AAAA,cAAE,cAAF;AAAA,cAAQ,oBAAR;AAAA,cAAiB,wCAAjB;AAAA,cAAoC,oDAApC;AAAA,cAA6D,gBAA7D;AAAA,cAAoE,gBAApE;AACN,cAAM,MAAM,GAAG,KAAK,CAAC,KAAN,CAAY,SAAZ,CAAf;AACA,cAAM,aAAa,GAAG,uBAAuB,CAAC,gBAAxB,CAAyC,KAAzC,EAAgD;AACpE,0BAAc,EAAE,cAAc,CAAC,MAAf,CAAsB,UAAC,IAAD,EAAU;AAAK,yBAAI,CAAC,KAAL,CAAW,SAAX;AAAgC,aAArE,CADoD;AAEpE,0BAAc,gBAFsD;AAGpE,wBAAY;AAHwD,WAAhD,CAAtB;AAKA,cAAM,GAAG,GAAG,aAAa,CAAC,MAA1B;;AAEA,cAAI,CAAC,MAAM,CAAC,MAAD,CAAX,EAAqB;AACnB,gBAAI,MAAM,SAAV;AAAA,gBAAY,eAAe,SAA3B;AAAA,gBAA6B,iBAAiB,SAA9C;;AAEA,gBAAI,OAAJ,EAAa;AAEX,oBAAM,GAAG,kCAAqB,aAArB,EAAoC,OAApC,EAA6C,IAA7C,CAAT;;AAEA,kBAAI,IAAI,KAAK,UAAT,IAAuB,aAA3B,EAA0C;AAExC,oBAAM,SAAS,GAAG,yBAAa,MAAb,CAAlB;;AAEA,oBAAI,uBAAuB,IAAI,SAA/B,EAA0C;AACxC,iCAAe,GAAG,MAAlB;AAEA,wBAAM,GAAG,oBAAE,KAAF,CAAQ,CAAR,EAAW,GAAX,CAAT;AACD,iBAJD,MAIO,IAAI,CAAC,uBAAL,EAA8B;AAEnC,wBAAM,GAAG,uCAA0B,KAAK,CAAC,KAAN,CAAY,MAAtC,EAA8C,MAA9C,EAAsD,KAAtD,EAA6D,MAA7D,CACP,UAAC,WAAD,EAAmB,KAAnB,EAA6B;AAC3B,sCAAW,CAAC,OAAZ,CAAoB,KAApB,KAA8B,CAA9B,GAAkC,WAAlC,GAA+C,eAAK,WAAL,EAAgB,CAAE,KAAF,CAAhB,CAA/C;AAAuE,mBAFlE,EAGP,EAHO,CAAT;AAKD;AACF,eAhBD,MAgBO,IAAI,IAAI,KAAK,UAAb,EAAyB;AAE9B,oBAAI,CAAC,uBAAL,EAA8B;AAC5B,wBAAM,GAAG,uCAA0B,KAAK,CAAC,KAAN,CAAY,MAAtC,EAA8C,MAA9C,EAAsD,KAAtD,EAA6D,MAA7D,CACP,UAAC,WAAD,EAAmB,KAAnB,EAA6B;AAC3B,sCAAW,CAAC,OAAZ,CAAoB,KAApB,KAA8B,CAA9B,IAAmC,KAAK,KAAK,EAA7C,IAAmD,oBAAE,KAAF,CAAQ,KAAR,CAAnD,GACI,WADJ,GAEG,eAAK,WAAL,EAAgB,CAAE,KAAF,CAAhB,CAFH;AAE2B,mBAJtB,EAKP,EALO,CAAT;AAOD,iBARD,MAQO;AAEL,wBAAM,GAAG,MAAM,CAAC,MAAP,CAAc,UAAC,KAAD,EAAW;AAAK,gCAAK,KAAK,EAAV,IAAgB,CAAC,oBAAE,KAAF,CAAjB,KAAiB,CAAjB;AAA+B,mBAA7D,CAAT;AACD;AACF,eAdM,MAcA,IAAI,IAAI,KAAK,QAAb,EAAuB;AAE5B,oBAAM,eAAe,GAAG,kCACtB,aADsB,EAEtB,cAAc,CAAC,MAAf,CAAsB,UAAC,IAAD,EAAU;AAAK,6BAAI,CAAC,KAAL,CAAW,SAAX,MAA0B,MAA1B,IAAoC,CAAC,IAAI,CAAC,KAAL,CAArC;AAAoD,iBAAzF,CAFsB,EAGtB,OAHsB,EAItB,QAJsB,CAAxB;;AAOA,oBAAI,eAAJ,EAAqB;AACnB,wBAAM,GAAG,eAAT;AACD;AACF;;AAED,kBAAI,aAAa,KAAK,IAAI,KAAK,QAAT,IAAqB,KAAK,KAAK,MAApC,CAAjB,EAA8D;AAC5D,iCAAiB,GAAG,kCAAqB,aAArB,EAAoC,OAApC,EAA6C,UAA7C,CAApB;AACD;AACF,aAnDD,MAmDO,IAAI,aAAJ,EAAmB;AAExB,oBAAM,GAAG,oBAAE,KAAF,CAAQ,CAAR,EAAW,GAAX,CAAT;AACD,aAHM,MAGA,IAAI,WAAW,IAAI,WAAW,CAAC,MAAD,CAA1B,IAAsC,WAAW,CAAC,MAAD,CAAX,CAAoB,QAA1D,IAAsE,IAAI,KAAK,QAAnF,EAA6F;AAElG,oBAAM,GACJ,WAAW,KAAK,QAAhB,GACI,CAAC,CAAD,EAAI,CAAJ,CADJ,GAEI,oCAAuB,WAAW,CAAC,MAAD,CAAX,CAAoB,WAA3C,EAAwD,cAAxD,EAAwE,YAAxE,CAHN;AAID,aANM,MAMA;AACL,oBAAM,GAAG,0CACP,aADO,EAEP,cAAc,CAAC,MAAf,CAAsB,UAAC,IAAD,EAAU;AAAK,2BAAI,CAAC,KAAL,CAAW,SAAX,MAA0B,MAA1B,IAAoC,CAAC,IAAI,CAAC,KAAL,CAArC;AAAoD,eAAzF,CAFO,EAGP,IAHO,EAIP,IAJO,CAAT;AAMD;;AAED,gBAAI,IAAI,KAAK,QAAb,EAAuB;AAErB,oBAAM,GAAG,8DAA8B,QAA9B,EAAwC,MAAxC,EAAgD,MAAhD,EAAwD,QAAxD,EAAkE,KAAlE,CAAT;;AAEA,kBAAI,KAAK,CAAC,KAAN,CAAY,MAAhB,EAAwB;AACtB,sBAAM,GAAG,kCAAqB,KAAK,CAAC,KAAN,CAAY,MAAjC,EAAyC,MAAzC,EAAiD,iBAAjD,CAAT;AACD;AACF,aAPD,MAOO,IAAI,IAAI,KAAK,UAAT,IAAuB,KAAK,CAAC,KAAN,CAAY,MAAvC,EAA+C;AACpD,kBAAM,YAAU,GAAG,KAAK,CAAC,KAAN,CAAY,MAA/B;AACA,kBAAM,gBAAgB,GAAG,MAAM,CAAC,KAAP,CAAa,UAAC,KAAD,EAAuB;AAAK,mCAAU,CAAC,OAAX,CAAmB,KAAnB;AAA8B,eAAvE,CAAzB;;AAEA,kBAAI,gBAAJ,EAAsB;AACpB,sBAAM,GAAG,YAAT;AACD;AACF;;AAED,yCACK,MADL,IACW,YACR,MADQ,IACF,sBACF,KAAK,CAAC,KADJ,GACS;AACd,sBAAQ,UADM;AAEd,oBAAM,QAFQ;AAGd,+BAAiB,mBAHH;AAId,6BAAe,iBAJD;AAKd,4BAAc,EAAE,KAAK,CAAC,KAAN,CAAY,MALd;AAMd,2BAAa,eANC;AAOd,oBAAM;AAPQ,aADT,CADE,EASD,EAVV;AAaD;;AAED,iBAAO,MAAP;AACD,SAlHe,EAkHb,EAlHa,CAAhB;AAmHA,eAAO,OAAP;AACD,OA5HD;;AA2IA,gCAAoB,UAClB,KADkB,EAElB,EAFkB,EAE2E;YAA3F,kC;YAAgB,c;YAAM,sB;YAAU,wB;YAAW,4B;YAAa,kC;YAAgB,8B;AAElE;AAAA,YAAQ,yBAAR;AACR,YAAM,aAAa,GAAG,uBAAuB,CAAC,gBAAxB,CAAyC,KAAzC,EAAgD;AACpE,wBAAc,gBADsD;AAEpE,wBAAc,gBAFsD;AAGpE,sBAAY;AAHwD,SAAhD,CAAtB;AAKA,YAAM,GAAG,GAAG,aAAa,CAAC,MAA1B;AACA,YAAM,aAAa,GAAG,+BAAkB,MAAlB,EAA0B,QAA1B,CAAtB;AACA,YAAI,KAAK,GAAG,CAAC,CAAb;AAMA,YAAM,OAAO,GAAG,cAAc,CAAC,MAAf,CAAsB,UAAC,MAAD,EAAc,KAAd,EAAwB;;;AAC5D,cAAM,MAAM,GAAG,KAAK,CAAC,KAAN,CAAY,SAAZ,CAAf;;AAEA,cAAI,CAAC,MAAM,CAAC,MAAD,CAAX,EAAqB;AACnB,iBAAK;AACL,gBAAI,MAAM,SAAV;;AAEA,gBAAI,aAAJ,EAAmB;AACjB,oBAAM,GAAG,oBAAE,KAAF,CAAQ,CAAR,EAAW,GAAX,CAAT;AACD,aAFD,MAEO,IAAI,WAAW,IAAI,WAAW,CAAC,MAAD,CAA1B,IAAsC,WAAW,CAAC,MAAD,CAAX,CAAoB,QAA9D,EAAwE;AAC7E,oBAAM,GAAG,oCAAuB,WAAW,CAAC,MAAD,CAAX,CAAoB,WAA3C,EAAwD,cAAxD,EAAwE,YAAxE,CAAT;AACA,oBAAM,GAAG,8DAA8B,QAA9B,EAAwC,MAAxC,EAAgD,MAAhD,EAAwD,QAAxD,CAAT;AACD,aAHM,MAGA;AACL,oBAAM,GAAG,kCACP,IAAI,CAAC,YAAL,CAAkB,MADX,EAEP,0CACE,aADF,EAEE,cAAc,CAAC,MAAf,CAAsB,UAAC,IAAD,EAAU;AAAK,2BAAI,CAAC,KAAL,CAAW,SAAX,MAA0B,MAA1B,IAAoC,CAAC,IAAI,CAAC,KAAL,CAArC;AAAoD,eAAzF,CAFF,EAGE,QAHF,CAFO,EAOP,IAAI,CAAC,YAAL,CAAkB,iBAPX,CAAT;AASA,oBAAM,GAAG,8DAA8B,QAA9B,EAAwC,MAAxC,EAAgD,MAAhD,EAAwD,QAAxD,CAAT;AACD;;AAED,yCACK,MADL,IACW,YACR,MADQ,IACF;AACL,sBAAQ;AADH,eAEF,IAAI,CAAC,YAFH,GAEe;AACpB,kBAAI,EAAE,IADc;AAEpB,yBAAW,EAAE,oBAAE,GAAF,CAAM,UAAN,EAAqB,QAAQ,MAAR,GAAY,KAAK,GAAG,CAAzC,EAA8C,IAA9C,CAFO;AAGpB,oBAAM,QAHc;AAIpB,4BAAc,EAAE,IAAI,CAAC,YAAL,CAAkB,MAJd;AAKpB,2BAAa,eALO;AAMpB,oBAAM;AANc,aAFf,CADE,EASD,EAVV;AAeD;;AAED,iBAAO,MAAP;AACD,SA3Ce,EA2Cb,EA3Ca,CAAhB;AA6CA,eAAO,OAAP;AACD,OAhED;;AAqlBA,qCAAyB,UAAC,GAAD,EAAS;AAChC,YAAI,GAAG,IAAI,KAAI,CAAC,cAAhB,EAAgC;AACxB;AAAA,cAAE,kCAAF;AAAA,cAAkB,8BAAlB;AAAA,cAAgC,sBAAhC;;AAEN,eAAI,CAAC,QAAL,CACE,KAAI,CAAC,yCAAL,CAA+C;AAC7C,iBAAK,EAAE,KAAI,CAAC,KADiC;AAE7C,0BAAc,gBAF+B;AAG7C,wBAAY,cAHiC;AAI7C,oBAAQ;AAJqC,WAA/C,CADF;AAQD;AACF,OAbD;;AAeA,qCAAyB,UAAC,GAAD,EAAW,OAAX,EAAyB,IAAzB,EAAkC;AACnD;AAAA,YAAE,kBAAF;AAAA,YAAU,kBAAV;AACE;;AAER,YAAI,MAAM,KAAK,GAAX,IAAkB,OAAO,KAAK,KAAI,CAAC,aAAvC,EAAsD;AAC5C;AAAA,cAAgB,gCAAhB;;AAER,cAAI,CAAC,oBAAE,KAAF,CAAQ,IAAI,CAAC,cAAb,CAAD,IAAiC,CAAC,oBAAE,KAAF,CAAQ,IAAI,CAAC,YAAb,CAAtC,EAAkE;AAChE,iBAAI,CAAC,QAAL,CAAa;AACX,4BAAc,gBADH;AAEX,0BAAY;AAFD,eAGR,KAAI,CAAC,yCAAL,CAA+C;AAChD,mBAAK,EAAE,KAAI,CAAC,KADoC;AAEhD,4BAAc,gBAFkC;AAGhD,0BAAY,cAHoC;AAIhD,sBAAQ;AAJwC,aAA/C,CAHQ,CAAb;AAUD,WAXD,MAWO,IAAI,CAAC,oBAAE,KAAF,CAAQ,IAAI,CAAC,kBAAb,CAAL,EAAuC;AACpC;AAAA,gBAAQ,oBAAR;AAAA,gBAAgB,4CAAhB;AACF;AAAA,gBAAE,kBAAF;AAAA,gBAAU,8BAAV;;AACN,gBAAI,CAAC,MAAL,EAAa;AACX;AACD;;AACD,gBAAM,OAAO,yBAAiB,MAAjB,GAAuB;AAAE,eAAC,EAAE,MAAM,CAAC,IAAZ;AAAkB,eAAC,EAAE,MAAM,CAAC;AAA5B,aAAvB,CAAb;;AAGA,gBAAM,cAAc,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,OAAO,CAAC,CAAR,GAAY,OAAO,CAAC,KAArC,CAAvB;AACA,gBAAM,cAAc,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,OAAO,CAAC,CAAR,GAAY,OAAO,CAAC,MAArC,CAAvB;AACA,gBAAM,WAAW,GAAG,YAAY,CAAC,kBAAD,CAAZ,IAAoC,YAAY,CAAC,kBAAD,CAAZ,CAAiC,KAAzF;;AACA,gBAAM,aAAa,GAAQ,KAAI,CAAC,iBAAL,CAAuB,kBAAvB,CAA3B;;AACA,gBAAM,gBAAgB,GAAG,YAAY,CAAC,kBAAD,CAAZ,GACrB;AACE,eAAC,EAAE,MAAM,KAAK,YAAX,GAA0B,YAAY,CAAC,kBAAD,CAAZ,CAAiC,UAA3D,GAAwE,cAD7E;AAEE,eAAC,EAAE,MAAM,KAAK,YAAX,GAA0B,cAA1B,GAA2C,YAAY,CAAC,kBAAD,CAAZ,CAAiC;AAFjF,aADqB,GAKrB,gBALJ;;AAOA,iBAAI,CAAC,QAAL,CAAa,sBAAM,IAAN,GAAU;AAAE,yBAAW,aAAb;AAAe,8BAAgB,kBAA/B;AAAiC,2BAAa;AAA9C,aAAV,CAAb;AACD,WArBM,MAqBA;AACL,iBAAI,CAAC,QAAL,CAAc,IAAd;AACD;AACF;AACF,OA3CD;;AA6CA,gCAAoB,UAAC,EAAD,EAA8B;YAA3B,0B;YAAY,sB;;AAEjC,YAAI,UAAU,KAAK,KAAI,CAAC,KAAL,CAAW,cAA1B,IAA4C,QAAQ,KAAK,KAAI,CAAC,KAAL,CAAW,YAAxE,EAAsF;AAC5E;;AAER,eAAI,CAAC,QAAL,CAAc;AAAM;AAClB,4BAAc,EAAE,UADE;AAElB,0BAAY,EAAE;AAFI,eAGf,KAAI,CAAC,yCAAL,CAA+C;AAChD,mBAAK,EAAE,KAAI,CAAC,KADoC;AAEhD,4BAAc,EAAE,UAFgC;AAGhD,0BAAY,EAAE,QAHkC;AAIhD,sBAAQ;AAJwC,aAA/C,CAHe;AASlB,WATF;;AAWA,eAAI,CAAC,gBAAL,CAAsB;AACpB,0BAAc,EAAE,UADI;AAEpB,wBAAY,EAAE;AAFM,WAAtB;AAID;AACF,OArBD;;AA4BA,+BAAmB,UAAC,CAAD,EAAO;AAChB;;AACR,YAAM,KAAK,GAAG,KAAI,CAAC,YAAL,CAAkB,CAAlB,CAAd;;AAEA,YAAI,KAAJ,EAAW;AACT,cAAM,SAAS,yBAA+B,KAA/B,GAAoC;AAAE,2BAAe,EAAE;AAAnB,WAApC,CAAf;;AACA,eAAI,CAAC,QAAL,CAAc,SAAd;;AACA,eAAI,CAAC,gBAAL,CAAsB,SAAtB;;AAEA,cAAI,oBAAE,UAAF,CAAa,YAAb,CAAJ,EAAgC;AAC9B,wBAAY,CAAC,SAAD,EAAY,CAAZ,CAAZ;AACD;AACF;AACF,OAbD;;AAeA,sCAA0B,UAAC,CAAD,EAAO;AACvB;;AACR,YAAM,KAAK,GAAG,KAAI,CAAC,YAAL,CAAkB,CAAlB,CAAd;;AACA,YAAM,SAAS,GAA0B,KAAK,GAAE,sBAAM,KAAN,GAAW;AAAE,yBAAe,EAAE;AAAnB,SAAX,CAAF,GAAyC;AAAE,yBAAe,EAAE;AAAnB,SAAvF;;AAEA,aAAI,CAAC,QAAL,CAAc,SAAd;;AACA,aAAI,CAAC,gBAAL,CAAsB,SAAtB;;AAEA,YAAI,oBAAE,UAAF,CAAa,WAAb,CAAJ,EAA+B;AAC7B,qBAAW,CAAC,SAAD,EAAY,CAAZ,CAAX;AACD;AACF,OAXD;;AAkBA,mCAAuB,UAAC,EAAD,EAAQ;AAC7B,aAAI,CAAC,QAAL,CAAc;AAAM,iBAAC;AACnB,2BAAe,EAAE,IADE;AAEnB,sBAAU,EAAE,EAFO;AAGnB,yBAAa,EAAE,EAAE,CAAC,cAHC;AAInB,4BAAgB,EAAE,EAAE,CAAC,eAAH,IAAsB;AAAE,eAAC,EAAE,EAAE,CAAC,EAAR;AAAY,eAAC,EAAE,EAAE,CAAC;AAAlB;AAJrB,WAAD;AAKlB,SALF;AAMD,OAPD;;AAaA,mCAAuB;AACrB,aAAI,CAAC,QAAL,CAAc;AAAM,iBAAC;AACnB,2BAAe,EAAE;AADE,WAAD;AAElB,SAFF;AAGD,OAJD;;AAWA,8BAAkB,UAAC,CAAD,EAAO;AACvB,YAAI,CAAC,IAAI,oBAAE,UAAF,CAAa,CAAC,CAAC,OAAf,CAAT,EAAkC;AAChC,WAAC,CAAC,OAAF;AACD;;AACD,aAAI,CAAC,uBAAL,CAA6B,CAA7B;AACD,OALD;;AAYA,+BAAmB,UAAC,CAAD,EAAO;AAChB;AACR,YAAM,SAAS,GAAG;AAAE,yBAAe,EAAE;AAAnB,SAAlB;;AAEA,aAAI,CAAC,QAAL,CAAc,SAAd;;AACA,aAAI,CAAC,gBAAL,CAAsB,SAAtB;;AAEA,YAAI,oBAAE,UAAF,CAAa,YAAb,CAAJ,EAAgC;AAC9B,sBAAY,CAAC,SAAD,EAAY,CAAZ,CAAZ;AACD;;AAED,aAAI,CAAC,oCAAL;AACD,OAZD;;AAcA,+BAAmB,UAAC,CAAD,EAAO;AACxB,YAAM,SAAS,GAAG,iCAAoB,CAApB,CAAlB;AAEA,YAAM,KAAK,GAAG,oBAAE,GAAF,CAAM,KAAI,CAAC,KAAX,EAAkB,KAAG,SAArB,CAAd;;AACA,YAAI,SAAS,IAAI,oBAAE,UAAF,CAAa,KAAb,CAAjB,EAAsC;AACpC,cAAM,KAAK,GAAG,KAAI,CAAC,YAAL,CAAkB,CAAlB,CAAd;;AACA,cAAM,OAAO,GAAG,KAAhB;AAEA,iBAAO,CAAC,KAAD,EAAQ,CAAR,CAAP;AACD;AACF,OAVD;;AAYA,0BAAc,UAAC,CAAD,EAAO;AACX;;AACR,YAAM,KAAK,GAAG,KAAI,CAAC,YAAL,CAAkB,CAAlB,CAAd;;AAEA,YAAI,KAAJ,EAAW;AACT,cAAM,SAAS,yBAA+B,KAA/B,GAAoC;AAAE,2BAAe,EAAE;AAAnB,WAApC,CAAf;;AACA,eAAI,CAAC,QAAL,CAAc,SAAd;;AACA,eAAI,CAAC,gBAAL,CAAsB,SAAtB;;AAEA,cAAI,oBAAE,UAAF,CAAa,OAAb,CAAJ,EAA2B;AACzB,mBAAO,CAAC,SAAD,EAAY,CAAZ,CAAP;AACD;AACF;AACF,OAbD;;AAeA,8BAAkB,UAAC,CAAD,EAAO;AACf;;AAER,YAAI,oBAAE,UAAF,CAAa,WAAb,CAAJ,EAA+B;AAC7B,cAAM,KAAK,GAAG,KAAI,CAAC,YAAL,CAAkB,CAAlB,CAAd;;AAEA,qBAAW,CAAC,KAAD,EAAQ,CAAR,CAAX;AACD;AACF,OARD;;AAUA,4BAAgB,UAAC,CAAD,EAAO;AACb;;AAER,YAAI,oBAAE,UAAF,CAAa,SAAb,CAAJ,EAA6B;AAC3B,cAAM,KAAK,GAAG,KAAI,CAAC,YAAL,CAAkB,CAAlB,CAAd;;AAEA,mBAAS,CAAC,KAAD,EAAQ,CAAR,CAAT;AACD;AACF,OARD;;AAUA,8BAAkB,UAAC,CAAD,EAAO;AACvB,YAAI,CAAC,CAAC,cAAF,IAAoB,IAApB,IAA4B,CAAC,CAAC,cAAF,CAAiB,MAAjB,GAA0B,CAA1D,EAA6D;AAC3D,eAAI,CAAC,eAAL,CAAqB,CAAC,CAAC,cAAF,CAAiB,CAAjB,CAArB;AACD;AACF,OAJD;;AAMA,+BAAmB,UAAC,CAAD,EAAO;AACxB,YAAI,CAAC,CAAC,cAAF,IAAoB,IAApB,IAA4B,CAAC,CAAC,cAAF,CAAiB,MAAjB,GAA0B,CAA1D,EAA6D;AAC3D,eAAI,CAAC,eAAL,CAAqB,CAAC,CAAC,cAAF,CAAiB,CAAjB,CAArB;AACD;AACF,OAJD;;AAMA,6BAAiB,UAAC,CAAD,EAAO;AACtB,YAAI,CAAC,CAAC,cAAF,IAAoB,IAApB,IAA4B,CAAC,CAAC,cAAF,CAAiB,MAAjB,GAA0B,CAA1D,EAA6D;AAC3D,eAAI,CAAC,aAAL,CAAmB,CAAC,CAAC,cAAF,CAAiB,CAAjB,CAAnB;AACD;AACF,OAJD;;AAcA,2CAA+B,UAAC,EAAD,EAAkD;YAA/C,gB;YAAO,gB;YAAO,kB;YAAQ,kB;AACtD,iDACE,2BAAc,QAAd,CAAsB,+BACjB,2BAAc,YADG,GAEjB,KAFiB,GAEZ;AACR,eAAK,EAAE,4BAAe,KAAf,EAAsB,IAAtB,CADC;AAER,iBAAO,EAAE;AAAE,aAAC,EAAE,CAAL;AAAQ,aAAC,EAAE,CAAX;AAAc,iBAAK,OAAnB;AAAqB,kBAAM;AAA3B;AAFD,SAFY,CAAtB,CADF,EAOE,MAAM,CAAC,IAPT,EAQE,MAAM,CAAC,IAAP,GAAc,MAAM,CAAC,KARvB;AASC,OAVH;;AAYA,6CAAiC,UAAC,EAAD,EAAkD;YAA/C,gB;YAAO,gB;YAAO,kB;YAAQ,kB;AACxD,iDACE,2BAAc,QAAd,CAAsB,+BACjB,2BAAc,YADG,GAEjB,KAFiB,GAEZ;AACR,eAAK,EAAE,4BAAe,KAAf,EAAsB,IAAtB,CADC;AAER,iBAAO,EAAE;AAAE,aAAC,EAAE,CAAL;AAAQ,aAAC,EAAE,CAAX;AAAc,iBAAK,OAAnB;AAAqB,kBAAM;AAA3B;AAFD,SAFY,CAAtB,CADF,EAOE,MAAM,CAAC,GAPT,EAQE,MAAM,CAAC,GAAP,GAAa,MAAM,CAAC,MARtB;AASC,OAVH;;AAYA,iCAAqB,UAAC,IAAD,EAAW;AAAK,2CAAe,IAAf;AAA0B,OAA/D;;AAEA,oCAAwB,UAAC,OAAD,EAAa;AACnC,YAAM,IAAI,GAAkB,kCAAsB,OAAtB,CAA5B;AACA,YAAM,YAAY,GAAG,4BAAe,IAAf,EAAqB,KAArB,EAA4B,IAA5B,CAArB;AAEA,eAAO;AACL,sBAAY,cADP;AAEL,6BAAmB,EAAE,oBAAE,MAAF,CAAS,YAAT,EAAuB,aAAC;AAAI,oBAAC,CAAD;AAAY,WAAxC,CAFhB;AAGL,qBAAW,EAAE,IAHR;AAIL,6BAAmB,EAAE,+BAAkB,IAAlB;AAJhB,SAAP;AAMD,OAVD;;AA8BA,2BAAe,UAAC,OAAD,EAAa;AACpB;AAAA,YAAE,oCAAF;AAAA,YAAmB,sCAAnB;AAAA,YAAqC,gCAArC;AAAA,YAAoD,kBAApD;;AAEN,YAAI,CAAC,OAAD,IAAY,CAAC,OAAO,CAAC,KAAR,CAAc,MAA3B,IAAqC,CAAC,eAAtC,IAAyD,CAAC,gBAA9D,EAAgF;AAC9E,iBAAO,IAAP;AACD;;AACO;AACR,YAAI,SAAJ;AACA,YAAI,UAAU,GAAQ,kBAAtB;;AAEA,YAAI,SAAS,KAAK,cAAlB,EAAkC;AAChC,mBAAS,GAAG,gBAAZ;AACA,oBAAU,GAAG,kBAAb;AACD,SAHD,MAGO,IAAI,SAAS,KAAK,UAAlB,EAA8B;AACnC,mBAAS,GAAG,KAAI,CAAC,kBAAL,EAAZ;AACA,oBAAU,GAAG,sBAAb;AACD,SAHM,MAGA,IAAI,MAAM,KAAK,QAAf,EAAyB;AACxB;AAAA,cAAE,UAAF;AAAA,cAAM,UAAN;AAAA,cAAU,kBAAV;AAAA,cAAkB,0BAAlB;AAAA,cAA8B,sBAA9B;;AACN,mBAAS,GAAG;AACV,cAAE,IADQ;AAEV,cAAE,IAFQ;AAGV,sBAAU,YAHA;AAIV,oBAAQ,UAJE;AAKV,uBAAW,EAAE,MALH;AAMV,uBAAW,EAAE;AANH,WAAZ;AAQA,oBAAU,GAAG,mBAAb;AACD,SAXM,MAWA;AACL,mBAAS,GAAG;AAAE,kBAAM,EAAE,KAAI,CAAC,eAAL;AAAV,WAAZ;AACA,oBAAU,GAAG,kBAAb;AACD;;AACD,YAAM,GAAG,GAAG,OAAO,CAAC,GAAR,IAAe,kBAA3B;;AACA,YAAM,WAAW;AACf,gBAAM,EAAE,MADO;AAEf,uBAAa,EAAE;AAFA,WAGZ,MAHY,GAIZ,SAJY,GAKZ,oBAAY,OAAO,CAAC,KAAR,CAAc,MAA1B,CALY,GAKqB;AACpC,iBAAO,EAAE,aAD2B;AAEpC,aAAG,KAFiC;AAGpC,mBAAS,EAAE;AAHyB,SALrB,CAAjB;;AAWA,eAAO,uBAAe,OAAO,CAAC,KAAR,CAAc,MAA7B,IACH,qBAAa,OAAO,CAAC,KAAR,CAAc,MAA3B,EAAmC,WAAnC,CADG,GAEH,sBAAc,UAAd,EAA0B,WAA1B,CAFJ;AAGD,OA9CD;;AAgDA,8BAAkB,UAAC,OAAD,EAAe,WAAf,EAAoC,KAApC,EAAiD;AACjE,YAAM,QAAQ,GAAG,oBAAE,GAAF,CAAM,OAAN,EAAe,eAAf,CAAjB;AACA,YAAM,OAAO,GAAG,oBAAE,GAAF,CAAM,KAAI,CAAC,KAAX,EAAqB,QAAQ,QAA7B,CAAhB;AACA,YAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,KAAR,CAAiB,QAAQ,OAAzB,CAAD,CAA1B;AAEA,eAAO,qBAAa,OAAb,EAAoB,sBACtB,UADsB,GACZ;AACb,mBAAS,EAAE,QADE;AAEb,aAAG,EAAE,OAAO,CAAC,GAAR,IAAkB,WAAW,MAAX,GAAe,KAFzB;AAGb,eAAK,EAAE,4BAAe,UAAf,EAA2B,IAA3B;AAHM,SADY,CAApB,CAAP;AAMD,OAXD;;AAaA,0BAAc,UAAC,OAAD,EAAe,WAAf,EAAoC,KAApC,EAAiD;AACrD;AACR,YAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAR,CAAc,OAAf,CAAxB;AAEA,eAAO,KAAI,CAAC,UAAL,CAAgB,OAAhB,EAAyB,OAAzB,EAAkC,WAAlC,EAA+C,KAA/C,CAAP;AACD,OALD;;AAOA,0BAAc,UAAC,OAAD,EAAe,WAAf,EAAoC,KAApC,EAAiD;AACrD;AACR,YAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAR,CAAc,OAAf,CAAxB;AAEA,eAAO,KAAI,CAAC,UAAL,CAAgB,OAAhB,EAAyB,OAAzB,EAAkC,WAAlC,EAA+C,KAA/C,CAAP;AACD,OALD;;AAkCA,yBAAa,UAAC,OAAD,EAA4B;AACjC;AAAA,YAAE,sBAAF;AAAA,YAAY,sBAAZ;AAAA,YAAsB,kBAAtB;AACA;AAAA,YAAE,gBAAF;AAAA,YAAS,kBAAT;AACN,YAAM,KAAK,GAAG,kCAAsB,QAAtB,CAAd;AACA,YAAM,qBAAqB,GAAG,oBAAE,IAAF,CAAO,QAAP,EAAiB,gBAAI;AAAI,qCAAE,KAAF,CAAQ,IAAI,CAAC,MAAb,EAAqB,MAAM,CAA3B;AAAqC,SAA9D,CAA9B;AACA,YAAM,KAAK,GAAG,qBAAqB,IAAI,kCAAsB,QAAtB,CAAvC;AACA,YAAM,KAAK,GAAG,OAAO,CAAC,KAAR,IAAiB,EAA/B;AAEA,eAAO,qBAAa,OAAb,EAAsB;AAC3B,aAAG,EAAE,OAAO,CAAC,GAAR,IAAe,MADO;AAE3B,WAAC,EAAE,qBAAS,KAAK,CAAC,CAAf,IAAoB,KAAK,CAAC,CAA1B,GAA8B,MAAM,CAAC,IAFb;AAG3B,WAAC,EAAE,qBAAS,KAAK,CAAC,CAAf,IAAoB,KAAK,CAAC,CAA1B,GAA8B,MAAM,CAAC,GAHb;AAI3B,eAAK,EAAE,qBAAS,KAAK,CAAC,KAAf,IAAwB,KAAK,CAAC,KAA9B,GAAsC,MAAM,CAAC,KAJzB;AAK3B,gBAAM,EAAE,qBAAS,KAAK,CAAC,MAAf,IAAyB,KAAK,CAAC,MAA/B,GAAwC,MAAM,CAAC,MAL5B;AAM3B,eAAK,OANsB;AAO3B,eAAK,OAPsB;AAQ3B,gBAAM,QARqB;AAS3B,oBAAU,EAAE,KATe;AAU3B,qBAAW,EAAE,MAVc;AAW3B,sCAA4B,EAAE,KAAK,CAAC,4BAAN,IAAsC,KAAI,CAAC,4BAX9C;AAY3B,wCAA8B,EAAE,KAAK,CAAC,8BAAN,IAAwC,KAAI,CAAC;AAZlD,SAAtB,CAAP;AAcD,OAtBD;;AAwBA,8BAAkB,UAAC,OAAD,EAA4B;AACtC;AAAA,YAAE,gCAAF;AAAA,YAAiB,8BAAjB;AACN,YAAM,UAAU,GAAG,kCAAsB,aAAtB,CAAnB;AACA,YAAM,SAAS,GAAG,kCAAsB,YAAtB,CAAlB;AACQ;AAAA,YAAI,iBAAJ;AAAA,YAAQ,mCAAR;AAAA,YAAqB,mCAArB;AAER,eAAO,qBAAa,OAAb,EAAsB;AAC3B,qBAAW,EAAE,4BAAe,SAAf,EAA0B,IAA1B,EAAgC,GAAhC,CAAoC,UAAC,KAAD,EAAW;AAAK,wBAAK,CAAL;AAAgB,WAApE,CADc;AAE3B,qBAAW,EAAE,4BAAe,UAAf,EAA2B,IAA3B,EAAiC,GAAjC,CAAqC,UAAC,KAAD,EAAW;AAAK,wBAAK,CAAL;AAAgB,WAArE,CAFc;AAG3B,YAAE,IAHyB;AAI3B,YAAE,IAJyB;AAK3B,qBAAW,aALgB;AAM3B,qBAAW,aANgB;AAO3B,aAAG,EAAE,OAAO,CAAC,GAAR,IAAe;AAPO,SAAtB,CAAP;AASD,OAfD;;AAqBA,2BAAe;AACL;AACF;AAAA,YAAE,sBAAF;AAAA,YAAY,gBAAZ;AAAA,YAAmB,kBAAnB;AACN,YAAM,MAAM,GAAG,KAAI,CAAC,KAAL,CAAW,MAAX,IAAqB,EAApC;AACA,YAAM,WAAW,GAAW,KAAK,IAAI,MAAM,CAAC,IAAP,IAAe,CAAnB,CAAL,IAA8B,MAAM,CAAC,KAAP,IAAgB,CAA9C,CAA5B;AACA,YAAM,KAAK,GAAG,4BAAe;AAC3B,kBAAQ,UADmB;AAE3B,gCAAsB,wBAFK;AAG3B,qBAAW,aAHgB;AAI3B,uBAAa;AAJc,SAAf,CAAd;;AAOA,YAAI,CAAC,KAAL,EAAY;AACV,iBAAO,IAAP;AACD;;AAEO;AAAA,YAAM,oCAAN;;AAER,eAAO,qBAAa,IAAb,EAAiB,sBACnB,UADmB,GACT;AACb,oBAAU,EAAE,KADC;AAEb,qBAAW,EAAE,MAFA;AAGb,gBAAM,QAHO;AAIb,aAAG,EAAE,aAAC,MAAD,EAAY;AACf,iBAAI,CAAC,cAAL,GAAsB,MAAtB;AACD,WANY;AAOb,sBAAY,EAAE,KAAI,CAAC;AAPN,SADS,CAAjB,CAAP;AAUD,OA5BD;;AAkCA,4BAAgB;AACN;AACR,YAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;;AAEA,YAAI,CAAC,WAAL,EAAkB;AAChB,iBAAO,IAAP;AACD;;AAEK;AAAA,YAAE,oCAAF;AAAA,YAAmB,sCAAnB;AAAA,YAAqC,gCAArC;AAAA,YAAoD,4BAApD;AAAA,YAAiE,kBAAjE;AAEN,eAAO,qBAAa,WAAb,EAA0B;AAC/B,iBAAO,wBAAO,MAAP,GAAa;AAAE,aAAC,EAAE,MAAM,CAAC,IAAZ;AAAkB,aAAC,EAAE,MAAM,CAAC;AAA5B,WAAb,CADwB;AAE/B,gBAAM,EAAE,eAFuB;AAG/B,eAAK,EAAE,WAHwB;AAI/B,iBAAO,EAAE,eAAe,GAAG,aAAH,GAAmB,EAJZ;AAK/B,oBAAU,EAAE;AALmB,SAA1B,CAAP;AAOD,OAjBD;;AAmBA,0BAAc,UAAC,OAAD,EAA4B;AAClC;AAAA,YAAE,kBAAF;AAAA,YAAU,cAAV;AACA;AAAA,YAAE,kBAAF;AAAA,YAAU,kCAAV;AAAA,YAA0B,8BAA1B;AAAA,YAAwC,sBAAxC;AAGN,eAAO,qBAAa,OAAb,EAAsB;AAC3B,aAAG,EAAE,OAAO,CAAC,GAAR,IAAe,iBADO;AAE3B,kBAAQ,EAAE,kCAAqB,KAAI,CAAC,iBAA1B,EAA6C,IAA7C,EAAmD,OAAO,CAAC,KAAR,CAAc,QAAjE,CAFiB;AAG3B,cAAI,MAHuB;AAI3B,WAAC,EAAE,qBAAS,OAAO,CAAC,KAAR,CAAc,CAAvB,IAA4B,OAAO,CAAC,KAAR,CAAc,CAA1C,GAA8C,MAAM,CAAC,IAJ7B;AAK3B,WAAC,EAAE,qBAAS,OAAO,CAAC,KAAR,CAAc,CAAvB,IACC,OAAO,CAAC,KAAR,CAAc,CADf,GAEC,MAAM,CAAC,GAAP,GAAa,MAAM,CAAC,MAApB,GAA6B,MAAM,CAAC,WAApC,IAAmD,MAAM,CAAC,MAAP,IAAiB,CAApE,CAPuB;AAQ3B,eAAK,EAAE,qBAAS,OAAO,CAAC,KAAR,CAAc,KAAvB,IAAgC,OAAO,CAAC,KAAR,CAAc,KAA9C,GAAsD,MAAM,CAAC,KARzC;AAS3B,oBAAU,EAAE,cATe;AAU3B,kBAAQ,EAAE,YAViB;AAW3B,kBAAQ,EAAE,WAAS;AAXQ,SAAtB,CAAP;AAaD,OAlBD;;AAoBA,qCAAyB,UAAC,OAAD,EAA8B,WAA9B,EAAmD,KAAnD,EAAgE;AACvF,YAAI,CAAC,OAAL,EAAc;AACZ,iBAAO,IAAP;AACD;;AACO;AACF;AAAA,YAAE,sBAAF;AAAA,YAAY,sBAAZ;AAAA,YAAsB,kBAAtB;AACA;AAAA,YAAE,oBAAF;AAAA,YAAW,oBAAX;AAEN,eAAO,qBAAa,OAAb,EAAsB;AAC3B,aAAG,EAAE,OAAO,CAAC,GAAR,IAAkB,WAAW,MAAX,GAAe,KADX;AAE3B,eAAK,EAAE,QAAQ,CAAC,OAAD,CAFY;AAG3B,eAAK,EAAE,QAAQ,CAAC,OAAD,CAHY;AAI3B,iBAAO,EAAE;AACP,aAAC,EAAE,MAAM,CAAC,IADH;AAEP,aAAC,EAAE,MAAM,CAAC,GAFH;AAGP,iBAAK,EAAE,MAAM,CAAC,KAHP;AAIP,kBAAM,EAAE,MAAM,CAAC;AAJR,WAJkB;AAU3B,oBAAU;AAViB,SAAtB,CAAP;AAYD,OApBD;;AAwCA,iCAAqB,UAAC,EAAD,EAA2D;YAAxD,c;YAAM,4B;YAAa,wB;YAAW,0B;YAAY,oB;AAChE,YAAM,MAAM,GAAG,EAAf;AACQ;AACF;AAAA,YAAE,wBAAF;AAAA,YAAa,oBAAb;;AACN,YAAM,QAAQ;AACZ,eAAK,EAAE,UADK;AAEZ,iBAAO,SAFK;AAGZ,YAAE,EAAE,WAAW,CAAC,CAHJ;AAIZ,YAAE,EAAE,WAAW,CAAC,CAJJ;AAKZ,WAAC,EAAE,CALS;AAMZ,cAAI,EAAE,uCAA0B,IAAI,CAAC,IAA/B,CANM;AAOZ,qBAAW,EAAE,CAPD;AAQZ,gBAAM,EAAE,MARI;AASZ,iBAAO,EAAE,WAAW,CAAC,OATT;AAUZ,eAAK,EAAE,WAAW,CAAC,KAVP;AAWZ,aAAG,EAAK,GAAG,kBAAH,GAAmB;AAXf,WAYT,oBAAY,SAAZ,CAZS,GAaT,2BAAmB,SAAnB,CAbS,CAAd;;AAgBA,cAAM,CAAC,IAAP,CAAY,uBAAuB,CAAC,eAAxB,CAAwC,SAAxC,EAAmD,QAAnD,CAAZ;;AAEA,YAAI,SAAJ,EAAe;AACb,gBAAM,CAAC,IAAP,CACE,uBAAuB,CAAC,eAAxB,CAAwC,SAAxC,EAAiD,sBAC5C,QAD4C,GACpC;AACX,cAAE,EAAE,SAAS,CAAC,CADH;AAEX,cAAE,EAAE,SAAS,CAAC,CAFH;AAGX,eAAG,EAAK,GAAG,gBAAH,GAAiB;AAHd,WADoC,CAAjD,CADF;AAQD,SATD,MASO,IAAI,OAAJ,EAAa;AAClB,gBAAM,CAAC,IAAP,CAAY,IAAZ;AACD;;AAED,eAAO,MAAP;AACD,OApCD;;AAsCA,iCAAqB,UAAC,OAAD,EAA8B,WAA9B,EAAmD,KAAnD,EAAgE;AACnF,YAAM,IAAI,GAAG,KAAI,CAAC,gBAAL,CAAsB,OAAtB,EAA+B,WAA/B,EAA4C,KAA5C,CAAb;;AACA,YAAI,CAAC,IAAL,EAAW;AACT,iBAAO,IAAP;AACD;;AAED,YAAM,aAAa,GAAG,qBAAa,OAAb,EAAsB,IAAI,CAAC,KAA3B,CAAtB;AACM;AAAA,YAAE,oCAAF;AAAA,YAAmB,4BAAnB;AAAA,YAAgC,0CAAhC;AAAA,YAAoD,4BAApD;AACE;AACR,YAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;AACM;AAAA,YAAE,kBAAF;AAAA,YAAU,oBAAV;AAAA,YAAmB,sBAAnB;AACA;AAAA,YAAE,wBAAF;AAAA,YAAa,cAAb;AACN,YAAM,SAAS,GAAG,CAAC,IAAD,IAAS,eAAT,IAA4B,WAA5B,IAA2C,SAA3C,IAAwD,kBAAkB,IAAI,CAAhG;;AAEA,iBAAS,eAAT,CAAyB,KAAzB,EAAmC;AAEjC,iBAAO,OAAO,WAAW,CAAC,OAAnB,KAA+B,UAA/B,GAA4C,WAAW,CAAC,OAAZ,CAAoB,KAAK,CAAC,OAA1B,CAA5C,GAAiF,IAAxF;AACD;;AAED,YAAI,SAAJ,EAAe;AACb,cAAI,WAAW,SAAf;AAAA,cAAiB,SAAS,SAA1B;;AAEA,cAAI,WAAW,CAAC,OAAZ,IAAuB,CAAC,WAAW,CAAC,uBAAxC,EAAiE;AAE/D,gBAAM,YAAY,GAChB,OAAO,WAAW,CAAC,OAAnB,KAA+B,UAA/B,GACI,eADJ,GAEI,WAAW,MAAX,CAAkB,WAAW,CAAC,OAAZ,CAAoB,QAApB,EAAlB,CAHN;AAIA,uBAAW,GAAG,6BAAiB,MAAjB,EAAyB,YAAzB,EAAuC,WAAvC,CAAd;AACA,qBAAS,GAAG,OAAO,IAAI,QAAX,IAAuB,6BAAiB,QAAjB,EAA2B,YAA3B,EAAyC,WAAzC,CAAnC;AACD,WARD,MAQO;AACL,uBAAW,GAAG,MAAM,CAAC,kBAAD,CAApB;AACA,qBAAS,GAAG,OAAO,IAAI,QAAX,IAAuB,QAAQ,CAAC,kBAAD,CAA3C;AACD;;AAED,cAAI,CAAC,oBAAE,KAAF,CAAQ,WAAR,CAAL,EAA2B;AACzB,mCACE,aADF,GAEK,KAAI,CAAC,kBAAL,CAAwB;AACzB,kBAAI,MADqB;AAEzB,yBAAW,aAFc;AAGzB,uBAAS,WAHgB;AAIzB,wBAAU,EAAE,kBAJa;AAKzB,qBAAO;AALkB,aAAxB,CAFL;AAUD;AACF;;AAED,YAAI,OAAJ,EAAa;AACX,iBAAO,CAAC,aAAD,EAAgB,IAAhB,EAAsB,IAAtB,CAAP;AACD;;AAED,eAAO,CAAC,aAAD,EAAgB,IAAhB,CAAP;AACD,OAtDD;;AAwDA,+BAAmB,UAAC,OAAD,EAA4B;AAC7C,oCAAa,OAAb,EAAoB,sBACf,KAAI,CAAC,KADU,GAEf,KAAI,CAAC,KAFU,CAApB;AAGE,OAJJ;;AA3/CE,UAAM,YAAY,GAAG,uBAAuB,CAAC,kBAAxB,CAA2C,KAA3C,CAArB;AACA,UAAM,QAAQ,GAAG,CAAjB;AACA,WAAI,CAAC,KAAL,GAAU,+BACL,YADK,GACO;AACf,gBAAQ,EAAE;AADK,OADP,GAGL,KAAI,CAAC,yCAAL,CAA8C;AAAG,aAAK;AAAR,SAAa,YAAb,GAAyB;AAAE,gBAAQ;AAAV,OAAzB,CAA9C,CAHK,CAAV;AAMA,WAAI,CAAC,aAAL,GAAqB,oBAAE,KAAF,CAAQ,KAAK,CAAC,EAAd,IAAoB,qBAAS,UAAT,CAApB,GAA2C,KAAK,CAAC,EAAtE;AACA,WAAI,CAAC,UAAL,GAAqB,KAAI,CAAC,aAAL,GAAkB,OAAvC;;AAEA,UAAI,KAAK,CAAC,aAAV,EAAyB;AACvB,aAAI,CAAC,uBAAL,GAA+B,oBAAE,QAAF,CAAW,KAAI,CAAC,uBAAhB,EAAyC,KAAK,CAAC,aAA/C,CAA/B;AACD;;;AACF;;AAGD;AACE,UAAI,CAAC,oBAAE,KAAF,CAAQ,KAAK,KAAL,CAAW,MAAnB,CAAL,EAAiC;AAC/B,aAAK,WAAL;AACD;AACF,KAJD;;AAOA,mFAAiC,SAAjC,EAAiE;AAAjE;;AACQ;AAAA,UAAE,cAAF;AAAA,UAAQ,sBAAR;AAAA,UAAkB,gBAAlB;AAAA,UAAyB,kBAAzB;AAAA,UAAiC,kBAAjC;AAAA,UAAyC,4BAAzC;AAAA,UAAsD,kBAAtD;AACA;AAAA,UAAE,sBAAF;AAAA,UAAY,oCAAZ;AAAA,UAA6B,0BAA7B;AAAA,UAAyC,4BAAzC;AAAA,UAAsD,gCAAtD;AAAA,UAAqE,sCAArE;;AAEN,UACE,SAAS,CAAC,IAAV,KAAmB,IAAnB,IACA,SAAS,CAAC,KAAV,KAAoB,KADpB,IAEA,SAAS,CAAC,MAAV,KAAqB,MAFrB,IAGA,SAAS,CAAC,MAAV,KAAqB,MAHrB,IAIA,SAAS,CAAC,WAAV,KAA0B,WAJ1B,IAKA,CAAC,4BAAa,SAAS,CAAC,MAAvB,EAA+B,MAA/B,CANH,EAOE;AACA,YAAM,YAAY,GAAG,uBAAuB,CAAC,kBAAxB,CAA2C,SAA3C,CAArB;AACA,aAAK,QAAL,CAAa,+BACR,YADQ,GACI;AACf,kBAAQ,EAAE,QAAQ,GAAG;AADN,SADJ,GAGR,KAAK,yCAAL,CAA8C;AAC/C,eAAK,EAAE;AADwC,WAE5C,YAF4C,GAEhC;AACf,kBAAQ,EAAE,QAAQ,GAAG;AADN,SAFgC,CAA9C,CAHQ,CAAb;AASD,OAlBD,MAkBO,IAAI,CAAC,6BAAgB,SAAS,CAAC,QAA1B,EAAoC,QAApC,CAAL,EAAoD;AAEzD,YAAM,aAAa,GAAG,CAAC,oBAAE,KAAF,CAAQ,SAAS,CAAC,IAAlB,CAAvB;AACA,YAAM,aAAW,GAAG,aAAa,GAAG,QAAH,GAAc,QAAQ,GAAG,CAA1D;AAEA,aAAK,QAAL,CAAc,qBAAS;AAAI;AACzB,oBAAQ,EAAE;AADe,aAEtB,KAAI,CAAC,yCAAL,CAA8C;AAC/C,iBAAK,EAAE;AADwC,aAE5C,SAF4C,GAEnC;AACZ,oBAAQ,EALe;AAIX,WAFmC,CAA9C,CAFsB;AAOzB,SAPF;AAQD;;AAED,UAAI,oBAAE,KAAF,CAAQ,KAAK,KAAL,CAAW,MAAnB,KAA8B,CAAC,oBAAE,KAAF,CAAQ,SAAS,CAAC,MAAlB,CAAnC,EAA8D;AAC5D,aAAK,WAAL;AACD;;AAED,UAAI,CAAC,oBAAE,KAAF,CAAQ,KAAK,KAAL,CAAW,MAAnB,CAAD,IAA+B,oBAAE,KAAF,CAAQ,SAAS,CAAC,MAAlB,CAAnC,EAA8D;AAC5D,aAAK,cAAL;AACD;AACF,KA5CD;;AA8CA;AACE,UAAI,CAAC,oBAAE,KAAF,CAAQ,KAAK,KAAL,CAAW,MAAnB,CAAL,EAAiC;AAC/B,aAAK,cAAL;AACD;;AACD,WAAK,oCAAL;AACD,KALD;;AAOA;AACE,UAAI,OAAQ,KAAK,uBAAL,CAAqC,MAA7C,KAAwD,UAA5D,EAAwE;AACrE,aAAK,uBAAL,CAAqC,MAArC;AACF;AACF,KAJD;;AAgBA,6DACE,KADF,EAEE,EAFF,EAEkG;UAA9F,gB;UAAA,uC;UAAoB,sB;UAAU,kC;UAAgB,4B;UAAa,kC;UAAgB,8B;AAErE;AACR,UAAM,SAAS,GAAM,QAAQ,OAA7B;AAEA,UAAM,IAAI,GAAG,2BAAc,QAAd,EAAwB,QAAxB,CAAb;AAEA,UAAI,OAAO,GAAG,EAAd;;AAEA,UAAI,IAAI,IAAI,IAAI,CAAC,MAAjB,EAAyB;AACvB,eAAO,GAAG,KAAK,gBAAL,CAAsB,KAAtB,EAA6B;AACrC,cAAI,MADiC;AAErC,wBAAc,gBAFuB;AAGrC,kBAAQ,UAH6B;AAIrC,mBAAS,WAJ4B;AAKrC,qBAAW,aAL0B;AAMrC,wBAAc,gBANuB;AAOrC,sBAAY;AAPyB,SAA7B,CAAV;AASD,OAVD,MAUO,IAAI,cAAc,IAAI,cAAc,CAAC,MAArC,EAA6C;AAClD,eAAO,GAAG,KAAK,iBAAL,CAAuB,KAAvB,EAA8B;AACtC,cAAI,EAAE,QADgC;AAEtC,wBAAc,gBAFwB;AAGtC,kBAAQ,UAH8B;AAItC,mBAAS,WAJ6B;AAKtC,qBAAW,aAL2B;AAMtC,wBAAc,gBANwB;AAOtC,sBAAY;AAP0B,SAA9B,CAAV;AASD;;AAED,aAAO,OAAP;AACD,KAlCD;;AA6PA,sEAAoB,YAApB,EAA8C,WAA9C,EAAgE,QAAhE,EAA6E;AACnE;AACR,UAAM,KAAK,GAAG,YAAY,CAAC,IAAb,CAAkB,UAAC,IAAD,EAAU;AAAK,mBAAI,IAAI,IAAI,CAAC,KAAL,KAAR;AAAkC,OAAnE,CAAd;;AAEA,UAAI,KAAJ,EAAW;AACT,YAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,iBAAO;AAAE,aAAC,EAAE,KAAK,CAAC,UAAX;AAAuB,aAAC,EAAE,QAAQ,CAAC;AAAnC,WAAP;AACD;;AACD,YAAI,MAAM,KAAK,UAAf,EAA2B;AACzB,iBAAO;AAAE,aAAC,EAAE,QAAQ,CAAC,CAAd;AAAiB,aAAC,EAAE,KAAK,CAAC;AAA1B,WAAP;AACD;;AACD,YAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,cAAM,OAAK,GAAG,KAAK,CAAC,UAApB;AACQ;AAER,gDACK,QADL,GAEK,8BAAiB,QAAQ,CAAC,EAA1B,EAA8B,QAAQ,CAAC,EAAvC,EAA2C,QAA3C,EAAmD,OAAnD,CAFL,GAE8D;AAC5D,iBAAK,SADuD;AAE5D,kBAAM;AAFsD,WAF9D;AAMD;;AAED,YAAM,MAAM,GAAG,KAAK,CAAC,UAArB;AACQ;AAER,8CACK,QADL,GAEK,8BAAiB,QAAQ,CAAC,EAA1B,EAA8B,QAAQ,CAAC,EAAvC,EAA2C,MAA3C,EAAmD,KAAnD,CAFL,GAE8D;AAC5D,eAAK,OADuD;AAE5D,gBAAM;AAFsD,SAF9D;AAMD;;AAED,aAAO,gBAAP;AACD,KAnCD;;AA0CA,+DAAa,KAAb,EAAuB;AACrB,UAAI,CAAC,KAAK,SAAV,EAAqB;AACnB,eAAO,IAAP;AACD;;AAED,UAAM,eAAe,GAAG,qBAAU,KAAK,SAAf,CAAxB;AACA,UAAM,CAAC,GAAG,oCAAyB,KAAzB,EAAgC,eAAhC,CAAV;AACA,UAAM,QAAQ,GAAG,KAAK,OAAL,CAAa,CAAC,CAAC,MAAf,EAAuB,CAAC,CAAC,MAAzB,CAAjB;;AACA,UAAI,CAAC,QAAL,EAAe;AACb,eAAO,IAAP;AACD;;AAEK;AAAA,UAAE,sBAAF;AAAA,UAAY,sBAAZ;;AAEN,UAAI,SAAS,KAAK,MAAd,IAAwB,QAAxB,IAAoC,QAAxC,EAAkD;AAChD,YAAM,MAAM,GAAG,kCAAsB,QAAtB,EAAgC,KAA/C;AACA,YAAM,MAAM,GAAG,kCAAsB,QAAtB,EAAgC,KAA/C;AACA,YAAM,MAAM,GAAG,MAAM,IAAI,MAAM,CAAC,MAAjB,GAA0B,MAAM,CAAC,MAAP,CAAc,CAAC,CAAC,MAAhB,CAA1B,GAAoD,IAAnE;AACA,YAAM,MAAM,GAAG,MAAM,IAAI,MAAM,CAAC,MAAjB,GAA0B,MAAM,CAAC,MAAP,CAAc,CAAC,CAAC,MAAhB,CAA1B,GAAoD,IAAnE;AAEA,qCAAY,CAAZ,GAAa;AAAE,gBAAM,QAAR;AAAU,gBAAM;AAAhB,SAAb;AACD;;AAEK;AAAA,UAAE,8BAAF;AAAA,UAA8B,qBAA9B;AAAA,UAAiD,8BAAjD;AACN,UAAM,GAAG,GAAG,KAAK,mBAAL,CAAyB,QAAzB,CAAZ;AACA,UAAM,WAAW,GAAG,sCAAyB,GAAzB,EAA8B,KAA9B,EAAqC,YAArC,EAAmD,IAAnD,CAApB;;AAEA,UAAI,WAAW,IAAI,CAAf,IAAoB,YAAxB,EAAsC;AACpC,YAAM,WAAW,GAAG,YAAY,CAAC,WAAD,CAAZ,IAA6B,YAAY,CAAC,WAAD,CAAZ,CAA0B,KAA3E;AACA,YAAM,aAAa,GAAG,KAAK,iBAAL,CAAuB,WAAvB,EAAoC,WAApC,CAAtB;AACA,YAAM,gBAAgB,GAAG,KAAK,mBAAL,CAAyB,KAAzB,EAAgC,WAAhC,EAA6C,QAA7C,CAAzB;AAEA,qCACK,CADL,GACM;AACJ,4BAAkB,EAAE,WADhB;AAEJ,qBAAW,aAFP;AAGJ,uBAAa,eAHT;AAIJ,0BAAgB;AAJZ,SADN;AAOD;;AAED,aAAO,IAAP;AACD,KA1CD;;AAkDA,oEAAkB,WAAlB,EAAuC,WAAvC,EAA2D;AACnD;AAAA,UAAE,kCAAF;AAAA,UAAkB,4BAAlB;AACN,UAAM,aAAa,GAAG,uBAAuB,CAAC,gBAAxB,CAAyC,KAAK,KAA9C,EAAqD,KAAK,KAA1D,CAAtB;;AAEA,UAAI,WAAW,GAAG,CAAd,IAAmB,CAAC,cAApB,IAAsC,CAAC,cAAc,CAAC,MAAtD,IAAgE,WAAW,IAAI,aAAa,CAAC,MAAjG,EAAyG;AACvG,eAAO,IAAP;AACD;;AAED,aAAO,cAAc,CAAC,MAAf,CAAsB,UAAC,MAAD,EAAc,KAAd,EAAwB;AAC3C;;AAER,YAAI,IAAJ,EAAU;AACR,iBAAO,MAAP;AACD;;AAEK;AAAA,YAAE,oBAAF;AAAA,YAAW,cAAX;AAAA,YAAiB,cAAjB;AAAA,YAAuB,wBAAvB;AAAA,YAAkC,cAAlC;AAAA,YAAwC,4BAAxC;AACN,YAAI,OAAJ;;AAEA,YAAI,WAAW,CAAC,OAAZ,IAAuB,CAAC,WAAW,CAAC,uBAAxC,EAAiE;AAE/D,iBAAO,GAAG,6BAAiB,IAAI,IAAI,aAAzB,EAAwC,WAAW,CAAC,OAApD,EAA6D,WAA7D,CAAV;AACD,SAHD,MAGO;AACL,iBAAO,GAAI,IAAI,IAAI,IAAI,CAAC,WAAD,CAAb,IAA+B,aAAa,CAAC,WAAD,CAAtD;AACD;;AAED,YAAI,CAAC,OAAL,EAAc;AACZ,iBAAO,MAAP;AACD;;AAED,8BACK,MADL,EACW,C,sBAEJ,oBAAY,KAAZ,C,GAAkB;AACrB,iBAAO,SADc;AAErB,cAAI,MAFiB;AAGrB,mBAAS,WAHY;AAIrB,cAAI,EAAE,IAAI,IAAI,OAJO;AAKrB,eAAK,EAAE,uCAA0B,KAA1B,CALc;AAMrB,eAAK,EAAE,+BAAkB,OAAlB,EAA2B,OAA3B,CANc;AAOrB,cAAI,EAAE,WAPe;AAQrB,iBAAO;AARc,S,CAFd,CADX;AAcD,OAnCM,EAmCJ,EAnCI,CAAP;AAoCD,KA5CD;;AA8CA,iEAAe,KAAf,EAA6C,YAA7C,EAA8D;AAA9D;;AACU;AAAA,UAAgB,sCAAhB;AAAA,UAA6B,4BAA7B;AAAA,UAAqC,gCAArC;AAAA,UAA+C,4CAA/C;AAAA,UAA+D,wCAA/D;AACA;AAAA,UAAS,qBAAT;AAAA,UAAiB,qBAAjB;AAAA,UAAyB,qCAAzB;AAAA,UAAyC,mCAAzC;;AACF;AAAA,UAAE,oCAAF;AAAA,UAAmB,8BAAnB;;AACN,UAAM,MAAM,GAAG,uBAAuB,CAAC,MAAxB,CAA+B,cAA/B,CAAf;AACA,UAAM,QAAQ,GAAG,MAAM,IAAI,4BAAe;AAAE,eAAO,SAAT;AAAW,mBAAW;AAAtB,OAAf,CAA3B;AACA,UAAM,aAAa,GAAG,EAAtB;AACA,UAAM,WAAW,GAAG,6BAAgB,KAAK,CAAC,QAAtB,EAAgC,qBAAQ,WAAxC,CAApB;AACA,UAAM,uBAAuB,GAAG,WAAW,IAAI,WAAW,CAAC,KAAZ,CAAkB,OAAlB,KAA8B,OAA7E;AAEA,oBAAc,CAAC,OAAf,CAAuB,UAAC,IAAD,EAAY,KAAZ,EAAyB;;;AAC9C,YAAM,aAAa,GAAG,uBAAuB,CAAC,gBAAxB,CAAyC,KAAzC,EAAgD;AAAE,wBAAc,gBAAhB;AAAkB,sBAAY;AAA9B,SAAhD,EAAkF,IAAlF,CAAtB;AACM;AAAA,YAAE,oBAAF;AAAA,YAAW,+BAAX;AACN,YAAM,aAAa,GAAG,IAAI,CAAC,KAAL,CAAc,eAAe,OAA7B,CAAtB;AACA,YAAM,UAAU,GAAG,IAAI,CAAC,KAAL,CAAc,YAAY,OAA1B,CAAnB;AACA,YAAM,OAAO,GAAG,cAAc,CAAC,MAAf,CAAsB,UAAC,MAAD,EAAc,KAAd,EAAwB;;;AAC5D,cAAM,OAAO,GAAG,YAAY,CAAI,KAAK,CAAC,QAAN,GAAc,KAAlB,CAA5B;AACA,cAAM,EAAE,GAAG,IAAI,CAAC,KAAL,CAAc,KAAK,CAAC,QAAN,GAAc,IAA5B,CAAX;AACA,cAAM,IAAI,GAAG,OAAO,IAAI,OAAO,CAAC,EAAD,CAA/B;AAEA,uCACK,MADL,IACW,YACR,KAAK,CAAC,QADE,IACS,IADT,EACa,GAClB,KAAK,CAAC,QAAN,GAAc,OADI,IACM,4BAAe,IAAf,CAFnB,EAEuC,EAHlD;AAKD,SAVe,EAUb,EAVa,CAAhB;AAWA,YAAM,QAAQ,GAAG,OAAO,CAAC,YAAD,CAAxB;AACA,YAAM,SAAS,GAAG,OAAO,CAAI,YAAY,UAAhB,CAAzB;AACA,YAAM,WAAW,GACf,WAAW,IACX,WAAW,CAAC,aAAD,CADX,IAEA,WAAW,CAAC,aAAD,CAAX,CAA2B,QAF3B,IAGA,kCAAqB,IAArB,EAA2B,WAAW,CAAC,aAAD,CAAX,CAA2B,WAAtD,CAJF;AAKA,YAAM,SAAS,GAAG,4BAAe,IAAI,CAAC,IAApB,EAA0B,OAA1B,CAAkC,KAAlC,KAA4C,CAA9D;AACA,YAAM,QAAQ,GAAG,+BAAkB,QAAlB,EAA4B,SAA5B,CAAjB;AACA,YAAI,WAAW,GAAG,EAAlB;;AAEA,YAAI,SAAJ,EAAe;AACb,cAAM,aAAW,GAAG,+BAAkB,QAAlB,EAA4B,SAA5B,EAAuC,IAAvC,CAApB;AAEA,cAAM,UAAU,GAAG,oBAAE,KAAF,CAAQ,eAAR,IAA2B,gBAA3B,GAA8C,eAAjE;AACA,qBAAW,GAAG,4BAAe;AAC3B,kBAAM,QADqB;AAE3B,0BAAc,gBAFa;AAG3B,oBAAQ,EAAE,aAAW,KAAK,QAAhB,GAA2B,aAA3B,GAAyC,QAHxB;AAI3B,oBAAQ,EAAE,QAAQ,CAAC,UAAD,CAJS;AAK3B,sBAAU;AALiB,WAAf,CAAd;;AAQA,cAAI,aAAW,KAAK,QAApB,EAA8B;AAC5B,uBAAW,GAAG,WAAW,CAAC,GAAZ,CAAgB,UAAC,GAAD,EAA+D;AAAK,2CAC7F,GAD6F,GAC1F;AACN,wBAAQ,wBAAO,GAAG,CAAC,QAAX,GAAmB;AAAE,wBAAM,EAAE,GAAG,CAAC,QAAJ,CAAa,MAAb,GAAsB,aAAW,GAF0B;AAErE,iBAAnB;AADF,eAD0F;AAGhG,aAHY,CAAd;AAID;AACF;;AACD,YAAM,WAAW,GAAG,IAAI,IAAI,IAAI,CAAC,IAAb,IAAqB,IAAI,CAAC,IAAL,CAAU,eAAnD;;AAEA,YAAI,WAAJ,EAAiB;AACf,cAAM,UAAU,GAAG,uBAAuB,GACtC;AACE,uBAAW,EAAE,kCAAqB,KAAI,CAAC,oBAA1B,EAAgD,IAAhD,EAAsD,IAAI,CAAC,KAAL,CAAW,OAAjE;AADf,WADsC,GAItC;AACE,4BAAgB,EAAE,kCAAqB,KAAI,CAAC,oBAA1B,EAAgD,IAAhD,EAAsD,IAAI,CAAC,KAAL,CAAW,YAAjE,CADpB;AAEE,4BAAgB,EAAE,kCAAqB,KAAI,CAAC,oBAA1B,EAAgD,IAAhD,EAAsD,IAAI,CAAC,KAAL,CAAW,YAAjE;AAFpB,WAJJ;AAQA,uBAAa,CAAC,IAAd,CAAmB;AACjB,iBAAK,wBACA,WAAW,gCACT,OADS,GACF;AACV,2BAAa,eADH;AAEV,mBAAK,OAFK;AAGV,qBAAO,SAHG;AAIV,kBAAI,MAJM;AAKV,sBAAQ,UALE;AAMV,yBAAW,aAND;AAOV,oBAAM,QAPI;AAQV,yBAAW,aARD;AASV,oBAAM,QATI;AAUV,4BAAc,gBAVJ;AAWV,0BAAY;AAXF,aADE,GAaT,UAbS,EADX,IAeD;AACF,iBAAG,EAAE,IAAI,CAAC,GAAL,IAAY,UAAQ;AADvB,eAC8B,GAC/B,eAD+B,IACb,OAAO,CAAC,eAAD,CAFxB,EAEyC,GAC1C,YAD0C,IAC3B,OAAO,CAAC,YAAD,CAHrB,EAIF,iBAAa,QAJX,EAImB,EAnBlB,EADY;AAsBjB,sBAAU,EAAE,6BAAgB,IAAhB,EAAsB,KAAK,CAAC,QAA5B,CAtBK;AAuBjB,gBAAI;AAvBa,WAAnB;AAyBD;AACF,OAnFD;AAqFA,aAAO,aAAP;AACD,KAhGD;;AAkGA;AACU;AACF;AAAA,UAAE,sCAAF;AAAA,UAAoB,kBAApB;AAAA,UAA4B,4CAA5B;AACN,UAAM,QAAQ,GAAG,mBAAmB,GAAG,CAAvC;AAEA,aAAO;AACL,cAAM,EAAE,MADH;AAEL,YAAI,EAAE,MAFD;AAGL,SAAC,EAAE,MAAM,KAAK,YAAX,GAA0B,gBAAgB,CAAC,CAAjB,GAAqB,QAA/C,GAA0D,MAAM,CAAC,IAAP,GAAc,GAHtE;AAIL,SAAC,EAAE,MAAM,KAAK,YAAX,GAA0B,MAAM,CAAC,GAAP,GAAa,GAAvC,GAA6C,gBAAgB,CAAC,CAAjB,GAAqB,QAJhE;AAKL,aAAK,EAAE,MAAM,KAAK,YAAX,GAA0B,mBAA1B,GAAgD,MAAM,CAAC,KAAP,GAAe,CALjE;AAML,cAAM,EAAE,MAAM,KAAK,YAAX,GAA0B,MAAM,CAAC,MAAP,GAAgB,CAA1C,GAA8C;AANjD,OAAP;AAQD,KAbD;;AAeA;AACU;AACF;AAAA,UAAE,sCAAF;AAAA,UAAoB,kBAApB;AACN,UAAI,EAAJ,EAAQ,EAAR,EAAY,EAAZ,EAAgB,EAAhB;;AAEA,UAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,UAAE,GAAG,gBAAgB,CAAC,CAAtB;AACA,UAAE,GAAG,EAAL;AACA,UAAE,GAAG,MAAM,CAAC,GAAZ;AACA,UAAE,GAAG,MAAM,CAAC,GAAP,GAAa,MAAM,CAAC,MAAzB;AACD,OALD,MAKO,IAAI,MAAM,KAAK,UAAf,EAA2B;AAChC,UAAE,GAAG,gBAAgB,CAAC,CAAtB;AACA,UAAE,GAAG,EAAL;AACA,UAAE,GAAG,MAAM,CAAC,IAAZ;AACA,UAAE,GAAG,MAAM,CAAC,IAAP,GAAc,MAAM,CAAC,KAA1B;AACD,OALM,MAKA,IAAI,CAAC,oBAAE,KAAF,CAAQ,gBAAgB,CAAC,EAAzB,CAAD,IAAiC,CAAC,oBAAE,KAAF,CAAQ,gBAAgB,CAAC,EAAzB,CAAtC,EAAoE;AACzE,YAAI,MAAM,KAAK,SAAf,EAA0B;AAChB;AAAA,cAAI,wBAAJ;AAAA,cAAQ,0CAAR;AAAA,cAAqB,0CAArB;AAAA,cAAkC,8BAAlC;AACR,cAAM,UAAU,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,KAAtC,CAAnB;AACA,cAAM,UAAU,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,KAAtC,CAAnB;AACA,YAAE,GAAG,UAAU,CAAC,CAAhB;AACA,YAAE,GAAG,UAAU,CAAC,CAAhB;AACA,YAAE,GAAG,UAAU,CAAC,CAAhB;AACA,YAAE,GAAG,UAAU,CAAC,CAAhB;AACD,SARD,MAQO;AACG;AAAA,cAAI,wBAAJ;AAAA,cAAQ,gCAAR;AAAA,cAAgB,wCAAhB;AAAA,cAA4B,oCAA5B;AACR,cAAM,UAAU,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,UAAjC,CAAnB;AACA,cAAM,QAAQ,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,QAAjC,CAAjB;AAEA,iBAAO;AACL,kBAAM,EAAE,CAAC,UAAD,EAAa,QAAb,CADH;AAEL,cAAE,IAFG;AAGL,cAAE,IAHG;AAIL,kBAAM,QAJD;AAKL,sBAAU,YALL;AAML,oBAAQ;AANH,WAAP;AAQD;AACF;;AAED,aAAO,CACL;AAAE,SAAC,EAAE,EAAL;AAAS,SAAC,EAAE;AAAZ,OADK,EAEL;AAAE,SAAC,EAAE,EAAL;AAAS,SAAC,EAAE;AAAZ,OAFK,CAAP;AAID,KA5CD;;AA8CO,kDAAP,UAA2B,MAA3B,EAA6C;AAC3C,UAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,eAAO;AAAE,yBAAe,EAAE,OAAnB;AAA4B,sBAAY,EAAE;AAA1C,SAAP;AACD;;AACD,UAAI,MAAM,KAAK,UAAf,EAA2B;AACzB,eAAO;AAAE,yBAAe,EAAE,OAAnB;AAA4B,sBAAY,EAAE;AAA1C,SAAP;AACD;;AACD,UAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,eAAO;AAAE,yBAAe,EAAE,YAAnB;AAAiC,sBAAY,EAAE;AAA/C,SAAP;AACD;;AAED,aAAO;AAAE,uBAAe,EAAE,WAAnB;AAAgC,oBAAY,EAAE;AAA9C,OAAP;AACD,KAZM;;AAcP,sEAAoB,QAApB,EAAiC;AACvB;;AAER,UAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,eAAO,QAAQ,CAAC,CAAhB;AACD;;AACD,UAAI,MAAM,KAAK,UAAf,EAA2B;AACzB,eAAO,QAAQ,CAAC,CAAhB;AACD;;AACD,UAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,eAAO,QAAQ,CAAC,KAAhB;AACD;;AAED,aAAO,QAAQ,CAAC,MAAhB;AACD,KAdD;;AAgBA,0DAAQ,CAAR,EAAmB,CAAnB,EAA4B;AAClB;;AAER,UAAI,MAAM,KAAK,YAAX,IAA2B,MAAM,KAAK,UAA1C,EAAsD;AAC5C;AACR,YAAM,SAAS,GACb,CAAC,IAAI,MAAM,CAAC,IAAZ,IAAoB,CAAC,IAAI,MAAM,CAAC,IAAP,GAAc,MAAM,CAAC,KAA9C,IAAuD,CAAC,IAAI,MAAM,CAAC,GAAnE,IAA0E,CAAC,IAAI,MAAM,CAAC,GAAP,GAAa,MAAM,CAAC,MADrG;AAGA,eAAO,SAAS,GAAG;AAAE,WAAC,GAAH;AAAK,WAAC;AAAN,SAAH,GAAc,IAA9B;AACD;;AAEK;AAAA,UAAE,8BAAF;AAAA,UAAgB,gCAAhB;;AAEN,UAAI,YAAY,IAAI,aAApB,EAAmC;AACjC,YAAM,SAAS,GAAG,kCAAsB,YAAtB,CAAlB;AAEA,eAAO,6BAAgB;AAAE,WAAC,GAAH;AAAK,WAAC;AAAN,SAAhB,EAA0B,SAA1B,CAAP;AACD;;AAED,aAAO,IAAP;AACD,KApBD;;AAsBA;AACU;AACR,UAAM,WAAW,GAAG,6BAAgB,QAAhB,EAA0B,qBAAQ,WAAlC,CAApB;AACA,UAAI,aAAa,GAAQ,EAAzB;;AAEA,UAAI,WAAW,IAAI,SAAS,KAAK,MAAjC,EAAyC;AACvC,YAAI,WAAW,CAAC,KAAZ,CAAkB,OAAlB,KAA8B,OAAlC,EAA2C;AACzC,uBAAa,GAAG;AACd,mBAAO,EAAE,KAAK;AADA,WAAhB;AAGD,SAJD,MAIO;AACL,uBAAa,GAAG;AACd,wBAAY,EAAE,KAAK,gBADL;AAEd,uBAAW,EAAE,KAAK,eAFJ;AAGd,wBAAY,EAAE,KAAK,gBAHL;AAId,uBAAW,EAAE,KAAK,eAJJ;AAKd,wBAAY,EAAE,KAAK,gBALL;AAMd,sBAAU,EAAE,KAAK;AANH,WAAhB;AAQD;AACF;;AACD,UAAM,WAAW,GAAG,2BAAmB,KAAK,KAAxB,EAA+B,KAAK,gBAApC,CAApB;AAEA,mCACK,WADL,GAEK,aAFL;AAID,KA3BD;;AA0CA,4FAA0C,EAA1C,EAAgG;AAAhG;;UAA4C,gB;UAAO,kC;UAAgB,8B;UAAc,sB;;AAC/E,UAAI,CAAC,iCAAoB;AAAE,aAAK;AAAP,OAApB,CAAL,EAAqC;AACnC,eAAO,IAAP;AACD;;AAEO;AAAA,UAAU,qBAAV;AAAA,UAAkB,+BAAlB;AAAA,UAA+B,iBAA/B;AAAA,UAAqC,2CAArC;;AACF;AAAA,UAAE,oCAAF;AAAA,UAAmB,8BAAnB;;AACN,UAAM,cAAc,GAAG,2BAAc,QAAd,EAAwB,cAAxB,CAAvB;AACA,UAAM,WAAW,GAAG,oCAClB,IADkB,EAElB,cAFkB,EAGf,eAAe,OAHA,EAIf,YAAY,OAJG,EAKlB,WALkB,EAMlB,iBANkB,CAApB;AAQA,UAAM,OAAO,GAAG,cAAc,CAAC,MAAf,CAAsB,UAAC,MAAD,EAAc,KAAd,EAAwB;;;AAC5D,YAAM,IAAI,GAAM,KAAK,CAAC,QAAN,GAAc,KAA9B;AAEA,qCACK,MADL,IACW,YACR,IADQ,IACD,KAAI,CAAC,UAAL,CAAgB,KAAhB,EAAqB,sBACxB,KADwB,GACnB;AACR,wBAAc,gBADN;AAER,qBAAW,EAAE,KAAK,CAAC,QAAN,KAAmB,eAAnB,IAAsC,WAF3C;AAGR,wBAAc,gBAHN;AAIR,sBAAY;AAJJ,SADmB,CAArB,CADC,EAOP,EARJ;AAUD,OAbe,EAab,EAba,CAAhB;AAeA,UAAM,MAAM,GAAG,KAAK,eAAL,CAAoB,sBAAM,OAAN,GAAa;AAAE,aAAK,OAAP;AAAS,sBAAc;AAAvB,OAAb,CAApB,CAAf;AAEA,YAAM,CAAC,IAAP,CAAY,OAAZ,EAAqB,OAArB,CAA6B,eAAG;AAC9B,eAAO,CAAC,GAAD,CAAP,GAAe,aAAa,CAAC,KAAD,EAAQ,OAAO,CAAC,GAAD,CAAf,EAAsB,MAAtB,EAA8B,GAAG,CAAC,OAAJ,CAAY,KAAZ,EAAmB,EAAnB,CAA9B,EAAsD,SAAtD,CAA5B;AACD,OAFD;AAGA,UAAM,WAAW,GAAG,OAAO,CAAI,YAAY,QAAhB,CAA3B;AACA,UAAM,QAAQ,GAAG,KAAK,qBAAL,CAA2B,WAA3B,CAAjB;AAEA,UAAM,sBAAsB,GAAG,KAAK,cAAL,CAAoB,KAApB,EAAyB,sBACnD,OADmD,GAC5C;AACV,sBAAc,gBADJ;AAEV,oBAAY,cAFF;AAGV,gBAAQ,UAHE;AAIV,sBAAc,gBAJJ;AAKV,mBAAW,aALD;AAMV,cAAM;AANI,OAD4C,CAAzB,CAA/B;AAUA;AACE,8BAAsB,wBADxB;AAEE,sBAAc,gBAFhB;AAGE,cAAM,QAHR;AAIE,mBAAW;AAJb,SAKK,QALL,GAMK,OANL;AAQD,KAzDD;;AA4DA;AACE,2BAAY,EAAZ,CAAe,mBAAf,EAA2B,KAAK,sBAAhC;;AAEA,UAAI,qBAAY,eAAZ,IAA+B,qBAAY,aAA/C,EAA8D;AAC5D,6BAAY,eAAZ,CAA4B,qBAAY,aAAZ,GAA4B,CAAxD;AACD;AACF,KAND;;AAQA;AACE,2BAAY,cAAZ,CAA2B,mBAA3B,EAAuC,KAAK,sBAA5C;;AAEA,UAAI,qBAAY,eAAZ,IAA+B,qBAAY,aAA/C,EAA8D;AAC5D,6BAAY,eAAZ,CAA4B,qBAAY,aAAZ,GAA4B,CAAxD;AACD;AACF,KAND;;AAgBA,kEAAgB,EAAhB,EAA8G;UAA5F,gB;UAAO,kC;UAAgB,gB;UAAA,kC;UAAgC,gB;UAAA,kC;AAC/D;AAAA,UAAO,qBAAP;AAAA,UAAe,yBAAf;AACR,UAAM,MAAM,GAAG,KAAK,CAAC,MAAN,IAAgB,EAA/B;AACA,UAAM,SAAS,GAAG,6BAAgB,QAAhB,EAA0B,mBAAM,WAAhC,CAAlB;AACA,UAAM,UAAU,GAAG,6BAAgB,QAAhB,EAA0B,oBAAO,WAAjC,CAAnB;AAEA,UAAM,OAAO,GAAG,MAAM,CAAC,IAAP,CAAY,QAAZ,EAAsB,MAAtB,CACd,UAAC,MAAD,EAAc,EAAd,EAAqB;;;AACnB,YAAM,KAAK,GAAG,QAAQ,CAAC,EAAD,CAAtB;AACQ;;AAER,YAAI,CAAC,KAAK,CAAC,MAAP,IAAiB,CAAC,KAAK,CAAC,IAA5B,EAAkC;AAChC,uCAAY,MAAZ,IAAkB,YAAG,WAAH,IAAiB,MAAM,CAAC,WAAD,CAAN,GAAsB,KAAK,CAAC,KAA7C,EAAkD,EAApE;AACD;;AAED,eAAO,MAAP;AACD,OAVa,EAWd;AAAE,YAAI,EAAE,MAAM,CAAC,IAAP,IAAe,CAAvB;AAA0B,aAAK,EAAE,MAAM,CAAC,KAAP,IAAgB;AAAjD,OAXc,CAAhB;AAcA,UAAM,OAAO,GAAG,MAAM,CAAC,IAAP,CAAY,QAAZ,EAAsB,MAAtB,CACd,UAAC,MAAD,EAAS,EAAT,EAAW;;;AACT,YAAM,KAAK,GAAG,QAAQ,CAAC,EAAD,CAAtB;AACQ;;AAER,YAAI,CAAC,KAAK,CAAC,MAAP,IAAiB,CAAC,KAAK,CAAC,IAA5B,EAAkC;AAChC,uCAAY,MAAZ,IAAkB,YAAG,WAAH,IAAiB,oBAAE,GAAF,CAAM,MAAN,EAAc,KAAG,WAAjB,IAAkC,KAAK,CAAC,MAAzD,EAA+D,EAAjF;AACD;;AAED,eAAO,MAAP;AACD,OAVa,EAWd;AAAE,WAAG,EAAE,MAAM,CAAC,GAAP,IAAc,CAArB;AAAwB,cAAM,EAAE,MAAM,CAAC,MAAP,IAAiB;AAAjD,OAXc,CAAhB;;AAcA,UAAI,MAAM,yBAAQ,OAAR,GAAoB,OAApB,CAAV;;AAEA,UAAM,WAAW,GAAG,MAAM,CAAC,MAA3B;;AAEA,UAAI,SAAJ,EAAe;AACb,cAAM,CAAC,MAAP,IAAiB,SAAS,CAAC,KAAV,CAAgB,MAAhB,IAA0B,mBAAM,YAAN,CAAmB,MAA9D;AACD;;AAED,UAAI,UAAU,IAAI,KAAK,cAAvB,EAAuC;AACrC,YAAM,SAAS,GAAG,KAAK,cAAL,CAAoB,OAApB,EAAlB;AAEA,cAAM,GAAG,kCAAqB,MAArB,EAA6B,cAA7B,EAA6C,KAA7C,EAAoD,SAApD,CAAT;AACD;;AAED;AACE,mBAAW;AADb,SAEK,MAFL,GAEW;AACT,aAAK,EAAE,KAAK,GAAG,MAAM,CAAC,IAAf,GAAsB,MAAM,CAAC,KAD3B;AAET,cAAM,EAAE,MAAM,GAAG,MAAM,CAAC,GAAhB,GAAsB,MAAM,CAAC;AAF5B,OAFX;AAMD,KAtDD;;AAoSA,mEAAiB,IAAjB,EAA0B;AAChB;;AAER,UAAI,CAAC,oBAAE,KAAF,CAAQ,MAAR,CAAL,EAAsB;AACpB,6BAAY,IAAZ,CAAiB,mBAAjB,EAA6B,MAA7B,EAAqC,KAAK,aAA1C,EAAyD,IAAzD;AACD;AACF,KAND;;AA8CA,mEAAiB,IAAjB,EAA4B,WAA5B,EAA8C,UAA9C,EAA6D;AACnD;;AAER,WAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,sBAAsB,CAAC,MAA7C,EAAqD,CAAC,GAAG,GAAzD,EAA8D,CAAC,EAA/D,EAAmE;AACjE,YAAM,KAAK,GAAG,sBAAsB,CAAC,CAAD,CAApC;;AAEA,YACE,KAAK,CAAC,IAAN,KAAe,IAAf,IACA,KAAK,CAAC,KAAN,CAAY,GAAZ,KAAoB,IAAI,CAAC,GADzB,IAEC,WAAW,KAAK,4BAAe,KAAK,CAAC,IAAN,CAAW,IAA1B,CAAhB,IAAmD,UAAU,KAAK,KAAK,CAAC,UAH3E,EAIE;AACA,iBAAO,KAAP;AACD;AACF;;AAED,aAAO,IAAP;AACD,KAhBD;;AAqGA,6DAAW,WAAX,EAAuC,OAAvC,EAAqD,WAArD,EAA0E,KAA1E,EAAuF;AAC/E;AAAA,UAAE,gBAAF;AAAA,UAAS,kBAAT;AAEN,aACE,iCAAC,0BAAD,EAAc,aACP,WADO,EACY;AACxB,iBAAS,EAAE,cAAY,WAAW,CAAC,QAAxB,GAAgC,GAAhC,GAAoC,WAAW,CAAC,QADnC;AAExB,WAAG,EAAE,OAAO,CAAC,GAAR,IAAkB,WAAW,MAAX,GAAe,KAFd;AAGxB,eAAO,EAAE;AAAE,WAAC,EAAE,CAAL;AAAQ,WAAC,EAAE,CAAX;AAAc,eAAK,OAAnB;AAAqB,gBAAM;AAA3B,SAHe;AAIxB,sBAAc,EAAE,KAAK;AAJG,OADZ,CAAd,CADF;AASD,KAZD;;AA+JO,8CAAP,UAAuB,MAAvB,EAAoC,KAApC,EAA8C;AAC5C,UAAI,GAAJ;;AAEA,UAAI,uBAAe,MAAf,CAAJ,EAA4B;AAC1B,WAAG,GAAG,qBAAa,MAAb,EAAqB,KAArB,CAAN;AACD,OAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,WAAG,GAAG,MAAM,CAAC,KAAD,CAAZ;AACD,OAFM,MAEA;AACL,WAAG,GAAG,iCAAC,gBAAD,EAAI,aAAK,KAAL,CAAJ,CAAN;AACD;;AAED,aACE,iCAAC,kBAAD,EAAM;AAAC,iBAAS,EAAC,qBAAX;AAAiC,WAAG,EAAE,KAAK,CAAC;AAA5C,OAAN,EACG,GADH,CADF;AAKD,KAhBM;;AAsHP;AACU;AAEN;AAAA,UAAU,cAAV;AAAA,UAAgB,YAAhB;AAAA,UAAqB,kBAArB;AAAA,UAA6B,gBAA7B;AAGF,aACE,+CACE;AAAU,UAAE,EAAE;AAAd,SACE;AAAM,SAAC,EAAE,IAAT;AAAe,SAAC,EAAE,GAAlB;AAAuB,cAAM,EAAE,MAA/B;AAAuC,aAAK,EAAE;AAA9C,QADF,CADF,CADF;AAOD,KAbD;;AAeA;AAAA;;AACE,UAAI,CAAC,iCAAoB,IAApB,CAAL,EAAgC;AAC9B,eAAO,IAAP;AACD;;AAED,UAAM,eAAN;AAAA,UAAQ,sBAAR;AAAA,UAAkB,wBAAlB;AAAA,UAA6B,gBAA7B;AAAA,UAAoC,kBAApC;AAAA,UAA4C,gBAA5C;AAAA,UAAmD,oBAAnD;AAAA,UAA4D,qFAA5D;;AACA,UAAM,KAAK,GAAG,oBAAY,MAAZ,CAAd;AACA,UAAM,GAAG,GAAG;AACV,qBAAa,EAAE;AAAE,iBAAO,EAAE,KAAK,UAAhB;AAA4B,cAAI,EAAE;AAAlC,SADL;AAEV,qBAAa,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAFL;AAGV,qBAAa,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAHL;AAIV,oBAAY,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAJJ;AAKV,aAAK,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SALG;AAMV,aAAK,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SANG;AAOV,aAAK,EAAE;AAAE,iBAAO,EAAE,KAAK,WAAhB;AAA6B,cAAI,EAAE;AAAnC,SAPG;AAQV,WAAG,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SARK;AASV,YAAI,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SATI;AAUV,YAAI,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAVI;AAWV,aAAK,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAXG;AAYV,iBAAS,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAZD;AAaV,eAAO,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAbC;AAcV,WAAG,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAdK;AAeV,cAAM,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAfE;AAgBV,eAAO,EAAE;AAAE,iBAAO,EAAE,KAAK,YAAhB;AAA8B,cAAI,EAAE;AAApC,SAhBC;AAiBV,iBAAS,EAAE;AAAE,iBAAO,EAAE,KAAK,eAAhB;AAAiC,cAAI,EAAE;AAAvC,SAjBD;AAkBV,sBAAc,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAlBN;AAmBV,uBAAe,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB,SAnBP;AAoBV,kBAAU,EAAE;AAAE,iBAAO,EAAE,KAAK;AAAhB;AApBF,OAAZ;;AAwBA,UAAI,OAAJ,EAAa;AACX,eACE,iCAAC,oBAAD,EAAQ,aAAK,KAAL,EAAU;AAAE,eAAK,EAAE,KAAT;AAAgB,gBAAM,EAAE;AAAxB,SAAV,CAAR,EACG,KAAK,cAAL,EADH,EAEG,2BAAc,QAAd,EAAwB,GAAxB,CAFH,CADF;AAMD;;AAED,UAAM,MAAM,GAAG,KAAK,oBAAL,EAAf;AACA,aACE;AACE,iBAAS,EAAE,wBAAW,kBAAX,EAA+B,SAA/B,CADb;AAEE,aAAK;AAAI,kBAAQ,EAAE,UAAd;AAA0B,gBAAM,EAAE,SAAlC;AAA6C,eAAK,OAAlD;AAAoD,gBAAM;AAA1D,WAA+D,KAA/D;AAFP,SAGM,MAHN,EAGY;AACV,WAAG,EAAE,mBAAI;AACP,eAAI,CAAC,SAAL,GAAiB,IAAjB;AACD;AAHS,OAHZ,GAQE,iCAAC,oBAAD,EAAQ,aAAK,KAAL,EAAU;AAAE,aAAK,EAAE,KAAT;AAAgB,cAAM,EAAE;AAAxB,OAAV,CAAR,EACG,KAAK,cAAL,EADH,EAEG,2BAAc,QAAd,EAAwB,GAAxB,CAFH,CARF,EAYG,KAAK,YAAL,EAZH,EAaG,KAAK,aAAL,EAbH,CADF;AAiBD,KA1DD;;AA2DF;AAAC,G,CApqDqC,iB,GAC7B,iBAAc,S,EASd,kBAAY;AACjB,UAAM,EAAE,YADS;AAEjB,eAAW,EAAE,MAFI;AAGjB,kBAAc,EAAE,KAHC;AAIjB,UAAM,EAAE,CAJS;AAKjB,UAAM,EAAE;AAAE,SAAG,EAAE,CAAP;AAAU,WAAK,EAAE,CAAjB;AAAoB,YAAM,EAAE,CAA5B;AAA+B,UAAI,EAAE;AAArC,KALS;AAMjB,qBAAiB,EAAE;AANF,KAOd,YAPc,C,EAeZ,wBAAqB,UAAC,KAAD,EAA6B;AAC/C;AAAA,QAAU,6CAAV;AACR,QAAM,SAAS,GAAG,6BAAgB,QAAhB,EAA0B,mBAAM,WAAhC,CAAlB;AACA,QAAM,UAAU,GAAI,SAAS,IAAI,SAAS,CAAC,KAAvB,IAAgC,SAAS,CAAC,KAAV,CAAgB,UAAjD,IAAgE,CAAnF;AACA,QAAM,QAAQ,GACX,SAAS,IAAI,SAAS,CAAC,KAAvB,IAAgC,SAAS,CAAC,KAAV,CAAgB,QAAjD,IAA+D,KAAK,CAAC,IAAN,IAAc,KAAK,CAAC,IAAN,CAAW,MAAX,GAAoB,CAAjG,IAAuG,CADzG;AAEA,WAAO;AACL,YAAM,EAAE,CADH;AAEL,YAAM,EAAE,CAFH;AAGL,oBAAc,EAAE,UAHX;AAIL,kBAAY,EAAE,QAJT;AAKL,wBAAkB,EAAE,CAAC,CALhB;AAML,qBAAe,EAAE,CAAC,oBAAE,KAAF,CAAQ,kBAAR,CAAD,GAA+B,kBAA/B,GAAoD;AANhE,KAAP;AAQA,G,EAEK,YAAS,UAAC,cAAD,EAAsB;AACpC,QAAI,CAAC,cAAD,IAAmB,CAAC,cAAc,CAAC,MAAvC,EAA+C;AAC7C,aAAO,KAAP;AACD;;AAED,WAAO,cAAc,CAAC,IAAf,CAAoB,UAAC,IAAD,EAAU;AACnC,UAAM,IAAI,GAAG,4BAAe,IAAI,IAAI,IAAI,CAAC,IAA5B,CAAb;AAEA,aAAO,IAAI,IAAI,IAAI,CAAC,OAAL,CAAa,KAAb,KAAuB,CAAtC;AACD,KAJM,CAAP;AAKA,G,EAEK,sBAAmB,UACxB,KADwB,EAExB,EAFwB,EAGxB,IAHwB,EAGd;QADR,kC;QAAgB,kC;QAAgB,8B;AAGlC,QAAM,SAAS,GAAG,CAAC,cAAc,IAAI,EAAnB,EAAuB,MAAvB,CAA8B,UAAC,MAAD,EAAc,KAAd,EAAwB;AACtE,UAAM,QAAQ,GAAG,KAAK,CAAC,KAAN,CAAY,IAA7B;;AAEA,UAAI,QAAQ,IAAI,QAAQ,CAAC,MAAzB,EAAiC;AAC/B,8BAAW,MAAX,EAAsB,QAAtB;AACD;;AAED,aAAO,MAAP;AACD,KARiB,EAQf,EARe,CAAlB;;AASA,QAAI,SAAS,IAAI,SAAS,CAAC,MAAV,GAAmB,CAApC,EAAuC;AACrC,aAAO,SAAP;AACD;;AAED,QAAI,IAAI,IAAI,IAAI,CAAC,KAAb,IAAsB,IAAI,CAAC,KAAL,CAAW,IAAjC,IAAyC,IAAI,CAAC,KAAL,CAAW,IAAX,CAAgB,MAAhB,GAAyB,CAAtE,EAAyE;AACvE,aAAO,IAAI,CAAC,KAAL,CAAW,IAAlB;AACD;;AAEO;;AAER,QAAI,IAAI,IAAI,IAAI,CAAC,MAAb,IAAuB,qBAAS,cAAT,CAAvB,IAAmD,qBAAS,YAAT,CAAvD,EAA+E;AAC7E,aAAO,IAAI,CAAC,KAAL,CAAW,cAAX,EAA2B,YAAY,GAAG,CAA1C,CAAP;AACD;;AAED,WAAO,EAAP;AACA,G;AAklDH,CA7qDH;;AA+qDA,qBAAe,wBAAf,C;;;;;;;;;;;;;;;;;;AC/0DA,SAAS,IAAT,CAAc,KAAd,EAA0B;AACxB,SAAO,IAAP;AACD;;AACD,IAAI,CAAC,WAAL,GAAmB,MAAnB;AAEA,qBAAe,IAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACTA;;AACA;;AACA;;AACA;;AAWA,SAAwB,UAAxB,CAAyD,EAAzD,EAA6F;AAAlC;AAAA,MAAW,iCAAX;;AACzD,MAAI,KAAJ;;AACA,MAAI,uBAAe,SAAf,CAAJ,EAA+B;AAC7B,SAAK,GAAG,qBAAa,SAAb,EAAwB,KAAxB,CAAR;AACD,GAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,SAAb,CAAJ,EAA6B;AAClC,SAAK,GAAG,sBAAc,SAAd,EAAyB,KAAzB,CAAR;AACD,GAFM,MAEA;AACL,oBAAK,KAAL,EAAY,+EAAZ,UAAoG,SAApG;AACD;;AACD,SAAO,iCAAC,kBAAD,EAAM;AAAC,aAAS,EAAC;AAAX,GAAN,EAAgD,KAAhD,CAAP;AACD;;AAVD;AAYA,UAAU,CAAC,WAAX,GAAyB,YAAzB,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1BA;;AACA;;AACA;;AACA;;AACA;;AAEA,IAAM,IAAI,GAAG,EAAb;;AAkCA;AAAgD;;AAAhD;;AAyIC;;AAzHC,wDAAW,IAAX,EAAqC;AAC3B;AACR,QAAM,QAAQ,GAAG,IAAI,GAAG,CAAxB;AACA,QAAM,SAAS,GAAG,IAAI,GAAG,CAAzB;AACA,QAAM,SAAS,GAAG,IAAI,GAAG,CAAzB;AACA,QAAM,KAAK,GAAG,IAAI,CAAC,QAAL,GAAgB,aAAhB,GAAgC,IAAI,CAAC,KAAnD;;AAEA,QAAI,IAAI,CAAC,IAAL,KAAc,WAAlB,EAA+B;AAC7B,aACE;AACE,mBAAW,EAAE,CADf;AAEE,YAAI,EAAC,MAFP;AAGE,cAAM,EAAE,KAHV;AAIE,uBAAe,EAAE,IAAI,CAAC,OAAL,CAAa,eAJhC;AAKE,UAAE,EAAE,CALN;AAME,UAAE,EAAE,QANN;AAOE,UAAE,EAAE,IAPN;AAQE,UAAE,EAAE,QARN;AASE,iBAAS,EAAC;AATZ,QADF;AAaD;;AACD,QAAI,IAAI,CAAC,IAAL,KAAc,MAAlB,EAA0B;AACxB,aACE;AACE,mBAAW,EAAE,CADf;AAEE,YAAI,EAAC,MAFP;AAGE,cAAM,EAAE,KAHV;AAIE,SAAC,EAAE,QAAM,QAAN,GAAc,GAAd,GAAkB,SAAlB,GAA2B,iBAA3B,GACE,SADF,GACW,GADX,GACe,SADf,GACwB,SADxB,GACkC,IAAI,SADtC,GAC+C,GAD/C,GACmD,QADnD,GAC2D,iBAD3D,GAEE,IAFF,GAEM,GAFN,GAEU,IAAI,SAFd,GAEuB,GAFvB,GAE2B,QAF3B,GAEmC,iBAFnC,GAGE,SAHF,GAGW,GAHX,GAGe,SAHf,GAGwB,SAHxB,GAGkC,SAHlC,GAG2C,GAH3C,GAG+C,QAPpD;AAQE,iBAAS,EAAC;AARZ,QADF;AAYD;;AACD,QAAI,IAAI,CAAC,IAAL,KAAc,MAAlB,EAA0B;AACxB,aACE;AACE,cAAM,EAAC,MADT;AAEE,YAAI,EAAE,KAFR;AAGE,SAAC,EAAE,QAAM,IAAI,GAAG,CAAb,GAAc,GAAd,GAAkB,IAAlB,GAAsB,GAAtB,GAA2B,IAAI,GAAG,CAAR,GAAa,CAAvC,GAAwC,GAAxC,GAA4C,CAAC,IAA7C,GAAiD,GAHtD;AAIE,iBAAS,EAAC;AAJZ,QADF;AAQD;;AAED,WACE,iCAAC,oBAAD,EAAQ;AACN,UAAI,EAAE,KADA;AAEN,QAAE,EAAE,QAFE;AAGN,QAAE,EAAE,QAHE;AAIN,UAAI,EAAE,IAJA;AAKN,cAAQ,EAAC,UALH;AAMN,UAAI,EAAE,IAAI,CAAC;AANL,KAAR,CADF;AAUD,GAzDD;;AA+DA;AAAA;;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,sBAAX;AAAA,QAAqB,kBAArB;AAAA,QAA6B,wBAA7B;AACN,QAAM,OAAO,GAAG;AAAE,OAAC,EAAE,CAAL;AAAQ,OAAC,EAAE,CAAX;AAAc,WAAK,EAAE,IAArB;AAA2B,YAAM,EAAE;AAAnC,KAAhB;AACA,QAAM,SAAS,GAAG;AAChB,aAAO,EAAE,MAAM,KAAK,YAAX,GAA0B,cAA1B,GAA2C,OADpC;AAEhB,iBAAW,EAAE;AAFG,KAAlB;AAIA,QAAM,QAAQ,GAAG;AAAE,aAAO,EAAE,cAAX;AAA2B,mBAAa,EAAE,QAA1C;AAAoD,iBAAW,EAAE;AAAjE,KAAjB;AAEA,WAAO,OAAO,CAAC,GAAR,CAAY,UAAC,KAAD,EAAQ,CAAR,EAAS;;;AAC1B,UAAM,cAAc,GAAG,KAAK,CAAC,SAAN,IAAmB,SAA1C;AACA,UAAM,SAAS,GAAG,yBAAU;AAC1B,gCAAwB;AADE,SAE1B,GAAC,iBAAe,CAAhB,IAAsB,IAFI,EAG1B,cAAU,KAAK,CAAC,QAHU,EAI1B,EAJgB,EAAlB;;AAMA,UAAI,KAAK,CAAC,IAAN,KAAe,MAAnB,EAA2B;AACzB,eAAO,IAAP;AACD;;AAED,aACE;AACE,iBAAS,EAAE,SADb;AAEE,aAAK,EAAE,SAFT;AAGE,WAAG,EAAE,iBAAe;AAHtB,SAIM,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAJN,GAME,iCAAC,oBAAD,EAAQ;AAAC,aAAK,EAAE,QAAR;AAAkB,cAAM,EAAE,QAA1B;AAAoC,eAAO,EAAE,OAA7C;AAAsD,aAAK,EAAE;AAA7D,OAAR,EACG,KAAI,CAAC,UAAL,CAAgB,KAAhB,CADH,CANF,EASE;AAAM,iBAAS,EAAC;AAAhB,SACG,cAAc,GAAG,cAAc,CAAC,KAAK,CAAC,KAAP,EAAc,KAAd,EAAqB,CAArB,CAAjB,GAA2C,KAAK,CAAC,KADlE,CATF,CADF;AAeD,KA3BM,CAAP;AA4BD,GArCD;;AAuCA;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,kBAAX;AAAA,QAAmB,gBAAnB;;AAEN,QAAI,CAAC,OAAD,IAAY,CAAC,OAAO,CAAC,MAAzB,EAAiC;AAC/B,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG;AACjB,aAAO,EAAE,CADQ;AAEjB,YAAM,EAAE,CAFS;AAGjB,eAAS,EAAE,MAAM,KAAK,YAAX,GAA0B,KAA1B,GAAkC;AAH5B,KAAnB;AAMA,WACE;AAAI,eAAS,EAAC,yBAAd;AAAwC,WAAK,EAAE;AAA/C,OACG,KAAK,WAAL,EADH,CADF;AAKD,GAlBD;;AArHO,qCAAc,QAAd;AAEA,sCAAe;AACpB,YAAQ,EAAE,EADU;AAEpB,UAAM,EAAE,YAFY;AAGpB,SAAK,EAAE,QAHa;AAIpB,iBAAa,EAAE,QAJK;AAKpB,iBAAa,EAAE;AALK,GAAf;AAsIT;AAAC,CAzID,CAAgD,qBAAhD;;AA2IA,qBAAe,oBAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnLA;;AACA;;AACA;;AACA;;AAEA,SAAS,gBAAT,CAA6B,KAA7B,EAAqC;AACnC,SAAO,oBAAE,OAAF,CAAU,KAAV,KAAoB,uBAAW,KAAK,CAAC,CAAD,CAAhB,CAApB,IAA4C,uBAAW,KAAK,CAAC,CAAD,CAAhB,CAA5C,GAAmE,KAAK,CAAC,IAAN,CAAW,KAAX,CAAnE,GAAuF,KAA9F;AACD;;AAqCD;AAAsF;;AAAtF;;AA6FC;;AAjFC;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,wBAAX;AAAA,QAAsB,wBAAtB;AAAA,QAAiC,wBAAjC;AAAA,QAA4C,0BAA5C;;AAEN,QAAI,OAAO,IAAI,OAAO,CAAC,MAAvB,EAA+B;AAC7B,UAAM,SAAS,GAAG;AAAE,eAAO,EAAE,CAAX;AAAc,cAAM,EAAE;AAAtB,OAAlB;AAEA,UAAM,KAAK,GAAG,CAAC,UAAU,GAAG,oBAAE,MAAF,CAAS,OAAT,EAAkB,UAAlB,CAAH,GAAmC,OAA9C,EAAuD,GAAvD,CAA2D,UAAC,KAAD,EAAQ,CAAR,EAAS;AAChF,YAAI,KAAK,CAAC,IAAN,KAAe,MAAnB,EAA2B;AACzB,iBAAO,IAAP;AACD;;AAED,YAAM,cAAc;AAClB,iBAAO,EAAE,OADS;AAElB,oBAAU,EAAE,CAFM;AAGlB,uBAAa,EAAE,CAHG;AAIlB,eAAK,EAAE,KAAK,CAAC,KAAN,IAAe;AAJJ,WAKf,SALe,CAApB;;AAOA,YAAM,cAAc,GAAG,KAAK,CAAC,SAAN,IAAmB,SAAnB,IAAgC,gBAAvD;AACM;AAAA,YAAM,mBAAN;;AACN,YAAI,cAAJ,EAAoB;AAClB,cAAM,SAAS,GAAG,cAAc,CAAC,KAAD,EAAQ,IAAR,EAAc,KAAd,EAAqB,CAArB,EAAwB,OAAxB,CAAhC;;AACA,cAAI,KAAK,CAAC,OAAN,CAAc,SAAd,CAAJ,EAA8B;AAC3B,kCAAO,mBAAP;AACF,WAFD,MAEO;AACL,iBAAK,GAAG,SAAR;AACD;AACF;;AACD,eAEE;AAAI,mBAAS,EAAC,uBAAd;AAAsC,aAAG,EAAE,kBAAgB,CAA3D;AAAgE,eAAK,EAAE;AAAvE,WACG,uBAAW,IAAX,IAAmB;AAAM,mBAAS,EAAC;AAAhB,WAA8C,IAA9C,CAAnB,GAAgF,IADnF,EAEG,uBAAW,IAAX,IAAmB;AAAM,mBAAS,EAAC;AAAhB,WAAmD,SAAnD,CAAnB,GAA0F,IAF7F,EAGE;AAAM,mBAAS,EAAC;AAAhB,WAA+C,KAA/C,CAHF,EAIE;AAAM,mBAAS,EAAC;AAAhB,WAA8C,KAAK,CAAC,IAAN,IAAc,EAA5D,CAJF,CAFF;AASD,OA/Ba,CAAd;AAiCA,aACE;AAAI,iBAAS,EAAC,4BAAd;AAA2C,aAAK,EAAE;AAAlD,SACG,KADH,CADF;AAKD;;AAED,WAAO,IAAP;AACD,GA/CD;;AAiDA;AACQ;AAAA,QAAE,sCAAF;AAAA,QAAoB,8BAApB;AAAA,QAAkC,kCAAlC;AAAA,QAAkD,0BAAlD;AAAA,QAA8D,gBAA9D;AAAA,QAAqE,kCAArE;AAAA,QAAqF,oBAArF;;AACN,QAAM,UAAU;AACd,YAAM,EAAE,CADM;AAEd,aAAO,EAAE,EAFK;AAGd,qBAAe,EAAE,MAHH;AAId,YAAM,EAAE,gBAJM;AAKd,gBAAU,EAAE;AALE,OAMX,YANW,CAAhB;;AAQA,QAAM,eAAe;AACnB,YAAM,EAAE;AADW,OAEhB,UAFgB,CAArB;;AAIA,QAAM,QAAQ,GAAG,CAAC,oBAAE,KAAF,CAAQ,KAAR,CAAlB;AACA,QAAI,UAAU,GAAG,QAAQ,GAAG,KAAH,GAAW,EAApC;AACA,QAAM,SAAS,GAAG,wBAAW,0BAAX,EAAuC,gBAAvC,CAAlB;AACA,QAAM,OAAO,GAAG,wBAAW,wBAAX,EAAqC,cAArC,CAAhB;;AAEA,QAAI,QAAQ,IAAI,cAAhB,EAAgC;AAC9B,gBAAU,GAAG,cAAc,CAAC,KAAD,EAAQ,OAAR,CAA3B;AACD;;AAED,WACE;AAAK,eAAS,EAAE,SAAhB;AAA2B,WAAK,EAAE;AAAlC,OACE;AAAG,eAAS,EAAE,OAAd;AAAuB,WAAK,EAAE;AAA9B,OACG,mBAAM,cAAN,CAAqB,UAArB,IAAmC,UAAnC,GAAgD,KAAG,UADtD,CADF,EAIG,KAAK,aAAL,EAJH,CADF;AAQD,GA/BD;;AA1DO,sCAAc,uBAAd;AAEA,uCAAe;AACpB,aAAS,EAAE,KADS;AAEpB,gBAAY,EAAE,EAFM;AAGpB,aAAS,EAAE,EAHS;AAIpB,cAAU,EAAE;AAJQ,GAAf;AAwFT;AAAC,CA7FD,CAAsF,qBAAtF;;AA+FA,qBAAe,qBAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9IA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AA2DA,IAAM,QAAQ,GAAG,SAAX,QAAW,CAAC,KAAD,EAAa;AACpB;AAAA,MAAO,2BAAP;AACR,MAAM,KAAK,GAAG,oBAAE,KAAF,CAAQ,KAAK,CAAC,QAAd,IAA0B,KAA1B,GAAkC,KAAK,CAAC,QAAtD;;AAEA,MAAI,oBAAE,UAAF,CAAa,SAAb,CAAJ,EAA6B;AAC3B,WAAO,SAAS,CAAC,KAAD,CAAhB;AACD;;AAED,SAAO,KAAP;AACD,CATD;;AAWA,IAAM,aAAa,GAAG,SAAhB,aAAgB,CAAC,UAAD,EAAqB,QAArB,EAAqC;AACzD,MAAM,IAAI,GAAG,qBAAS,QAAQ,GAAG,UAApB,CAAb;AACA,MAAM,UAAU,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,QAAQ,GAAG,UAApB,CAAT,EAA0C,GAA1C,CAAnB;AAEA,SAAO,IAAI,GAAG,UAAd;AACD,CALD;;AAOA,IAAM,iBAAiB,GAAG,SAApB,iBAAoB,CAAC,UAAD,EAAoB,KAApB,EAAsC,KAAtC,EAAmF;AACnG;AAAA,MAAU,4BAAV;AAAA,MAAmB,0BAAnB;AAAA,MAA2B,gCAA3B;AACF;AAAA,MAAE,UAAF;AAAA,MAAM,UAAN;AAAA,MAAU,4BAAV;AAAA,MAAuB,4BAAvB;AAAA,MAAoC,0BAApC;AAAA,MAAgD,sBAAhD;AAAA,MAA0D,wBAA1D;AACN,MAAM,MAAM,GAAG,CAAC,WAAW,GAAG,WAAf,IAA8B,CAA7C;AACA,MAAM,UAAU,GAAG,aAAa,CAAC,UAAD,EAAa,QAAb,CAAhC;AACA,MAAM,IAAI,GAAG,UAAU,IAAI,CAAd,GAAkB,CAAlB,GAAsB,CAAC,CAApC;AACA,MAAI,UAAJ,EAAgB,SAAhB;;AAEA,MAAI,QAAQ,KAAK,aAAjB,EAAgC;AAC9B,cAAU,GAAG,UAAU,GAAG,IAAI,GAAG,MAAjC;AACA,aAAS,GAAG,SAAZ;AACD,GAHD,MAGO,IAAI,QAAQ,KAAK,WAAjB,EAA8B;AACnC,cAAU,GAAG,QAAQ,GAAG,IAAI,GAAG,MAA/B;AACA,aAAS,GAAG,CAAC,SAAb;AACD,GAHM,MAGA,IAAI,QAAQ,KAAK,KAAjB,EAAwB;AAC7B,cAAU,GAAG,QAAQ,GAAG,IAAI,GAAG,MAA/B;AACA,aAAS,GAAG,SAAZ;AACD;;AAED,WAAS,GAAG,UAAU,IAAI,CAAd,GAAkB,SAAlB,GAA8B,CAAC,SAA3C;AAEA,MAAM,UAAU,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,UAAjC,CAAnB;AACA,MAAM,QAAQ,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,UAAU,GAAG,CAAC,SAAS,GAAG,CAAH,GAAO,CAAC,CAAlB,IAAuB,GAArE,CAAjB;AACA,MAAM,IAAI,GAAG,MAAI,UAAU,CAAC,CAAf,GAAgB,GAAhB,GAAoB,UAAU,CAAC,CAA/B,GAAgC,SAAhC,GACR,MADQ,GACF,GADE,GACE,MADF,GACQ,OADR,IACgB,SAAS,GAAG,CAAH,GAAO,CADhC,IACiC,SADjC,GAET,QAAQ,CAAC,CAFA,GAEC,GAFD,GAEK,QAAQ,CAAC,CAF3B;AAGA,MAAM,EAAE,GAAG,oBAAE,KAAF,CAAQ,UAAU,CAAC,EAAnB,IAAyB,qBAAS,uBAAT,CAAzB,GAA6D,UAAU,CAAC,EAAnF;AAEA,SACE,sDAAU,KAAV,EAAe;AAAE,oBAAgB,EAAC,SAAnB;AAA6B,aAAS,EAAE,wBAAW,2BAAX,EAAwC,SAAxC;AAAxC,GAAf,GACE,+CACE;AAAM,MAAE,EAAE,EAAV;AAAc,KAAC,EAAE;AAAjB,IADF,CADF,EAIE;AAAU,aAAS,EAAE,MAAI;AAAzB,KAAgC,KAAhC,CAJF,CADF;AAQD,CApCD;;AAsCA,IAAM,oBAAoB,GAAG,SAAvB,oBAAuB,CAAC,KAAD,EAAa;AAChC;AAAA,MAAS,qBAAT;AAAA,MAAiB,yBAAjB;AACF;AAAA,MAAE,UAAF;AAAA,MAAM,UAAN;AAAA,MAAU,4BAAV;AAAA,MAAuB,4BAAvB;AAAA,MAAoC,0BAApC;AAAA,MAAgD,sBAAhD;AACN,MAAM,QAAQ,GAAG,CAAC,UAAU,GAAG,QAAd,IAA0B,CAA3C;;AAEA,MAAI,QAAQ,KAAK,SAAjB,EAA4B;AACpB;AAAA,QAAE,UAAF;AAAA,QAAK,UAAL;;AAEN,WAAO;AACL,OAAC,KADI;AAEL,OAAC,KAFI;AAGL,gBAAU,EAAE,GAAC,IAAI,EAAL,GAAU,OAAV,GAAoB,KAH3B;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,QAAjB,EAA2B;AACzB,WAAO;AACL,OAAC,EAAE,EADE;AAEL,OAAC,EAAE,EAFE;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,WAAjB,EAA8B;AAC5B,WAAO;AACL,OAAC,EAAE,EADE;AAEL,OAAC,EAAE,EAFE;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,cAAjB,EAAiC;AAC/B,WAAO;AACL,OAAC,EAAE,EADE;AAEL,OAAC,EAAE,EAFE;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAM,CAAC,GAAG,CAAC,WAAW,GAAG,WAAf,IAA8B,CAAxC;;AACM;AAAA,MAAE,QAAF;AAAA,MAAK,QAAL;;AAEN,SAAO;AACL,KAAC,GADI;AAEL,KAAC,GAFI;AAGL,cAAU,EAAE,QAHP;AAIL,kBAAc,EAAE;AAJX,GAAP;AAMD,CApDD;;AAsDA,IAAM,wBAAwB,GAAG,SAA3B,wBAA2B,CAAC,KAAD,EAAa;AACpC;AAAA,MAAS,qBAAT;AAAA,MAAiB,yBAAjB;AACF;AAAA,MAAE,QAAF;AAAA,MAAK,QAAL;AAAA,MAAQ,gBAAR;AAAA,MAAe,kBAAf;AAGN,MAAM,YAAY,GAAG,MAAM,IAAI,CAAV,GAAc,CAAd,GAAkB,CAAC,CAAxC;AACA,MAAM,cAAc,GAAG,YAAY,GAAG,MAAtC;AACA,MAAM,WAAW,GAAG,YAAY,GAAG,CAAf,GAAmB,KAAnB,GAA2B,OAA/C;AACA,MAAM,aAAa,GAAG,YAAY,GAAG,CAAf,GAAmB,OAAnB,GAA6B,KAAnD;AAGA,MAAM,cAAc,GAAG,KAAK,IAAI,CAAT,GAAa,CAAb,GAAiB,CAAC,CAAzC;AACA,MAAM,gBAAgB,GAAG,cAAc,GAAG,MAA1C;AACA,MAAM,aAAa,GAAG,cAAc,GAAG,CAAjB,GAAqB,KAArB,GAA6B,OAAnD;AACA,MAAM,eAAe,GAAG,cAAc,GAAG,CAAjB,GAAqB,OAArB,GAA+B,KAAvD;;AAEA,MAAI,QAAQ,KAAK,KAAjB,EAAwB;AACtB,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CADV;AAEL,OAAC,EAAE,CAAC,GAAG,YAAY,GAAG,MAFjB;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,QAAjB,EAA2B;AACzB,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CADV;AAEL,OAAC,EAAE,CAAC,GAAG,MAAJ,GAAa,cAFX;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,MAAjB,EAAyB;AACvB,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,gBADF;AAEL,OAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAFX;AAGL,gBAAU,EAAE,aAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,OAAjB,EAA0B;AACxB,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAJ,GAAY,gBADV;AAEL,OAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAFX;AAGL,gBAAU,EAAE,eAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,YAAjB,EAA+B;AAC7B,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,gBADF;AAEL,OAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAFX;AAGL,gBAAU,EAAE,eAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,aAAjB,EAAgC;AAC9B,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAJ,GAAY,gBADV;AAEL,OAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAFX;AAGL,gBAAU,EAAE,aAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,WAAjB,EAA8B;AAC5B,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CADV;AAEL,OAAC,EAAE,CAAC,GAAG,cAFF;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,cAAjB,EAAiC;AAC/B,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CADV;AAEL,OAAC,EAAE,CAAC,GAAG,MAAJ,GAAa,cAFX;AAGL,gBAAU,EAAE,QAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,eAAjB,EAAkC;AAChC,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,gBADF;AAEL,OAAC,EAAE,CAAC,GAAG,cAFF;AAGL,gBAAU,EAAE,eAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,gBAAjB,EAAmC;AACjC,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAJ,GAAY,gBADV;AAEL,OAAC,EAAE,CAAC,GAAG,cAFF;AAGL,gBAAU,EAAE,aAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,kBAAjB,EAAqC;AACnC,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,gBADF;AAEL,OAAC,EAAE,CAAC,GAAG,MAAJ,GAAa,cAFX;AAGL,gBAAU,EAAE,eAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MAAI,QAAQ,KAAK,mBAAjB,EAAsC;AACpC,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,KAAJ,GAAY,gBADV;AAEL,OAAC,EAAE,CAAC,GAAG,MAAJ,GAAa,cAFX;AAGL,gBAAU,EAAE,aAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,MACE,oBAAE,QAAF,CAAW,QAAX,MACC,qBAAS,QAAQ,CAAC,CAAlB,KAAwB,sBAAU,QAAQ,CAAC,CAAnB,CADzB,MAEC,qBAAS,QAAQ,CAAC,CAAlB,KAAwB,sBAAU,QAAQ,CAAC,CAAnB,CAFzB,CADF,EAIE;AACA,WAAO;AACL,OAAC,EAAE,CAAC,GAAG,4BAAgB,QAAQ,CAAC,CAAzB,EAA4B,KAA5B,CADF;AAEL,OAAC,EAAE,CAAC,GAAG,4BAAgB,QAAQ,CAAC,CAAzB,EAA4B,MAA5B,CAFF;AAGL,gBAAU,EAAE,KAHP;AAIL,oBAAc,EAAE;AAJX,KAAP;AAMD;;AAED,SAAO;AACL,KAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CADV;AAEL,KAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAFX;AAGL,cAAU,EAAE,QAHP;AAIL,kBAAc,EAAE;AAJX,GAAP;AAMD,CA/ID;;AAiJA,IAAM,OAAO,GAAG,SAAV,OAAU,CAAC,OAAD,EAAyC;AAAK,8BAAU,OAAwB,CAAlC;AAAsC,CAApG;;AAEA,SAAS,KAAT,CAAe,KAAf,EAA2B;AACjB;AAAA,MAAS,yBAAT;AAAA,MAAmB,mBAAnB;AAAA,MAA0B,yBAA1B;AAAA,MAAoC,uBAApC;AAAA,MAA6C,oBAA7C;AAAA,MAA6C,mCAA7C;;AAER,MAAI,CAAC,OAAD,IAAa,oBAAE,KAAF,CAAQ,KAAR,KAAkB,oBAAE,KAAF,CAAQ,QAAR,CAAlB,IAAuC,CAAC,uBAAe,OAAf,CAAxC,IAAmE,CAAC,oBAAE,UAAF,CAAa,OAAb,CAArF,EAA6G;AAC3G,WAAO,IAAP;AACD;;AAED,MAAI,uBAAe,OAAf,CAAJ,EAA6B;AAC3B,WAAO,qBAAa,OAAb,EAAsB,KAAtB,CAAP;AACD;;AAED,MAAI,KAAJ;;AACA,MAAI,oBAAE,UAAF,CAAa,OAAb,CAAJ,EAA2B;AACzB,SAAK,GAAG,sBAAc,OAAd,EAA8B,KAA9B,CAAR;;AAEA,QAAI,uBAAe,KAAf,CAAJ,EAA2B;AACzB,aAAO,KAAP;AACD;AACF,GAND,MAMO;AACL,SAAK,GAAG,QAAQ,CAAC,KAAD,CAAhB;AACD;;AAED,MAAM,YAAY,GAAG,OAAO,CAAC,OAAD,CAA5B;AACA,MAAM,KAAK,GAAG,oBAAY,KAAZ,EAAmB,IAAnB,CAAd;;AAEA,MAAI,YAAY,KAAK,QAAQ,KAAK,aAAb,IAA8B,QAAQ,KAAK,WAA3C,IAA0D,QAAQ,KAAK,KAA5E,CAAhB,EAAoG;AAClG,WAAO,iBAAiB,CAAC,KAAD,EAAQ,KAAR,EAAe,KAAf,CAAxB;AACD;;AAED,MAAM,aAAa,GAAG,YAAY,GAAG,oBAAoB,CAAC,KAAD,CAAvB,GAAiC,wBAAwB,CAAC,KAAD,CAA3F;AAEA,SACE,iCAAC,iBAAD,EAAK;AAAC,aAAS,EAAE,wBAAW,gBAAX,EAA6B,SAA7B;AAAZ,KAAyD,KAAzD,EAAqE,aAArE,CAAL,EACG,KADH,CADF;AAKD;;AAED,KAAK,CAAC,WAAN,GAAoB,OAApB;AACA,KAAK,CAAC,YAAN,GAAqB;AACnB,QAAM,EAAE;AADW,CAArB;;AAIA,IAAM,YAAY,GAAG,SAAf,YAAe,CAAC,KAAD,EAAW;AAE5B;AAAA,MACA,aADA;AAAA,MAEA,mBAFA;AAAA,MAGA,6BAHA;AAAA,MAIA,yBAJA;AAAA,MAKA,WALA;AAAA,MAMA,qBANA;AAAA,MAOA,+BAPA;AAAA,MAQA,+BARA;AAAA,MASA,WATA;AAAA,MAUA,WAVA;AAAA,MAWA,eAXA;AAAA,MAYA,iBAZA;AAAA,MAaA,mBAbA;AAAA,MAcA,qBAdA;AAAA,MAeA,2BAfA;;AAkBF,MAAI,qBAAS,KAAT,KAAmB,qBAAS,MAAT,CAAvB,EAAyC;AACvC,QAAI,qBAAS,CAAT,KAAe,qBAAS,CAAT,CAAnB,EAAgC;AAC9B,aAAO;AAAE,SAAC,GAAH;AAAK,SAAC,GAAN;AAAQ,aAAK,OAAb;AAAe,cAAM;AAArB,OAAP;AACD;;AACD,QAAI,qBAAS,GAAT,KAAiB,qBAAS,IAAT,CAArB,EAAqC;AACnC,aAAO;AAAE,SAAC,EAAE,GAAL;AAAU,SAAC,EAAE,IAAb;AAAmB,aAAK,OAAxB;AAA0B,cAAM;AAAhC,OAAP;AACD;AACF;;AAED,MAAI,qBAAS,CAAT,KAAe,qBAAS,CAAT,CAAnB,EAAgC;AAC9B,WAAO;AAAE,OAAC,GAAH;AAAK,OAAC,GAAN;AAAQ,WAAK,EAAE,CAAf;AAAkB,YAAM,EAAE;AAA1B,KAAP;AACD;;AAED,MAAI,qBAAS,EAAT,KAAgB,qBAAS,EAAT,CAApB,EAAkC;AAChC,WAAO;AACL,QAAE,IADG;AAEL,QAAE,IAFG;AAGL,gBAAU,EAAE,UAAU,IAAI,KAAd,IAAuB,CAH9B;AAIL,cAAQ,EAAE,QAAQ,IAAI,KAAZ,IAAqB,CAJ1B;AAKL,iBAAW,EAAE,WAAW,IAAI,CALvB;AAML,iBAAW,EAAE,WAAW,IAAI,MAAf,IAAyB,CAAzB,IAA8B,CANtC;AAOL,eAAS;AAPJ,KAAP;AASD;;AAED,MAAI,KAAK,CAAC,OAAV,EAAmB;AACjB,WAAO,KAAK,CAAC,OAAb;AACD;;AAED,SAAO,EAAP;AACD,CAlDD;;AAoDA,IAAM,UAAU,GAAG,SAAb,UAAa,CAAC,KAAD,EAAa,OAAb,EAA6B;AAC9C,MAAI,CAAC,KAAL,EAAY;AACV,WAAO,IAAP;AACD;;AAED,MAAI,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,iCAAC,KAAD,EAAM;AAAC,SAAG,EAAC,gBAAL;AAAsB,aAAO,EAAE;AAA/B,KAAN,CAAP;AACD;;AAED,MAAI,uBAAW,KAAX,CAAJ,EAAuB;AACrB,WAAO,iCAAC,KAAD,EAAM;AAAC,SAAG,EAAC,gBAAL;AAAsB,aAAO,EAAE,OAA/B;AAAwC,WAAK,EAAE;AAA/C,KAAN,CAAP;AACD;;AAED,MAAI,uBAAe,KAAf,CAAJ,EAA2B;AACzB,QAAI,KAAK,CAAC,IAAN,KAAe,KAAnB,EAA0B;AACxB,aAAO,qBAAa,KAAb,EAA2B;AAAE,WAAG,EAAE,gBAAP;AAAyB,eAAO;AAAhC,OAA3B,CAAP;AACD;;AAED,WAAO,iCAAC,KAAD,EAAM;AAAC,SAAG,EAAC,gBAAL;AAAsB,aAAO,EAAE,KAA/B;AAAsC,aAAO,EAAE;AAA/C,KAAN,CAAP;AACD;;AAED,MAAI,oBAAE,UAAF,CAAa,KAAb,CAAJ,EAAyB;AACvB,WAAO,iCAAC,KAAD,EAAM;AAAC,SAAG,EAAC,gBAAL;AAAsB,aAAO,EAAE,KAA/B;AAAsC,aAAO,EAAE;AAA/C,KAAN,CAAP;AACD;;AAED,MAAI,oBAAE,QAAF,CAAW,KAAX,CAAJ,EAAuB;AACrB,WAAO,iCAAC,KAAD,EAAM;AAAC,aAAO,EAAE;AAAV,OAAuB,KAAvB,EAA4B;AAAE,SAAG,EAAC;AAAN,KAA5B,CAAN,CAAP;AACD;;AAED,SAAO,IAAP;AACD,CA9BD;;AAgCA,IAAM,kBAAkB,GAAG,SAArB,kBAAqB,CAAC,WAAD,EAAmB,OAAnB,EAAsC,eAAtC,EAA4D;AAAtB;AAAA;AAAsB;;AACrF,MAAI,CAAC,WAAD,IAAiB,CAAC,WAAW,CAAC,QAAb,IAAyB,eAAzB,IAA4C,CAAC,WAAW,CAAC,KAA9E,EAAsF;AACpF,WAAO,IAAP;AACD;;AACO;AACR,MAAM,aAAa,GAAG,YAAY,CAAC,WAAD,CAAlC;AAEA,MAAM,eAAe,GAAG,2BAAc,QAAd,EAAwB,KAAK,CAAC,WAA9B,EAA2C,GAA3C,CAA+C,UAAC,KAAD,EAAa,KAAb,EAA0B;AAC/F,gCAAa,KAAb,EAAoB;AAClB,aAAO,EAAE,OAAO,IAAI,aADF;AAElB,SAAG,EAAE,WAAS;AAFI,KAApB;AAGE,GAJoB,CAAxB;;AAOA,MAAI,CAAC,eAAL,EAAsB;AACpB,WAAO,eAAP;AACD;;AACD,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,KAAb,EAAoB,OAAO,IAAI,aAA/B,CAAhC;AAEA,yBAAQ,aAAR,GAA0B,eAA1B;AACD,CApBD;;AAsBA,KAAK,CAAC,YAAN,GAAqB,YAArB;AACA,KAAK,CAAC,kBAAN,GAA2B,kBAA3B;AAEA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC3dA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAgBA,IAAM,YAAY,GAAG;AACnB,eAAa,EAAE,uBAAC,KAAD,EAAY;AAAK,WAAC,oBAAE,OAAF,CAAU,KAAK,CAAC,KAAhB,IAAyB,oBAAE,IAAF,CAAO,KAAK,CAAC,KAAb,CAAzB,GAA+C,KAAK,CAArD;AAA4D;AADzE,CAArB;;AAIA,SAAS,SAAT,CAAmC,KAAnC,EAAkD;AACxC;AAAA,MAAM,mCAAN;AAAA,MAAqB,uBAArB;AAAA,MAA8B,2BAA9B;AAAA,MAAyC,aAAzC;AAAA,MAA6C,+EAA7C;;AAER,MAAI,CAAC,IAAD,IAAS,CAAC,IAAI,CAAC,MAAnB,EAA2B;AACzB,WAAO,IAAP;AACD;;AAED,SACE,iCAAC,kBAAD,EAAM;AAAC,aAAS,EAAC;AAAX,GAAN,EACG,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,KAAR,EAAa;AACrB,QAAM,KAAK,GAAG,oBAAE,KAAF,CAAQ,OAAR,IACV,aAAa,CAAC,KAAD,EAAQ,KAAR,CADH,GAEV,+BAAkB,KAAK,IAAI,KAAK,CAAC,OAAjC,EAA0C,OAA1C,CAFJ;AAGA,QAAM,OAAO,GAAG,oBAAE,KAAF,CAAQ,EAAR,IAAc,EAAd,GAAmB;AAAE,QAAE,EAAK,EAAE,MAAF,GAAM;AAAf,KAAnC;AAEA,WACE,iCAAC,kBAAD,EAAM,aACC,oBAAY,KAAZ,EAAmB,IAAnB,CADD,EAEA,MAFA,EAGA,OAHA,EAGO;AACX,WAAK,EAAE,KADI;AAEX,WAAK,EAAE,KAFI;AAGX,aAAO,EAAE,mBAAM,YAAN,CAAmB,oBAAE,KAAF,CAAQ,SAAR,IAAqB,KAArB,GAA4B,sBAAM,KAAN,GAAW;AAAE,iBAAS;AAAX,OAAX,CAA/C,CAHE;AAIX,SAAG,EAAE,WAAS;AAJH,KAHP,CAAN,CADF;AAWD,GAjBA,CADH,CADF;AAsBD;;AAED,SAAS,CAAC,WAAV,GAAwB,WAAxB;;AAEA,SAAS,cAAT,CAAwC,KAAxC,EAAoD,IAApD,EAAkE;AAChE,MAAI,CAAC,KAAL,EAAY;AACV,WAAO,IAAP;AACD;;AAED,MAAI,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,iCAAC,SAAD,EAAU;AAAC,SAAG,EAAC,oBAAL;AAA0B,UAAI,EAAE;AAAhC,KAAV,CAAP;AACD;;AAED,MAAI,mBAAM,cAAN,CAAqB,KAArB,KAA+B,oBAAE,UAAF,CAAa,KAAb,CAAnC,EAAwD;AACtD,WAAO,iCAAC,SAAD,EAAU;AAAC,SAAG,EAAC,oBAAL;AAA0B,UAAI,EAAE,IAAhC;AAAsC,aAAO,EAAE;AAA/C,KAAV,CAAP;AACD;;AAED,MAAI,oBAAE,QAAF,CAAW,KAAX,CAAJ,EAAuB;AACrB,WAAO,iCAAC,SAAD,EAAU;AAAC,UAAI,EAAE;AAAP,OAAiB,KAAjB,EAAsB;AAAE,SAAG,EAAC;AAAN,KAAtB,CAAV,CAAP;AACD;;AAED,SAAO,IAAP;AACD;;AAED,SAAS,kBAAT,CAA4C,WAA5C,EAA8D,IAA9D,EAA8E,eAA9E,EAAoG;AAAtB;AAAA;AAAsB;;AAClG,MAAI,CAAC,WAAD,IAAiB,CAAC,WAAW,CAAC,QAAb,IAAyB,eAAzB,IAA4C,CAAC,WAAW,CAAC,KAA9E,EAAsF;AACpF,WAAO,IAAP;AACD;;AACO;AAER,MAAM,eAAe,GAAG,2BAAc,QAAd,EAAwB,SAAS,CAAC,WAAlC,EAA+C,GAA/C,CAAmD,UAAC,KAAD,EAAa,KAAb,EAA0B;AACnG,gCAAa,KAAb,EAAoB;AAClB,UAAI,MADc;AAElB,SAAG,EAAE,eAAa;AAFA,KAApB;AAGE,GAJoB,CAAxB;;AAMA,MAAI,CAAC,eAAL,EAAsB;AACpB,WAAO,eAAP;AACD;;AAED,MAAM,iBAAiB,GAAG,cAAc,CAAC,WAAW,CAAC,KAAb,EAAoB,IAApB,CAAxC;AAEA,yBAAQ,iBAAR,GAA8B,eAA9B;AACD;;AAED,SAAS,CAAC,kBAAV,GAA+B,kBAA/B;AACA,SAAS,CAAC,YAAV,GAAyB,YAAzB;AAEA,qBAAe,SAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpGA;;AACA;;AACA;;AAEA;;AAIA,SAAS,aAAT,CAAoC,KAApC,EAA+D;AAC7D,SAAO,KAAK,CAAC,KAAb;AACD;;AACD,SAAS,cAAT,CAAqC,MAArC,EAAwE,OAAxE,EAA4G;AAC1G,MAAI,MAAM,KAAK,IAAf,EAAqB;AACnB,WAAO,oBAAE,MAAF,CAAS,OAAT,EAAkB,aAAlB,CAAP;AACD;;AAED,MAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,WAAO,oBAAE,MAAF,CAAS,OAAT,EAAkB,MAAlB,CAAP;AACD;;AAED,SAAO,OAAP;AACD;;AAED,SAAS,aAAT,CAAoC,OAApC,EAAuE,KAAvE,EAAgG;AAC9F,MAAI,mBAAM,cAAN,CAAqB,OAArB,CAAJ,EAAmC;AACjC,WAAO,mBAAM,YAAN,CAAmB,OAAnB,EAA4B,KAA5B,CAAP;AACD;;AACD,MAAI,oBAAE,UAAF,CAAa,OAAb,CAAJ,EAA2B;AACzB,WAAO,mBAAM,aAAN,CAAoB,OAApB,EAAoC,KAApC,CAAP;AACD;;AAED,SAAO,iCAAC,iCAAD,EAAqB,aAAK,KAAL,CAArB,CAAP;AACD;;AAED,IAAM,GAAG,GAAG,CAAZ;;AAuBA;AAAkC;;AAAlC;AAAA;;AA6BE,kBAAQ;AACN,cAAQ,EAAE,CAAC,CADL;AAEN,eAAS,EAAE,CAAC;AAFN,KAAR;;AA0HD;;AA3IQ,yBAAP,UAAqB,IAArB,EAAgC,UAAhC,EAAkD;AACxC;;AAER,QAAI,MAAM,KAAK,UAAX,IAAyB,qBAAS,IAAI,CAAC,KAAL,CAAW,MAApB,CAA7B,EAA0D;AACxD,aAAO;AACL,cAAM,EAAE,IAAI,CAAC,KAAL,CAAW;AADd,OAAP;AAGD;;AACD,QAAI,MAAM,KAAK,YAAf,EAA6B;AAC3B,aAAO;AACL,aAAK,EAAE,IAAI,CAAC,KAAL,CAAW,KAAX,IAAoB;AADtB,OAAP;AAGD;;AAED,WAAO,IAAP;AACD,GAfM;;AAsBA,uCAAP;AACE,SAAK,UAAL;AACD,GAFM;;AAIA,wCAAP;AACE,SAAK,UAAL;AACD,GAFM;;AAIA,6BAAP;AACE,QAAI,KAAK,WAAL,IAAoB,KAAK,WAAL,CAAiB,qBAAzC,EAAgE;AAC9D,aAAO,KAAK,WAAL,CAAiB,qBAAjB,EAAP;AACD;;AAED,WAAO,IAAP;AACD,GANM;;AAQC,qCAAR;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,wBAAZ;;AAEN,QAAI,QAAQ,IAAI,CAAZ,IAAiB,SAAS,IAAI,CAAlC,EAAqC;AACnC,aAAO;AAAE,aAAK,EAAE,QAAT;AAAmB,cAAM,EAAE;AAA3B,OAAP;AACD;;AAED,WAAO,IAAP;AACD,GARO;;AAUA,wCAAR,UAA2B,KAA3B,EAA+C;AACvC;AAAA,QAAE,kBAAF;AAAA,QAAU,gBAAV;AAAA,QAAiB,gCAAjB;AAAA,QAAgC,kBAAhC;AAAA,QAAwC,0BAAxC;AAAA,QAAoD,4BAApD;AACN,QAAI,IAAJ,EAAU,IAAV;;AAEA,QACE,CAAC,KAAD,IACC,CAAC,KAAK,CAAC,IAAN,KAAe,SAAf,IAA4B,KAAK,CAAC,IAAN,KAAe,IAA5C,MAAsD,KAAK,CAAC,KAAN,KAAgB,SAAhB,IAA6B,KAAK,CAAC,KAAN,KAAgB,IAAnG,CAFH,EAGE;AACA,UAAI,KAAK,KAAK,QAAV,IAAsB,MAAM,KAAK,UAArC,EAAiD;AAC/C,YAAM,GAAG,GAAG,KAAK,eAAL,MAA0B;AAAE,eAAK,EAAE;AAAT,SAAtC;AACA,YAAI,GAAG;AAAE,cAAI,EAAE,CAAC,CAAC,UAAU,IAAI,CAAf,IAAoB,GAAG,CAAC,KAAzB,IAAkC;AAA1C,SAAP;AACD,OAHD,MAGO;AACL,YAAI,GAAG,KAAK,KAAK,OAAV,GAAoB;AAAE,eAAK,EAAG,MAAM,IAAI,MAAM,CAAC,KAAlB,IAA4B;AAArC,SAApB,GAA+D;AAAE,cAAI,EAAG,MAAM,IAAI,MAAM,CAAC,IAAlB,IAA2B;AAAnC,SAAtE;AACD;AACF;;AAED,QACE,CAAC,KAAD,IACC,CAAC,KAAK,CAAC,GAAN,KAAc,SAAd,IAA2B,KAAK,CAAC,GAAN,KAAc,IAA1C,MAAoD,KAAK,CAAC,MAAN,KAAiB,SAAjB,IAA8B,KAAK,CAAC,MAAN,KAAiB,IAAnG,CAFH,EAGE;AACA,UAAI,aAAa,KAAK,QAAtB,EAAgC;AAC9B,YAAM,GAAG,GAAG,KAAK,eAAL,MAA0B;AAAE,gBAAM,EAAE;AAAV,SAAtC;AACA,YAAI,GAAG;AAAE,aAAG,EAAE,CAAC,CAAC,WAAW,IAAI,CAAhB,IAAqB,GAAG,CAAC,MAA1B,IAAoC;AAA3C,SAAP;AACD,OAHD,MAGO;AACL,YAAI,GACF,aAAa,KAAK,QAAlB,GACI;AAAE,gBAAM,EAAG,MAAM,IAAI,MAAM,CAAC,MAAlB,IAA6B;AAAvC,SADJ,GAEI;AAAE,aAAG,EAAG,MAAM,IAAI,MAAM,CAAC,GAAlB,IAA0B;AAAjC,SAHN;AAID;AACF;;AAED,iCAAY,IAAZ,GAAqB,IAArB;AACD,GAhCO;;AAkCA,gCAAR;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,wBAAZ;AACE;;AAER,QAAI,KAAK,WAAL,IAAoB,KAAK,WAAL,CAAiB,qBAAzC,EAAgE;AAC9D,UAAM,KAAG,GAAG,KAAK,WAAL,CAAiB,qBAAjB,EAAZ;;AAEA,UAAI,IAAI,CAAC,GAAL,CAAS,KAAG,CAAC,KAAJ,GAAY,QAArB,IAAiC,GAAjC,IAAwC,IAAI,CAAC,GAAL,CAAS,KAAG,CAAC,MAAJ,GAAa,SAAtB,IAAmC,GAA/E,EAAoF;AAClF,aAAK,QAAL,CACE;AACE,kBAAQ,EAAE,KAAG,CAAC,KADhB;AAEE,mBAAS,EAAE,KAAG,CAAC;AAFjB,SADF,EAKE;AACE,cAAI,YAAJ,EAAkB;AAChB,wBAAY,CAAC,KAAD,CAAZ;AACD;AACF,SATH;AAWD;AACF,KAhBD,MAgBO,IAAI,QAAQ,KAAK,CAAC,CAAd,IAAmB,SAAS,KAAK,CAAC,CAAtC,EAAyC;AAC9C,WAAK,QAAL,CACE;AACE,gBAAQ,EAAE,CAAC,CADb;AAEE,iBAAS,EAAE,CAAC;AAFd,OADF,EAKE;AACE,YAAI,YAAJ,EAAkB;AAChB,sBAAY,CAAC,IAAD,CAAZ;AACD;AACF,OATH;AAWD;AACF,GAjCO;;AAmCD,4BAAP;AAAA;;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,gBAAX;AAAA,QAAkB,kBAAlB;AAAA,QAA0B,8BAA1B;AAAA,QAAwC,gCAAxC;AAAA,QAAuD,oBAAvD;;AACN,QAAM,UAAU;AACd,cAAQ,EAAE,UADI;AAEd,WAAK,EAAE,KAAK,IAAI,MAFF;AAGd,YAAM,EAAE,MAAM,IAAI;AAHJ,OAIX,KAAK,kBAAL,CAAwB,YAAxB,CAJW,GAKX,YALW,CAAhB;;AAQA,WACE;AACE,eAAS,EAAC,yBADZ;AAEE,WAAK,EAAE,UAFT;AAGE,SAAG,EAAE,mBAAI;AACP,aAAI,CAAC,WAAL,GAAmB,IAAnB;AACD;AALH,OAOG,aAAa,CAAC,OAAD,EAAQ,sBAAO,KAAK,KAAZ,GAAiB;AAAE,aAAO,EAAE,cAAc,CAAC,aAAD,EAAgB,OAAhB;AAAzB,KAAjB,CAAR,CAPhB,CADF;AAWD,GArBM;;AAhIA,uBAAc,QAAd;AAEA,wBAAe;AACpB,YAAQ,EAAE,EADU;AAEpB,UAAM,EAAE,YAFY;AAGpB,SAAK,EAAE,QAHa;AAIpB,iBAAa,EAAE;AAJK,GAAf;AAoJT;AAAC,CAvJD,CAAkC,qBAAlC;;AAyJA,qBAAe,MAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClNA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAoBA;AAAkC;;AAahC,+BAAY,KAAZ,EAAwB;AAAxB,gBACE,kBAAM,KAAN,KAAY,IADd;;AAsCA,sCAA4B;AAC1B,UAAI,CAAC,KAAI,CAAC,OAAV,EAAmB;AACjB;AACD;;AAED,UAAM,OAAO,GAAG,KAAI,CAAC,gBAAL,EAAhB;;AAEA,UAAI,OAAJ,EAAa;AACL;AAAA,YAAE,4BAAF;AAAA,YAA4B,8BAA5B;AACE;AAAA,YAAgB,yCAAhB;;AAER,YAAI,cAAc,KAAK,QAAnB,IAA+B,eAAe,KAAK,SAAvD,EAAkE;AAChE,eAAI,CAAC,QAAL,CAAc;AAAE,0BAAc,gBAAhB;AAAkB,2BAAe;AAAjC,WAAd;AACD;AACF;AACF,KAfD;;AAnCE,SAAI,CAAC,KAAL,GAAa;AACX,oBAAc,EAAE,CAAC,CADN;AAEX,qBAAe,EAAE,CAAC;AAFP,KAAb;AAKA,SAAI,CAAC,YAAL,GACE,KAAK,CAAC,QAAN,GAAiB,CAAjB,GAAqB,oBAAE,QAAF,CAAW,KAAI,CAAC,yBAAhB,EAA2C,KAAK,CAAC,QAAjD,CAArB,GAAkF,KAAI,CAAC,yBADzF;;AAED;;AAGD;AACE,SAAK,OAAL,GAAe,IAAf;AAEA,QAAM,IAAI,GAAG,KAAK,gBAAL,EAAb;;AAEA,QAAI,IAAJ,EAAU;AACR,WAAK,QAAL,CAAc,IAAd;AACD;AACF,GARD;;AAUA;AACE,SAAK,OAAL,GAAe,KAAf;AACD,GAFD;;AAIA;AACE,QAAI,CAAC,KAAK,SAAV,EAAqB;AACnB,aAAO,IAAP;AACD;;AAED,WAAO;AACL,oBAAc,EAAE,KAAK,SAAL,CAAe,WAD1B;AAEL,qBAAe,EAAE,KAAK,SAAL,CAAe;AAF3B,KAAP;AAID,GATD;;AA4BA;AACQ;AAAA,QAAE,kCAAF;AAAA,QAAkB,oCAAlB;;AAEN,QAAI,cAAc,GAAG,CAAjB,IAAsB,eAAe,GAAG,CAA5C,EAA+C;AAC7C,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,kBAAF;AAAA,QAAU,gBAAV;AAAA,QAAiB,kBAAjB;AAAA,QAAyB,sBAAzB;AAAA,QAAmC,wBAAnC;AAAA,QAA8C,wBAA9C;AAAA,QAAyD,sBAAzD;AAEN,oBACE,sBAAU,KAAV,KAAoB,sBAAU,MAAV,CADtB,EAEE,iHAFF,EAIE,KAJF,EAKE,MALF;AAQA,oBAAK,CAAC,MAAD,IAAW,MAAM,GAAG,CAAzB,EAA4B,2CAA5B,EAAyE,MAAzE;AAEA,QAAI,eAAe,GAAW,sBAAU,KAAV,IAAmB,cAAnB,GAAqC,KAAnE;AACA,QAAI,gBAAgB,GAAW,sBAAU,MAAV,IAAoB,eAApB,GAAuC,MAAtE;;AAEA,QAAI,MAAM,IAAI,MAAM,GAAG,CAAvB,EAA0B;AAExB,UAAI,eAAJ,EAAqB;AAEnB,wBAAgB,GAAG,eAAe,GAAG,MAArC;AACD,OAHD,MAGO,IAAI,gBAAJ,EAAsB;AAE3B,uBAAe,GAAG,gBAAgB,GAAG,MAArC;AACD;;AAGD,UAAI,SAAS,IAAI,gBAAgB,GAAG,SAApC,EAA+C;AAC7C,wBAAgB,GAAG,SAAnB;AACD;AACF;;AAED,oBACE,eAAe,GAAG,CAAlB,IAAuB,gBAAgB,GAAG,CAD5C,EAEE,+PAFF,EAME,eANF,EAOE,gBAPF,EAQE,KARF,EASE,MATF,EAUE,QAVF,EAWE,SAXF,EAYE,MAZF;AAeA,WAAO,mBAAM,YAAN,CAAmB,QAAnB,EAA6B;AAClC,WAAK,EAAE,eAD2B;AAElC,YAAM,EAAE;AAF0B,KAA7B,CAAP;AAID,GAzDD;;AA2DA;AAAA;;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,wBAAZ;AAAA,QAAuB,gBAAvB;AAAA,QAA8B,kBAA9B;AAAA,QAAsC,wBAAtC;AAAA,QAAiD,UAAjD;AAAA,QAAqD,wBAArD;AACN,QAAM,KAAK,GAAG;AAAE,WAAK,OAAP;AAAS,YAAM,QAAf;AAAiB,cAAQ,UAAzB;AAA2B,eAAS,WAApC;AAAsC,eAAS;AAA/C,KAAd;AAEA,WACE;AACE,QAAE,EAAE,KAAG,EADT;AAEE,eAAS,EAAE,wBAAW,+BAAX,EAA4C,SAA5C,CAFb;AAGE,WAAK,EAAE,KAHT;AAIE,SAAG,EAAE,mBAAI;AACP,aAAI,CAAC,SAAL,GAAiB,IAAjB;AACD;AANH,OAQG,KAAK,WAAL,EARH,EASE,iCAAC,kCAAD,EAAoB;AAAC,iBAAW,MAAZ;AAAa,kBAAY,MAAzB;AAA0B,cAAQ,EAAE,KAAK;AAAzC,KAApB,CATF,CADF;AAaD,GAjBD;;AA9HO,qCAAe;AACpB,SAAK,EAAE,MADa;AAEpB,UAAM,EAAE,MAFY;AAGpB,YAAQ,EAAE;AAHU,GAAf;AAgJT;AAAC,CAjJD,CAAkC,iBAAlC;;AAmJA,qBAAe,mBAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/KA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEA,IAAM,eAAe,GAAG,4BAAxB;;AAYA,IAAM,mBAAmB,GAAG,SAAtB,mBAAsB,CAAC,KAAD,EAAa;AACvC,MAAI;AACF,QAAM,KAAK,GAAG,CAAC,oBAAE,KAAF,CAAQ,KAAK,CAAC,QAAd,CAAD,GAA2B,KAAK,CAAC,QAAN,CAAe,QAAf,GAA0B,KAA1B,CAAgC,eAAhC,CAA3B,GAA8E,EAA5F;AACA,QAAM,sBAAsB,GAAG,KAAK,CAAC,GAAN,CAAU,gBAAI;AAAI,aAAC;AAAE,YAAI,MAAN;AAAQ,aAAK,EAAE,yBAAc,IAAd,EAAoB,KAAK,CAAC,KAA1B,EAAhB;AAAC,OAAD;AAAyD,KAA3E,CAA/B;AAEA,QAAM,UAAU,GAAG,yBAAc,MAAd,EAAwB,KAAK,CAAC,KAA9B,EAAqC,KAAxD;AAEA,WAAO;AAAE,4BAAsB,wBAAxB;AAA0B,gBAAU;AAApC,KAAP;AACD,GAPD,CAOE,OAAO,CAAP,EAAU;AACV,WAAO,IAAP;AACD;AACF,CAXD;;AAiCA;AAAmB;;AAWjB,gBAAY,KAAZ,EAAwB;AAAxB,gBACE,kBAAM,KAAN,KAAY,IADd;;AAoDA,qCAA2B,UAAC,KAAD,EAAa;AACtC,UAAM,KAAK,GAAG,CAAC,oBAAE,KAAF,CAAQ,KAAK,CAAC,QAAd,CAAD,GAA2B,KAAK,CAAC,QAAN,CAAe,QAAf,GAA0B,KAA1B,CAAgC,eAAhC,CAA3B,GAA8E,EAA5F;AACA,aAAO,CAAC;AAAE,aAAK;AAAP,OAAD,CAAP;AACD,KAHD;;AAlDE,SAAI,CAAC,KAAL,GAAa;AACX,kBAAY,EAAE,KAAI,CAAC,eAAL,CAAqB,KAArB,EAA4B,IAA5B;AADH,KAAb;;AAGD;;AAED;AACE,SAAK,kBAAL,CAAwB,KAAK,KAA7B,EAAoC,IAApC;AACD,GAFD;;AAIA,gDAAmB,SAAnB,EAAmC;AACjC,QACE,SAAS,CAAC,KAAV,KAAoB,KAAK,KAAL,CAAW,KAA/B,IACA,SAAS,CAAC,UAAV,KAAyB,KAAK,KAAL,CAAW,UADpC,IAEA,SAAS,CAAC,QAAV,KAAuB,KAAK,KAAL,CAAW,QAFlC,IAGA,SAAS,CAAC,KAAV,KAAoB,KAAK,KAAL,CAAW,KAJjC,EAKE;AACA,UAAM,aAAa,GAAG,KAAK,KAAL,CAAW,QAAX,KAAwB,SAAS,CAAC,QAAlC,IAA8C,KAAK,KAAL,CAAW,KAAX,KAAqB,SAAS,CAAC,KAAnG;AACA,WAAK,kBAAL,CAAwB,KAAK,KAA7B,EAAoC,aAApC;AACD;AACF,GAVD;;AAYA,gDAAmB,KAAnB,EAAiC,aAAjC,EAAuD;AACrD,SAAK,QAAL,CAAc;AACZ,kBAAY,EAAE,KAAK,eAAL,CAAqB,KAArB,EAA4B,aAA5B;AADF,KAAd;AAGD,GAJD;;AAMA,6CAAgB,KAAhB,EAA8B,aAA9B,EAAoD;AAElD,QAAI,CAAC,KAAK,CAAC,KAAN,IAAe,KAAK,CAAC,UAAtB,KAAqC,CAAC,oBAAO,KAAjD,EAAwD;AACtD,UAAI,sBAAsB,SAA1B;AAAA,UAA0D,UAAU,SAApE;;AAEA,UAAI,aAAJ,EAAmB;AACjB,YAAM,UAAU,GAAG,mBAAmB,CAAC,KAAD,CAAtC;;AAEA,YAAI,UAAJ,EAAgB;AACN;AAAA,cAA6B,0BAA7B;AAER,gCAAsB,GAAG,GAAzB;AACA,oBAAU,GAAG,EAAb;AACD,SALD,MAKO;AACL,iBAAO,KAAK,wBAAL,CAA8B,KAA9B,CAAP;AACD;;AAED,eAAO,KAAK,qBAAL,CAA2B,sBAA3B,EAAmD,UAAnD,EAA+D,KAAK,CAAC,KAArE,CAAP;AACD;AACF;;AACD,WAAO,KAAK,wBAAL,CAA8B,KAA9B,CAAP;AACD,GArBD;;AA4BA,mDACE,sBADF,EAEE,UAFF,EAGE,SAHF,EAG4B;AAElB;AACR,WAAO,CAAC,sBAAsB,IAAI,EAA3B,EAA+B,MAA/B,CAAsC,UAAC,MAAD,EAAS,EAAT,EAAwB;UAAb,c;UAAM,gB;AAC5D,UAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,MAAP,GAAgB,CAAjB,CAA1B;;AAEA,UAAI,WAAW,KAAK,SAAS,IAAI,IAAb,IAAqB,UAArB,IAAmC,WAAW,CAAC,KAAZ,GAAoB,KAApB,GAA4B,UAA5B,GAAyC,SAAjF,CAAf,EAA4G;AAE1G,mBAAW,CAAC,KAAZ,CAAkB,IAAlB,CAAuB,IAAvB;AACA,mBAAW,CAAC,KAAZ,IAAqB,KAAK,GAAG,UAA7B;AACD,OAJD,MAIO;AAEL,YAAM,OAAO,GAAG;AAAE,eAAK,EAAE,CAAC,IAAD,CAAT;AAAiB,eAAK;AAAtB,SAAhB;AACA,cAAM,CAAC,IAAP,CAAY,OAAZ;AACD;;AAED,aAAO,MAAP;AACD,KAdM,EAcJ,EAdI,CAAP;AAeD,GArBD;;AAuBA;AACE,QAAM,eAAN;AAAA,QACE,UADF;AAAA,QAEE,UAFF;AAAA,QAGE,0BAHF;AAAA,QAIE,kCAJF;AAAA,QAKE,0BALF;AAAA,QAME,gBANF;AAAA,QAOE,0BAPF;AAAA,QAQE,wBARF;AAAA,QASE,wBATF;AAAA,QAUE,mIAVF;;AAYQ;;AAER,QAAI,CAAC,uBAAW,SAAS,CAAC,CAArB,CAAD,IAA4B,CAAC,uBAAW,SAAS,CAAC,CAArB,CAAjC,EAA0D;AACxD,aAAO,IAAP;AACD;;AACD,QAAM,CAAC,GAAI,SAAS,CAAC,CAAV,IAA0B,qBAAS,EAAT,IAA0B,EAA1B,GAA0C,CAApE,CAAX;AACA,QAAM,CAAC,GAAI,SAAS,CAAC,CAAV,IAA0B,qBAAS,EAAT,IAA0B,EAA1B,GAA0C,CAApE,CAAX;AAEA,QAAI,OAAJ;;AACA,YAAQ,cAAR;AACE,WAAK,OAAL;AACE,eAAO,GAAG,6BAAc,UAAQ,SAAR,GAAiB,GAA/B,CAAV;AACA;;AACF,WAAK,QAAL;AACE,eAAO,GAAG,6BAAc,UAAQ,CAAC,YAAY,CAAC,MAAb,GAAsB,CAAvB,IAA4B,CAApC,GAAqC,MAArC,GAA4C,UAA5C,GAAsD,MAAtD,GAA6D,SAA7D,GAAsE,QAApF,CAAV;AACA;;AACF;AACE,eAAO,GAAG,6BAAc,WAAQ,YAAY,CAAC,MAAb,GAAsB,CAA9B,IAA+B,MAA/B,GAAsC,UAAtC,GAAgD,GAA9D,CAAV;AACA;AATJ;;AAYA,QAAM,UAAU,GAAG,EAAnB;;AACA,QAAI,UAAJ,EAAgB;AACd,UAAM,SAAS,GAAG,YAAY,CAAC,CAAD,CAAZ,CAAgB,KAAlC;AACQ;AACR,gBAAU,CAAC,IAAX,CAAgB,WAAS,CAAC,qBAAS,KAAT,IAA6B,KAAgB,GAAG,SAAhD,GAA4D,CAA7D,IAAkE,SAA3E,GAAoF,GAApG;AACD;;AACD,QAAI,KAAJ,EAAW;AACT,gBAAU,CAAC,IAAX,CAAgB,YAAU,KAAV,GAAe,IAAf,GAAoB,CAApB,GAAqB,IAArB,GAA0B,CAA1B,GAA2B,GAA3C;AACD;;AACD,QAAI,UAAU,CAAC,MAAf,EAAuB;AACrB,eAAS,CAAC,SAAV,GAAsB,UAAU,CAAC,IAAX,CAAgB,GAAhB,CAAtB;AACD;;AAED,WACE,sDACM,oBAAY,SAAZ,EAAuB,IAAvB,CADN,EACkC;AAChC,OAAC,EAAE,CAD6B;AAEhC,OAAC,EAAE,CAF6B;AAGhC,eAAS,EAAE,wBAAW,eAAX,EAA4B,SAA5B,CAHqB;AAIhC,gBAAU,EAAE;AAJoB,KADlC,GAOG,YAAY,CAAC,GAAb,CAAiB,UAAC,IAAD,EAAO,KAAP,EAAY;AAAK,aAEjC;AAAO,SAAC,EAAE,CAAV;AAAa,UAAE,EAAE,KAAK,KAAK,CAAV,GAAc,OAAd,GAAwB,UAAzC;AAAqD,WAAG,EAAE;AAA1D,SACG,IAAI,CAAC,KAAL,CAAW,IAAX,CAH8B,GAG9B,CADH,CAFiC;AAKlC,KALA,CAPH,CADF;AAgBD,GA/DD;;AA1FO,sBAAe;AACpB,KAAC,EAAE,CADiB;AAEpB,KAAC,EAAE,CAFiB;AAGpB,cAAU,EAAE,KAHQ;AAIpB,aAAS,EAAE,QAJS;AAKpB,cAAU,EAAE,KALQ;AAMpB,cAAU,EAAE,OANQ;AAOpB,kBAAc,EAAE;AAPI,GAAf;AA0JT;AAAC,CA3JD,CAAmB,iBAAnB;;AA6JA,qBAAe,IAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AChNA;;AACA;;AACA;;AACA;;AACA;;AAEA;;AACA;;AAGA,IAAM,UAAU,GAAG,0BAAnB;AAEA,IAAM,GAAG,GAAG,CAAZ;;AAOA,SAAS,aAAT,CAAyE,KAAzE,EAAsG;AACpG,SAAO,KAAK,CAAC,OAAb;AACD;;AACD,SAAS,cAAT,CACE,MADF,EAEE,OAFF,EAEwC;AAEtC,MAAI,MAAM,KAAK,IAAf,EAAqB;AACnB,WAAO,oBAAE,MAAF,CAAS,OAAT,EAAkB,aAAlB,CAAP;AACD;;AAED,MAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,WAAO,oBAAE,MAAF,CAAS,OAAT,EAAkB,MAAlB,CAAP;AACD;;AAED,SAAO,OAAP;AACD;;AAED,SAAS,aAAT,CACE,OADF,EAEE,KAFF,EAE6B;AAE3B,MAAI,mBAAM,cAAN,CAAqB,OAArB,CAAJ,EAAmC;AACjC,WAAO,mBAAM,YAAN,CAAmB,OAAnB,EAA4B,KAA5B,CAAP;AACD;;AACD,MAAI,oBAAE,UAAF,CAAa,OAAb,CAAJ,EAA2B;AACzB,WAAO,mBAAM,aAAN,CAAoB,OAApB,EAAoC,KAApC,CAAP;AACD;;AAED,SAAO,iCAAC,kCAAD,EAAsB,aAAK,KAAL,CAAtB,CAAP;AACD;;AAyCD;AAAwE;;AAAxE;AAAA;;AAwBE,kBAAQ;AACN,cAAQ,EAAE,CAAC,CADL;AAEN,eAAS,EAAE,CAAC;AAFN,KAAR;;AAmCA,yBAAe,UAAC,EAAD,EAQd;UAPC,Y;UACA,sC;UACA,sC;AAMM;AAAA,UAAE,0CAAF;AAAA,UAAsB,0BAAtB;AAAA,UAAkC,kBAAlC;AAAA,UAA0C,sBAA1C;AAAA,UAAoD,oBAApD;;AAEN,UAAI,QAAQ,IAAI,qBAAS,QAAQ,CAAC,GAAD,CAAjB,CAAhB,EAAyC;AACvC,eAAO,QAAQ,CAAC,GAAD,CAAf;AACD;;AAED,UAAM,UAAU,GAAG,UAAU,CAAC,GAAD,CAAV,GAAkB,gBAAlB,GAAqC,MAAxD;AACA,UAAM,YAAY,GAAG,UAAU,CAAC,GAAD,CAAV,GAAkB,MAAvC;;AACA,UAAI,kBAAkB,CAAC,GAAD,CAAtB,EAA6B;AAC3B,eAAO,YAAP;AACD;;AAED,UAAM,eAAe,GAAG,UAAU,CAAC,GAAD,CAAV,GAAkB,gBAAlB,GAAqC,MAA7D;AACA,UAAM,eAAe,GAAG,OAAO,CAAC,GAAD,CAAP,GAAe,gBAAvC;;AACA,UAAI,eAAe,GAAG,eAAtB,EAAuC;AACrC,eAAO,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,OAAO,CAAC,GAAD,CAA5B,CAAP;AACD;;AACD,aAAO,IAAI,CAAC,GAAL,CAAS,YAAT,EAAuB,OAAO,CAAC,GAAD,CAA9B,CAAP;AACD,KA3BD;;;AA6GD;;AAzIC;AACE,SAAK,UAAL;AACD,GAFD;;AAIA;AACE,SAAK,UAAL;AACD,GAFD;;AAIA;AACQ;AAAA,QAAE,sBAAF;AAAA,QAAY,wBAAZ;;AAEN,QAAI,KAAK,WAAL,IAAoB,KAAK,WAAL,CAAiB,qBAAzC,EAAgE;AAC9D,UAAM,GAAG,GAAG,KAAK,WAAL,CAAiB,qBAAjB,EAAZ;;AAEA,UAAI,IAAI,CAAC,GAAL,CAAS,GAAG,CAAC,KAAJ,GAAY,QAArB,IAAiC,GAAjC,IAAwC,IAAI,CAAC,GAAL,CAAS,GAAG,CAAC,MAAJ,GAAa,SAAtB,IAAmC,GAA/E,EAAoF;AAClF,aAAK,QAAL,CAAc;AACZ,kBAAQ,EAAE,GAAG,CAAC,KADF;AAEZ,mBAAS,EAAE,GAAG,CAAC;AAFH,SAAd;AAID;AACF,KATD,MASO,IAAI,QAAQ,KAAK,CAAC,CAAd,IAAmB,SAAS,KAAK,CAAC,CAAtC,EAAyC;AAC9C,WAAK,QAAL,CAAc;AACZ,gBAAQ,EAAE,CAAC,CADC;AAEZ,iBAAS,EAAE,CAAC;AAFA,OAAd;AAID;AACF,GAlBD;;AAiDA;;;AAAA;;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,wCAAX;AAAA,QAA8B,wCAA9B;AAAA,QAAiD,oCAAjD;AAAA,QAAkE,0BAAlE;AAAA,QAA8E,gCAA9E;AACN,QAAM,YAAY,GAAG,cAAc,CACjC,aADiC,EAEjC,UAAU,IAAI,OAAd,IAAyB,OAAO,CAAC,MAAjC,GAA0C,OAAO,CAAC,MAAR,CAAe,iBAAK;AAAI,cAAC,oBAAE,KAAF,CAAQ,KAAK,CAAd,KAAC,CAAD;AAAqB,KAA7C,CAA1C,GAA2F,OAF1D,CAAnC;AAIA,QAAM,UAAU,GAAG,YAAY,IAAI,YAAY,CAAC,MAAhD;AACM;AAAA,QAAE,oBAAF;AAAA,QAAW,oBAAX;AAAA,QAAoB,0BAApB;AAAA,QAAgC,sBAAhC;AAAA,QAA0C,kBAA1C;AAAA,QAAkD,8BAAlD;;AACN,QAAI,UAAU;AACZ,mBAAa,EAAE,MADH;AAEZ,gBAAU,EAAE,MAAM,IAAI,UAAV,GAAuB,SAAvB,GAAmC,QAFnC;AAGZ,cAAQ,EAAE,UAHE;AAIZ,SAAG,EAAE,CAJO;AAKZ,UAAI,EAAE;AALM,OAMT,YANS,CAAd;;AAQA,QAAI,UAAJ,EAAgB,UAAhB;;AAEA,QAAI,QAAQ,IAAI,qBAAS,QAAQ,CAAC,CAAlB,CAAZ,IAAoC,qBAAS,QAAQ,CAAC,CAAlB,CAAxC,EAA8D;AAC5D,gBAAU,GAAG,QAAQ,CAAC,CAAtB;AACA,gBAAU,GAAG,QAAQ,CAAC,CAAtB;AACD,KAHD,MAGO;AACC;AAAA,UAAE,sBAAF;AAAA,UAAY,wBAAZ;;AAEN,UAAI,QAAQ,GAAG,CAAX,IAAgB,SAAS,GAAG,CAA5B,IAAiC,UAArC,EAAiD;AAC/C,kBAAU,GAAG,KAAK,YAAL,CAAkB;AAC7B,aAAG,EAAE,GADwB;AAE7B,0BAAgB,EAAE,QAFW;AAG7B,0BAAgB,EAAE,OAAO,CAAC;AAHG,SAAlB,CAAb;AAMA,kBAAU,GAAG,KAAK,YAAL,CAAkB;AAC7B,aAAG,EAAE,GADwB;AAE7B,0BAAgB,EAAE,SAFW;AAG7B,0BAAgB,EAAE,OAAO,CAAC;AAHG,SAAlB,CAAb;AAKD,OAZD,MAYO;AACL,kBAAU,CAAC,UAAX,GAAwB,QAAxB;AACD;AACF;;AAED,cAAU,yBACL,8BAAe;AAChB,eAAS,EAAE,KAAK,KAAL,CAAW,cAAX,GACP,iBAAe,UAAf,GAAyB,MAAzB,GAAgC,UAAhC,GAA0C,QADnC,GAEP,eAAa,UAAb,GAAuB,MAAvB,GAA8B,UAA9B,GAAwC;AAH5B,KAAf,CADK,GAML,UANK,CAAV;;AASA,QAAI,iBAAiB,IAAI,MAAzB,EAAiC;AAC/B,gBAAU,yBACL,8BAAe;AAChB,kBAAU,EAAE,eAAa,iBAAb,GAA8B,KAA9B,GAAoC;AADhC,OAAf,CADK,GAIL,UAJK,CAAV;AAMD;;AAED,QAAM,GAAG,GAAG,wBAAW,UAAX,GAAqB,SAC/B,GAAI,UAAU,WAAd,IACE,qBAAS,UAAT,KAAwB,UAAxB,IAAsC,qBAAS,UAAU,CAAC,CAApB,CAAtC,IAAgE,UAAU,IAAI,UAAU,CAAC,CAF5D,EAG/B,GAAI,UAAU,UAAd,IAAwB,qBAAS,UAAT,KAAwB,UAAxB,IAAsC,qBAAS,UAAU,CAAC,CAApB,CAAtC,IAAgE,UAAU,GAAG,UAAU,CAAC,CAHjF,EAI/B,GAAI,UAAU,YAAd,IACE,qBAAS,UAAT,KAAwB,UAAxB,IAAsC,qBAAS,UAAU,CAAC,CAApB,CAAtC,IAAgE,UAAU,IAAI,UAAU,CAAC,CAL5D,EAM/B,GAAI,UAAU,SAAd,IAAuB,qBAAS,UAAT,KAAwB,UAAxB,IAAsC,qBAAS,UAAU,CAAC,CAApB,CAAtC,IAAgE,UAAU,GAAG,UAAU,CAAC,CANhF,EAO/B,EAPU,EAAZ;AASA,WACE;AACE,eAAS,EAAE,GADb;AAEE,WAAK,EAAE,UAFT;AAGE,SAAG,EAAE,mBAAI;AACP,aAAI,CAAC,WAAL,GAAmB,IAAnB;AACD;AALH,OAOG,aAAa,CAAC,OAAD,EAAQ,sBAAO,KAAK,KAAZ,GAAiB;AAAE,aAAO,EAAE;AAAX,KAAjB,CAAR,CAPhB,CADF;AAWD,GA/ED;;AAvFO,wBAAc,SAAd;AAEA,yBAAe;AACpB,UAAM,EAAE,KADY;AAEpB,sBAAkB,EAAE;AAAE,OAAC,EAAE,KAAL;AAAY,OAAC,EAAE;AAAf,KAFA;AAGpB,UAAM,EAAE,EAHY;AAIpB,WAAO,EAAE;AAAE,QAAE,EAAE,CAAN;AAAS,QAAE,EAAE,CAAb;AAAgB,QAAE,EAAE,CAApB;AAAuB,QAAE,EAAE;AAA3B,KAJW;AAKpB,cAAU,EAAE;AAAE,OAAC,EAAE,CAAL;AAAQ,OAAC,EAAE;AAAX,KALQ;AAMpB,eAAW,EAAE,EANO;AAOpB,aAAS,EAAE,KAPS;AAQpB,gBAAY,EAAE,EARM;AASpB,gBAAY,EAAE,EATM;AAUpB,aAAS,EAAE,EAVS;AAWpB,cAAU,EAAE,EAXQ;AAYpB,UAAM,EAAE,IAZY;AAapB,WAAO,EAAE,OAbW;AAcpB,qBAAiB,EAAE,CAAC,oBAAO,KAdP;AAepB,mBAAe,EAAE,MAfG;AAgBpB,qBAAiB,EAAE,GAhBC;AAiBpB,cAAU,EAAE,IAjBQ;AAkBpB,kBAAc,EAAE;AAlBI,GAAf;AAqKT;AAAC,CAxKD,CAAwE,qBAAxE;;AA0KA,qBAAe,OAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpQA;;AACA;;AACA;;AASA,SAAS,KAAT,CAAe,KAAf,EAA2B;AACjB;AAAA,MAAU,2BAAV;AAAA,MAAqB,iDAArB;;AACR,MAAM,UAAU,GAAG,wBAAW,gBAAX,EAA6B,SAA7B,CAAnB;AAEA,SACE;AAAG,aAAS,EAAE;AAAd,KAA8B,oBAAY,MAAZ,EAAoB,IAApB,CAA9B,GACG,QADH,CADF;AAKD;;AAED,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtBA;;AACA;;AACA;;AAkBA,SAAS,OAAT,CAAiB,KAAjB,EAA6B;AACnB;AAAA,MAAU,mBAAV;AAAA,MAAiB,qBAAjB;AAAA,MAAyB,uBAAzB;AAAA,MAAkC,2BAAlC;AAAA,MAA6C,mBAA7C;AAAA,MAAoD,wFAApD;;AACR,MAAM,OAAO,GAAG,OAAO,IAAI;AAAE,SAAK,OAAP;AAAS,UAAM,QAAf;AAAiB,KAAC,EAAE,CAApB;AAAuB,KAAC,EAAE;AAA1B,GAA3B;AACA,MAAM,UAAU,GAAG,wBAAW,kBAAX,EAA+B,SAA/B,CAAnB;AAEA,SACE,qDACM,oBAAY,MAAZ,EAAoB,IAApB,EAA0B,IAA1B,CADN,EACqC;AACnC,aAAS,EAAE,UADwB;AAEnC,SAAK,EAAE,KAF4B;AAGnC,UAAM,EAAE,MAH2B;AAInC,SAAK,EAAE,KAJ4B;AAKnC,WAAO,EAAK,OAAO,CAAC,CAAR,GAAS,GAAT,GAAa,OAAO,CAAC,CAArB,GAAsB,GAAtB,GAA0B,OAAO,CAAC,KAAlC,GAAuC,GAAvC,GAA2C,OAAO,CAAC,MAL5B;AAMnC,WAAO,EAAC;AAN2B,GADrC,GASG,QATH,CADF;AAaD;;AAED,qBAAe,OAAf,C;;;;;;;;;;;;;;;;;;AC3CA;;AAEA;;AAAS;;AACT;;AAAS;;AAET;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AAET;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AAET;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AAET;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AAET;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AAET;;AAAS;;AACT;;AAAS;;AACT;;AAAS;;AAET;;AAAS,qC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxDT;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAkDA;AAAqB;;AAArB;AAAA;;AA0HE,kBAAe;AAAE,yBAAmB,EAAE;AAAvB,KAAf;;AAaA,0BAAgB,UAAC,UAAD,EAAkC;AAChD,WAAI,CAAC,QAAL,CAAc;AAAE,sBAAc,EAAE;AAAlB,OAAd;AACD,KAFD;;AAIA,+BAAqB;AACX;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc;AACf;AACF,KAPD;;AASA,iCAAuB;AACb;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,wBAAgB;AACjB;AACF,KAPD;;;AAwJD;;AA/KC,gEAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,0BAAf;;AAEN,QAAI,SAAS,CAAC,iBAAV,KAAgC,KAAK,KAAL,CAAW,iBAA/C,EAAkE;AAChE,WAAK,aAAL,CAAmB,EAAnB;AACD,KAFD,MAEO,IAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AAChD,WAAK,aAAL,CAAmB,UAAnB;AACD;AACF,GARD;;AAgCA,6CAAc,CAAd,EAAuB;AACb;;AAER,QAAI,KAAK,CAAC,OAAN,CAAc,WAAd,CAAJ,EAAgC;AAC9B,aAAO,WAAW,CAAC,OAAZ,CAAoB,CAApB,MAA2B,CAAC,CAAnC;AACD;;AAED,WAAO,CAAC,KAAK,WAAb;AACD,GARD;;AAUO,+BAAP,UAA2B,MAA3B,EAAyD,KAAzD,EAAmE;AACjE,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD;;AACD,QAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,aAAO,MAAM,CAAC,KAAD,CAAb;AACD;;AACD,QAAI,oBAAE,aAAF,CAAgB,MAAhB,CAAJ,EAA6B;AAC3B,aAAO,iCAAC,sBAAD,EAAU,aAAK,KAAL,EAAgB,MAAhB,CAAV,CAAP;AACD;;AAED,WAAO,iCAAC,sBAAD,EAAU,aAAK,KAAL,CAAV,CAAP;AACD,GAZM;;AAcP,0DAA2B,UAA3B,EAA4D;AAA5D;;AACU;AAER,WAAO,UAAU,CAAC,GAAX,CAAe,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC7B,UAAM,gBAAgB,GAAG,KAAI,CAAC,aAAL,CAAmB,CAAnB,IAAwB,WAAxB,GAAsC,IAA/D;;AACA,UAAM,cAAc,yBACf,KADe,GACV;AACR,cAAM,EAAE,KAAK,CAAC;AADN,OADU,CAApB;;AAKA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC;AADN,SAEA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAFA,EAEwC;AAC5C,WAAG,EAAE,eAAa;AAD0B,OAFxC,CAAN,EAKG,MAAM,CAAC,mBAAP,CAA2B,gBAA3B,EAA6C,cAA7C,CALH,CADF;AASD,KAhBM,CAAP;AAiBD,GApBD;;AAsBA;AAAA;;AACQ;AAAA,QACJ,0BADI;AAAA,QAEJ,wCAFI;AAAA,QAGJ,kCAHI;AAAA,QAIJ,wCAJI;AAAA,QAKJ,oCALI;AAAA,QAMJ,4BANI;AAQE;AAER,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,YAAU,WAPT;AAQN,sBAAgB,EAAE,KAAK,oBARjB;AASN,oBAAc,EAAE,KAAK;AATf,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;AACF,UAAM,QAAQ,GAAG,UAAU,CAAC,GAAX,CAAe,UAAC,KAAD,EAAQ,KAAR,EAAa;AAC3C,YAAM,IAAI,GAAG,cAAc,IAAI,cAAc,CAAC,KAAD,CAA7C;;AAEA,YAAI,IAAJ,EAAU;AACR,cAAM,eAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,cAAM,eAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,cAAM,wBAAsB,GAAG,8BAAkB,IAAI,CAAC,UAAvB,EAAmC,KAAK,CAAC,UAAzC,CAA/B;AACA,cAAM,wBAAsB,GAAG,8BAAkB,IAAI,CAAC,UAAvB,EAAmC,KAAK,CAAC,UAAzC,CAA/B;AACA,cAAM,oBAAkB,GAAG,8BAAkB,IAAI,CAAC,MAAvB,EAA+B,KAAK,CAAC,MAArC,CAA3B;AAEA,uCACK,KADL,GACU;AACR,aAAC,EAAE,eAAa,CAAC,CAAD,CADR;AAER,aAAC,EAAE,eAAa,CAAC,CAAD,CAFR;AAGR,sBAAU,EAAE,wBAAsB,CAAC,CAAD,CAH1B;AAIR,sBAAU,EAAE,wBAAsB,CAAC,CAAD,CAJ1B;AAKR,kBAAM,EAAE,oBAAkB,CAAC,CAAD;AALlB,WADV;AAQD;;AAED,YAAM,aAAa,GAAG,8BAAkB,KAAK,CAAC,CAAN,GAAU,KAAK,CAAC,UAAN,GAAmB,CAA/C,EAAkD,KAAK,CAAC,CAAxD,CAAtB;AACA,YAAM,aAAa,GAAG,8BAAkB,KAAK,CAAC,CAAN,GAAU,KAAK,CAAC,MAAN,GAAe,CAA3C,EAA8C,KAAK,CAAC,CAApD,CAAtB;AACA,YAAM,sBAAsB,GAAG,8BAAkB,CAAlB,EAAqB,KAAK,CAAC,UAA3B,CAA/B;AACA,YAAM,sBAAsB,GAAG,8BAAkB,CAAlB,EAAqB,KAAK,CAAC,UAA3B,CAA/B;AACA,YAAM,kBAAkB,GAAG,8BAAkB,CAAlB,EAAqB,KAAK,CAAC,MAA3B,CAA3B;AAEA,qCACK,KADL,GACU;AACR,WAAC,EAAE,aAAa,CAAC,CAAD,CADR;AAER,WAAC,EAAE,aAAa,CAAC,CAAD,CAFR;AAGR,oBAAU,EAAE,sBAAsB,CAAC,CAAD,CAH1B;AAIR,oBAAU,EAAE,sBAAsB,CAAC,CAAD,CAJ1B;AAKR,gBAAM,EAAE,kBAAkB,CAAC,CAAD;AALlB,SADV;AAQD,OAlCgB,CAAjB;AAmCA,aAAO,iCAAC,kBAAD,EAAM,IAAN,EAAQ,KAAI,CAAC,0BAAL,CAAgC,QAAhC,CAAR,CAAP;AACD,KAhDH,CADF;AAoDD,GA/DD;;AAiEA;AACQ;AAAA,QAAE,0BAAF;AAAA,QAAc,wCAAd;AACE;;AAER,QACE,iBAAiB,IACjB,UADA,IAEA,UAAU,CAAC,MAFX,KAGC,CAAC,cAAD,IAAmB,CAAC,oBAAE,OAAF,CAAU,cAAV,EAA0B,UAA1B,CAHrB,CADF,EAKE;AACA,aAAO,KAAK,6BAAL,EAAP;AACD;;AACD,WAAO,KAAK,0BAAL,CAAgC,UAAhC,CAAP;AACD,GAbD;;AAeA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,0BAAR;AAAA,QAAoB,wBAApB;AAAA,QAA+B,wCAA/B;AACE;;AAER,QAAI,IAAI,IAAI,CAAC,UAAT,IAAuB,CAAC,UAAU,CAAC,MAAvC,EAA+C;AAC7C,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,qBAAX,EAAkC,SAAlC,CAAnB;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,KAAK,gBAAL,EADH,EAEG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KAA+C,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,UAAzC,CAFlD,CADF;AAMD,GAhBD;;AA1RO,uBAAc,QAAd;AAEA,wBAAe;AACpB,UAAM,EAAE,MADY;AAEpB,QAAI,EAAE,SAFc;AAGpB,cAAU,EAAE,MAHQ;AAIpB,aAAS,EAAE,IAJS;AAKpB,QAAI,EAAE,KALc;AAMpB,qBAAiB,EAAE,CAAC,oBAAO,KANP;AAOpB,kBAAc,EAAE,GAPI;AAQpB,qBAAiB,EAAE,IARC;AASpB,mBAAe,EAAE,MATG;AAUpB,WAAO,EAAE;AAVW,GAAf;;AAaA,6BAAoB,UAAC,IAAD,EAAa;AAChC;AAAA,QAAE,cAAF;AAAA,QAAQ,sBAAR;AACN,QAAM,iBAAiB,GAAG,oBAAY,IAAI,CAAC,KAAjB,CAA1B;AACA,QAAM,KAAK,GAAG,2BAAc,QAAd,EAAwB,kBAAK,WAA7B,CAAd;;AAEA,QAAI,IAAI,IAAI,IAAI,CAAC,MAAjB,EAAyB;AACvB,aAAO,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,KAAR,EAAa;AAAK;AAChC,iBAAO,EAAE;AADuB,WAE7B,iBAF6B,GAG7B,KAH6B,GAI5B,KAAK,IAAI,KAAK,CAAC,KAAD,CAAd,IAAyB,KAAK,CAAC,KAAD,CAAL,CAJG;AAKhC,OALK,CAAP;AAMD;;AAED,QAAI,KAAK,IAAI,KAAK,CAAC,MAAnB,EAA2B;AACzB,aAAO,KAAK,CAAC,GAAN,CAAU,UAAC,IAAD,EAA8B;AAAK,qCAAM,iBAAN,GAA4B,IAAI,CAAhC;AAAyC,OAAtF,CAAP;AACD;;AAED,WAAO,EAAP;AACD,GAnBM;;AAqBA,8BAAqB,UAAC,IAAD,EAAe,MAAf,EAAkC;AAC5D,QAAM,WAAW,GAAG,IAAI,CAAC,KAAL,CAAW,KAA/B;AACQ;AAAA,QAAO,sBAAP;AAAA,QAAe,kBAAf;AAAA,QAAqB,oBAArB;AAAA,QAA4B,gBAA5B;AAAA,QAAiC,sBAAjC;AACR,QAAM,UAAU,GAAG,MAAnB;AACA,QAAI,SAAS,GAAG,KAAhB;;AAEA,QAAI,oBAAE,QAAF,CAAW,WAAX,CAAJ,EAA6B;AAC3B,eAAS,GAAG,WAAZ;AACD,KAFD,MAEO,IAAI,oBAAE,QAAF,CAAW,WAAX,CAAJ,EAA6B;AAClC,eAAS,GAAI,SAAS,GAAG,UAAU,CAAC,WAAD,CAAvB,GAAwC,GAApD;AACD;;AAED,WAAO;AACL,eAAS,EAAE,SAAS,GAAG,IAAZ,GAAmB,KAAnB,GAA2B,EADjC;AAEL,gBAAU,EAAE,UAAU,GAAG,MAAb,GAAsB,GAF7B;AAGL,aAAO,EAAE,CAAC,KAAK,GAAG,SAAT,IAAsB,CAH1B;AAIL,aAAO,EAAE,CAAC,MAAM,GAAG,UAAV,IAAwB;AAJ5B,KAAP;AAMD,GAlBM;;AAoBA,2BAAkB,UAAC,EAAD,EAYxB;QAXC,c;QACA,kB;QACA,sC;QACA,sC;QACA,4B;AAQA,QAAM,UAAU,GAAG,MAAM,CAAC,iBAAP,CAAyB,IAAzB,CAAnB;AACM;AAAA,QAAE,oBAAF;AAAA,QAAW,oBAAX;AAAA,QAAoB,4BAApB;AACE;AAAA,QAAM,gBAAN;;AACF;AAAA,QAAE,0BAAF;AAAA,QAAc,wBAAd;AAAA,QAAyB,oBAAzB;AAAA,QAAkC,oBAAlC;;AACN,QAAM,QAAQ,GAAG,+BAAkB,UAAU,CAAC,CAAD,CAA5B,EAAiC,OAAjC,EAA0C,CAA1C,CAAjB;AACA,QAAM,GAAG,GAAG,UAAU,CAAC,MAAvB;AACA,QAAM,SAAS,GAAG,UAAU,GAAG,GAA/B;AAEA,QAAM,UAAU,GAAG,UAAU,CAAC,GAAX,CAAe,UAAC,KAAD,EAAa,CAAb,EAAsB;AACtD,UAAM,GAAG,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,EAAkC,CAAlC,CAAZ;AACA,UAAM,IAAI,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,EAAkC,CAAlC,CAAb;AACA,UAAI,OAAO,GAAG,CAAd;;AACA,UAAI,CAAC,KAAK,GAAG,GAAG,CAAhB,EAAmB;AACjB,eAAO,GAAG,+BAAkB,UAAU,CAAC,CAAC,GAAG,CAAL,CAA5B,EAAqC,OAArC,EAA8C,CAA9C,CAAV;AACD;;AAED,UAAM,CAAC,GAAI,CAAC,QAAQ,GAAG,GAAZ,IAAmB,SAApB,IAAkC,IAAI,QAAtC,IAAkD,GAAlD,GAAwD,EAAxD,GAA6D,OAAvE;AACA,UAAM,CAAC,GAAI,UAAU,GAAG,GAAd,GAAqB,CAArB,GAAyB,IAAzB,GAAgC,OAA1C;AACA,UAAM,UAAU,GAAI,GAAG,GAAG,QAAP,GAAmB,SAAtC;AACA,UAAM,UAAU,GAAI,OAAO,GAAG,QAAX,GAAuB,SAA1C;AAEA,UAAM,cAAc,GAAG,CAAC;AAAE,YAAI,MAAN;AAAQ,aAAK,EAAE,GAAf;AAAoB,eAAO,EAAE,KAA7B;AAAoC,eAAO,SAA3C;AAA6C,YAAI,EAAE;AAAnD,OAAD,CAAvB;AACA,UAAM,eAAe,GAAG;AACtB,SAAC,EAAE,CAAC,GAAG,UAAU,GAAG,CADE;AAEtB,SAAC,EAAE,CAAC,GAAG,SAAS,GAAG;AAFG,OAAxB;AAKA;AACE,SAAC,GADH;AAEE,SAAC,GAFH;AAGE,aAAK,EAAE,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,UAArB,CAHT;AAIE,kBAAU,YAJZ;AAKE,kBAAU,YALZ;AAME,cAAM,EAAE,SANV;AAOE,YAAI,MAPN;AAQE,WAAG,KARL;AASE,sBAAc,gBAThB;AAUE,uBAAe;AAVjB,SAWK,oBAAE,IAAF,CAAO,KAAP,EAAc,OAAd,CAXL,GAW2B;AACzB,eAAO,EAAE;AADgB,OAX3B;AAcD,KAjCkB,CAAnB;AAmCA,WAAO;AACL,gBAAU,YADL;AAEL,UAAI,EAAE,UAFD;AAGL,kBAAY,EAAE,oBAAE,UAAF,CAAa,gBAAb,IAAiC,gBAAjC,GAAoD,IAAI,CAAC,KAAL,CAAW,YAHxE;AAIL,kBAAY,EAAE,oBAAE,UAAF,CAAa,gBAAb,IAAiC,gBAAjC,GAAoD,IAAI,CAAC,KAAL,CAAW,YAJxE;AAKL,aAAO,EAAE,oBAAE,UAAF,CAAa,WAAb,IAA4B,WAA5B,GAA0C,IAAI,CAAC,KAAL,CAAW;AALzD,KAAP;AAOD,GA/DM;;AAmPT;AAAC,CA5SD,CAAqB,qBAArB;;AA8SA,qBAAe,MAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5WA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAqFA;AAAkB;;AAAlB;AAAA;;AA8KE,kBAAe;AAAE,yBAAmB,EAAE;AAAvB,KAAf;AAwBA,eAAK,qBAAS,eAAT,CAAL;;AAEA,0BAAgB,UAAC,OAAD,EAA6B;AAC3C,WAAI,CAAC,QAAL,CAAc;AAAE,mBAAW,EAAE;AAAf,OAAd;AACD,KAFD;;AAcA,+BAAqB;AACX;;AAER,WAAI,CAAC,QAAL,CAAc;AACZ,2BAAmB,EAAE;AADT,OAAd;;AAIA,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc;AACf;AACF,KAVD;;AAYA,iCAAuB;AACb;;AAER,WAAI,CAAC,QAAL,CAAc;AACZ,2BAAmB,EAAE;AADT,OAAd;;AAIA,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,wBAAgB;AACjB;AACF,KAVD;;;AAkOD;;AAnRC,6DAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,oBAAf;;AAEN,QAAI,SAAS,CAAC,iBAAV,KAAgC,KAAK,KAAL,CAAW,iBAA/C,EAAkE;AAChE,WAAK,aAAL,CAAmB,EAAnB;AACD,KAFD,MAEO,IAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AAChD,WAAK,aAAL,CAAmB,OAAnB;AACD;AACF,GARD;;AAUO,sBAAP,UAAqB,CAArB,EAAgC,EAAhC,EAA0C;AACxC,QAAI,CAAC,GAAG,EAAR,EAAY;AACV,aAAO,OAAP;AACD;;AACD,QAAI,CAAC,GAAG,EAAR,EAAY;AACV,aAAO,KAAP;AACD;;AAED,WAAO,QAAP;AACD,GATM;;AAiBP,0CAAc,CAAd,EAAuB;AACb;;AAER,QAAI,KAAK,CAAC,OAAN,CAAc,WAAd,CAAJ,EAAgC;AAC9B,aAAO,WAAW,CAAC,OAAZ,CAAoB,CAApB,MAA2B,CAAC,CAAnC;AACD;;AAED,WAAO,CAAC,KAAK,WAAb;AACD,GARD;;AAkCO,4BAAP,UAA2B,MAA3B,EAAiD,KAAjD,EAA2D;AACzD,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD;;AACD,QAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,aAAO,MAAM,CAAC,KAAD,CAAb;AACD;;AAED,WAAO,iCAAC,kBAAD,EAAM,aAAK,KAAL,EAAU;AAAE,UAAI,EAAC,QAAP;AAAgB,eAAS,EAAC;AAA1B,KAAV,CAAN,CAAP;AACD,GATM;;AAWA,wBAAP,UAAuB,MAAvB,EAAyC,KAAzC,EAAqD,KAArD,EAA+D;AAC7D,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD;;AACD,QAAI,KAAK,GAAG,KAAZ;;AACA,QAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,WAAK,GAAG,MAAM,CAAC,KAAD,CAAd;;AACA,UAAI,mBAAM,cAAN,CAAqB,KAArB,CAAJ,EAAiC;AAC/B,eAAO,KAAP;AACD;AACF;;AAED,WACE,iCAAC,iBAAD,EAAK,aAAK,KAAL,EAAU;AAAE,uBAAiB,EAAC,QAApB;AAA6B,eAAS,EAAC;AAAvC,KAAV,CAAL,EACG,KADH,CADF;AAKD,GAjBM;;AAmBP,yCAAa,OAAb,EAAyC;AAC/B;;AAER,QAAI,iBAAiB,IAAI,CAAC,KAAK,KAAL,CAAW,mBAArC,EAA0D;AACxD,aAAO,IAAP;AACD;;AACK;AAAA,QAAE,gBAAF;AAAA,QAAS,wBAAT;AAAA,QAAoB,oBAApB;AAAA,QAA6B,sBAA7B;AACN,QAAM,QAAQ,GAAG,oBAAY,KAAK,KAAjB,CAAjB;AACA,QAAM,gBAAgB,GAAG,oBAAY,KAAZ,CAAzB;AACA,QAAM,oBAAoB,GAAG,oBAAY,SAAZ,CAA7B;AACA,QAAM,YAAY,GAAI,KAAK,IAAK,KAAa,CAAC,YAAzB,IAA0C,EAA/D;AAEA,QAAM,MAAM,GAAG,OAAO,CAAC,GAAR,CAAY,UAAC,KAAD,EAAQ,CAAR,EAAS;AAClC,UAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,UAAN,GAAmB,KAAK,CAAC,QAA1B,IAAsC,CAAvD;AACA,UAAM,QAAQ,GAAG,8BAAiB,KAAK,CAAC,EAAvB,EAA2B,KAAK,CAAC,EAAjC,EAAqC,KAAK,CAAC,WAAN,GAAoB,YAAzD,EAAuE,QAAvE,CAAjB;;AACA,UAAM,UAAU,6DACX,QADW,GAEX,KAFW,GAEN;AACR,cAAM,EAAE;AADA,OAFM,GAIX,gBAJW,GAIK;AACnB,aAAK,EAAE,CADY;AAEnB,kBAAU,EAAE,GAAG,CAAC,aAAJ,CAAkB,QAAQ,CAAC,CAA3B,EAA8B,KAAK,CAAC,EAApC;AAFO,OAJL,GAOX,QAPW,CAAhB;;AASA,UAAM,SAAS,oDACV,QADU,GAEV,KAFU,GAEL;AACR,YAAI,EAAE,MADE;AAER,cAAM,EAAE,KAAK,CAAC;AAFN,OAFK,GAKV,oBALU,GAKU;AACvB,aAAK,EAAE,CADgB;AAEvB,cAAM,EAAE,CAAC,8BAAiB,KAAK,CAAC,EAAvB,EAA2B,KAAK,CAAC,EAAjC,EAAqC,KAAK,CAAC,WAA3C,EAAwD,QAAxD,CAAD,EAAoE,QAApE,CAFe;AAGvB,WAAG,EAAE;AAHkB,OALV,CAAf;;AAUA,UAAI,WAAW,GAAG,OAAlB;;AAEA,UAAI,oBAAE,KAAF,CAAQ,OAAR,KAAoB,oBAAE,KAAF,CAAQ,QAAR,CAAxB,EAA2C;AACzC,mBAAW,GAAG,OAAd;AACD,OAFD,MAEO,IAAI,oBAAE,KAAF,CAAQ,OAAR,CAAJ,EAAsB;AAC3B,mBAAW,GAAG,QAAd;AACD;;AAED,aAEE,iCAAC,kBAAD,EAAM;AAAC,WAAG,EAAE,WAAS;AAAf,OAAN,EACG,SAAS,IAAI,GAAG,CAAC,mBAAJ,CAAwB,SAAxB,EAAmC,SAAnC,CADhB,EAEG,GAAG,CAAC,eAAJ,CAAoB,KAApB,EAA2B,UAA3B,EAAuC,+BAAkB,KAAlB,EAAyB,WAAzB,CAAvC,CAFH,CAFF;AAOD,KArCc,CAAf;AAuCA,WAAO,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EAAwC,MAAxC,CAAP;AACD,GApDD;;AAsDO,yBAAP,UAAwB,MAAxB,EAAgD,KAAhD,EAA0D;AACxD,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAP;AACD;;AACD,QAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AACxB,aAAO,MAAM,CAAC,KAAD,CAAb;AACD;;AACD,QAAI,oBAAE,aAAF,CAAgB,MAAhB,CAAJ,EAA6B;AAC3B,aAAO,iCAAC,mBAAD,EAAO,aAAK,KAAL,EAAgB,MAAhB,CAAP,CAAP;AACD;;AAED,WAAO,iCAAC,mBAAD,EAAO,aAAK,KAAL,CAAP,CAAP;AACD,GAZM;;AAcP,oDAAwB,OAAxB,EAAoD;AAApD;;AACQ;AAAA,QAAE,4BAAF;AAAA,QAAe,4BAAf;AAEN,WAAO,OAAO,CAAC,GAAR,CAAY,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC1B,UAAM,aAAa,GAAG,KAAI,CAAC,aAAL,CAAmB,CAAnB,IAAwB,WAAxB,GAAsC,IAA5D;;AACA,UAAM,WAAW,yBACZ,KADY,GACP;AACR,cAAM,EAAE,WAAW,GAAG,KAAK,CAAC,IAAT,GAAgB,KAAK,CAAC;AADjC,OADO,CAAjB;;AAKA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC;AADN,SAEA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAFA,EAEwC;AAC5C,WAAG,EAAE,YAAU;AAD6B,OAFxC,CAAN,EAKG,GAAG,CAAC,gBAAJ,CAAqB,aAArB,EAAoC,WAApC,CALH,CADF;AASD,KAhBM,CAAP;AAiBD,GApBD;;AAsBA;AAAA;;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,wCAAX;AAAA,QAA8B,kCAA9B;AAAA,QAA8C,wCAA9C;AAAA,QAAiE,oCAAjE;AAAA,QAAkF,4BAAlF;AACE;AAER,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,SAAO,WAPN;AAQN,sBAAgB,EAAE,KAAK,oBARjB;AASN,oBAAc,EAAE,KAAK;AATf,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;AACF,UAAM,QAAQ,GAAwB,EAAtC;AACA,UAAM,KAAK,GAAG,OAAO,IAAI,OAAO,CAAC,CAAD,CAAhC;AACA,UAAI,QAAQ,GAAG,KAAK,CAAC,UAArB;AAEA,aAAO,CAAC,OAAR,CAAgB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAC3B,YAAM,IAAI,GAAG,WAAW,IAAI,WAAW,CAAC,KAAD,CAAvC;AACA,YAAM,YAAY,GAAG,KAAK,GAAG,CAAR,GAAY,oBAAE,GAAF,CAAM,KAAN,EAAa,cAAb,EAA6B,CAA7B,CAAZ,GAA8C,CAAnE;;AAEA,YAAI,IAAJ,EAAU;AACR,cAAM,OAAO,GAAG,8BAAkB,IAAI,CAAC,QAAL,GAAgB,IAAI,CAAC,UAAvC,EAAmD,KAAK,CAAC,QAAN,GAAiB,KAAK,CAAC,UAA1E,CAAhB;;AACA,cAAM,MAAM,yBACP,KADO,GACF;AACR,sBAAU,EAAE,QAAQ,GAAG,YADf;AAER,oBAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,CAAD,CAAlB,GAAwB;AAF1B,WADE,CAAZ;;AAMA,kBAAQ,CAAC,IAAT,CAAc,MAAd;AACA,kBAAQ,GAAG,MAAM,CAAC,QAAlB;AACD,SAVD,MAUO;AACG;AAAA,cAAU,6BAAV;AACR,cAAM,iBAAiB,GAAG,8BAAkB,CAAlB,EAAqB,QAAQ,GAAG,UAAhC,CAA1B;AACA,cAAM,UAAU,GAAG,iBAAiB,CAAC,CAAD,CAApC;;AACA,cAAM,MAAM,yBACP,KADO,GACF;AACR,sBAAU,EAAE,QAAQ,GAAG,YADf;AAER,oBAAQ,EAAE,QAAQ,GAAG,UAAX,GAAwB;AAF1B,WADE,CAAZ;;AAMA,kBAAQ,CAAC,IAAT,CAAc,MAAd;AACA,kBAAQ,GAAG,MAAM,CAAC,QAAlB;AACD;AACF,OA3BD;AA6BA,aAAO,iCAAC,kBAAD,EAAM,IAAN,EAAQ,KAAI,CAAC,uBAAL,CAA6B,QAA7B,CAAR,CAAP;AACD,KA9CH,CADF;AAkDD,GAtDD;;AAwDA;AACQ;AAAA,QAAE,oBAAF;AAAA,QAAW,wCAAX;AACE;;AAER,QAAI,iBAAiB,IAAI,OAArB,IAAgC,OAAO,CAAC,MAAxC,KAAmD,CAAC,WAAD,IAAgB,CAAC,oBAAE,OAAF,CAAU,WAAV,EAAuB,OAAvB,CAApE,CAAJ,EAA0G;AACxG,aAAO,KAAK,0BAAL,EAAP;AACD;;AACD,WAAO,KAAK,uBAAL,CAA6B,OAA7B,CAAP;AACD,GARD;;AAUA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,oBAAR;AAAA,QAAiB,wBAAjB;AAAA,QAA4B,gBAA5B;AAAA,QAAmC,UAAnC;AAAA,QAAuC,UAAvC;AAAA,QAA2C,4BAA3C;AAAA,QAAwD,4BAAxD;AAAA,QAAqE,wCAArE;AACE;;AAER,QACE,IAAI,IACJ,CAAC,OADD,IAEA,CAAC,OAAO,CAAC,MAFT,IAGA,CAAC,qBAAS,EAAT,CAHD,IAIA,CAAC,qBAAS,EAAT,CAJD,IAKA,CAAC,qBAAS,WAAT,CALD,IAMA,CAAC,qBAAS,WAAT,CAPH,EAQE;AACA,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,cAAX,EAA2B,SAA3B,CAAnB;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,KAAK,aAAL,EADH,EAEG,KAAK,IAAI,KAAK,YAAL,CAAkB,OAAlB,CAFZ,EAGG,mBAAM,kBAAN,CAAyB,KAAK,KAA9B,EAAqC,IAArC,EAA2C,KAA3C,CAHH,EAIG,CAAC,CAAC,iBAAD,IAAuB,WAAW,IAAI,oBAAE,OAAF,CAAU,WAAV,EAAuB,OAAvB,CAAvC,KACC,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,OAAzC,EAAkD,KAAlD,CALJ,CADF;AASD,GA3BD;;AAvaO,oBAAc,KAAd;AAEA,qBAAe;AACpB,UAAM,EAAE,MADY;AAEpB,QAAI,EAAE,SAFc;AAGpB,cAAU,EAAE,MAHQ;AAIpB,MAAE,EAAE,KAJgB;AAKpB,MAAE,EAAE,KALgB;AAMpB,cAAU,EAAE,CANQ;AAOpB,YAAQ,EAAE,GAPU;AAQpB,eAAW,EAAE,CARO;AASpB,eAAW,EAAE,KATO;AAUpB,gBAAY,EAAE,CAVM;AAWpB,aAAS,EAAE,IAXS;AAYpB,QAAI,EAAE,KAZc;AAapB,YAAQ,EAAE,CAbU;AAcpB,qBAAiB,EAAE,CAAC,oBAAO,KAdP;AAepB,kBAAc,EAAE,GAfI;AAgBpB,qBAAiB,EAAE,IAhBC;AAiBpB,mBAAe,EAAE,MAjBG;AAkBpB,WAAO,EAAE,MAlBW;AAmBpB,eAAW,EAAE;AAnBO,GAAf;;AAsBA,wBAAkB,UAAC,UAAD,EAAqB,QAArB,EAAqC;AAC5D,QAAM,IAAI,GAAG,qBAAS,QAAQ,GAAG,UAApB,CAAb;AACA,QAAM,UAAU,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,QAAQ,GAAG,UAApB,CAAT,EAA0C,GAA1C,CAAnB;AAEA,WAAO,IAAI,GAAG,UAAd;AACD,GALM;;AAOA,uBAAiB,UAAC,IAAD,EAAU;AAC1B;AAAA,QAAE,cAAF;AAAA,QAAQ,sBAAR;AACN,QAAM,iBAAiB,GAAG,oBAAY,IAAI,CAAC,KAAjB,CAA1B;AACA,QAAM,KAAK,GAAG,2BAAc,QAAd,EAAwB,kBAAK,WAA7B,CAAd;;AAEA,QAAI,IAAI,IAAI,IAAI,CAAC,MAAjB,EAAyB;AACvB,aAAO,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,KAAR,EAAa;AAAK;AAChC,iBAAO,EAAE;AADuB,WAE7B,iBAF6B,GAG7B,KAH6B,GAI5B,KAAK,IAAI,KAAK,CAAC,KAAD,CAAd,IAAyB,KAAK,CAAC,KAAD,CAAL,CAJG;AAKhC,OALK,CAAP;AAMD;;AAED,QAAI,KAAK,IAAI,KAAK,CAAC,MAAnB,EAA2B;AACzB,aAAO,KAAK,CAAC,GAAN,CAAU,UAAC,IAAD,EAA8B;AAAK,qCAAM,iBAAN,GAA4B,IAAI,CAAhC;AAAyC,OAAtF,CAAP;AACD;;AAED,WAAO,EAAP;AACD,GAnBM;;AAqBA,6BAAuB,UAAC,IAAD,EAAY,MAAZ,EAA+B;AACnD;AAAA,QAAK,kBAAL;AAAA,QAAW,oBAAX;AAAA,QAAkB,sBAAlB;AACR,QAAM,YAAY,GAAG,0BAAa,KAAb,EAAoB,MAApB,CAArB;AACA,QAAM,EAAE,GAAG,IAAI,GAAG,4BAAgB,IAAI,CAAC,KAAL,CAAW,EAA3B,EAA+B,KAA/B,EAAsC,KAAK,GAAG,CAA9C,CAAlB;AACA,QAAM,EAAE,GAAG,GAAG,GAAG,4BAAgB,IAAI,CAAC,KAAL,CAAW,EAA3B,EAA+B,MAA/B,EAAuC,MAAM,GAAG,CAAhD,CAAjB;AACA,QAAM,WAAW,GAAG,4BAAgB,IAAI,CAAC,KAAL,CAAW,WAA3B,EAAwC,YAAxC,EAAsD,CAAtD,CAApB;AACA,QAAM,WAAW,GAAG,4BAAgB,IAAI,CAAC,KAAL,CAAW,WAA3B,EAAwC,YAAxC,EAAsD,YAAY,GAAG,GAArE,CAApB;AACA,QAAM,SAAS,GAAG,IAAI,CAAC,KAAL,CAAW,SAAX,IAAwB,IAAI,CAAC,IAAL,CAAU,KAAK,GAAG,KAAR,GAAgB,MAAM,GAAG,MAAnC,IAA6C,CAAvF;AAEA,WAAO;AAAE,QAAE,IAAJ;AAAM,QAAE,IAAR;AAAU,iBAAW,aAArB;AAAuB,iBAAW,aAAlC;AAAoC,eAAS;AAA7C,KAAP;AACD,GAVM;;AAYA,wBAAkB,UAAC,EAAD,EAYxB;QAXC,c;QACA,kB;QACA,sC;QACA,sC;QACA,4B;AAQA,QAAM,OAAO,GAAG,GAAG,CAAC,cAAJ,CAAmB,IAAnB,CAAhB;;AACA,QAAI,CAAC,OAAD,IAAY,CAAC,OAAO,CAAC,MAAzB,EAAiC;AAC/B,aAAO,IAAP;AACD;;AAEK;AAAA,QAAE,8BAAF;AAAA,QAAgB,0BAAhB;AAAA,QAA4B,sBAA5B;AAAA,QAAsC,8BAAtC;AAAA,QAAoD,oBAApD;AAAA,QAA6D,oBAA7D;AAAA,QAAsE,sBAAtE;AAAA,QAAgF,4BAAhF;AACN,QAAM,QAAQ,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,KAAL,CAAW,QAApB,CAAjB;AACA,QAAM,UAAU,GAAG,GAAG,CAAC,oBAAJ,CAAyB,IAAzB,EAA+B,MAA/B,CAAnB;AACA,QAAM,GAAG,GAAG,OAAO,CAAC,MAApB;AACA,QAAM,UAAU,GAAG,GAAG,CAAC,eAAJ,CAAoB,UAApB,EAAgC,QAAhC,CAAnB;AACA,QAAM,aAAa,GAAG,IAAI,CAAC,GAAL,CAAS,UAAT,CAAtB;AACA,QAAM,gBAAgB,GAAG,CAAC,aAAa,IAAI,GAAjB,GAAuB,GAAvB,GAA6B,GAAG,GAAG,CAApC,IAAyC,YAAlE;AACA,QAAM,cAAc,GAAG,aAAa,GAAG,GAAG,GAAG,QAAtB,GAAiC,gBAAxD;AACA,QAAI,WAAW,GAAG,OAAlB;;AAEA,QAAI,oBAAE,KAAF,CAAQ,OAAR,KAAoB,oBAAE,KAAF,CAAQ,QAAR,CAAxB,EAA2C;AACzC,sBACE,KADF,EAEE,wGAFF;AAKA,iBAAW,GAAG,OAAd;AACD,KAPD,MAOO,IAAI,oBAAE,KAAF,CAAQ,OAAR,CAAJ,EAAsB;AAC3B,sBACE,KADF,EAEE,wGAFF;AAKA,iBAAW,GAAG,QAAd;AACD;;AAED,QAAM,GAAG,GAAG,OAAO,CAAC,MAAR,CAAe,UAAC,MAAD,EAAiB,KAAjB,EAA2B;AACpD,UAAM,GAAG,GAAG,+BAAkB,KAAlB,EAAyB,WAAzB,EAAsC,CAAtC,CAAZ;AACA,aAAO,MAAM,IAAI,qBAAS,GAAT,IAAgB,GAAhB,GAAsB,CAA1B,CAAb;AACD,KAHW,EAGT,CAHS,CAAZ;AAIA,QAAI,OAAJ;;AAEA,QAAI,GAAG,GAAG,CAAV,EAAa;AACX,UAAI,MAAJ;AACA,aAAO,GAAG,OAAO,CAAC,GAAR,CAAY,UAAC,KAAD,EAAa,CAAb,EAAsB;AAC1C,YAAM,GAAG,GAAG,+BAAkB,KAAlB,EAAyB,WAAzB,EAAsC,CAAtC,CAAZ;AACA,YAAM,IAAI,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,EAAkC,CAAlC,CAAb;AACA,YAAM,OAAO,GAAG,CAAC,qBAAS,GAAT,IAAgB,GAAhB,GAAsB,CAAvB,IAA4B,GAA5C;AACA,YAAI,cAAJ;;AAEA,YAAI,CAAJ,EAAO;AACL,wBAAc,GAAG,MAAI,CAAC,QAAL,GAAgB,qBAAS,UAAT,IAAuB,YAAxD;AACD,SAFD,MAEO;AACL,wBAAc,GAAG,UAAjB;AACD;;AAED,YAAM,YAAY,GAAG,cAAc,GAAG,qBAAS,UAAT,KAAwB,QAAQ,GAAG,OAAO,GAAG,cAA7C,CAAtC;AACA,YAAM,QAAQ,GAAG,CAAC,cAAc,GAAG,YAAlB,IAAkC,CAAnD;AACA,YAAM,YAAY,GAAG,CAAC,UAAU,CAAC,WAAX,GAAyB,UAAU,CAAC,WAArC,IAAoD,CAAzE;AACA,YAAM,cAAc,GAAG,CACrB;AACE,cAAI,MADN;AAEE,eAAK,EAAE,GAFT;AAGE,iBAAO,EAAE,KAHX;AAIE,iBAAO,EAAE,WAJX;AAKE,cAAI,EAAE;AALR,SADqB,CAAvB;AASA,YAAM,eAAe,GAAG,8BAAiB,UAAU,CAAC,EAA5B,EAAgC,UAAU,CAAC,EAA3C,EAA+C,YAA/C,EAA6D,QAA7D,CAAxB;AAEA,cAAI;AACF,iBAAO,SADL;AAEF,sBAAY,cAFV;AAGF,cAAI,MAHF;AAIF,wBAAc,gBAJZ;AAKF,kBAAQ,UALN;AAMF,sBAAY,cANV;AAOF,yBAAe;AAPb,WAQC,KARD,GASC,UATD,GASW;AACb,eAAK,EAAE,+BAAkB,KAAlB,EAAyB,WAAzB,CADM;AAEb,oBAAU,EAAE,cAFC;AAGb,kBAAQ,EAAE,YAHG;AAIb,iBAAO,EAAE,KAJI;AAKb,sBAAY,EAAE,qBAAS,UAAT,IAAuB;AALxB,SATX,CAAJ;AAiBA,eAAO,MAAP;AACD,OA5CS,CAAV;AA6CD;;AAED,iCACK,UADL,GACe;AACb,aAAO,SADM;AAEb,UAAI,EAAE,OAFO;AAGb,kBAAY,EAAE,oBAAE,UAAF,CAAa,gBAAb,IAAiC,gBAAjC,GAAoD,IAAI,CAAC,KAAL,CAAW,YAHhE;AAIb,kBAAY,EAAE,oBAAE,UAAF,CAAa,gBAAb,IAAiC,gBAAjC,GAAoD,IAAI,CAAC,KAAL,CAAW,YAJhE;AAKb,aAAO,EAAE,oBAAE,UAAF,CAAa,WAAb,IAA4B,WAA5B,GAA0C,IAAI,CAAC,KAAL,CAAW;AALjD,KADf;AAQD,GA3GM;;AAmYT;AAAC,CApcD,CAAkB,qBAAlB;;AAscA,qBAAe,GAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5iBA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEA,IAAM,MAAM,GAAG,IAAI,CAAC,EAAL,GAAU,GAAzB;AACA,IAAM,GAAG,GAAG,IAAZ;;AAaA;AAA6B;;AAA7B;;AAoJC;;AAxHC,wDAAiB,IAAjB,EAA+B;AACvB;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;AAAA,QAAU,kBAAV;AAAA,QAAkB,4BAAlB;AAAA,QAA+B,sBAA/B;AACN,QAAM,YAAY,GAAG,QAAQ,IAAI,CAAjC;AACA,QAAM,EAAE,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,IAAI,CAAC,UAAtC,CAAX;AACA,QAAM,EAAE,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAM,GAAG,CAAC,WAAW,KAAK,OAAhB,GAA0B,CAAC,CAA3B,GAA+B,CAAhC,IAAqC,YAAvE,EAAqF,IAAI,CAAC,UAA1F,CAAX;AAEA,WAAO;AAAE,QAAE,EAAE,EAAE,CAAC,CAAT;AAAY,QAAE,EAAE,EAAE,CAAC,CAAnB;AAAsB,QAAE,EAAE,EAAE,CAAC,CAA7B;AAAgC,QAAE,EAAE,EAAE,CAAC;AAAvC,KAAP;AACD,GAPD;;AAcA,yDAAkB,IAAlB,EAAgC;AACtB;AACR,QAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,CAAC,IAAI,CAAC,UAAN,GAAmB,MAA5B,CAAZ;AACA,QAAI,UAAJ;;AAEA,QAAI,GAAG,GAAG,GAAV,EAAe;AACb,gBAAU,GAAG,WAAW,KAAK,OAAhB,GAA0B,OAA1B,GAAoC,KAAjD;AACD,KAFD,MAEO,IAAI,GAAG,GAAG,CAAC,GAAX,EAAgB;AACrB,gBAAU,GAAG,WAAW,KAAK,OAAhB,GAA0B,KAA1B,GAAkC,OAA/C;AACD,KAFM,MAEA;AACL,gBAAU,GAAG,QAAb;AACD;;AAED,WAAO,UAAP;AACD,GAdD;;AAgBA;AACQ;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;AAAA,QAAU,kBAAV;AAAA,QAAkB,sBAAlB;AAAA,QAA4B,8BAA5B;;AACN,QAAM,KAAK,kCACN,oBAAY,KAAK,KAAjB,CADM,GACiB;AAC1B,UAAI,EAAE;AADoB,KADjB,GAGN,oBAAY,QAAZ,CAHM,CAAX;;AAMA,QAAI,YAAY,KAAK,QAArB,EAA+B;AAC7B,aAAO,iCAAC,gBAAD,EAAI;AAAC,iBAAS,EAAC;AAAX,SAAgD,KAAhD,EAAqD;AAAE,UAAE,EAAE,EAAN;AAAU,UAAE,EAAE,EAAd;AAAkB,SAAC,EAAE;AAArB,OAArD,CAAJ,CAAP;AACD;;AACO;AACR,QAAM,MAAM,GAAG,KAAK,CAAC,GAAN,CAAU,iBAAK;AAAI,2CAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,KAAK,CAAtC;AAAkD,KAArE,CAAf;AAEA,WAAO,iCAAC,oBAAD,EAAQ;AAAC,eAAS,EAAC;AAAX,OAAgD,KAAhD,EAAqD;AAAE,YAAM,EAAE;AAAV,KAArD,CAAR,CAAP;AACD,GAfD;;AAiBO,kCAAP,UAAsB,MAAtB,EAA2D,KAA3D,EAAuE,KAAvE,EAA6F;AAC3F,QAAI,QAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,cAAQ,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAX;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,cAAQ,GAAG,MAAM,CAAC,KAAD,CAAjB;AACD,KAFM,MAEA;AACL,cAAQ,GACN,iCAAC,iBAAD,EAAK,aAAK,KAAL,EAAU;AAAE,iBAAS,EAAC;AAAZ,OAAV,CAAL,EACG,KADH,CADF;AAKD;;AAED,WAAO,QAAP;AACD,GAhBM;;AAkBP;AAAA;;AACQ;AAAA,QAAE,gBAAF;AAAA,QAAS,cAAT;AAAA,QAAe,sBAAf;AAAA,QAAyB,gCAAzB;AAAA,QAAwC,kBAAxC;AACN,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AACA,QAAM,eAAe,GAAG,oBAAY,IAAZ,CAAxB;;AACA,QAAM,aAAa,kCACd,SADc,GACL;AACZ,UAAI,EAAE;AADM,KADK,GAGd,oBAAY,QAAZ,CAHc,CAAnB;;AAMA,QAAM,KAAK,GAAG,KAAK,CAAC,GAAN,CAAU,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC/B,UAAM,SAAS,GAAG,KAAI,CAAC,gBAAL,CAAsB,KAAtB,CAAlB;;AACA,UAAM,UAAU,GAAG,KAAI,CAAC,iBAAL,CAAuB,KAAvB,CAAnB;;AACA,UAAM,SAAS;AACb,kBAAU;AADG,SAEV,SAFU,GAED;AACZ,cAAM,EAAE,MADI;AAEZ,YAAI,EAAE;AAFM,OAFC,GAKV,eALU,GAKK;AAClB,aAAK,EAAE,CADW;AAElB,eAAO,EAAE,KAFS;AAGlB,SAAC,EAAE,SAAS,CAAC,EAHK;AAIlB,SAAC,EAAE,SAAS,CAAC;AAJK,OALL,CAAf;;AAYA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC,gCADN;AAEJ,WAAG,EAAE,UAAQ;AAFT,SAGA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAHA,CAAN,EAKG,QAAQ,IAAI;AAAM,iBAAS,EAAC;AAAhB,SAA0D,aAA1D,EAA6E,SAA7E,EALf,EAMG,IAAI,IACH,cAAc,CAAC,cAAf,CAA8B,IAA9B,EAAoC,SAApC,EAA+C,aAAa,GAAG,aAAa,CAAC,KAAK,CAAC,KAAP,EAAc,CAAd,CAAhB,GAAmC,KAAK,CAAC,KAArG,CAPJ,CADF;AAWD,KA1Ba,CAAd;AA4BA,WAAO,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EAAoD,KAApD,CAAP;AACD,GAvCD;;AAyCA;AACQ;AAAA,QAAE,gBAAF;AAAA,QAAS,kBAAT;AAAA,QAAiB,sBAAjB;;AAEN,QAAI,MAAM,IAAI,CAAV,IAAe,CAAC,KAAhB,IAAyB,CAAC,KAAK,CAAC,MAApC,EAA4C;AAC1C,aAAO,IAAP;AACD;;AAED,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EACG,QAAQ,IAAI,KAAK,cAAL,EADf,EAEG,KAAK,WAAL,EAFH,CADF;AAMD,GAbD;;AArIO,+BAAc,gBAAd;AAEA,4BAAW,WAAX;AAEA,gCAAe;AACpB,QAAI,EAAE,UADc;AAEpB,eAAW,EAAE,CAFO;AAGpB,SAAK,EAAE,MAHa;AAIpB,MAAE,EAAE,CAJgB;AAKpB,MAAE,EAAE,CALgB;AAMpB,UAAM,EAAE,CAAC,CAAD,EAAI,MAAJ,CANY;AAOpB,eAAW,EAAE,OAPO;AAQpB,YAAQ,EAAE,IARU;AASpB,YAAQ,EAAE,IATU;AAUpB,YAAQ,EAAE,CAVU;AAWpB,QAAI,EAAE,IAXc;AAYpB,QAAI,EAAE,KAZc;AAapB,2BAAuB,EAAE;AAbL,GAAf;AA+IT;AAAC,CApJD,CAA6B,qBAA7B;;AAsJA,qBAAe,cAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC7KA;;AACA;;AACA;;AAcA;AAAwB;;AAAxB;;AA0JC;;AA/IC,iDAAe,MAAf,EAA6B;AACrB;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;AAAA,QAAU,4BAAV;AAEN,QAAI,IAAI,GAAG,EAAX;AAEA,eAAW,CAAC,OAAZ,CAAoB,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC3B,UAAM,KAAK,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,KAAjC,CAAd;;AAEA,UAAI,CAAJ,EAAO;AACL,YAAI,IAAI,OAAK,KAAK,CAAC,CAAX,GAAY,GAAZ,GAAgB,KAAK,CAAC,CAA9B;AACD,OAFD,MAEO;AACL,YAAI,IAAI,OAAK,KAAK,CAAC,CAAX,GAAY,GAAZ,GAAgB,KAAK,CAAC,CAA9B;AACD;AACF,KARD;AASA,QAAI,IAAI,GAAR;AAEA,WAAO,IAAP;AACD,GAjBD;;AAuBA;AACQ;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;AAAA,QAAU,4BAAV;AAAA,QAAuB,4BAAvB;AAAA,QAAoC,4BAApC;;AAEN,QAAI,CAAC,WAAD,IAAgB,CAAC,WAAW,CAAC,MAAjC,EAAyC;AACvC,aAAO,IAAP;AACD;;AACD,QAAM,KAAK;AACT,YAAM,EAAE;AADC,OAEN,oBAAY,KAAK,KAAjB,CAFM,CAAX;;AAKA,WACE;AAAG,eAAS,EAAC;AAAb,OACG,WAAW,CAAC,GAAZ,CAAgB,UAAC,KAAD,EAAQ,CAAR,EAAS;AACxB,UAAM,KAAK,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,KAAtC,CAAd;AACA,UAAM,GAAG,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,KAAtC,CAAZ;AAEA,aACE,sDACM,KADN,EACW;AACT,WAAG,EAAE,UAAQ,CADJ;AAET,UAAE,EAAE,KAAK,CAAC,CAFD;AAGT,UAAE,EAAE,KAAK,CAAC,CAHD;AAIT,UAAE,EAAE,GAAG,CAAC,CAJC;AAKT,UAAE,EAAE,GAAG,CAAC;AALC,OADX,EADF;AAUD,KAdA,CADH,CADF;AAmBD,GA9BD;;AAuCA,yDAAuB,MAAvB,EAAuC,KAAvC,EAAsD,UAAtD,EAA2G;AACnG;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;;AACN,QAAM,KAAK;AACT,YAAM,EAAE;AADC,OAEN,oBAAY,KAAK,KAAjB,CAFM,GAEiB;AAC1B,UAAI,EAAE;AADoB,KAFjB,GAIN,UAJM,CAAX;;AAOA,WACE,wDACM,KADN,EACW;AACT,eAAS,EAAC,uCADD;AAET,SAAG,EAAE,YAAU,KAFN;AAGT,QAAE,EAAE,EAHK;AAIT,QAAE,EAAE,EAJK;AAKT,OAAC,EAAE;AALM,KADX,EADF;AAUD,GAnBD;;AA4BA,0DAAwB,MAAxB,EAAwC,KAAxC,EAAuD,UAAvD,EAA0G;AACxG,QAAM,KAAK;AACT,YAAM,EAAE;AADC,OAEN,oBAAY,KAAK,KAAjB,CAFM,GAEiB;AAC1B,UAAI,EAAE;AADoB,KAFjB,GAIN,UAJM,CAAX;;AAOA,WACE,sDACM,KADN,EACW;AACT,eAAS,EAAC,wCADD;AAET,SAAG,EAAE,UAAQ,KAFJ;AAGT,OAAC,EAAE,KAAK,cAAL,CAAoB,MAApB;AAHM,KADX,EADF;AAQD,GAhBD;;AAuBA;AAAA;;AACQ;AAAA,QAAE,4BAAF;AAAA,QAAe,sBAAf;;AAEN,QAAI,CAAC,WAAD,IAAgB,CAAC,WAAW,CAAC,MAAjC,EAAyC;AACvC,aAAO,IAAP;AACD;;AAED,WACE;AAAG,eAAS,EAAC;AAAb,OACG,WAAW,CAAC,GAAZ,CAAgB,UAAC,KAAD,EAAQ,CAAR,EAAS;AACxB,qBAAQ,KAAK,QAAb,GAAwB,KAAI,CAAC,sBAAL,CAA4B,KAA5B,EAAmC,CAAnC,CAAxB,GAAgE,KAAI,CAAC,uBAAL,CAA6B,KAA7B,EAAoC,CAApC,CAAhE;AAAsG,KADvG,CADH,CADF;AAOD,GAdD;;AAgBA;AACU;;AAER,QAAI,WAAW,IAAI,CAAnB,EAAsB;AACpB,aAAO,IAAP;AACD;;AAED,WACE;AAAG,eAAS,EAAC;AAAb,OACG,KAAK,iBAAL,EADH,EAEG,KAAK,oBAAL,EAFH,CADF;AAMD,GAbD;;AA3IO,0BAAc,WAAd;AAEA,2BAAe;AACpB,MAAE,EAAE,CADgB;AAEpB,MAAE,EAAE,CAFgB;AAGpB,eAAW,EAAE,CAHO;AAIpB,eAAW,EAAE,CAJO;AAKpB,YAAQ,EAAE;AALU,GAAf;AAuJT;AAAC,CA1JD,CAAwB,qBAAxB;;AA4JA,qBAAe,SAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5KA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAkBA;AAA8B;;AAA9B;;AA4JC;;AAjIC,0DAAkB,EAAlB,EAA0C;QAAtB,0B;AACZ;AAAA,QAAE,gBAAF;AAAA,QAAS,UAAT;AAAA,QAAa,UAAb;AAEN,WAAO,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,UAAzB,EAAqC,KAArC,CAAP;AACD,GAJD;;AAMA;AACU;AACR,QAAI,UAAJ;;AAEA,YAAQ,WAAR;AACE,WAAK,MAAL;AACE,kBAAU,GAAG,KAAb;AACA;;AACF,WAAK,OAAL;AACE,kBAAU,GAAG,OAAb;AACA;;AACF;AACE,kBAAU,GAAG,QAAb;AACA;AATJ;;AAYA,WAAO,UAAP;AACD,GAjBD;;AAmBA;AACQ;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;AAAA,QAAU,gBAAV;AAAA,QAAiB,gBAAjB;AACN,QAAM,aAAa,GAAG,oBAAE,KAAF,CAAQ,KAAR,EAAe,UAAC,KAAD,EAAgB;AAAK,kBAAK,CAAC,UAAN;AAAqB,KAAzD,CAAtB;AACA,QAAM,aAAa,GAAG,oBAAE,KAAF,CAAQ,KAAR,EAAe,UAAC,KAAD,EAAgB;AAAK,kBAAK,CAAC,UAAN;AAAqB,KAAzD,CAAtB;AAEA,WAAO;AACL,QAAE,IADG;AAEL,QAAE,IAFG;AAGL,gBAAU,EAAE,KAHP;AAIL,cAAQ,EAAE,KAJL;AAKL,iBAAW,EAAE,aAAa,CAAC,UAAd,IAA4B,CALpC;AAML,iBAAW,EAAE,aAAa,CAAC,UAAd,IAA4B;AANpC,KAAP;AAQD,GAbD;;AAeA;AACE,QAAM,eAAN;AAAA,QAAQ,UAAR;AAAA,QAAY,UAAZ;AAAA,QAAgB,gBAAhB;AAAA,QAAuB,gBAAvB;AAAA,QAA8B,sBAA9B;AAAA,QAAwC,+DAAxC;;AACA,QAAM,MAAM,GAAG,KAAK,CAAC,MAAN,CACb,UAAC,MAAD,EAAS,KAAT,EAAc;AAAK,cAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAAK,CAAC,UAA1B,CAAD,EAAwC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAAK,CAAjE,UAAwC,CAAxC;AAA8E,KADpF,EAEb,CAAC,QAAD,EAAW,CAAC,QAAZ,CAFa,CAAf;AAIA,QAAM,MAAM,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAM,CAAC,CAAD,CAA/B,EAAoC,KAApC,CAAf;AACA,QAAM,MAAM,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAM,CAAC,CAAD,CAA/B,EAAoC,KAApC,CAAf;;AAEA,QAAM,KAAK,2CACN,oBAAY,MAAZ,CADM,GACa;AACtB,UAAI,EAAE;AADgB,KADb,GAGN,oBAAY,QAAZ,CAHM,GAGe;AACxB,QAAE,EAAE,MAAM,CAAC,CADa;AAExB,QAAE,EAAE,MAAM,CAAC,CAFa;AAGxB,QAAE,EAAE,MAAM,CAAC,CAHa;AAIxB,QAAE,EAAE,MAAM,CAAC;AAJa,KAHf,CAAX;;AAUA,WAAO;AAAM,eAAS,EAAC;AAAhB,OAAsD,KAAtD,EAAP;AACD,GApBD;;AAsBO,mCAAP,UAAsB,MAAtB,EAA6C,KAA7C,EAAyD,KAAzD,EAA+E;AAC7E,QAAI,QAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,cAAQ,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAX;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,cAAQ,GAAG,MAAM,CAAC,KAAD,CAAjB;AACD,KAFM,MAEA;AACL,cAAQ,GACN,iCAAC,iBAAD,EAAK,aAAK,KAAL,EAAU;AAAE,iBAAS,EAAC;AAAZ,OAAV,CAAL,EACG,KADH,CADF;AAKD;;AAED,WAAO,QAAP;AACD,GAhBM;;AAkBP;AAAA;;AACE,QAAM,eAAN;AAAA,QAAQ,gBAAR;AAAA,QAAe,cAAf;AAAA,QAAqB,gBAArB;AAAA,QAA4B,gCAA5B;AAAA,QAA2C,kBAA3C;AAAA,QAAmD,0EAAnD;;AACA,QAAM,UAAU,GAAG,KAAK,iBAAL,EAAnB;AACA,QAAM,SAAS,GAAG,oBAAY,MAAZ,CAAlB;AACA,QAAM,eAAe,GAAG,oBAAY,IAAZ,CAAxB;AAEA,QAAM,KAAK,GAAG,KAAK,CAAC,GAAN,CAAU,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC/B,UAAM,KAAK,GAAG,KAAI,CAAC,iBAAL,CAAuB,KAAvB,CAAd;;AACA,UAAM,SAAS;AACb,kBAAU,YADG;AAEb,iBAAS,EAAE,aAAU,KAAK,KAAf,IAAoB,IAApB,GAAyB,KAAK,CAAC,CAA/B,GAAgC,IAAhC,GAAqC,KAAK,CAAC,CAA3C,GAA4C;AAF1C,SAGV,SAHU,GAGD;AACZ,cAAM,EAAE,MADI;AAEZ,YAAI,EAAE;AAFM,OAHC,GAMV,eANU,GAMK;AAClB,aAAK,EAAE;AADW,OANL,GAQV,KARU,GAQL;AACR,eAAO,EAAE;AADD,OARK,CAAf;;AAYA,aACE,iCAAC,kBAAD,EAAM;AACJ,iBAAS,EAAC,iCADN;AAEJ,WAAG,EAAE,UAAQ;AAFT,SAGA,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAHA,CAAN,EAKG,eAAe,CAAC,cAAhB,CAA+B,IAA/B,EAAqC,SAArC,EAAgD,aAAa,GAAG,aAAa,CAAC,KAAK,CAAC,KAAP,EAAc,CAAd,CAAhB,GAAmC,KAAK,CAAC,KAAtG,CALH,CADF;AASD,KAvBa,CAAd;AAyBA,WAAO,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EAAqD,KAArD,CAAP;AACD,GAhCD;;AAkCA;AACQ;AAAA,QAAE,gBAAF;AAAA,QAAS,sBAAT;AAAA,QAAmB,cAAnB;;AAEN,QAAI,CAAC,KAAD,IAAU,CAAC,KAAK,CAAC,MAArB,EAA6B;AAC3B,aAAO,IAAP;AACD;;AAED,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EACG,QAAQ,IAAI,KAAK,cAAL,EADf,EAEG,IAAI,IAAI,KAAK,WAAL,EAFX,EAGG,mBAAM,kBAAN,CAAyB,KAAK,KAA9B,EAAqC,KAAK,UAAL,EAArC,CAHH,CADF;AAOD,GAdD;;AA5IO,gCAAc,iBAAd;AAEA,6BAAW,YAAX;AAEA,iCAAe;AACpB,QAAI,EAAE,QADc;AAEpB,gBAAY,EAAE,CAFM;AAGpB,MAAE,EAAE,CAHgB;AAIpB,MAAE,EAAE,CAJgB;AAKpB,SAAK,EAAE,CALa;AAMpB,eAAW,EAAE,OANO;AAOpB,UAAM,EAAE,MAPY;AAQpB,YAAQ,EAAE,IARU;AASpB,QAAI,EAAE,IATc;AAUpB,aAAS,EAAE,CAVS;AAWpB,UAAM,EAAE,CAAC,CAAD,EAAI,MAAJ,CAXY;AAYpB,qBAAiB,EAAE,KAZC;AAapB,SAAK,EAAE,MAba;AAcpB,2BAAuB,EAAE;AAdL,GAAf;AAuJT;AAAC,CA5JD,CAA8B,qBAA9B;;AA8JA,qBAAe,eAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtLA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAkDA;AAAoB;;AAApB;AAAA;;AAkDE,kBAAe;AAAE,yBAAmB,EAAE;AAAvB,KAAf;;AAWA,0BAAgB,UAAC,MAAD,EAAqB;AACnC,WAAI,CAAC,QAAL,CAAc;AAAE,kBAAU,EAAE;AAAd,OAAd;AACD,KAFD;;AAIA,+BAAqB;AACX;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc;AACf;AACF,KAPD;;AASA,iCAAuB;AACb;;AAER,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,wBAAgB;AACjB;AACF,KARD;;AAUA,6BAAmB,UAAC,CAAD,EAAiC;AAC1C;;AAER,UAAI,YAAJ,EAAkB;AAChB,oBAAY,CAAC,KAAI,CAAC,KAAN,EAAa,CAAb,CAAZ;AACD;AACF,KAND;;AAQA,6BAAmB,UAAC,CAAD,EAAiC;AAC1C;;AAER,UAAI,YAAJ,EAAkB;AAChB,oBAAY,CAAC,KAAI,CAAC,KAAN,EAAa,CAAb,CAAZ;AACD;AACF,KAND;;;AAqJD;;AA5LC,+DAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,kBAAf;;AAEN,QAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AACzC,WAAK,aAAL,CAAmB,MAAnB;AACD;AACF,GAND;;AA+CO,wBAAP,UAAqB,MAArB,EAAuC,KAAvC,EAAiD;AAC/C,QAAI,OAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,MAArB,CAAJ,EAAkC;AAChC,aAAO,GAAG,mBAAM,YAAN,CAAmB,MAAnB,EAA2B,KAA3B,CAAV;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,MAAb,CAAJ,EAA0B;AAC/B,aAAO,GAAG,MAAM,CAAC,KAAD,CAAhB;AACD,KAFM,MAEA;AACL,aAAO,GAAG,iCAAC,gBAAD,EAAI,aAAK,KAAL,EAAU;AAAE,iBAAS,EAAC;AAAZ,OAAV,CAAJ,CAAV;AACD;;AAED,WAAO,OAAP;AACD,GAZM;;AAcP,yCAAW,MAAX,EAA+B;AACvB;AAAA,QAAE,YAAF;AAAA,QAAO,oBAAP;AACN,QAAM,SAAS,GAAG,oBAAY,KAAK,KAAjB,CAAlB;AACA,QAAM,cAAc,GAAG,oBAAY,GAAZ,CAAvB;AAEA,QAAM,IAAI,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC/B,UAAM,QAAQ;AACZ,WAAG,EAAE,SAAO,CADA;AAEZ,SAAC,EAAE;AAFS,SAGT,SAHS,GAIT,cAJS,GAIK;AACjB,eAAO,SADU;AAEjB,UAAE,EAAE,KAAK,CAAC,CAFO;AAGjB,UAAE,EAAE,KAAK,CAAC,CAHO;AAIjB,aAAK,EAAE,CAJU;AAKjB,eAAO,EAAE;AALQ,OAJL,CAAd;;AAYA,aAAO,KAAK,CAAC,aAAN,CAAoB,GAApB,EAAyB,QAAzB,CAAP;AACD,KAdY,CAAb;AAgBA,WAAO,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EAAwC,IAAxC,CAAP;AACD,GAtBD;;AAwBA,sDAAwB,MAAxB,EAA4C;AACpC;AAAA,QAAE,gBAAF;AAAA,QAAS,YAAT;AAEN,QAAI,KAAJ;;AACA,QAAI,mBAAM,cAAN,CAAqB,KAArB,CAAJ,EAAiC;AAC/B,WAAK,GAAG,mBAAM,YAAN,CAAmB,KAAnB,EAA0B,sBAAK,KAAK,KAAV,GAAe;AAAE,cAAM;AAAR,OAAf,CAA1B,CAAR;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,KAAb,CAAJ,EAAyB;AAC9B,WAAK,GAAG,KAAK,uBAAM,KAAK,KAAX,GAAgB;AAAE,cAAM;AAAR,OAAhB,EAAb;AACD,KAFM,MAEA;AACL,WAAK,GACH,iCAAC,oBAAD,EAAQ,aACF,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CADE,EAC2B;AACjC,oBAAY,EAAE,KAAK,gBADc;AAEjC,oBAAY,EAAE,KAAK,gBAFc;AAGjC,cAAM,EAAE;AAHyB,OAD3B,CAAR,CADF;AAQD;;AAED,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EACG,KADH,EAEG,GAAG,GAAG,KAAK,UAAL,CAAgB,MAAhB,CAAH,GAA6B,IAFnC,CADF;AAMD,GAzBD;;AA2BA;AAAA;;AACQ;AAAA,QAAE,kBAAF;AAAA,QAAU,wCAAV;AAAA,QAA6B,kCAA7B;AAAA,QAA6C,wCAA7C;AAAA,QAAgE,oCAAhE;AAAA,QAAiF,4BAAjF;AACE;AAER,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,WAAS,WAPR;AAQN,oBAAc,EAAE,KAAK,kBARf;AASN,sBAAgB,EAAE,KAAK;AATjB,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;AACF,UAAM,oBAAoB,GAAG,UAAU,IAAI,UAAU,CAAC,MAAX,GAAoB,MAAM,CAAC,MAAtE;AACA,UAAM,QAAQ,GAAG,MAAM,CAAC,GAAP,CAAW,UAAC,KAAD,EAAQ,KAAR,EAAa;AACvC,YAAM,IAAI,GAAG,UAAU,IAAI,UAAU,CAAC,IAAI,CAAC,KAAL,CAAW,KAAK,GAAG,oBAAnB,CAAD,CAArC;;AAEA,YAAI,IAAJ,EAAU;AACR,cAAM,eAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AACA,cAAM,eAAa,GAAG,8BAAkB,IAAI,CAAC,CAAvB,EAA0B,KAAK,CAAC,CAAhC,CAAtB;AAEA,uCACK,KADL,GACU;AACR,aAAC,EAAE,eAAa,CAAC,CAAD,CADR;AAER,aAAC,EAAE,eAAa,CAAC,CAAD;AAFR,WADV;AAKD;;AAED,YAAM,aAAa,GAAG,8BAAkB,KAAK,CAAC,EAAxB,EAA4B,KAAK,CAAC,CAAlC,CAAtB;AACA,YAAM,aAAa,GAAG,8BAAkB,KAAK,CAAC,EAAxB,EAA4B,KAAK,CAAC,CAAlC,CAAtB;AAEA,qCACK,KADL,GACU;AACR,WAAC,EAAE,aAAa,CAAC,CAAD,CADR;AAER,WAAC,EAAE,aAAa,CAAC,CAAD;AAFR,SADV;AAKD,OAtBgB,CAAjB;AAwBA,aAAO,KAAI,CAAC,uBAAL,CAA6B,QAA7B,CAAP;AACD,KAtCH,CADF;AA0CD,GA9CD;;AAgDA;AACQ;AAAA,QAAE,kBAAF;AAAA,QAAU,wCAAV;AACE;;AAER,QAAI,iBAAiB,IAAI,MAArB,IAA+B,MAAM,CAAC,MAAtC,KAAiD,CAAC,UAAD,IAAe,CAAC,oBAAE,OAAF,CAAU,UAAV,EAAsB,MAAtB,CAAjE,CAAJ,EAAqG;AACnG,aAAO,KAAK,0BAAL,EAAP;AACD;;AAED,WAAO,KAAK,uBAAL,CAA6B,MAA7B,CAAP;AACD,GATD;;AAWA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,wBAAR;AAAA,QAAmB,kBAAnB;AAAA,QAA2B,wCAA3B;;AAEN,QAAI,IAAI,IAAI,CAAC,MAAT,IAAmB,CAAC,MAAM,CAAC,MAA/B,EAAuC;AACrC,aAAO,IAAP;AACD;;AAEO;AACR,QAAM,UAAU,GAAG,wBAAW,gBAAX,EAA6B,SAA7B,CAAnB;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,KAAK,aAAL,EADH,EAEG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KAA+C,uBAAU,kBAAV,CAA6B,KAAK,KAAlC,EAAyC,MAAzC,CAFlD,CADF;AAMD,GAhBD;;AA/NO,sBAAc,OAAd;AAEA,uBAAe;AACpB,eAAW,EAAE,CADO;AAEpB,gBAAY,EAAE,CAFM;AAGpB,QAAI,EAAE,KAHc;AAIpB,aAAS,EAAE,IAJS;AAKpB,OAAG,EAAE,KALe;AAMpB,cAAU,EAAE,MANQ;AAOpB,qBAAiB,EAAE,CAAC,oBAAO,KAPP;AAQpB,kBAAc,EAAE,CARI;AASpB,qBAAiB,EAAE,IATC;AAUpB,mBAAe,EAAE;AAVG,GAAf;;AAaA,0BAAkB,UAAC,EAAD,EAYxB;QAXC,0B;QACA,wB;QACA,gC;QACA,oB;QACA,sB;AAQQ;AAAA,QAAI,iBAAJ;AACR,QAAM,MAAM,GAAG,aAAa,CAAC,GAAd,CAAkB,UAAC,KAAD,EAAQ,CAAR,EAAS;AACxC,UAAM,IAAI,GAAG,+BAAkB,KAAlB,EAAyB,SAAS,CAAC,OAAnC,EAA4C,CAA5C,CAAb;AACA,UAAM,KAAK,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,EAAkC,CAAlC,CAAd;AACA,UAAM,KAAK,GAAG,SAAS,CAAC,KAAV,CAAgB,IAAhB,KAAyB,QAAQ,IAAI,CAArC,CAAd;AACA,UAAM,MAAM,GAAG,UAAU,CAAC,KAAX,CAAiB,KAAjB,CAAf;AACA,mCACK,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,KAAjC,CADL,GAC4C;AAC1C,YAAI,MADsC;AAE1C,aAAK,OAFqC;AAG1C,UAAE,IAHwC;AAI1C,UAAE,IAJwC;AAK1C,cAAM,QALoC;AAM1C,aAAK,OANqC;AAO1C,eAAO,EAAE;AAPiC,OAD5C;AAUD,KAfc,CAAf;AAiBA,WAAO;AAAE,YAAM;AAAR,KAAP;AACD,GAhCM;;AAiOT;AAAC,CAjPD,CAAoB,qBAApB;;AAmPA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACjTA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAOA;;AA0DA;AAAwB;;AAAxB;AAAA;;AAwIE,kBAAe;AACb,yBAAmB,EAAE;AADR,KAAf;;AAqBA,0BAAgB,UAAC,IAAD,EAA0B;AACxC,WAAI,CAAC,QAAL,CAAc;AAAE,gBAAQ,EAAE;AAAZ,OAAd;AACD,KAFD;;AAIA,+BAAqB;AACX;;AACR,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc;AACf;AACF,KAPD;;AASA,iCAAuB;AACb;;AAER,WAAI,CAAC,QAAL,CAAc;AAAE,2BAAmB,EAAE;AAAvB,OAAd;;AAEA,UAAI,oBAAE,UAAF,CAAa,gBAAb,CAAJ,EAAoC;AAClC,wBAAgB;AACjB;AACF,KARD;;;AAwJD;;AArLC,mEAAiC,SAAjC,EAAiD;AACzC;AAAA,QAAE,4BAAF;AAAA,QAAe,cAAf;;AAEN,QAAI,SAAS,CAAC,WAAV,KAA0B,WAA9B,EAA2C;AACzC,WAAK,aAAL,CAAmB,IAAnB;AACD;AACF,GAND;;AAQA;AACQ;AAAA,QAAE,0BAAF;AAAA,QAAc,sBAAd;AACN,QAAM,IAAI,GAAG,qBAAS,QAAQ,GAAG,UAApB,CAAb;AACA,QAAM,UAAU,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,QAAQ,GAAG,UAApB,CAAT,EAA0C,GAA1C,CAAnB;AAEA,WAAO,IAAI,GAAG,UAAd;AACD,GAND;;AA+BO,gCAAP,UAAyB,KAAzB,EAAqD,KAArD,EAA+D;AAC7D,QAAI,WAAJ;;AAEA,QAAI,mBAAM,cAAN,CAAqB,KAArB,CAAJ,EAAiC;AAC/B,iBAAW,GAAG,mBAAM,YAAN,CAAmB,KAAnB,EAA0B,KAA1B,CAAd;AACD,KAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,KAAb,CAAJ,EAAyB;AAC9B,iBAAW,GAAG,KAAK,CAAC,KAAD,CAAnB;AACD,KAFM,MAEA;AACL,iBAAW,GAAG,mBAAM,aAAN,CAAoB,mBAApB,EAA4B,KAA5B,CAAd;AACD;;AAED,WAAO,WAAP;AACD,GAZM;;AAcP,0DAAwB,OAAxB,EAA8C;AAA9C;;AACE,QAAM,eAAN;AAAA,QAAQ,gBAAR;AAAA,QAAe,4BAAf;AAAA,QAA4B,4BAA5B;AAAA,QAAyC,8BAAzC;AAAA,QAAuD,4EAAvD;;AACA,QAAM,SAAS,GAAG,oBAAY,MAAZ,CAAlB;AAEA,WAAO,OAAO,CAAC,GAAR,CAAY,UAAC,KAAD,EAAQ,CAAR,EAAS;AAC1B,UAAM,KAAK,oDACN,SADM,GACG;AACZ,oBAAY;AADA,OADH,GAGN,KAHM,GAIN,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CAJM,GAIkC;AAC3C,WAAG,EAAE,YAAU,CAD4B;AAE3C,iBAAS,EAAE,4BAFgC;AAG3C,yBAAiB,EAAE,MAAM,CAAC,iBAHiB;AAI3C,wBAAgB,EAAE,MAAM,CAAC;AAJkB,OAJlC,CAAX;;AAWA,aAAO,SAAS,CAAC,iBAAV,CAA4B,CAAC,KAAK,WAAN,GAAoB,WAApB,GAAkC,KAA9D,EAAqE,KAArE,CAAP;AACD,KAbM,CAAP;AAcD,GAlBD;;AAoBA;AAAA;;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,wCAAR;AAAA,QAA2B,kCAA3B;AAAA,QAA2C,wCAA3C;AAAA,QAA8D,oCAA9D;AAAA,QAA+E,4BAA/E;AACE;AAER,WACE,iCAAC,yBAAD,EAAQ;AACN,WAAK,EAAE,cADD;AAEN,cAAQ,EAAE,iBAFJ;AAGN,cAAQ,EAAE,iBAHJ;AAIN,YAAM,EAAE,eAJF;AAKN,UAAI,EAAE;AAAE,SAAC,EAAE;AAAL,OALA;AAMN,QAAE,EAAE;AAAE,SAAC,EAAE;AAAL,OANE;AAON,SAAG,EAAE,eAAa,WAPZ;AAQN,sBAAgB,EAAE,KAAK,oBARjB;AASN,oBAAc,EAAE,KAAK;AATf,KAAR,EAWG,UAAC,EAAD,EAAqB;UAAlB,Q;AACF,UAAM,QAAQ,GAAG,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAQ,KAAR,EAAa;AACrC,YAAM,IAAI,GAAG,QAAQ,IAAI,QAAQ,CAAC,KAAD,CAAjC;;AAEA,YAAI,IAAJ,EAAU;AACR,cAAM,sBAAsB,GAAG,8BAAkB,IAAI,CAAC,UAAvB,EAAmC,KAAK,CAAC,UAAzC,CAA/B;AACA,cAAM,oBAAoB,GAAG,8BAAkB,IAAI,CAAC,QAAvB,EAAiC,KAAK,CAAC,QAAvC,CAA7B;AAEA,uCACK,KADL,GACU;AACR,sBAAU,EAAE,sBAAsB,CAAC,CAAD,CAD1B;AAER,oBAAQ,EAAE,oBAAoB,CAAC,CAAD;AAFtB,WADV;AAKD;;AACO;AAAA,YAAU,6BAAV;AACR,YAAM,YAAY,GAAG,8BAAkB,UAAlB,EAA8B,QAA9B,CAArB;AAEA,qCAAY,KAAZ,GAAiB;AAAE,kBAAQ,EAAE,YAAY,CAAC,CAAD;AAAxB,SAAjB;AACD,OAjBgB,CAAjB;AAmBA,aAAO,iCAAC,kBAAD,EAAM,IAAN,EAAQ,KAAI,CAAC,uBAAL,CAA6B,QAA7B,CAAR,CAAP;AACD,KAhCH,CADF;AAoCD,GAxCD;;AA0CA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,wCAAR;AACE;;AAER,QAAI,iBAAiB,IAAI,IAArB,IAA6B,IAAI,CAAC,MAAlC,KAA6C,CAAC,QAAD,IAAa,CAAC,oBAAE,OAAF,CAAU,QAAV,EAAoB,IAApB,CAA3D,CAAJ,EAA2F;AACzF,aAAO,KAAK,0BAAL,EAAP;AACD;;AAED,WAAO,KAAK,uBAAL,CAA6B,IAA7B,CAAP;AACD,GATD;;AAWA,mDAAiB,OAAjB,EAA8C;AAA9C;;AACU;AACR,QAAM,eAAe,GAAG,oBAAY,KAAK,KAAL,CAAW,UAAvB,CAAxB;AAEA,WAAO,OAAO,CAAC,GAAR,CAAY,UAAC,KAAD,EAAQ,CAAR,EAAS;AAElB;AAAA,UAAO,6BAAP;AAAA,UAAmB,6CAAnB;;AAER,UAAI,CAAC,UAAL,EAAiB;AACf,eAAO,IAAP;AACD;;AAED,UAAM,KAAK;AACT,oBAAY;AADH,SAEN,IAFM,GAEF;AACP,YAAI,EAAE;AADC,OAFE,GAIN,UAJM,GAKN,eALM,GAMN,2BAAmB,KAAI,CAAC,KAAxB,EAA+B,KAA/B,EAAsC,CAAtC,CANM,GAMkC;AAC3C,aAAK,EAAE,CADoC;AAE3C,WAAG,EAAE,YAAU,CAF4B;AAG3C,iBAAS,EAAE;AAHgC,OANlC,CAAX;;AAYA,aAAO,SAAS,CAAC,iBAAV,CAA4B,UAA5B,EAAwC,KAAxC,CAAP;AACD,KArBM,CAAP;AAsBD,GA1BD;;AA4BA;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,cAAR;AAAA,QAAc,wBAAd;AAAA,QAAyB,0BAAzB;AAAA,QAAqC,wCAArC;;AAEN,QAAI,IAAI,IAAI,CAAC,IAAT,IAAiB,CAAC,IAAI,CAAC,MAA3B,EAAmC;AACjC,aAAO,IAAP;AACD;;AAEO;AACR,QAAM,UAAU,GAAG,wBAAW,eAAX,EAA4B,SAA5B,CAAnB;AAEA,WACE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAE;AAAZ,KAAN,EACG,UAAU,IAAI,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EAAmD,KAAK,gBAAL,CAAsB,IAAtB,CAAnD,CADjB,EAGE,iCAAC,kBAAD,EAAM;AAAC,eAAS,EAAC;AAAX,KAAN,EAAgD,KAAK,aAAL,EAAhD,CAHF,EAKG,CAAC,CAAC,iBAAD,IAAsB,mBAAvB,KACC,uBAAU,kBAAV,CAA4B,sBAErB,KAAK,KAFgB,GAEX;AACb,eAAS,EAAE,KAAK,aAAL,KAAuB;AADrB,KAFW,CAA5B,EAKE,IALF,CANJ,CADF;AAgBD,GA1BD;;AAtSO,0BAAc,WAAd;AAEA,2BAAe;AACpB,eAAW,EAAE,CADO;AAEpB,gBAAY,EAAE,CAFM;AAGpB,gBAAY,EAAE,CAHM;AAIpB,QAAI,EAAE,KAJc;AAKpB,cAAU,EAAE,MALQ;AAMpB,QAAI,EAAE,EANc;AAOpB,qBAAiB,EAAE,CAAC,oBAAO,KAPP;AAQpB,kBAAc,EAAE,CARI;AASpB,qBAAiB,EAAE,IATC;AAUpB,mBAAe,EAAE,MAVG;AAWpB,qBAAiB,EAAE,KAXC;AAYpB,oBAAgB,EAAE;AAZE,GAAf;;AAeA,8BAAkB,UAAC,EAAD,EA0BxB;QAzBC,c;QACA,gB;QACA,0B;QACA,oC;QACA,wB;QACA,kC;QACA,gC;QACA,oB;QACA,4B;QACA,4B;QACA,sB;QACA,kC;AAeA,QAAM,GAAG,GAAG,+BAAkB,WAAlB,EAA+B,IAA/B,CAAZ;;AACA,QAAI,CAAC,GAAL,EAAU;AACR,aAAO,IAAP;AACD;;AAEO;AAAA,QAAI,iBAAJ;AACA;AACF;AAAA,QAAE,sBAAF;AAAA,QAAY,8BAAZ;AACN,QAAM,WAAW,GAAG,MAAM,KAAK,QAAX,GAAsB,SAAtB,GAAkC,UAAtD;AACA,QAAM,aAAa,GAAG,WAAW,GAAG,WAAW,CAAC,KAAZ,CAAkB,MAAlB,EAAH,GAAgC,IAAjE;AACA,QAAM,SAAS,GAAG,+BAAkB;AAAE,iBAAW;AAAb,KAAlB,CAAlB;AACA,QAAM,KAAK,GAAG,2BAAc,QAAd,EAAwB,kBAAK,WAA7B,CAAd;AACA,QAAM,OAAO,GAAG,aAAa,CAAC,GAAd,CAAkB,UAAC,KAAD,EAAa,KAAb,EAA0B;AAC1D,UAAI,KAAJ,EAAW,WAAX,EAAwB,WAAxB,EAAqC,UAArC,EAAiD,QAAjD,EAA2D,gBAA3D;;AAEA,UAAI,WAAJ,EAAiB;AACf,aAAK,GAAG,8BAAiB,WAAW,CAAC,cAAc,GAAG,KAAlB,CAA5B,EAAsD,aAAtD,CAAR;AACD,OAFD,MAEO;AACL,aAAK,GAAG,+BAAkB,KAAlB,EAAyB,OAAzB,CAAR;;AACA,YAAI,CAAC,oBAAE,OAAF,CAAU,KAAV,CAAL,EAAuB;AACrB,eAAK,GAAG,CAAC,SAAD,EAAY,KAAZ,CAAR;AACD;AACF;;AAED,UAAI,MAAM,KAAK,QAAf,EAAyB;AACvB,mBAAW,GAAG,oCAAuB;AACnC,cAAI,EAAE,UAD6B;AAEnC,eAAK,EAAE,eAF4B;AAGnC,kBAAQ,UAH2B;AAInC,gBAAM,EAAE,GAAG,CAAC,MAJuB;AAKnC,eAAK,OAL8B;AAMnC,eAAK;AAN8B,SAAvB,CAAd;AAQA,gBAAQ,GAAG,SAAS,CAAC,KAAV,CAAgB,KAAK,CAAC,CAAD,CAArB,CAAX;AACA,kBAAU,GAAG,SAAS,CAAC,KAAV,CAAgB,KAAK,CAAC,CAAD,CAArB,CAAb;AACA,mBAAW,GAAG,WAAW,GAAG,GAAG,CAAC,IAAhC;AACA,YAAM,UAAU,GAAG,QAAQ,GAAG,UAA9B;;AAEA,YAAI,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,CAAzB,IAA8B,IAAI,CAAC,GAAL,CAAS,UAAT,IAAuB,IAAI,CAAC,GAAL,CAAS,YAAT,CAAzD,EAAiF;AAC/E,cAAM,KAAK,GAAG,qBAAS,UAAU,IAAI,YAAvB,KAAwC,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,IAAI,CAAC,GAAL,CAAS,UAAT,CAAjE,CAAd;AAEA,kBAAQ,IAAI,KAAZ;AACD;;AACD,wBAAgB,GAAG;AACjB,oBAAU,EAAE;AACV,cAAE,IADQ;AAEV,cAAE,IAFQ;AAGV,uBAAW,aAHD;AAIV,uBAAW,aAJD;AAKV,sBAAU,EAAE,KAAK,CAAC,UALR;AAMV,oBAAQ,EAAE,KAAK,CAAC;AANN;AADK,SAAnB;AAUD,OA7BD,MA6BO;AACL,mBAAW,GAAG,UAAU,CAAC,KAAX,CAAiB,KAAK,CAAC,CAAD,CAAtB,CAAd;AACA,mBAAW,GAAG,UAAU,CAAC,KAAX,CAAiB,KAAK,CAAC,CAAD,CAAtB,CAAd;AACA,kBAAU,GAAG,oCAAuB;AAClC,cAAI,EAAE,SAD4B;AAElC,eAAK,EAAE,cAF2B;AAGlC,kBAAQ,UAH0B;AAIlC,gBAAM,EAAE,GAAG,CAAC,MAJsB;AAKlC,eAAK,OAL6B;AAMlC,eAAK;AAN6B,SAAvB,CAAb;AAQA,gBAAQ,GAAG,UAAU,GAAG,GAAG,CAAC,IAA5B;AACA,YAAM,WAAW,GAAG,WAAW,GAAG,WAAlC;;AAEA,YAAI,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,CAAzB,IAA8B,IAAI,CAAC,GAAL,CAAS,WAAT,IAAwB,IAAI,CAAC,GAAL,CAAS,YAAT,CAA1D,EAAkF;AAChF,cAAM,KAAK,GAAG,qBAAS,WAAW,IAAI,YAAxB,KAAyC,IAAI,CAAC,GAAL,CAAS,YAAT,IAAyB,IAAI,CAAC,GAAL,CAAS,WAAT,CAAlE,CAAd;AACA,qBAAW,IAAI,KAAf;AACD;AACF;;AAED,qDACK,KADL,GAEK,gBAFL,GAEqB;AACnB,eAAO,EAAE,KADU;AAEnB,aAAK,EAAE,WAAW,GAAG,KAAH,GAAW,KAAK,CAAC,CAAD,CAFf;AAGnB,UAAE,IAHiB;AAInB,UAAE,IAJiB;AAKnB,mBAAW,aALQ;AAMnB,mBAAW,aANQ;AAOnB,kBAAU,YAPS;AAQnB,gBAAQ;AARW,OAFrB,GAWM,KAAK,IAAI,KAAK,CAAC,KAAD,CAAd,IAAyB,KAAK,CAAC,KAAD,CAAL,CAAa,KAX5C;AAaD,KA1Ee,CAAhB;AA4EA,WAAO;AAAE,UAAI,EAAE,OAAR;AAAiB,YAAM;AAAvB,KAAP;AACD,GApHM;;AAgTT;AAAC,CAlUD,CAAwB,qBAAxB;;AAoUA,qBAAe,SAAf,C;;;;;;;;;;;;;;;;;;ACnZA;;AACA;;AAEA,IAAM,UAAU,GAAG,EAAnB;;AAEA,IAAI,EAAE,MAAM,CAAC,cAAP,IAAyB,UAAU,CAAC,SAAtC,CAAJ,EAAsD;AACpD,MAAM,sBAAoB,GAAG,MAAM,CAAC,cAApC;;AAEA,QAAM,CAAC,cAAP,GAAwB,kBAAM;AAC5B,QAAI,MAAM,CAAC,SAAX,EAAsB;AACpB,aAAO,MAAM,CAAC,SAAd;AACD;;AAED,WAAO,sBAAoB,CAAC,IAArB,CAA0B,MAA1B,EAAkC,MAAlC,CAAP;AACD,GAND;AAOD,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACZD;;AACA;;AACA;;AACA;;AAcA;AAAoB;;AAApB;;AA6BC;;AAnBQ,kBAAP,UAAe,CAAf,EAA0B,CAA1B,EAAqC,KAArC,EAAoD,MAApD,EAAoE,GAApE,EAAiF,IAAjF,EAA6F;AAC3F,WAAO,MAAI,CAAJ,GAAK,GAAL,GAAS,GAAT,GAAY,GAAZ,GAAgB,MAAhB,GAAsB,GAAtB,GAA0B,IAA1B,GAA8B,GAA9B,GAAkC,CAAlC,GAAmC,GAAnC,GAAuC,KAA9C;AACD,GAFM;;AAIP;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,YAAvB;AAAA,QAA4B,cAA5B;AAAA,QAAkC,wBAAlC;;AAEN,QAAI,CAAC,qBAAS,CAAT,CAAD,IAAgB,CAAC,qBAAS,CAAT,CAAjB,IAAgC,CAAC,qBAAS,KAAT,CAAjC,IAAoD,CAAC,qBAAS,MAAT,CAArD,IAAyE,CAAC,qBAAS,GAAT,CAA1E,IAA2F,CAAC,qBAAS,IAAT,CAAhG,EAAgH;AAC9G,aAAO,IAAP;AACD;;AAED,WACE,sDACM,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CADN,EACmC;AACjC,eAAS,EAAE,wBAAW,gBAAX,EAA6B,SAA7B,CADsB;AAEjC,OAAC,EAAE,KAAK,CAAC,OAAN,CAAc,CAAd,EAAiB,CAAjB,EAAoB,KAApB,EAA2B,MAA3B,EAAmC,GAAnC,EAAwC,IAAxC;AAF8B,KADnC,EADF;AAOD,GAdD;;AAbO,uBAAe;AACpB,KAAC,EAAE,CADiB;AAEpB,KAAC,EAAE,CAFiB;AAGpB,OAAG,EAAE,CAHe;AAIpB,QAAI,EAAE,CAJc;AAKpB,SAAK,EAAE,CALa;AAMpB,UAAM,EAAE;AANY,GAAf;AA4BT;AAAC,CA7BD,CAAoB,qBAApB;;AA+BA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AChDA;;AACA;;AAgBA;;AACA;;AACA;;AACA;;AAMA,IAAM,eAAe,GAAmB;AACtC,kBAAgB,6BADsB;AAEtC,gBAAc,2BAFwB;AAGtC,YAAU,uBAH4B;AAItC,mBAAiB,8BAJqB;AAKtC,aAAW,wBAL2B;AAMtC,gBAAc,2BANwB;AAOtC,gBAAc,2BAPwB;AAQtC,cAAY,yBAR0B;AAStC,WAAS,sBAT6B;AAUtC,gBAAc,2BAVwB;AAWtC,iBAAe;AAXuB,CAAxC;;AAkCA,IAAM,OAAO,GAAG,SAAV,OAAU,CAAC,CAAD,EAAS;AAAK,UAAC,CAAC,CAAF,KAAQ,CAAC,CAAC,CAAC,CAAX,IAAgB,CAAC,CAAC,CAAF,KAAQ,CAAC,CAAC,CAA1B;AAA4B,CAA1D;;AACA,IAAM,IAAI,GAAG,SAAP,IAAO,CAAC,CAAD,EAAS;AAAK,UAAC,CAAD;AAAG,CAA9B;;AACA,IAAM,IAAI,GAAG,SAAP,IAAO,CAAC,CAAD,EAAS;AAAK,UAAC,CAAD;AAAG,CAA9B;;AAEA,IAAM,eAAe,GAAG,SAAlB,eAAkB,CAAC,IAAD,EAAkB,MAAlB,EAAoC;AAC1D,MAAI,oBAAE,UAAF,CAAa,IAAb,CAAJ,EAAwB;AACtB,WAAO,IAAP;AACD;;AAED,MAAM,IAAI,GAAG,UAAQ,oBAAE,UAAF,CAAa,IAAb,CAArB;;AAEA,MAAI,IAAI,KAAK,eAAT,IAA4B,MAAhC,EAAwC;AACtC,WAAO,eAAe,CAAC,KAAG,IAAH,IAAU,MAAM,KAAK,UAAX,GAAwB,GAAxB,GAA8B,GAAxC,CAAD,CAAtB;AACD;;AACD,SAAO,eAAe,CAAC,IAAD,CAAf,IAAyB,sBAAhC;AACD,CAXD;;AA0BA;AAAoB;;AAApB;;AA2EC;;AAhEC;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,kBAAR;AAAA,QAAgB,sBAAhB;AAAA,QAA0B,kBAA1B;AAAA,QAAkC,8BAAlC;AACN,QAAM,YAAY,GAAG,eAAe,CAAC,IAAD,EAAO,MAAP,CAApC;AACA,QAAM,YAAY,GAAG,YAAY,GAAG,MAAM,CAAC,MAAP,CAAc,iBAAK;AAAI,oBAAO,CAAP,KAAO,CAAP;AAAc,KAArC,CAAH,GAA4C,MAA7E;AACA,QAAI,YAAJ;;AAEA,QAAI,oBAAE,OAAF,CAAU,QAAV,CAAJ,EAAyB;AACvB,UAAM,gBAAc,GAAG,YAAY,GAAG,QAAQ,CAAC,MAAT,CAAgB,gBAAI;AAAI,sBAAO,CAAP,IAAO,CAAP;AAAa,OAArC,CAAH,GAA4C,QAA/E;AACA,UAAM,UAAU,GAAG,YAAY,CAAC,GAAb,CAAiB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAAK,qCAAM,KAAN,GAAW;AAAE,cAAI,EAAE,gBAAc,CAAjC,KAAiC;AAAtB,SAAX;AAA2C,OAA9E,CAAnB;;AACA,UAAI,MAAM,KAAK,UAAf,EAA2B;AACzB,oBAAY,GAAG,kBACZ,CADY,CACV,IADU,EAEZ,EAFY,CAET,IAFS,EAGZ,EAHY,CAGT,aAAC;AAAI,kBAAC,CAAC,IAAF;AAAQ,SAHJ,CAAf;AAID,OALD,MAKO;AACL,oBAAY,GAAG,kBACZ,CADY,CACV,IADU,EAEZ,EAFY,CAET,IAFS,EAGZ,EAHY,CAGT,aAAC;AAAI,kBAAC,CAAC,IAAF;AAAQ,SAHJ,CAAf;AAID;;AACD,kBAAY,CAAC,OAAb,CAAqB,OAArB,EAA8B,KAA9B,CAAoC,YAApC;AAEA,aAAO,YAAY,CAAC,UAAD,CAAnB;AACD;;AACD,QAAI,MAAM,KAAK,UAAX,IAAyB,qBAAS,QAAT,CAA7B,EAAiD;AAC/C,kBAAY,GAAG,kBACZ,CADY,CACV,IADU,EAEZ,EAFY,CAET,IAFS,EAGZ,EAHY,CAGT,QAHS,CAAf;AAID,KALD,MAKO,IAAI,qBAAS,QAAT,CAAJ,EAAwB;AAC7B,kBAAY,GAAG,kBACZ,CADY,CACV,IADU,EAEZ,EAFY,CAET,IAFS,EAGZ,EAHY,CAGT,QAHS,CAAf;AAID,KALM,MAKA;AACL,kBAAY,GAAG,kBACZ,CADY,CACV,IADU,EAEZ,CAFY,CAEV,IAFU,CAAf;AAGD;;AAED,gBAAY,CAAC,OAAb,CAAqB,OAArB,EAA8B,KAA9B,CAAoC,YAApC;AAEA,WAAO,YAAY,CAAC,YAAD,CAAnB;AACD,GA3CD;;AA6CA;AACQ;AAAA,QAAE,wBAAF;AAAA,QAAa,kBAAb;AAAA,QAAqB,cAArB;AAAA,QAA2B,oBAA3B;;AAEN,QAAI,CAAC,CAAC,MAAD,IAAW,CAAC,MAAM,CAAC,MAApB,KAA+B,CAAC,IAApC,EAA0C;AACxC,aAAO,IAAP;AACD;;AAED,QAAM,QAAQ,GAAG,MAAM,IAAI,MAAM,CAAC,MAAjB,GAA0B,KAAK,OAAL,EAA1B,GAA2C,IAA5D;AAEA,WACE,sDACM,oBAAY,KAAK,KAAjB,CADN,EAEM,2BAAmB,KAAK,KAAxB,CAFN,EAEoC;AAClC,eAAS,EAAE,wBAAW,gBAAX,EAA6B,SAA7B,CADuB;AAElC,OAAC,EAAE,QAF+B;AAGlC,SAAG,EAAE;AAH6B,KAFpC,EADF;AASD,GAlBD;;AAvDO,uBAAe;AACpB,QAAI,EAAE,QADc;AAEpB,UAAM,EAAE,EAFY;AAGpB,gBAAY,EAAE;AAHM,GAAf;AA0ET;AAAC,CA3ED,CAAoB,qBAApB;;AA6EA,qBAAe,KAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvKA;;AACA;;AACA;;AAWA;AAAkB;;AAAlB;;AAoBC;;AAnBC;AACQ;AAAA,QAAE,UAAF;AAAA,QAAM,UAAN;AAAA,QAAU,QAAV;AAAA,QAAa,wBAAb;AACN,QAAM,UAAU,GAAG,wBAAW,cAAX,EAA2B,SAA3B,CAAnB;;AAEA,QAAI,EAAE,KAAK,CAAC,EAAR,IAAc,EAAE,KAAK,CAAC,EAAtB,IAA4B,CAAC,KAAK,CAAC,CAAvC,EAA0C;AACxC,aACE,wDACM,oBAAY,KAAK,KAAjB,CADN,EAEM,2BAAmB,KAAK,KAAxB,CAFN,EAEoC;AAClC,iBAAS,EAAE,UADuB;AAElC,UAAE,EAAE,EAF8B;AAGlC,UAAE,EAAE,EAH8B;AAIlC,SAAC,EAAE;AAJ+B,OAFpC,EADF;AAUD;;AAED,WAAO,IAAP;AACD,GAlBD;;AAmBF;AAAC,CApBD,CAAkB,qBAAlB;;AAsBA,qBAAe,GAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnCA;;AACA;;AACA;;AAEA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,MAAD,EAA0B;AACjD,eAAM,CACH,MADH,CACU,UAAC,MAAD,EAAS,KAAT,EAAc;AACpB,QAAI,KAAK,CAAC,CAAN,KAAY,CAAC,KAAK,CAAC,CAAnB,IAAwB,KAAK,CAAC,CAAN,KAAY,CAAC,KAAK,CAAC,CAA/C,EAAkD;AAChD,YAAM,CAAC,IAAP,CAAY,CAAC,KAAK,CAAC,CAAP,EAAU,KAAK,CAAC,CAAhB,CAAZ;AACD;;AAED,WAAO,MAAP;AACD,GAPH,EAOK,EAPL,EAQG,IARH,CAQQ,GARR;AAQY,CATd;;AAkBA;AAAsB;;AAAtB;;AAYC;;AAXC;AACQ;AAAA,QAAE,kBAAF;AAAA,QAAU,wBAAV;;AAEN,QAAI,CAAC,MAAD,IAAW,CAAC,MAAM,CAAC,MAAvB,EAA+B;AAC7B,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,kBAAX,EAA+B,SAA/B,CAAnB;AAEA,WAAO,yDAAa,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CAAb,EAA0C;AAAE,eAAS,EAAE,UAAb;AAAyB,YAAM,EAAE,gBAAgB,CAAC,MAAD;AAAjD,KAA1C,EAAP;AACD,GAVD;;AAWF;AAAC,CAZD,CAAsB,qBAAtB;;AAcA,qBAAe,OAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpCA;;AACA;;AACA;;AACA;;AAIA,IAAM,eAAe,GAAG,SAAlB,eAAkB,CAAC,CAAD,EAAY,CAAZ,EAAuB,KAAvB,EAAsC,MAAtC,EAAsD,MAAtD,EAAiF;AACvG,MAAM,SAAS,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,KAAT,IAAkB,CAA3B,EAA8B,IAAI,CAAC,GAAL,CAAS,MAAT,IAAmB,CAAjD,CAAlB;AACA,MAAM,KAAK,GAAG,MAAM,IAAI,CAAV,GAAc,CAAd,GAAkB,CAAC,CAAjC;AACA,MAAM,KAAK,GAAG,KAAK,IAAI,CAAT,GAAa,CAAb,GAAiB,CAAC,CAAhC;AACA,MAAM,SAAS,GAAI,MAAM,IAAI,CAAV,IAAe,KAAK,IAAI,CAAzB,IAAgC,MAAM,GAAG,CAAT,IAAc,KAAK,GAAG,CAAtD,GAA2D,CAA3D,GAA+D,CAAjF;AACA,MAAI,IAAJ;;AAEA,MAAI,SAAS,GAAG,CAAZ,IAAiB,MAAM,YAAY,KAAvC,EAA8C;AAC5C,QAAM,SAAS,GAAe,CAAC,CAAD,EAAI,CAAJ,EAAO,CAAP,EAAU,CAAV,CAA9B;;AACA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,CAAtB,EAAyB,CAAC,GAAG,GAA7B,EAAkC,CAAC,EAAnC,EAAuC;AACrC,eAAS,CAAC,CAAD,CAAT,GAAe,MAAM,CAAC,CAAD,CAAN,GAAY,SAAZ,GAAwB,SAAxB,GAAoC,MAAM,CAAC,CAAD,CAAzD;AACD;;AAED,QAAI,GAAG,MAAI,CAAJ,GAAK,GAAL,IAAS,CAAC,GAAG,KAAK,GAAG,SAAS,CAAC,CAAD,CAA9B,CAAP;;AAEA,QAAI,SAAS,CAAC,CAAD,CAAT,GAAe,CAAnB,EAAsB;AACpB,UAAI,IAAI,OAAK,SAAS,CAAC,CAAD,CAAd,GAAiB,GAAjB,GAAqB,SAAS,CAAC,CAAD,CAA9B,GAAiC,OAAjC,GAAyC,SAAzC,GAAkD,GAAlD,IAAsD,CAAC,GAAG,KAAK,GAAG,SAAS,CAAC,CAAD,CAA3E,IAA8E,GAA9E,GAAkF,CAA1F;AACD;;AAED,QAAI,IAAI,QAAK,CAAC,GAAG,KAAJ,GAAY,KAAK,GAAG,SAAS,CAAC,CAAD,CAAlC,IAAqC,GAArC,GAAyC,CAAjD;;AAEA,QAAI,SAAS,CAAC,CAAD,CAAT,GAAe,CAAnB,EAAsB;AACpB,UAAI,IAAI,OAAK,SAAS,CAAC,CAAD,CAAd,GAAiB,GAAjB,GAAqB,SAAS,CAAC,CAAD,CAA9B,GAAiC,OAAjC,GAAyC,SAAzC,GAAkD,aAAlD,IACJ,CAAC,GAAG,KADA,IACK,GADL,IACS,CAAC,GAAG,KAAK,GAAG,SAAS,CAAC,CAAD,CAD9B,CAAR;AAED;;AACD,QAAI,IAAI,QAAK,CAAC,GAAG,KAAT,IAAc,GAAd,IAAkB,CAAC,GAAG,MAAJ,GAAa,KAAK,GAAG,SAAS,CAAC,CAAD,CAAhD,CAAR;;AAEA,QAAI,SAAS,CAAC,CAAD,CAAT,GAAe,CAAnB,EAAsB;AACpB,UAAI,IAAI,OAAK,SAAS,CAAC,CAAD,CAAd,GAAiB,GAAjB,GAAqB,SAAS,CAAC,CAAD,CAA9B,GAAiC,OAAjC,GAAyC,SAAzC,GAAkD,aAAlD,IACJ,CAAC,GAAG,KAAJ,GAAY,KAAK,GAAG,SAAS,CAAC,CAAD,CADzB,IAC4B,GAD5B,IACgC,CAAC,GAAG,MADpC,CAAR;AAED;;AACD,QAAI,IAAI,QAAK,CAAC,GAAG,KAAK,GAAG,SAAS,CAAC,CAAD,CAA1B,IAA6B,GAA7B,IAAiC,CAAC,GAAG,MAArC,CAAR;;AAEA,QAAI,SAAS,CAAC,CAAD,CAAT,GAAe,CAAnB,EAAsB;AACpB,UAAI,IAAI,OAAK,SAAS,CAAC,CAAD,CAAd,GAAiB,GAAjB,GAAqB,SAAS,CAAC,CAAD,CAA9B,GAAiC,OAAjC,GAAyC,SAAzC,GAAkD,aAAlD,GACJ,CADI,GACH,GADG,IACC,CAAC,GAAG,MAAJ,GAAa,KAAK,GAAG,SAAS,CAAC,CAAD,CAD/B,CAAR;AAED;;AACD,QAAI,IAAI,GAAR;AACD,GA/BD,MA+BO,IAAI,SAAS,GAAG,CAAZ,IAAiB,MAAM,KAAK,CAAC,MAA7B,IAAuC,MAAM,GAAG,CAApD,EAAuD;AAC5D,QAAM,SAAS,GAAG,IAAI,CAAC,GAAL,CAAS,SAAT,EAAoB,MAApB,CAAlB;AAEA,QAAI,GAAG,OAAK,CAAL,GAAM,GAAN,IAAU,CAAC,GAAG,KAAK,GAAG,SAAtB,IAA+B,kBAA/B,GACK,SADL,GACc,GADd,GACkB,SADlB,GAC2B,OAD3B,GACmC,SADnC,GAC4C,GAD5C,IACgD,CAAC,GAAG,KAAK,GAAG,SAD5D,IACqE,GADrE,GACyE,CADzE,GAC0E,kBAD1E,IAEK,CAAC,GAAG,KAAJ,GAAY,KAAK,GAAG,SAFzB,IAEkC,GAFlC,GAEsC,CAFtC,GAEuC,kBAFvC,GAGK,SAHL,GAGc,GAHd,GAGkB,SAHlB,GAG2B,OAH3B,GAGmC,SAHnC,GAG4C,GAH5C,IAGgD,CAAC,GAAG,KAHpD,IAGyD,GAHzD,IAG6D,CAAC,GAAG,KAAK,GAAG,SAHzE,IAGkF,kBAHlF,IAIK,CAAC,GAAG,KAJT,IAIc,GAJd,IAIkB,CAAC,GAAG,MAAJ,GAAa,KAAK,GAAG,SAJvC,IAIgD,kBAJhD,GAKK,SALL,GAKc,GALd,GAKkB,SALlB,GAK2B,OAL3B,GAKmC,SALnC,GAK4C,GAL5C,IAKgD,CAAC,GAAG,KAAJ,GAAY,KAAK,GAAG,SALpE,IAK6E,GAL7E,IAKiF,CAAC,GAAG,MALrF,IAK2F,kBAL3F,IAMK,CAAC,GAAG,KAAK,GAAG,SANjB,IAM0B,GAN1B,IAM8B,CAAC,GAAG,MANlC,IAMwC,kBANxC,GAOK,SAPL,GAOc,GAPd,GAOkB,SAPlB,GAO2B,OAP3B,GAOmC,SAPnC,GAO4C,GAP5C,GAOgD,CAPhD,GAOiD,GAPjD,IAOqD,CAAC,GAAG,MAAJ,GAAa,KAAK,GAAG,SAP1E,IAOmF,IAP1F;AAQD,GAXM,MAWA;AACL,QAAI,GAAG,OAAK,CAAL,GAAM,GAAN,GAAU,CAAV,GAAW,KAAX,GAAiB,KAAjB,GAAsB,KAAtB,GAA4B,MAA5B,GAAkC,KAAlC,GAAwC,CAAC,KAAzC,GAA8C,IAArD;AACD;;AAED,SAAO,IAAP;AACD,CAtDD;;AAwEA;AAAwB;;AAAxB;AAAA;;AAiBE,kBAAQ;AACN,iBAAW,EAAE,CAAC;AADR,KAAR;;AAkFD;;AA3EC;AACE,QAAI,KAAK,IAAL,IAAa,KAAK,IAAL,CAAU,cAA3B,EAA2C;AACzC,UAAI;AACF,YAAM,WAAW,GAAG,KAAK,IAAL,CAAU,cAAV,EAApB;;AAEA,YAAI,WAAJ,EAAiB;AACf,eAAK,QAAL,CAAc;AACZ,uBAAW;AADC,WAAd;AAGD;AACF,OARD,CAQE,OAAO,GAAP,EAAY,CAEb;AACF;AACF,GAdD;;AAgBA;AAAA;;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,gBAAR;AAAA,QAAe,kBAAf;AAAA,QAAuB,kBAAvB;AAAA,QAA+B,wBAA/B;AACE;AACF;AAAA,QACJ,oCADI;AAAA,QAEJ,wCAFI;AAAA,QAGJ,kCAHI;AAAA,QAIJ,wCAJI;AAAA,QAKJ,oDALI;;AAQN,QAAI,CAAC,KAAK,CAAC,CAAP,IAAY,CAAC,KAAK,CAAC,CAAnB,IAAwB,KAAK,KAAK,CAAC,KAAnC,IAA4C,MAAM,KAAK,CAAC,MAAxD,IAAkE,KAAK,KAAK,CAA5E,IAAiF,MAAM,KAAK,CAAhG,EAAmG;AACjG,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,oBAAX,EAAiC,SAAjC,CAAnB;;AACA,QAAI,CAAC,uBAAL,EAA8B;AAC5B,aACE,sDACM,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CADN,EACmC;AACjC,iBAAS,EAAE,UADsB;AAEjC,SAAC,EAAE,eAAe,CAAC,CAAD,EAAI,CAAJ,EAAO,KAAP,EAAc,MAAd,EAAsB,MAAtB;AAFe,OADnC,EADF;AAOD;;AAED,WACE,iCAAC,yBAAD,EAAQ;AACN,cAAQ,EAAE,WAAW,GAAG,CADlB;AAEN,UAAI,EAAE;AAAE,aAAK,OAAP;AAAS,cAAM,QAAf;AAAiB,SAAC,GAAlB;AAAoB,SAAC;AAArB,OAFA;AAGN,QAAE,EAAE;AAAE,aAAK,OAAP;AAAS,cAAM,QAAf;AAAiB,SAAC,GAAlB;AAAoB,SAAC;AAArB,OAHE;AAIN,cAAQ,EAAE,iBAJJ;AAKN,qBAAe,EAAE,eALX;AAMN,cAAQ,EAAE;AANJ,KAAR,EAQG,UAAC,EAAD,EAAkE;UAA/D,oB;UAAkB,sB;UAAoB,Y;UAAU,Y;AAAoB,aACtE,iCAAC,yBAAD,EAAQ;AACN,gBAAQ,EAAE,WAAW,GAAG,CADlB;AAEN,YAAI,EAAE,UAAO,WAAW,KAAK,CAAC,CAAjB,GAAqB,CAArB,GAAyB,WAAhC,IAA2C,IAF3C;AAGN,UAAE,EAAK,WAAW,WAHZ;AAIN,qBAAa,EAAC,iBAJR;AAKN,aAAK,EAAE,cALD;AAMN,gBAAQ,EAAE,iBANJ;AAON,gBAAQ,EAAE,iBAPJ;AAQN,cAAM,EAAE;AARF,OAAR,EAUE,sDACM,oBAAY,KAAI,CAAC,KAAjB,EAAwB,IAAxB,CADN,EACmC;AACjC,iBAAS,EAAE,UADsB;AAEjC,SAAC,EAAE,eAAe,CAAC,KAAD,EAAQ,KAAR,EAAe,SAAf,EAA0B,UAA1B,EAAsC,MAAtC,CAFe;AAGjC,WAAG,EAAE,mBAAI;AACP,eAAI,CAAC,IAAL,GAAY,IAAZ;AACD;AALgC,OADnC,EAVF,CADsE;AAoBvE,KA5BH,CADF;AAgCD,GA1DD;;AAvCO,2BAAe;AACpB,KAAC,EAAE,CADiB;AAEpB,KAAC,EAAE,CAFiB;AAGpB,SAAK,EAAE,CAHa;AAIpB,UAAM,EAAE,CAJY;AAQpB,UAAM,EAAE,CARY;AASpB,qBAAiB,EAAE,KATC;AAUpB,2BAAuB,EAAE,KAVL;AAWpB,kBAAc,EAAE,CAXI;AAYpB,qBAAiB,EAAE,IAZC;AAapB,mBAAe,EAAE;AAbG,GAAf;AAkGT;AAAC,CAnGD,CAAwB,qBAAxB;;AAqGA,qBAAe,SAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpLA;;AACA;;AACA;;AACA;;AACA;;AAEA,IAAM,aAAa,GAAG,SAAhB,aAAgB,CAAC,UAAD,EAAqB,QAArB,EAAqC;AACzD,MAAM,IAAI,GAAG,qBAAS,QAAQ,GAAG,UAApB,CAAb;AACA,MAAM,UAAU,GAAG,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,QAAQ,GAAG,UAApB,CAAT,EAA0C,OAA1C,CAAnB;AAEA,SAAO,IAAI,GAAG,UAAd;AACD,CALD;;AAkBA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,EAAD,EASN;MARjB,U;MACA,U;MACA,kB;MACA,gB;MACA,c;MACA,0B;MACA,8B;MACA,sC;AAEA,MAAM,YAAY,GAAG,YAAY,IAAI,UAAU,GAAG,CAAH,GAAO,CAAC,CAAtB,CAAZ,GAAuC,MAA5D;AACA,MAAM,KAAK,GAAG,IAAI,CAAC,IAAL,CAAU,YAAY,GAAG,YAAzB,IAAyC,mBAAvD;AACA,MAAM,WAAW,GAAG,gBAAgB,GAAG,KAAH,GAAW,KAAK,GAAG,IAAI,GAAG,KAA9D;AACA,MAAM,MAAM,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,YAAzB,EAAuC,WAAvC,CAAf;AAEA,MAAM,cAAc,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,MAAzB,EAAiC,WAAjC,CAAvB;AAEA,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,KAAK,GAAG,IAAI,GAAG,KAAlB,GAA0B,KAApE;AACA,MAAM,YAAY,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,YAAY,GAAG,IAAI,CAAC,GAAL,CAAS,KAAK,GAAG,mBAAjB,CAAxC,EAAkE,iBAAlE,CAArB;AACA,SAAO;AAAE,UAAM,QAAR;AAAU,kBAAc,gBAAxB;AAA0B,gBAAY,cAAtC;AAAwC,SAAK;AAA7C,GAAP;AACD,CApBD;;AAsBA,IAAM,aAAa,GAAG,SAAhB,aAAgB,CAAC,EAAD,EAA2E;MAAxE,U;MAAI,U;MAAI,4B;MAAa,4B;MAAa,0B;MAAY,sB;AACrE,MAAM,KAAK,GAAG,aAAa,CAAC,UAAD,EAAa,QAAb,CAA3B;AAGA,MAAM,YAAY,GAAG,UAAU,GAAG,KAAlC;AACA,MAAM,eAAe,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,UAAtC,CAAxB;AACA,MAAM,aAAa,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,YAAtC,CAAtB;AAEA,MAAI,IAAI,GAAG,OAAK,eAAe,CAAC,CAArB,GAAsB,GAAtB,GAA0B,eAAe,CAAC,CAA1C,GAA2C,UAA3C,GACL,WADK,GACM,GADN,GACU,WADV,GACqB,WADrB,GAEP,EAAE,IAAI,CAAC,GAAL,CAAS,KAAT,IAAkB,GAApB,CAFO,GAEiB,GAFjB,GAEqB,EAAE,UAAU,GAAG,YAAf,CAFrB,GAEiD,SAFjD,GAGP,aAAa,CAAC,CAHP,GAGQ,GAHR,GAGY,aAAa,CAAC,CAH1B,GAG2B,MAHtC;;AAMA,MAAI,WAAW,GAAG,CAAlB,EAAqB;AACnB,QAAM,eAAe,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,UAAtC,CAAxB;AACA,QAAM,aAAa,GAAG,8BAAiB,EAAjB,EAAqB,EAArB,EAAyB,WAAzB,EAAsC,YAAtC,CAAtB;AACA,QAAI,IAAI,OAAK,aAAa,CAAC,CAAnB,GAAoB,GAApB,GAAwB,aAAa,CAAC,CAAtC,GAAuC,kBAAvC,GACI,WADJ,GACe,GADf,GACmB,WADnB,GAC8B,mBAD9B,GAEE,EAAE,IAAI,CAAC,GAAL,CAAS,KAAT,IAAkB,GAApB,CAFF,GAE0B,GAF1B,GAE8B,EAAE,UAAU,IAAI,YAAhB,CAF9B,GAE2D,iBAF3D,GAGE,eAAe,CAAC,CAHlB,GAGmB,GAHnB,GAGuB,eAAe,CAAC,CAHvC,GAGwC,IAHhD;AAID,GAPD,MAOO;AACL,QAAI,IAAI,OAAK,EAAL,GAAO,GAAP,GAAW,EAAX,GAAa,IAArB;AACD;;AAED,SAAO,IAAP;AACD,CA1BD;;AA4BA,IAAM,mBAAmB,GAAG,SAAtB,mBAAsB,CAAC,EAAD,EAUX;MATf,U;MACA,U;MACA,4B;MACA,4B;MACA,8B;MACA,wC;MACA,sC;MACA,0B;MACA,sB;AAEA,MAAM,IAAI,GAAG,qBAAS,QAAQ,GAAG,UAApB,CAAb;;AACM;UAAA;UAAA;uBAAA;qBAAA;cAAA;8BAAA;;AAAA;AAAA,MAAE,wBAAF;AAAA,MAAwB,sBAAxB;AAAA,MAA4C,cAA5C;;AASA;UAAA;UAAA;uBAAA;mBAAA;eAAA;8BAAA;;AAAA;AAAA,MAAE,wBAAF;AAAA,MAAwB,sBAAxB;AAAA,MAA4C,cAA5C;;AASN,MAAM,aAAa,GAAG,gBAAgB,GAClC,IAAI,CAAC,GAAL,CAAS,UAAU,GAAG,QAAtB,CADkC,GAElC,IAAI,CAAC,GAAL,CAAS,UAAU,GAAG,QAAtB,IAAkC,GAAlC,GAAwC,GAF5C;;AAIA,MAAI,aAAa,GAAG,CAApB,EAAuB;AACrB,QAAI,iBAAJ,EAAuB;AACrB,aAAO,OAAK,IAAI,CAAC,CAAV,GAAW,GAAX,GAAe,IAAI,CAAC,CAApB,GAAqB,aAArB,GACF,YADE,GACU,GADV,GACc,YADd,GAC0B,SAD1B,GACoC,YAAY,GAAG,CADnD,GACoD,eADpD,GAEF,YAFE,GAEU,GAFV,GAEc,YAFd,GAE0B,SAF1B,GAEoC,CAAC,YAAD,GAAgB,CAFpD,GAEqD,YAF5D;AAID;;AACD,WAAO,aAAa,CAAC;AACnB,QAAE,IADiB;AAEnB,QAAE,IAFiB;AAGnB,iBAAW,aAHQ;AAInB,iBAAW,aAJQ;AAKnB,gBAAU,YALS;AAMnB,cAAQ;AANW,KAAD,CAApB;AAQD;;AAED,MAAI,IAAI,GAAG,OAAK,IAAI,CAAC,CAAV,GAAW,GAAX,GAAe,IAAI,CAAC,CAApB,GAAqB,SAArB,GACN,YADM,GACM,GADN,GACU,YADV,GACsB,OADtB,GAC8B,EAAE,IAAI,GAAG,CAAT,CAD9B,GACyC,GADzC,GAC6C,IAAI,CAAC,CADlD,GACmD,GADnD,GACuD,IAAI,CAAC,CAD5D,GAC6D,SAD7D,GAEN,WAFM,GAEK,GAFL,GAES,WAFT,GAEoB,KAFpB,GAE0B,EAAE,aAAa,GAAG,GAAlB,CAF1B,GAEgD,GAFhD,GAEoD,EAAE,IAAI,GAAG,CAAT,CAFpD,GAE+D,GAF/D,GAEmE,IAAI,CAAC,CAFxE,GAEyE,GAFzE,GAE6E,IAAI,CAAC,CAFlF,GAEmF,SAFnF,GAGN,YAHM,GAGM,GAHN,GAGU,YAHV,GAGsB,OAHtB,GAG8B,EAAE,IAAI,GAAG,CAAT,CAH9B,GAGyC,GAHzC,GAG6C,IAAI,CAAC,CAHlD,GAGmD,GAHnD,GAGuD,IAAI,CAAC,CAH5D,GAG6D,MAHxE;;AAMA,MAAI,WAAW,GAAG,CAAlB,EAAqB;AACb;YAAA;YAAA;yBAAA;uBAAA;gBAAA;sBAAA;gCAAA;;AAAA;AAAA,QAAE,wBAAF;AAAA,QAAwB,sBAAxB;AAAA,QAA4C,cAA5C;;AAUA;YAAA;YAAA;yBAAA;qBAAA;iBAAA;sBAAA;gCAAA;;AAAA;AAAA,QAAE,wBAAF;AAAA,QAAwB,sBAAxB;AAAA,QAA4C,cAA5C;;AAUN,QAAM,aAAa,GAAG,gBAAgB,GAClC,IAAI,CAAC,GAAL,CAAS,UAAU,GAAG,QAAtB,CADkC,GAElC,IAAI,CAAC,GAAL,CAAS,UAAU,GAAG,QAAtB,IAAkC,GAAlC,GAAwC,GAF5C;;AAIA,QAAI,aAAa,GAAG,CAApB,EAAuB;AACrB,aAAU,IAAI,MAAJ,GAAQ,EAAR,GAAU,GAAV,GAAc,EAAd,GAAgB,GAA1B;AACD;;AAED,QAAI,IAAI,MAAI,IAAI,CAAC,CAAT,GAAU,GAAV,GAAc,IAAI,CAAC,CAAnB,GAAoB,WAApB,GACH,YADG,GACS,GADT,GACa,YADb,GACyB,OADzB,GACiC,EAAE,IAAI,GAAG,CAAT,CADjC,GAC4C,GAD5C,GACgD,IAAI,CAAC,CADrD,GACsD,GADtD,GAC0D,IAAI,CAAC,CAD/D,GACgE,WADhE,GAEH,WAFG,GAEQ,GAFR,GAEY,WAFZ,GAEuB,KAFvB,GAE6B,EAAE,aAAa,GAAG,GAAlB,CAF7B,GAEmD,GAFnD,GAEuD,EAAE,IAAI,GAAG,CAAT,CAFvD,GAEkE,GAFlE,GAEsE,IAAI,CAAC,CAF3E,GAE4E,GAF5E,GAEgF,IAAI,CAAC,CAFrF,GAEsF,WAFtF,GAGH,YAHG,GAGS,GAHT,GAGa,YAHb,GAGyB,OAHzB,GAGiC,EAAE,IAAI,GAAG,CAAT,CAHjC,GAG4C,GAH5C,GAGgD,IAAI,CAAC,CAHrD,GAGsD,GAHtD,GAG0D,IAAI,CAAC,CAH/D,GAGgE,GAHxE;AAID,GAjCD,MAiCO;AACL,QAAI,IAAI,MAAI,EAAJ,GAAM,GAAN,GAAU,EAAV,GAAY,GAApB;AACD;;AAED,SAAO,IAAP;AACD,CA/FD;;AAuGA;AAAqB;;AAArB;;AAsDC;;AAzCC;AACQ;AAAA,QACJ,UADI;AAAA,QAEJ,UAFI;AAAA,QAGJ,4BAHI;AAAA,QAIJ,4BAJI;AAAA,QAKJ,8BALI;AAAA,QAMJ,wCANI;AAAA,QAOJ,sCAPI;AAAA,QAQJ,0BARI;AAAA,QASJ,sBATI;AAAA,QAUJ,wBAVI;;AAaN,QAAI,WAAW,GAAG,WAAd,IAA6B,UAAU,KAAK,QAAhD,EAA0D;AACxD,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,iBAAX,EAA8B,SAA9B,CAAnB;AACA,QAAM,WAAW,GAAG,WAAW,GAAG,WAAlC;AACA,QAAM,EAAE,GAAG,4BAAgB,YAAhB,EAA8B,WAA9B,EAA2C,CAA3C,EAA8C,IAA9C,CAAX;AACA,QAAI,IAAJ;;AAEA,QAAI,EAAE,GAAG,CAAL,IAAU,IAAI,CAAC,GAAL,CAAS,UAAU,GAAG,QAAtB,IAAkC,GAAhD,EAAqD;AACnD,UAAI,GAAG,mBAAmB,CAAC;AACzB,UAAE,IADuB;AAEzB,UAAE,IAFuB;AAGzB,mBAAW,aAHc;AAIzB,mBAAW,aAJc;AAKzB,oBAAY,EAAE,IAAI,CAAC,GAAL,CAAS,EAAT,EAAa,WAAW,GAAG,CAA3B,CALW;AAMzB,yBAAiB,mBANQ;AAOzB,wBAAgB,kBAPS;AAQzB,kBAAU,YARe;AASzB,gBAAQ;AATiB,OAAD,CAA1B;AAWD,KAZD,MAYO;AACL,UAAI,GAAG,aAAa,CAAC;AAAE,UAAE,IAAJ;AAAM,UAAE,IAAR;AAAU,mBAAW,aAArB;AAAuB,mBAAW,aAAlC;AAAoC,kBAAU,YAA9C;AAAgD,gBAAQ;AAAxD,OAAD,CAApB;AACD;;AAED,WAAO,sDAAU,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CAAV,EAAuC;AAAE,eAAS,EAAE,UAAb;AAAyB,OAAC,EAAE;AAA5B,KAAvC,EAAP;AACD,GAxCD;;AAZO,wBAAe;AACpB,MAAE,EAAE,CADgB;AAEpB,MAAE,EAAE,CAFgB;AAGpB,eAAW,EAAE,CAHO;AAIpB,eAAW,EAAE,CAJO;AAKpB,cAAU,EAAE,CALQ;AAMpB,YAAQ,EAAE,CANU;AAOpB,gBAAY,EAAE,CAPM;AAQpB,qBAAiB,EAAE,KARC;AASpB,oBAAgB,EAAE;AATE,GAAf;AAqDT;AAAC,CAtDD,CAAqB,qBAArB;;AAwDA,qBAAe,MAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzOA;;AACA;;AACA;;AAWA;;AACA;;AAQA,IAAM,eAAe,GAAkB;AACrC,cAAY,yBADyB;AAErC,aAAW,wBAF0B;AAGrC,eAAa,0BAHwB;AAIrC,cAAY,yBAJyB;AAKrC,YAAU,uBAL2B;AAMrC,gBAAc,2BANuB;AAOrC,WAAS;AAP4B,CAAvC;AASA,IAAM,MAAM,GAAG,IAAI,CAAC,EAAL,GAAU,GAAzB;;AAEA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,IAAD,EAAiB;AACxC,MAAM,IAAI,GAAG,WAAS,oBAAE,UAAF,CAAa,IAAb,CAAtB;AAEA,SAAO,eAAe,CAAC,IAAD,CAAf,IAAyB,uBAAhC;AACD,CAJD;;AAMA,IAAM,iBAAiB,GAAG,SAApB,iBAAoB,CAAC,IAAD,EAAe,QAAf,EAAmC,IAAnC,EAAmD;AAC3E,MAAI,QAAQ,KAAK,MAAjB,EAAyB;AACvB,WAAO,IAAP;AACD;;AAED,UAAQ,IAAR;AACE,SAAK,OAAL;AACE,aAAQ,IAAI,IAAJ,GAAW,IAAZ,GAAoB,CAA3B;;AACF,SAAK,SAAL;AACE,aAAQ,MAAM,IAAN,GAAa,IAAd,GAAsB,IAAI,CAAC,IAAL,CAAU,CAAV,CAA7B;;AACF,SAAK,QAAL;AACE,aAAO,IAAI,GAAG,IAAd;;AACF,SAAK,MAAL;AAAa;AACX,YAAM,KAAK,GAAG,KAAK,MAAnB;AAEA,eAAO,OAAO,IAAP,GAAc,IAAd,IAAsB,IAAI,CAAC,GAAL,CAAS,KAAT,IAAkB,IAAI,CAAC,GAAL,CAAS,KAAK,GAAG,CAAjB,IAAsB,aAAI,CAAC,GAAL,CAAS,KAAT,GAAmB,CAAnB,CAA9D,CAAP;AACD;;AACD,SAAK,UAAL;AACE,aAAQ,IAAI,CAAC,IAAL,CAAU,CAAV,IAAe,IAAf,GAAsB,IAAvB,GAA+B,CAAtC;;AACF,SAAK,KAAL;AACE,aAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,IAAL,CAAU,CAAV,CAAX,IAA2B,IAA3B,GAAkC,IAAnC,GAA2C,CAAlD;;AACF;AACE,aAAQ,IAAI,CAAC,EAAL,GAAU,IAAV,GAAiB,IAAlB,GAA0B,CAAjC;AAjBJ;AAmBD,CAxBD;;AAqCA;AAAsB;;AAAtB;;AAyCC;;AA1BC;AACQ;AAAA,QAAE,cAAF;AAAA,QAAQ,sBAAR;AAAA,QAAkB,cAAlB;AACN,QAAM,aAAa,GAAG,gBAAgB,CAAC,IAAD,CAAtC;AACA,QAAM,MAAM,GAAG,oBACZ,IADY,CACP,aADO,EAEZ,IAFY,CAEP,iBAAiB,CAAC,IAAD,EAAO,QAAP,EAAiB,IAAjB,CAFV,CAAf;AAIA,WAAO,MAAM,EAAb;AACD,GARD;;AAUA;AACQ;AAAA,QAAE,wBAAF;AAAA,QAAa,UAAb;AAAA,QAAiB,UAAjB;AAAA,QAAqB,cAArB;;AAEN,QAAI,EAAE,KAAK,CAAC,EAAR,IAAc,EAAE,KAAK,CAAC,EAAtB,IAA4B,IAAI,KAAK,CAAC,IAA1C,EAAgD;AAC9C,aACE,sDACM,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CADN,EACmC;AACjC,iBAAS,EAAE,wBAAW,kBAAX,EAA+B,SAA/B,CADsB;AAEjC,iBAAS,EAAE,eAAa,EAAb,GAAe,IAAf,GAAoB,EAApB,GAAsB,GAFA;AAGjC,SAAC,EAAE,KAAK,OAAL;AAH8B,OADnC,EADF;AAQD;;AAED,WAAO,IAAP;AACD,GAfD;;AAxBO,yBAAe;AACpB,QAAI,EAAE,QADc;AAEpB,QAAI,EAAE,EAFc;AAGpB,YAAQ,EAAE;AAHU,GAAf;;AAMA,2BAAiB,UAAC,GAAD,EAAc,OAAd,EAAmC;AACzD,mBAAe,CAAC,WAAS,oBAAE,UAAF,CAAa,GAAb,CAAV,CAAf,GAAgD,OAAhD;AACD,GAFM;;AAkCT;AAAC,CAzCD,CAAsB,qBAAtB;;AA2CA,qBAAe,OAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvHA;;AACA;;AACA;;AACA;;AAEA,IAAM,gBAAgB,GAAG,SAAnB,gBAAmB,CAAC,CAAD,EAAY,CAAZ,EAAuB,UAAvB,EAA2C,UAA3C,EAA+D,MAA/D,EAA6E;AACpG,MAAM,QAAQ,GAAG,UAAU,GAAG,UAA9B;AACA,MAAI,IAAJ;AACA,MAAI,GAAG,OAAK,CAAL,GAAM,GAAN,GAAU,CAAjB;AACA,MAAI,IAAI,QAAK,CAAC,GAAG,UAAT,IAAmB,GAAnB,GAAuB,CAA/B;AACA,MAAI,IAAI,QAAK,CAAC,GAAG,UAAJ,GAAiB,QAAQ,GAAG,CAAjC,IAAkC,GAAlC,IAAsC,CAAC,GAAG,MAA1C,CAAR;AACA,MAAI,IAAI,QAAK,CAAC,GAAG,UAAJ,GAAiB,QAAQ,GAAG,CAA5B,GAAgC,UAArC,IAA+C,GAA/C,IAAmD,CAAC,GAAG,MAAvD,CAAR;AACA,MAAI,IAAI,OAAK,CAAL,GAAM,GAAN,GAAU,CAAV,GAAW,IAAnB;AACA,SAAO,IAAP;AACD,CATD;;AA2BA;AAAwB;;AAAxB;AAAA;;AAaE,kBAAQ;AACN,iBAAW,EAAE,CAAC;AADR,KAAR;;AAiGD;;AA1FC;AACE,QAAI,KAAK,IAAL,IAAa,KAAK,IAAL,CAAU,cAA3B,EAA2C;AACzC,UAAI;AACF,YAAM,WAAW,GAAG,KAAK,IAAL,CAAU,cAAV,EAApB;;AAEA,YAAI,WAAJ,EAAiB;AACf,eAAK,QAAL,CAAc;AACZ,uBAAW;AADC,WAAd;AAGD;AACF,OARD,CAQE,OAAO,GAAP,EAAY,CAEb;AACF;AACF,GAdD;;AAgBA;AAAA;;AACQ;AAAA,QAAE,QAAF;AAAA,QAAK,QAAL;AAAA,QAAQ,0BAAR;AAAA,QAAoB,0BAApB;AAAA,QAAgC,kBAAhC;AAAA,QAAwC,wBAAxC;AACE;AACF;AAAA,QAAE,oCAAF;AAAA,QAAmB,wCAAnB;AAAA,QAAsC,kCAAtC;AAAA,QAAsD,oDAAtD;;AAEN,QACE,CAAC,KAAK,CAAC,CAAP,IACA,CAAC,KAAK,CAAC,CADP,IAEA,UAAU,KAAK,CAAC,UAFhB,IAGA,UAAU,KAAK,CAAC,UAHhB,IAIA,MAAM,KAAK,CAAC,MAJZ,IAKC,UAAU,KAAK,CAAf,IAAoB,UAAU,KAAK,CALpC,IAMA,MAAM,KAAK,CAPb,EAQE;AACA,aAAO,IAAP;AACD;;AAED,QAAM,UAAU,GAAG,wBAAW,oBAAX,EAAiC,SAAjC,CAAnB;;AAEA,QAAI,CAAC,uBAAL,EAA8B;AAC5B,aACE,4CACE,sDACM,oBAAY,KAAK,KAAjB,EAAwB,IAAxB,CADN,EACmC;AACjC,iBAAS,EAAE,UADsB;AAEjC,SAAC,EAAE,gBAAgB,CAAC,CAAD,EAAI,CAAJ,EAAO,UAAP,EAAmB,UAAnB,EAA+B,MAA/B;AAFc,OADnC,EADF,CADF;AASD;;AACD,WACE,iCAAC,yBAAD,EAAQ;AACN,cAAQ,EAAE,WAAW,GAAG,CADlB;AAEN,UAAI,EAAE;AAAE,kBAAU,EAAE,CAAd;AAAiB,kBAAU,EAAE,CAA7B;AAAgC,cAAM,QAAtC;AAAwC,SAAC,GAAzC;AAA2C,SAAC;AAA5C,OAFA;AAGN,QAAE,EAAE;AAAE,kBAAU,YAAZ;AAAc,kBAAU,YAAxB;AAA0B,cAAM,QAAhC;AAAkC,SAAC,GAAnC;AAAqC,SAAC;AAAtC,OAHE;AAIN,cAAQ,EAAE,iBAJJ;AAKN,qBAAe,EAAE,eALX;AAMN,cAAQ,EAAE;AANJ,KAAR,EAQG,UAAC,EAAD,EAYA;UAXC,8B;UACA,8B;UACA,sB;UACA,Y;UACA,Y;AAOI,aACJ,iCAAC,yBAAD,EAAQ;AACN,gBAAQ,EAAE,WAAW,GAAG,CADlB;AAEN,YAAI,EAAE,UAAO,WAAW,KAAK,CAAC,CAAjB,GAAqB,CAArB,GAAyB,WAAhC,IAA2C,IAF3C;AAGN,UAAE,EAAK,WAAW,WAHZ;AAIN,qBAAa,EAAC,iBAJR;AAKN,aAAK,EAAE,cALD;AAMN,gBAAQ,EAAE,iBANJ;AAON,cAAM,EAAE;AAPF,OAAR,EASE,sDACM,oBAAY,KAAI,CAAC,KAAjB,EAAwB,IAAxB,CADN,EACmC;AACjC,iBAAS,EAAE,UADsB;AAEjC,SAAC,EAAE,gBAAgB,CAAC,KAAD,EAAQ,KAAR,EAAe,cAAf,EAA+B,cAA/B,EAA+C,UAA/C,CAFc;AAGjC,WAAG,EAAE,mBAAI;AACP,eAAI,CAAC,IAAL,GAAY,IAAZ;AACD;AALgC,OADnC,EATF,CADI;AAmBL,KAvCH,CADF;AA2CD,GAzED;;AAnCO,2BAAe;AACpB,KAAC,EAAE,CADiB;AAEpB,KAAC,EAAE,CAFiB;AAGpB,cAAU,EAAE,CAHQ;AAIpB,cAAU,EAAE,CAJQ;AAKpB,UAAM,EAAE,CALY;AAMpB,2BAAuB,EAAE,KANL;AAOpB,kBAAc,EAAE,CAPI;AAQpB,qBAAiB,EAAE,IARC;AASpB,mBAAe,EAAE;AATG,GAAf;AA6GT;AAAC,CA9GD,CAAwB,qBAAxB;;AAgHA,qBAAe,SAAf,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnJA;;AACA;;AAYa,wBAAgB,UAAC,KAAD,EAAa,OAAb,EAA2B,MAA3B,EAAwC,QAAxC,EAA4D,SAA5D,EAA6E;AAChG;AAAA,MAAO,qBAAP;AAAA,MAAe,qBAAf;AACR,MAAM,GAAG,GAAG,MAAM,CAAC,IAAP,CAAY,OAAZ,CAAZ;AACA,MAAM,KAAK,GAAwB;AACjC,QAAI,EAAE,MAAM,CAAC,IADoB;AAEjC,cAAU,EAAE,MAAM,CAAC,IAFc;AAGjC,SAAK,EAAE,KAAK,GAAG,MAAM,CAAC,KAHW;AAIjC,eAAW,EAAE,KAAK,GAAG,MAAM,CAAC,KAJK;AAKjC,OAAG,EAAE,MAAM,CAAC,GALqB;AAMjC,aAAS,EAAE,MAAM,CAAC,GANe;AAOjC,UAAM,EAAE,MAAM,GAAG,MAAM,CAAC,MAPS;AAQjC,gBAAY,EAAE,MAAM,GAAG,MAAM,CAAC;AARG,GAAnC;AAWA,SAAO,GAAG,CAAC,MAAJ,CAAW,UAAC,MAAD,EAAS,EAAT,EAAW;;;AAC3B,QAAM,IAAI,GAAG,OAAO,CAAC,EAAD,CAApB;AACQ;AAAA,QAAa,oBAAb;AAAA,QAAqB,iBAArB;AAAA,QAAqB,iCAArB;AAAA,QAAmC,oBAAnC;AAAA,QAA2C,wBAA3C;AACR,QAAM,SAAS,GAAG,KAAG,WAAH,IAAiB,MAAM,GAAG,QAAH,GAAc,EAArC,CAAlB;AAEA,QAAI,KAAJ,EAAW,CAAX,EAAc,CAAd,EAAiB,SAAjB;;AAEA,QAAI,QAAQ,KAAK,OAAjB,EAA0B;AACxB,WAAK,GAAG,CAAC,MAAM,CAAC,IAAP,IAAe,OAAO,CAAC,IAAR,IAAgB,CAA/B,CAAD,EAAoC,MAAM,CAAC,IAAP,GAAc,MAAM,CAAC,KAArB,IAA8B,OAAO,CAAC,KAAR,IAAiB,CAA/C,CAApC,CAAR;AACD,KAFD,MAEO,IAAI,QAAQ,KAAK,OAAjB,EAA0B;AAC/B,WAAK,GACH,MAAM,KAAK,YAAX,GACI,CAAC,MAAM,CAAC,GAAP,GAAa,MAAM,CAAC,MAApB,IAA8B,OAAO,CAAC,MAAR,IAAkB,CAAhD,CAAD,EAAqD,MAAM,CAAC,GAAP,IAAc,OAAO,CAAC,GAAR,IAAe,CAA7B,CAArD,CADJ,GAEI,CAAC,MAAM,CAAC,GAAP,IAAc,OAAO,CAAC,GAAR,IAAe,CAA7B,CAAD,EAAkC,MAAM,CAAC,GAAP,GAAa,MAAM,CAAC,MAApB,IAA8B,OAAO,CAAC,MAAR,IAAkB,CAAhD,CAAlC,CAHN;AAID,KALM,MAKA;AACF,wBAAH;AACD;;AAED,QAAI,QAAJ,EAAc;AACZ,WAAK,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,EAAW,KAAK,CAAC,CAAD,CAAhB,CAAR;AACD;;AAEK;AAAA,QAAE,gBAAF;AAAA,QAAS,gCAAT;;AACN,SAAK,CAAC,MAAN,CAAa,MAAb,EAAqB,KAArB,CAA2B,KAA3B;AACA,oCAAmB,KAAnB;AACA,QAAM,KAAK,GAAG,6BAAgB,KAAhB,EAAqB,sBAAO,IAAP,GAAW;AAAE,mBAAa;AAAf,KAAX,CAArB,CAAd;;AAEA,QAAI,QAAQ,KAAK,OAAjB,EAA0B;AACxB,eAAS,GAAI,WAAW,KAAK,KAAhB,IAAyB,CAAC,MAA3B,IAAuC,WAAW,KAAK,QAAhB,IAA4B,MAA/E;AACA,OAAC,GAAG,MAAM,CAAC,IAAX;AACA,OAAC,GAAG,KAAK,CAAC,SAAD,CAAL,GAAmB,SAAS,GAAG,IAAI,CAAC,MAAxC;AACD,KAJD,MAIO,IAAI,QAAQ,KAAK,OAAjB,EAA0B;AAC/B,eAAS,GAAI,WAAW,KAAK,MAAhB,IAA0B,CAAC,MAA5B,IAAwC,WAAW,KAAK,OAAhB,IAA2B,MAA/E;AACA,OAAC,GAAG,KAAK,CAAC,SAAD,CAAL,GAAmB,SAAS,GAAG,IAAI,CAAC,KAAxC;AACA,OAAC,GAAG,MAAM,CAAC,GAAX;AACD;;AAED,QAAM,SAAS,kCACV,IADU,GAEV,KAFU,GAEL;AACR,mBAAa,eADL;AAER,OAAC,GAFO;AAGR,OAAC,GAHO;AAIR,WAAK,OAJG;AAKR,WAAK,EAAE,QAAQ,KAAK,OAAb,GAAuB,MAAM,CAAC,KAA9B,GAAsC,IAAI,CAAC,KAL1C;AAMR,YAAM,EAAE,QAAQ,KAAK,OAAb,GAAuB,MAAM,CAAC,MAA9B,GAAuC,IAAI,CAAC;AAN5C,KAFK,CAAf;;AAWA,aAAS,CAAC,QAAV,GAAqB,+BAAkB,SAAlB,EAA6B,KAA7B,CAArB;;AAEA,QAAI,CAAC,IAAI,CAAC,IAAN,IAAc,QAAQ,KAAK,OAA/B,EAAwC;AACtC,WAAK,CAAC,SAAD,CAAL,IAAoB,CAAC,SAAS,GAAG,CAAC,CAAJ,GAAQ,CAAlB,IAAuB,SAAS,CAAC,MAArD;AACD,KAFD,MAEO,IAAI,CAAC,IAAI,CAAC,IAAV,EAAgB;AACrB,WAAK,CAAC,SAAD,CAAL,IAAoB,CAAC,SAAS,GAAG,CAAC,CAAJ,GAAQ,CAAlB,IAAuB,SAAS,CAAC,KAArD;AACD;;AAED,iCAAY,MAAZ,IAAkB,YAAG,EAAH,IAAQ,SAAR,EAAiB,EAAnC;AACD,GAzDM,EAyDJ,EAzDI,CAAP;AA0DD,CAxEY;;AA0EA,yBAAiB,UAAC,EAAD,EAA+B,EAA/B,EAA2D;MAAxD,S;MAAO,S;MAAuB,S;MAAO,S;AAAwB,SAAC;AAC7F,KAAC,EAAE,IAAI,CAAC,GAAL,CAAS,EAAT,EAAa,EAAb,CAD0F;AAE7F,KAAC,EAAE,IAAI,CAAC,GAAL,CAAS,EAAT,EAAa,EAAb,CAF0F;AAG7F,SAAK,EAAE,IAAI,CAAC,GAAL,CAAS,EAAE,GAAG,EAAd,CAHsF;AAI7F,UAAM,EAAE,IAAI,CAAC,GAAL,CAAS,EAAE,GAAG,EAAd;AAJqF,GAAD;AAK5F,CALW;;AAYA,yBAAiB,UAAC,EAAD,EAAuE;MAApE,U;MAAI,U;MAAI,U;MAAI,U;AAC3C,gCAAe;AAAE,KAAC,EAAE,EAAL;AAAS,KAAC,EAAE;AAAZ,GAAf,EAAiC;AAAE,KAAC,EAAE,EAAL;AAAS,KAAC,EAAE;AAAZ,GAAjC;AAAkD,CADvC;;AAGb;AASE,uBAAY,KAAZ,EAAsB;AACpB,SAAK,KAAL,GAAa,KAAb;AACD;;AANM,uBAAP,UAAc,GAAd,EAAsB;AACpB,WAAO,IAAI,WAAJ,CAAgB,GAAhB,CAAP;AACD,GAFM;;AAQP,wBAAI,qBAAJ,EAAI,QAAJ,EAAU;SAAV;AACE,aAAO,KAAK,KAAL,CAAW,MAAlB;AACD,KAFS;oBAAA;;AAAA,GAAV;AAIA,wBAAI,qBAAJ,EAAI,OAAJ,EAAS;SAAT;AACE,aAAO,KAAK,KAAL,CAAW,KAAlB;AACD,KAFQ;oBAAA;;AAAA,GAAT;AAIA,wBAAI,qBAAJ,EAAI,UAAJ,EAAY;SAAZ;AACE,aAAO,KAAK,KAAL,GAAa,CAAb,CAAP;AACD,KAFW;oBAAA;;AAAA,GAAZ;AAIA,wBAAI,qBAAJ,EAAI,UAAJ,EAAY;SAAZ;AACE,aAAO,KAAK,KAAL,GAAa,CAAb,CAAP;AACD,KAFW;oBAAA;;AAAA,GAAZ;AAIA,wBAAI,qBAAJ,EAAI,WAAJ,EAAa;SAAb;AACE,aAAO,KAAK,KAAL,CAAW,SAAlB;AACD,KAFY;oBAAA;;AAAA,GAAb;;AAIA,0CAAM,KAAN,EAAkB,EAAlB,EAAuF;QAArE,4B;QAAE,wB;QAAW,sB;;AAC7B,QAAI,KAAK,KAAK,SAAd,EAAyB;AACvB,aAAO,SAAP;AACD;;AACD,QAAI,QAAJ,EAAc;AACZ,cAAQ,QAAR;AACE,aAAK,OAAL;AAAc;AACZ,mBAAO,KAAK,KAAL,CAAW,KAAX,CAAP;AACD;;AACD,aAAK,QAAL;AAAe;AACb,gBAAM,MAAM,GAAG,KAAK,SAAL,GAAiB,KAAK,SAAL,KAAmB,CAApC,GAAwC,CAAvD;AACA,mBAAO,KAAK,KAAL,CAAW,KAAX,IAAoB,MAA3B;AACD;;AACD,aAAK,KAAL;AAAY;AACV,gBAAM,MAAM,GAAG,KAAK,SAAL,GAAiB,KAAK,SAAL,EAAjB,GAAoC,CAAnD;AACA,mBAAO,KAAK,KAAL,CAAW,KAAX,IAAoB,MAA3B;AACD;;AACD;AAAS;AACP,mBAAO,KAAK,KAAL,CAAW,KAAX,CAAP;AACD;AAdH;AAgBD;;AACD,QAAI,SAAJ,EAAe;AACb,UAAM,MAAM,GAAG,KAAK,SAAL,GAAiB,KAAK,SAAL,KAAmB,CAApC,GAAwC,CAAvD;AACA,aAAO,KAAK,KAAL,CAAW,KAAX,IAAoB,MAA3B;AACD;;AACD,WAAO,KAAK,KAAL,CAAW,KAAX,CAAP;AACD,GA3BD;;AA6BA,8CAAU,KAAV,EAAuB;AACrB,QAAM,KAAK,GAAG,KAAK,KAAL,EAAd;AAEA,QAAM,KAAK,GAAG,KAAK,CAAC,CAAD,CAAnB;AACA,QAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAN,GAAe,CAAhB,CAAlB;AAEA,WAAO,KAAK,IAAI,IAAT,GAAgB,KAAK,IAAI,KAAT,IAAkB,KAAK,IAAI,IAA3C,GAAkD,KAAK,IAAI,IAAT,IAAiB,KAAK,IAAI,KAAnF;AACD,GAPD;;AA7DO,oBAAM,IAAN;AAqET;AAAC,CAtED;;AAAa;;AAkFA,6BAAqB,UAAC,OAAD,EAA6B;AAC7D,MAAM,MAAM,GAAgC,MAAM,CAAC,IAAP,CAAY,OAAZ,EAAqB,MAArB,CAC1C,UAAC,GAAD,EAAM,GAAN,EAAiB;;;AAAK,iCACjB,GADiB,IACd,YACL,GADK,IACC,WAAW,CAAC,MAAZ,CAAmB,OAAO,CAAC,GAAD,CAA1B,CADD,EACiC,EAFnB;AAGpB,GAJwC,EAK1C,EAL0C,CAA5C;AAQA,SAAO,sBACF,MADE,GACI;AACT,SAAK,EAAL,eAAM,KAAN,EAAkB,EAAlB,EAAyC;UAArB,+C;AAClB,aAAO,oBAAE,SAAF,CAAY,KAAZ,EAAmB,UAAC,KAAD,EAAQ,KAAR,EAAa;AAAK,qBAAM,CAAC,KAAD,CAAN,CAAc,KAAd,CAAoB,KAApB,EAA2B;AAAE,mBAAS,EAAtC;AAA2B,SAA3B;AAAyC,OAA9E,CAAP;AACD,KAHQ;AAKT,aAAS,EAAT,mBAAU,KAAV,EAAoB;AAClB,aAAO,oBAAE,KAAF,CAAQ,KAAR,EAAe,UAAC,KAAD,EAAQ,KAAR,EAAa;AAAK,qBAAM,CAAC,KAAD,CAAN,CAAc,SAAd;AAA8B,OAA/D,CAAP;AACD;AAPQ,GADJ,CAAP;AAUD,CAnBY,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxLb;;AACA;;AACA;;AACA;;AASA;;AACA;;AACA;;AAKA,SAAgB,iBAAhB,CAAqC,GAArC,EAA6C,OAA7C,EAAoE,YAApE,EAAsF;AACpF,MAAI,oBAAE,KAAF,CAAQ,GAAR,KAAgB,oBAAE,KAAF,CAAQ,OAAR,CAApB,EAAsC;AACpC,WAAO,YAAP;AACD;;AAED,MAAI,uBAAW,OAAX,CAAJ,EAAmC;AACjC,WAAO,oBAAE,GAAF,CAAM,GAAN,EAAW,OAAX,EAA8B,YAA9B,CAAP;AACD;;AAED,MAAI,oBAAE,UAAF,CAAa,OAAb,CAAJ,EAA2B;AACzB,WAAO,OAAO,CAAC,GAAD,CAAd;AACD;;AAED,SAAO,YAAP;AACD;;AAdD;;AAuBA,SAAgB,oBAAhB,CAAwC,IAAxC,EAAwD,GAAxD,EAAqE,IAArE,EAAmF,SAAnF,EAAsG;AACpG,MAAM,WAAW,GAAG,oBAAE,OAAF,CAAU,IAAV,EAAgB,iBAAK;AAAI,4BAAiB,CAAC,KAAD,EAAjB,GAAiB,CAAjB;AAA6B,GAAtD,CAApB;;AAEA,MAAI,IAAI,KAAK,QAAb,EAAuB;AACrB,QAAM,MAAM,GAAG,WAAW,CAAC,MAAZ,CAAmB,iBAAK;AAAI,kCAAS,KAAT,KAAmB,UAAU,CAA7B,KAA6B,CAA7B;AAAoC,KAAhE,CAAf;AAEA,WAAO,MAAM,CAAC,MAAP,GAAgB,CAAC,oBAAE,GAAF,CAAM,MAAN,CAAD,EAAgB,oBAAE,GAAF,CAAM,MAAN,CAAhB,CAAhB,GAAiD,CAAC,QAAD,EAAW,CAAC,QAAZ,CAAxD;AACD;;AAED,MAAM,YAAY,GAAG,SAAS,GAAG,WAAW,CAAC,MAAZ,CAAmB,iBAAK;AAAI,YAAC,oBAAE,KAAF,CAAD,KAAC,CAAD;AAAe,GAA3C,CAAH,GAAkD,WAAhF;AAGA,SAAO,YAAY,CAAC,GAAb,CAAiB,iBAAK;AAAI,WAAC,uBAAW,KAAX,KAAqB,KAAK,YAAY,IAAtC,GAA6C,KAA7C,GAAD;AAAyD,GAAnF,CAAP;AACD;;AAbD;;AAea,mCAA2B,UACtC,UADsC,EAEtC,KAFsC,EAGtC,aAHsC,EAItC,IAJsC,EAInB;AAEnB,MAAI,KAAK,GAAG,CAAC,CAAb;AACA,MAAM,GAAG,GAAG,KAAK,CAAC,MAAlB;;AAEA,MAAI,GAAG,GAAG,CAAV,EAAa;AACX,QAAI,IAAI,IAAI,IAAI,CAAC,QAAL,KAAkB,WAA1B,IAAyC,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,GAAL,CAAS,IAAI,CAAC,KAAL,CAAW,CAAX,IAAgB,IAAI,CAAC,KAAL,CAAW,CAAX,CAAzB,IAA0C,GAAnD,KAA2D,IAAxG,EAA8G;AACpG;;AAER,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAApB,EAAyB,CAAC,EAA1B,EAA8B;AAC5B,YAAM,MAAM,GAAG,CAAC,GAAG,CAAJ,GAAQ,aAAa,CAAC,CAAC,GAAG,CAAL,CAAb,CAAqB,UAA7B,GAA0C,aAAa,CAAC,GAAG,GAAG,CAAP,CAAb,CAAuB,UAAhF;AACA,YAAM,GAAG,GAAG,aAAa,CAAC,CAAD,CAAb,CAAiB,UAA7B;AACA,YAAM,KAAK,GAAG,CAAC,IAAI,GAAG,GAAG,CAAX,GAAe,aAAa,CAAC,CAAD,CAAb,CAAiB,UAAhC,GAA6C,aAAa,CAAC,CAAC,GAAG,CAAL,CAAb,CAAqB,UAAhF;AACA,YAAI,kBAAkB,SAAtB;;AAEA,YAAI,qBAAS,GAAG,GAAG,MAAf,MAA2B,qBAAS,KAAK,GAAG,GAAjB,CAA/B,EAAsD;AACpD,cAAM,YAAY,GAAG,EAArB;;AACA,cAAI,qBAAS,KAAK,GAAG,GAAjB,MAA0B,qBAAS,KAAK,CAAC,CAAD,CAAL,GAAW,KAAK,CAAC,CAAD,CAAzB,CAA9B,EAA6D;AAC3D,8BAAkB,GAAG,KAArB;AAEA,gBAAM,UAAU,GAAG,GAAG,GAAG,KAAK,CAAC,CAAD,CAAX,GAAiB,KAAK,CAAC,CAAD,CAAzC;AACA,wBAAY,CAAC,CAAD,CAAZ,GAAkB,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,CAAC,UAAU,GAAG,MAAd,IAAwB,CAA7C,CAAlB;AACA,wBAAY,CAAC,CAAD,CAAZ,GAAkB,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,CAAC,UAAU,GAAG,MAAd,IAAwB,CAA7C,CAAlB;AACD,WAND,MAMO;AACL,8BAAkB,GAAG,MAArB;AAEA,gBAAM,YAAY,GAAG,KAAK,GAAG,KAAK,CAAC,CAAD,CAAb,GAAmB,KAAK,CAAC,CAAD,CAA7C;AACA,wBAAY,CAAC,CAAD,CAAZ,GAAkB,IAAI,CAAC,GAAL,CAAS,GAAT,EAAc,CAAC,YAAY,GAAG,GAAhB,IAAuB,CAArC,CAAlB;AACA,wBAAY,CAAC,CAAD,CAAZ,GAAkB,IAAI,CAAC,GAAL,CAAS,GAAT,EAAc,CAAC,YAAY,GAAG,GAAhB,IAAuB,CAArC,CAAlB;AACD;;AACD,cAAM,YAAY,GAAG,CACnB,IAAI,CAAC,GAAL,CAAS,GAAT,EAAc,CAAC,kBAAkB,GAAG,GAAtB,IAA6B,CAA3C,CADmB,EAEnB,IAAI,CAAC,GAAL,CAAS,GAAT,EAAc,CAAC,kBAAkB,GAAG,GAAtB,IAA6B,CAA3C,CAFmB,CAArB;;AAKA,cACG,UAAU,GAAG,YAAY,CAAC,CAAD,CAAzB,IAAgC,UAAU,IAAI,YAAY,CAAC,CAAD,CAA3D,IACC,UAAU,IAAI,YAAY,CAAC,CAAD,CAA1B,IAAiC,UAAU,IAAI,YAAY,CAAC,CAAD,CAF9D,EAGE;AACG,0CAAH;AACA;AACD;AACF,SA3BD,MA2BO;AACL,cAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,KAAjB,CAAZ;AACA,cAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAT,EAAiB,KAAjB,CAAZ;;AAEA,cAAI,UAAU,GAAG,CAAC,GAAG,GAAG,GAAP,IAAc,CAA3B,IAAgC,UAAU,IAAI,CAAC,GAAG,GAAG,GAAP,IAAc,CAAhE,EAAmE;AAC9D,0CAAH;AACA;AACD;AACF;AACF;AACF,KA9CD,MA8CO;AAEL,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAApB,EAAyB,CAAC,EAA1B,EAA8B;AAC5B,YACG,CAAC,KAAK,CAAN,IAAW,UAAU,IAAI,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,UAAT,GAAsB,KAAK,CAAC,CAAC,GAAG,CAAL,CAAL,CAAa,UAApC,IAAkD,CAA5E,IACC,CAAC,GAAG,CAAJ,IACC,CAAC,GAAG,GAAG,GAAG,CADX,IAEC,UAAU,GAAG,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,UAAT,GAAsB,KAAK,CAAC,CAAC,GAAG,CAAL,CAAL,CAAa,UAApC,IAAkD,CAFhE,IAGC,UAAU,IAAI,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,UAAT,GAAsB,KAAK,CAAC,CAAC,GAAG,CAAL,CAAL,CAAa,UAApC,IAAkD,CAJlE,IAKC,CAAC,KAAK,GAAG,GAAG,CAAZ,IAAiB,UAAU,GAAG,CAAC,KAAK,CAAC,CAAD,CAAL,CAAS,UAAT,GAAsB,KAAK,CAAC,CAAC,GAAG,CAAL,CAAL,CAAa,UAApC,IAAkD,CANnF,EAOE;AACG,gCAAH;AACA;AACD;AACF;AACF;AACF,GA/DD,MA+DO;AACL,SAAK,GAAG,CAAR;AACD;;AAED,SAAO,KAAP;AACD,CA7EY;;AAoFA,oCAA4B,UAAC,IAAD,EAAmB;AAEhD;AAEJ;AAAA,MAAE,kBAAF;AAAA,MAAU,cAAV;AACN,MAAI,MAAJ;;AAEA,UAAQ,WAAR;AACE,SAAK,MAAL;AACE,YAAM,GAAG,MAAT;AACA;;AACF,SAAK,MAAL;AACA,SAAK,OAAL;AACE,YAAM,GAAG,MAAM,IAAI,MAAM,KAAK,MAArB,GAA8B,MAA9B,GAAuC,IAAhD;AACA;;AACF;AACE,YAAM,GAAG,IAAT;AACA;AAVJ;;AAaA,SAAO,MAAP;AACD,CArBY;;AA8BA,yBAAiB,UAAC,EAAD,EAU7B;MATC,sB;MACA,kD;MACA,4B;MACA,gC;AAOA,MAAM,UAAU,GAAG,6BAAgB,QAAhB,EAA0B,oBAAO,WAAjC,CAAnB;;AACA,MAAI,CAAC,UAAL,EAAiB;AACf,WAAO,IAAP;AACD;;AAED,MAAI,UAAJ;;AACA,MAAI,UAAU,CAAC,KAAX,IAAoB,UAAU,CAAC,KAAX,CAAiB,OAAzC,EAAkD;AAChD,cAAU,GAAG,UAAU,CAAC,KAAX,IAAoB,UAAU,CAAC,KAAX,CAAiB,OAAlD;AACD,GAFD,MAEO,IAAI,aAAa,KAAK,UAAtB,EAAkC;AACvC,cAAU,GAAG,CAAC,sBAAsB,IAAI,EAA3B,EAA+B,MAA/B,CAAsC,UAAC,MAAD,EAAS,EAAT,EAAwB;UAAb,c;UAAM,gB;AAClE,UAAM,IAAI,GAAG,KAAK,CAAC,OAAN,IAAiB,KAAK,CAAC,IAAvB,IAA+B,EAA5C;AAEA,aAAO,MAAM,CAAC,MAAP,CACL,IAAI,CAAC,GAAL,CAAS,UAAC,KAAD,EAAW;AAAK,eAAC;AACxB,cAAI,EAAE,UAAU,CAAC,KAAX,CAAiB,QAAjB,IAA6B,IAAI,CAAC,KAAL,CAAW,UADtB;AAExB,eAAK,EAAE,KAAK,CAAC,IAFW;AAGxB,eAAK,EAAE,KAAK,CAAC,IAHW;AAIxB,iBAAO,EAAE;AAJe,SAAD;AAKvB,OALF,CADK,CAAP;AAQD,KAXY,EAWV,EAXU,CAAb;AAYD,GAbM,MAaA;AACL,cAAU,GAAG,CAAC,sBAAsB,IAAI,EAA3B,EAA+B,GAA/B,CAAmC,UAAC,EAAD,EAAS;UAAN,c;AAC3C;AAAA,UAAE,oBAAF;AAAA,UAAW,cAAX;AAAA,UAAiB,0BAAjB;AAAA,UAA6B,cAA7B;AAEN,aAAO;AACL,gBAAQ,EAAE,IADL;AAEL,eAAO,SAFF;AAGL,YAAI,EAAE,UAAU,CAAC,KAAX,CAAiB,QAAjB,IAA6B,UAA7B,IAA2C,QAH5C;AAIL,aAAK,EAAE,kCAA0B,IAA1B,CAJF;AAKL,aAAK,EAAE,IAAI,IAAI,OALV;AAML,eAAO,EAAE,IAAI,CAAC;AANT,OAAP;AAQD,KAXY,CAAb;AAYD;;AAED,wCACK,UAAU,CAAC,KADhB,GAEK,oBAAO,aAAP,CAAqB,UAArB,EAAiC,WAAjC,CAFL,GAEkD;AAChD,WAAO,EAAE,UADuC;AAEhD,QAAI,EAAE;AAF0C,GAFlD;AAMD,CArDY;;AA2DA,yBAAiB,UAAC,EAAD,EAM7B;MALC,uB;MACA,mB;MAAA,qC;;AAKA,MAAI,CAAC,WAAL,EAAkB;AAChB,WAAO,EAAP;AACD;;AAED,MAAM,MAAM,GAAwB,EAApC;AACA,MAAM,cAAc,GAAG,MAAM,CAAC,IAAP,CAAY,WAAZ,CAAvB;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,cAAc,CAAC,MAArC,EAA6C,CAAC,GAAG,GAAjD,EAAsD,CAAC,EAAvD,EAA2D;AACzD,QAAM,GAAG,GAAG,WAAW,CAAC,cAAc,CAAC,CAAD,CAAf,CAAX,CAA+B,WAA3C;AACA,QAAM,QAAQ,GAAG,MAAM,CAAC,IAAP,CAAY,GAAZ,CAAjB;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,IAAI,GAAG,QAAQ,CAAC,MAAhC,EAAwC,CAAC,GAAG,IAA5C,EAAkD,CAAC,EAAnD,EAAuD;AAC/C;AAAA,UAAE,gBAAF;AAAA,UAAS,0BAAT;AAEN,UAAM,QAAQ,GAAG,KAAK,CAAC,MAAN,CAAa,UAAC,IAAD,EAAU;AAAK,2CAAe,IAAI,CAAC,IAApB,EAA0B,OAA1B,CAAkC,KAAlC;AAA6C,OAAzE,CAAjB;;AAEA,UAAI,QAAQ,IAAI,QAAQ,CAAC,MAAzB,EAAiC;AACvB;AACR,YAAM,MAAM,GAAG,QAAQ,CAAC,CAAD,CAAR,CAAY,KAAZ,CAAkB,UAAlB,CAAf;;AAEA,YAAI,CAAC,MAAM,CAAC,MAAD,CAAX,EAAqB;AACnB,gBAAM,CAAC,MAAD,CAAN,GAAiB,EAAjB;AACD;;AAED,cAAM,CAAC,MAAD,CAAN,CAAe,IAAf,CAAoB;AAClB,cAAI,EAAE,QAAQ,CAAC,CAAD,CADI;AAElB,mBAAS,EAAE,QAAQ,CAAC,KAAT,CAAe,CAAf,CAFO;AAGlB,iBAAO,EAAE,oBAAE,KAAF,CAAQ,QAAR,IAAoB,UAApB,GAAiC;AAHxB,SAApB;AAKD;AACF;AACF;;AAED,SAAO,MAAP;AACD,CAzCY;;AAkDA,yBAAiB,UAAC,EAAD,EAY7B;MAXC,kB;MACA,kC;MACA,sB;MACA,gB;MAAA,kC;MACA,0B;AAQA,MAAM,GAAG,GAAG,QAAQ,CAAC,MAArB;AACA,MAAI,GAAG,GAAG,CAAV,EAAa,OAAO,IAAP;AAEb,MAAI,UAAU,GAAG,4BAAgB,MAAhB,EAAwB,QAAxB,EAAkC,CAAlC,EAAqC,IAArC,CAAjB;AACA,MAAI,MAAJ;;AAGA,MAAI,QAAQ,CAAC,CAAD,CAAR,CAAY,OAAZ,KAAwB,CAAC,QAAQ,CAAC,CAAD,CAAR,CAAY,OAAzC,EAAkD;AAChD,QAAI,SAAO,GAAG,KAAd;AACA,QAAI,aAAW,GAAG,QAAQ,GAAG,GAA7B;AACA,QAAI,GAAG,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAC,GAAD,EAAM,KAAN,EAAW;AAAK,gBAAG,GAAG,KAAK,CAAC,OAAZ;AAAwB,KAAxD,EAA0D,CAA1D,CAAV;AACA,OAAG,IAAI,CAAC,GAAG,GAAG,CAAP,IAAY,UAAnB;;AAEA,QAAI,GAAG,IAAI,QAAX,EAAqB;AACnB,SAAG,IAAI,CAAC,GAAG,GAAG,CAAP,IAAY,UAAnB;AACA,gBAAU,GAAG,CAAb;AACD;;AACD,QAAI,GAAG,IAAI,QAAP,IAAmB,aAAW,GAAG,CAArC,EAAwC;AACtC,eAAO,GAAG,IAAV;AACA,mBAAW,IAAI,GAAf;AACA,SAAG,GAAG,GAAG,GAAG,aAAZ;AACD;;AAED,QAAM,MAAM,GAAI,CAAC,QAAQ,GAAG,GAAZ,IAAmB,CAApB,IAA0B,CAAzC;AACA,QAAI,MAAI,GAAG;AAAE,YAAM,EAAE,MAAM,GAAG,UAAnB;AAA+B,UAAI,EAAE;AAArC,KAAX;AAEA,UAAM,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAC,GAAD,EAAM,KAAN,EAAW;AAClC,UAAM,MAAM,kBACP,GADO,EACJ,CACN;AACE,YAAI,EAAE,KAAK,CAAC,IADd;AAEE,gBAAQ,EAAE;AACR,gBAAM,EAAE,MAAI,CAAC,MAAL,GAAc,MAAI,CAAC,IAAnB,GAA0B,UAD1B;AAER,cAAI,EAAE,SAAO,GAAG,aAAH,GAAiB,KAAK,CAAC;AAF5B;AAFZ,OADM,CADI,CAAZ;;AAWA,YAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAP,GAAgB,CAAjB,CAAN,CAA0B,QAAjC;;AAEA,UAAI,KAAK,CAAC,SAAN,IAAmB,KAAK,CAAC,SAAN,CAAgB,MAAvC,EAA+C;AAC7C,aAAK,CAAC,SAAN,CAAgB,OAAhB,CAAwB,UAAC,IAAD,EAAU;AAChC,gBAAM,CAAC,IAAP,CAAY;AAAE,gBAAI,MAAN;AAAQ,oBAAQ,EAAE;AAAlB,WAAZ;AACD,SAFD;AAGD;;AACD,aAAO,MAAP;AACD,KApBQ,EAoBN,EApBM,CAAT;AAqBD,GAxCD,MAwCO;AACL,QAAM,QAAM,GAAG,4BAAgB,cAAhB,EAAgC,QAAhC,EAA0C,CAA1C,EAA6C,IAA7C,CAAf;;AAEA,QAAI,QAAQ,GAAG,IAAI,QAAf,GAAwB,CAAC,GAAG,GAAG,CAAP,IAAY,UAApC,IAAkD,CAAtD,EAAyD;AACvD,gBAAU,GAAG,CAAb;AACD;;AAED,QAAI,cAAY,GAAG,CAAC,QAAQ,GAAG,IAAI,QAAf,GAAwB,CAAC,GAAG,GAAG,CAAP,IAAY,UAArC,IAAmD,GAAtE;;AACA,QAAI,cAAY,GAAG,CAAnB,EAAsB;AACpB,oBAAY,KAAK,CAAjB;AACD;;AACD,QAAM,MAAI,GAAG,UAAU,KAAK,CAAC,UAAhB,GAA6B,IAAI,CAAC,GAAL,CAAS,cAAT,EAAuB,UAAvB,CAA7B,GAAkE,cAA/E;AAEA,UAAM,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAC,GAAD,EAAM,KAAN,EAAa,CAAb,EAAc;AACrC,UAAM,MAAM,kBACP,GADO,EACJ,CACN;AACE,YAAI,EAAE,KAAK,CAAC,IADd;AAEE,gBAAQ,EAAE;AACR,gBAAM,EAAE,QAAM,GAAG,CAAC,cAAY,GAAG,UAAhB,IAA8B,CAAvC,GAA2C,CAAC,cAAY,GAAG,MAAhB,IAAwB,CADnE;AAER,cAAI;AAFI;AAFZ,OADM,CADI,CAAZ;;AAWA,UAAI,KAAK,CAAC,SAAN,IAAmB,KAAK,CAAC,SAAN,CAAgB,MAAvC,EAA+C;AAC7C,aAAK,CAAC,SAAN,CAAgB,OAAhB,CAAwB,UAAC,IAAD,EAAU;AAChC,gBAAM,CAAC,IAAP,CAAY;AAAE,gBAAI,MAAN;AAAQ,oBAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,MAAP,GAAgB,CAAjB,CAAN,CAA0B;AAA5C,WAAZ;AACD,SAFD;AAGD;;AACD,aAAO,MAAP;AACD,KAlBQ,EAkBN,EAlBM,CAAT;AAmBD;;AAED,SAAO,MAAP;AACD,CA/FY;;AAiGA,+BAAuB,UAAC,MAAD,EAAc,KAAd,EAAmD,KAAnD,EAA+D,SAA/D,EAA6E;;;AACvG;AAAA,MAAU,mBAAV;AAAA,MAAiB,qBAAjB;AACR,MAAM,WAAW,GAAG,KAAK,IAAI,MAAM,CAAC,IAAP,IAAe,CAAnB,CAAL,IAA8B,MAAM,CAAC,KAAP,IAAgB,CAA9C,CAApB;AAEA,MAAM,WAAW,GAAG,uBAAe;AAAE,YAAQ,UAAV;AAAY,eAAW;AAAvB,GAAf,CAApB;AACA,MAAI,SAAS,GAAG,MAAhB;;AAEA,MAAI,WAAJ,EAAiB;AACf,QAAM,GAAG,GAAG,SAAS,IAAI,EAAzB;AACQ;AAAA,QAAO,yCAAP;AAAA,QAAsB,2BAAtB;;AAER,QAAI,CAAC,MAAM,KAAK,UAAX,IAA0B,MAAM,KAAK,YAAX,IAA2B,aAAa,KAAK,QAAxE,KAAsF,qBAAS,MAAM,CAAC,KAAD,CAAf,CAA1F,EAAmH;AACjH,eAAS,yBAAQ,MAAR,IAAc,YAAG,KAAH,IAAW,SAAS,CAAC,KAAD,CAAT,IAAoB,GAAG,CAAC,KAAJ,IAAa,CAAjC,CAAX,EAA8C,EAA5D,EAAT;AACD;;AAED,QAAI,CAAC,MAAM,KAAK,YAAX,IAA4B,MAAM,KAAK,UAAX,IAAyB,KAAK,KAAK,QAAhE,KAA8E,qBAAS,MAAM,CAAC,aAAD,CAAf,CAAlF,EAAmH;AACjH,eAAS,yBAAQ,MAAR,IAAc,YAAG,aAAH,IAAmB,SAAS,CAAC,aAAD,CAAT,IAA4B,GAAG,CAAC,MAAJ,IAAc,CAA1C,CAAnB,EAA+D,EAA7E,EAAT;AACD;AACF;;AAED,SAAO,SAAP;AACD,CArBY;;AAuBA,+BAAuB,UAAC,IAAD,EAAc,IAAd,EAAyB,OAAzB,EAAuC,QAAvC,EAA0D;AACpF;AACR,MAAM,SAAS,GAAG,2BAAc,QAAd,EAAwB,UAAxB,EAAoC,MAApC,CAA2C,UAAC,aAAD,EAAmB;AACtE;AAER,WAAO,oBAAE,KAAF,CAAQ,SAAR,KAAsB,oBAAE,KAAF,CAAQ,QAAR,CAAtB,GAA0C,IAA1C,GAAiD,QAAQ,CAAC,OAAT,CAAiB,SAAjB,KAA+B,CAAvF;AACD,GAJiB,CAAlB;;AAMA,MAAI,SAAS,IAAI,SAAS,CAAC,MAA3B,EAAmC;AACjC,QAAM,MAAI,GAAG,SAAS,CAAC,GAAV,CAAc,UAAC,aAAD,EAAmB;AAAK,0BAAa,CAAC,KAAd;AAA2B,KAAjE,CAAb;AAEA,WAAO,IAAI,CAAC,MAAL,CACL,UAAC,MAAD,EAAS,KAAT,EAAc;AACZ,UAAM,UAAU,GAAG,iBAAiB,CAAC,KAAD,EAAQ,OAAR,EAAiB,CAAjB,CAApC;AACA,UAAM,SAAS,GAAG,oBAAE,OAAF,CAAU,UAAV,IAAwB,CAAC,oBAAE,GAAF,CAAM,UAAN,CAAD,EAAoB,oBAAE,GAAF,CAAM,UAAN,CAApB,CAAxB,GAAiE,CAAC,UAAD,EAAa,UAAb,CAAnF;AACA,UAAM,WAAW,GAAG,MAAI,CAAC,MAAL,CAClB,UAAC,YAAD,EAAiC,CAAjC,EAAuC;AACrC,YAAM,UAAU,GAAG,iBAAiB,CAAC,KAAD,EAAQ,CAAR,EAAW,CAAX,CAApC;AACA,YAAM,UAAU,GAAG,SAAS,CAAC,CAAD,CAAT,GAAe,IAAI,CAAC,GAAL,CAAS,oBAAE,OAAF,CAAU,UAAV,IAAwB,UAAU,CAAC,CAAD,CAAlC,GAAwC,UAAjD,CAAlC;AACA,YAAM,UAAU,GAAG,SAAS,CAAC,CAAD,CAAT,GAAe,IAAI,CAAC,GAAL,CAAS,oBAAE,OAAF,CAAU,UAAV,IAAwB,UAAU,CAAC,CAAD,CAAlC,GAAwC,UAAjD,CAAlC;AAEA,eAAO,CAAC,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,YAAY,CAAC,CAAD,CAAjC,CAAD,EAAwC,IAAI,CAAC,GAAL,CAAS,UAAT,EAAqB,YAAY,CAAC,CAAD,CAAjC,CAAxC,CAAP;AACD,OAPiB,EAQlB,CAAC,QAAD,EAAW,CAAC,QAAZ,CARkB,CAApB;AAWA,aAAO,CAAC,IAAI,CAAC,GAAL,CAAS,WAAW,CAAC,CAAD,CAApB,EAAyB,MAAM,CAAC,CAAD,CAA/B,CAAD,EAAsC,IAAI,CAAC,GAAL,CAAS,WAAW,CAAC,CAAD,CAApB,EAAyB,MAAM,CAAC,CAAD,CAA/B,CAAtC,CAAP;AACD,KAhBI,EAiBL,CAAC,QAAD,EAAW,CAAC,QAAZ,CAjBK,CAAP;AAmBD;;AAED,SAAO,IAAP;AACD,CAjCY;;AAkCA,+BAAuB,UAAC,IAAD,EAAc,KAAd,EAA4B,OAA5B,EAA0C,QAA1C,EAA4D;AAC9F,MAAM,OAAO,GAAG,KAAK,CAClB,GADa,CACT,gBAAI;AAAI,wCAAqB,IAArB,EAA2B,IAA3B,EAAiC,OAAjC;AAAmD,GADlD,EAEb,MAFa,CAEN,iBAAK;AAAI,YAAC,oBAAE,KAAF,CAAD,KAAC,CAAD;AAAe,GAFlB,CAAhB;;AAIA,MAAI,OAAO,IAAI,OAAO,CAAC,MAAvB,EAA+B;AAC7B,WAAO,OAAO,CAAC,MAAR,CAAe,UAAC,MAAD,EAAS,KAAT,EAAc;AAAK,cAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAAK,CAAC,CAAD,CAAzB,CAAD,EAAgC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAAK,CAAzD,CAAyD,CAAzB,CAAhC;AAA8D,KAAhG,EAAkG,CACvG,QADuG,EAEvG,CAAC,QAFsG,CAAlG,CAAP;AAID;;AAED,SAAO,IAAP;AACD,CAbY;;AAsBA,uCAA+B,UAAC,IAAD,EAAc,KAAd,EAA4B,IAA5B,EAA0C,SAA1C,EAA6D;AACvG,MAAM,OAAO,GAAG,KAAK,CAAC,GAAN,CAAU,gBAAI;AACpB;;AAER,QAAI,IAAI,KAAK,QAAT,IAAqB,OAAzB,EAAkC;AAChC,aAAO,6BAAqB,IAArB,EAA2B,IAA3B,EAAiC,OAAjC,KAA6C,oBAAoB,CAAC,IAAD,EAAO,OAAP,EAAgB,IAAhB,EAAsB,SAAtB,CAAxE;AACD;;AACD,WAAO,oBAAoB,CAAC,IAAD,EAAO,OAAP,EAAgB,IAAhB,EAAsB,SAAtB,CAA3B;AACD,GAPe,CAAhB;;AASA,MAAI,IAAI,KAAK,QAAb,EAAuB;AAErB,WAAO,OAAO,CAAC,MAAR,CAAe,UAAC,MAAD,EAAS,KAAT,EAAc;AAAK,cAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAAK,CAAC,CAAD,CAAzB,CAAD,EAAgC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAAK,CAAzD,CAAyD,CAAzB,CAAhC;AAA8D,KAAhG,EAAkG,CACvG,QADuG,EAEvG,CAAC,QAFsG,CAAlG,CAAP;AAID;;AAED,MAAM,GAAG,GAAwB,EAAjC;AAEA,SAAO,OAAO,CAAC,MAAR,CAAe,UAAC,MAAD,EAAS,KAAT,EAAc;AAClC,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,KAAK,CAAC,MAA5B,EAAoC,CAAC,GAAG,GAAxC,EAA6C,CAAC,EAA9C,EAAkD;AAChD,UAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,CAAR,EAAoB;AAClB,WAAG,CAAC,KAAK,CAAC,CAAD,CAAN,CAAH,GAAgB,IAAhB;AAEA,cAAM,CAAC,IAAP,CAAY,KAAK,CAAC,CAAD,CAAjB;AACD;AACF;;AACD,WAAO,MAAP;AACD,GATM,EASJ,EATI,CAAP;AAUD,CA9BY;;AAgCA,4BAAoB,UAAC,MAAD,EAAuC,QAAvC,EAAyD;AACxF,SAAC,MAAM,KAAK,YAAX,IAA2B,QAAQ,KAAK,OAAzC,IACC,MAAM,KAAK,UAAX,IAAyB,QAAQ,KAAK,OADvC,IAEC,MAAM,KAAK,SAAX,IAAwB,QAAQ,KAAK,WAFtC,IAGC,MAAM,KAAK,QAAX,IAAuB,QAAQ,KAAK,YAHrC;AAGkD,CAJvC;;AAaA,+BAAuB,UAAC,KAAD,EAAyB,GAAzB,EAAsC,GAAtC,EAAiD;AACnF,MAAI,MAAJ,EAAY,MAAZ;AAEA,MAAM,MAAM,GAAG,KAAK,CAAC,GAAN,CAAU,iBAAK;AAC5B,QAAI,KAAK,CAAC,UAAN,KAAqB,GAAzB,EAA8B;AAC5B,YAAM,GAAG,IAAT;AACD;;AACD,QAAI,KAAK,CAAC,UAAN,KAAqB,GAAzB,EAA8B;AAC5B,YAAM,GAAG,IAAT;AACD;;AAED,WAAO,KAAK,CAAC,UAAb;AACD,GATc,CAAf;;AAWA,MAAI,CAAC,MAAL,EAAa;AACX,UAAM,CAAC,IAAP,CAAY,GAAZ;AACD;;AACD,MAAI,CAAC,MAAL,EAAa;AACX,UAAM,CAAC,IAAP,CAAY,GAAZ;AACD;;AAED,SAAO,MAAP;AACD,CAtBY;;AA+BA,yBAAiB,UAAC,IAAD,EAAY,MAAZ,EAA8B,KAA9B,EAA6C;AACzE,MAAI,CAAC,IAAL,EAAW,OAAO,IAAP;AACH;AACA;AAAA,MAAiB,gBAAjB;AAAA,MAAuB,kBAAvB;AACR,MAAI,MAAM,GAAG,CAAC,MAAM,IAAI,KAAX,KAAqB,IAAI,KAAK,UAA9B,IAA4C,KAAK,CAAC,SAAlD,GAA8D,KAAK,CAAC,SAAN,KAAoB,CAAlF,GAAsF,CAAnG;AACA,QAAM,GAAG,IAAI,CAAC,QAAL,KAAkB,WAAlB,GAAgC,qBAAS,KAAK,CAAC,CAAD,CAAL,GAAW,KAAK,CAAC,CAAD,CAAzB,IAAgC,CAAhC,GAAoC,MAApE,GAA6E,MAAtF;;AAGA,MAAI,MAAM,KAAK,IAAI,CAAC,KAAL,IAAc,IAAI,CAAC,SAAxB,CAAV,EAA8C;AAC5C,WAAO,CAAC,IAAI,CAAC,KAAL,IAAc,IAAI,CAAC,SAApB,EAA+B,GAA/B,CAAmC,UAAC,KAAD,EAAgB;AACxD,UAAM,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC,OAAhB,CAAwB,KAAxB,CAAH,GAAoC,KAAxE;AAEA,aAAO;AACL,kBAAU,EAAE,KAAK,CAAC,YAAD,CAAL,GAAsB,MAD7B;AAEL,aAAK,EAAE,KAFF;AAGL,cAAM;AAHD,OAAP;AAKD,KARM,CAAP;AASD;;AAGD,MAAI,IAAI,CAAC,aAAL,IAAsB,IAAI,CAAC,iBAA/B,EAAkD;AAChD,WAAO,IAAI,CAAC,iBAAL,CAAuB,GAAvB,CAA2B,UAAC,KAAD,EAAa,KAAb,EAA0B;AAAK,aAAC;AAChE,kBAAU,EAAE,KAAK,CAAC,KAAD,CAAL,GAAe,MADqC;AAEhE,aAAK,EAAE,KAFyD;AAGhE,aAAK,OAH2D;AAIhE,cAAM;AAJ0D,OAAD;AAK/D,KALK,CAAP;AAMD;;AAED,MAAI,KAAK,CAAC,KAAN,IAAe,CAAC,KAApB,EAA2B;AACzB,WAAO,KAAK,CACT,KADI,CACE,IAAI,CAAC,SADP,EAEJ,GAFI,CAEA,UAAC,KAAD,EAAW;AAAK,aAAC;AAAE,kBAAU,EAAE,KAAK,CAAC,KAAD,CAAL,GAAe,MAA7B;AAAqC,aAAK,EAAE,KAA5C;AAAmD,cAAM,EAA1D;AAAC,OAAD;AAA6D,KAF7E,CAAP;AAGD;;AAGD,SAAO,KAAK,CAAC,MAAN,GAAe,GAAf,CAAmB,UAAC,KAAD,EAAa,KAAb,EAA0B;AAAK,WAAC;AACxD,gBAAU,EAAE,KAAK,CAAC,KAAD,CAAL,GAAe,MAD6B;AAExD,WAAK,EAAE,eAAe,GAAG,eAAe,CAAC,KAAD,CAAlB,GAA4B,KAFM;AAGxD,WAAK,OAHmD;AAIxD,YAAM;AAJkD,KAAD;AAKvD,GALK,CAAP;AAMD,CA3CY;;AAoDA,+BAAuB,UAAC,cAAD,EAA2B,aAA3B,EAAoD,YAApD,EAA0E;AAC5G,MAAI,iBAAJ;;AAEA,MAAI,oBAAE,UAAF,CAAa,YAAb,CAAJ,EAAgC;AAC9B,qBAAiB,GAAG,YAApB;AACD,GAFD,MAEO,IAAI,oBAAE,UAAF,CAAa,aAAb,CAAJ,EAAiC;AACtC,qBAAiB,GAAG,aAApB;AACD;;AAED,MAAI,oBAAE,UAAF,CAAa,cAAb,KAAgC,iBAApC,EAAuD;AACrD,WAAO,UAAC,IAAD,EAAY,IAAZ,EAAuB,IAAvB,EAAkC,IAAlC,EAA2C;AAChD,UAAI,oBAAE,UAAF,CAAa,cAAb,CAAJ,EAAkC;AAChC,sBAAc,CAAC,IAAD,EAAO,IAAP,EAAa,IAAb,EAAmB,IAAnB,CAAd;AACD;;AACD,UAAI,oBAAE,UAAF,CAAa,iBAAb,CAAJ,EAAqC;AACnC,yBAAiB,CAAC,IAAD,EAAO,IAAP,EAAa,IAAb,EAAmB,IAAnB,CAAjB;AACD;AACF,KAPD;AAQD;;AAED,SAAO,IAAP;AACD,CArBY;;AA4BA,qBAAa,UAAC,IAAD,EAAY,SAAZ,EAA6B;AAC7C;AAAA,MAAO,gBAAP;AAAA,MAAa,oBAAb;AAAA,MAAqB,wBAArB;;AACR,MAAI,KAAK,KAAK,MAAd,EAAsB;AACpB,QAAI,MAAM,KAAK,QAAX,IAAuB,QAAQ,KAAK,YAAxC,EAAsD;AACpD,aAAO;AAAE,aAAK,EAAE,QAAQ,CAAC,SAAT,EAAT;AAA+B,qBAAa,EAAE;AAA9C,OAAP;AACD;;AACD,QAAI,MAAM,KAAK,QAAX,IAAuB,QAAQ,KAAK,WAAxC,EAAqD;AACnD,aAAO;AAAE,aAAK,EAAE,QAAQ,CAAC,WAAT,EAAT;AAAiC,qBAAa,EAAE;AAAhD,OAAP;AACD;;AAED,QACE,IAAI,KAAK,UAAT,IACA,SADA,KAEC,SAAS,CAAC,OAAV,CAAkB,WAAlB,KAAkC,CAAlC,IACC,SAAS,CAAC,OAAV,CAAkB,WAAlB,KAAkC,CADnC,IAEC,SAAS,CAAC,OAAV,CAAkB,eAAlB,KAAsC,CAJxC,CADF,EAME;AACA,aAAO;AAAE,aAAK,EAAE,QAAQ,CAAC,UAAT,EAAT;AAAgC,qBAAa,EAAE;AAA/C,OAAP;AACD;;AACD,QAAI,IAAI,KAAK,UAAb,EAAyB;AACvB,aAAO;AAAE,aAAK,EAAE,QAAQ,CAAC,SAAT,EAAT;AAA+B,qBAAa,EAAE;AAA9C,OAAP;AACD;;AAED,WAAO;AAAE,WAAK,EAAE,QAAQ,CAAC,WAAT,EAAT;AAAiC,mBAAa,EAAE;AAAhD,KAAP;AACD;;AACD,MAAI,oBAAE,QAAF,CAAW,KAAX,CAAJ,EAAuB;AACrB,QAAM,MAAI,GAAG,UAAQ,oBAAE,UAAF,CAAa,KAAb,CAArB;AAEA,WAAO;AACL,WAAK,EAAE,CAAE,QAAgC,CAAC,MAAD,CAAhC,IAA0C,QAAQ,CAAC,UAArD,GADF;AAEL,mBAAa,EAAG,QAAgC,CAAC,MAAD,CAAhC,GAAyC,MAAzC,GAAgD;AAF3D,KAAP;AAID;;AAED,SAAO,oBAAE,UAAF,CAAa,KAAb,IAAsB;AAAE,SAAK;AAAP,GAAtB,GAAkC;AAAE,SAAK,EAAE,QAAQ,CAAC,UAAT,EAAT;AAAgC,iBAAa,EAAE;AAA/C,GAAzC;AACD,CAnCY;;AAoCb,IAAM,GAAG,GAAG,IAAZ;;AACa,6BAAqB,UAAC,KAAD,EAAW;AAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAN,EAAf;;AAEA,MAAI,CAAC,MAAD,IAAW,MAAM,CAAC,MAAP,IAAiB,CAAhC,EAAmC;AACjC;AACD;;AAED,MAAM,GAAG,GAAG,MAAM,CAAC,MAAnB;AACA,MAAM,KAAK,GAAG,KAAK,CAAC,KAAN,EAAd;AACA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,KAAK,CAAC,CAAD,CAAd,EAAmB,KAAK,CAAC,CAAD,CAAxB,IAA+B,GAA3C;AACA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,KAAK,CAAC,CAAD,CAAd,EAAmB,KAAK,CAAC,CAAD,CAAxB,IAA+B,GAA3C;AACA,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAD,CAAP,CAAnB;AACA,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,CAAP,CAAP,CAAlB;;AAEA,MAAI,KAAK,GAAG,GAAR,IAAe,KAAK,GAAG,GAAvB,IAA8B,IAAI,GAAG,GAArC,IAA4C,IAAI,GAAG,GAAvD,EAA4D;AAC1D,SAAK,CAAC,MAAN,CAAa,CAAC,MAAM,CAAC,CAAD,CAAP,EAAY,MAAM,CAAC,GAAG,GAAG,CAAP,CAAlB,CAAb;AACD;AACF,CAjBY;;AAmBA,4BAAoB,UAAC,WAAD,EAAqB,KAArB,EAAqC;AACpE,MAAI,CAAC,WAAL,EAAkB;AAChB,WAAO,IAAP;AACD;;AAED,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,WAAW,CAAC,MAAlC,EAA0C,CAAC,GAAG,GAA9C,EAAmD,CAAC,EAApD,EAAwD;AACtD,QAAI,WAAW,CAAC,CAAD,CAAX,CAAe,IAAf,KAAwB,KAA5B,EAAmC;AACjC,aAAO,WAAW,CAAC,CAAD,CAAX,CAAe,QAAtB;AACD;AACF;;AAED,SAAO,IAAP;AACD,CAZY;;AAcA,2BAAmB,UAAC,KAAD,EAAe,MAAf,EAA4B;AAC1D,MAAI,CAAC,MAAD,IAAW,MAAM,CAAC,MAAP,KAAkB,CAA7B,IAAkC,CAAC,qBAAS,MAAM,CAAC,CAAD,CAAf,CAAnC,IAA0D,CAAC,qBAAS,MAAM,CAAC,CAAD,CAAf,CAA/D,EAAoF;AAClF,WAAO,KAAP;AACD;;AAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAZ;AACA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAZ;AAEA,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,EAAW,KAAK,CAAC,CAAD,CAAhB,CAAf;;AACA,MAAI,CAAC,qBAAS,KAAK,CAAC,CAAD,CAAd,CAAD,IAAuB,KAAK,CAAC,CAAD,CAAL,GAAW,GAAtC,EAA2C;AACzC,UAAM,CAAC,CAAD,CAAN,GAAY,GAAZ;AACD;;AAED,MAAI,CAAC,qBAAS,KAAK,CAAC,CAAD,CAAd,CAAD,IAAuB,KAAK,CAAC,CAAD,CAAL,GAAW,GAAtC,EAA2C;AACzC,UAAM,CAAC,CAAD,CAAN,GAAY,GAAZ;AACD;;AAED,MAAI,MAAM,CAAC,CAAD,CAAN,GAAY,GAAhB,EAAqB;AACnB,UAAM,CAAC,CAAD,CAAN,GAAY,GAAZ;AACD;;AAED,MAAI,MAAM,CAAC,CAAD,CAAN,GAAY,GAAhB,EAAqB;AACnB,UAAM,CAAC,CAAD,CAAN,GAAY,GAAZ;AACD;;AAED,SAAO,MAAP;AACD,CA1BY;;AA6BA,qBAAa,UAAC,MAAD,EAAY;AACpC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAjB;;AACA,MAAI,CAAC,IAAI,CAAT,EAAY;AACV;AACD;;AAED,OAAK,IAAI,CAAC,GAAG,CAAR,EAAW,CAAC,GAAG,MAAM,CAAC,CAAD,CAAN,CAAU,MAA9B,EAAsC,CAAC,GAAG,CAA1C,EAA6C,EAAE,CAA/C,EAAkD;AAChD,QAAI,QAAQ,GAAG,CAAf;AACA,QAAI,QAAQ,GAAG,CAAf;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,CAApB,EAAuB,EAAE,CAAzB,EAA4B;AAC1B,UAAM,KAAK,GAAG,oBAAE,KAAF,CAAQ,MAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,CAAR,IAA2B,MAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,CAA3B,GAA6C,MAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,CAA3D;;AAGA,UAAI,KAAK,IAAI,CAAb,EAAgB;AACd,cAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,IAAkB,QAAlB;AACA,cAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,IAAkB,QAAQ,GAAG,KAA7B;AACA,gBAAQ,GAAG,MAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,CAAX;AACD,OAJD,MAIO;AACL,cAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,IAAkB,QAAlB;AACA,cAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,IAAkB,QAAQ,GAAG,KAA7B;AACA,gBAAQ,GAAG,MAAM,CAAC,CAAD,CAAN,CAAU,CAAV,EAAa,CAAb,CAAX;AACD;AAEF;AACF;AACF,CA1BY;;AA4Bb,IAAM,gBAAgB,GAAwB;AAC5C,MAAI,EAAE,kBADsC;AAE5C,QAAM,EAAE,4BAFoC;AAG5C,MAAI,EAAE,0BAHsC;AAI5C,YAAU,EAAE,gCAJgC;AAK5C,QAAM,EAAE;AALoC,CAA9C;;AAQa,yBAAiB,UAAC,IAAD,EAAY,UAAZ,EAA6B,UAA7B,EAA+C;AAC3E,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAX,CAAe,UAAC,IAAD,EAAU;AAAK,eAAI,CAAC,KAAL;AAAkB,GAAhD,CAAjB;AACA,MAAM,KAAK,GAAG,mBACX,IADW,CACN,QADM,EAEX,KAFW,CAEL,UAAC,CAAD,EAAI,GAAJ,EAAO;AAAK,eAAI,CAAC,GAAL,CAAS,CAAC,iBAAiB,CAAC,CAAD,EAAI,GAAJ,EAAS,CAAT,CAA3B;AAA0C,GAFjD,EAGX,KAHW,CAGL,yBAHK,EAIX,MAJW,CAIJ,gBAAgB,CAAC,UAAD,CAJZ,CAAd;AAMA,SAAO,KAAK,CAAC,IAAD,CAAZ;AACD,CATY;;AAWA,iCAAyB,UACpC,IADoC,EAEpC,MAFoC,EAGpC,aAHoC,EAIpC,UAJoC,EAKpC,UALoC,EAMpC,iBANoC,EAMV;AAE1B,MAAI,CAAC,IAAL,EAAW;AACT,WAAO,IAAP;AACD;;AAGD,MAAM,KAAK,GAAG,iBAAiB,GAAG,MAAM,CAAC,OAAP,EAAH,GAAsB,MAArD;AAEA,MAAM,WAAW,GAAG,KAAK,CAAC,MAAN,CAAa,UAAC,MAAD,EAAS,IAAT,EAAa;;;AACtC;AAAA,QAAE,oBAAF;AAAA,QAAW,cAAX;;AAEN,QAAI,IAAJ,EAAU;AACR,aAAO,MAAP;AACD;;AAED,QAAM,MAAM,GAAG,IAAI,CAAC,KAAL,CAAW,aAAX,CAAf;AACA,QAAM,WAAW,GAAG,MAAM,CAAC,MAAD,CAAN,IAAkB;AAAE,cAAQ,EAAE,KAAZ;AAAmB,iBAAW,EAAE;AAAhC,KAAtC;;AAEA,QAAI,uBAAW,OAAX,CAAJ,EAAyB;AACvB,UAAM,UAAU,GAAG,WAAW,CAAC,WAAZ,CAAwB,OAAxB,KAAoC;AACrD,qBAAa,eADwC;AAErD,kBAAU,YAF2C;AAGrD,aAAK,EAAE;AAH8C,OAAvD;AAMA,gBAAU,CAAC,KAAX,CAAiB,IAAjB,CAAsB,IAAtB;AAEA,iBAAW,CAAC,QAAZ,GAAuB,IAAvB;AAEA,iBAAW,CAAC,WAAZ,CAAwB,OAAxB,IAAmC,UAAnC;AACD,KAZD,MAYO;AACL,iBAAW,CAAC,WAAZ,CAAwB,qBAAS,WAAT,CAAxB,IAAiD;AAC/C,qBAAa,eADkC;AAE/C,kBAAU,YAFqC;AAG/C,aAAK,EAAE,CAAC,IAAD;AAHwC,OAAjD;AAKD;;AAED,iCAAY,MAAZ,IAAkB,YAAG,MAAH,IAAY,WAAZ,EAAuB,EAAzC;AACD,GA/BmB,EA+BjB,EA/BiB,CAApB;AAiCA,SAAO,MAAM,CAAC,IAAP,CAAY,WAAZ,EAAyB,MAAzB,CAAgC,UAAC,MAAD,EAAS,MAAT,EAAe;;;AACpD,QAAM,KAAK,GAAG,WAAW,CAAC,MAAD,CAAzB;;AAEA,QAAI,KAAK,CAAC,QAAV,EAAoB;AAClB,WAAK,CAAC,WAAN,GAAoB,MAAM,CAAC,IAAP,CAAY,KAAK,CAAC,WAAlB,EAA+B,MAA/B,CAAsC,UAAC,GAAD,EAAM,OAAN,EAAa;;;AACrE,YAAM,CAAC,GAAG,KAAK,CAAC,WAAN,CAAkB,OAAlB,CAAV;AAEA,qCACK,GADL,IACQ,YACL,OADK,IACK;AACT,uBAAa,eADJ;AAET,oBAAU,YAFD;AAGT,eAAK,EAAE,CAAC,CAAC,KAHA;AAIT,qBAAW,EAAE,uBAAe,IAAf,EAAqB,CAAC,CAAC,KAAvB,EAA8B,UAA9B;AAJJ,SADL,EAML,EAPH;AASD,OAZmB,EAYjB,EAZiB,CAApB;AAaD;;AAED,iCAAY,MAAZ,IAAkB,YAAG,MAAH,IAAY,KAAZ,EAAiB,EAAnC;AACD,GApBM,EAoBJ,EApBI,CAAP;AAqBD,CArEY;;AA6EA,iCAAyB,UAAC,KAAD,EAAyB,IAAzB,EAAqC;AACzE,MAAI,IAAI,KAAK,QAAb,EAAuB;AACrB,WAAO,CAAC,oBAAE,GAAF,CAAM,KAAN,CAAD,EAAe,oBAAE,GAAF,CAAM,KAAN,CAAf,CAAP;AACD;;AAED,SAAO,KAAP;AACD,CANY;;AAcA,0BAAkB,UAAC,KAAD,EAAa,IAAb,EAAsB;AAC3C;AAAA,MAAe,gBAAf;AAAA,MAAqB,0BAArB;AAAA,MAAgC,oCAAhC;AAAA,MAAgD,kCAAhD;AACR,MAAM,SAAS,GAAG,aAAa,IAAI,IAAI,CAAC,KAAxC;;AAEA,MAAI,SAAS,KAAK,MAAd,IAAwB,SAAS,KAAK,QAA1C,EAAoD;AAClD,WAAO,IAAP;AACD;;AAED,MACE,SAAS,IACT,IAAI,KAAK,QADT,IAEA,cAFA,KAGC,cAAc,CAAC,CAAD,CAAd,KAAsB,MAAtB,IAAgC,cAAc,CAAC,CAAD,CAAd,KAAsB,MAHvD,CADF,EAKE;AAEA,QAAM,MAAM,GAAG,KAAK,CAAC,MAAN,EAAf;;AACA,QAAI,CAAC,MAAM,CAAC,MAAZ,EAAoB;AAClB,aAAO,IAAP;AACD;;AACD,QAAM,UAAU,GAAG,mCAAkB,MAAlB,EAA0B,SAA1B,EAAqC,aAArC,CAAnB;AAEA,SAAK,CAAC,MAAN,CAAa,+BAAuB,UAAvB,EAAmC,IAAnC,CAAb;AAEA,WAAO;AAAE,eAAS,EAAE;AAAb,KAAP;AACD;;AACD,MAAI,SAAS,IAAI,IAAI,KAAK,QAA1B,EAAoC;AAClC,QAAM,MAAM,GAAG,KAAK,CAAC,MAAN,EAAf;AACA,QAAM,UAAU,GAAG,0CAAyB,MAAzB,EAAiC,SAAjC,EAA4C,aAA5C,CAAnB;AAEA,WAAO;AAAE,eAAS,EAAE;AAAb,KAAP;AACD;;AAED,SAAO,IAAP;AACD,CAjCY;;AAmCA,kCAA0B,UAAC,EAAD,EActC;MAbC,c;MACA,gB;MACA,sB;MACA,gB;MACA,gB;MACA,oB;;AASA,MAAI,IAAI,CAAC,IAAL,KAAc,UAAlB,EAA8B;AAE5B,QAAI,CAAC,IAAI,CAAC,uBAAN,IAAiC,IAAI,CAAC,OAAtC,IAAiD,CAAC,oBAAE,KAAF,CAAQ,KAAK,CAAC,IAAI,CAAC,OAAN,CAAb,CAAtD,EAAoF;AAClF,UAAM,WAAW,GAAG,6BAAiB,KAAjB,EAAwB,OAAxB,EAAiC,KAAK,CAAC,IAAI,CAAC,OAAN,CAAtC,CAApB;;AAEA,UAAI,WAAJ,EAAiB;AACf,eAAO,WAAW,CAAC,UAAZ,GAAyB,QAAQ,GAAG,CAA3C;AACD;AACF;;AAED,WAAO,KAAK,CAAC,KAAD,CAAL,GAAe,KAAK,CAAC,KAAD,CAAL,CAAa,UAAb,GAA0B,QAAQ,GAAG,CAApD,GAAwD,IAA/D;AACD;;AAED,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAD,EAAQ,CAAC,oBAAE,KAAF,CAAQ,OAAR,CAAD,GAAoB,OAApB,GAA8B,IAAI,CAAC,OAA3C,CAA/B;AAEA,SAAO,CAAC,oBAAE,KAAF,CAAQ,KAAR,CAAD,GAAkB,IAAI,CAAC,KAAL,CAAW,KAAX,CAAlB,GAAsC,IAA7C;AACD,CA/BY;;AAiCA,iCAAyB,UAAC,EAAD,EAcrC;MAbC,c;MACA,gB;MACA,kB;MACA,sB;MACA,gB;MACA,gB;;AASA,MAAI,IAAI,CAAC,IAAL,KAAc,UAAlB,EAA8B;AAC5B,WAAO,KAAK,CAAC,KAAD,CAAL,GAAe,KAAK,CAAC,KAAD,CAAL,CAAa,UAAb,GAA0B,MAAzC,GAAkD,IAAzD;AACD;;AACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAD,EAAQ,IAAI,CAAC,OAAb,EAAsB,IAAI,CAAC,MAAL,CAAY,KAAZ,CAAtB,CAA/B;AAEA,SAAO,CAAC,oBAAE,KAAF,CAAQ,KAAR,CAAD,GAAkB,IAAI,CAAC,KAAL,CAAW,KAAX,IAAoB,QAAQ,GAAG,CAA/B,GAAmC,MAArD,GAA8D,IAArE;AACD,CArBY;;AAuBA,4BAAoB,UAAC,EAAD,EAIhC;MAHC,4B;AAIA,MAAM,MAAM,GAAG,WAAW,CAAC,KAAZ,CAAkB,MAAlB,EAAf;;AAEA,MAAI,WAAW,CAAC,IAAZ,KAAqB,QAAzB,EAAmC;AACjC,QAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAZ;AACA,QAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAZ;;AAEA,QAAI,GAAG,IAAI,CAAP,IAAY,GAAG,IAAI,CAAvB,EAA0B;AACxB,aAAO,CAAP;AACD;;AACD,QAAI,GAAG,GAAG,CAAV,EAAa;AACX,aAAO,GAAP;AACD;;AAED,WAAO,GAAP;AACD;;AAED,SAAO,MAAM,CAAC,CAAD,CAAb;AACD,CAtBY;;AAwBA,+BAAuB,UAAC,IAAD,EAAY,WAAZ,EAA4B;AACtD;;AAER,MAAI,uBAAW,OAAX,CAAJ,EAAyB;AACvB,QAAM,KAAK,GAAG,WAAW,CAAC,OAAD,CAAzB;;AAEA,QAAI,KAAK,IAAI,KAAK,CAAC,KAAN,CAAY,MAAzB,EAAiC;AAC/B,UAAI,SAAS,GAAG,CAAC,CAAjB;;AAEA,WAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,KAAK,CAAC,KAAN,CAAY,MAAlC,EAA0C,CAAC,GAAG,GAA9C,EAAmD,CAAC,EAApD,EAAwD;AACtD,YAAI,KAAK,CAAC,KAAN,CAAY,CAAZ,MAAmB,IAAvB,EAA6B;AAC3B,mBAAS,GAAG,CAAZ;AACA;AACD;AACF;;AACD,aAAO,SAAS,IAAI,CAAb,GAAiB,KAAK,CAAC,WAAN,CAAkB,SAAlB,CAAjB,GAAgD,IAAvD;AACD;AACF;;AAED,SAAO,IAAP;AACD,CApBY;;AAsBb,IAAM,iBAAiB,GAAG,SAApB,iBAAoB,CAAC,IAAD,EAAiB;AACzC,aAAI,CAAC,MAAL,CACE,UAAC,MAAD,EAAS,KAAT,EAAc;AAAK,YACjB,oBAAE,GAAF,CAAM,KAAK,CAAC,MAAN,CAAa,CAAC,MAAM,CAAC,CAAD,CAAP,CAAb,EAA0B,MAA1B,CAAiC,oBAAjC,CAAN,CADiB,EAEjB,oBAAE,GAAF,CAAM,KAAK,CAAC,MAAN,CAAa,CAAC,MAAM,CAAC,CAAD,CAAP,CAAb,EAA0B,MAA1B,CAAiC,oBAAjC,CAAN,CAFiB;AAGlB,GAJH,EAKE,CAAC,QAAD,EAAW,CAAC,QAAZ,CALF;AAMC,CAPH;;AASa,iCAAyB,UAAC,WAAD,EAAmB,UAAnB,EAAuC,QAAvC,EAAuD;AAC3F,eAAM,CAAC,IAAP,CAAY,WAAZ,EACG,MADH,CAEI,UAAC,MAAD,EAAS,OAAT,EAAgB;AACd,QAAM,KAAK,GAAG,WAAW,CAAC,OAAD,CAAzB;AACQ;AACR,QAAM,MAAM,GAAG,WAAW,CAAC,MAAZ,CACb,UAAC,GAAD,EAAwB,KAAxB,EAAkC;AAChC,UAAM,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,KAAN,CAAY,UAAZ,EAAwB,QAAQ,GAAG,CAAnC,CAAD,CAA3B;AAEA,aAAO,CAAC,IAAI,CAAC,GAAL,CAAS,GAAG,CAAC,CAAD,CAAZ,EAAiB,CAAC,CAAC,CAAD,CAAlB,CAAD,EAAyB,IAAI,CAAC,GAAL,CAAS,GAAG,CAAC,CAAD,CAAZ,EAAiB,CAAC,CAAC,CAAD,CAAlB,CAAzB,CAAP;AACD,KALY,EAMb,CAAC,QAAD,EAAW,CAAC,QAAZ,CANa,CAAf;AASA,WAAO,CAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAD,EAAiC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAAM,CAAC,CAAD,CAA1B,CAAjC,CAAP;AACD,GAfL,EAgBI,CAAC,QAAD,EAAW,CAAC,QAAZ,CAhBJ,EAkBG,GAlBH,CAkBO,kBAAM;AAAI,WAAC,MAAM,KAAK,QAAX,IAAuB,MAAM,KAAK,CAAC,QAAnC,GAA8C,CAA9C,GAAD;AAA0D,GAlB3E;AAkB4E,CAnBjE;;AAqBA,wBAAgB,iDAAhB;AACA,wBAAgB,kDAAhB;;AAEA,+BAAuB,UAAC,eAAD,EAAuB,UAAvB,EAAwC,iBAAxC,EAAkE;AACpG,MAAI,CAAC,oBAAE,OAAF,CAAU,eAAV,CAAL,EAAiC;AAC/B,WAAO,UAAP;AACD;;AAED,MAAM,MAAM,GAAG,EAAf;;AAGA,MAAI,qBAAS,eAAe,CAAC,CAAD,CAAxB,CAAJ,EAAkC;AAChC,UAAM,CAAC,CAAD,CAAN,GAAY,iBAAiB,GAAG,eAAe,CAAC,CAAD,CAAlB,GAAwB,IAAI,CAAC,GAAL,CAAS,eAAe,CAAC,CAAD,CAAxB,EAA6B,UAAU,CAAC,CAAD,CAAvC,CAArD;AACD,GAFD,MAEO,IAAI,sBAAc,IAAd,CAAmB,eAAe,CAAC,CAAD,CAAlC,CAAJ,EAA4C;AACjD,QAAM,KAAK,GAAG,CAAC,sBAAc,IAAd,CAAmB,eAAe,CAAC,CAAD,CAAlC,EAAuC,CAAvC,CAAf;AAEA,UAAM,CAAC,CAAD,CAAN,GAAY,UAAU,CAAC,CAAD,CAAV,GAAgB,KAA5B;AACD,GAJM,MAIA,IAAI,oBAAE,UAAF,CAAa,eAAe,CAAC,CAAD,CAA5B,CAAJ,EAAsC;AAC3C,UAAM,CAAC,CAAD,CAAN,GAAY,eAAe,CAAC,CAAD,CAAf,CAAmB,UAAU,CAAC,CAAD,CAA7B,CAAZ;AACD,GAFM,MAEA;AACL,UAAM,CAAC,CAAD,CAAN,GAAY,UAAU,CAAC,CAAD,CAAtB;AACD;;AAED,MAAI,qBAAS,eAAe,CAAC,CAAD,CAAxB,CAAJ,EAAkC;AAChC,UAAM,CAAC,CAAD,CAAN,GAAY,iBAAiB,GAAG,eAAe,CAAC,CAAD,CAAlB,GAAwB,IAAI,CAAC,GAAL,CAAS,eAAe,CAAC,CAAD,CAAxB,EAA6B,UAAU,CAAC,CAAD,CAAvC,CAArD;AACD,GAFD,MAEO,IAAI,sBAAc,IAAd,CAAmB,eAAe,CAAC,CAAD,CAAlC,CAAJ,EAA4C;AACjD,QAAM,KAAK,GAAG,CAAC,sBAAc,IAAd,CAAmB,eAAe,CAAC,CAAD,CAAlC,EAAuC,CAAvC,CAAf;AAEA,UAAM,CAAC,CAAD,CAAN,GAAY,UAAU,CAAC,CAAD,CAAV,GAAgB,KAA5B;AACD,GAJM,MAIA,IAAI,oBAAE,UAAF,CAAa,eAAe,CAAC,CAAD,CAA5B,CAAJ,EAAsC;AAC3C,UAAM,CAAC,CAAD,CAAN,GAAY,eAAe,CAAC,CAAD,CAAf,CAAmB,UAAU,CAAC,CAAD,CAA7B,CAAZ;AACD,GAFM,MAEA;AACL,UAAM,CAAC,CAAD,CAAN,GAAY,UAAU,CAAC,CAAD,CAAtB;AACD;;AAGD,SAAO,MAAP;AACD,CAlCY;;AA2CA,4BAAoB,UAAC,IAAD,EAAY,KAAZ,EAAqC,KAArC,EAAoD;AACnF,MAAI,IAAI,IAAI,IAAI,CAAC,KAAb,IAAsB,IAAI,CAAC,KAAL,CAAW,SAArC,EAAgD;AAC9C,QAAM,SAAS,GAAG,IAAI,CAAC,KAAL,CAAW,SAAX,EAAlB;;AAEA,QAAI,CAAC,KAAD,IAAU,SAAS,GAAG,CAA1B,EAA6B;AAC3B,aAAO,SAAP;AACD;AACF;;AAED,MAAI,IAAI,IAAI,KAAR,IAAiB,KAAK,CAAC,MAAN,IAAgB,CAArC,EAAwC;AACtC,QAAM,YAAY,GAAG,oBAAE,MAAF,CAAS,KAAT,EAAgB,aAAC;AAAI,cAAC,CAAD;AAAY,KAAjC,CAArB;AACA,QAAI,QAAQ,GAAG,QAAf;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAR,EAAW,GAAG,GAAG,YAAY,CAAC,MAAnC,EAA2C,CAAC,GAAG,GAA/C,EAAoD,CAAC,EAArD,EAAyD;AACvD,UAAM,GAAG,GAAG,YAAY,CAAC,CAAD,CAAxB;AACA,UAAM,IAAI,GAAG,YAAY,CAAC,CAAC,GAAG,CAAL,CAAzB;AAEA,cAAQ,GAAG,IAAI,CAAC,GAAL,CAAS,CAAC,GAAG,CAAC,UAAJ,IAAkB,CAAnB,KAAyB,IAAI,CAAC,UAAL,IAAmB,CAA5C,CAAT,EAAyD,QAAzD,CAAX;AACD;;AAED,WAAO,QAAQ,KAAK,QAAb,GAAwB,CAAxB,GAA4B,QAAnC;AACD;;AAED,SAAO,CAAP;AACD,CAxBY;;AAgCA,oCAA4B,UACvC,eADuC,EAEvC,gBAFuC,EAGvC,SAHuC,EAGhB;AAEvB,MAAI,CAAC,eAAD,IAAoB,CAAC,eAAe,CAAC,MAAzC,EAAiD;AAC/C,WAAO,gBAAP;AACD;;AAED,MAAI,oBAAE,OAAF,CAAU,eAAV,EAA2B,oBAAE,GAAF,CAAM,SAAN,EAAiB,0BAAjB,CAA3B,CAAJ,EAA8E;AAC5E,WAAO,gBAAP;AACD;;AAED,SAAO,eAAP;AACD,CAdY,C;;;;;;;;;;;;;;;;;ACtkCA,sBAAc,CACzB,SADyB,EAEzB,SAFyB,EAGzB,SAHyB,EAIzB,SAJyB,EAKzB,SALyB,EAMzB,SANyB,EAOzB,SAPyB,EAQzB,SARyB,EASzB,SATyB,EAUzB,SAVyB,EAWzB,SAXyB,EAYzB,SAZyB,EAazB,SAbyB,EAczB,SAdyB,EAezB,SAfyB,EAgBzB,SAhByB,EAiBzB,SAjByB,EAkBzB,SAlByB,EAmBzB,SAnByB,EAoBzB,SApByB,EAqBzB,SArByB,EAsBzB,SAtByB,EAuBzB,SAvByB,EAwBzB,SAxByB,CAAd,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACAb,IAAM,WAAW,GAAG,CAAC,QAAD,EAAW,KAAX,EAAkB,GAAlB,EAAuB,IAAvB,CAApB;;AAEa,8BAAsB,UAAC,IAAD,EAAe,KAAf,EAA4B;AAC7D,MAAI,CAAC,IAAL,EAAW;AACT,WAAO,IAAP;AACD;;AAED,MAAM,SAAS,GAAG,IAAI,CAAC,OAAL,CAAa,MAAb,EAAqB,aAAC;AAAI,YAAC,CAAD;AAAe,GAAzC,CAAlB;AACA,MAAM,MAAM,GAA2B,WAAW,CAAC,MAAZ,CACrC,UAAC,GAAD,EAAM,KAAN,EAAW;;;AAAK,iCACX,GADW,IACR,YACL,KAAK,GAAG,SADH,IACe,KADf,EACoB,EAFZ;AAGd,GAJmC,EAKrC,EALqC,CAAvC;AAQA,QAAM,CAAC,IAAD,CAAN,GAAe,KAAf;AAEA,SAAO,MAAP;AACD,CAjBY,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACDb;;AAOA,IAAM,WAAW,GAAgB;AAC/B,YAAU,EAAE,EADmB;AAE/B,YAAU,EAAE;AAFmB,CAAjC;AAIA,IAAM,aAAa,GAAG,IAAtB;AACA,IAAM,UAAU,GAAG;AACjB,UAAQ,EAAE,UADO;AAEjB,KAAG,EAAE,UAFY;AAGjB,MAAI,EAAE,CAHW;AAIjB,SAAO,EAAE,CAJQ;AAKjB,QAAM,EAAE,CALS;AAMjB,QAAM,EAAE,MANS;AAOjB,YAAU,EAAE;AAPK,CAAnB;AASA,IAAM,UAAU,GAAG,CACjB,UADiB,EAEjB,UAFiB,EAGjB,OAHiB,EAIjB,WAJiB,EAKjB,WALiB,EAMjB,QANiB,EAOjB,KAPiB,EAQjB,MARiB,EASjB,UATiB,EAUjB,YAViB,EAWjB,SAXiB,EAYjB,QAZiB,EAajB,aAbiB,EAcjB,cAdiB,EAejB,YAfiB,EAgBjB,eAhBiB,EAiBjB,YAjBiB,EAkBjB,aAlBiB,EAmBjB,WAnBiB,EAoBjB,cApBiB,CAAnB;AAsBA,IAAM,mBAAmB,GAAG,2BAA5B;;AAEA,SAAS,iBAAT,CAA2B,IAA3B,EAAyC,KAAzC,EAAsD;AACpD,MAAI,UAAU,CAAC,OAAX,CAAmB,IAAnB,KAA4B,CAA5B,IAAiC,KAAK,KAAK,CAAC,KAAhD,EAAuD;AACrD,WAAU,KAAK,OAAf;AACD;;AAED,SAAO,KAAP;AACD;;AAED,SAAS,iBAAT,CAA2B,IAA3B,EAAuC;AACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAL,CAAW,EAAX,CAAb;AAEA,MAAM,UAAU,GAAG,IAAI,CAAC,MAAL,CAAY,UAAC,MAAD,EAAS,KAAT,EAAc;AAC3C,QAAI,KAAK,KAAK,KAAK,CAAC,WAAN,EAAd,EAAmC;AACjC,4BAAW,MAAX,EAAiB,CAAE,GAAF,EAAO,KAAK,CAAC,WAAN,EAAP,CAAjB;AACD;;AAED,0BAAW,MAAX,EAAiB,CAAE,KAAF,CAAjB;AACD,GANkB,EAMhB,EANgB,CAAnB;AAQA,SAAO,UAAU,CAAC,IAAX,CAAgB,EAAhB,CAAP;AACD;;AAEY,yBAAiB,UAAC,KAAD,EAAqB;AACjD,eAAM,CAAC,IAAP,CAAY,KAAZ,EAAmB,MAAnB,CACE,UAAC,MAAD,EAAS,CAAT,EAAU;AAAK,gBAAG,MAAH,GAAY,iBAAiB,CAAC,CAAD,CAA7B,GAAgC,GAAhC,GAAoC,iBAAiB,CAAC,CAAD,EAAK,KAA6B,CAAC,CAAD,CAAlC,CAArD;AAA8F,GAD/G,EAEE,EAFF;AAGC,CAJU;;AAMA,wBAAgB,UAAC,IAAD,EAAwB,KAAxB,EAAiD;AAAzB;AAAA;AAAyB;;AAC5E,MAAI,IAAI,KAAK,SAAT,IAAsB,IAAI,KAAK,IAA/B,IAAuC,oBAAO,KAAlD,EAAyD;AACvD,WAAO;AAAE,WAAK,EAAE,CAAT;AAAY,YAAM,EAAE;AAApB,KAAP;AACD;;AAED,MAAM,GAAG,GAAG,KAAG,IAAf;AACA,MAAM,WAAW,GAAG,uBAAe,KAAf,CAApB;AACA,MAAM,QAAQ,GAAM,GAAG,MAAH,GAAO,WAA3B;;AAEA,MAAI,WAAW,CAAC,UAAZ,CAAuB,QAAvB,CAAJ,EAAsC;AACpC,WAAO,WAAW,CAAC,UAAZ,CAAuB,QAAvB,CAAP;AACD;;AAED,MAAI;AACF,QAAI,iBAAe,GAAG,QAAQ,CAAC,cAAT,CAAwB,mBAAxB,CAAtB;;AACA,QAAI,CAAC,iBAAL,EAAsB;AACpB,uBAAe,GAAG,QAAQ,CAAC,aAAT,CAAuB,MAAvB,CAAlB;AACA,uBAAe,CAAC,YAAhB,CAA6B,IAA7B,EAAmC,mBAAnC;AACA,cAAQ,CAAC,IAAT,CAAc,WAAd,CAA0B,iBAA1B;AACD;;AAGD,QAAM,sBAAoB,yBAA6B,UAA7B,GAA4C,KAA5C,CAA1B;;AACA,UAAM,CAAC,IAAP,CAAY,sBAAZ,EAAkC,GAAlC,CAAsC,oBAAQ;AAC3C,uBAAe,CAAC,KAAhB,CAA8C,QAA9C,IAA0D,sBAAoB,CAAC,QAAD,CAA9E;AACD,aAAO,QAAP;AACD,KAHD;AAKA,qBAAe,CAAC,WAAhB,GAA8B,GAA9B;AAEA,QAAM,IAAI,GAAG,iBAAe,CAAC,qBAAhB,EAAb;AACA,QAAM,MAAM,GAAG;AAAE,WAAK,EAAE,IAAI,CAAC,KAAd;AAAqB,YAAM,EAAE,IAAI,CAAC;AAAlC,KAAf;AAEA,eAAW,CAAC,UAAZ,CAAuB,QAAvB,IAAmC,MAAnC;;AAEA,QAAI,EAAE,WAAW,CAAC,UAAd,GAA2B,aAA/B,EAA8C;AAC5C,iBAAW,CAAC,UAAZ,GAAyB,CAAzB;AACA,iBAAW,CAAC,UAAZ,GAAyB,EAAzB;AACD;;AAED,WAAO,MAAP;AACD,GA5BD,CA4BE,OAAO,CAAP,EAAU;AACV,WAAO;AAAE,WAAK,EAAE,CAAT;AAAY,YAAM,EAAE;AAApB,KAAP;AACD;AACF,CA5CY;;AAmDA,oBAAY,UAAC,EAAD,EAAgB;AACvC,MAAM,IAAI,GAAG,EAAE,CAAC,aAAH,CAAiB,eAA9B;AACA,MAAI,GAAG,GAAG;AAAE,OAAG,EAAE,CAAP;AAAU,QAAI,EAAE;AAAhB,GAAV;;AAIA,MAAI,OAAO,EAAE,CAAC,qBAAV,KAAoC,WAAxC,EAAqD;AACnD,OAAG,GAAG,EAAE,CAAC,qBAAH,EAAN;AACD;;AAED,SAAO;AACL,OAAG,EAAE,GAAG,CAAC,GAAJ,GAAU,MAAM,CAAC,WAAjB,GAA+B,IAAI,CAAC,SADpC;AAEL,QAAI,EAAE,GAAG,CAAC,IAAJ,GAAW,MAAM,CAAC,WAAlB,GAAgC,IAAI,CAAC;AAFtC,GAAP;AAID,CAdY;;AAsBA,mCAA2B,UAAC,KAAD,EAAoB,MAApB,EAA2C;AAAK,SAAC;AACvF,UAAM,EAAE,IAAI,CAAC,KAAL,CAAW,KAAK,CAAC,KAAN,GAAc,MAAM,CAAC,IAAhC,CAD+E;AAEvF,UAAM,EAAE,IAAI,CAAC,KAAL,CAAW,KAAK,CAAC,KAAN,GAAc,MAAM,CAAC,GAAhC;AAF+E,GAAD;AAGtF,CAHW,C;;;;;;;;;;;;;;;;;;;;;;;;ACnJb;;AAEa,mBAAW,UAAC,KAAD,EAAc;AACpC,MAAI,KAAK,KAAK,CAAd,EAAiB;AACf,WAAO,CAAP;AACD;;AACD,MAAI,KAAK,GAAG,CAAZ,EAAe;AACb,WAAO,CAAP;AACD;;AAED,SAAO,CAAC,CAAR;AACD,CATY;;AAWA,oBAAY,UAAC,KAAD,EAAuB;AAAK,6BAAE,QAAF,CAAW,KAAX,KAAqB,KAAK,CAAC,OAAN,CAAc,GAAd,MAAuB,KAAK,CAAC,MAAN,GAA5C;AAA4D,CAApG;;AAEA,mBAAW,UAAC,KAAD,EAAW;AAAK,6BAAE,QAAF,CAAW,KAAX,KAAqB,CAAC,oBAAE,KAAF,CAAtB,KAAsB,CAAtB;AAAoC,CAA/D;;AAEA,qBAAa,UAAC,KAAD,EAAuB;AAAK,0BAAS,KAAT,KAA6B,oBAAE,QAAF,CAA7B,KAA6B,CAA7B;AAA8C,CAAvF;;AAEb,IAAI,SAAS,GAAG,CAAhB;;AACa,mBAAW,UAAC,MAAD,EAAgB;AACtC,MAAM,EAAE,GAAG,EAAE,SAAb;AAEA,SAAO,MAAG,MAAM,IAAI,EAAb,IAAkB,EAAzB;AACD,CAJY;;AAaA,0BAAkB,UAAC,OAAD,EAA2B,UAA3B,EAA+C,YAA/C,EAAiE,QAAjE,EAAiF;AAAlC;AAAA;AAAgB;;AAAE;AAAA;AAAgB;;AAC9G,MAAI,CAAC,iBAAS,OAAT,CAAD,IAAgC,CAAC,oBAAE,QAAF,CAAW,OAAX,CAArC,EAA0D;AACxD,WAAO,YAAP;AACD;;AAED,MAAI,KAAJ;;AAEA,MAAI,kBAAU,OAAV,CAAJ,EAAkC;AAChC,QAAM,KAAK,GAAI,OAAkB,CAAC,OAAnB,CAA2B,GAA3B,CAAf;AACA,SAAK,GAAI,UAAU,GAAG,UAAU,CAAE,OAAkB,CAAC,KAAnB,CAAyB,CAAzB,EAA4B,KAA5B,CAAF,CAAxB,GAAiE,GAAzE;AACD,GAHD,MAGO;AACL,SAAK,GAAG,CAAC,OAAT;AACD;;AAED,MAAI,oBAAE,KAAF,CAAQ,KAAR,CAAJ,EAAoB;AAClB,SAAK,GAAG,YAAR;AACD;;AAED,MAAI,QAAQ,IAAI,KAAK,GAAG,UAAxB,EAAoC;AAClC,SAAK,GAAG,UAAR;AACD;;AAED,SAAO,KAAP;AACD,CAvBY;;AAyBA,gCAAwB,UAAC,GAAD,EAAS;AAC5C,MAAI,CAAC,GAAL,EAAU;AACR,WAAO,IAAP;AACD;;AAED,MAAM,IAAI,GAAG,MAAM,CAAC,IAAP,CAAY,GAAZ,CAAb;;AAEA,MAAI,IAAI,IAAI,IAAI,CAAC,MAAjB,EAAyB;AACvB,WAAO,GAAG,CAAC,IAAI,CAAC,CAAD,CAAL,CAAV;AACD;;AAED,SAAO,IAAP;AACD,CAZY;;AAcA,uBAAe,UAAC,GAAD,EAAgB;AAC1C,MAAI,CAAC,oBAAE,OAAF,CAAU,GAAV,CAAL,EAAqB;AACnB,WAAO,KAAP;AACD;;AAED,MAAM,GAAG,GAAG,GAAG,CAAC,MAAhB;AACA,MAAM,KAAK,GAAwB,EAAnC;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAApB,EAAyB,CAAC,EAA1B,EAA8B;AAC5B,QAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAD,CAAJ,CAAV,EAAoB;AAClB,WAAK,CAAC,GAAG,CAAC,CAAD,CAAJ,CAAL,GAAgB,IAAhB;AACD,KAFD,MAEO;AACL,aAAO,IAAP;AACD;AACF;;AAED,SAAO,KAAP;AACD,CAjBY;;AAmBA,4BAAoB,UAAC,OAAD,EAAkB,OAAlB,EAAiC;AAChE,MAAI,iBAAS,OAAT,KAAqB,iBAAS,OAAT,CAAzB,EAA4C;AAC1C,WAAO,UAAC,CAAD,EAAU;AAAK,oBAAO,GAAG,CAAC,IAAI,OAAO,GAAtB,OAAW,CAAX;AAAiC,KAAvD;AACD;;AAED,SAAO;AAAM;AAAO,GAApB;AACD,CANY;;AAQb,SAAgB,gBAAhB,CACE,GADF,EAEE,YAFF,EAGE,cAHF,EAGqB;AAEnB,MAAI,CAAC,GAAD,IAAQ,CAAC,GAAG,CAAC,MAAjB,EAAyB;AACvB,WAAO,IAAP;AACD;;AAED,SAAO,GAAG,CAAC,IAAJ,CACL,iBAAK;AACH,gBAAK,IACL,CAAC,OAAO,YAAP,KAAwB,UAAxB,GAAqC,YAAY,CAAC,KAAD,CAAjD,GAA2D,oBAAE,GAAF,CAAM,KAAN,EAAa,YAAb,CAA5D,MAA4F,cAD5F;AAC0G,GAHvG,CAAP;AAKD;;AAdD;;AAqBa,8BAAsB,UAAC,IAAD,EAA0C;AAC3E,MAAI,CAAC,IAAD,IAAS,CAAC,IAAI,CAAC,MAAnB,EAA2B;AACzB,WAAO,IAAP;AACD;;AAED,MAAM,GAAG,GAAG,IAAI,CAAC,MAAjB;AACA,MAAI,IAAI,GAAG,CAAX;AACA,MAAI,IAAI,GAAG,CAAX;AACA,MAAI,KAAK,GAAG,CAAZ;AACA,MAAI,KAAK,GAAG,CAAZ;AACA,MAAI,IAAI,GAAG,QAAX;AACA,MAAI,IAAI,GAAG,CAAC,QAAZ;;AAEA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAApB,EAAyB,CAAC,EAA1B,EAA8B;AAC5B,QAAI,IAAI,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAAhB;AACA,QAAI,IAAI,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAAhB;AACA,SAAK,IAAI,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAAR,GAAa,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAA9B;AACA,SAAK,IAAI,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAAR,GAAa,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAA9B;AACA,QAAI,GAAG,IAAI,CAAC,GAAL,CAAS,IAAT,EAAe,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAAvB,CAAP;AACA,QAAI,GAAG,IAAI,CAAC,GAAL,CAAS,IAAT,EAAe,IAAI,CAAC,CAAD,CAAJ,CAAQ,EAAvB,CAAP;AACD;;AAED,MAAM,CAAC,GAAG,GAAG,GAAG,KAAN,KAAgB,IAAI,GAAG,IAAvB,GAA8B,CAAC,GAAG,GAAG,KAAN,GAAc,IAAI,GAAG,IAAtB,KAA+B,GAAG,GAAG,KAAN,GAAc,IAAI,GAAG,IAApD,CAA9B,GAA0F,CAApG;AAEA,SAAO;AACL,QAAI,MADC;AAEL,QAAI,MAFC;AAGL,KAAC,GAHI;AAIL,KAAC,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,IAAZ,IAAoB;AAJlB,GAAP;AAMD,CA9BY,C;;;;;;;;;;;;;;;;;;;;;;;;ACvHb;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEa,wCAAgC,UAC3C,QAD2C,EAE3C,MAF2C,EAG3C,MAH2C,EAI3C,QAJ2C,EAK3C,cAL2C,EAKrB;AAEtB,MAAM,KAAK,GAAG,2BAAc,QAAd,EAAwB,2BAAc,WAAtC,CAAd;AACA,MAAM,IAAI,GAAG,2BAAc,QAAd,EAAwB,0BAAa,WAArC,CAAb;AACA,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAN,CAAa,IAAb,CAAjB;AACA,MAAM,KAAK,GAAG,2BAAc,QAAd,EAAwB,2BAAc,WAAtC,CAAd;AACA,MAAM,KAAK,GAAM,QAAQ,OAAzB;AACA,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAD,CAAzB;AACA,MAAI,WAAW,GAAG,MAAlB;;AAEA,MAAI,QAAQ,CAAC,MAAb,EAAqB;AACnB,eAAW,GAAG,QAAQ,CAAC,MAAT,CAAgB,UAAC,MAAD,EAAmB,EAAnB,EAA0B;AACtD,UAAI,EAAE,CAAC,KAAH,CAAS,KAAT,MAAoB,MAApB,IAA8B,sCAAkB,EAAE,CAAC,KAArB,EAA4B,cAA5B,CAA9B,IAA6E,qBAAS,EAAE,CAAC,KAAH,CAAS,QAAT,CAAT,CAAjF,EAA+G;AAC7G,YAAM,KAAK,GAAG,EAAE,CAAC,KAAH,CAAS,QAAT,CAAd;AAEA,eAAO,CAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAApB,CAAD,EAA6B,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,KAApB,CAA7B,CAAP;AACD;;AACD,aAAO,MAAP;AACD,KAPa,EAOX,WAPW,CAAd;AAQD;;AAED,MAAI,KAAK,CAAC,MAAV,EAAkB;AAChB,QAAM,MAAI,GAAM,QAAQ,MAAxB;AACA,QAAM,MAAI,GAAM,QAAQ,MAAxB;AAEA,eAAW,GAAG,KAAK,CAAC,MAAN,CAAa,UAAC,MAAD,EAAmB,EAAnB,EAA0B;AACnD,UACE,EAAE,CAAC,KAAH,CAAS,KAAT,MAAoB,MAApB,IACA,sCAAkB,EAAE,CAAC,KAArB,EAA4B,cAA5B,CADA,IAEA,qBAAS,EAAE,CAAC,KAAH,CAAS,MAAT,CAAT,CAFA,IAGA,qBAAS,EAAE,CAAC,KAAH,CAAS,MAAT,CAAT,CAJF,EAKE;AACA,YAAM,MAAM,GAAG,EAAE,CAAC,KAAH,CAAS,MAAT,CAAf;AACA,YAAM,MAAM,GAAG,EAAE,CAAC,KAAH,CAAS,MAAT,CAAf;AAEA,eAAO,CAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAApB,EAA4B,MAA5B,CAAD,EAAsC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,MAApB,EAA4B,MAA5B,CAAtC,CAAP;AACD;;AACD,aAAO,MAAP;AACD,KAba,EAaX,WAbW,CAAd;AAcD;;AAED,MAAI,cAAc,IAAI,cAAc,CAAC,MAArC,EAA6C;AAC3C,eAAW,GAAG,cAAc,CAAC,MAAf,CAAsB,UAAC,MAAD,EAAS,IAAT,EAAa;AAC/C,UAAI,qBAAS,IAAT,CAAJ,EAAoB;AAClB,eAAO,CAAC,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,IAApB,CAAD,EAA4B,IAAI,CAAC,GAAL,CAAS,MAAM,CAAC,CAAD,CAAf,EAAoB,IAApB,CAA5B,CAAP;AACD;;AAED,aAAO,MAAP;AACD,KANa,EAMX,WANW,CAAd;AAOD;;AAED,SAAO,WAAP;AACD,CAzDY,C;;;;;;;;;;;;;;;;;;;;;;;;ACRb;;AAGA,IAAM,WAAW,GAAQ,IAAI,0BAAJ,EAAzB;AAMS;;AAJT,IAAI,WAAW,CAAC,eAAhB,EAAiC;AAC/B,aAAW,CAAC,eAAZ,CAA4B,EAA5B;AACD;;AAGY,qBAAa,0BAAb,C;;;;;;;;;;;;;;;;;;ACVb,IAAM,mBAAmB,GAAG,SAAtB,mBAAsB;AAC1B,WAAE,OAAO,MAAP,KAAkB,WAAlB,IAAiC,MAAM,CAAC,QAAxC,IAAoD,MAAM,CAAC,QAAP,CAAgB,aAApE,IAAqF,MAAM,CAAC,UAA9F;AAAyG,CAD3G;;AASA,IAAM,MAAM,GAAG;AACb,OAAK,EAAE,mBAAmB,EADb;AAGb,KAAG,EAAE,aAAC,GAAD,EAAa;AAChB,WAAO,MAAM,CAAC,GAAD,CAAb;AACD,GALY;AAOb,KAAG,EAAE,aAAC,GAAD,EAAuC,KAAvC,EAAkD;AACrD,QAAI,OAAO,GAAP,KAAe,QAAnB,EAA6B;AAC3B,YAAM,CAAC,GAAD,CAAN,GAAc,KAAd;AACD,KAFD,MAEO;AACL,UAAM,IAAI,GAAG,MAAM,CAAC,IAAP,CAAY,GAAZ,CAAb;;AAEA,UAAI,IAAI,IAAI,IAAI,CAAC,MAAjB,EAAyB;AACvB,YAAI,CAAC,OAAL,CAAa,UAAC,CAAD,EAAoB;AAC/B,gBAAM,CAAC,CAAD,CAAN,GAAY,GAAG,CAAC,CAAD,CAAf;AACD,SAFD;AAGD;AACF;AACF;AAnBY,CAAf;AAsBA,qBAAe,MAAf,C;;;;;;;;;;;;;;;;;;AC/Ba,4BAAoB,UAAC,KAAD,EAAa,KAAb,EAA0B;AACjD;AACF;;AAEN,MAAI,UAAJ,EAAgB;AACd,cAAU,GAAG,cAAb;AACD;;AAED,SAAO,UAAU,KAAK,KAAtB;AACD,CATY,C;;;;;;;;;;;;;;;;;ACCb,IAAM,KAAK,GAAG,kBAAyB,YAAvC;;AAEa,eAAO,UAAC,SAAD,EAAqB,MAArB,EAAmC;AAAE;;OAAA,U,EAAA,qB,EAAA,I,EAAc;AAAd;;;AACvD,MAAI,KAAK,IAAI,OAAO,OAAP,KAAmB,WAA5B,IAA2C,OAAO,CAAC,IAAvD,EAA6D;AAC3D,QAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,aAAO,CAAC,IAAR,CAAa,6CAAb;AACD;;AAED,QAAI,CAAC,SAAL,EAAgB;AACd,UAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,eAAO,CAAC,IAAR,CACE,uEACE,6DAFJ;AAID,OALD,MAKO;AACL,YAAI,UAAQ,GAAG,CAAf;AAEA,eAAO,CAAC,IAAR,CAAa,MAAM,CAAC,OAAP,CAAe,KAAf,EAAsB;AAAM,qBAAI,CAAC,UAAL,EAAI,CAAJ;AAAgB,SAA5C,CAAb;AACD;AACF;AACF;AACF,CAnBY,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACHb;;AACA;;AACA;;AAGa,iBAAS,IAAI,CAAC,EAAL,GAAU,GAAnB;;AAEA,yBAAiB,UAAC,KAAD,EAAc;AAAK,SAAC,KAAK,GAAG,IAAI,CAAC,EAAd;AAAuB,CAA3D;;AAEA,yBAAiB,UAAC,aAAD,EAAsB;AAAK,SAAC,aAAa,GAAG,GAAjB,GAAwB,IAAI,CAA5B;AAA+B,CAA3E;;AAEA,2BAAmB,UAAC,EAAD,EAAa,EAAb,EAAyB,MAAzB,EAAyC,KAAzC,EAAsD;AAAiB,SAAC;AACtG,KAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAL,CAAS,CAAC,cAAD,GAAU,KAAnB,IAA4B,MADkE;AAEtG,KAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAL,CAAS,CAAC,cAAD,GAAU,KAAnB,IAA4B;AAFkE,GAAD;AAGrG,CAHW;;AAKA,uBAAe,UAC1B,KAD0B,EAE1B,MAF0B,EAG1B,MAH0B,EAQzB;AALD;AAAA;AACE,SAAG,EAAE,CADP;AAEE,WAAK,EAAE,CAFT;AAGE,YAAM,EAAE,CAHV;AAIE,UAAI,EAAE;AAJR;AAKC;;AAED,aAAI,CAAC,GAAL,CACE,IAAI,CAAC,GAAL,CAAS,KAAK,IAAI,MAAM,CAAC,IAAP,IAAe,CAAnB,CAAL,IAA8B,MAAM,CAAC,KAAP,IAAgB,CAA9C,CAAT,CADF,EAEE,IAAI,CAAC,GAAL,CAAS,MAAM,IAAI,MAAM,CAAC,GAAP,IAAc,CAAlB,CAAN,IAA8B,MAAM,CAAC,MAAP,IAAiB,CAA/C,CAAT,CAFF,IAGI,CAHJ;AAGK,CAbM;;AAwBA,wBAAgB,UAC3B,KAD2B,EAE3B,OAF2B,EAG3B,MAH2B,EAI3B,QAJ2B,EAK3B,SAL2B,EAKV;AAET;AAAA,MAAO,qBAAP;AACF;AAAA,MAAY,yBAAZ;AACN,MAAM,EAAE,GAAG,4BAAgB,KAAK,CAAC,EAAtB,EAA0B,KAA1B,EAAiC,KAAK,GAAG,CAAzC,CAAX;AACA,MAAM,EAAE,GAAG,4BAAgB,KAAK,CAAC,EAAtB,EAA0B,MAA1B,EAAkC,MAAM,GAAG,CAA3C,CAAX;AACA,MAAM,SAAS,GAAG,qBAAa,KAAb,EAAoB,MAApB,EAA4B,MAA5B,CAAlB;AACA,MAAM,WAAW,GAAG,4BAAgB,KAAK,CAAC,WAAtB,EAAmC,SAAnC,EAA8C,CAA9C,CAApB;AACA,MAAM,WAAW,GAAG,4BAAgB,KAAK,CAAC,WAAtB,EAAmC,SAAnC,EAA8C,SAAS,GAAG,GAA1D,CAApB;AACA,MAAM,GAAG,GAAG,MAAM,CAAC,IAAP,CAAY,OAAZ,CAAZ;AAEA,SAAO,GAAG,CAAC,MAAJ,CAAW,UAAC,MAAD,EAAS,EAAT,EAAW;;;AAC3B,QAAM,IAAI,GAAG,OAAO,CAAC,EAAD,CAApB;AACQ;AAAA,QAAQ,wBAAR;AACR,QAAI,KAAJ;;AAEA,QAAI,oBAAE,KAAF,CAAQ,IAAI,CAAC,KAAb,CAAJ,EAAyB;AACvB,UAAI,QAAQ,KAAK,WAAjB,EAA8B;AAC5B,aAAK,GAAG,CAAC,UAAD,EAAa,QAAb,CAAR;AACD,OAFD,MAEO,IAAI,QAAQ,KAAK,YAAjB,EAA+B;AACpC,aAAK,GAAG,CAAC,WAAD,EAAc,WAAd,CAAR;AACD;;AAED,UAAI,QAAJ,EAAc;AACZ,aAAK,GAAG,CAAC,KAAK,CAAC,CAAD,CAAN,EAAW,KAAK,CAAC,CAAD,CAAhB,CAAR;AACD;AACF,KAVD,MAUO;AACF,wBAAH;AACC,6BAAY,mBAAZ;AACF;;AAEK;AAAA,QAAE,gCAAF;AAAA,QAAiB,gBAAjB;;AACN,SAAK,CAAC,MAAN,CAAa,MAAb,EAAqB,KAArB,CAA2B,KAA3B;AACA,oCAAmB,KAAnB;AACA,QAAM,KAAK,GAAG,6BAAgB,KAAhB,EAAqB,sBAAO,IAAP,GAAW;AAAE,mBAAa;AAAf,KAAX,CAArB,CAAd;;AAEA,QAAM,SAAS,kCACV,IADU,GAEV,KAFU,GAEL;AACR,WAAK,OADG;AAER,YAAM,EAAE,WAFA;AAGR,mBAAa,eAHL;AAIR,WAAK,OAJG;AAKR,QAAE,IALM;AAMR,QAAE,IANM;AAOR,iBAAW,aAPH;AAQR,iBAAW,aARH;AASR,gBAAU,YATF;AAUR,cAAQ;AAVA,KAFK,CAAf;;AAeA,iCAAY,MAAZ,IAAkB,YAAG,EAAH,IAAQ,SAAR,EAAiB,EAAnC;AACD,GAzCM,EAyCJ,EAzCI,CAAP;AA0CD,CA1DY;;AA4DA,gCAAwB,UAAC,KAAD,EAAoB,YAApB,EAA4C;AACvE;AAAA,MAAO,YAAP;AACA;AAAA,MAAO,mBAAP;AAER,SAAO,IAAI,CAAC,IAAL,CAAU,SAAC,EAAE,GAAG,EAAN,EAAa,CAAb,IAAiB,SAAC,EAAE,GAAG,EAAN,EAAa,CAAb,CAA3B,CAAP;AACD,CALY;;AAOA,0BAAkB,UAAC,EAAD,EAAuB,EAAvB,EAAiD;MAA9C,Q;MAAG,Q;MAAmB,U;MAAI,U;AAC1D,MAAM,MAAM,GAAG,8BAAsB;AAAE,KAAC,GAAH;AAAK,KAAC;AAAN,GAAtB,EAAgC;AAAE,KAAC,EAAE,EAAL;AAAS,KAAC,EAAE;AAAZ,GAAhC,CAAf;;AAEA,MAAI,MAAM,IAAI,CAAd,EAAiB;AACf,WAAO;AAAE,YAAM;AAAR,KAAP;AACD;;AAED,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,EAAL,IAAW,MAAvB;AACA,MAAI,aAAa,GAAG,IAAI,CAAC,IAAL,CAAU,GAAV,CAApB;;AAEA,MAAI,CAAC,GAAG,EAAR,EAAY;AACV,iBAAa,GAAG,IAAI,IAAI,CAAC,EAAT,GAAc,aAA9B;AACD;;AAED,SAAO;AAAE,UAAM,QAAR;AAAU,SAAK,EAAE,uBAAe,aAAf,CAAjB;AAAgD,iBAAa;AAA7D,GAAP;AACD,CAfY;;AAiBA,8BAAsB,UAAC,EAAD,EAAyC;MAAtC,0B;MAAY,sB;AAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAL,CAAW,UAAU,GAAG,GAAxB,CAAjB;AACA,MAAM,MAAM,GAAG,IAAI,CAAC,KAAL,CAAW,QAAQ,GAAG,GAAtB,CAAf;AACA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,MAAnB,CAAZ;AAEA,SAAO;AACL,cAAU,EAAE,UAAU,GAAG,GAAG,GAAG,GAD1B;AAEL,YAAQ,EAAE,QAAQ,GAAG,GAAG,GAAG;AAFtB,GAAP;AAID,CATY;;AAWb,IAAM,yBAAyB,GAAG,SAA5B,yBAA4B,CAAC,KAAD,EAAgB,EAAhB,EAAwD;MAAtC,0B;MAAY,sB;AAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAL,CAAW,UAAU,GAAG,GAAxB,CAAjB;AACA,MAAM,MAAM,GAAG,IAAI,CAAC,KAAL,CAAW,QAAQ,GAAG,GAAtB,CAAf;AACA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAL,CAAS,QAAT,EAAmB,MAAnB,CAAZ;AAEA,SAAO,KAAK,GAAG,GAAG,GAAG,GAArB;AACD,CAND;;AAQa,0BAAkB,UAAC,EAAD,EAAuB,MAAvB,EAA6C;MAA1C,Q;MAAG,Q;;AAC7B;AAAA;AAAA;AAAA;AAAA,MAAE,kBAAF;AAAA,MAAU,gBAAV;;AACE;AAAA,MAAa,gCAAb;;AAER,MAAI,MAAM,GAAG,WAAT,IAAwB,MAAM,GAAG,WAArC,EAAkD;AAChD,WAAO,KAAP;AACD;;AAED,MAAI,MAAM,KAAK,CAAf,EAAkB;AAChB,WAAO,IAAP;AACD;;AAEK;AAAA,MAAE,0BAAF;AAAA,MAAc,sBAAd;;AACN,MAAI,WAAW,GAAG,KAAlB;AACA,MAAI,OAAJ;;AAEA,MAAI,UAAU,IAAI,QAAlB,EAA4B;AAC1B,WAAO,WAAW,GAAG,QAArB,EAA+B;AAC7B,iBAAW,IAAI,GAAf;AACD;;AACD,WAAO,WAAW,GAAG,UAArB,EAAiC;AAC/B,iBAAW,IAAI,GAAf;AACD;;AACD,WAAO,GAAG,WAAW,IAAI,UAAf,IAA6B,WAAW,IAAI,QAAtD;AACD,GARD,MAQO;AACL,WAAO,WAAW,GAAG,UAArB,EAAiC;AAC/B,iBAAW,IAAI,GAAf;AACD;;AACD,WAAO,WAAW,GAAG,QAArB,EAA+B;AAC7B,iBAAW,IAAI,GAAf;AACD;;AACD,WAAO,GAAG,WAAW,IAAI,QAAf,IAA2B,WAAW,IAAI,UAApD;AACD;;AAED,MAAI,OAAJ,EAAa;AACX,iCAAY,MAAZ,GAAkB;AAAE,YAAM,QAAR;AAAU,WAAK,EAAE,yBAAyB,CAAC,WAAD,EAAc,MAAd;AAA1C,KAAlB;AACD;;AAED,SAAO,IAAP;AACD,CAvCY,C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC/Ib;;AACA;;AAEA;;AACA;;AAEA,IAAM,uBAAuB,GAAQ;AACnC,OAAK,EAAE,SAD4B;AAEnC,WAAS,EAAE,aAFwB;AAGnC,SAAO,EAAE,WAH0B;AAInC,WAAS,EAAE,aAJwB;AAKnC,WAAS,EAAE,aALwB;AAMnC,UAAQ,EAAE,YANyB;AAOnC,YAAU,EAAE,cAPuB;AAQnC,YAAU,EAAE,cARuB;AASnC,aAAW,EAAE,eATsB;AAUnC,UAAQ,EAAE,YAVyB;AAWnC,WAAS,EAAE,aAXwB;AAYnC,YAAU,EAAE;AAZuB,CAArC;AAiBa,sBAAc,CACzB,MADyB,EAEzB,QAFyB,EAGzB,KAHyB,EAIzB,MAJyB,EAKzB,KALyB,EAMzB,UANyB,EAOzB,MAPyB,EAQzB,MARyB,EASzB,OATyB,EAUzB,SAVyB,EAWzB,UAXyB,EAYzB,UAZyB,EAazB,KAbyB,EAczB,YAdyB,EAezB,WAfyB,CAAd;AAkBA,uBAAe,CAC1B,WAD0B,EAE1B,MAF0B,EAG1B,QAH0B,EAI1B,MAJ0B,EAK1B,QAL0B,EAM1B,OAN0B,EAO1B,SAP0B,EAQ1B,MAR0B,EAS1B,UAT0B,EAU1B,KAV0B,EAW1B,MAX0B,CAAf;AAcA,wBAAgB,CAAC,MAAD,CAAhB;;AAOA,yBAAiB,UAAC,IAAD,EAAU;AACtC,MAAI,OAAO,IAAP,KAAgB,QAApB,EAA8B;AAC5B,WAAO,IAAP;AACD;;AACD,MAAI,CAAC,IAAL,EAAW;AACT,WAAO,EAAP;AACD;;AACD,SAAO,IAAI,CAAC,WAAL,IAAoB,IAAI,CAAC,IAAzB,IAAiC,WAAxC;AACD,CARY;;AAcA,wBAAgB,UAC3B,QAD2B,EAE3B,IAF2B,EAEJ;AAEvB,MAAM,MAAM,GAAuD,EAAnE;AACA,MAAI,KAAK,GAAa,EAAtB;;AAEA,MAAI,oBAAE,OAAF,CAAU,IAAV,CAAJ,EAAqB;AACnB,SAAK,GAAG,IAAI,CAAC,GAAL,CAAS,aAAC;AAAI;AAAiB,KAA/B,CAAR;AACD,GAFD,MAEO;AACL,SAAK,GAAG,CAAC,uBAAe,IAAf,CAAD,CAAR;AACD;;AAED,qBAAM,QAAN,CAAe,OAAf,CAAuB,QAAvB,EAAiC,UAAC,KAAD,EAAwD;AACvF,QAAM,SAAS,GAAG,oBAAE,GAAF,CAAM,KAAN,EAAa,kBAAb,KAAoC,oBAAE,GAAF,CAAM,KAAN,EAAa,WAAb,CAAtD;;AACA,QAAI,KAAK,CAAC,OAAN,CAAc,SAAd,MAA6B,CAAC,CAAlC,EAAqC;AACnC,YAAM,CAAC,IAAP,CAAY,KAAZ;AACD;AACF,GALD;AAOA,SAAO,MAAP;AACD,CArBY;;AA0BA,0BAAkB,UAC7B,QAD6B,EAE7B,IAF6B,EAEjB;AAEZ,MAAM,MAAM,GAAG,sBAAc,QAAd,EAAwB,IAAxB,CAAf;AAEA,SAAO,MAAM,IAAI,MAAM,CAAC,CAAD,CAAvB;AACD,CAPY;;AAYA,sBAAc,UAAC,QAAD,EAAsB,IAAtB,EAAkC;AAC3D,MAAM,WAAW,GAAgB,EAAjC;AACA,MAAI,KAAJ;;AAEA,MAAI,oBAAE,OAAF,CAAU,IAAV,CAAJ,EAAqB;AACnB,SAAK,GAAG,IAAI,CAAC,GAAL,CAAS,aAAC;AAAI;AAAiB,KAA/B,CAAR;AACD,GAFD,MAEO;AACL,SAAK,GAAG,CAAC,uBAAe,IAAf,CAAD,CAAR;AACD;;AAED,qBAAM,QAAN,CAAe,OAAf,CAAuB,QAAvB,EAAiC,iBAAK;AACpC,QAAM,WAAW,GAAG,oBAAE,GAAF,CAAM,KAAN,EAAa,kBAAb,CAApB;;AAEA,QAAI,WAAW,IAAI,KAAK,CAAC,OAAN,CAAc,WAAd,MAA+B,CAAC,CAAnD,EAAsD;AACpD;AACD;;AACD,eAAW,CAAC,IAAZ,CAAiB,KAAjB;AACD,GAPD;AASA,SAAO,WAAP;AACD,CApBY;;AA2BA,8BAAsB,UAAC,EAAD,EAAQ;AACzC,MAAI,CAAC,EAAD,IAAO,CAAC,EAAE,CAAC,KAAf,EAAsB;AACpB,WAAO,KAAP;AACD;;AACK;AAAA,MAAE,gBAAF;AAAA,MAAS,kBAAT;;AAEN,MAAI,CAAC,qBAAS,KAAT,CAAD,IAAoB,KAAK,IAAI,CAA7B,IAAkC,CAAC,qBAAS,MAAT,CAAnC,IAAuD,MAAM,IAAI,CAArE,EAAwE;AACtE,WAAO,KAAP;AACD;;AAED,SAAO,IAAP;AACD,CAXY;;AAab,IAAM,QAAQ,GAAa,CACzB,GADyB,EAEzB,UAFyB,EAGzB,aAHyB,EAIzB,cAJyB,EAKzB,SALyB,EAMzB,cANyB,EAOzB,eAPyB,EAQzB,kBARyB,EASzB,QATyB,EAUzB,UAVyB,EAWzB,eAXyB,EAYzB,QAZyB,EAazB,MAbyB,EAczB,MAdyB,EAezB,SAfyB,EAgBzB,SAhByB,EAiBzB,eAjByB,EAkBzB,qBAlByB,EAmBzB,aAnByB,EAoBzB,kBApByB,EAqBzB,mBArByB,EAsBzB,mBAtByB,EAuBzB,gBAvByB,EAwBzB,SAxByB,EAyBzB,SAzByB,EA0BzB,SA1ByB,EA2BzB,SA3ByB,EA4BzB,SA5ByB,EA6BzB,gBA7ByB,EA8BzB,SA9ByB,EA+BzB,SA/ByB,EAgCzB,aAhCyB,EAiCzB,cAjCyB,EAkCzB,UAlCyB,EAmCzB,cAnCyB,EAoCzB,oBApCyB,EAqCzB,aArCyB,EAsCzB,QAtCyB,EAuCzB,cAvCyB,EAwCzB,QAxCyB,EAyCzB,MAzCyB,EA0CzB,WA1CyB,EA2CzB,kBA3CyB,EA4CzB,gBA5CyB,EA6CzB,eA7CyB,EA8CzB,eA9CyB,EA+CzB,GA/CyB,EAgDzB,OAhDyB,EAiDzB,UAjDyB,EAkDzB,OAlDyB,EAmDzB,OAnDyB,EAoDzB,MApDyB,EAqDzB,cArDyB,EAsDzB,QAtDyB,EAuDzB,MAvDyB,EAwDzB,UAxDyB,EAyDzB,eAzDyB,EA0DzB,OA1DyB,EA2DzB,MA3DyB,EA4DzB,SA5DyB,EA6DzB,SA7DyB,EA8DzB,UA9DyB,EA+DzB,gBA/DyB,EAgEzB,MAhEyB,EAiEzB,QAjEyB,EAkEzB,KAlEyB,EAmEzB,MAnEyB,EAoEzB,OApEyB,EAqEzB,KArEyB,EAsEzB,QAtEyB,EAuEzB,QAvEyB,EAwEzB,MAxEyB,EAyEzB,UAzEyB,EA0EzB,OA1EyB,EA2EzB,MA3EyB,EA4EzB,OA5EyB,EA6EzB,KA7EyB,EA8EzB,MA9EyB,EA+EzB,OA/EyB,CAA3B;;AAkFA,IAAM,YAAY,GAAG,SAAf,YAAe,CAAC,KAAD,EAAW;AAAK,cAAK,IAAI,KAAK,CAAC,IAAf,IAAuB,oBAAE,QAAF,CAAW,KAAK,CAAC,IAAjB,CAAvB,IAAiD,QAAQ,CAAC,OAAT,CAAiB,KAAK,CAAC,IAAvB,KAAjD;AAAkF,CAAvH;;AAOa,4BAAoB,UAAC,QAAD,EAA+B;AAC9D,MAAM,WAAW,GAAG,EAApB;AAEA,qBAAM,QAAN,CAAe,OAAf,CAAuB,QAAvB,EAAiC,UAAC,KAAD,EAA0B;AACzD,QAAI,KAAK,IAAI,KAAK,CAAC,IAAf,IAAuB,oBAAE,QAAF,CAAW,KAAK,CAAC,IAAjB,CAAvB,IAAiD,QAAQ,CAAC,OAAT,CAAiB,KAAK,CAAC,IAAvB,KAAgC,CAArF,EAAwF;AACtF,iBAAW,CAAC,IAAZ,CAAiB,KAAjB;AACD;AACF,GAJD;AAMA,SAAO,WAAP;AACD,CAVY;;AAkBA,0BAAkB,UAAC,YAAD,EAAqC,YAArC,EAAuE;AACpG,MAAI,YAAY,KAAK,YAArB,EAAmC;AACjC,WAAO,IAAP;AACD;;AAED,MAAI,iBAAS,KAAT,CAAe,YAAf,MAAiC,iBAAS,KAAT,CAAe,YAAf,CAArC,EAAmE;AACjE,WAAO,KAAP;AACD;;AACD,MAAM,KAAK,GAAG,iBAAS,KAAT,CAAe,YAAf,CAAd;;AAEA,MAAI,KAAK,KAAK,CAAd,EAAiB;AACf,WAAO,IAAP;AACD;;AACD,MAAI,KAAK,KAAK,CAAd,EAAiB;AAEf,WAAO,2BACL,oBAAE,OAAF,CAAU,YAAV,IAA0B,YAAY,CAAC,CAAD,CAAtC,GAA4C,YADvC,EAEL,oBAAE,OAAF,CAAU,YAAV,IAA0B,YAAY,CAAC,CAAD,CAAtC,GAA4C,YAFvC,CAAP;AAID;;AAED,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAApB,EAA2B,CAAC,EAA5B,EAAgC;AAC9B,QAAM,SAAS,GAAQ,YAAY,CAAC,CAAD,CAAnC;AACA,QAAM,SAAS,GAAQ,YAAY,CAAC,CAAD,CAAnC;;AAEA,QAAI,oBAAE,OAAF,CAAU,SAAV,KAAwB,oBAAE,OAAF,CAAU,SAAV,CAA5B,EAAkD;AAChD,UAAI,CAAC,wBAAgB,SAAhB,EAA2B,SAA3B,CAAL,EAA4C;AAC1C,eAAO,KAAP;AACD;AAEF,KALD,MAKO,IAAI,CAAC,2BAAmB,SAAnB,EAA8B,SAA9B,CAAL,EAA+C;AACpD,aAAO,KAAP;AACD;AACF;;AAED,SAAO,IAAP;AACD,CApCY;;AAsCA,6BAAqB,UAAC,SAAD,EAAgC,SAAhC,EAA6D;AAC7F,MAAI,oBAAE,KAAF,CAAQ,SAAR,KAAsB,oBAAE,KAAF,CAAQ,SAAR,CAA1B,EAA8C;AAC5C,WAAO,IAAP;AACD;;AACD,MAAI,CAAC,oBAAE,KAAF,CAAQ,SAAR,CAAD,IAAuB,CAAC,oBAAE,KAAF,CAAQ,SAAR,CAA5B,EAAgD;AAC9C,QAAM,0BAAN;AAAA,QAAQ,0BAAR;AAAA,QAAgC,oCAAhC;;AACA,QAAM,0BAAN;AAAA,QAAQ,0BAAR;AAAA,QAAgC,oCAAhC;;AAEA,QAAI,YAAY,IAAI,YAApB,EAAkC;AAEhC,aAAO,4BAAa,SAAb,EAAwB,SAAxB,KAAsC,wBAAgB,YAAhB,EAA8B,YAA9B,CAA7C;AACD;;AACD,QAAI,CAAC,YAAD,IAAiB,CAAC,YAAtB,EAAoC;AAClC,aAAO,4BAAa,SAAb,EAAwB,SAAxB,CAAP;AACD;;AAED,WAAO,KAAP;AACD;;AAED,SAAO,KAAP;AACD,CApBY;;AAsBA,wBAAgB,UAAC,QAAD,EAAiC,SAAjC,EAA+C;AAC1E,MAAI,QAAQ,GAAyB,EAArC;AACA,MAAM,MAAM,GAAQ,EAApB;AAEA,mBAAS,OAAT,CAAiB,QAAjB,EAA2B,UAAC,KAAD,EAAQ,KAAR,EAAa;AACtC,QAAI,KAAK,IAAI,YAAY,CAAC,KAAD,CAAzB,EAAkC;AAChC,cAAQ,CAAC,IAAT,CAAc,KAAd;AACD,KAFD,MAEO,IAAI,KAAK,IAAI,SAAS,CAAC,uBAAe,KAAK,CAAC,IAArB,CAAD,CAAtB,EAAoD;AACzD,UAAM,WAAW,GAAG,uBAAe,KAAK,CAAC,IAArB,CAApB;AACM;AAAA,UAAE,oBAAF;AAAA,UAAW,cAAX;;AAEN,UAAK,IAAI,IAAI,CAAC,MAAM,CAAC,WAAD,CAAhB,IAAkC,CAAC,IAAvC,EAA6C;AAC3C,YAAM,OAAO,GAAG,OAAO,CAAC,KAAD,EAAQ,WAAR,EAAqB,KAArB,CAAvB;;AAEA,YAAI,oBAAE,OAAF,CAAU,OAAV,CAAJ,EAAwB;AACtB,kBAAQ,mBAAI,QAAJ,GAAiB,OAAjB,CAAR;AACD,SAFD,MAEO;AACL,kBAAQ,CAAC,IAAT,CAAc,OAAd;AACD;;AAED,cAAM,CAAC,WAAD,CAAN,GAAsB,IAAtB;AACD;AACF;AACF,GAnBD;AAqBA,SAAO,QAAP;AACD,CA1BY;;AA4BA,8BAAsB,UAAC,CAAD,EAAO;AACxC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAApB;;AAEA,MAAI,IAAI,IAAI,uBAAuB,CAAC,IAAD,CAAnC,EAA2C;AACzC,WAAO,uBAAuB,CAAC,IAAD,CAA9B;AACD;;AAED,SAAO,IAAP;AACD,CARY;;AAUA,0BAAkB,UAAC,KAAD,EAAa,QAAb,EAA4B;AACzD,MAAI,MAAM,GAAG,CAAC,CAAd;AACA,mBAAS,OAAT,CAAiB,QAAjB,EAA2B,UAAC,KAAD,EAAQ,KAAR,EAAa;AACtC,QAAI,KAAK,KAAK,KAAd,EAAqB;AACnB,YAAM,GAAG,KAAT;AACD;AACF,GAJD;AAMA,SAAO,MAAP;AACD,CATY,C;;;;;;;;;;;;;;;;;;ACvWb,SAAgB,YAAhB,CAA6B,CAA7B,EAAqC,CAArC,EAA2C;AAEzC,OAAK,IAAM,GAAX,IAAkB,CAAlB,EAAqB;AACnB,QAAI,GAAG,cAAH,CAAkB,IAAlB,CAAuB,CAAvB,EAA0B,GAA1B,MAAmC,CAAC,GAAG,cAAH,CAAkB,IAAlB,CAAuB,CAAvB,EAA0B,GAA1B,CAAD,IAAmC,CAAC,CAAC,GAAD,CAAD,KAAW,CAAC,CAAC,GAAD,CAAlF,CAAJ,EAA8F;AAC5F,aAAO,KAAP;AACD;AACF;;AACD,OAAK,IAAM,GAAX,IAAkB,CAAlB,EAAqB;AACnB,QAAI,GAAG,cAAH,CAAkB,IAAlB,CAAuB,CAAvB,EAA0B,GAA1B,KAAkC,CAAC,GAAG,cAAH,CAAkB,IAAlB,CAAuB,CAAvB,EAA0B,GAA1B,CAAvC,EAAuE;AACrE,aAAO,KAAP;AACD;AACF;;AACD,SAAO,IAAP;AACD;;AAbD,oC;;;;;;;;;;;;;;;;;;;;;;;;;;ACAA;;AAwBA;;AA0RA,IAAM,oBAAoB,GAAG,CAAC,SAAD,EAAY,UAAZ,CAA7B;AACA,IAAM,kBAAkB,GAAG,CACzB,WADyB,EAEzB,OAFyB,EAGzB,QAHyB,EAIzB,IAJyB,EAKzB,MALyB,EAMzB,KANyB,EAOzB,OAPyB,EAQzB,QARyB,EASzB,KATyB,EAUzB,MAVyB,EAWzB,OAXyB,EAYzB,QAZyB,EAazB,MAbyB,EAczB,OAdyB,EAezB,MAfyB,EAgBzB,UAhByB,EAiBzB,cAjByB,EAkBzB,YAlByB,EAmBzB,UAnByB,EAoBzB,mBApByB,EAqBzB,cArByB,EAsBzB,YAtByB,EAuBzB,WAvByB,EAwBzB,YAxByB,EAyBzB,QAzByB,EA0BzB,eA1ByB,EA2BzB,eA3ByB,EA4BzB,aA5ByB,EA6BzB,SA7ByB,EA8BzB,eA9ByB,EA+BzB,eA/ByB,EAgCzB,aAhCyB,EAiCzB,MAjCyB,EAkCzB,OAlCyB,EAmCzB,MAnCyB,EAoCzB,IApCyB,EAqCzB,UArCyB,EAsCzB,WAtCyB,EAuCzB,MAvCyB,EAwCzB,UAxCyB,EAyCzB,eAzCyB,EA0CzB,UA1CyB,EA2CzB,oBA3CyB,EA4CzB,2BA5CyB,EA6CzB,cA7CyB,EA8CzB,gBA9CyB,EA+CzB,mBA/CyB,EAgDzB,kBAhDyB,EAiDzB,QAjDyB,EAkDzB,IAlDyB,EAmDzB,IAnDyB,EAoDzB,GApDyB,EAqDzB,YArDyB,EAsDzB,SAtDyB,EAuDzB,iBAvDyB,EAwDzB,WAxDyB,EAyDzB,SAzDyB,EA0DzB,SA1DyB,EA2DzB,kBA3DyB,EA4DzB,KA5DyB,EA6DzB,IA7DyB,EA8DzB,IA9DyB,EA+DzB,UA/DyB,EAgEzB,WAhEyB,EAiEzB,kBAjEyB,EAkEzB,KAlEyB,EAmEzB,UAnEyB,EAoEzB,2BApEyB,EAqEzB,MArEyB,EAsEzB,aAtEyB,EAuEzB,UAvEyB,EAwEzB,QAxEyB,EAyEzB,WAzEyB,EA0EzB,aA1EyB,EA2EzB,YA3EyB,EA4EzB,cA5EyB,EA6EzB,WA7EyB,EA8EzB,YA9EyB,EA+EzB,UA/EyB,EAgFzB,gBAhFyB,EAiFzB,aAjFyB,EAkFzB,WAlFyB,EAmFzB,aAnFyB,EAoFzB,YApFyB,EAqFzB,QArFyB,EAsFzB,MAtFyB,EAuFzB,IAvFyB,EAwFzB,IAxFyB,EAyFzB,IAzFyB,EA0FzB,IA1FyB,EA2FzB,WA3FyB,EA4FzB,4BA5FyB,EA6FzB,0BA7FyB,EA8FzB,UA9FyB,EA+FzB,mBA/FyB,EAgGzB,eAhGyB,EAiGzB,SAjGyB,EAkGzB,WAlGyB,EAmGzB,cAnGyB,EAoGzB,MApGyB,EAqGzB,aArGyB,EAsGzB,gBAtGyB,EAuGzB,KAvGyB,EAwGzB,IAxGyB,EAyGzB,WAzGyB,EA0GzB,IA1GyB,EA2GzB,IA3GyB,EA4GzB,IA5GyB,EA6GzB,IA7GyB,EA8GzB,GA9GyB,EA+GzB,cA/GyB,EAgHzB,kBAhHyB,EAiHzB,SAjHyB,EAkHzB,WAlHyB,EAmHzB,YAnHyB,EAoHzB,UApHyB,EAqHzB,cArHyB,EAsHzB,eAtHyB,EAuHzB,eAvHyB,EAwHzB,mBAxHyB,EAyHzB,OAzHyB,EA0HzB,WA1HyB,EA2HzB,cA3HyB,EA4HzB,WA5HyB,EA6HzB,aA7HyB,EA8HzB,aA9HyB,EA+HzB,aA/HyB,EAgIzB,MAhIyB,EAiIzB,kBAjIyB,EAkIzB,WAlIyB,EAmIzB,cAnIyB,EAoIzB,MApIyB,EAqIzB,YArIyB,EAsIzB,QAtIyB,EAuIzB,SAvIyB,EAwIzB,UAxIyB,EAyIzB,OAzIyB,EA0IzB,QA1IyB,EA2IzB,aA3IyB,EA4IzB,QA5IyB,EA6IzB,UA7IyB,EA8IzB,kBA9IyB,EA+IzB,mBA/IyB,EAgJzB,YAhJyB,EAiJzB,SAjJyB,EAkJzB,YAlJyB,EAmJzB,qBAnJyB,EAoJzB,kBApJyB,EAqJzB,cArJyB,EAsJzB,eAtJyB,EAuJzB,QAvJyB,EAwJzB,WAxJyB,EAyJzB,WAzJyB,EA0JzB,WA1JyB,EA2JzB,eA3JyB,EA4JzB,qBA5JyB,EA6JzB,gBA7JyB,EA8JzB,GA9JyB,EA+JzB,QA/JyB,EAgKzB,MAhKyB,EAiKzB,MAjKyB,EAkKzB,iBAlKyB,EAmKzB,aAnKyB,EAoKzB,WApKyB,EAqKzB,oBArKyB,EAsKzB,kBAtKyB,EAuKzB,SAvKyB,EAwKzB,QAxKyB,EAyKzB,QAzKyB,EA0KzB,IA1KyB,EA2KzB,IA3KyB,EA4KzB,MA5KyB,EA6KzB,gBA7KyB,EA8KzB,OA9KyB,EA+KzB,SA/KyB,EAgLzB,kBAhLyB,EAiLzB,kBAjLyB,EAkLzB,OAlLyB,EAmLzB,cAnLyB,EAoLzB,aApLyB,EAqLzB,cArLyB,EAsLzB,OAtLyB,EAuLzB,OAvLyB,EAwLzB,aAxLyB,EAyLzB,WAzLyB,EA0LzB,aA1LyB,EA2LzB,uBA3LyB,EA4LzB,wBA5LyB,EA6LzB,QA7LyB,EA8LzB,QA9LyB,EA+LzB,iBA/LyB,EAgMzB,kBAhMyB,EAiMzB,eAjMyB,EAkMzB,gBAlMyB,EAmMzB,kBAnMyB,EAoMzB,eApMyB,EAqMzB,aArMyB,EAsMzB,cAtMyB,EAuMzB,gBAvMyB,EAwMzB,aAxMyB,EAyMzB,SAzMyB,EA0MzB,SA1MyB,EA2MzB,YA3MyB,EA4MzB,gBA5MyB,EA6MzB,YA7MyB,EA8MzB,eA9MyB,EA+MzB,IA/MyB,EAgNzB,WAhNyB,EAiNzB,IAjNyB,EAkNzB,IAlNyB,EAmNzB,mBAnNyB,EAoNzB,oBApNyB,EAqNzB,SArNyB,EAsNzB,aAtNyB,EAuNzB,cAvNyB,EAwNzB,YAxNyB,EAyNzB,aAzNyB,EA0NzB,QA1NyB,EA2NzB,cA3NyB,EA4NzB,SA5NyB,EA6NzB,UA7NyB,EA8NzB,aA9NyB,EA+NzB,aA/NyB,EAgOzB,UAhOyB,EAiOzB,cAjOyB,EAkOzB,YAlOyB,EAmOzB,YAnOyB,EAoOzB,eApOyB,EAqOzB,QArOyB,EAsOzB,aAtOyB,EAuOzB,aAvOyB,EAwOzB,IAxOyB,EAyOzB,IAzOyB,EA0OzB,GA1OyB,EA2OzB,kBA3OyB,EA4OzB,SA5OyB,EA6OzB,cA7OyB,EA8OzB,cA9OyB,EA+OzB,WA/OyB,EAgPzB,WAhPyB,EAiPzB,WAjPyB,EAkPzB,YAlPyB,EAmPzB,WAnPyB,EAoPzB,SApPyB,EAqPzB,SArPyB,EAsPzB,OAtPyB,EAuPzB,YAvPyB,EAwPzB,UAxPyB,EAyPzB,IAzPyB,EA0PzB,IA1PyB,EA2PzB,GA3PyB,EA4PzB,kBA5PyB,EA6PzB,GA7PyB,EA8PzB,YA9PyB,EA+PzB,KA/PyB,EAgQzB,KAhQyB,EAiQzB,OAjQyB,CAA3B;AAoQA,IAAM,SAAS,GAAG,CAChB,yBADgB,EAEhB,QAFgB,EAGhB,eAHgB,EAIhB,OAJgB,EAKhB,cALgB,EAMhB,SANgB,EAOhB,gBAPgB,EAQhB,kBARgB,EAShB,yBATgB,EAUhB,oBAVgB,EAWhB,2BAXgB,EAYhB,qBAZgB,EAahB,4BAbgB,EAchB,SAdgB,EAehB,gBAfgB,EAgBhB,QAhBgB,EAiBhB,eAjBgB,EAkBhB,UAlBgB,EAmBhB,iBAnBgB,EAoBhB,eApBgB,EAqBhB,sBArBgB,EAsBhB,SAtBgB,EAuBhB,gBAvBgB,EAwBhB,SAxBgB,EAyBhB,gBAzBgB,EA0BhB,UA1BgB,EA2BhB,iBA3BgB,EA4BhB,WA5BgB,EA6BhB,kBA7BgB,EA8BhB,QA9BgB,EA+BhB,eA/BgB,EAgChB,SAhCgB,EAiChB,gBAjCgB,EAkChB,WAlCgB,EAmChB,kBAnCgB,EAoChB,YApCgB,EAqChB,mBArCgB,EAsChB,SAtCgB,EAuChB,gBAvCgB,EAwChB,SAxCgB,EAyChB,gBAzCgB,EA0ChB,WA1CgB,EA2ChB,kBA3CgB,EA4ChB,kBA5CgB,EA6ChB,yBA7CgB,EA8ChB,kBA9CgB,EA+ChB,yBA/CgB,EAgDhB,WAhDgB,EAiDhB,kBAjDgB,EAkDhB,aAlDgB,EAmDhB,oBAnDgB,EAoDhB,SApDgB,EAqDhB,gBArDgB,EAsDhB,cAtDgB,EAuDhB,qBAvDgB,EAwDhB,kBAxDgB,EAyDhB,yBAzDgB,EA0DhB,aA1DgB,EA2DhB,oBA3DgB,EA4DhB,SA5DgB,EA6DhB,gBA7DgB,EA8DhB,QA9DgB,EA+DhB,eA/DgB,EAgEhB,WAhEgB,EAiEhB,kBAjEgB,EAkEhB,YAlEgB,EAmEhB,mBAnEgB,EAoEhB,cApEgB,EAqEhB,qBArEgB,EAsEhB,UAtEgB,EAuEhB,iBAvEgB,EAwEhB,WAxEgB,EAyEhB,kBAzEgB,EA0EhB,WA1EgB,EA2EhB,kBA3EgB,EA4EhB,WA5EgB,EA6EhB,kBA7EgB,EA8EhB,cA9EgB,EA+EhB,qBA/EgB,EAgFhB,gBAhFgB,EAiFhB,uBAjFgB,EAkFhB,WAlFgB,EAmFhB,kBAnFgB,EAoFhB,YApFgB,EAqFhB,mBArFgB,EAsFhB,SAtFgB,EAuFhB,gBAvFgB,EAwFhB,eAxFgB,EAyFhB,sBAzFgB,EA0FhB,eA1FgB,EA2FhB,sBA3FgB,EA4FhB,QA5FgB,EA6FhB,eA7FgB,EA8FhB,WA9FgB,EA+FhB,kBA/FgB,EAgGhB,aAhGgB,EAiGhB,oBAjGgB,EAkGhB,YAlGgB,EAmGhB,mBAnGgB,EAoGhB,aApGgB,EAqGhB,oBArGgB,EAsGhB,YAtGgB,EAuGhB,mBAvGgB,EAwGhB,aAxGgB,EAyGhB,oBAzGgB,EA0GhB,QA1GgB,EA2GhB,eA3GgB,EA4GhB,aA5GgB,EA6GhB,oBA7GgB,EA8GhB,cA9GgB,EA+GhB,cA/GgB,EAgHhB,aAhHgB,EAiHhB,oBAjHgB,EAkHhB,YAlHgB,EAmHhB,mBAnHgB,EAoHhB,aApHgB,EAqHhB,oBArHgB,EAsHhB,WAtHgB,EAuHhB,kBAvHgB,EAwHhB,UAxHgB,EAyHhB,iBAzHgB,EA0HhB,eA1HgB,EA2HhB,sBA3HgB,EA4HhB,YA5HgB,EA6HhB,mBA7HgB,EA8HhB,aA9HgB,EA+HhB,oBA/HgB,EAgIhB,cAhIgB,EAiIhB,qBAjIgB,EAkIhB,eAlIgB,EAmIhB,sBAnIgB,EAoIhB,eApIgB,EAqIhB,sBArIgB,EAsIhB,aAtIgB,EAuIhB,oBAvIgB,EAwIhB,iBAxIgB,EAyIhB,wBAzIgB,EA0IhB,gBA1IgB,EA2IhB,uBA3IgB,EA4IhB,gBA5IgB,EA6IhB,uBA7IgB,EA8IhB,eA9IgB,EA+IhB,sBA/IgB,EAgJhB,cAhJgB,EAiJhB,qBAjJgB,EAkJhB,qBAlJgB,EAmJhB,4BAnJgB,EAoJhB,sBApJgB,EAqJhB,6BArJgB,EAsJhB,UAtJgB,EAuJhB,iBAvJgB,EAwJhB,SAxJgB,EAyJhB,gBAzJgB,EA0JhB,kBA1JgB,EA2JhB,yBA3JgB,EA4JhB,gBA5JgB,EA6JhB,uBA7JgB,EA8JhB,sBA9JgB,EA+JhB,6BA/JgB,EAgKhB,iBAhKgB,EAiKhB,wBAjKgB,CAAlB;;AAoRa,sBAAc,UACzB,KADyB,EAEzB,aAFyB,EAGzB,KAHyB,EAGV;AAEf,MAAI,CAAC,KAAD,IAAU,OAAO,KAAP,KAAiB,UAA3B,IAAyC,OAAO,KAAP,KAAiB,SAA9D,EAAyE;AACvE,WAAO,IAAP;AACD;;AAED,MAAI,UAAU,GAAG,KAAjB;;AAEA,MAAI,uBAAe,KAAf,CAAJ,EAA2B;AACzB,cAAU,GAAG,KAAK,CAAC,KAAnB;AACD;;AAED,MAAI,CAAC,oBAAE,QAAF,CAAW,UAAX,CAAL,EAA6B;AAC3B,WAAO,IAAP;AACD;;AAED,MAAM,GAAG,GAAwB,EAAjC;AAEA,QAAM,CAAC,IAAP,CAAY,UAAZ,EAAwB,OAAxB,CAAgC,eAAG;AAEjC,QACE,kBAAkB,CAAC,QAAnB,CAA4B,GAA5B,KACC,KAAK,IAAI,oBAAoB,CAAC,QAArB,CAA8B,GAA9B,CADV,IAEC,aAAa,IAAI,SAAS,CAAC,QAAV,CAAmB,GAAnB,CAHpB,EAIE;AACA,SAAG,CAAC,GAAD,CAAH,GAAY,UAAkB,CAAC,GAAD,CAA9B;AACD;AACF,GATD;AAWA,SAAO,GAAP;AACD,CAjCY;;AAmCA,6BAAqB,UAChC,KADgC,EAEhC,UAFgC,EAED;AAE/B,MAAI,CAAC,KAAD,IAAU,OAAO,KAAP,KAAiB,UAA3B,IAAyC,OAAO,KAAP,KAAiB,SAA9D,EAAyE;AACvE,WAAO,IAAP;AACD;;AAED,MAAI,UAAU,GAAG,KAAjB;;AAEA,MAAI,uBAAe,KAAf,CAAJ,EAA2B;AACzB,cAAU,GAAG,KAAK,CAAC,KAAnB;AACD;;AAED,MAAI,CAAC,oBAAE,QAAF,CAAW,UAAX,CAAL,EAA6B;AAC3B,WAAO,IAAP;AACD;;AAED,MAAM,GAAG,GAAuC,EAAhD;AAEA,QAAM,CAAC,IAAP,CAAY,UAAZ,EAAwB,OAAxB,CAAgC,eAAG;AACjC,QAAI,SAAS,CAAC,QAAV,CAAmB,GAAnB,CAAJ,EAA6B;AAC3B,SAAG,CAAC,GAAD,CAAH,GAAW,UAAU,IAAK,UAAC,CAAD,EAAS;AAAK,yBAAU,CAAC,GAAD,CAAV,CAAgB,UAAhB;AAA8B,OAAtE;AACD;AACF,GAJD;AAMA,SAAO,GAAP;AACD,CA3BY;;AA6Bb,IAAM,sBAAsB,GAAG,SAAzB,sBAAyB,CAAC,eAAD,EAA4B,IAA5B,EAAuC,KAAvC,EAAoD;AAAK,mBAAC,CAAD,EAAS;AAC/F,mBAAe,CAAC,IAAD,EAAO,KAAP,EAAc,CAAd,CAAf;AAEA,WAAO,IAAP;AAHsF;AAIvF,CAJD;;AAMa,6BAAqB,UAChC,KADgC,EAEhC,IAFgC,EAGhC,KAHgC,EAGnB;AAEb,MAAI,CAAC,oBAAE,QAAF,CAAW,KAAX,CAAD,IAAsB,QAAO,KAAP,MAAiB,QAA3C,EAAqD;AACnD,WAAO,IAAP;AACD;;AAED,MAAI,GAAG,GAAuC,IAA9C;AAEA,QAAM,CAAC,IAAP,CAAY,KAAZ,EAAmB,OAAnB,CAA2B,UAAC,GAAD,EAAY;AACrC,QAAM,IAAI,GAAI,KAAa,CAAC,GAAD,CAA3B;;AACA,QAAI,SAAS,CAAC,QAAV,CAAmB,GAAnB,KAA2B,OAAO,IAAP,KAAgB,UAA/C,EAA2D;AACzD,UAAI,CAAC,GAAL,EAAU,GAAG,GAAG,EAAN;AACV,SAAG,CAAC,GAAD,CAAH,GAAW,sBAAsB,CAAC,IAAD,EAAO,IAAP,EAAa,KAAb,CAAjC;AACD;AACF,GAND;AAOA,SAAO,GAAP;AACD,CAnBY,C;;;;;;;;;;;ACj5Bb,wD;;;;;;;;;;;ACAA,mD;;;;;;;;;;;ACAA,uD","file":"Recharts.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory(require(\"prop-types\"), require(\"react\"), require(\"react-dom\"));\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([\"prop-types\", \"react\", \"react-dom\"], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Recharts\"] = factory(require(\"prop-types\"), require(\"react\"), require(\"react-dom\"));\n\telse\n\t\troot[\"Recharts\"] = factory(root[\"PropTypes\"], root[\"React\"], root[\"ReactDOM\"]);\n})(window, function(__WEBPACK_EXTERNAL_MODULE_prop_types__, __WEBPACK_EXTERNAL_MODULE_react__, __WEBPACK_EXTERNAL_MODULE_react_dom__) {\nreturn "," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = \"./src/index.ts\");\n","function _interopRequireDefault(obj) {\n  return obj && obj.__esModule ? obj : {\n    \"default\": obj\n  };\n}\n\nmodule.exports = _interopRequireDefault;","/*!\n  Copyright (c) 2017 Jed Watson.\n  Licensed under the MIT License (MIT), see\n  http://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = [];\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (!arg) continue;\n\n\t\t\tvar argType = typeof arg;\n\n\t\t\tif (argType === 'string' || argType === 'number') {\n\t\t\t\tclasses.push(arg);\n\t\t\t} else if (Array.isArray(arg) && arg.length) {\n\t\t\t\tvar inner = classNames.apply(null, arg);\n\t\t\t\tif (inner) {\n\t\t\t\t\tclasses.push(inner);\n\t\t\t\t}\n\t\t\t} else if (argType === 'object') {\n\t\t\t\tfor (var key in arg) {\n\t\t\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\t\t\tclasses.push(key);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn classes.join(' ');\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n","require('../../modules/es.math.acosh');\nrequire('../../modules/es.math.asinh');\nrequire('../../modules/es.math.atanh');\nrequire('../../modules/es.math.cbrt');\nrequire('../../modules/es.math.clz32');\nrequire('../../modules/es.math.cosh');\nrequire('../../modules/es.math.expm1');\nrequire('../../modules/es.math.fround');\nrequire('../../modules/es.math.hypot');\nrequire('../../modules/es.math.imul');\nrequire('../../modules/es.math.log10');\nrequire('../../modules/es.math.log1p');\nrequire('../../modules/es.math.log2');\nrequire('../../modules/es.math.sign');\nrequire('../../modules/es.math.sinh');\nrequire('../../modules/es.math.tanh');\nrequire('../../modules/es.math.to-string-tag');\nrequire('../../modules/es.math.trunc');\nvar path = require('../../internals/path');\n\nmodule.exports = path.Math;\n","require('../../modules/es.number.constructor');\nrequire('../../modules/es.number.epsilon');\nrequire('../../modules/es.number.is-finite');\nrequire('../../modules/es.number.is-integer');\nrequire('../../modules/es.number.is-nan');\nrequire('../../modules/es.number.is-safe-integer');\nrequire('../../modules/es.number.max-safe-integer');\nrequire('../../modules/es.number.min-safe-integer');\nrequire('../../modules/es.number.parse-float');\nrequire('../../modules/es.number.parse-int');\nrequire('../../modules/es.number.to-fixed');\nrequire('../../modules/es.number.to-precision');\nvar path = require('../../internals/path');\n\nmodule.exports = path.Number;\n","var isObject = require('../internals/is-object');\n\nmodule.exports = function (it) {\n  if (!isObject(it) && it !== null) {\n    throw TypeError(\"Can't set \" + String(it) + ' as a prototype');\n  } return it;\n};\n","var isObject = require('../internals/is-object');\n\nmodule.exports = function (it) {\n  if (!isObject(it)) {\n    throw TypeError(String(it) + ' is not an object');\n  } return it;\n};\n","var toIndexedObject = require('../internals/to-indexed-object');\nvar toLength = require('../internals/to-length');\nvar toAbsoluteIndex = require('../internals/to-absolute-index');\n\n// `Array.prototype.{ indexOf, includes }` methods implementation\nvar createMethod = function (IS_INCLUDES) {\n  return function ($this, el, fromIndex) {\n    var O = toIndexedObject($this);\n    var length = toLength(O.length);\n    var index = toAbsoluteIndex(fromIndex, length);\n    var value;\n    // Array#includes uses SameValueZero equality algorithm\n    // eslint-disable-next-line no-self-compare\n    if (IS_INCLUDES && el != el) while (length > index) {\n      value = O[index++];\n      // eslint-disable-next-line no-self-compare\n      if (value != value) return true;\n    // Array#indexOf ignores holes, Array#includes - not\n    } else for (;length > index; index++) {\n      if ((IS_INCLUDES || index in O) && O[index] === el) return IS_INCLUDES || index || 0;\n    } return !IS_INCLUDES && -1;\n  };\n};\n\nmodule.exports = {\n  // `Array.prototype.includes` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.includes\n  includes: createMethod(true),\n  // `Array.prototype.indexOf` method\n  // https://tc39.github.io/ecma262/#sec-array.prototype.indexof\n  indexOf: createMethod(false)\n};\n","var toString = {}.toString;\n\nmodule.exports = function (it) {\n  return toString.call(it).slice(8, -1);\n};\n","var has = require('../internals/has');\nvar ownKeys = require('../internals/own-keys');\nvar getOwnPropertyDescriptorModule = require('../internals/object-get-own-property-descriptor');\nvar definePropertyModule = require('../internals/object-define-property');\n\nmodule.exports = function (target, source) {\n  var keys = ownKeys(source);\n  var defineProperty = definePropertyModule.f;\n  var getOwnPropertyDescriptor = getOwnPropertyDescriptorModule.f;\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    if (!has(target, key)) defineProperty(target, key, getOwnPropertyDescriptor(source, key));\n  }\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\n\nmodule.exports = DESCRIPTORS ? function (object, key, value) {\n  return definePropertyModule.f(object, key, createPropertyDescriptor(1, value));\n} : function (object, key, value) {\n  object[key] = value;\n  return object;\n};\n","module.exports = function (bitmap, value) {\n  return {\n    enumerable: !(bitmap & 1),\n    configurable: !(bitmap & 2),\n    writable: !(bitmap & 4),\n    value: value\n  };\n};\n","var fails = require('../internals/fails');\n\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !fails(function () {\n  return Object.defineProperty({}, 1, { get: function () { return 7; } })[1] != 7;\n});\n","var global = require('../internals/global');\nvar isObject = require('../internals/is-object');\n\nvar document = global.document;\n// typeof document.createElement is 'object' in old IE\nvar EXISTS = isObject(document) && isObject(document.createElement);\n\nmodule.exports = function (it) {\n  return EXISTS ? document.createElement(it) : {};\n};\n","// IE8- don't enum bug keys\nmodule.exports = [\n  'constructor',\n  'hasOwnProperty',\n  'isPrototypeOf',\n  'propertyIsEnumerable',\n  'toLocaleString',\n  'toString',\n  'valueOf'\n];\n","var global = require('../internals/global');\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar redefine = require('../internals/redefine');\nvar setGlobal = require('../internals/set-global');\nvar copyConstructorProperties = require('../internals/copy-constructor-properties');\nvar isForced = require('../internals/is-forced');\n\n/*\n  options.target      - name of the target object\n  options.global      - target is the global object\n  options.stat        - export as static methods of target\n  options.proto       - export as prototype methods of target\n  options.real        - real prototype method for the `pure` version\n  options.forced      - export even if the native feature is available\n  options.bind        - bind methods to the target, required for the `pure` version\n  options.wrap        - wrap constructors to preventing global pollution, required for the `pure` version\n  options.unsafe      - use the simple assignment of property instead of delete + defineProperty\n  options.sham        - add a flag to not completely full polyfills\n  options.enumerable  - export as enumerable property\n  options.noTargetGet - prevent calling a getter on target\n*/\nmodule.exports = function (options, source) {\n  var TARGET = options.target;\n  var GLOBAL = options.global;\n  var STATIC = options.stat;\n  var FORCED, target, key, targetProperty, sourceProperty, descriptor;\n  if (GLOBAL) {\n    target = global;\n  } else if (STATIC) {\n    target = global[TARGET] || setGlobal(TARGET, {});\n  } else {\n    target = (global[TARGET] || {}).prototype;\n  }\n  if (target) for (key in source) {\n    sourceProperty = source[key];\n    if (options.noTargetGet) {\n      descriptor = getOwnPropertyDescriptor(target, key);\n      targetProperty = descriptor && descriptor.value;\n    } else targetProperty = target[key];\n    FORCED = isForced(GLOBAL ? key : TARGET + (STATIC ? '.' : '#') + key, options.forced);\n    // contained in target\n    if (!FORCED && targetProperty !== undefined) {\n      if (typeof sourceProperty === typeof targetProperty) continue;\n      copyConstructorProperties(sourceProperty, targetProperty);\n    }\n    // add a flag to not completely full polyfills\n    if (options.sham || (targetProperty && targetProperty.sham)) {\n      createNonEnumerableProperty(sourceProperty, 'sham', true);\n    }\n    // extend global\n    redefine(target, key, sourceProperty, options);\n  }\n};\n","module.exports = function (exec) {\n  try {\n    return !!exec();\n  } catch (error) {\n    return true;\n  }\n};\n","var path = require('../internals/path');\nvar global = require('../internals/global');\n\nvar aFunction = function (variable) {\n  return typeof variable == 'function' ? variable : undefined;\n};\n\nmodule.exports = function (namespace, method) {\n  return arguments.length < 2 ? aFunction(path[namespace]) || aFunction(global[namespace])\n    : path[namespace] && path[namespace][method] || global[namespace] && global[namespace][method];\n};\n","var check = function (it) {\n  return it && it.Math == Math && it;\n};\n\n// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\nmodule.exports =\n  // eslint-disable-next-line no-undef\n  check(typeof globalThis == 'object' && globalThis) ||\n  check(typeof window == 'object' && window) ||\n  check(typeof self == 'object' && self) ||\n  check(typeof global == 'object' && global) ||\n  // eslint-disable-next-line no-new-func\n  Function('return this')();\n","var hasOwnProperty = {}.hasOwnProperty;\n\nmodule.exports = function (it, key) {\n  return hasOwnProperty.call(it, key);\n};\n","module.exports = {};\n","var getBuiltIn = require('../internals/get-built-in');\n\nmodule.exports = getBuiltIn('document', 'documentElement');\n","var DESCRIPTORS = require('../internals/descriptors');\nvar fails = require('../internals/fails');\nvar createElement = require('../internals/document-create-element');\n\n// Thank's IE8 for his funny defineProperty\nmodule.exports = !DESCRIPTORS && !fails(function () {\n  return Object.defineProperty(createElement('div'), 'a', {\n    get: function () { return 7; }\n  }).a != 7;\n});\n","var fails = require('../internals/fails');\nvar classof = require('../internals/classof-raw');\n\nvar split = ''.split;\n\n// fallback for non-array-like ES3 and non-enumerable old V8 strings\nmodule.exports = fails(function () {\n  // throws an error in rhino, see https://github.com/mozilla/rhino/issues/346\n  // eslint-disable-next-line no-prototype-builtins\n  return !Object('z').propertyIsEnumerable(0);\n}) ? function (it) {\n  return classof(it) == 'String' ? split.call(it, '') : Object(it);\n} : Object;\n","var isObject = require('../internals/is-object');\nvar setPrototypeOf = require('../internals/object-set-prototype-of');\n\n// makes subclassing work correct for wrapped built-ins\nmodule.exports = function ($this, dummy, Wrapper) {\n  var NewTarget, NewTargetPrototype;\n  if (\n    // it can work only with native `setPrototypeOf`\n    setPrototypeOf &&\n    // we haven't completely correct pre-ES6 way for getting `new.target`, so use this\n    typeof (NewTarget = dummy.constructor) == 'function' &&\n    NewTarget !== Wrapper &&\n    isObject(NewTargetPrototype = NewTarget.prototype) &&\n    NewTargetPrototype !== Wrapper.prototype\n  ) setPrototypeOf($this, NewTargetPrototype);\n  return $this;\n};\n","var store = require('../internals/shared-store');\n\nvar functionToString = Function.toString;\n\n// this helper broken in `3.4.1-3.4.4`, so we can't use `shared` helper\nif (typeof store.inspectSource != 'function') {\n  store.inspectSource = function (it) {\n    return functionToString.call(it);\n  };\n}\n\nmodule.exports = store.inspectSource;\n","var NATIVE_WEAK_MAP = require('../internals/native-weak-map');\nvar global = require('../internals/global');\nvar isObject = require('../internals/is-object');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar objectHas = require('../internals/has');\nvar sharedKey = require('../internals/shared-key');\nvar hiddenKeys = require('../internals/hidden-keys');\n\nvar WeakMap = global.WeakMap;\nvar set, get, has;\n\nvar enforce = function (it) {\n  return has(it) ? get(it) : set(it, {});\n};\n\nvar getterFor = function (TYPE) {\n  return function (it) {\n    var state;\n    if (!isObject(it) || (state = get(it)).type !== TYPE) {\n      throw TypeError('Incompatible receiver, ' + TYPE + ' required');\n    } return state;\n  };\n};\n\nif (NATIVE_WEAK_MAP) {\n  var store = new WeakMap();\n  var wmget = store.get;\n  var wmhas = store.has;\n  var wmset = store.set;\n  set = function (it, metadata) {\n    wmset.call(store, it, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return wmget.call(store, it) || {};\n  };\n  has = function (it) {\n    return wmhas.call(store, it);\n  };\n} else {\n  var STATE = sharedKey('state');\n  hiddenKeys[STATE] = true;\n  set = function (it, metadata) {\n    createNonEnumerableProperty(it, STATE, metadata);\n    return metadata;\n  };\n  get = function (it) {\n    return objectHas(it, STATE) ? it[STATE] : {};\n  };\n  has = function (it) {\n    return objectHas(it, STATE);\n  };\n}\n\nmodule.exports = {\n  set: set,\n  get: get,\n  has: has,\n  enforce: enforce,\n  getterFor: getterFor\n};\n","var fails = require('../internals/fails');\n\nvar replacement = /#|\\.prototype\\./;\n\nvar isForced = function (feature, detection) {\n  var value = data[normalize(feature)];\n  return value == POLYFILL ? true\n    : value == NATIVE ? false\n    : typeof detection == 'function' ? fails(detection)\n    : !!detection;\n};\n\nvar normalize = isForced.normalize = function (string) {\n  return String(string).replace(replacement, '.').toLowerCase();\n};\n\nvar data = isForced.data = {};\nvar NATIVE = isForced.NATIVE = 'N';\nvar POLYFILL = isForced.POLYFILL = 'P';\n\nmodule.exports = isForced;\n","var isObject = require('../internals/is-object');\n\nvar floor = Math.floor;\n\n// `Number.isInteger` method implementation\n// https://tc39.github.io/ecma262/#sec-number.isinteger\nmodule.exports = function isInteger(it) {\n  return !isObject(it) && isFinite(it) && floor(it) === it;\n};\n","module.exports = function (it) {\n  return typeof it === 'object' ? it !== null : typeof it === 'function';\n};\n","module.exports = false;\n","var nativeExpm1 = Math.expm1;\nvar exp = Math.exp;\n\n// `Math.expm1` method implementation\n// https://tc39.github.io/ecma262/#sec-math.expm1\nmodule.exports = (!nativeExpm1\n  // Old FF bug\n  || nativeExpm1(10) > 22025.465794806719 || nativeExpm1(10) < 22025.4657948067165168\n  // Tor Browser bug\n  || nativeExpm1(-2e-17) != -2e-17\n) ? function expm1(x) {\n  return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : exp(x) - 1;\n} : nativeExpm1;\n","var sign = require('../internals/math-sign');\n\nvar abs = Math.abs;\nvar pow = Math.pow;\nvar EPSILON = pow(2, -52);\nvar EPSILON32 = pow(2, -23);\nvar MAX32 = pow(2, 127) * (2 - EPSILON32);\nvar MIN32 = pow(2, -126);\n\nvar roundTiesToEven = function (n) {\n  return n + 1 / EPSILON - 1 / EPSILON;\n};\n\n// `Math.fround` method implementation\n// https://tc39.github.io/ecma262/#sec-math.fround\nmodule.exports = Math.fround || function fround(x) {\n  var $abs = abs(x);\n  var $sign = sign(x);\n  var a, result;\n  if ($abs < MIN32) return $sign * roundTiesToEven($abs / MIN32 / EPSILON32) * MIN32 * EPSILON32;\n  a = (1 + EPSILON32 / EPSILON) * $abs;\n  result = a - (a - $abs);\n  // eslint-disable-next-line no-self-compare\n  if (result > MAX32 || result != result) return $sign * Infinity;\n  return $sign * result;\n};\n","var log = Math.log;\n\n// `Math.log1p` method implementation\n// https://tc39.github.io/ecma262/#sec-math.log1p\nmodule.exports = Math.log1p || function log1p(x) {\n  return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : log(1 + x);\n};\n","// `Math.sign` method implementation\n// https://tc39.github.io/ecma262/#sec-math.sign\nmodule.exports = Math.sign || function sign(x) {\n  // eslint-disable-next-line no-self-compare\n  return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1;\n};\n","var fails = require('../internals/fails');\n\nmodule.exports = !!Object.getOwnPropertySymbols && !fails(function () {\n  // Chrome 38 Symbol has incorrect toString conversion\n  // eslint-disable-next-line no-undef\n  return !String(Symbol());\n});\n","var global = require('../internals/global');\nvar inspectSource = require('../internals/inspect-source');\n\nvar WeakMap = global.WeakMap;\n\nmodule.exports = typeof WeakMap === 'function' && /native code/.test(inspectSource(WeakMap));\n","var global = require('../internals/global');\n\nvar globalIsFinite = global.isFinite;\n\n// `Number.isFinite` method\n// https://tc39.github.io/ecma262/#sec-number.isfinite\nmodule.exports = Number.isFinite || function isFinite(it) {\n  return typeof it == 'number' && globalIsFinite(it);\n};\n","var global = require('../internals/global');\nvar trim = require('../internals/string-trim').trim;\nvar whitespaces = require('../internals/whitespaces');\n\nvar $parseFloat = global.parseFloat;\nvar FORCED = 1 / $parseFloat(whitespaces + '-0') !== -Infinity;\n\n// `parseFloat` method\n// https://tc39.github.io/ecma262/#sec-parsefloat-string\nmodule.exports = FORCED ? function parseFloat(string) {\n  var trimmedString = trim(String(string));\n  var result = $parseFloat(trimmedString);\n  return result === 0 && trimmedString.charAt(0) == '-' ? -0 : result;\n} : $parseFloat;\n","var global = require('../internals/global');\nvar trim = require('../internals/string-trim').trim;\nvar whitespaces = require('../internals/whitespaces');\n\nvar $parseInt = global.parseInt;\nvar hex = /^[+-]?0[Xx]/;\nvar FORCED = $parseInt(whitespaces + '08') !== 8 || $parseInt(whitespaces + '0x16') !== 22;\n\n// `parseInt` method\n// https://tc39.github.io/ecma262/#sec-parseint-string-radix\nmodule.exports = FORCED ? function parseInt(string, radix) {\n  var S = trim(String(string));\n  return $parseInt(S, (radix >>> 0) || (hex.test(S) ? 16 : 10));\n} : $parseInt;\n","var anObject = require('../internals/an-object');\nvar defineProperties = require('../internals/object-define-properties');\nvar enumBugKeys = require('../internals/enum-bug-keys');\nvar hiddenKeys = require('../internals/hidden-keys');\nvar html = require('../internals/html');\nvar documentCreateElement = require('../internals/document-create-element');\nvar sharedKey = require('../internals/shared-key');\n\nvar GT = '>';\nvar LT = '<';\nvar PROTOTYPE = 'prototype';\nvar SCRIPT = 'script';\nvar IE_PROTO = sharedKey('IE_PROTO');\n\nvar EmptyConstructor = function () { /* empty */ };\n\nvar scriptTag = function (content) {\n  return LT + SCRIPT + GT + content + LT + '/' + SCRIPT + GT;\n};\n\n// Create object with fake `null` prototype: use ActiveX Object with cleared prototype\nvar NullProtoObjectViaActiveX = function (activeXDocument) {\n  activeXDocument.write(scriptTag(''));\n  activeXDocument.close();\n  var temp = activeXDocument.parentWindow.Object;\n  activeXDocument = null; // avoid memory leak\n  return temp;\n};\n\n// Create object with fake `null` prototype: use iframe Object with cleared prototype\nvar NullProtoObjectViaIFrame = function () {\n  // Thrash, waste and sodomy: IE GC bug\n  var iframe = documentCreateElement('iframe');\n  var JS = 'java' + SCRIPT + ':';\n  var iframeDocument;\n  iframe.style.display = 'none';\n  html.appendChild(iframe);\n  // https://github.com/zloirock/core-js/issues/475\n  iframe.src = String(JS);\n  iframeDocument = iframe.contentWindow.document;\n  iframeDocument.open();\n  iframeDocument.write(scriptTag('document.F=Object'));\n  iframeDocument.close();\n  return iframeDocument.F;\n};\n\n// Check for document.domain and active x support\n// No need to use active x approach when document.domain is not set\n// see https://github.com/es-shims/es5-shim/issues/150\n// variation of https://github.com/kitcambridge/es5-shim/commit/4f738ac066346\n// avoid IE GC bug\nvar activeXDocument;\nvar NullProtoObject = function () {\n  try {\n    /* global ActiveXObject */\n    activeXDocument = document.domain && new ActiveXObject('htmlfile');\n  } catch (error) { /* ignore */ }\n  NullProtoObject = activeXDocument ? NullProtoObjectViaActiveX(activeXDocument) : NullProtoObjectViaIFrame();\n  var length = enumBugKeys.length;\n  while (length--) delete NullProtoObject[PROTOTYPE][enumBugKeys[length]];\n  return NullProtoObject();\n};\n\nhiddenKeys[IE_PROTO] = true;\n\n// `Object.create` method\n// https://tc39.github.io/ecma262/#sec-object.create\nmodule.exports = Object.create || function create(O, Properties) {\n  var result;\n  if (O !== null) {\n    EmptyConstructor[PROTOTYPE] = anObject(O);\n    result = new EmptyConstructor();\n    EmptyConstructor[PROTOTYPE] = null;\n    // add \"__proto__\" for Object.getPrototypeOf polyfill\n    result[IE_PROTO] = O;\n  } else result = NullProtoObject();\n  return Properties === undefined ? result : defineProperties(result, Properties);\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar definePropertyModule = require('../internals/object-define-property');\nvar anObject = require('../internals/an-object');\nvar objectKeys = require('../internals/object-keys');\n\n// `Object.defineProperties` method\n// https://tc39.github.io/ecma262/#sec-object.defineproperties\nmodule.exports = DESCRIPTORS ? Object.defineProperties : function defineProperties(O, Properties) {\n  anObject(O);\n  var keys = objectKeys(Properties);\n  var length = keys.length;\n  var index = 0;\n  var key;\n  while (length > index) definePropertyModule.f(O, key = keys[index++], Properties[key]);\n  return O;\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\nvar anObject = require('../internals/an-object');\nvar toPrimitive = require('../internals/to-primitive');\n\nvar nativeDefineProperty = Object.defineProperty;\n\n// `Object.defineProperty` method\n// https://tc39.github.io/ecma262/#sec-object.defineproperty\nexports.f = DESCRIPTORS ? nativeDefineProperty : function defineProperty(O, P, Attributes) {\n  anObject(O);\n  P = toPrimitive(P, true);\n  anObject(Attributes);\n  if (IE8_DOM_DEFINE) try {\n    return nativeDefineProperty(O, P, Attributes);\n  } catch (error) { /* empty */ }\n  if ('get' in Attributes || 'set' in Attributes) throw TypeError('Accessors not supported');\n  if ('value' in Attributes) O[P] = Attributes.value;\n  return O;\n};\n","var DESCRIPTORS = require('../internals/descriptors');\nvar propertyIsEnumerableModule = require('../internals/object-property-is-enumerable');\nvar createPropertyDescriptor = require('../internals/create-property-descriptor');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar toPrimitive = require('../internals/to-primitive');\nvar has = require('../internals/has');\nvar IE8_DOM_DEFINE = require('../internals/ie8-dom-define');\n\nvar nativeGetOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// `Object.getOwnPropertyDescriptor` method\n// https://tc39.github.io/ecma262/#sec-object.getownpropertydescriptor\nexports.f = DESCRIPTORS ? nativeGetOwnPropertyDescriptor : function getOwnPropertyDescriptor(O, P) {\n  O = toIndexedObject(O);\n  P = toPrimitive(P, true);\n  if (IE8_DOM_DEFINE) try {\n    return nativeGetOwnPropertyDescriptor(O, P);\n  } catch (error) { /* empty */ }\n  if (has(O, P)) return createPropertyDescriptor(!propertyIsEnumerableModule.f.call(O, P), O[P]);\n};\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\nvar hiddenKeys = enumBugKeys.concat('length', 'prototype');\n\n// `Object.getOwnPropertyNames` method\n// https://tc39.github.io/ecma262/#sec-object.getownpropertynames\nexports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O) {\n  return internalObjectKeys(O, hiddenKeys);\n};\n","exports.f = Object.getOwnPropertySymbols;\n","var has = require('../internals/has');\nvar toIndexedObject = require('../internals/to-indexed-object');\nvar indexOf = require('../internals/array-includes').indexOf;\nvar hiddenKeys = require('../internals/hidden-keys');\n\nmodule.exports = function (object, names) {\n  var O = toIndexedObject(object);\n  var i = 0;\n  var result = [];\n  var key;\n  for (key in O) !has(hiddenKeys, key) && has(O, key) && result.push(key);\n  // Don't enum bug & hidden keys\n  while (names.length > i) if (has(O, key = names[i++])) {\n    ~indexOf(result, key) || result.push(key);\n  }\n  return result;\n};\n","var internalObjectKeys = require('../internals/object-keys-internal');\nvar enumBugKeys = require('../internals/enum-bug-keys');\n\n// `Object.keys` method\n// https://tc39.github.io/ecma262/#sec-object.keys\nmodule.exports = Object.keys || function keys(O) {\n  return internalObjectKeys(O, enumBugKeys);\n};\n","'use strict';\nvar nativePropertyIsEnumerable = {}.propertyIsEnumerable;\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;\n\n// Nashorn ~ JDK8 bug\nvar NASHORN_BUG = getOwnPropertyDescriptor && !nativePropertyIsEnumerable.call({ 1: 2 }, 1);\n\n// `Object.prototype.propertyIsEnumerable` method implementation\n// https://tc39.github.io/ecma262/#sec-object.prototype.propertyisenumerable\nexports.f = NASHORN_BUG ? function propertyIsEnumerable(V) {\n  var descriptor = getOwnPropertyDescriptor(this, V);\n  return !!descriptor && descriptor.enumerable;\n} : nativePropertyIsEnumerable;\n","var anObject = require('../internals/an-object');\nvar aPossiblePrototype = require('../internals/a-possible-prototype');\n\n// `Object.setPrototypeOf` method\n// https://tc39.github.io/ecma262/#sec-object.setprototypeof\n// Works with __proto__ only. Old v8 can't work with null proto objects.\n/* eslint-disable no-proto */\nmodule.exports = Object.setPrototypeOf || ('__proto__' in {} ? function () {\n  var CORRECT_SETTER = false;\n  var test = {};\n  var setter;\n  try {\n    setter = Object.getOwnPropertyDescriptor(Object.prototype, '__proto__').set;\n    setter.call(test, []);\n    CORRECT_SETTER = test instanceof Array;\n  } catch (error) { /* empty */ }\n  return function setPrototypeOf(O, proto) {\n    anObject(O);\n    aPossiblePrototype(proto);\n    if (CORRECT_SETTER) setter.call(O, proto);\n    else O.__proto__ = proto;\n    return O;\n  };\n}() : undefined);\n","var getBuiltIn = require('../internals/get-built-in');\nvar getOwnPropertyNamesModule = require('../internals/object-get-own-property-names');\nvar getOwnPropertySymbolsModule = require('../internals/object-get-own-property-symbols');\nvar anObject = require('../internals/an-object');\n\n// all object keys, includes non-enumerable and symbols\nmodule.exports = getBuiltIn('Reflect', 'ownKeys') || function ownKeys(it) {\n  var keys = getOwnPropertyNamesModule.f(anObject(it));\n  var getOwnPropertySymbols = getOwnPropertySymbolsModule.f;\n  return getOwnPropertySymbols ? keys.concat(getOwnPropertySymbols(it)) : keys;\n};\n","var global = require('../internals/global');\n\nmodule.exports = global;\n","var global = require('../internals/global');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\nvar has = require('../internals/has');\nvar setGlobal = require('../internals/set-global');\nvar inspectSource = require('../internals/inspect-source');\nvar InternalStateModule = require('../internals/internal-state');\n\nvar getInternalState = InternalStateModule.get;\nvar enforceInternalState = InternalStateModule.enforce;\nvar TEMPLATE = String(String).split('String');\n\n(module.exports = function (O, key, value, options) {\n  var unsafe = options ? !!options.unsafe : false;\n  var simple = options ? !!options.enumerable : false;\n  var noTargetGet = options ? !!options.noTargetGet : false;\n  if (typeof value == 'function') {\n    if (typeof key == 'string' && !has(value, 'name')) createNonEnumerableProperty(value, 'name', key);\n    enforceInternalState(value).source = TEMPLATE.join(typeof key == 'string' ? key : '');\n  }\n  if (O === global) {\n    if (simple) O[key] = value;\n    else setGlobal(key, value);\n    return;\n  } else if (!unsafe) {\n    delete O[key];\n  } else if (!noTargetGet && O[key]) {\n    simple = true;\n  }\n  if (simple) O[key] = value;\n  else createNonEnumerableProperty(O, key, value);\n// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n})(Function.prototype, 'toString', function toString() {\n  return typeof this == 'function' && getInternalState(this).source || inspectSource(this);\n});\n","// `RequireObjectCoercible` abstract operation\n// https://tc39.github.io/ecma262/#sec-requireobjectcoercible\nmodule.exports = function (it) {\n  if (it == undefined) throw TypeError(\"Can't call method on \" + it);\n  return it;\n};\n","var global = require('../internals/global');\nvar createNonEnumerableProperty = require('../internals/create-non-enumerable-property');\n\nmodule.exports = function (key, value) {\n  try {\n    createNonEnumerableProperty(global, key, value);\n  } catch (error) {\n    global[key] = value;\n  } return value;\n};\n","var defineProperty = require('../internals/object-define-property').f;\nvar has = require('../internals/has');\nvar wellKnownSymbol = require('../internals/well-known-symbol');\n\nvar TO_STRING_TAG = wellKnownSymbol('toStringTag');\n\nmodule.exports = function (it, TAG, STATIC) {\n  if (it && !has(it = STATIC ? it : it.prototype, TO_STRING_TAG)) {\n    defineProperty(it, TO_STRING_TAG, { configurable: true, value: TAG });\n  }\n};\n","var shared = require('../internals/shared');\nvar uid = require('../internals/uid');\n\nvar keys = shared('keys');\n\nmodule.exports = function (key) {\n  return keys[key] || (keys[key] = uid(key));\n};\n","var global = require('../internals/global');\nvar setGlobal = require('../internals/set-global');\n\nvar SHARED = '__core-js_shared__';\nvar store = global[SHARED] || setGlobal(SHARED, {});\n\nmodule.exports = store;\n","var IS_PURE = require('../internals/is-pure');\nvar store = require('../internals/shared-store');\n\n(module.exports = function (key, value) {\n  return store[key] || (store[key] = value !== undefined ? value : {});\n})('versions', []).push({\n  version: '3.6.4',\n  mode: IS_PURE ? 'pure' : 'global',\n  copyright: '© 2020 Denis Pushkarev (zloirock.ru)'\n});\n","'use strict';\nvar toInteger = require('../internals/to-integer');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\n// `String.prototype.repeat` method implementation\n// https://tc39.github.io/ecma262/#sec-string.prototype.repeat\nmodule.exports = ''.repeat || function repeat(count) {\n  var str = String(requireObjectCoercible(this));\n  var result = '';\n  var n = toInteger(count);\n  if (n < 0 || n == Infinity) throw RangeError('Wrong number of repetitions');\n  for (;n > 0; (n >>>= 1) && (str += str)) if (n & 1) result += str;\n  return result;\n};\n","var requireObjectCoercible = require('../internals/require-object-coercible');\nvar whitespaces = require('../internals/whitespaces');\n\nvar whitespace = '[' + whitespaces + ']';\nvar ltrim = RegExp('^' + whitespace + whitespace + '*');\nvar rtrim = RegExp(whitespace + whitespace + '*$');\n\n// `String.prototype.{ trim, trimStart, trimEnd, trimLeft, trimRight }` methods implementation\nvar createMethod = function (TYPE) {\n  return function ($this) {\n    var string = String(requireObjectCoercible($this));\n    if (TYPE & 1) string = string.replace(ltrim, '');\n    if (TYPE & 2) string = string.replace(rtrim, '');\n    return string;\n  };\n};\n\nmodule.exports = {\n  // `String.prototype.{ trimLeft, trimStart }` methods\n  // https://tc39.github.io/ecma262/#sec-string.prototype.trimstart\n  start: createMethod(1),\n  // `String.prototype.{ trimRight, trimEnd }` methods\n  // https://tc39.github.io/ecma262/#sec-string.prototype.trimend\n  end: createMethod(2),\n  // `String.prototype.trim` method\n  // https://tc39.github.io/ecma262/#sec-string.prototype.trim\n  trim: createMethod(3)\n};\n","var classof = require('../internals/classof-raw');\n\n// `thisNumberValue` abstract operation\n// https://tc39.github.io/ecma262/#sec-thisnumbervalue\nmodule.exports = function (value) {\n  if (typeof value != 'number' && classof(value) != 'Number') {\n    throw TypeError('Incorrect invocation');\n  }\n  return +value;\n};\n","var toInteger = require('../internals/to-integer');\n\nvar max = Math.max;\nvar min = Math.min;\n\n// Helper for a popular repeating case of the spec:\n// Let integer be ? ToInteger(index).\n// If integer < 0, let result be max((length + integer), 0); else let result be min(integer, length).\nmodule.exports = function (index, length) {\n  var integer = toInteger(index);\n  return integer < 0 ? max(integer + length, 0) : min(integer, length);\n};\n","// toObject with fallback for non-array-like ES3 strings\nvar IndexedObject = require('../internals/indexed-object');\nvar requireObjectCoercible = require('../internals/require-object-coercible');\n\nmodule.exports = function (it) {\n  return IndexedObject(requireObjectCoercible(it));\n};\n","var ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `ToInteger` abstract operation\n// https://tc39.github.io/ecma262/#sec-tointeger\nmodule.exports = function (argument) {\n  return isNaN(argument = +argument) ? 0 : (argument > 0 ? floor : ceil)(argument);\n};\n","var toInteger = require('../internals/to-integer');\n\nvar min = Math.min;\n\n// `ToLength` abstract operation\n// https://tc39.github.io/ecma262/#sec-tolength\nmodule.exports = function (argument) {\n  return argument > 0 ? min(toInteger(argument), 0x1FFFFFFFFFFFFF) : 0; // 2 ** 53 - 1 == 9007199254740991\n};\n","var isObject = require('../internals/is-object');\n\n// `ToPrimitive` abstract operation\n// https://tc39.github.io/ecma262/#sec-toprimitive\n// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n// and the second argument - flag - preferred type is a string\nmodule.exports = function (input, PREFERRED_STRING) {\n  if (!isObject(input)) return input;\n  var fn, val;\n  if (PREFERRED_STRING && typeof (fn = input.toString) == 'function' && !isObject(val = fn.call(input))) return val;\n  if (typeof (fn = input.valueOf) == 'function' && !isObject(val = fn.call(input))) return val;\n  if (!PREFERRED_STRING && typeof (fn = input.toString) == 'function' && !isObject(val = fn.call(input))) return val;\n  throw TypeError(\"Can't convert object to primitive value\");\n};\n","var id = 0;\nvar postfix = Math.random();\n\nmodule.exports = function (key) {\n  return 'Symbol(' + String(key === undefined ? '' : key) + ')_' + (++id + postfix).toString(36);\n};\n","var NATIVE_SYMBOL = require('../internals/native-symbol');\n\nmodule.exports = NATIVE_SYMBOL\n  // eslint-disable-next-line no-undef\n  && !Symbol.sham\n  // eslint-disable-next-line no-undef\n  && typeof Symbol.iterator == 'symbol';\n","var global = require('../internals/global');\nvar shared = require('../internals/shared');\nvar has = require('../internals/has');\nvar uid = require('../internals/uid');\nvar NATIVE_SYMBOL = require('../internals/native-symbol');\nvar USE_SYMBOL_AS_UID = require('../internals/use-symbol-as-uid');\n\nvar WellKnownSymbolsStore = shared('wks');\nvar Symbol = global.Symbol;\nvar createWellKnownSymbol = USE_SYMBOL_AS_UID ? Symbol : Symbol && Symbol.withoutSetter || uid;\n\nmodule.exports = function (name) {\n  if (!has(WellKnownSymbolsStore, name)) {\n    if (NATIVE_SYMBOL && has(Symbol, name)) WellKnownSymbolsStore[name] = Symbol[name];\n    else WellKnownSymbolsStore[name] = createWellKnownSymbol('Symbol.' + name);\n  } return WellKnownSymbolsStore[name];\n};\n","// a string of all valid unicode whitespaces\n// eslint-disable-next-line max-len\nmodule.exports = '\\u0009\\u000A\\u000B\\u000C\\u000D\\u0020\\u00A0\\u1680\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200A\\u202F\\u205F\\u3000\\u2028\\u2029\\uFEFF';\n","var $ = require('../internals/export');\nvar log1p = require('../internals/math-log1p');\n\nvar nativeAcosh = Math.acosh;\nvar log = Math.log;\nvar sqrt = Math.sqrt;\nvar LN2 = Math.LN2;\n\nvar FORCED = !nativeAcosh\n  // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509\n  || Math.floor(nativeAcosh(Number.MAX_VALUE)) != 710\n  // Tor Browser bug: Math.acosh(Infinity) -> NaN\n  || nativeAcosh(Infinity) != Infinity;\n\n// `Math.acosh` method\n// https://tc39.github.io/ecma262/#sec-math.acosh\n$({ target: 'Math', stat: true, forced: FORCED }, {\n  acosh: function acosh(x) {\n    return (x = +x) < 1 ? NaN : x > 94906265.62425156\n      ? log(x) + LN2\n      : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1));\n  }\n});\n","var $ = require('../internals/export');\n\nvar nativeAsinh = Math.asinh;\nvar log = Math.log;\nvar sqrt = Math.sqrt;\n\nfunction asinh(x) {\n  return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : log(x + sqrt(x * x + 1));\n}\n\n// `Math.asinh` method\n// https://tc39.github.io/ecma262/#sec-math.asinh\n// Tor Browser bug: Math.asinh(0) -> -0\n$({ target: 'Math', stat: true, forced: !(nativeAsinh && 1 / nativeAsinh(0) > 0) }, {\n  asinh: asinh\n});\n","var $ = require('../internals/export');\n\nvar nativeAtanh = Math.atanh;\nvar log = Math.log;\n\n// `Math.atanh` method\n// https://tc39.github.io/ecma262/#sec-math.atanh\n// Tor Browser bug: Math.atanh(-0) -> 0\n$({ target: 'Math', stat: true, forced: !(nativeAtanh && 1 / nativeAtanh(-0) < 0) }, {\n  atanh: function atanh(x) {\n    return (x = +x) == 0 ? x : log((1 + x) / (1 - x)) / 2;\n  }\n});\n","var $ = require('../internals/export');\nvar sign = require('../internals/math-sign');\n\nvar abs = Math.abs;\nvar pow = Math.pow;\n\n// `Math.cbrt` method\n// https://tc39.github.io/ecma262/#sec-math.cbrt\n$({ target: 'Math', stat: true }, {\n  cbrt: function cbrt(x) {\n    return sign(x = +x) * pow(abs(x), 1 / 3);\n  }\n});\n","var $ = require('../internals/export');\n\nvar floor = Math.floor;\nvar log = Math.log;\nvar LOG2E = Math.LOG2E;\n\n// `Math.clz32` method\n// https://tc39.github.io/ecma262/#sec-math.clz32\n$({ target: 'Math', stat: true }, {\n  clz32: function clz32(x) {\n    return (x >>>= 0) ? 31 - floor(log(x + 0.5) * LOG2E) : 32;\n  }\n});\n","var $ = require('../internals/export');\nvar expm1 = require('../internals/math-expm1');\n\nvar nativeCosh = Math.cosh;\nvar abs = Math.abs;\nvar E = Math.E;\n\n// `Math.cosh` method\n// https://tc39.github.io/ecma262/#sec-math.cosh\n$({ target: 'Math', stat: true, forced: !nativeCosh || nativeCosh(710) === Infinity }, {\n  cosh: function cosh(x) {\n    var t = expm1(abs(x) - 1) + 1;\n    return (t + 1 / (t * E * E)) * (E / 2);\n  }\n});\n","var $ = require('../internals/export');\nvar expm1 = require('../internals/math-expm1');\n\n// `Math.expm1` method\n// https://tc39.github.io/ecma262/#sec-math.expm1\n$({ target: 'Math', stat: true, forced: expm1 != Math.expm1 }, { expm1: expm1 });\n","var $ = require('../internals/export');\nvar fround = require('../internals/math-fround');\n\n// `Math.fround` method\n// https://tc39.github.io/ecma262/#sec-math.fround\n$({ target: 'Math', stat: true }, { fround: fround });\n","var $ = require('../internals/export');\n\nvar $hypot = Math.hypot;\nvar abs = Math.abs;\nvar sqrt = Math.sqrt;\n\n// Chrome 77 bug\n// https://bugs.chromium.org/p/v8/issues/detail?id=9546\nvar BUGGY = !!$hypot && $hypot(Infinity, NaN) !== Infinity;\n\n// `Math.hypot` method\n// https://tc39.github.io/ecma262/#sec-math.hypot\n$({ target: 'Math', stat: true, forced: BUGGY }, {\n  hypot: function hypot(value1, value2) { // eslint-disable-line no-unused-vars\n    var sum = 0;\n    var i = 0;\n    var aLen = arguments.length;\n    var larg = 0;\n    var arg, div;\n    while (i < aLen) {\n      arg = abs(arguments[i++]);\n      if (larg < arg) {\n        div = larg / arg;\n        sum = sum * div * div + 1;\n        larg = arg;\n      } else if (arg > 0) {\n        div = arg / larg;\n        sum += div * div;\n      } else sum += arg;\n    }\n    return larg === Infinity ? Infinity : larg * sqrt(sum);\n  }\n});\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\n\nvar nativeImul = Math.imul;\n\nvar FORCED = fails(function () {\n  return nativeImul(0xFFFFFFFF, 5) != -5 || nativeImul.length != 2;\n});\n\n// `Math.imul` method\n// https://tc39.github.io/ecma262/#sec-math.imul\n// some WebKit versions fails with big numbers, some has wrong arity\n$({ target: 'Math', stat: true, forced: FORCED }, {\n  imul: function imul(x, y) {\n    var UINT16 = 0xFFFF;\n    var xn = +x;\n    var yn = +y;\n    var xl = UINT16 & xn;\n    var yl = UINT16 & yn;\n    return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0);\n  }\n});\n","var $ = require('../internals/export');\n\nvar log = Math.log;\nvar LOG10E = Math.LOG10E;\n\n// `Math.log10` method\n// https://tc39.github.io/ecma262/#sec-math.log10\n$({ target: 'Math', stat: true }, {\n  log10: function log10(x) {\n    return log(x) * LOG10E;\n  }\n});\n","var $ = require('../internals/export');\nvar log1p = require('../internals/math-log1p');\n\n// `Math.log1p` method\n// https://tc39.github.io/ecma262/#sec-math.log1p\n$({ target: 'Math', stat: true }, { log1p: log1p });\n","var $ = require('../internals/export');\n\nvar log = Math.log;\nvar LN2 = Math.LN2;\n\n// `Math.log2` method\n// https://tc39.github.io/ecma262/#sec-math.log2\n$({ target: 'Math', stat: true }, {\n  log2: function log2(x) {\n    return log(x) / LN2;\n  }\n});\n","var $ = require('../internals/export');\nvar sign = require('../internals/math-sign');\n\n// `Math.sign` method\n// https://tc39.github.io/ecma262/#sec-math.sign\n$({ target: 'Math', stat: true }, {\n  sign: sign\n});\n","var $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar expm1 = require('../internals/math-expm1');\n\nvar abs = Math.abs;\nvar exp = Math.exp;\nvar E = Math.E;\n\nvar FORCED = fails(function () {\n  return Math.sinh(-2e-17) != -2e-17;\n});\n\n// `Math.sinh` method\n// https://tc39.github.io/ecma262/#sec-math.sinh\n// V8 near Chromium 38 has a problem with very small numbers\n$({ target: 'Math', stat: true, forced: FORCED }, {\n  sinh: function sinh(x) {\n    return abs(x = +x) < 1 ? (expm1(x) - expm1(-x)) / 2 : (exp(x - 1) - exp(-x - 1)) * (E / 2);\n  }\n});\n","var $ = require('../internals/export');\nvar expm1 = require('../internals/math-expm1');\n\nvar exp = Math.exp;\n\n// `Math.tanh` method\n// https://tc39.github.io/ecma262/#sec-math.tanh\n$({ target: 'Math', stat: true }, {\n  tanh: function tanh(x) {\n    var a = expm1(x = +x);\n    var b = expm1(-x);\n    return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x));\n  }\n});\n","var setToStringTag = require('../internals/set-to-string-tag');\n\n// Math[@@toStringTag] property\n// https://tc39.github.io/ecma262/#sec-math-@@tostringtag\nsetToStringTag(Math, 'Math', true);\n","var $ = require('../internals/export');\n\nvar ceil = Math.ceil;\nvar floor = Math.floor;\n\n// `Math.trunc` method\n// https://tc39.github.io/ecma262/#sec-math.trunc\n$({ target: 'Math', stat: true }, {\n  trunc: function trunc(it) {\n    return (it > 0 ? floor : ceil)(it);\n  }\n});\n","'use strict';\nvar DESCRIPTORS = require('../internals/descriptors');\nvar global = require('../internals/global');\nvar isForced = require('../internals/is-forced');\nvar redefine = require('../internals/redefine');\nvar has = require('../internals/has');\nvar classof = require('../internals/classof-raw');\nvar inheritIfRequired = require('../internals/inherit-if-required');\nvar toPrimitive = require('../internals/to-primitive');\nvar fails = require('../internals/fails');\nvar create = require('../internals/object-create');\nvar getOwnPropertyNames = require('../internals/object-get-own-property-names').f;\nvar getOwnPropertyDescriptor = require('../internals/object-get-own-property-descriptor').f;\nvar defineProperty = require('../internals/object-define-property').f;\nvar trim = require('../internals/string-trim').trim;\n\nvar NUMBER = 'Number';\nvar NativeNumber = global[NUMBER];\nvar NumberPrototype = NativeNumber.prototype;\n\n// Opera ~12 has broken Object#toString\nvar BROKEN_CLASSOF = classof(create(NumberPrototype)) == NUMBER;\n\n// `ToNumber` abstract operation\n// https://tc39.github.io/ecma262/#sec-tonumber\nvar toNumber = function (argument) {\n  var it = toPrimitive(argument, false);\n  var first, third, radix, maxCode, digits, length, index, code;\n  if (typeof it == 'string' && it.length > 2) {\n    it = trim(it);\n    first = it.charCodeAt(0);\n    if (first === 43 || first === 45) {\n      third = it.charCodeAt(2);\n      if (third === 88 || third === 120) return NaN; // Number('+0x1') should be NaN, old V8 fix\n    } else if (first === 48) {\n      switch (it.charCodeAt(1)) {\n        case 66: case 98: radix = 2; maxCode = 49; break; // fast equal of /^0b[01]+$/i\n        case 79: case 111: radix = 8; maxCode = 55; break; // fast equal of /^0o[0-7]+$/i\n        default: return +it;\n      }\n      digits = it.slice(2);\n      length = digits.length;\n      for (index = 0; index < length; index++) {\n        code = digits.charCodeAt(index);\n        // parseInt parses a string to a first unavailable symbol\n        // but ToNumber should return NaN if a string contains unavailable symbols\n        if (code < 48 || code > maxCode) return NaN;\n      } return parseInt(digits, radix);\n    }\n  } return +it;\n};\n\n// `Number` constructor\n// https://tc39.github.io/ecma262/#sec-number-constructor\nif (isForced(NUMBER, !NativeNumber(' 0o1') || !NativeNumber('0b1') || NativeNumber('+0x1'))) {\n  var NumberWrapper = function Number(value) {\n    var it = arguments.length < 1 ? 0 : value;\n    var dummy = this;\n    return dummy instanceof NumberWrapper\n      // check on 1..constructor(foo) case\n      && (BROKEN_CLASSOF ? fails(function () { NumberPrototype.valueOf.call(dummy); }) : classof(dummy) != NUMBER)\n        ? inheritIfRequired(new NativeNumber(toNumber(it)), dummy, NumberWrapper) : toNumber(it);\n  };\n  for (var keys = DESCRIPTORS ? getOwnPropertyNames(NativeNumber) : (\n    // ES3:\n    'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' +\n    // ES2015 (in case, if modules with ES2015 Number statics required before):\n    'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' +\n    'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger'\n  ).split(','), j = 0, key; keys.length > j; j++) {\n    if (has(NativeNumber, key = keys[j]) && !has(NumberWrapper, key)) {\n      defineProperty(NumberWrapper, key, getOwnPropertyDescriptor(NativeNumber, key));\n    }\n  }\n  NumberWrapper.prototype = NumberPrototype;\n  NumberPrototype.constructor = NumberWrapper;\n  redefine(global, NUMBER, NumberWrapper);\n}\n","var $ = require('../internals/export');\n\n// `Number.EPSILON` constant\n// https://tc39.github.io/ecma262/#sec-number.epsilon\n$({ target: 'Number', stat: true }, {\n  EPSILON: Math.pow(2, -52)\n});\n","var $ = require('../internals/export');\nvar numberIsFinite = require('../internals/number-is-finite');\n\n// `Number.isFinite` method\n// https://tc39.github.io/ecma262/#sec-number.isfinite\n$({ target: 'Number', stat: true }, { isFinite: numberIsFinite });\n","var $ = require('../internals/export');\nvar isInteger = require('../internals/is-integer');\n\n// `Number.isInteger` method\n// https://tc39.github.io/ecma262/#sec-number.isinteger\n$({ target: 'Number', stat: true }, {\n  isInteger: isInteger\n});\n","var $ = require('../internals/export');\n\n// `Number.isNaN` method\n// https://tc39.github.io/ecma262/#sec-number.isnan\n$({ target: 'Number', stat: true }, {\n  isNaN: function isNaN(number) {\n    // eslint-disable-next-line no-self-compare\n    return number != number;\n  }\n});\n","var $ = require('../internals/export');\nvar isInteger = require('../internals/is-integer');\n\nvar abs = Math.abs;\n\n// `Number.isSafeInteger` method\n// https://tc39.github.io/ecma262/#sec-number.issafeinteger\n$({ target: 'Number', stat: true }, {\n  isSafeInteger: function isSafeInteger(number) {\n    return isInteger(number) && abs(number) <= 0x1FFFFFFFFFFFFF;\n  }\n});\n","var $ = require('../internals/export');\n\n// `Number.MAX_SAFE_INTEGER` constant\n// https://tc39.github.io/ecma262/#sec-number.max_safe_integer\n$({ target: 'Number', stat: true }, {\n  MAX_SAFE_INTEGER: 0x1FFFFFFFFFFFFF\n});\n","var $ = require('../internals/export');\n\n// `Number.MIN_SAFE_INTEGER` constant\n// https://tc39.github.io/ecma262/#sec-number.min_safe_integer\n$({ target: 'Number', stat: true }, {\n  MIN_SAFE_INTEGER: -0x1FFFFFFFFFFFFF\n});\n","var $ = require('../internals/export');\nvar parseFloat = require('../internals/number-parse-float');\n\n// `Number.parseFloat` method\n// https://tc39.github.io/ecma262/#sec-number.parseFloat\n$({ target: 'Number', stat: true, forced: Number.parseFloat != parseFloat }, {\n  parseFloat: parseFloat\n});\n","var $ = require('../internals/export');\nvar parseInt = require('../internals/number-parse-int');\n\n// `Number.parseInt` method\n// https://tc39.github.io/ecma262/#sec-number.parseint\n$({ target: 'Number', stat: true, forced: Number.parseInt != parseInt }, {\n  parseInt: parseInt\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar toInteger = require('../internals/to-integer');\nvar thisNumberValue = require('../internals/this-number-value');\nvar repeat = require('../internals/string-repeat');\nvar fails = require('../internals/fails');\n\nvar nativeToFixed = 1.0.toFixed;\nvar floor = Math.floor;\n\nvar pow = function (x, n, acc) {\n  return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);\n};\n\nvar log = function (x) {\n  var n = 0;\n  var x2 = x;\n  while (x2 >= 4096) {\n    n += 12;\n    x2 /= 4096;\n  }\n  while (x2 >= 2) {\n    n += 1;\n    x2 /= 2;\n  } return n;\n};\n\nvar FORCED = nativeToFixed && (\n  0.00008.toFixed(3) !== '0.000' ||\n  0.9.toFixed(0) !== '1' ||\n  1.255.toFixed(2) !== '1.25' ||\n  1000000000000000128.0.toFixed(0) !== '1000000000000000128'\n) || !fails(function () {\n  // V8 ~ Android 4.3-\n  nativeToFixed.call({});\n});\n\n// `Number.prototype.toFixed` method\n// https://tc39.github.io/ecma262/#sec-number.prototype.tofixed\n$({ target: 'Number', proto: true, forced: FORCED }, {\n  // eslint-disable-next-line max-statements\n  toFixed: function toFixed(fractionDigits) {\n    var number = thisNumberValue(this);\n    var fractDigits = toInteger(fractionDigits);\n    var data = [0, 0, 0, 0, 0, 0];\n    var sign = '';\n    var result = '0';\n    var e, z, j, k;\n\n    var multiply = function (n, c) {\n      var index = -1;\n      var c2 = c;\n      while (++index < 6) {\n        c2 += n * data[index];\n        data[index] = c2 % 1e7;\n        c2 = floor(c2 / 1e7);\n      }\n    };\n\n    var divide = function (n) {\n      var index = 6;\n      var c = 0;\n      while (--index >= 0) {\n        c += data[index];\n        data[index] = floor(c / n);\n        c = (c % n) * 1e7;\n      }\n    };\n\n    var dataToString = function () {\n      var index = 6;\n      var s = '';\n      while (--index >= 0) {\n        if (s !== '' || index === 0 || data[index] !== 0) {\n          var t = String(data[index]);\n          s = s === '' ? t : s + repeat.call('0', 7 - t.length) + t;\n        }\n      } return s;\n    };\n\n    if (fractDigits < 0 || fractDigits > 20) throw RangeError('Incorrect fraction digits');\n    // eslint-disable-next-line no-self-compare\n    if (number != number) return 'NaN';\n    if (number <= -1e21 || number >= 1e21) return String(number);\n    if (number < 0) {\n      sign = '-';\n      number = -number;\n    }\n    if (number > 1e-21) {\n      e = log(number * pow(2, 69, 1)) - 69;\n      z = e < 0 ? number * pow(2, -e, 1) : number / pow(2, e, 1);\n      z *= 0x10000000000000;\n      e = 52 - e;\n      if (e > 0) {\n        multiply(0, z);\n        j = fractDigits;\n        while (j >= 7) {\n          multiply(1e7, 0);\n          j -= 7;\n        }\n        multiply(pow(10, j, 1), 0);\n        j = e - 1;\n        while (j >= 23) {\n          divide(1 << 23);\n          j -= 23;\n        }\n        divide(1 << j);\n        multiply(1, 1);\n        divide(2);\n        result = dataToString();\n      } else {\n        multiply(0, z);\n        multiply(1 << -e, 0);\n        result = dataToString() + repeat.call('0', fractDigits);\n      }\n    }\n    if (fractDigits > 0) {\n      k = result.length;\n      result = sign + (k <= fractDigits\n        ? '0.' + repeat.call('0', fractDigits - k) + result\n        : result.slice(0, k - fractDigits) + '.' + result.slice(k - fractDigits));\n    } else {\n      result = sign + result;\n    } return result;\n  }\n});\n","'use strict';\nvar $ = require('../internals/export');\nvar fails = require('../internals/fails');\nvar thisNumberValue = require('../internals/this-number-value');\n\nvar nativeToPrecision = 1.0.toPrecision;\n\nvar FORCED = fails(function () {\n  // IE7-\n  return nativeToPrecision.call(1, undefined) !== '1';\n}) || !fails(function () {\n  // V8 ~ Android 4.3-\n  nativeToPrecision.call({});\n});\n\n// `Number.prototype.toPrecision` method\n// https://tc39.github.io/ecma262/#sec-number.prototype.toprecision\n$({ target: 'Number', proto: true, forced: FORCED }, {\n  toPrecision: function toPrecision(precision) {\n    return precision === undefined\n      ? nativeToPrecision.call(thisNumberValue(this))\n      : nativeToPrecision.call(thisNumberValue(this), precision);\n  }\n});\n","var conversions = {\r\n    // length\r\n    'px': {\r\n        'px': 1,\r\n        'cm': 96.0/2.54,\r\n        'mm': 96.0/25.4,\r\n        'in': 96,\r\n        'pt': 96.0/72.0,\r\n        'pc': 16\r\n    },\r\n    'cm': {\r\n        'px': 2.54/96.0,\r\n        'cm': 1,\r\n        'mm': 0.1,\r\n        'in': 2.54,\r\n        'pt': 2.54/72.0,\r\n        'pc': 2.54/6.0\r\n    },\r\n    'mm': {\r\n        'px': 25.4/96.0,\r\n        'cm': 10,\r\n        'mm': 1,\r\n        'in': 25.4,\r\n        'pt': 25.4/72.0,\r\n        'pc': 25.4/6.0\r\n    },\r\n    'in': {\r\n        'px': 1.0/96.0,\r\n        'cm': 1.0/2.54,\r\n        'mm': 1.0/25.4,\r\n        'in': 1,\r\n        'pt': 1.0/72.0,\r\n        'pc': 1.0/6.0\r\n    },\r\n    'pt': {\r\n        'px': 0.75,\r\n        'cm': 72.0/2.54,\r\n        'mm': 72.0/25.4,\r\n        'in': 72,\r\n        'pt': 1,\r\n        'pc': 12\r\n    },\r\n    'pc': {\r\n        'px': 6.0/96.0,\r\n        'cm': 6.0/2.54,\r\n        'mm': 6.0/25.4,\r\n        'in': 6,\r\n        'pt': 6.0/72.0,\r\n        'pc': 1\r\n    },\r\n    // angle\r\n    'deg': {\r\n        'deg': 1,\r\n        'grad': 0.9,\r\n        'rad': 180/Math.PI,\r\n        'turn': 360\r\n    },\r\n    'grad': {\r\n        'deg': 400/360,\r\n        'grad': 1,\r\n        'rad': 200/Math.PI,\r\n        'turn': 400\r\n    },\r\n    'rad': {\r\n        'deg': Math.PI/180,\r\n        'grad': Math.PI/200,\r\n        'rad': 1,\r\n        'turn': Math.PI*2\r\n    },\r\n    'turn': {\r\n        'deg': 1/360,\r\n        'grad': 1/400,\r\n        'rad': 0.5/Math.PI,\r\n        'turn': 1\r\n    },\r\n    // time\r\n    's': {\r\n        's': 1,\r\n        'ms': 1/1000\r\n    },\r\n    'ms': {\r\n        's': 1000,\r\n        'ms': 1\r\n    },\r\n    // frequency\r\n    'Hz': {\r\n        'Hz': 1,\r\n        'kHz': 1000\r\n    },\r\n    'kHz': {\r\n        'Hz': 1/1000,\r\n        'kHz': 1\r\n    },\r\n    // resolution\r\n    'dpi': {\r\n        'dpi': 1,\r\n        'dpcm': 1.0/2.54,\r\n        'dppx': 1/96\r\n    },\r\n    'dpcm': {\r\n        'dpi': 2.54,\r\n        'dpcm': 1,\r\n        'dppx': 2.54/96.0\r\n    },\r\n    'dppx': {\r\n        'dpi': 96,\r\n        'dpcm': 96.0/2.54,\r\n        'dppx': 1\r\n    }\r\n};\r\n\r\nmodule.exports = function (value, sourceUnit, targetUnit, precision) {\r\n    if (!conversions.hasOwnProperty(targetUnit))\r\n        throw new Error(\"Cannot convert to \" + targetUnit);\r\n\r\n    if (!conversions[targetUnit].hasOwnProperty(sourceUnit))\r\n        throw new Error(\"Cannot convert from \" + sourceUnit + \" to \" + targetUnit);\r\n\r\n    precision = Math.pow(10, parseInt(precision) || 5);\r\n    return Math.round((conversions[targetUnit][sourceUnit] * value) * precision) / precision;\r\n};\r\n","var array = Array.prototype;\n\nexport var slice = array.slice;\nexport var map = array.map;\n","export default function(a, b) {\n  return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n","import {slice} from \"./array.js\";\nimport bisect from \"./bisect.js\";\nimport constant from \"./constant.js\";\nimport extent from \"./extent.js\";\nimport identity from \"./identity.js\";\nimport range from \"./range.js\";\nimport {tickStep} from \"./ticks.js\";\nimport sturges from \"./threshold/sturges.js\";\n\nexport default function() {\n  var value = identity,\n      domain = extent,\n      threshold = sturges;\n\n  function histogram(data) {\n    if (!Array.isArray(data)) data = Array.from(data);\n\n    var i,\n        n = data.length,\n        x,\n        values = new Array(n);\n\n    for (i = 0; i < n; ++i) {\n      values[i] = value(data[i], i, data);\n    }\n\n    var xz = domain(values),\n        x0 = xz[0],\n        x1 = xz[1],\n        tz = threshold(values, x0, x1);\n\n    // Convert number of thresholds into uniform thresholds.\n    if (!Array.isArray(tz)) {\n      tz = tickStep(x0, x1, tz);\n      tz = range(Math.ceil(x0 / tz) * tz, x1, tz); // exclusive\n    }\n\n    // Remove any thresholds outside the domain.\n    var m = tz.length;\n    while (tz[0] <= x0) tz.shift(), --m;\n    while (tz[m - 1] > x1) tz.pop(), --m;\n\n    var bins = new Array(m + 1),\n        bin;\n\n    // Initialize bins.\n    for (i = 0; i <= m; ++i) {\n      bin = bins[i] = [];\n      bin.x0 = i > 0 ? tz[i - 1] : x0;\n      bin.x1 = i < m ? tz[i] : x1;\n    }\n\n    // Assign data to bins by value, ignoring any outside the domain.\n    for (i = 0; i < n; ++i) {\n      x = values[i];\n      if (x0 <= x && x <= x1) {\n        bins[bisect(tz, x, 0, m)].push(data[i]);\n      }\n    }\n\n    return bins;\n  }\n\n  histogram.value = function(_) {\n    return arguments.length ? (value = typeof _ === \"function\" ? _ : constant(_), histogram) : value;\n  };\n\n  histogram.domain = function(_) {\n    return arguments.length ? (domain = typeof _ === \"function\" ? _ : constant([_[0], _[1]]), histogram) : domain;\n  };\n\n  histogram.thresholds = function(_) {\n    return arguments.length ? (threshold = typeof _ === \"function\" ? _ : Array.isArray(_) ? constant(slice.call(_)) : constant(_), histogram) : threshold;\n  };\n\n  return histogram;\n}\n","import ascending from \"./ascending.js\";\nimport bisector from \"./bisector.js\";\n\nvar ascendingBisect = bisector(ascending);\nexport var bisectRight = ascendingBisect.right;\nexport var bisectLeft = ascendingBisect.left;\nexport default bisectRight;\n","import ascending from \"./ascending.js\";\n\nexport default function(compare) {\n  if (compare.length === 1) compare = ascendingComparator(compare);\n  return {\n    left: function(a, x, lo, hi) {\n      if (lo == null) lo = 0;\n      if (hi == null) hi = a.length;\n      while (lo < hi) {\n        var mid = lo + hi >>> 1;\n        if (compare(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      }\n      return lo;\n    },\n    right: function(a, x, lo, hi) {\n      if (lo == null) lo = 0;\n      if (hi == null) hi = a.length;\n      while (lo < hi) {\n        var mid = lo + hi >>> 1;\n        if (compare(a[mid], x) > 0) hi = mid;\n        else lo = mid + 1;\n      }\n      return lo;\n    }\n  };\n}\n\nfunction ascendingComparator(f) {\n  return function(d, x) {\n    return ascending(f(d), x);\n  };\n}\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function count(values, valueof) {\n  let count = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  }\n  return count;\n}\n","function length(array) {\n  return array.length | 0;\n}\n\nfunction empty(length) {\n  return !(length > 0);\n}\n\nfunction arrayify(values) {\n  return typeof values !== \"object\" || \"length\" in values ? values : Array.from(values);\n}\n\nfunction reducer(reduce) {\n  return values => reduce(...values);\n}\n\nexport default function cross(...values) {\n  const reduce = typeof values[values.length - 1] === \"function\" && reducer(values.pop());\n  values = values.map(arrayify);\n  const lengths = values.map(length);\n  const j = values.length - 1;\n  const index = new Array(j + 1).fill(0);\n  const product = [];\n  if (j < 0 || lengths.some(empty)) return product;\n  while (true) {\n    product.push(index.map((j, i) => values[i][j]));\n    let i = j;\n    while (++index[i] === lengths[i]) {\n      if (i === 0) return reduce ? product.map(reduce) : product;\n      index[i--] = 0;\n    }\n  }\n}\n","export default function cumsum(values, valueof) {\n  var sum = 0, index = 0;\n  return Float64Array.from(values, valueof === undefined\n    ? v => (sum += +v || 0)\n    : v => (sum += +valueof(v, index++, values) || 0));\n}","export default function(a, b) {\n  return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;\n}\n","import variance from \"./variance.js\";\n\nexport default function deviation(values, valueof) {\n  const v = variance(values, valueof);\n  return v ? Math.sqrt(v) : v;\n}\n","export default function(values, valueof) {\n  let min;\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  }\n  return [min, max];\n}\n","import ascending from \"./ascending.js\";\n\nexport default function greatest(values, compare = ascending) {\n  let max;\n  let defined = false;\n  if (compare.length === 1) {\n    let maxValue;\n    for (const element of values) {\n      const value = compare(element);\n      if (defined\n          ? ascending(value, maxValue) > 0\n          : ascending(value, value) === 0) {\n        max = element;\n        maxValue = value;\n        defined = true;\n      }\n    }\n  } else {\n    for (const value of values) {\n      if (defined\n          ? compare(value, max) > 0\n          : compare(value, value) === 0) {\n        max = value;\n        defined = true;\n      }\n    }\n  }\n  return max;\n}\n","import ascending from \"./ascending.js\";\nimport maxIndex from \"./maxIndex.js\";\n\nexport default function greatestIndex(values, compare = ascending) {\n  if (compare.length === 1) return maxIndex(values, compare);\n  let maxValue;\n  let max = -1;\n  let index = -1;\n  for (const value of values) {\n    ++index;\n    if (max < 0\n        ? compare(value, value) === 0\n        : compare(value, maxValue) > 0) {\n      maxValue = value;\n      max = index;\n    }\n  }\n  return max;\n}\n","import identity from \"./identity.js\";\n\nexport default function group(values, ...keys) {\n  return nest(values, identity, identity, keys);\n}\n\nexport function groups(values, ...keys) {\n  return nest(values, Array.from, identity, keys);\n}\n\nexport function rollup(values, reduce, ...keys) {\n  return nest(values, identity, reduce, keys);\n}\n\nexport function rollups(values, reduce, ...keys) {\n  return nest(values, Array.from, reduce, keys);\n}\n\nfunction nest(values, map, reduce, keys) {\n  return (function regroup(values, i) {\n    if (i >= keys.length) return reduce(values);\n    const groups = new Map();\n    const keyof = keys[i++];\n    let index = -1;\n    for (const value of values) {\n      const key = keyof(value, ++index, values);\n      const group = groups.get(key);\n      if (group) group.push(value);\n      else groups.set(key, [value]);\n    }\n    for (const [key, values] of groups) {\n      groups.set(key, regroup(values, i));\n    }\n    return map(groups);\n  })(values, 0);\n}\n","export default function(x) {\n  return x;\n}\n","export {default as bisect, bisectRight, bisectLeft} from \"./bisect.js\";\nexport {default as ascending} from \"./ascending.js\";\nexport {default as bisector} from \"./bisector.js\";\nexport {default as count} from \"./count.js\";\nexport {default as cross} from \"./cross.js\";\nexport {default as cumsum} from \"./cumsum.js\";\nexport {default as descending} from \"./descending.js\";\nexport {default as deviation} from \"./deviation.js\";\nexport {default as extent} from \"./extent.js\";\nexport {default as group, groups, rollup, rollups} from \"./group.js\";\nexport {default as bin, default as histogram} from \"./bin.js\"; // Deprecated; use bin.\nexport {default as thresholdFreedmanDiaconis} from \"./threshold/freedmanDiaconis.js\";\nexport {default as thresholdScott} from \"./threshold/scott.js\";\nexport {default as thresholdSturges} from \"./threshold/sturges.js\";\nexport {default as max} from \"./max.js\";\nexport {default as maxIndex} from \"./maxIndex.js\";\nexport {default as mean} from \"./mean.js\";\nexport {default as median} from \"./median.js\";\nexport {default as merge} from \"./merge.js\";\nexport {default as min} from \"./min.js\";\nexport {default as minIndex} from \"./minIndex.js\";\nexport {default as pairs} from \"./pairs.js\";\nexport {default as permute} from \"./permute.js\";\nexport {default as quantile, quantileSorted} from \"./quantile.js\";\nexport {default as quickselect} from \"./quickselect.js\";\nexport {default as range} from \"./range.js\";\nexport {default as least} from \"./least.js\";\nexport {default as leastIndex} from \"./leastIndex.js\";\nexport {default as greatest} from \"./greatest.js\";\nexport {default as greatestIndex} from \"./greatestIndex.js\";\nexport {default as scan} from \"./scan.js\"; // Deprecated; use leastIndex.\nexport {default as shuffle} from \"./shuffle.js\";\nexport {default as sum} from \"./sum.js\";\nexport {default as ticks, tickIncrement, tickStep} from \"./ticks.js\";\nexport {default as transpose} from \"./transpose.js\";\nexport {default as variance} from \"./variance.js\";\nexport {default as zip} from \"./zip.js\";\n","import ascending from \"./ascending.js\";\n\nexport default function least(values, compare = ascending) {\n  let min;\n  let defined = false;\n  if (compare.length === 1) {\n    let minValue;\n    for (const element of values) {\n      const value = compare(element);\n      if (defined\n          ? ascending(value, minValue) < 0\n          : ascending(value, value) === 0) {\n        min = element;\n        minValue = value;\n        defined = true;\n      }\n    }\n  } else {\n    for (const value of values) {\n      if (defined\n          ? compare(value, min) < 0\n          : compare(value, value) === 0) {\n        min = value;\n        defined = true;\n      }\n    }\n  }\n  return min;\n}\n","import ascending from \"./ascending.js\";\nimport minIndex from \"./minIndex.js\";\n\nexport default function leastIndex(values, compare = ascending) {\n  if (compare.length === 1) return minIndex(values, compare);\n  let minValue;\n  let min = -1;\n  let index = -1;\n  for (const value of values) {\n    ++index;\n    if (min < 0\n        ? compare(value, value) === 0\n        : compare(value, minValue) < 0) {\n      minValue = value;\n      min = index;\n    }\n  }\n  return min;\n}\n","export default function max(values, valueof) {\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  }\n  return max;\n}\n","export default function maxIndex(values, valueof) {\n  let max;\n  let maxIndex = -1;\n  let index = -1;\n  if (valueof === undefined) {\n    for (const value of values) {\n      ++index;\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value, maxIndex = index;\n      }\n    }\n  } else {\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value, maxIndex = index;\n      }\n    }\n  }\n  return maxIndex;\n}\n","export default function mean(values, valueof) {\n  let count = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count, sum += value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count, sum += value;\n      }\n    }\n  }\n  if (count) return sum / count;\n}\n","import quantile from \"./quantile.js\";\n\nexport default function(values, valueof) {\n  return quantile(values, 0.5, valueof);\n}\n","function* flatten(arrays) {\n  for (const array of arrays) {\n    yield* array;\n  }\n}\n\nexport default function merge(arrays) {\n  return Array.from(flatten(arrays));\n}\n","export default function min(values, valueof) {\n  let min;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  }\n  return min;\n}\n","export default function minIndex(values, valueof) {\n  let min;\n  let minIndex = -1;\n  let index = -1;\n  if (valueof === undefined) {\n    for (const value of values) {\n      ++index;\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value, minIndex = index;\n      }\n    }\n  } else {\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value, minIndex = index;\n      }\n    }\n  }\n  return minIndex;\n}\n","export default function(x) {\n  return x === null ? NaN : +x;\n}\n\nexport function* numbers(values, valueof) {\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  }\n}\n","export default function pairs(values, pairof = pair) {\n  const pairs = [];\n  let previous;\n  let first = false;\n  for (const value of values) {\n    if (first) pairs.push(pairof(previous, value));\n    previous = value;\n    first = true;\n  }\n  return pairs;\n}\n\nexport function pair(a, b) {\n  return [a, b];\n}\n","export default function(source, keys) {\n  return Array.from(keys, key => source[key]);\n}\n","import max from \"./max.js\";\nimport min from \"./min.js\";\nimport quickselect from \"./quickselect.js\";\nimport number, {numbers} from \"./number.js\";\n\nexport default function quantile(values, p, valueof) {\n  values = Float64Array.from(numbers(values, valueof));\n  if (!(n = values.length)) return;\n  if ((p = +p) <= 0 || n < 2) return min(values);\n  if (p >= 1) return max(values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = max(quickselect(values, i0).subarray(0, i0 + 1)),\n      value1 = min(values.subarray(i0 + 1));\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nexport function quantileSorted(values, p, valueof = number) {\n  if (!(n = values.length)) return;\n  if ((p = +p) <= 0 || n < 2) return +valueof(values[0], 0, values);\n  if (p >= 1) return +valueof(values[n - 1], n - 1, values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = +valueof(values[i0], i0, values),\n      value1 = +valueof(values[i0 + 1], i0 + 1, values);\n  return value0 + (value1 - value0) * (i - i0);\n}\n","import ascending from \"./ascending.js\";\n\n// Based on https://github.com/mourner/quickselect\n// ISC license, Copyright 2018 Vladimir Agafonkin.\nexport default function quickselect(array, k, left = 0, right = array.length - 1, compare = ascending) {\n  while (right > left) {\n    if (right - left > 600) {\n      const n = right - left + 1;\n      const m = k - left + 1;\n      const z = Math.log(n);\n      const s = 0.5 * Math.exp(2 * z / 3);\n      const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n      const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n      const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n      quickselect(array, k, newLeft, newRight, compare);\n    }\n\n    const t = array[k];\n    let i = left;\n    let j = right;\n\n    swap(array, left, k);\n    if (compare(array[right], t) > 0) swap(array, left, right);\n\n    while (i < j) {\n      swap(array, i, j), ++i, --j;\n      while (compare(array[i], t) < 0) ++i;\n      while (compare(array[j], t) > 0) --j;\n    }\n\n    if (compare(array[left], t) === 0) swap(array, left, j);\n    else ++j, swap(array, j, right);\n\n    if (j <= k) left = j + 1;\n    if (k <= j) right = j - 1;\n  }\n  return array;\n}\n\nfunction swap(array, i, j) {\n  const t = array[i];\n  array[i] = array[j];\n  array[j] = t;\n}\n","export default function(start, stop, step) {\n  start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step;\n\n  var i = -1,\n      n = Math.max(0, Math.ceil((stop - start) / step)) | 0,\n      range = new Array(n);\n\n  while (++i < n) {\n    range[i] = start + i * step;\n  }\n\n  return range;\n}\n","import leastIndex from \"./leastIndex.js\";\n\nexport default function scan(values, compare) {\n  const index = leastIndex(values, compare);\n  return index < 0 ? undefined : index;\n}\n","export default function shuffle(array, i0 = 0, i1 = array.length) {\n  var m = i1 - (i0 = +i0),\n      t,\n      i;\n\n  while (m) {\n    i = Math.random() * m-- | 0;\n    t = array[m + i0];\n    array[m + i0] = array[i + i0];\n    array[i + i0] = t;\n  }\n\n  return array;\n}\n","export default function sum(values, valueof) {\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value = +value) {\n        sum += value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if (value = +valueof(value, ++index, values)) {\n        sum += value;\n      }\n    }\n  }\n  return sum;\n}\n","import count from \"../count.js\";\nimport quantile from \"../quantile.js\";\n\nexport default function(values, min, max) {\n  return Math.ceil((max - min) / (2 * (quantile(values, 0.75) - quantile(values, 0.25)) * Math.pow(count(values), -1 / 3)));\n}\n","import count from \"../count.js\";\nimport deviation from \"../deviation.js\";\n\nexport default function(values, min, max) {\n  return Math.ceil((max - min) / (3.5 * deviation(values) * Math.pow(count(values), -1 / 3)));\n}\n","import count from \"../count.js\";\n\nexport default function(values) {\n  return Math.ceil(Math.log(count(values)) / Math.LN2) + 1;\n}\n","var e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nexport default function(start, stop, count) {\n  var reverse,\n      i = -1,\n      n,\n      ticks,\n      step;\n\n  stop = +stop, start = +start, count = +count;\n  if (start === stop && count > 0) return [start];\n  if (reverse = stop < start) n = start, start = stop, stop = n;\n  if ((step = tickIncrement(start, stop, count)) === 0 || !isFinite(step)) return [];\n\n  if (step > 0) {\n    start = Math.ceil(start / step);\n    stop = Math.floor(stop / step);\n    ticks = new Array(n = Math.ceil(stop - start + 1));\n    while (++i < n) ticks[i] = (start + i) * step;\n  } else {\n    start = Math.floor(start * step);\n    stop = Math.ceil(stop * step);\n    ticks = new Array(n = Math.ceil(start - stop + 1));\n    while (++i < n) ticks[i] = (start - i) / step;\n  }\n\n  if (reverse) ticks.reverse();\n\n  return ticks;\n}\n\nexport function tickIncrement(start, stop, count) {\n  var step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log(step) / Math.LN10),\n      error = step / Math.pow(10, power);\n  return power >= 0\n      ? (error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1) * Math.pow(10, power)\n      : -Math.pow(10, -power) / (error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1);\n}\n\nexport function tickStep(start, stop, count) {\n  var step0 = Math.abs(stop - start) / Math.max(0, count),\n      step1 = Math.pow(10, Math.floor(Math.log(step0) / Math.LN10)),\n      error = step0 / step1;\n  if (error >= e10) step1 *= 10;\n  else if (error >= e5) step1 *= 5;\n  else if (error >= e2) step1 *= 2;\n  return stop < start ? -step1 : step1;\n}\n","import min from \"./min.js\";\n\nexport default function(matrix) {\n  if (!(n = matrix.length)) return [];\n  for (var i = -1, m = min(matrix, length), transpose = new Array(m); ++i < m;) {\n    for (var j = -1, n, row = transpose[i] = new Array(n); ++j < n;) {\n      row[j] = matrix[j][i];\n    }\n  }\n  return transpose;\n}\n\nfunction length(d) {\n  return d.length;\n}\n","export default function variance(values, valueof) {\n  let count = 0;\n  let delta;\n  let mean = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  }\n  if (count > 1) return sum / (count - 1);\n}\n","import transpose from \"./transpose.js\";\n\nexport default function() {\n  return transpose(arguments);\n}\n","import define, {extend} from \"./define.js\";\n\nexport function Color() {}\n\nexport var darker = 0.7;\nexport var brighter = 1 / darker;\n\nvar reI = \"\\\\s*([+-]?\\\\d+)\\\\s*\",\n    reN = \"\\\\s*([+-]?\\\\d*\\\\.?\\\\d+(?:[eE][+-]?\\\\d+)?)\\\\s*\",\n    reP = \"\\\\s*([+-]?\\\\d*\\\\.?\\\\d+(?:[eE][+-]?\\\\d+)?)%\\\\s*\",\n    reHex = /^#([0-9a-f]{3,8})$/,\n    reRgbInteger = new RegExp(\"^rgb\\\\(\" + [reI, reI, reI] + \"\\\\)$\"),\n    reRgbPercent = new RegExp(\"^rgb\\\\(\" + [reP, reP, reP] + \"\\\\)$\"),\n    reRgbaInteger = new RegExp(\"^rgba\\\\(\" + [reI, reI, reI, reN] + \"\\\\)$\"),\n    reRgbaPercent = new RegExp(\"^rgba\\\\(\" + [reP, reP, reP, reN] + \"\\\\)$\"),\n    reHslPercent = new RegExp(\"^hsl\\\\(\" + [reN, reP, reP] + \"\\\\)$\"),\n    reHslaPercent = new RegExp(\"^hsla\\\\(\" + [reN, reP, reP, reN] + \"\\\\)$\");\n\nvar named = {\n  aliceblue: 0xf0f8ff,\n  antiquewhite: 0xfaebd7,\n  aqua: 0x00ffff,\n  aquamarine: 0x7fffd4,\n  azure: 0xf0ffff,\n  beige: 0xf5f5dc,\n  bisque: 0xffe4c4,\n  black: 0x000000,\n  blanchedalmond: 0xffebcd,\n  blue: 0x0000ff,\n  blueviolet: 0x8a2be2,\n  brown: 0xa52a2a,\n  burlywood: 0xdeb887,\n  cadetblue: 0x5f9ea0,\n  chartreuse: 0x7fff00,\n  chocolate: 0xd2691e,\n  coral: 0xff7f50,\n  cornflowerblue: 0x6495ed,\n  cornsilk: 0xfff8dc,\n  crimson: 0xdc143c,\n  cyan: 0x00ffff,\n  darkblue: 0x00008b,\n  darkcyan: 0x008b8b,\n  darkgoldenrod: 0xb8860b,\n  darkgray: 0xa9a9a9,\n  darkgreen: 0x006400,\n  darkgrey: 0xa9a9a9,\n  darkkhaki: 0xbdb76b,\n  darkmagenta: 0x8b008b,\n  darkolivegreen: 0x556b2f,\n  darkorange: 0xff8c00,\n  darkorchid: 0x9932cc,\n  darkred: 0x8b0000,\n  darksalmon: 0xe9967a,\n  darkseagreen: 0x8fbc8f,\n  darkslateblue: 0x483d8b,\n  darkslategray: 0x2f4f4f,\n  darkslategrey: 0x2f4f4f,\n  darkturquoise: 0x00ced1,\n  darkviolet: 0x9400d3,\n  deeppink: 0xff1493,\n  deepskyblue: 0x00bfff,\n  dimgray: 0x696969,\n  dimgrey: 0x696969,\n  dodgerblue: 0x1e90ff,\n  firebrick: 0xb22222,\n  floralwhite: 0xfffaf0,\n  forestgreen: 0x228b22,\n  fuchsia: 0xff00ff,\n  gainsboro: 0xdcdcdc,\n  ghostwhite: 0xf8f8ff,\n  gold: 0xffd700,\n  goldenrod: 0xdaa520,\n  gray: 0x808080,\n  green: 0x008000,\n  greenyellow: 0xadff2f,\n  grey: 0x808080,\n  honeydew: 0xf0fff0,\n  hotpink: 0xff69b4,\n  indianred: 0xcd5c5c,\n  indigo: 0x4b0082,\n  ivory: 0xfffff0,\n  khaki: 0xf0e68c,\n  lavender: 0xe6e6fa,\n  lavenderblush: 0xfff0f5,\n  lawngreen: 0x7cfc00,\n  lemonchiffon: 0xfffacd,\n  lightblue: 0xadd8e6,\n  lightcoral: 0xf08080,\n  lightcyan: 0xe0ffff,\n  lightgoldenrodyellow: 0xfafad2,\n  lightgray: 0xd3d3d3,\n  lightgreen: 0x90ee90,\n  lightgrey: 0xd3d3d3,\n  lightpink: 0xffb6c1,\n  lightsalmon: 0xffa07a,\n  lightseagreen: 0x20b2aa,\n  lightskyblue: 0x87cefa,\n  lightslategray: 0x778899,\n  lightslategrey: 0x778899,\n  lightsteelblue: 0xb0c4de,\n  lightyellow: 0xffffe0,\n  lime: 0x00ff00,\n  limegreen: 0x32cd32,\n  linen: 0xfaf0e6,\n  magenta: 0xff00ff,\n  maroon: 0x800000,\n  mediumaquamarine: 0x66cdaa,\n  mediumblue: 0x0000cd,\n  mediumorchid: 0xba55d3,\n  mediumpurple: 0x9370db,\n  mediumseagreen: 0x3cb371,\n  mediumslateblue: 0x7b68ee,\n  mediumspringgreen: 0x00fa9a,\n  mediumturquoise: 0x48d1cc,\n  mediumvioletred: 0xc71585,\n  midnightblue: 0x191970,\n  mintcream: 0xf5fffa,\n  mistyrose: 0xffe4e1,\n  moccasin: 0xffe4b5,\n  navajowhite: 0xffdead,\n  navy: 0x000080,\n  oldlace: 0xfdf5e6,\n  olive: 0x808000,\n  olivedrab: 0x6b8e23,\n  orange: 0xffa500,\n  orangered: 0xff4500,\n  orchid: 0xda70d6,\n  palegoldenrod: 0xeee8aa,\n  palegreen: 0x98fb98,\n  paleturquoise: 0xafeeee,\n  palevioletred: 0xdb7093,\n  papayawhip: 0xffefd5,\n  peachpuff: 0xffdab9,\n  peru: 0xcd853f,\n  pink: 0xffc0cb,\n  plum: 0xdda0dd,\n  powderblue: 0xb0e0e6,\n  purple: 0x800080,\n  rebeccapurple: 0x663399,\n  red: 0xff0000,\n  rosybrown: 0xbc8f8f,\n  royalblue: 0x4169e1,\n  saddlebrown: 0x8b4513,\n  salmon: 0xfa8072,\n  sandybrown: 0xf4a460,\n  seagreen: 0x2e8b57,\n  seashell: 0xfff5ee,\n  sienna: 0xa0522d,\n  silver: 0xc0c0c0,\n  skyblue: 0x87ceeb,\n  slateblue: 0x6a5acd,\n  slategray: 0x708090,\n  slategrey: 0x708090,\n  snow: 0xfffafa,\n  springgreen: 0x00ff7f,\n  steelblue: 0x4682b4,\n  tan: 0xd2b48c,\n  teal: 0x008080,\n  thistle: 0xd8bfd8,\n  tomato: 0xff6347,\n  turquoise: 0x40e0d0,\n  violet: 0xee82ee,\n  wheat: 0xf5deb3,\n  white: 0xffffff,\n  whitesmoke: 0xf5f5f5,\n  yellow: 0xffff00,\n  yellowgreen: 0x9acd32\n};\n\ndefine(Color, color, {\n  copy: function(channels) {\n    return Object.assign(new this.constructor, this, channels);\n  },\n  displayable: function() {\n    return this.rgb().displayable();\n  },\n  hex: color_formatHex, // Deprecated! Use color.formatHex.\n  formatHex: color_formatHex,\n  formatHsl: color_formatHsl,\n  formatRgb: color_formatRgb,\n  toString: color_formatRgb\n});\n\nfunction color_formatHex() {\n  return this.rgb().formatHex();\n}\n\nfunction color_formatHsl() {\n  return hslConvert(this).formatHsl();\n}\n\nfunction color_formatRgb() {\n  return this.rgb().formatRgb();\n}\n\nexport default function color(format) {\n  var m, l;\n  format = (format + \"\").trim().toLowerCase();\n  return (m = reHex.exec(format)) ? (l = m[1].length, m = parseInt(m[1], 16), l === 6 ? rgbn(m) // #ff0000\n      : l === 3 ? new Rgb((m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), ((m & 0xf) << 4) | (m & 0xf), 1) // #f00\n      : l === 8 ? new Rgb(m >> 24 & 0xff, m >> 16 & 0xff, m >> 8 & 0xff, (m & 0xff) / 0xff) // #ff000000\n      : l === 4 ? new Rgb((m >> 12 & 0xf) | (m >> 8 & 0xf0), (m >> 8 & 0xf) | (m >> 4 & 0xf0), (m >> 4 & 0xf) | (m & 0xf0), (((m & 0xf) << 4) | (m & 0xf)) / 0xff) // #f000\n      : null) // invalid hex\n      : (m = reRgbInteger.exec(format)) ? new Rgb(m[1], m[2], m[3], 1) // rgb(255, 0, 0)\n      : (m = reRgbPercent.exec(format)) ? new Rgb(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, 1) // rgb(100%, 0%, 0%)\n      : (m = reRgbaInteger.exec(format)) ? rgba(m[1], m[2], m[3], m[4]) // rgba(255, 0, 0, 1)\n      : (m = reRgbaPercent.exec(format)) ? rgba(m[1] * 255 / 100, m[2] * 255 / 100, m[3] * 255 / 100, m[4]) // rgb(100%, 0%, 0%, 1)\n      : (m = reHslPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, 1) // hsl(120, 50%, 50%)\n      : (m = reHslaPercent.exec(format)) ? hsla(m[1], m[2] / 100, m[3] / 100, m[4]) // hsla(120, 50%, 50%, 1)\n      : named.hasOwnProperty(format) ? rgbn(named[format]) // eslint-disable-line no-prototype-builtins\n      : format === \"transparent\" ? new Rgb(NaN, NaN, NaN, 0)\n      : null;\n}\n\nfunction rgbn(n) {\n  return new Rgb(n >> 16 & 0xff, n >> 8 & 0xff, n & 0xff, 1);\n}\n\nfunction rgba(r, g, b, a) {\n  if (a <= 0) r = g = b = NaN;\n  return new Rgb(r, g, b, a);\n}\n\nexport function rgbConvert(o) {\n  if (!(o instanceof Color)) o = color(o);\n  if (!o) return new Rgb;\n  o = o.rgb();\n  return new Rgb(o.r, o.g, o.b, o.opacity);\n}\n\nexport function rgb(r, g, b, opacity) {\n  return arguments.length === 1 ? rgbConvert(r) : new Rgb(r, g, b, opacity == null ? 1 : opacity);\n}\n\nexport function Rgb(r, g, b, opacity) {\n  this.r = +r;\n  this.g = +g;\n  this.b = +b;\n  this.opacity = +opacity;\n}\n\ndefine(Rgb, rgb, extend(Color, {\n  brighter: function(k) {\n    k = k == null ? brighter : Math.pow(brighter, k);\n    return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);\n  },\n  darker: function(k) {\n    k = k == null ? darker : Math.pow(darker, k);\n    return new Rgb(this.r * k, this.g * k, this.b * k, this.opacity);\n  },\n  rgb: function() {\n    return this;\n  },\n  displayable: function() {\n    return (-0.5 <= this.r && this.r < 255.5)\n        && (-0.5 <= this.g && this.g < 255.5)\n        && (-0.5 <= this.b && this.b < 255.5)\n        && (0 <= this.opacity && this.opacity <= 1);\n  },\n  hex: rgb_formatHex, // Deprecated! Use color.formatHex.\n  formatHex: rgb_formatHex,\n  formatRgb: rgb_formatRgb,\n  toString: rgb_formatRgb\n}));\n\nfunction rgb_formatHex() {\n  return \"#\" + hex(this.r) + hex(this.g) + hex(this.b);\n}\n\nfunction rgb_formatRgb() {\n  var a = this.opacity; a = isNaN(a) ? 1 : Math.max(0, Math.min(1, a));\n  return (a === 1 ? \"rgb(\" : \"rgba(\")\n      + Math.max(0, Math.min(255, Math.round(this.r) || 0)) + \", \"\n      + Math.max(0, Math.min(255, Math.round(this.g) || 0)) + \", \"\n      + Math.max(0, Math.min(255, Math.round(this.b) || 0))\n      + (a === 1 ? \")\" : \", \" + a + \")\");\n}\n\nfunction hex(value) {\n  value = Math.max(0, Math.min(255, Math.round(value) || 0));\n  return (value < 16 ? \"0\" : \"\") + value.toString(16);\n}\n\nfunction hsla(h, s, l, a) {\n  if (a <= 0) h = s = l = NaN;\n  else if (l <= 0 || l >= 1) h = s = NaN;\n  else if (s <= 0) h = NaN;\n  return new Hsl(h, s, l, a);\n}\n\nexport function hslConvert(o) {\n  if (o instanceof Hsl) return new Hsl(o.h, o.s, o.l, o.opacity);\n  if (!(o instanceof Color)) o = color(o);\n  if (!o) return new Hsl;\n  if (o instanceof Hsl) return o;\n  o = o.rgb();\n  var r = o.r / 255,\n      g = o.g / 255,\n      b = o.b / 255,\n      min = Math.min(r, g, b),\n      max = Math.max(r, g, b),\n      h = NaN,\n      s = max - min,\n      l = (max + min) / 2;\n  if (s) {\n    if (r === max) h = (g - b) / s + (g < b) * 6;\n    else if (g === max) h = (b - r) / s + 2;\n    else h = (r - g) / s + 4;\n    s /= l < 0.5 ? max + min : 2 - max - min;\n    h *= 60;\n  } else {\n    s = l > 0 && l < 1 ? 0 : h;\n  }\n  return new Hsl(h, s, l, o.opacity);\n}\n\nexport function hsl(h, s, l, opacity) {\n  return arguments.length === 1 ? hslConvert(h) : new Hsl(h, s, l, opacity == null ? 1 : opacity);\n}\n\nfunction Hsl(h, s, l, opacity) {\n  this.h = +h;\n  this.s = +s;\n  this.l = +l;\n  this.opacity = +opacity;\n}\n\ndefine(Hsl, hsl, extend(Color, {\n  brighter: function(k) {\n    k = k == null ? brighter : Math.pow(brighter, k);\n    return new Hsl(this.h, this.s, this.l * k, this.opacity);\n  },\n  darker: function(k) {\n    k = k == null ? darker : Math.pow(darker, k);\n    return new Hsl(this.h, this.s, this.l * k, this.opacity);\n  },\n  rgb: function() {\n    var h = this.h % 360 + (this.h < 0) * 360,\n        s = isNaN(h) || isNaN(this.s) ? 0 : this.s,\n        l = this.l,\n        m2 = l + (l < 0.5 ? l : 1 - l) * s,\n        m1 = 2 * l - m2;\n    return new Rgb(\n      hsl2rgb(h >= 240 ? h - 240 : h + 120, m1, m2),\n      hsl2rgb(h, m1, m2),\n      hsl2rgb(h < 120 ? h + 240 : h - 120, m1, m2),\n      this.opacity\n    );\n  },\n  displayable: function() {\n    return (0 <= this.s && this.s <= 1 || isNaN(this.s))\n        && (0 <= this.l && this.l <= 1)\n        && (0 <= this.opacity && this.opacity <= 1);\n  },\n  formatHsl: function() {\n    var a = this.opacity; a = isNaN(a) ? 1 : Math.max(0, Math.min(1, a));\n    return (a === 1 ? \"hsl(\" : \"hsla(\")\n        + (this.h || 0) + \", \"\n        + (this.s || 0) * 100 + \"%, \"\n        + (this.l || 0) * 100 + \"%\"\n        + (a === 1 ? \")\" : \", \" + a + \")\");\n  }\n}));\n\n/* From FvD 13.37, CSS Color Module Level 3 */\nfunction hsl2rgb(h, m1, m2) {\n  return (h < 60 ? m1 + (m2 - m1) * h / 60\n      : h < 180 ? m2\n      : h < 240 ? m1 + (m2 - m1) * (240 - h) / 60\n      : m1) * 255;\n}\n","import define, {extend} from \"./define.js\";\nimport {Color, rgbConvert, Rgb, darker, brighter} from \"./color.js\";\nimport {deg2rad, rad2deg} from \"./math.js\";\n\nvar A = -0.14861,\n    B = +1.78277,\n    C = -0.29227,\n    D = -0.90649,\n    E = +1.97294,\n    ED = E * D,\n    EB = E * B,\n    BC_DA = B * C - D * A;\n\nfunction cubehelixConvert(o) {\n  if (o instanceof Cubehelix) return new Cubehelix(o.h, o.s, o.l, o.opacity);\n  if (!(o instanceof Rgb)) o = rgbConvert(o);\n  var r = o.r / 255,\n      g = o.g / 255,\n      b = o.b / 255,\n      l = (BC_DA * b + ED * r - EB * g) / (BC_DA + ED - EB),\n      bl = b - l,\n      k = (E * (g - l) - C * bl) / D,\n      s = Math.sqrt(k * k + bl * bl) / (E * l * (1 - l)), // NaN if l=0 or l=1\n      h = s ? Math.atan2(k, bl) * rad2deg - 120 : NaN;\n  return new Cubehelix(h < 0 ? h + 360 : h, s, l, o.opacity);\n}\n\nexport default function cubehelix(h, s, l, opacity) {\n  return arguments.length === 1 ? cubehelixConvert(h) : new Cubehelix(h, s, l, opacity == null ? 1 : opacity);\n}\n\nexport function Cubehelix(h, s, l, opacity) {\n  this.h = +h;\n  this.s = +s;\n  this.l = +l;\n  this.opacity = +opacity;\n}\n\ndefine(Cubehelix, cubehelix, extend(Color, {\n  brighter: function(k) {\n    k = k == null ? brighter : Math.pow(brighter, k);\n    return new Cubehelix(this.h, this.s, this.l * k, this.opacity);\n  },\n  darker: function(k) {\n    k = k == null ? darker : Math.pow(darker, k);\n    return new Cubehelix(this.h, this.s, this.l * k, this.opacity);\n  },\n  rgb: function() {\n    var h = isNaN(this.h) ? 0 : (this.h + 120) * deg2rad,\n        l = +this.l,\n        a = isNaN(this.s) ? 0 : this.s * l * (1 - l),\n        cosh = Math.cos(h),\n        sinh = Math.sin(h);\n    return new Rgb(\n      255 * (l + a * (A * cosh + B * sinh)),\n      255 * (l + a * (C * cosh + D * sinh)),\n      255 * (l + a * (E * cosh)),\n      this.opacity\n    );\n  }\n}));\n","export default function(constructor, factory, prototype) {\n  constructor.prototype = factory.prototype = prototype;\n  prototype.constructor = constructor;\n}\n\nexport function extend(parent, definition) {\n  var prototype = Object.create(parent.prototype);\n  for (var key in definition) prototype[key] = definition[key];\n  return prototype;\n}\n","export {default as color, rgb, hsl} from \"./color.js\";\nexport {default as lab, hcl, lch, gray} from \"./lab.js\";\nexport {default as cubehelix} from \"./cubehelix.js\";\n","import define, {extend} from \"./define.js\";\nimport {Color, rgbConvert, Rgb} from \"./color.js\";\nimport {deg2rad, rad2deg} from \"./math.js\";\n\n// https://observablehq.com/@mbostock/lab-and-rgb\nvar K = 18,\n    Xn = 0.96422,\n    Yn = 1,\n    Zn = 0.82521,\n    t0 = 4 / 29,\n    t1 = 6 / 29,\n    t2 = 3 * t1 * t1,\n    t3 = t1 * t1 * t1;\n\nfunction labConvert(o) {\n  if (o instanceof Lab) return new Lab(o.l, o.a, o.b, o.opacity);\n  if (o instanceof Hcl) return hcl2lab(o);\n  if (!(o instanceof Rgb)) o = rgbConvert(o);\n  var r = rgb2lrgb(o.r),\n      g = rgb2lrgb(o.g),\n      b = rgb2lrgb(o.b),\n      y = xyz2lab((0.2225045 * r + 0.7168786 * g + 0.0606169 * b) / Yn), x, z;\n  if (r === g && g === b) x = z = y; else {\n    x = xyz2lab((0.4360747 * r + 0.3850649 * g + 0.1430804 * b) / Xn);\n    z = xyz2lab((0.0139322 * r + 0.0971045 * g + 0.7141733 * b) / Zn);\n  }\n  return new Lab(116 * y - 16, 500 * (x - y), 200 * (y - z), o.opacity);\n}\n\nexport function gray(l, opacity) {\n  return new Lab(l, 0, 0, opacity == null ? 1 : opacity);\n}\n\nexport default function lab(l, a, b, opacity) {\n  return arguments.length === 1 ? labConvert(l) : new Lab(l, a, b, opacity == null ? 1 : opacity);\n}\n\nexport function Lab(l, a, b, opacity) {\n  this.l = +l;\n  this.a = +a;\n  this.b = +b;\n  this.opacity = +opacity;\n}\n\ndefine(Lab, lab, extend(Color, {\n  brighter: function(k) {\n    return new Lab(this.l + K * (k == null ? 1 : k), this.a, this.b, this.opacity);\n  },\n  darker: function(k) {\n    return new Lab(this.l - K * (k == null ? 1 : k), this.a, this.b, this.opacity);\n  },\n  rgb: function() {\n    var y = (this.l + 16) / 116,\n        x = isNaN(this.a) ? y : y + this.a / 500,\n        z = isNaN(this.b) ? y : y - this.b / 200;\n    x = Xn * lab2xyz(x);\n    y = Yn * lab2xyz(y);\n    z = Zn * lab2xyz(z);\n    return new Rgb(\n      lrgb2rgb( 3.1338561 * x - 1.6168667 * y - 0.4906146 * z),\n      lrgb2rgb(-0.9787684 * x + 1.9161415 * y + 0.0334540 * z),\n      lrgb2rgb( 0.0719453 * x - 0.2289914 * y + 1.4052427 * z),\n      this.opacity\n    );\n  }\n}));\n\nfunction xyz2lab(t) {\n  return t > t3 ? Math.pow(t, 1 / 3) : t / t2 + t0;\n}\n\nfunction lab2xyz(t) {\n  return t > t1 ? t * t * t : t2 * (t - t0);\n}\n\nfunction lrgb2rgb(x) {\n  return 255 * (x <= 0.0031308 ? 12.92 * x : 1.055 * Math.pow(x, 1 / 2.4) - 0.055);\n}\n\nfunction rgb2lrgb(x) {\n  return (x /= 255) <= 0.04045 ? x / 12.92 : Math.pow((x + 0.055) / 1.055, 2.4);\n}\n\nfunction hclConvert(o) {\n  if (o instanceof Hcl) return new Hcl(o.h, o.c, o.l, o.opacity);\n  if (!(o instanceof Lab)) o = labConvert(o);\n  if (o.a === 0 && o.b === 0) return new Hcl(NaN, 0 < o.l && o.l < 100 ? 0 : NaN, o.l, o.opacity);\n  var h = Math.atan2(o.b, o.a) * rad2deg;\n  return new Hcl(h < 0 ? h + 360 : h, Math.sqrt(o.a * o.a + o.b * o.b), o.l, o.opacity);\n}\n\nexport function lch(l, c, h, opacity) {\n  return arguments.length === 1 ? hclConvert(l) : new Hcl(h, c, l, opacity == null ? 1 : opacity);\n}\n\nexport function hcl(h, c, l, opacity) {\n  return arguments.length === 1 ? hclConvert(h) : new Hcl(h, c, l, opacity == null ? 1 : opacity);\n}\n\nexport function Hcl(h, c, l, opacity) {\n  this.h = +h;\n  this.c = +c;\n  this.l = +l;\n  this.opacity = +opacity;\n}\n\nfunction hcl2lab(o) {\n  if (isNaN(o.h)) return new Lab(o.l, 0, 0, o.opacity);\n  var h = o.h * deg2rad;\n  return new Lab(o.l, Math.cos(h) * o.c, Math.sin(h) * o.c, o.opacity);\n}\n\ndefine(Hcl, hcl, extend(Color, {\n  brighter: function(k) {\n    return new Hcl(this.h, this.c, this.l + K * (k == null ? 1 : k), this.opacity);\n  },\n  darker: function(k) {\n    return new Hcl(this.h, this.c, this.l - K * (k == null ? 1 : k), this.opacity);\n  },\n  rgb: function() {\n    return hcl2lab(this).rgb();\n  }\n}));\n","export var deg2rad = Math.PI / 180;\nexport var rad2deg = 180 / Math.PI;\n","import formatLocale from \"./locale.js\";\n\nvar locale;\nexport var format;\nexport var formatPrefix;\n\ndefaultLocale({\n  decimal: \".\",\n  thousands: \",\",\n  grouping: [3],\n  currency: [\"$\", \"\"],\n  minus: \"-\"\n});\n\nexport default function defaultLocale(definition) {\n  locale = formatLocale(definition);\n  format = locale.format;\n  formatPrefix = locale.formatPrefix;\n  return locale;\n}\n","import formatDecimal from \"./formatDecimal.js\";\n\nexport default function(x) {\n  return x = formatDecimal(Math.abs(x)), x ? x[1] : NaN;\n}\n","// Computes the decimal coefficient and exponent of the specified number x with\n// significant digits p, where x is positive and p is in [1, 21] or undefined.\n// For example, formatDecimal(1.23) returns [\"123\", 0].\nexport default function(x, p) {\n  if ((i = (x = p ? x.toExponential(p - 1) : x.toExponential()).indexOf(\"e\")) < 0) return null; // NaN, ±Infinity\n  var i, coefficient = x.slice(0, i);\n\n  // The string returned by toExponential either has the form \\d\\.\\d+e[-+]\\d+\n  // (e.g., 1.2e+3) or the form \\de[-+]\\d+ (e.g., 1e+3).\n  return [\n    coefficient.length > 1 ? coefficient[0] + coefficient.slice(2) : coefficient,\n    +x.slice(i + 1)\n  ];\n}\n","export default function(grouping, thousands) {\n  return function(value, width) {\n    var i = value.length,\n        t = [],\n        j = 0,\n        g = grouping[0],\n        length = 0;\n\n    while (i > 0 && g > 0) {\n      if (length + g + 1 > width) g = Math.max(1, width - length);\n      t.push(value.substring(i -= g, i + g));\n      if ((length += g + 1) > width) break;\n      g = grouping[j = (j + 1) % grouping.length];\n    }\n\n    return t.reverse().join(thousands);\n  };\n}\n","export default function(numerals) {\n  return function(value) {\n    return value.replace(/[0-9]/g, function(i) {\n      return numerals[+i];\n    });\n  };\n}\n","import formatDecimal from \"./formatDecimal.js\";\n\nexport var prefixExponent;\n\nexport default function(x, p) {\n  var d = formatDecimal(x, p);\n  if (!d) return x + \"\";\n  var coefficient = d[0],\n      exponent = d[1],\n      i = exponent - (prefixExponent = Math.max(-8, Math.min(8, Math.floor(exponent / 3))) * 3) + 1,\n      n = coefficient.length;\n  return i === n ? coefficient\n      : i > n ? coefficient + new Array(i - n + 1).join(\"0\")\n      : i > 0 ? coefficient.slice(0, i) + \".\" + coefficient.slice(i)\n      : \"0.\" + new Array(1 - i).join(\"0\") + formatDecimal(x, Math.max(0, p + i - 1))[0]; // less than 1y!\n}\n","import formatDecimal from \"./formatDecimal.js\";\n\nexport default function(x, p) {\n  var d = formatDecimal(x, p);\n  if (!d) return x + \"\";\n  var coefficient = d[0],\n      exponent = d[1];\n  return exponent < 0 ? \"0.\" + new Array(-exponent).join(\"0\") + coefficient\n      : coefficient.length > exponent + 1 ? coefficient.slice(0, exponent + 1) + \".\" + coefficient.slice(exponent + 1)\n      : coefficient + new Array(exponent - coefficient.length + 2).join(\"0\");\n}\n","// [[fill]align][sign][symbol][0][width][,][.precision][~][type]\nvar re = /^(?:(.)?([<>=^]))?([+\\-( ])?([$#])?(0)?(\\d+)?(,)?(\\.\\d+)?(~)?([a-z%])?$/i;\n\nexport default function formatSpecifier(specifier) {\n  if (!(match = re.exec(specifier))) throw new Error(\"invalid format: \" + specifier);\n  var match;\n  return new FormatSpecifier({\n    fill: match[1],\n    align: match[2],\n    sign: match[3],\n    symbol: match[4],\n    zero: match[5],\n    width: match[6],\n    comma: match[7],\n    precision: match[8] && match[8].slice(1),\n    trim: match[9],\n    type: match[10]\n  });\n}\n\nformatSpecifier.prototype = FormatSpecifier.prototype; // instanceof\n\nexport function FormatSpecifier(specifier) {\n  this.fill = specifier.fill === undefined ? \" \" : specifier.fill + \"\";\n  this.align = specifier.align === undefined ? \">\" : specifier.align + \"\";\n  this.sign = specifier.sign === undefined ? \"-\" : specifier.sign + \"\";\n  this.symbol = specifier.symbol === undefined ? \"\" : specifier.symbol + \"\";\n  this.zero = !!specifier.zero;\n  this.width = specifier.width === undefined ? undefined : +specifier.width;\n  this.comma = !!specifier.comma;\n  this.precision = specifier.precision === undefined ? undefined : +specifier.precision;\n  this.trim = !!specifier.trim;\n  this.type = specifier.type === undefined ? \"\" : specifier.type + \"\";\n}\n\nFormatSpecifier.prototype.toString = function() {\n  return this.fill\n      + this.align\n      + this.sign\n      + this.symbol\n      + (this.zero ? \"0\" : \"\")\n      + (this.width === undefined ? \"\" : Math.max(1, this.width | 0))\n      + (this.comma ? \",\" : \"\")\n      + (this.precision === undefined ? \"\" : \".\" + Math.max(0, this.precision | 0))\n      + (this.trim ? \"~\" : \"\")\n      + this.type;\n};\n","// Trims insignificant zeros, e.g., replaces 1.2000k with 1.2k.\nexport default function(s) {\n  out: for (var n = s.length, i = 1, i0 = -1, i1; i < n; ++i) {\n    switch (s[i]) {\n      case \".\": i0 = i1 = i; break;\n      case \"0\": if (i0 === 0) i0 = i; i1 = i; break;\n      default: if (!+s[i]) break out; if (i0 > 0) i0 = 0; break;\n    }\n  }\n  return i0 > 0 ? s.slice(0, i0) + s.slice(i1 + 1) : s;\n}\n","import formatPrefixAuto from \"./formatPrefixAuto.js\";\nimport formatRounded from \"./formatRounded.js\";\n\nexport default {\n  \"%\": function(x, p) { return (x * 100).toFixed(p); },\n  \"b\": function(x) { return Math.round(x).toString(2); },\n  \"c\": function(x) { return x + \"\"; },\n  \"d\": function(x) { return Math.round(x).toString(10); },\n  \"e\": function(x, p) { return x.toExponential(p); },\n  \"f\": function(x, p) { return x.toFixed(p); },\n  \"g\": function(x, p) { return x.toPrecision(p); },\n  \"o\": function(x) { return Math.round(x).toString(8); },\n  \"p\": function(x, p) { return formatRounded(x * 100, p); },\n  \"r\": formatRounded,\n  \"s\": formatPrefixAuto,\n  \"X\": function(x) { return Math.round(x).toString(16).toUpperCase(); },\n  \"x\": function(x) { return Math.round(x).toString(16); }\n};\n","export default function(x) {\n  return x;\n}\n","export {default as formatDefaultLocale, format, formatPrefix} from \"./defaultLocale.js\";\nexport {default as formatLocale} from \"./locale.js\";\nexport {default as formatSpecifier, FormatSpecifier} from \"./formatSpecifier.js\";\nexport {default as precisionFixed} from \"./precisionFixed.js\";\nexport {default as precisionPrefix} from \"./precisionPrefix.js\";\nexport {default as precisionRound} from \"./precisionRound.js\";\n","import exponent from \"./exponent.js\";\nimport formatGroup from \"./formatGroup.js\";\nimport formatNumerals from \"./formatNumerals.js\";\nimport formatSpecifier from \"./formatSpecifier.js\";\nimport formatTrim from \"./formatTrim.js\";\nimport formatTypes from \"./formatTypes.js\";\nimport {prefixExponent} from \"./formatPrefixAuto.js\";\nimport identity from \"./identity.js\";\n\nvar map = Array.prototype.map,\n    prefixes = [\"y\",\"z\",\"a\",\"f\",\"p\",\"n\",\"µ\",\"m\",\"\",\"k\",\"M\",\"G\",\"T\",\"P\",\"E\",\"Z\",\"Y\"];\n\nexport default function(locale) {\n  var group = locale.grouping === undefined || locale.thousands === undefined ? identity : formatGroup(map.call(locale.grouping, Number), locale.thousands + \"\"),\n      currencyPrefix = locale.currency === undefined ? \"\" : locale.currency[0] + \"\",\n      currencySuffix = locale.currency === undefined ? \"\" : locale.currency[1] + \"\",\n      decimal = locale.decimal === undefined ? \".\" : locale.decimal + \"\",\n      numerals = locale.numerals === undefined ? identity : formatNumerals(map.call(locale.numerals, String)),\n      percent = locale.percent === undefined ? \"%\" : locale.percent + \"\",\n      minus = locale.minus === undefined ? \"-\" : locale.minus + \"\",\n      nan = locale.nan === undefined ? \"NaN\" : locale.nan + \"\";\n\n  function newFormat(specifier) {\n    specifier = formatSpecifier(specifier);\n\n    var fill = specifier.fill,\n        align = specifier.align,\n        sign = specifier.sign,\n        symbol = specifier.symbol,\n        zero = specifier.zero,\n        width = specifier.width,\n        comma = specifier.comma,\n        precision = specifier.precision,\n        trim = specifier.trim,\n        type = specifier.type;\n\n    // The \"n\" type is an alias for \",g\".\n    if (type === \"n\") comma = true, type = \"g\";\n\n    // The \"\" type, and any invalid type, is an alias for \".12~g\".\n    else if (!formatTypes[type]) precision === undefined && (precision = 12), trim = true, type = \"g\";\n\n    // If zero fill is specified, padding goes after sign and before digits.\n    if (zero || (fill === \"0\" && align === \"=\")) zero = true, fill = \"0\", align = \"=\";\n\n    // Compute the prefix and suffix.\n    // For SI-prefix, the suffix is lazily computed.\n    var prefix = symbol === \"$\" ? currencyPrefix : symbol === \"#\" && /[boxX]/.test(type) ? \"0\" + type.toLowerCase() : \"\",\n        suffix = symbol === \"$\" ? currencySuffix : /[%p]/.test(type) ? percent : \"\";\n\n    // What format function should we use?\n    // Is this an integer type?\n    // Can this type generate exponential notation?\n    var formatType = formatTypes[type],\n        maybeSuffix = /[defgprs%]/.test(type);\n\n    // Set the default precision if not specified,\n    // or clamp the specified precision to the supported range.\n    // For significant precision, it must be in [1, 21].\n    // For fixed precision, it must be in [0, 20].\n    precision = precision === undefined ? 6\n        : /[gprs]/.test(type) ? Math.max(1, Math.min(21, precision))\n        : Math.max(0, Math.min(20, precision));\n\n    function format(value) {\n      var valuePrefix = prefix,\n          valueSuffix = suffix,\n          i, n, c;\n\n      if (type === \"c\") {\n        valueSuffix = formatType(value) + valueSuffix;\n        value = \"\";\n      } else {\n        value = +value;\n\n        // Perform the initial formatting.\n        var valueNegative = value < 0;\n        value = isNaN(value) ? nan : formatType(Math.abs(value), precision);\n\n        // Trim insignificant zeros.\n        if (trim) value = formatTrim(value);\n\n        // If a negative value rounds to zero during formatting, treat as positive.\n        if (valueNegative && +value === 0) valueNegative = false;\n\n        // Compute the prefix and suffix.\n        valuePrefix = (valueNegative ? (sign === \"(\" ? sign : minus) : sign === \"-\" || sign === \"(\" ? \"\" : sign) + valuePrefix;\n\n        valueSuffix = (type === \"s\" ? prefixes[8 + prefixExponent / 3] : \"\") + valueSuffix + (valueNegative && sign === \"(\" ? \")\" : \"\");\n\n        // Break the formatted value into the integer “value” part that can be\n        // grouped, and fractional or exponential “suffix” part that is not.\n        if (maybeSuffix) {\n          i = -1, n = value.length;\n          while (++i < n) {\n            if (c = value.charCodeAt(i), 48 > c || c > 57) {\n              valueSuffix = (c === 46 ? decimal + value.slice(i + 1) : value.slice(i)) + valueSuffix;\n              value = value.slice(0, i);\n              break;\n            }\n          }\n        }\n      }\n\n      // If the fill character is not \"0\", grouping is applied before padding.\n      if (comma && !zero) value = group(value, Infinity);\n\n      // Compute the padding.\n      var length = valuePrefix.length + value.length + valueSuffix.length,\n          padding = length < width ? new Array(width - length + 1).join(fill) : \"\";\n\n      // If the fill character is \"0\", grouping is applied after padding.\n      if (comma && zero) value = group(padding + value, padding.length ? width - valueSuffix.length : Infinity), padding = \"\";\n\n      // Reconstruct the final output based on the desired alignment.\n      switch (align) {\n        case \"<\": value = valuePrefix + value + valueSuffix + padding; break;\n        case \"=\": value = valuePrefix + padding + value + valueSuffix; break;\n        case \"^\": value = padding.slice(0, length = padding.length >> 1) + valuePrefix + value + valueSuffix + padding.slice(length); break;\n        default: value = padding + valuePrefix + value + valueSuffix; break;\n      }\n\n      return numerals(value);\n    }\n\n    format.toString = function() {\n      return specifier + \"\";\n    };\n\n    return format;\n  }\n\n  function formatPrefix(specifier, value) {\n    var f = newFormat((specifier = formatSpecifier(specifier), specifier.type = \"f\", specifier)),\n        e = Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3,\n        k = Math.pow(10, -e),\n        prefix = prefixes[8 + e / 3];\n    return function(value) {\n      return f(k * value) + prefix;\n    };\n  }\n\n  return {\n    format: newFormat,\n    formatPrefix: formatPrefix\n  };\n}\n","import exponent from \"./exponent.js\";\n\nexport default function(step) {\n  return Math.max(0, -exponent(Math.abs(step)));\n}\n","import exponent from \"./exponent.js\";\n\nexport default function(step, value) {\n  return Math.max(0, Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3 - exponent(Math.abs(step)));\n}\n","import exponent from \"./exponent.js\";\n\nexport default function(step, max) {\n  step = Math.abs(step), max = Math.abs(max) - step;\n  return Math.max(0, exponent(max) - exponent(step)) + 1;\n}\n","import value from \"./value.js\";\nimport numberArray, {isNumberArray} from \"./numberArray.js\";\n\nexport default function(a, b) {\n  return (isNumberArray(b) ? numberArray : genericArray)(a, b);\n}\n\nexport function genericArray(a, b) {\n  var nb = b ? b.length : 0,\n      na = a ? Math.min(nb, a.length) : 0,\n      x = new Array(na),\n      c = new Array(nb),\n      i;\n\n  for (i = 0; i < na; ++i) x[i] = value(a[i], b[i]);\n  for (; i < nb; ++i) c[i] = b[i];\n\n  return function(t) {\n    for (i = 0; i < na; ++i) c[i] = x[i](t);\n    return c;\n  };\n}\n","export function basis(t1, v0, v1, v2, v3) {\n  var t2 = t1 * t1, t3 = t2 * t1;\n  return ((1 - 3 * t1 + 3 * t2 - t3) * v0\n      + (4 - 6 * t2 + 3 * t3) * v1\n      + (1 + 3 * t1 + 3 * t2 - 3 * t3) * v2\n      + t3 * v3) / 6;\n}\n\nexport default function(values) {\n  var n = values.length - 1;\n  return function(t) {\n    var i = t <= 0 ? (t = 0) : t >= 1 ? (t = 1, n - 1) : Math.floor(t * n),\n        v1 = values[i],\n        v2 = values[i + 1],\n        v0 = i > 0 ? values[i - 1] : 2 * v1 - v2,\n        v3 = i < n - 1 ? values[i + 2] : 2 * v2 - v1;\n    return basis((t - i / n) * n, v0, v1, v2, v3);\n  };\n}\n","import {basis} from \"./basis.js\";\n\nexport default function(values) {\n  var n = values.length;\n  return function(t) {\n    var i = Math.floor(((t %= 1) < 0 ? ++t : t) * n),\n        v0 = values[(i + n - 1) % n],\n        v1 = values[i % n],\n        v2 = values[(i + 1) % n],\n        v3 = values[(i + 2) % n];\n    return basis((t - i / n) * n, v0, v1, v2, v3);\n  };\n}\n","import constant from \"./constant.js\";\n\nfunction linear(a, d) {\n  return function(t) {\n    return a + t * d;\n  };\n}\n\nfunction exponential(a, b, y) {\n  return a = Math.pow(a, y), b = Math.pow(b, y) - a, y = 1 / y, function(t) {\n    return Math.pow(a + t * b, y);\n  };\n}\n\nexport function hue(a, b) {\n  var d = b - a;\n  return d ? linear(a, d > 180 || d < -180 ? d - 360 * Math.round(d / 360) : d) : constant(isNaN(a) ? b : a);\n}\n\nexport function gamma(y) {\n  return (y = +y) === 1 ? nogamma : function(a, b) {\n    return b - a ? exponential(a, b, y) : constant(isNaN(a) ? b : a);\n  };\n}\n\nexport default function nogamma(a, b) {\n  var d = b - a;\n  return d ? linear(a, d) : constant(isNaN(a) ? b : a);\n}\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","import {cubehelix as colorCubehelix} from \"d3-color\";\nimport color, {hue} from \"./color.js\";\n\nfunction cubehelix(hue) {\n  return (function cubehelixGamma(y) {\n    y = +y;\n\n    function cubehelix(start, end) {\n      var h = hue((start = colorCubehelix(start)).h, (end = colorCubehelix(end)).h),\n          s = color(start.s, end.s),\n          l = color(start.l, end.l),\n          opacity = color(start.opacity, end.opacity);\n      return function(t) {\n        start.h = h(t);\n        start.s = s(t);\n        start.l = l(Math.pow(t, y));\n        start.opacity = opacity(t);\n        return start + \"\";\n      };\n    }\n\n    cubehelix.gamma = cubehelixGamma;\n\n    return cubehelix;\n  })(1);\n}\n\nexport default cubehelix(hue);\nexport var cubehelixLong = cubehelix(color);\n","export default function(a, b) {\n  var d = new Date;\n  return a = +a, b = +b, function(t) {\n    return d.setTime(a * (1 - t) + b * t), d;\n  };\n}\n","export default function(range) {\n  var n = range.length;\n  return function(t) {\n    return range[Math.max(0, Math.min(n - 1, Math.floor(t * n)))];\n  };\n}\n","import {hcl as colorHcl} from \"d3-color\";\nimport color, {hue} from \"./color.js\";\n\nfunction hcl(hue) {\n  return function(start, end) {\n    var h = hue((start = colorHcl(start)).h, (end = colorHcl(end)).h),\n        c = color(start.c, end.c),\n        l = color(start.l, end.l),\n        opacity = color(start.opacity, end.opacity);\n    return function(t) {\n      start.h = h(t);\n      start.c = c(t);\n      start.l = l(t);\n      start.opacity = opacity(t);\n      return start + \"\";\n    };\n  }\n}\n\nexport default hcl(hue);\nexport var hclLong = hcl(color);\n","import {hsl as colorHsl} from \"d3-color\";\nimport color, {hue} from \"./color.js\";\n\nfunction hsl(hue) {\n  return function(start, end) {\n    var h = hue((start = colorHsl(start)).h, (end = colorHsl(end)).h),\n        s = color(start.s, end.s),\n        l = color(start.l, end.l),\n        opacity = color(start.opacity, end.opacity);\n    return function(t) {\n      start.h = h(t);\n      start.s = s(t);\n      start.l = l(t);\n      start.opacity = opacity(t);\n      return start + \"\";\n    };\n  }\n}\n\nexport default hsl(hue);\nexport var hslLong = hsl(color);\n","import {hue} from \"./color.js\";\n\nexport default function(a, b) {\n  var i = hue(+a, +b);\n  return function(t) {\n    var x = i(t);\n    return x - 360 * Math.floor(x / 360);\n  };\n}\n","export {default as interpolate} from \"./value.js\";\nexport {default as interpolateArray} from \"./array.js\";\nexport {default as interpolateBasis} from \"./basis.js\";\nexport {default as interpolateBasisClosed} from \"./basisClosed.js\";\nexport {default as interpolateDate} from \"./date.js\";\nexport {default as interpolateDiscrete} from \"./discrete.js\";\nexport {default as interpolateHue} from \"./hue.js\";\nexport {default as interpolateNumber} from \"./number.js\";\nexport {default as interpolateNumberArray} from \"./numberArray.js\";\nexport {default as interpolateObject} from \"./object.js\";\nexport {default as interpolateRound} from \"./round.js\";\nexport {default as interpolateString} from \"./string.js\";\nexport {interpolateTransformCss, interpolateTransformSvg} from \"./transform/index.js\";\nexport {default as interpolateZoom} from \"./zoom.js\";\nexport {default as interpolateRgb, rgbBasis as interpolateRgbBasis, rgbBasisClosed as interpolateRgbBasisClosed} from \"./rgb.js\";\nexport {default as interpolateHsl, hslLong as interpolateHslLong} from \"./hsl.js\";\nexport {default as interpolateLab} from \"./lab.js\";\nexport {default as interpolateHcl, hclLong as interpolateHclLong} from \"./hcl.js\";\nexport {default as interpolateCubehelix, cubehelixLong as interpolateCubehelixLong} from \"./cubehelix.js\";\nexport {default as piecewise} from \"./piecewise.js\";\nexport {default as quantize} from \"./quantize.js\";\n","import {lab as colorLab} from \"d3-color\";\nimport color from \"./color.js\";\n\nexport default function lab(start, end) {\n  var l = color((start = colorLab(start)).l, (end = colorLab(end)).l),\n      a = color(start.a, end.a),\n      b = color(start.b, end.b),\n      opacity = color(start.opacity, end.opacity);\n  return function(t) {\n    start.l = l(t);\n    start.a = a(t);\n    start.b = b(t);\n    start.opacity = opacity(t);\n    return start + \"\";\n  };\n}\n","export default function(a, b) {\n  return a = +a, b = +b, function(t) {\n    return a * (1 - t) + b * t;\n  };\n}\n","export default function(a, b) {\n  if (!b) b = [];\n  var n = a ? Math.min(b.length, a.length) : 0,\n      c = b.slice(),\n      i;\n  return function(t) {\n    for (i = 0; i < n; ++i) c[i] = a[i] * (1 - t) + b[i] * t;\n    return c;\n  };\n}\n\nexport function isNumberArray(x) {\n  return ArrayBuffer.isView(x) && !(x instanceof DataView);\n}\n","import value from \"./value.js\";\n\nexport default function(a, b) {\n  var i = {},\n      c = {},\n      k;\n\n  if (a === null || typeof a !== \"object\") a = {};\n  if (b === null || typeof b !== \"object\") b = {};\n\n  for (k in b) {\n    if (k in a) {\n      i[k] = value(a[k], b[k]);\n    } else {\n      c[k] = b[k];\n    }\n  }\n\n  return function(t) {\n    for (k in i) c[k] = i[k](t);\n    return c;\n  };\n}\n","export default function piecewise(interpolate, values) {\n  var i = 0, n = values.length - 1, v = values[0], I = new Array(n < 0 ? 0 : n);\n  while (i < n) I[i] = interpolate(v, v = values[++i]);\n  return function(t) {\n    var i = Math.max(0, Math.min(n - 1, Math.floor(t *= n)));\n    return I[i](t - i);\n  };\n}\n","export default function(interpolator, n) {\n  var samples = new Array(n);\n  for (var i = 0; i < n; ++i) samples[i] = interpolator(i / (n - 1));\n  return samples;\n}\n","import {rgb as colorRgb} from \"d3-color\";\nimport basis from \"./basis.js\";\nimport basisClosed from \"./basisClosed.js\";\nimport nogamma, {gamma} from \"./color.js\";\n\nexport default (function rgbGamma(y) {\n  var color = gamma(y);\n\n  function rgb(start, end) {\n    var r = color((start = colorRgb(start)).r, (end = colorRgb(end)).r),\n        g = color(start.g, end.g),\n        b = color(start.b, end.b),\n        opacity = nogamma(start.opacity, end.opacity);\n    return function(t) {\n      start.r = r(t);\n      start.g = g(t);\n      start.b = b(t);\n      start.opacity = opacity(t);\n      return start + \"\";\n    };\n  }\n\n  rgb.gamma = rgbGamma;\n\n  return rgb;\n})(1);\n\nfunction rgbSpline(spline) {\n  return function(colors) {\n    var n = colors.length,\n        r = new Array(n),\n        g = new Array(n),\n        b = new Array(n),\n        i, color;\n    for (i = 0; i < n; ++i) {\n      color = colorRgb(colors[i]);\n      r[i] = color.r || 0;\n      g[i] = color.g || 0;\n      b[i] = color.b || 0;\n    }\n    r = spline(r);\n    g = spline(g);\n    b = spline(b);\n    color.opacity = 1;\n    return function(t) {\n      color.r = r(t);\n      color.g = g(t);\n      color.b = b(t);\n      return color + \"\";\n    };\n  };\n}\n\nexport var rgbBasis = rgbSpline(basis);\nexport var rgbBasisClosed = rgbSpline(basisClosed);\n","export default function(a, b) {\n  return a = +a, b = +b, function(t) {\n    return Math.round(a * (1 - t) + b * t);\n  };\n}\n","import number from \"./number.js\";\n\nvar reA = /[-+]?(?:\\d+\\.?\\d*|\\.?\\d+)(?:[eE][-+]?\\d+)?/g,\n    reB = new RegExp(reA.source, \"g\");\n\nfunction zero(b) {\n  return function() {\n    return b;\n  };\n}\n\nfunction one(b) {\n  return function(t) {\n    return b(t) + \"\";\n  };\n}\n\nexport default function(a, b) {\n  var bi = reA.lastIndex = reB.lastIndex = 0, // scan index for next number in b\n      am, // current match in a\n      bm, // current match in b\n      bs, // string preceding current number in b, if any\n      i = -1, // index in s\n      s = [], // string constants and placeholders\n      q = []; // number interpolators\n\n  // Coerce inputs to strings.\n  a = a + \"\", b = b + \"\";\n\n  // Interpolate pairs of numbers in a & b.\n  while ((am = reA.exec(a))\n      && (bm = reB.exec(b))) {\n    if ((bs = bm.index) > bi) { // a string precedes the next number in b\n      bs = b.slice(bi, bs);\n      if (s[i]) s[i] += bs; // coalesce with previous string\n      else s[++i] = bs;\n    }\n    if ((am = am[0]) === (bm = bm[0])) { // numbers in a & b match\n      if (s[i]) s[i] += bm; // coalesce with previous string\n      else s[++i] = bm;\n    } else { // interpolate non-matching numbers\n      s[++i] = null;\n      q.push({i: i, x: number(am, bm)});\n    }\n    bi = reB.lastIndex;\n  }\n\n  // Add remains of b.\n  if (bi < b.length) {\n    bs = b.slice(bi);\n    if (s[i]) s[i] += bs; // coalesce with previous string\n    else s[++i] = bs;\n  }\n\n  // Special optimization for only a single match.\n  // Otherwise, interpolate each of the numbers and rejoin the string.\n  return s.length < 2 ? (q[0]\n      ? one(q[0].x)\n      : zero(b))\n      : (b = q.length, function(t) {\n          for (var i = 0, o; i < b; ++i) s[(o = q[i]).i] = o.x(t);\n          return s.join(\"\");\n        });\n}\n","var degrees = 180 / Math.PI;\n\nexport var identity = {\n  translateX: 0,\n  translateY: 0,\n  rotate: 0,\n  skewX: 0,\n  scaleX: 1,\n  scaleY: 1\n};\n\nexport default function(a, b, c, d, e, f) {\n  var scaleX, scaleY, skewX;\n  if (scaleX = Math.sqrt(a * a + b * b)) a /= scaleX, b /= scaleX;\n  if (skewX = a * c + b * d) c -= a * skewX, d -= b * skewX;\n  if (scaleY = Math.sqrt(c * c + d * d)) c /= scaleY, d /= scaleY, skewX /= scaleY;\n  if (a * d < b * c) a = -a, b = -b, skewX = -skewX, scaleX = -scaleX;\n  return {\n    translateX: e,\n    translateY: f,\n    rotate: Math.atan2(b, a) * degrees,\n    skewX: Math.atan(skewX) * degrees,\n    scaleX: scaleX,\n    scaleY: scaleY\n  };\n}\n","import number from \"../number.js\";\nimport {parseCss, parseSvg} from \"./parse.js\";\n\nfunction interpolateTransform(parse, pxComma, pxParen, degParen) {\n\n  function pop(s) {\n    return s.length ? s.pop() + \" \" : \"\";\n  }\n\n  function translate(xa, ya, xb, yb, s, q) {\n    if (xa !== xb || ya !== yb) {\n      var i = s.push(\"translate(\", null, pxComma, null, pxParen);\n      q.push({i: i - 4, x: number(xa, xb)}, {i: i - 2, x: number(ya, yb)});\n    } else if (xb || yb) {\n      s.push(\"translate(\" + xb + pxComma + yb + pxParen);\n    }\n  }\n\n  function rotate(a, b, s, q) {\n    if (a !== b) {\n      if (a - b > 180) b += 360; else if (b - a > 180) a += 360; // shortest path\n      q.push({i: s.push(pop(s) + \"rotate(\", null, degParen) - 2, x: number(a, b)});\n    } else if (b) {\n      s.push(pop(s) + \"rotate(\" + b + degParen);\n    }\n  }\n\n  function skewX(a, b, s, q) {\n    if (a !== b) {\n      q.push({i: s.push(pop(s) + \"skewX(\", null, degParen) - 2, x: number(a, b)});\n    } else if (b) {\n      s.push(pop(s) + \"skewX(\" + b + degParen);\n    }\n  }\n\n  function scale(xa, ya, xb, yb, s, q) {\n    if (xa !== xb || ya !== yb) {\n      var i = s.push(pop(s) + \"scale(\", null, \",\", null, \")\");\n      q.push({i: i - 4, x: number(xa, xb)}, {i: i - 2, x: number(ya, yb)});\n    } else if (xb !== 1 || yb !== 1) {\n      s.push(pop(s) + \"scale(\" + xb + \",\" + yb + \")\");\n    }\n  }\n\n  return function(a, b) {\n    var s = [], // string constants and placeholders\n        q = []; // number interpolators\n    a = parse(a), b = parse(b);\n    translate(a.translateX, a.translateY, b.translateX, b.translateY, s, q);\n    rotate(a.rotate, b.rotate, s, q);\n    skewX(a.skewX, b.skewX, s, q);\n    scale(a.scaleX, a.scaleY, b.scaleX, b.scaleY, s, q);\n    a = b = null; // gc\n    return function(t) {\n      var i = -1, n = q.length, o;\n      while (++i < n) s[(o = q[i]).i] = o.x(t);\n      return s.join(\"\");\n    };\n  };\n}\n\nexport var interpolateTransformCss = interpolateTransform(parseCss, \"px, \", \"px)\", \"deg)\");\nexport var interpolateTransformSvg = interpolateTransform(parseSvg, \", \", \")\", \")\");\n","import decompose, {identity} from \"./decompose.js\";\n\nvar cssNode,\n    cssRoot,\n    cssView,\n    svgNode;\n\nexport function parseCss(value) {\n  if (value === \"none\") return identity;\n  if (!cssNode) cssNode = document.createElement(\"DIV\"), cssRoot = document.documentElement, cssView = document.defaultView;\n  cssNode.style.transform = value;\n  value = cssView.getComputedStyle(cssRoot.appendChild(cssNode), null).getPropertyValue(\"transform\");\n  cssRoot.removeChild(cssNode);\n  value = value.slice(7, -1).split(\",\");\n  return decompose(+value[0], +value[1], +value[2], +value[3], +value[4], +value[5]);\n}\n\nexport function parseSvg(value) {\n  if (value == null) return identity;\n  if (!svgNode) svgNode = document.createElementNS(\"http://www.w3.org/2000/svg\", \"g\");\n  svgNode.setAttribute(\"transform\", value);\n  if (!(value = svgNode.transform.baseVal.consolidate())) return identity;\n  value = value.matrix;\n  return decompose(value.a, value.b, value.c, value.d, value.e, value.f);\n}\n","import {color} from \"d3-color\";\nimport rgb from \"./rgb.js\";\nimport {genericArray} from \"./array.js\";\nimport date from \"./date.js\";\nimport number from \"./number.js\";\nimport object from \"./object.js\";\nimport string from \"./string.js\";\nimport constant from \"./constant.js\";\nimport numberArray, {isNumberArray} from \"./numberArray.js\";\n\nexport default function(a, b) {\n  var t = typeof b, c;\n  return b == null || t === \"boolean\" ? constant(b)\n      : (t === \"number\" ? number\n      : t === \"string\" ? ((c = color(b)) ? (b = c, rgb) : string)\n      : b instanceof color ? rgb\n      : b instanceof Date ? date\n      : isNumberArray(b) ? numberArray\n      : Array.isArray(b) ? genericArray\n      : typeof b.valueOf !== \"function\" && typeof b.toString !== \"function\" || isNaN(b) ? object\n      : number)(a, b);\n}\n","var rho = Math.SQRT2,\n    rho2 = 2,\n    rho4 = 4,\n    epsilon2 = 1e-12;\n\nfunction cosh(x) {\n  return ((x = Math.exp(x)) + 1 / x) / 2;\n}\n\nfunction sinh(x) {\n  return ((x = Math.exp(x)) - 1 / x) / 2;\n}\n\nfunction tanh(x) {\n  return ((x = Math.exp(2 * x)) - 1) / (x + 1);\n}\n\n// p0 = [ux0, uy0, w0]\n// p1 = [ux1, uy1, w1]\nexport default function(p0, p1) {\n  var ux0 = p0[0], uy0 = p0[1], w0 = p0[2],\n      ux1 = p1[0], uy1 = p1[1], w1 = p1[2],\n      dx = ux1 - ux0,\n      dy = uy1 - uy0,\n      d2 = dx * dx + dy * dy,\n      i,\n      S;\n\n  // Special case for u0 ≅ u1.\n  if (d2 < epsilon2) {\n    S = Math.log(w1 / w0) / rho;\n    i = function(t) {\n      return [\n        ux0 + t * dx,\n        uy0 + t * dy,\n        w0 * Math.exp(rho * t * S)\n      ];\n    }\n  }\n\n  // General case.\n  else {\n    var d1 = Math.sqrt(d2),\n        b0 = (w1 * w1 - w0 * w0 + rho4 * d2) / (2 * w0 * rho2 * d1),\n        b1 = (w1 * w1 - w0 * w0 - rho4 * d2) / (2 * w1 * rho2 * d1),\n        r0 = Math.log(Math.sqrt(b0 * b0 + 1) - b0),\n        r1 = Math.log(Math.sqrt(b1 * b1 + 1) - b1);\n    S = (r1 - r0) / rho;\n    i = function(t) {\n      var s = t * S,\n          coshr0 = cosh(r0),\n          u = w0 / (rho2 * d1) * (coshr0 * tanh(rho * s + r0) - sinh(r0));\n      return [\n        ux0 + u * dx,\n        uy0 + u * dy,\n        w0 * coshr0 / cosh(rho * s + r0)\n      ];\n    }\n  }\n\n  i.duration = S * 1000;\n\n  return i;\n}\n","export {default as path} from \"./path.js\";\n","var pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction Path() {\n  this._x0 = this._y0 = // start of current subpath\n  this._x1 = this._y1 = null; // end of current subpath\n  this._ = \"\";\n}\n\nfunction path() {\n  return new Path;\n}\n\nPath.prototype = path.prototype = {\n  constructor: Path,\n  moveTo: function(x, y) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y);\n  },\n  closePath: function() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._ += \"Z\";\n    }\n  },\n  lineTo: function(x, y) {\n    this._ += \"L\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  quadraticCurveTo: function(x1, y1, x, y) {\n    this._ += \"Q\" + (+x1) + \",\" + (+y1) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  bezierCurveTo: function(x1, y1, x2, y2, x, y) {\n    this._ += \"C\" + (+x1) + \",\" + (+y1) + \",\" + (+x2) + \",\" + (+y2) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  arcTo: function(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n    var x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._ += \"M\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._ += \"L\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      var x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._ += \"L\" + (x1 + t01 * x01) + \",\" + (y1 + t01 * y01);\n      }\n\n      this._ += \"A\" + r + \",\" + r + \",0,0,\" + (+(y01 * x20 > x01 * y20)) + \",\" + (this._x1 = x1 + t21 * x21) + \",\" + (this._y1 = y1 + t21 * y21);\n    }\n  },\n  arc: function(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n    var dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._ += \"M\" + x0 + \",\" + y0;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._ += \"L\" + x0 + \",\" + y0;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (x - dx) + \",\" + (y - dy) + \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (this._x1 = x0) + \",\" + (this._y1 = y0);\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,\" + (+(da >= pi)) + \",\" + cw + \",\" + (this._x1 = x + r * Math.cos(a1)) + \",\" + (this._y1 = y + r * Math.sin(a1));\n    }\n  },\n  rect: function(x, y, w, h) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y) + \"h\" + (+w) + \"v\" + (+h) + \"h\" + (-w) + \"Z\";\n  },\n  toString: function() {\n    return this._;\n  }\n};\n\nexport default path;\n","import {range as sequence} from \"d3-array\";\nimport {initRange} from \"./init.js\";\nimport ordinal from \"./ordinal.js\";\n\nexport default function band() {\n  var scale = ordinal().unknown(undefined),\n      domain = scale.domain,\n      ordinalRange = scale.range,\n      r0 = 0,\n      r1 = 1,\n      step,\n      bandwidth,\n      round = false,\n      paddingInner = 0,\n      paddingOuter = 0,\n      align = 0.5;\n\n  delete scale.unknown;\n\n  function rescale() {\n    var n = domain().length,\n        reverse = r1 < r0,\n        start = reverse ? r1 : r0,\n        stop = reverse ? r0 : r1;\n    step = (stop - start) / Math.max(1, n - paddingInner + paddingOuter * 2);\n    if (round) step = Math.floor(step);\n    start += (stop - start - step * (n - paddingInner)) * align;\n    bandwidth = step * (1 - paddingInner);\n    if (round) start = Math.round(start), bandwidth = Math.round(bandwidth);\n    var values = sequence(n).map(function(i) { return start + step * i; });\n    return ordinalRange(reverse ? values.reverse() : values);\n  }\n\n  scale.domain = function(_) {\n    return arguments.length ? (domain(_), rescale()) : domain();\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? ([r0, r1] = _, r0 = +r0, r1 = +r1, rescale()) : [r0, r1];\n  };\n\n  scale.rangeRound = function(_) {\n    return [r0, r1] = _, r0 = +r0, r1 = +r1, round = true, rescale();\n  };\n\n  scale.bandwidth = function() {\n    return bandwidth;\n  };\n\n  scale.step = function() {\n    return step;\n  };\n\n  scale.round = function(_) {\n    return arguments.length ? (round = !!_, rescale()) : round;\n  };\n\n  scale.padding = function(_) {\n    return arguments.length ? (paddingInner = Math.min(1, paddingOuter = +_), rescale()) : paddingInner;\n  };\n\n  scale.paddingInner = function(_) {\n    return arguments.length ? (paddingInner = Math.min(1, _), rescale()) : paddingInner;\n  };\n\n  scale.paddingOuter = function(_) {\n    return arguments.length ? (paddingOuter = +_, rescale()) : paddingOuter;\n  };\n\n  scale.align = function(_) {\n    return arguments.length ? (align = Math.max(0, Math.min(1, _)), rescale()) : align;\n  };\n\n  scale.copy = function() {\n    return band(domain(), [r0, r1])\n        .round(round)\n        .paddingInner(paddingInner)\n        .paddingOuter(paddingOuter)\n        .align(align);\n  };\n\n  return initRange.apply(rescale(), arguments);\n}\n\nfunction pointish(scale) {\n  var copy = scale.copy;\n\n  scale.padding = scale.paddingOuter;\n  delete scale.paddingInner;\n  delete scale.paddingOuter;\n\n  scale.copy = function() {\n    return pointish(copy());\n  };\n\n  return scale;\n}\n\nexport function point() {\n  return pointish(band.apply(null, arguments).paddingInner(1));\n}\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","import {bisect} from \"d3-array\";\nimport {interpolate as interpolateValue, interpolateNumber, interpolateRound} from \"d3-interpolate\";\nimport constant from \"./constant.js\";\nimport number from \"./number.js\";\n\nvar unit = [0, 1];\n\nexport function identity(x) {\n  return x;\n}\n\nfunction normalize(a, b) {\n  return (b -= (a = +a))\n      ? function(x) { return (x - a) / b; }\n      : constant(isNaN(b) ? NaN : 0.5);\n}\n\nfunction clamper(a, b) {\n  var t;\n  if (a > b) t = a, a = b, b = t;\n  return function(x) { return Math.max(a, Math.min(b, x)); };\n}\n\n// normalize(a, b)(x) takes a domain value x in [a,b] and returns the corresponding parameter t in [0,1].\n// interpolate(a, b)(t) takes a parameter t in [0,1] and returns the corresponding range value x in [a,b].\nfunction bimap(domain, range, interpolate) {\n  var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n  if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n  else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n  return function(x) { return r0(d0(x)); };\n}\n\nfunction polymap(domain, range, interpolate) {\n  var j = Math.min(domain.length, range.length) - 1,\n      d = new Array(j),\n      r = new Array(j),\n      i = -1;\n\n  // Reverse descending domains.\n  if (domain[j] < domain[0]) {\n    domain = domain.slice().reverse();\n    range = range.slice().reverse();\n  }\n\n  while (++i < j) {\n    d[i] = normalize(domain[i], domain[i + 1]);\n    r[i] = interpolate(range[i], range[i + 1]);\n  }\n\n  return function(x) {\n    var i = bisect(domain, x, 1, j) - 1;\n    return r[i](d[i](x));\n  };\n}\n\nexport function copy(source, target) {\n  return target\n      .domain(source.domain())\n      .range(source.range())\n      .interpolate(source.interpolate())\n      .clamp(source.clamp())\n      .unknown(source.unknown());\n}\n\nexport function transformer() {\n  var domain = unit,\n      range = unit,\n      interpolate = interpolateValue,\n      transform,\n      untransform,\n      unknown,\n      clamp = identity,\n      piecewise,\n      output,\n      input;\n\n  function rescale() {\n    var n = Math.min(domain.length, range.length);\n    if (clamp !== identity) clamp = clamper(domain[0], domain[n - 1]);\n    piecewise = n > 2 ? polymap : bimap;\n    output = input = null;\n    return scale;\n  }\n\n  function scale(x) {\n    return isNaN(x = +x) ? unknown : (output || (output = piecewise(domain.map(transform), range, interpolate)))(transform(clamp(x)));\n  }\n\n  scale.invert = function(y) {\n    return clamp(untransform((input || (input = piecewise(range, domain.map(transform), interpolateNumber)))(y)));\n  };\n\n  scale.domain = function(_) {\n    return arguments.length ? (domain = Array.from(_, number), rescale()) : domain.slice();\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (range = Array.from(_), rescale()) : range.slice();\n  };\n\n  scale.rangeRound = function(_) {\n    return range = Array.from(_), interpolate = interpolateRound, rescale();\n  };\n\n  scale.clamp = function(_) {\n    return arguments.length ? (clamp = _ ? true : identity, rescale()) : clamp !== identity;\n  };\n\n  scale.interpolate = function(_) {\n    return arguments.length ? (interpolate = _, rescale()) : interpolate;\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  return function(t, u) {\n    transform = t, untransform = u;\n    return rescale();\n  };\n}\n\nexport default function continuous() {\n  return transformer()(identity, identity);\n}\n","import {interpolate, interpolateRound, piecewise} from \"d3-interpolate\";\nimport {identity} from \"./continuous.js\";\nimport {initInterpolator} from \"./init.js\";\nimport {linearish} from \"./linear.js\";\nimport {loggish} from \"./log.js\";\nimport {copy} from \"./sequential.js\";\nimport {symlogish} from \"./symlog.js\";\nimport {powish} from \"./pow.js\";\n\nfunction transformer() {\n  var x0 = 0,\n      x1 = 0.5,\n      x2 = 1,\n      s = 1,\n      t0,\n      t1,\n      t2,\n      k10,\n      k21,\n      interpolator = identity,\n      transform,\n      clamp = false,\n      unknown;\n\n  function scale(x) {\n    return isNaN(x = +x) ? unknown : (x = 0.5 + ((x = +transform(x)) - t1) * (s * x < s * t1 ? k10 : k21), interpolator(clamp ? Math.max(0, Math.min(1, x)) : x));\n  }\n\n  scale.domain = function(_) {\n    return arguments.length ? ([x0, x1, x2] = _, t0 = transform(x0 = +x0), t1 = transform(x1 = +x1), t2 = transform(x2 = +x2), k10 = t0 === t1 ? 0 : 0.5 / (t1 - t0), k21 = t1 === t2 ? 0 : 0.5 / (t2 - t1), s = t1 < t0 ? -1 : 1, scale) : [x0, x1, x2];\n  };\n\n  scale.clamp = function(_) {\n    return arguments.length ? (clamp = !!_, scale) : clamp;\n  };\n\n  scale.interpolator = function(_) {\n    return arguments.length ? (interpolator = _, scale) : interpolator;\n  };\n\n  function range(interpolate) {\n    return function(_) {\n      var r0, r1, r2;\n      return arguments.length ? ([r0, r1, r2] = _, interpolator = piecewise(interpolate, [r0, r1, r2]), scale) : [interpolator(0), interpolator(0.5), interpolator(1)];\n    };\n  }\n\n  scale.range = range(interpolate);\n\n  scale.rangeRound = range(interpolateRound);\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  return function(t) {\n    transform = t, t0 = t(x0), t1 = t(x1), t2 = t(x2), k10 = t0 === t1 ? 0 : 0.5 / (t1 - t0), k21 = t1 === t2 ? 0 : 0.5 / (t2 - t1), s = t1 < t0 ? -1 : 1;\n    return scale;\n  };\n}\n\nexport default function diverging() {\n  var scale = linearish(transformer()(identity));\n\n  scale.copy = function() {\n    return copy(scale, diverging());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function divergingLog() {\n  var scale = loggish(transformer()).domain([0.1, 1, 10]);\n\n  scale.copy = function() {\n    return copy(scale, divergingLog()).base(scale.base());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function divergingSymlog() {\n  var scale = symlogish(transformer());\n\n  scale.copy = function() {\n    return copy(scale, divergingSymlog()).constant(scale.constant());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function divergingPow() {\n  var scale = powish(transformer());\n\n  scale.copy = function() {\n    return copy(scale, divergingPow()).exponent(scale.exponent());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function divergingSqrt() {\n  return divergingPow.apply(null, arguments).exponent(0.5);\n}\n","import {linearish} from \"./linear.js\";\nimport number from \"./number.js\";\n\nexport default function identity(domain) {\n  var unknown;\n\n  function scale(x) {\n    return isNaN(x = +x) ? unknown : x;\n  }\n\n  scale.invert = scale;\n\n  scale.domain = scale.range = function(_) {\n    return arguments.length ? (domain = Array.from(_, number), scale) : domain.slice();\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  scale.copy = function() {\n    return identity(domain).unknown(unknown);\n  };\n\n  domain = arguments.length ? Array.from(domain, number) : [0, 1];\n\n  return linearish(scale);\n}\n","export {\n  default as scaleBand,\n  point as scalePoint\n} from \"./band.js\";\n\nexport {\n  default as scaleIdentity\n} from \"./identity.js\";\n\nexport {\n  default as scaleLinear\n} from \"./linear.js\";\n\nexport {\n  default as scaleLog\n} from \"./log.js\";\n\nexport {\n  default as scaleSymlog\n} from \"./symlog.js\";\n\nexport {\n  default as scaleOrdinal,\n  implicit as scaleImplicit\n} from \"./ordinal.js\";\n\nexport {\n  default as scalePow,\n  sqrt as scaleSqrt\n} from \"./pow.js\";\n\nexport {\n  default as scaleRadial\n} from \"./radial.js\";\n\nexport {\n  default as scaleQuantile\n} from \"./quantile.js\";\n\nexport {\n  default as scaleQuantize\n} from \"./quantize.js\";\n\nexport {\n  default as scaleThreshold\n} from \"./threshold.js\";\n\nexport {\n  default as scaleTime\n} from \"./time.js\";\n\nexport {\n  default as scaleUtc\n} from \"./utcTime.js\";\n\nexport {\n  default as scaleSequential,\n  sequentialLog as scaleSequentialLog,\n  sequentialPow as scaleSequentialPow,\n  sequentialSqrt as scaleSequentialSqrt,\n  sequentialSymlog as scaleSequentialSymlog\n} from \"./sequential.js\";\n\nexport {\n  default as scaleSequentialQuantile\n} from \"./sequentialQuantile.js\";\n\nexport {\n  default as scaleDiverging,\n  divergingLog as scaleDivergingLog,\n  divergingPow as scaleDivergingPow,\n  divergingSqrt as scaleDivergingSqrt,\n  divergingSymlog as scaleDivergingSymlog\n} from \"./diverging.js\";\n\nexport {\n  default as tickFormat\n} from \"./tickFormat.js\";\n","export function initRange(domain, range) {\n  switch (arguments.length) {\n    case 0: break;\n    case 1: this.range(domain); break;\n    default: this.range(range).domain(domain); break;\n  }\n  return this;\n}\n\nexport function initInterpolator(domain, interpolator) {\n  switch (arguments.length) {\n    case 0: break;\n    case 1: {\n      if (typeof domain === \"function\") this.interpolator(domain);\n      else this.range(domain);\n      break;\n    }\n    default: {\n      this.domain(domain);\n      if (typeof interpolator === \"function\") this.interpolator(interpolator);\n      else this.range(interpolator);\n      break;\n    }\n  }\n  return this;\n}\n","import {ticks, tickIncrement} from \"d3-array\";\nimport continuous, {copy} from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\nimport tickFormat from \"./tickFormat.js\";\n\nexport function linearish(scale) {\n  var domain = scale.domain;\n\n  scale.ticks = function(count) {\n    var d = domain();\n    return ticks(d[0], d[d.length - 1], count == null ? 10 : count);\n  };\n\n  scale.tickFormat = function(count, specifier) {\n    var d = domain();\n    return tickFormat(d[0], d[d.length - 1], count == null ? 10 : count, specifier);\n  };\n\n  scale.nice = function(count) {\n    if (count == null) count = 10;\n\n    var d = domain(),\n        i0 = 0,\n        i1 = d.length - 1,\n        start = d[i0],\n        stop = d[i1],\n        step;\n\n    if (stop < start) {\n      step = start, start = stop, stop = step;\n      step = i0, i0 = i1, i1 = step;\n    }\n\n    step = tickIncrement(start, stop, count);\n\n    if (step > 0) {\n      start = Math.floor(start / step) * step;\n      stop = Math.ceil(stop / step) * step;\n      step = tickIncrement(start, stop, count);\n    } else if (step < 0) {\n      start = Math.ceil(start * step) / step;\n      stop = Math.floor(stop * step) / step;\n      step = tickIncrement(start, stop, count);\n    }\n\n    if (step > 0) {\n      d[i0] = Math.floor(start / step) * step;\n      d[i1] = Math.ceil(stop / step) * step;\n      domain(d);\n    } else if (step < 0) {\n      d[i0] = Math.ceil(start * step) / step;\n      d[i1] = Math.floor(stop * step) / step;\n      domain(d);\n    }\n\n    return scale;\n  };\n\n  return scale;\n}\n\nexport default function linear() {\n  var scale = continuous();\n\n  scale.copy = function() {\n    return copy(scale, linear());\n  };\n\n  initRange.apply(scale, arguments);\n\n  return linearish(scale);\n}\n","import {ticks} from \"d3-array\";\nimport {format} from \"d3-format\";\nimport nice from \"./nice.js\";\nimport {copy, transformer} from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\n\nfunction transformLog(x) {\n  return Math.log(x);\n}\n\nfunction transformExp(x) {\n  return Math.exp(x);\n}\n\nfunction transformLogn(x) {\n  return -Math.log(-x);\n}\n\nfunction transformExpn(x) {\n  return -Math.exp(-x);\n}\n\nfunction pow10(x) {\n  return isFinite(x) ? +(\"1e\" + x) : x < 0 ? 0 : x;\n}\n\nfunction powp(base) {\n  return base === 10 ? pow10\n      : base === Math.E ? Math.exp\n      : function(x) { return Math.pow(base, x); };\n}\n\nfunction logp(base) {\n  return base === Math.E ? Math.log\n      : base === 10 && Math.log10\n      || base === 2 && Math.log2\n      || (base = Math.log(base), function(x) { return Math.log(x) / base; });\n}\n\nfunction reflect(f) {\n  return function(x) {\n    return -f(-x);\n  };\n}\n\nexport function loggish(transform) {\n  var scale = transform(transformLog, transformExp),\n      domain = scale.domain,\n      base = 10,\n      logs,\n      pows;\n\n  function rescale() {\n    logs = logp(base), pows = powp(base);\n    if (domain()[0] < 0) {\n      logs = reflect(logs), pows = reflect(pows);\n      transform(transformLogn, transformExpn);\n    } else {\n      transform(transformLog, transformExp);\n    }\n    return scale;\n  }\n\n  scale.base = function(_) {\n    return arguments.length ? (base = +_, rescale()) : base;\n  };\n\n  scale.domain = function(_) {\n    return arguments.length ? (domain(_), rescale()) : domain();\n  };\n\n  scale.ticks = function(count) {\n    var d = domain(),\n        u = d[0],\n        v = d[d.length - 1],\n        r;\n\n    if (r = v < u) i = u, u = v, v = i;\n\n    var i = logs(u),\n        j = logs(v),\n        p,\n        k,\n        t,\n        n = count == null ? 10 : +count,\n        z = [];\n\n    if (!(base % 1) && j - i < n) {\n      i = Math.floor(i), j = Math.ceil(j);\n      if (u > 0) for (; i <= j; ++i) {\n        for (k = 1, p = pows(i); k < base; ++k) {\n          t = p * k;\n          if (t < u) continue;\n          if (t > v) break;\n          z.push(t);\n        }\n      } else for (; i <= j; ++i) {\n        for (k = base - 1, p = pows(i); k >= 1; --k) {\n          t = p * k;\n          if (t < u) continue;\n          if (t > v) break;\n          z.push(t);\n        }\n      }\n      if (z.length * 2 < n) z = ticks(u, v, n);\n    } else {\n      z = ticks(i, j, Math.min(j - i, n)).map(pows);\n    }\n\n    return r ? z.reverse() : z;\n  };\n\n  scale.tickFormat = function(count, specifier) {\n    if (specifier == null) specifier = base === 10 ? \".0e\" : \",\";\n    if (typeof specifier !== \"function\") specifier = format(specifier);\n    if (count === Infinity) return specifier;\n    if (count == null) count = 10;\n    var k = Math.max(1, base * count / scale.ticks().length); // TODO fast estimate?\n    return function(d) {\n      var i = d / pows(Math.round(logs(d)));\n      if (i * base < base - 0.5) i *= base;\n      return i <= k ? specifier(d) : \"\";\n    };\n  };\n\n  scale.nice = function() {\n    return domain(nice(domain(), {\n      floor: function(x) { return pows(Math.floor(logs(x))); },\n      ceil: function(x) { return pows(Math.ceil(logs(x))); }\n    }));\n  };\n\n  return scale;\n}\n\nexport default function log() {\n  var scale = loggish(transformer()).domain([1, 10]);\n\n  scale.copy = function() {\n    return copy(scale, log()).base(scale.base());\n  };\n\n  initRange.apply(scale, arguments);\n\n  return scale;\n}\n","export default function(domain, interval) {\n  domain = domain.slice();\n\n  var i0 = 0,\n      i1 = domain.length - 1,\n      x0 = domain[i0],\n      x1 = domain[i1],\n      t;\n\n  if (x1 < x0) {\n    t = i0, i0 = i1, i1 = t;\n    t = x0, x0 = x1, x1 = t;\n  }\n\n  domain[i0] = interval.floor(x0);\n  domain[i1] = interval.ceil(x1);\n  return domain;\n}\n","export default function(x) {\n  return +x;\n}\n","import {initRange} from \"./init.js\";\n\nexport const implicit = Symbol(\"implicit\");\n\nexport default function ordinal() {\n  var index = new Map(),\n      domain = [],\n      range = [],\n      unknown = implicit;\n\n  function scale(d) {\n    var key = d + \"\", i = index.get(key);\n    if (!i) {\n      if (unknown !== implicit) return unknown;\n      index.set(key, i = domain.push(d));\n    }\n    return range[(i - 1) % range.length];\n  }\n\n  scale.domain = function(_) {\n    if (!arguments.length) return domain.slice();\n    domain = [], index = new Map();\n    for (const value of _) {\n      const key = value + \"\";\n      if (index.has(key)) continue;\n      index.set(key, domain.push(value));\n    }\n    return scale;\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (range = Array.from(_), scale) : range.slice();\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  scale.copy = function() {\n    return ordinal(domain, range).unknown(unknown);\n  };\n\n  initRange.apply(scale, arguments);\n\n  return scale;\n}\n","import {linearish} from \"./linear.js\";\nimport {copy, identity, transformer} from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\n\nfunction transformPow(exponent) {\n  return function(x) {\n    return x < 0 ? -Math.pow(-x, exponent) : Math.pow(x, exponent);\n  };\n}\n\nfunction transformSqrt(x) {\n  return x < 0 ? -Math.sqrt(-x) : Math.sqrt(x);\n}\n\nfunction transformSquare(x) {\n  return x < 0 ? -x * x : x * x;\n}\n\nexport function powish(transform) {\n  var scale = transform(identity, identity),\n      exponent = 1;\n\n  function rescale() {\n    return exponent === 1 ? transform(identity, identity)\n        : exponent === 0.5 ? transform(transformSqrt, transformSquare)\n        : transform(transformPow(exponent), transformPow(1 / exponent));\n  }\n\n  scale.exponent = function(_) {\n    return arguments.length ? (exponent = +_, rescale()) : exponent;\n  };\n\n  return linearish(scale);\n}\n\nexport default function pow() {\n  var scale = powish(transformer());\n\n  scale.copy = function() {\n    return copy(scale, pow()).exponent(scale.exponent());\n  };\n\n  initRange.apply(scale, arguments);\n\n  return scale;\n}\n\nexport function sqrt() {\n  return pow.apply(null, arguments).exponent(0.5);\n}\n","import {ascending, bisect, quantile as threshold} from \"d3-array\";\nimport {initRange} from \"./init.js\";\n\nexport default function quantile() {\n  var domain = [],\n      range = [],\n      thresholds = [],\n      unknown;\n\n  function rescale() {\n    var i = 0, n = Math.max(1, range.length);\n    thresholds = new Array(n - 1);\n    while (++i < n) thresholds[i - 1] = threshold(domain, i / n);\n    return scale;\n  }\n\n  function scale(x) {\n    return isNaN(x = +x) ? unknown : range[bisect(thresholds, x)];\n  }\n\n  scale.invertExtent = function(y) {\n    var i = range.indexOf(y);\n    return i < 0 ? [NaN, NaN] : [\n      i > 0 ? thresholds[i - 1] : domain[0],\n      i < thresholds.length ? thresholds[i] : domain[domain.length - 1]\n    ];\n  };\n\n  scale.domain = function(_) {\n    if (!arguments.length) return domain.slice();\n    domain = [];\n    for (let d of _) if (d != null && !isNaN(d = +d)) domain.push(d);\n    domain.sort(ascending);\n    return rescale();\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (range = Array.from(_), rescale()) : range.slice();\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  scale.quantiles = function() {\n    return thresholds.slice();\n  };\n\n  scale.copy = function() {\n    return quantile()\n        .domain(domain)\n        .range(range)\n        .unknown(unknown);\n  };\n\n  return initRange.apply(scale, arguments);\n}\n","import {bisect} from \"d3-array\";\nimport {linearish} from \"./linear.js\";\nimport {initRange} from \"./init.js\";\n\nexport default function quantize() {\n  var x0 = 0,\n      x1 = 1,\n      n = 1,\n      domain = [0.5],\n      range = [0, 1],\n      unknown;\n\n  function scale(x) {\n    return x <= x ? range[bisect(domain, x, 0, n)] : unknown;\n  }\n\n  function rescale() {\n    var i = -1;\n    domain = new Array(n);\n    while (++i < n) domain[i] = ((i + 1) * x1 - (i - n) * x0) / (n + 1);\n    return scale;\n  }\n\n  scale.domain = function(_) {\n    return arguments.length ? ([x0, x1] = _, x0 = +x0, x1 = +x1, rescale()) : [x0, x1];\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (n = (range = Array.from(_)).length - 1, rescale()) : range.slice();\n  };\n\n  scale.invertExtent = function(y) {\n    var i = range.indexOf(y);\n    return i < 0 ? [NaN, NaN]\n        : i < 1 ? [x0, domain[0]]\n        : i >= n ? [domain[n - 1], x1]\n        : [domain[i - 1], domain[i]];\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : scale;\n  };\n\n  scale.thresholds = function() {\n    return domain.slice();\n  };\n\n  scale.copy = function() {\n    return quantize()\n        .domain([x0, x1])\n        .range(range)\n        .unknown(unknown);\n  };\n\n  return initRange.apply(linearish(scale), arguments);\n}\n","import continuous from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\nimport {linearish} from \"./linear.js\";\nimport number from \"./number.js\";\n\nfunction square(x) {\n  return Math.sign(x) * x * x;\n}\n\nfunction unsquare(x) {\n  return Math.sign(x) * Math.sqrt(Math.abs(x));\n}\n\nexport default function radial() {\n  var squared = continuous(),\n      range = [0, 1],\n      round = false,\n      unknown;\n\n  function scale(x) {\n    var y = unsquare(squared(x));\n    return isNaN(y) ? unknown : round ? Math.round(y) : y;\n  }\n\n  scale.invert = function(y) {\n    return squared.invert(square(y));\n  };\n\n  scale.domain = function(_) {\n    return arguments.length ? (squared.domain(_), scale) : squared.domain();\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (squared.range((range = Array.from(_, number)).map(square)), scale) : range.slice();\n  };\n\n  scale.rangeRound = function(_) {\n    return scale.range(_).round(true);\n  };\n\n  scale.round = function(_) {\n    return arguments.length ? (round = !!_, scale) : round;\n  };\n\n  scale.clamp = function(_) {\n    return arguments.length ? (squared.clamp(_), scale) : squared.clamp();\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  scale.copy = function() {\n    return radial(squared.domain(), range)\n        .round(round)\n        .clamp(squared.clamp())\n        .unknown(unknown);\n  };\n\n  initRange.apply(scale, arguments);\n\n  return linearish(scale);\n}\n","import {interpolate, interpolateRound} from \"d3-interpolate\";\nimport {identity} from \"./continuous.js\";\nimport {initInterpolator} from \"./init.js\";\nimport {linearish} from \"./linear.js\";\nimport {loggish} from \"./log.js\";\nimport {symlogish} from \"./symlog.js\";\nimport {powish} from \"./pow.js\";\n\nfunction transformer() {\n  var x0 = 0,\n      x1 = 1,\n      t0,\n      t1,\n      k10,\n      transform,\n      interpolator = identity,\n      clamp = false,\n      unknown;\n\n  function scale(x) {\n    return isNaN(x = +x) ? unknown : interpolator(k10 === 0 ? 0.5 : (x = (transform(x) - t0) * k10, clamp ? Math.max(0, Math.min(1, x)) : x));\n  }\n\n  scale.domain = function(_) {\n    return arguments.length ? ([x0, x1] = _, t0 = transform(x0 = +x0), t1 = transform(x1 = +x1), k10 = t0 === t1 ? 0 : 1 / (t1 - t0), scale) : [x0, x1];\n  };\n\n  scale.clamp = function(_) {\n    return arguments.length ? (clamp = !!_, scale) : clamp;\n  };\n\n  scale.interpolator = function(_) {\n    return arguments.length ? (interpolator = _, scale) : interpolator;\n  };\n\n  function range(interpolate) {\n    return function(_) {\n      var r0, r1;\n      return arguments.length ? ([r0, r1] = _, interpolator = interpolate(r0, r1), scale) : [interpolator(0), interpolator(1)];\n    };\n  }\n\n  scale.range = range(interpolate);\n\n  scale.rangeRound = range(interpolateRound);\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  return function(t) {\n    transform = t, t0 = t(x0), t1 = t(x1), k10 = t0 === t1 ? 0 : 1 / (t1 - t0);\n    return scale;\n  };\n}\n\nexport function copy(source, target) {\n  return target\n      .domain(source.domain())\n      .interpolator(source.interpolator())\n      .clamp(source.clamp())\n      .unknown(source.unknown());\n}\n\nexport default function sequential() {\n  var scale = linearish(transformer()(identity));\n\n  scale.copy = function() {\n    return copy(scale, sequential());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function sequentialLog() {\n  var scale = loggish(transformer()).domain([1, 10]);\n\n  scale.copy = function() {\n    return copy(scale, sequentialLog()).base(scale.base());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function sequentialSymlog() {\n  var scale = symlogish(transformer());\n\n  scale.copy = function() {\n    return copy(scale, sequentialSymlog()).constant(scale.constant());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function sequentialPow() {\n  var scale = powish(transformer());\n\n  scale.copy = function() {\n    return copy(scale, sequentialPow()).exponent(scale.exponent());\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n\nexport function sequentialSqrt() {\n  return sequentialPow.apply(null, arguments).exponent(0.5);\n}\n","import {ascending, bisect, quantile} from \"d3-array\";\nimport {identity} from \"./continuous.js\";\nimport {initInterpolator} from \"./init.js\";\n\nexport default function sequentialQuantile() {\n  var domain = [],\n      interpolator = identity;\n\n  function scale(x) {\n    if (!isNaN(x = +x)) return interpolator((bisect(domain, x, 1) - 1) / (domain.length - 1));\n  }\n\n  scale.domain = function(_) {\n    if (!arguments.length) return domain.slice();\n    domain = [];\n    for (let d of _) if (d != null && !isNaN(d = +d)) domain.push(d);\n    domain.sort(ascending);\n    return scale;\n  };\n\n  scale.interpolator = function(_) {\n    return arguments.length ? (interpolator = _, scale) : interpolator;\n  };\n\n  scale.range = function() {\n    return domain.map((d, i) => interpolator(i / (domain.length - 1)));\n  };\n\n  scale.quantiles = function(n) {\n    return Array.from({length: n + 1}, (_, i) => quantile(domain, i / n));\n  };\n\n  scale.copy = function() {\n    return sequentialQuantile(interpolator).domain(domain);\n  };\n\n  return initInterpolator.apply(scale, arguments);\n}\n","import {linearish} from \"./linear.js\";\nimport {copy, transformer} from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\n\nfunction transformSymlog(c) {\n  return function(x) {\n    return Math.sign(x) * Math.log1p(Math.abs(x / c));\n  };\n}\n\nfunction transformSymexp(c) {\n  return function(x) {\n    return Math.sign(x) * Math.expm1(Math.abs(x)) * c;\n  };\n}\n\nexport function symlogish(transform) {\n  var c = 1, scale = transform(transformSymlog(c), transformSymexp(c));\n\n  scale.constant = function(_) {\n    return arguments.length ? transform(transformSymlog(c = +_), transformSymexp(c)) : c;\n  };\n\n  return linearish(scale);\n}\n\nexport default function symlog() {\n  var scale = symlogish(transformer());\n\n  scale.copy = function() {\n    return copy(scale, symlog()).constant(scale.constant());\n  };\n\n  return initRange.apply(scale, arguments);\n}\n","import {bisect} from \"d3-array\";\nimport {initRange} from \"./init.js\";\n\nexport default function threshold() {\n  var domain = [0.5],\n      range = [0, 1],\n      unknown,\n      n = 1;\n\n  function scale(x) {\n    return x <= x ? range[bisect(domain, x, 0, n)] : unknown;\n  }\n\n  scale.domain = function(_) {\n    return arguments.length ? (domain = Array.from(_), n = Math.min(domain.length, range.length - 1), scale) : domain.slice();\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (range = Array.from(_), n = Math.min(domain.length, range.length - 1), scale) : range.slice();\n  };\n\n  scale.invertExtent = function(y) {\n    var i = range.indexOf(y);\n    return [domain[i - 1], domain[i]];\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  scale.copy = function() {\n    return threshold()\n        .domain(domain)\n        .range(range)\n        .unknown(unknown);\n  };\n\n  return initRange.apply(scale, arguments);\n}\n","import {tickStep} from \"d3-array\";\nimport {format, formatPrefix, formatSpecifier, precisionFixed, precisionPrefix, precisionRound} from \"d3-format\";\n\nexport default function(start, stop, count, specifier) {\n  var step = tickStep(start, stop, count),\n      precision;\n  specifier = formatSpecifier(specifier == null ? \",f\" : specifier);\n  switch (specifier.type) {\n    case \"s\": {\n      var value = Math.max(Math.abs(start), Math.abs(stop));\n      if (specifier.precision == null && !isNaN(precision = precisionPrefix(step, value))) specifier.precision = precision;\n      return formatPrefix(specifier, value);\n    }\n    case \"\":\n    case \"e\":\n    case \"g\":\n    case \"p\":\n    case \"r\": {\n      if (specifier.precision == null && !isNaN(precision = precisionRound(step, Math.max(Math.abs(start), Math.abs(stop))))) specifier.precision = precision - (specifier.type === \"e\");\n      break;\n    }\n    case \"f\":\n    case \"%\": {\n      if (specifier.precision == null && !isNaN(precision = precisionFixed(step))) specifier.precision = precision - (specifier.type === \"%\") * 2;\n      break;\n    }\n  }\n  return format(specifier);\n}\n","import {bisector, tickStep} from \"d3-array\";\nimport {timeYear, timeMonth, timeWeek, timeDay, timeHour, timeMinute, timeSecond, timeMillisecond} from \"d3-time\";\nimport {timeFormat} from \"d3-time-format\";\nimport continuous, {copy} from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\nimport nice from \"./nice.js\";\n\nvar durationSecond = 1000,\n    durationMinute = durationSecond * 60,\n    durationHour = durationMinute * 60,\n    durationDay = durationHour * 24,\n    durationWeek = durationDay * 7,\n    durationMonth = durationDay * 30,\n    durationYear = durationDay * 365;\n\nfunction date(t) {\n  return new Date(t);\n}\n\nfunction number(t) {\n  return t instanceof Date ? +t : +new Date(+t);\n}\n\nexport function calendar(year, month, week, day, hour, minute, second, millisecond, format) {\n  var scale = continuous(),\n      invert = scale.invert,\n      domain = scale.domain;\n\n  var formatMillisecond = format(\".%L\"),\n      formatSecond = format(\":%S\"),\n      formatMinute = format(\"%I:%M\"),\n      formatHour = format(\"%I %p\"),\n      formatDay = format(\"%a %d\"),\n      formatWeek = format(\"%b %d\"),\n      formatMonth = format(\"%B\"),\n      formatYear = format(\"%Y\");\n\n  var tickIntervals = [\n    [second,  1,      durationSecond],\n    [second,  5,  5 * durationSecond],\n    [second, 15, 15 * durationSecond],\n    [second, 30, 30 * durationSecond],\n    [minute,  1,      durationMinute],\n    [minute,  5,  5 * durationMinute],\n    [minute, 15, 15 * durationMinute],\n    [minute, 30, 30 * durationMinute],\n    [  hour,  1,      durationHour  ],\n    [  hour,  3,  3 * durationHour  ],\n    [  hour,  6,  6 * durationHour  ],\n    [  hour, 12, 12 * durationHour  ],\n    [   day,  1,      durationDay   ],\n    [   day,  2,  2 * durationDay   ],\n    [  week,  1,      durationWeek  ],\n    [ month,  1,      durationMonth ],\n    [ month,  3,  3 * durationMonth ],\n    [  year,  1,      durationYear  ]\n  ];\n\n  function tickFormat(date) {\n    return (second(date) < date ? formatMillisecond\n        : minute(date) < date ? formatSecond\n        : hour(date) < date ? formatMinute\n        : day(date) < date ? formatHour\n        : month(date) < date ? (week(date) < date ? formatDay : formatWeek)\n        : year(date) < date ? formatMonth\n        : formatYear)(date);\n  }\n\n  function tickInterval(interval, start, stop) {\n    if (interval == null) interval = 10;\n\n    // If a desired tick count is specified, pick a reasonable tick interval\n    // based on the extent of the domain and a rough estimate of tick size.\n    // Otherwise, assume interval is already a time interval and use it.\n    if (typeof interval === \"number\") {\n      var target = Math.abs(stop - start) / interval,\n          i = bisector(function(i) { return i[2]; }).right(tickIntervals, target),\n          step;\n      if (i === tickIntervals.length) {\n        step = tickStep(start / durationYear, stop / durationYear, interval);\n        interval = year;\n      } else if (i) {\n        i = tickIntervals[target / tickIntervals[i - 1][2] < tickIntervals[i][2] / target ? i - 1 : i];\n        step = i[1];\n        interval = i[0];\n      } else {\n        step = Math.max(tickStep(start, stop, interval), 1);\n        interval = millisecond;\n      }\n      return interval.every(step);\n    }\n\n    return interval;\n  }\n\n  scale.invert = function(y) {\n    return new Date(invert(y));\n  };\n\n  scale.domain = function(_) {\n    return arguments.length ? domain(Array.from(_, number)) : domain().map(date);\n  };\n\n  scale.ticks = function(interval) {\n    var d = domain(),\n        t0 = d[0],\n        t1 = d[d.length - 1],\n        r = t1 < t0,\n        t;\n    if (r) t = t0, t0 = t1, t1 = t;\n    t = tickInterval(interval, t0, t1);\n    t = t ? t.range(t0, t1 + 1) : []; // inclusive stop\n    return r ? t.reverse() : t;\n  };\n\n  scale.tickFormat = function(count, specifier) {\n    return specifier == null ? tickFormat : format(specifier);\n  };\n\n  scale.nice = function(interval) {\n    var d = domain();\n    return (interval = tickInterval(interval, d[0], d[d.length - 1]))\n        ? domain(nice(d, interval))\n        : scale;\n  };\n\n  scale.copy = function() {\n    return copy(scale, calendar(year, month, week, day, hour, minute, second, millisecond, format));\n  };\n\n  return scale;\n}\n\nexport default function() {\n  return initRange.apply(calendar(timeYear, timeMonth, timeWeek, timeDay, timeHour, timeMinute, timeSecond, timeMillisecond, timeFormat).domain([new Date(2000, 0, 1), new Date(2000, 0, 2)]), arguments);\n}\n","import {calendar} from \"./time.js\";\nimport {utcFormat} from \"d3-time-format\";\nimport {utcYear, utcMonth, utcWeek, utcDay, utcHour, utcMinute, utcSecond, utcMillisecond} from \"d3-time\";\nimport {initRange} from \"./init.js\";\n\nexport default function() {\n  return initRange.apply(calendar(utcYear, utcMonth, utcWeek, utcDay, utcHour, utcMinute, utcSecond, utcMillisecond, utcFormat).domain([Date.UTC(2000, 0, 1), Date.UTC(2000, 0, 2)]), arguments);\n}\n","import {path} from \"d3-path\";\nimport constant from \"./constant.js\";\nimport {abs, acos, asin, atan2, cos, epsilon, halfPi, max, min, pi, sin, sqrt, tau} from \"./math.js\";\n\nfunction arcInnerRadius(d) {\n  return d.innerRadius;\n}\n\nfunction arcOuterRadius(d) {\n  return d.outerRadius;\n}\n\nfunction arcStartAngle(d) {\n  return d.startAngle;\n}\n\nfunction arcEndAngle(d) {\n  return d.endAngle;\n}\n\nfunction arcPadAngle(d) {\n  return d && d.padAngle; // Note: optional!\n}\n\nfunction intersect(x0, y0, x1, y1, x2, y2, x3, y3) {\n  var x10 = x1 - x0, y10 = y1 - y0,\n      x32 = x3 - x2, y32 = y3 - y2,\n      t = y32 * x10 - x32 * y10;\n  if (t * t < epsilon) return;\n  t = (x32 * (y0 - y2) - y32 * (x0 - x2)) / t;\n  return [x0 + t * x10, y0 + t * y10];\n}\n\n// Compute perpendicular offset line of length rc.\n// http://mathworld.wolfram.com/Circle-LineIntersection.html\nfunction cornerTangents(x0, y0, x1, y1, r1, rc, cw) {\n  var x01 = x0 - x1,\n      y01 = y0 - y1,\n      lo = (cw ? rc : -rc) / sqrt(x01 * x01 + y01 * y01),\n      ox = lo * y01,\n      oy = -lo * x01,\n      x11 = x0 + ox,\n      y11 = y0 + oy,\n      x10 = x1 + ox,\n      y10 = y1 + oy,\n      x00 = (x11 + x10) / 2,\n      y00 = (y11 + y10) / 2,\n      dx = x10 - x11,\n      dy = y10 - y11,\n      d2 = dx * dx + dy * dy,\n      r = r1 - rc,\n      D = x11 * y10 - x10 * y11,\n      d = (dy < 0 ? -1 : 1) * sqrt(max(0, r * r * d2 - D * D)),\n      cx0 = (D * dy - dx * d) / d2,\n      cy0 = (-D * dx - dy * d) / d2,\n      cx1 = (D * dy + dx * d) / d2,\n      cy1 = (-D * dx + dy * d) / d2,\n      dx0 = cx0 - x00,\n      dy0 = cy0 - y00,\n      dx1 = cx1 - x00,\n      dy1 = cy1 - y00;\n\n  // Pick the closer of the two intersection points.\n  // TODO Is there a faster way to determine which intersection to use?\n  if (dx0 * dx0 + dy0 * dy0 > dx1 * dx1 + dy1 * dy1) cx0 = cx1, cy0 = cy1;\n\n  return {\n    cx: cx0,\n    cy: cy0,\n    x01: -ox,\n    y01: -oy,\n    x11: cx0 * (r1 / r - 1),\n    y11: cy0 * (r1 / r - 1)\n  };\n}\n\nexport default function() {\n  var innerRadius = arcInnerRadius,\n      outerRadius = arcOuterRadius,\n      cornerRadius = constant(0),\n      padRadius = null,\n      startAngle = arcStartAngle,\n      endAngle = arcEndAngle,\n      padAngle = arcPadAngle,\n      context = null;\n\n  function arc() {\n    var buffer,\n        r,\n        r0 = +innerRadius.apply(this, arguments),\n        r1 = +outerRadius.apply(this, arguments),\n        a0 = startAngle.apply(this, arguments) - halfPi,\n        a1 = endAngle.apply(this, arguments) - halfPi,\n        da = abs(a1 - a0),\n        cw = a1 > a0;\n\n    if (!context) context = buffer = path();\n\n    // Ensure that the outer radius is always larger than the inner radius.\n    if (r1 < r0) r = r1, r1 = r0, r0 = r;\n\n    // Is it a point?\n    if (!(r1 > epsilon)) context.moveTo(0, 0);\n\n    // Or is it a circle or annulus?\n    else if (da > tau - epsilon) {\n      context.moveTo(r1 * cos(a0), r1 * sin(a0));\n      context.arc(0, 0, r1, a0, a1, !cw);\n      if (r0 > epsilon) {\n        context.moveTo(r0 * cos(a1), r0 * sin(a1));\n        context.arc(0, 0, r0, a1, a0, cw);\n      }\n    }\n\n    // Or is it a circular or annular sector?\n    else {\n      var a01 = a0,\n          a11 = a1,\n          a00 = a0,\n          a10 = a1,\n          da0 = da,\n          da1 = da,\n          ap = padAngle.apply(this, arguments) / 2,\n          rp = (ap > epsilon) && (padRadius ? +padRadius.apply(this, arguments) : sqrt(r0 * r0 + r1 * r1)),\n          rc = min(abs(r1 - r0) / 2, +cornerRadius.apply(this, arguments)),\n          rc0 = rc,\n          rc1 = rc,\n          t0,\n          t1;\n\n      // Apply padding? Note that since r1 ≥ r0, da1 ≥ da0.\n      if (rp > epsilon) {\n        var p0 = asin(rp / r0 * sin(ap)),\n            p1 = asin(rp / r1 * sin(ap));\n        if ((da0 -= p0 * 2) > epsilon) p0 *= (cw ? 1 : -1), a00 += p0, a10 -= p0;\n        else da0 = 0, a00 = a10 = (a0 + a1) / 2;\n        if ((da1 -= p1 * 2) > epsilon) p1 *= (cw ? 1 : -1), a01 += p1, a11 -= p1;\n        else da1 = 0, a01 = a11 = (a0 + a1) / 2;\n      }\n\n      var x01 = r1 * cos(a01),\n          y01 = r1 * sin(a01),\n          x10 = r0 * cos(a10),\n          y10 = r0 * sin(a10);\n\n      // Apply rounded corners?\n      if (rc > epsilon) {\n        var x11 = r1 * cos(a11),\n            y11 = r1 * sin(a11),\n            x00 = r0 * cos(a00),\n            y00 = r0 * sin(a00),\n            oc;\n\n        // Restrict the corner radius according to the sector angle.\n        if (da < pi && (oc = intersect(x01, y01, x00, y00, x11, y11, x10, y10))) {\n          var ax = x01 - oc[0],\n              ay = y01 - oc[1],\n              bx = x11 - oc[0],\n              by = y11 - oc[1],\n              kc = 1 / sin(acos((ax * bx + ay * by) / (sqrt(ax * ax + ay * ay) * sqrt(bx * bx + by * by))) / 2),\n              lc = sqrt(oc[0] * oc[0] + oc[1] * oc[1]);\n          rc0 = min(rc, (r0 - lc) / (kc - 1));\n          rc1 = min(rc, (r1 - lc) / (kc + 1));\n        }\n      }\n\n      // Is the sector collapsed to a line?\n      if (!(da1 > epsilon)) context.moveTo(x01, y01);\n\n      // Does the sector’s outer ring have rounded corners?\n      else if (rc1 > epsilon) {\n        t0 = cornerTangents(x00, y00, x01, y01, r1, rc1, cw);\n        t1 = cornerTangents(x11, y11, x10, y10, r1, rc1, cw);\n\n        context.moveTo(t0.cx + t0.x01, t0.cy + t0.y01);\n\n        // Have the corners merged?\n        if (rc1 < rc) context.arc(t0.cx, t0.cy, rc1, atan2(t0.y01, t0.x01), atan2(t1.y01, t1.x01), !cw);\n\n        // Otherwise, draw the two corners and the ring.\n        else {\n          context.arc(t0.cx, t0.cy, rc1, atan2(t0.y01, t0.x01), atan2(t0.y11, t0.x11), !cw);\n          context.arc(0, 0, r1, atan2(t0.cy + t0.y11, t0.cx + t0.x11), atan2(t1.cy + t1.y11, t1.cx + t1.x11), !cw);\n          context.arc(t1.cx, t1.cy, rc1, atan2(t1.y11, t1.x11), atan2(t1.y01, t1.x01), !cw);\n        }\n      }\n\n      // Or is the outer ring just a circular arc?\n      else context.moveTo(x01, y01), context.arc(0, 0, r1, a01, a11, !cw);\n\n      // Is there no inner ring, and it’s a circular sector?\n      // Or perhaps it’s an annular sector collapsed due to padding?\n      if (!(r0 > epsilon) || !(da0 > epsilon)) context.lineTo(x10, y10);\n\n      // Does the sector’s inner ring (or point) have rounded corners?\n      else if (rc0 > epsilon) {\n        t0 = cornerTangents(x10, y10, x11, y11, r0, -rc0, cw);\n        t1 = cornerTangents(x01, y01, x00, y00, r0, -rc0, cw);\n\n        context.lineTo(t0.cx + t0.x01, t0.cy + t0.y01);\n\n        // Have the corners merged?\n        if (rc0 < rc) context.arc(t0.cx, t0.cy, rc0, atan2(t0.y01, t0.x01), atan2(t1.y01, t1.x01), !cw);\n\n        // Otherwise, draw the two corners and the ring.\n        else {\n          context.arc(t0.cx, t0.cy, rc0, atan2(t0.y01, t0.x01), atan2(t0.y11, t0.x11), !cw);\n          context.arc(0, 0, r0, atan2(t0.cy + t0.y11, t0.cx + t0.x11), atan2(t1.cy + t1.y11, t1.cx + t1.x11), cw);\n          context.arc(t1.cx, t1.cy, rc0, atan2(t1.y11, t1.x11), atan2(t1.y01, t1.x01), !cw);\n        }\n      }\n\n      // Or is the inner ring just a circular arc?\n      else context.arc(0, 0, r0, a10, a00, cw);\n    }\n\n    context.closePath();\n\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  arc.centroid = function() {\n    var r = (+innerRadius.apply(this, arguments) + +outerRadius.apply(this, arguments)) / 2,\n        a = (+startAngle.apply(this, arguments) + +endAngle.apply(this, arguments)) / 2 - pi / 2;\n    return [cos(a) * r, sin(a) * r];\n  };\n\n  arc.innerRadius = function(_) {\n    return arguments.length ? (innerRadius = typeof _ === \"function\" ? _ : constant(+_), arc) : innerRadius;\n  };\n\n  arc.outerRadius = function(_) {\n    return arguments.length ? (outerRadius = typeof _ === \"function\" ? _ : constant(+_), arc) : outerRadius;\n  };\n\n  arc.cornerRadius = function(_) {\n    return arguments.length ? (cornerRadius = typeof _ === \"function\" ? _ : constant(+_), arc) : cornerRadius;\n  };\n\n  arc.padRadius = function(_) {\n    return arguments.length ? (padRadius = _ == null ? null : typeof _ === \"function\" ? _ : constant(+_), arc) : padRadius;\n  };\n\n  arc.startAngle = function(_) {\n    return arguments.length ? (startAngle = typeof _ === \"function\" ? _ : constant(+_), arc) : startAngle;\n  };\n\n  arc.endAngle = function(_) {\n    return arguments.length ? (endAngle = typeof _ === \"function\" ? _ : constant(+_), arc) : endAngle;\n  };\n\n  arc.padAngle = function(_) {\n    return arguments.length ? (padAngle = typeof _ === \"function\" ? _ : constant(+_), arc) : padAngle;\n  };\n\n  arc.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), arc) : context;\n  };\n\n  return arc;\n}\n","import {path} from \"d3-path\";\nimport constant from \"./constant.js\";\nimport curveLinear from \"./curve/linear.js\";\nimport line from \"./line.js\";\nimport {x as pointX, y as pointY} from \"./point.js\";\n\nexport default function() {\n  var x0 = pointX,\n      x1 = null,\n      y0 = constant(0),\n      y1 = pointY,\n      defined = constant(true),\n      context = null,\n      curve = curveLinear,\n      output = null;\n\n  function area(data) {\n    var i,\n        j,\n        k,\n        n = data.length,\n        d,\n        defined0 = false,\n        buffer,\n        x0z = new Array(n),\n        y0z = new Array(n);\n\n    if (context == null) output = curve(buffer = path());\n\n    for (i = 0; i <= n; ++i) {\n      if (!(i < n && defined(d = data[i], i, data)) === defined0) {\n        if (defined0 = !defined0) {\n          j = i;\n          output.areaStart();\n          output.lineStart();\n        } else {\n          output.lineEnd();\n          output.lineStart();\n          for (k = i - 1; k >= j; --k) {\n            output.point(x0z[k], y0z[k]);\n          }\n          output.lineEnd();\n          output.areaEnd();\n        }\n      }\n      if (defined0) {\n        x0z[i] = +x0(d, i, data), y0z[i] = +y0(d, i, data);\n        output.point(x1 ? +x1(d, i, data) : x0z[i], y1 ? +y1(d, i, data) : y0z[i]);\n      }\n    }\n\n    if (buffer) return output = null, buffer + \"\" || null;\n  }\n\n  function arealine() {\n    return line().defined(defined).curve(curve).context(context);\n  }\n\n  area.x = function(_) {\n    return arguments.length ? (x0 = typeof _ === \"function\" ? _ : constant(+_), x1 = null, area) : x0;\n  };\n\n  area.x0 = function(_) {\n    return arguments.length ? (x0 = typeof _ === \"function\" ? _ : constant(+_), area) : x0;\n  };\n\n  area.x1 = function(_) {\n    return arguments.length ? (x1 = _ == null ? null : typeof _ === \"function\" ? _ : constant(+_), area) : x1;\n  };\n\n  area.y = function(_) {\n    return arguments.length ? (y0 = typeof _ === \"function\" ? _ : constant(+_), y1 = null, area) : y0;\n  };\n\n  area.y0 = function(_) {\n    return arguments.length ? (y0 = typeof _ === \"function\" ? _ : constant(+_), area) : y0;\n  };\n\n  area.y1 = function(_) {\n    return arguments.length ? (y1 = _ == null ? null : typeof _ === \"function\" ? _ : constant(+_), area) : y1;\n  };\n\n  area.lineX0 =\n  area.lineY0 = function() {\n    return arealine().x(x0).y(y0);\n  };\n\n  area.lineY1 = function() {\n    return arealine().x(x0).y(y1);\n  };\n\n  area.lineX1 = function() {\n    return arealine().x(x1).y(y0);\n  };\n\n  area.defined = function(_) {\n    return arguments.length ? (defined = typeof _ === \"function\" ? _ : constant(!!_), area) : defined;\n  };\n\n  area.curve = function(_) {\n    return arguments.length ? (curve = _, context != null && (output = curve(context)), area) : curve;\n  };\n\n  area.context = function(_) {\n    return arguments.length ? (_ == null ? context = output = null : output = curve(context = _), area) : context;\n  };\n\n  return area;\n}\n","import curveRadial, {curveRadialLinear} from \"./curve/radial.js\";\nimport area from \"./area.js\";\nimport {lineRadial} from \"./lineRadial.js\";\n\nexport default function() {\n  var a = area().curve(curveRadialLinear),\n      c = a.curve,\n      x0 = a.lineX0,\n      x1 = a.lineX1,\n      y0 = a.lineY0,\n      y1 = a.lineY1;\n\n  a.angle = a.x, delete a.x;\n  a.startAngle = a.x0, delete a.x0;\n  a.endAngle = a.x1, delete a.x1;\n  a.radius = a.y, delete a.y;\n  a.innerRadius = a.y0, delete a.y0;\n  a.outerRadius = a.y1, delete a.y1;\n  a.lineStartAngle = function() { return lineRadial(x0()); }, delete a.lineX0;\n  a.lineEndAngle = function() { return lineRadial(x1()); }, delete a.lineX1;\n  a.lineInnerRadius = function() { return lineRadial(y0()); }, delete a.lineY0;\n  a.lineOuterRadius = function() { return lineRadial(y1()); }, delete a.lineY1;\n\n  a.curve = function(_) {\n    return arguments.length ? c(curveRadial(_)) : c()._curve;\n  };\n\n  return a;\n}\n","export var slice = Array.prototype.slice;\n","export default function(x) {\n  return function constant() {\n    return x;\n  };\n}\n","export function point(that, x, y) {\n  that._context.bezierCurveTo(\n    (2 * that._x0 + that._x1) / 3,\n    (2 * that._y0 + that._y1) / 3,\n    (that._x0 + 2 * that._x1) / 3,\n    (that._y0 + 2 * that._y1) / 3,\n    (that._x0 + 4 * that._x1 + x) / 6,\n    (that._y0 + 4 * that._y1 + y) / 6\n  );\n}\n\nexport function Basis(context) {\n  this._context = context;\n}\n\nBasis.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 =\n    this._y0 = this._y1 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 3: point(this, this._x1, this._y1); // proceed\n      case 2: this._context.lineTo(this._x1, this._y1); break;\n    }\n    if (this._line || (this._line !== 0 && this._point === 1)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; this._line ? this._context.lineTo(x, y) : this._context.moveTo(x, y); break;\n      case 1: this._point = 2; break;\n      case 2: this._point = 3; this._context.lineTo((5 * this._x0 + this._x1) / 6, (5 * this._y0 + this._y1) / 6); // proceed\n      default: point(this, x, y); break;\n    }\n    this._x0 = this._x1, this._x1 = x;\n    this._y0 = this._y1, this._y1 = y;\n  }\n};\n\nexport default function(context) {\n  return new Basis(context);\n}\n","import noop from \"../noop.js\";\nimport {point} from \"./basis.js\";\n\nfunction BasisClosed(context) {\n  this._context = context;\n}\n\nBasisClosed.prototype = {\n  areaStart: noop,\n  areaEnd: noop,\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 = this._x3 = this._x4 =\n    this._y0 = this._y1 = this._y2 = this._y3 = this._y4 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 1: {\n        this._context.moveTo(this._x2, this._y2);\n        this._context.closePath();\n        break;\n      }\n      case 2: {\n        this._context.moveTo((this._x2 + 2 * this._x3) / 3, (this._y2 + 2 * this._y3) / 3);\n        this._context.lineTo((this._x3 + 2 * this._x2) / 3, (this._y3 + 2 * this._y2) / 3);\n        this._context.closePath();\n        break;\n      }\n      case 3: {\n        this.point(this._x2, this._y2);\n        this.point(this._x3, this._y3);\n        this.point(this._x4, this._y4);\n        break;\n      }\n    }\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; this._x2 = x, this._y2 = y; break;\n      case 1: this._point = 2; this._x3 = x, this._y3 = y; break;\n      case 2: this._point = 3; this._x4 = x, this._y4 = y; this._context.moveTo((this._x0 + 4 * this._x1 + x) / 6, (this._y0 + 4 * this._y1 + y) / 6); break;\n      default: point(this, x, y); break;\n    }\n    this._x0 = this._x1, this._x1 = x;\n    this._y0 = this._y1, this._y1 = y;\n  }\n};\n\nexport default function(context) {\n  return new BasisClosed(context);\n}\n","import {point} from \"./basis.js\";\n\nfunction BasisOpen(context) {\n  this._context = context;\n}\n\nBasisOpen.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 =\n    this._y0 = this._y1 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._line || (this._line !== 0 && this._point === 3)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; break;\n      case 1: this._point = 2; break;\n      case 2: this._point = 3; var x0 = (this._x0 + 4 * this._x1 + x) / 6, y0 = (this._y0 + 4 * this._y1 + y) / 6; this._line ? this._context.lineTo(x0, y0) : this._context.moveTo(x0, y0); break;\n      case 3: this._point = 4; // proceed\n      default: point(this, x, y); break;\n    }\n    this._x0 = this._x1, this._x1 = x;\n    this._y0 = this._y1, this._y1 = y;\n  }\n};\n\nexport default function(context) {\n  return new BasisOpen(context);\n}\n","import {Basis} from \"./basis.js\";\n\nfunction Bundle(context, beta) {\n  this._basis = new Basis(context);\n  this._beta = beta;\n}\n\nBundle.prototype = {\n  lineStart: function() {\n    this._x = [];\n    this._y = [];\n    this._basis.lineStart();\n  },\n  lineEnd: function() {\n    var x = this._x,\n        y = this._y,\n        j = x.length - 1;\n\n    if (j > 0) {\n      var x0 = x[0],\n          y0 = y[0],\n          dx = x[j] - x0,\n          dy = y[j] - y0,\n          i = -1,\n          t;\n\n      while (++i <= j) {\n        t = i / j;\n        this._basis.point(\n          this._beta * x[i] + (1 - this._beta) * (x0 + t * dx),\n          this._beta * y[i] + (1 - this._beta) * (y0 + t * dy)\n        );\n      }\n    }\n\n    this._x = this._y = null;\n    this._basis.lineEnd();\n  },\n  point: function(x, y) {\n    this._x.push(+x);\n    this._y.push(+y);\n  }\n};\n\nexport default (function custom(beta) {\n\n  function bundle(context) {\n    return beta === 1 ? new Basis(context) : new Bundle(context, beta);\n  }\n\n  bundle.beta = function(beta) {\n    return custom(+beta);\n  };\n\n  return bundle;\n})(0.85);\n","export function point(that, x, y) {\n  that._context.bezierCurveTo(\n    that._x1 + that._k * (that._x2 - that._x0),\n    that._y1 + that._k * (that._y2 - that._y0),\n    that._x2 + that._k * (that._x1 - x),\n    that._y2 + that._k * (that._y1 - y),\n    that._x2,\n    that._y2\n  );\n}\n\nexport function Cardinal(context, tension) {\n  this._context = context;\n  this._k = (1 - tension) / 6;\n}\n\nCardinal.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 =\n    this._y0 = this._y1 = this._y2 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 2: this._context.lineTo(this._x2, this._y2); break;\n      case 3: point(this, this._x1, this._y1); break;\n    }\n    if (this._line || (this._line !== 0 && this._point === 1)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; this._line ? this._context.lineTo(x, y) : this._context.moveTo(x, y); break;\n      case 1: this._point = 2; this._x1 = x, this._y1 = y; break;\n      case 2: this._point = 3; // proceed\n      default: point(this, x, y); break;\n    }\n    this._x0 = this._x1, this._x1 = this._x2, this._x2 = x;\n    this._y0 = this._y1, this._y1 = this._y2, this._y2 = y;\n  }\n};\n\nexport default (function custom(tension) {\n\n  function cardinal(context) {\n    return new Cardinal(context, tension);\n  }\n\n  cardinal.tension = function(tension) {\n    return custom(+tension);\n  };\n\n  return cardinal;\n})(0);\n","import noop from \"../noop.js\";\nimport {point} from \"./cardinal.js\";\n\nexport function CardinalClosed(context, tension) {\n  this._context = context;\n  this._k = (1 - tension) / 6;\n}\n\nCardinalClosed.prototype = {\n  areaStart: noop,\n  areaEnd: noop,\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 = this._x3 = this._x4 = this._x5 =\n    this._y0 = this._y1 = this._y2 = this._y3 = this._y4 = this._y5 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 1: {\n        this._context.moveTo(this._x3, this._y3);\n        this._context.closePath();\n        break;\n      }\n      case 2: {\n        this._context.lineTo(this._x3, this._y3);\n        this._context.closePath();\n        break;\n      }\n      case 3: {\n        this.point(this._x3, this._y3);\n        this.point(this._x4, this._y4);\n        this.point(this._x5, this._y5);\n        break;\n      }\n    }\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; this._x3 = x, this._y3 = y; break;\n      case 1: this._point = 2; this._context.moveTo(this._x4 = x, this._y4 = y); break;\n      case 2: this._point = 3; this._x5 = x, this._y5 = y; break;\n      default: point(this, x, y); break;\n    }\n    this._x0 = this._x1, this._x1 = this._x2, this._x2 = x;\n    this._y0 = this._y1, this._y1 = this._y2, this._y2 = y;\n  }\n};\n\nexport default (function custom(tension) {\n\n  function cardinal(context) {\n    return new CardinalClosed(context, tension);\n  }\n\n  cardinal.tension = function(tension) {\n    return custom(+tension);\n  };\n\n  return cardinal;\n})(0);\n","import {point} from \"./cardinal.js\";\n\nexport function CardinalOpen(context, tension) {\n  this._context = context;\n  this._k = (1 - tension) / 6;\n}\n\nCardinalOpen.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 =\n    this._y0 = this._y1 = this._y2 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._line || (this._line !== 0 && this._point === 3)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; break;\n      case 1: this._point = 2; break;\n      case 2: this._point = 3; this._line ? this._context.lineTo(this._x2, this._y2) : this._context.moveTo(this._x2, this._y2); break;\n      case 3: this._point = 4; // proceed\n      default: point(this, x, y); break;\n    }\n    this._x0 = this._x1, this._x1 = this._x2, this._x2 = x;\n    this._y0 = this._y1, this._y1 = this._y2, this._y2 = y;\n  }\n};\n\nexport default (function custom(tension) {\n\n  function cardinal(context) {\n    return new CardinalOpen(context, tension);\n  }\n\n  cardinal.tension = function(tension) {\n    return custom(+tension);\n  };\n\n  return cardinal;\n})(0);\n","import {epsilon} from \"../math.js\";\nimport {Cardinal} from \"./cardinal.js\";\n\nexport function point(that, x, y) {\n  var x1 = that._x1,\n      y1 = that._y1,\n      x2 = that._x2,\n      y2 = that._y2;\n\n  if (that._l01_a > epsilon) {\n    var a = 2 * that._l01_2a + 3 * that._l01_a * that._l12_a + that._l12_2a,\n        n = 3 * that._l01_a * (that._l01_a + that._l12_a);\n    x1 = (x1 * a - that._x0 * that._l12_2a + that._x2 * that._l01_2a) / n;\n    y1 = (y1 * a - that._y0 * that._l12_2a + that._y2 * that._l01_2a) / n;\n  }\n\n  if (that._l23_a > epsilon) {\n    var b = 2 * that._l23_2a + 3 * that._l23_a * that._l12_a + that._l12_2a,\n        m = 3 * that._l23_a * (that._l23_a + that._l12_a);\n    x2 = (x2 * b + that._x1 * that._l23_2a - x * that._l12_2a) / m;\n    y2 = (y2 * b + that._y1 * that._l23_2a - y * that._l12_2a) / m;\n  }\n\n  that._context.bezierCurveTo(x1, y1, x2, y2, that._x2, that._y2);\n}\n\nfunction CatmullRom(context, alpha) {\n  this._context = context;\n  this._alpha = alpha;\n}\n\nCatmullRom.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 =\n    this._y0 = this._y1 = this._y2 = NaN;\n    this._l01_a = this._l12_a = this._l23_a =\n    this._l01_2a = this._l12_2a = this._l23_2a =\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 2: this._context.lineTo(this._x2, this._y2); break;\n      case 3: this.point(this._x2, this._y2); break;\n    }\n    if (this._line || (this._line !== 0 && this._point === 1)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n\n    if (this._point) {\n      var x23 = this._x2 - x,\n          y23 = this._y2 - y;\n      this._l23_a = Math.sqrt(this._l23_2a = Math.pow(x23 * x23 + y23 * y23, this._alpha));\n    }\n\n    switch (this._point) {\n      case 0: this._point = 1; this._line ? this._context.lineTo(x, y) : this._context.moveTo(x, y); break;\n      case 1: this._point = 2; break;\n      case 2: this._point = 3; // proceed\n      default: point(this, x, y); break;\n    }\n\n    this._l01_a = this._l12_a, this._l12_a = this._l23_a;\n    this._l01_2a = this._l12_2a, this._l12_2a = this._l23_2a;\n    this._x0 = this._x1, this._x1 = this._x2, this._x2 = x;\n    this._y0 = this._y1, this._y1 = this._y2, this._y2 = y;\n  }\n};\n\nexport default (function custom(alpha) {\n\n  function catmullRom(context) {\n    return alpha ? new CatmullRom(context, alpha) : new Cardinal(context, 0);\n  }\n\n  catmullRom.alpha = function(alpha) {\n    return custom(+alpha);\n  };\n\n  return catmullRom;\n})(0.5);\n","import {CardinalClosed} from \"./cardinalClosed.js\";\nimport noop from \"../noop.js\";\nimport {point} from \"./catmullRom.js\";\n\nfunction CatmullRomClosed(context, alpha) {\n  this._context = context;\n  this._alpha = alpha;\n}\n\nCatmullRomClosed.prototype = {\n  areaStart: noop,\n  areaEnd: noop,\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 = this._x3 = this._x4 = this._x5 =\n    this._y0 = this._y1 = this._y2 = this._y3 = this._y4 = this._y5 = NaN;\n    this._l01_a = this._l12_a = this._l23_a =\n    this._l01_2a = this._l12_2a = this._l23_2a =\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 1: {\n        this._context.moveTo(this._x3, this._y3);\n        this._context.closePath();\n        break;\n      }\n      case 2: {\n        this._context.lineTo(this._x3, this._y3);\n        this._context.closePath();\n        break;\n      }\n      case 3: {\n        this.point(this._x3, this._y3);\n        this.point(this._x4, this._y4);\n        this.point(this._x5, this._y5);\n        break;\n      }\n    }\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n\n    if (this._point) {\n      var x23 = this._x2 - x,\n          y23 = this._y2 - y;\n      this._l23_a = Math.sqrt(this._l23_2a = Math.pow(x23 * x23 + y23 * y23, this._alpha));\n    }\n\n    switch (this._point) {\n      case 0: this._point = 1; this._x3 = x, this._y3 = y; break;\n      case 1: this._point = 2; this._context.moveTo(this._x4 = x, this._y4 = y); break;\n      case 2: this._point = 3; this._x5 = x, this._y5 = y; break;\n      default: point(this, x, y); break;\n    }\n\n    this._l01_a = this._l12_a, this._l12_a = this._l23_a;\n    this._l01_2a = this._l12_2a, this._l12_2a = this._l23_2a;\n    this._x0 = this._x1, this._x1 = this._x2, this._x2 = x;\n    this._y0 = this._y1, this._y1 = this._y2, this._y2 = y;\n  }\n};\n\nexport default (function custom(alpha) {\n\n  function catmullRom(context) {\n    return alpha ? new CatmullRomClosed(context, alpha) : new CardinalClosed(context, 0);\n  }\n\n  catmullRom.alpha = function(alpha) {\n    return custom(+alpha);\n  };\n\n  return catmullRom;\n})(0.5);\n","import {CardinalOpen} from \"./cardinalOpen.js\";\nimport {point} from \"./catmullRom.js\";\n\nfunction CatmullRomOpen(context, alpha) {\n  this._context = context;\n  this._alpha = alpha;\n}\n\nCatmullRomOpen.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 = this._x2 =\n    this._y0 = this._y1 = this._y2 = NaN;\n    this._l01_a = this._l12_a = this._l23_a =\n    this._l01_2a = this._l12_2a = this._l23_2a =\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._line || (this._line !== 0 && this._point === 3)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n\n    if (this._point) {\n      var x23 = this._x2 - x,\n          y23 = this._y2 - y;\n      this._l23_a = Math.sqrt(this._l23_2a = Math.pow(x23 * x23 + y23 * y23, this._alpha));\n    }\n\n    switch (this._point) {\n      case 0: this._point = 1; break;\n      case 1: this._point = 2; break;\n      case 2: this._point = 3; this._line ? this._context.lineTo(this._x2, this._y2) : this._context.moveTo(this._x2, this._y2); break;\n      case 3: this._point = 4; // proceed\n      default: point(this, x, y); break;\n    }\n\n    this._l01_a = this._l12_a, this._l12_a = this._l23_a;\n    this._l01_2a = this._l12_2a, this._l12_2a = this._l23_2a;\n    this._x0 = this._x1, this._x1 = this._x2, this._x2 = x;\n    this._y0 = this._y1, this._y1 = this._y2, this._y2 = y;\n  }\n};\n\nexport default (function custom(alpha) {\n\n  function catmullRom(context) {\n    return alpha ? new CatmullRomOpen(context, alpha) : new CardinalOpen(context, 0);\n  }\n\n  catmullRom.alpha = function(alpha) {\n    return custom(+alpha);\n  };\n\n  return catmullRom;\n})(0.5);\n","function Linear(context) {\n  this._context = context;\n}\n\nLinear.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._line || (this._line !== 0 && this._point === 1)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; this._line ? this._context.lineTo(x, y) : this._context.moveTo(x, y); break;\n      case 1: this._point = 2; // proceed\n      default: this._context.lineTo(x, y); break;\n    }\n  }\n};\n\nexport default function(context) {\n  return new Linear(context);\n}\n","import noop from \"../noop.js\";\n\nfunction LinearClosed(context) {\n  this._context = context;\n}\n\nLinearClosed.prototype = {\n  areaStart: noop,\n  areaEnd: noop,\n  lineStart: function() {\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._point) this._context.closePath();\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    if (this._point) this._context.lineTo(x, y);\n    else this._point = 1, this._context.moveTo(x, y);\n  }\n};\n\nexport default function(context) {\n  return new LinearClosed(context);\n}\n","function sign(x) {\n  return x < 0 ? -1 : 1;\n}\n\n// Calculate the slopes of the tangents (Hermite-type interpolation) based on\n// the following paper: Steffen, M. 1990. A Simple Method for Monotonic\n// Interpolation in One Dimension. Astronomy and Astrophysics, Vol. 239, NO.\n// NOV(II), P. 443, 1990.\nfunction slope3(that, x2, y2) {\n  var h0 = that._x1 - that._x0,\n      h1 = x2 - that._x1,\n      s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),\n      s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),\n      p = (s0 * h1 + s1 * h0) / (h0 + h1);\n  return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;\n}\n\n// Calculate a one-sided slope.\nfunction slope2(that, t) {\n  var h = that._x1 - that._x0;\n  return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;\n}\n\n// According to https://en.wikipedia.org/wiki/Cubic_Hermite_spline#Representations\n// \"you can express cubic Hermite interpolation in terms of cubic Bézier curves\n// with respect to the four values p0, p0 + m0 / 3, p1 - m1 / 3, p1\".\nfunction point(that, t0, t1) {\n  var x0 = that._x0,\n      y0 = that._y0,\n      x1 = that._x1,\n      y1 = that._y1,\n      dx = (x1 - x0) / 3;\n  that._context.bezierCurveTo(x0 + dx, y0 + dx * t0, x1 - dx, y1 - dx * t1, x1, y1);\n}\n\nfunction MonotoneX(context) {\n  this._context = context;\n}\n\nMonotoneX.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x0 = this._x1 =\n    this._y0 = this._y1 =\n    this._t0 = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    switch (this._point) {\n      case 2: this._context.lineTo(this._x1, this._y1); break;\n      case 3: point(this, this._t0, slope2(this, this._t0)); break;\n    }\n    if (this._line || (this._line !== 0 && this._point === 1)) this._context.closePath();\n    this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    var t1 = NaN;\n\n    x = +x, y = +y;\n    if (x === this._x1 && y === this._y1) return; // Ignore coincident points.\n    switch (this._point) {\n      case 0: this._point = 1; this._line ? this._context.lineTo(x, y) : this._context.moveTo(x, y); break;\n      case 1: this._point = 2; break;\n      case 2: this._point = 3; point(this, slope2(this, t1 = slope3(this, x, y)), t1); break;\n      default: point(this, this._t0, t1 = slope3(this, x, y)); break;\n    }\n\n    this._x0 = this._x1, this._x1 = x;\n    this._y0 = this._y1, this._y1 = y;\n    this._t0 = t1;\n  }\n}\n\nfunction MonotoneY(context) {\n  this._context = new ReflectContext(context);\n}\n\n(MonotoneY.prototype = Object.create(MonotoneX.prototype)).point = function(x, y) {\n  MonotoneX.prototype.point.call(this, y, x);\n};\n\nfunction ReflectContext(context) {\n  this._context = context;\n}\n\nReflectContext.prototype = {\n  moveTo: function(x, y) { this._context.moveTo(y, x); },\n  closePath: function() { this._context.closePath(); },\n  lineTo: function(x, y) { this._context.lineTo(y, x); },\n  bezierCurveTo: function(x1, y1, x2, y2, x, y) { this._context.bezierCurveTo(y1, x1, y2, x2, y, x); }\n};\n\nexport function monotoneX(context) {\n  return new MonotoneX(context);\n}\n\nexport function monotoneY(context) {\n  return new MonotoneY(context);\n}\n","function Natural(context) {\n  this._context = context;\n}\n\nNatural.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x = [];\n    this._y = [];\n  },\n  lineEnd: function() {\n    var x = this._x,\n        y = this._y,\n        n = x.length;\n\n    if (n) {\n      this._line ? this._context.lineTo(x[0], y[0]) : this._context.moveTo(x[0], y[0]);\n      if (n === 2) {\n        this._context.lineTo(x[1], y[1]);\n      } else {\n        var px = controlPoints(x),\n            py = controlPoints(y);\n        for (var i0 = 0, i1 = 1; i1 < n; ++i0, ++i1) {\n          this._context.bezierCurveTo(px[0][i0], py[0][i0], px[1][i0], py[1][i0], x[i1], y[i1]);\n        }\n      }\n    }\n\n    if (this._line || (this._line !== 0 && n === 1)) this._context.closePath();\n    this._line = 1 - this._line;\n    this._x = this._y = null;\n  },\n  point: function(x, y) {\n    this._x.push(+x);\n    this._y.push(+y);\n  }\n};\n\n// See https://www.particleincell.com/2012/bezier-splines/ for derivation.\nfunction controlPoints(x) {\n  var i,\n      n = x.length - 1,\n      m,\n      a = new Array(n),\n      b = new Array(n),\n      r = new Array(n);\n  a[0] = 0, b[0] = 2, r[0] = x[0] + 2 * x[1];\n  for (i = 1; i < n - 1; ++i) a[i] = 1, b[i] = 4, r[i] = 4 * x[i] + 2 * x[i + 1];\n  a[n - 1] = 2, b[n - 1] = 7, r[n - 1] = 8 * x[n - 1] + x[n];\n  for (i = 1; i < n; ++i) m = a[i] / b[i - 1], b[i] -= m, r[i] -= m * r[i - 1];\n  a[n - 1] = r[n - 1] / b[n - 1];\n  for (i = n - 2; i >= 0; --i) a[i] = (r[i] - a[i + 1]) / b[i];\n  b[n - 1] = (x[n] + a[n - 1]) / 2;\n  for (i = 0; i < n - 1; ++i) b[i] = 2 * x[i + 1] - a[i + 1];\n  return [a, b];\n}\n\nexport default function(context) {\n  return new Natural(context);\n}\n","import curveLinear from \"./linear.js\";\n\nexport var curveRadialLinear = curveRadial(curveLinear);\n\nfunction Radial(curve) {\n  this._curve = curve;\n}\n\nRadial.prototype = {\n  areaStart: function() {\n    this._curve.areaStart();\n  },\n  areaEnd: function() {\n    this._curve.areaEnd();\n  },\n  lineStart: function() {\n    this._curve.lineStart();\n  },\n  lineEnd: function() {\n    this._curve.lineEnd();\n  },\n  point: function(a, r) {\n    this._curve.point(r * Math.sin(a), r * -Math.cos(a));\n  }\n};\n\nexport default function curveRadial(curve) {\n\n  function radial(context) {\n    return new Radial(curve(context));\n  }\n\n  radial._curve = curve;\n\n  return radial;\n}\n","function Step(context, t) {\n  this._context = context;\n  this._t = t;\n}\n\nStep.prototype = {\n  areaStart: function() {\n    this._line = 0;\n  },\n  areaEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._x = this._y = NaN;\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (0 < this._t && this._t < 1 && this._point === 2) this._context.lineTo(this._x, this._y);\n    if (this._line || (this._line !== 0 && this._point === 1)) this._context.closePath();\n    if (this._line >= 0) this._t = 1 - this._t, this._line = 1 - this._line;\n  },\n  point: function(x, y) {\n    x = +x, y = +y;\n    switch (this._point) {\n      case 0: this._point = 1; this._line ? this._context.lineTo(x, y) : this._context.moveTo(x, y); break;\n      case 1: this._point = 2; // proceed\n      default: {\n        if (this._t <= 0) {\n          this._context.lineTo(this._x, y);\n          this._context.lineTo(x, y);\n        } else {\n          var x1 = this._x * (1 - this._t) + x * this._t;\n          this._context.lineTo(x1, this._y);\n          this._context.lineTo(x1, y);\n        }\n        break;\n      }\n    }\n    this._x = x, this._y = y;\n  }\n};\n\nexport default function(context) {\n  return new Step(context, 0.5);\n}\n\nexport function stepBefore(context) {\n  return new Step(context, 0);\n}\n\nexport function stepAfter(context) {\n  return new Step(context, 1);\n}\n","export default function(a, b) {\n  return b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;\n}\n","export default function(d) {\n  return d;\n}\n","export {default as arc} from \"./arc.js\";\nexport {default as area} from \"./area.js\";\nexport {default as line} from \"./line.js\";\nexport {default as pie} from \"./pie.js\";\nexport {default as areaRadial, default as radialArea} from \"./areaRadial.js\"; // Note: radialArea is deprecated!\nexport {default as lineRadial, default as radialLine} from \"./lineRadial.js\"; // Note: radialLine is deprecated!\nexport {default as pointRadial} from \"./pointRadial.js\";\nexport {linkHorizontal, linkVertical, linkRadial} from \"./link/index.js\";\n\nexport {default as symbol, symbols} from \"./symbol.js\";\nexport {default as symbolCircle} from \"./symbol/circle.js\";\nexport {default as symbolCross} from \"./symbol/cross.js\";\nexport {default as symbolDiamond} from \"./symbol/diamond.js\";\nexport {default as symbolSquare} from \"./symbol/square.js\";\nexport {default as symbolStar} from \"./symbol/star.js\";\nexport {default as symbolTriangle} from \"./symbol/triangle.js\";\nexport {default as symbolWye} from \"./symbol/wye.js\";\n\nexport {default as curveBasisClosed} from \"./curve/basisClosed.js\";\nexport {default as curveBasisOpen} from \"./curve/basisOpen.js\";\nexport {default as curveBasis} from \"./curve/basis.js\";\nexport {default as curveBundle} from \"./curve/bundle.js\";\nexport {default as curveCardinalClosed} from \"./curve/cardinalClosed.js\";\nexport {default as curveCardinalOpen} from \"./curve/cardinalOpen.js\";\nexport {default as curveCardinal} from \"./curve/cardinal.js\";\nexport {default as curveCatmullRomClosed} from \"./curve/catmullRomClosed.js\";\nexport {default as curveCatmullRomOpen} from \"./curve/catmullRomOpen.js\";\nexport {default as curveCatmullRom} from \"./curve/catmullRom.js\";\nexport {default as curveLinearClosed} from \"./curve/linearClosed.js\";\nexport {default as curveLinear} from \"./curve/linear.js\";\nexport {monotoneX as curveMonotoneX, monotoneY as curveMonotoneY} from \"./curve/monotone.js\";\nexport {default as curveNatural} from \"./curve/natural.js\";\nexport {default as curveStep, stepAfter as curveStepAfter, stepBefore as curveStepBefore} from \"./curve/step.js\";\n\nexport {default as stack} from \"./stack.js\";\nexport {default as stackOffsetExpand} from \"./offset/expand.js\";\nexport {default as stackOffsetDiverging} from \"./offset/diverging.js\";\nexport {default as stackOffsetNone} from \"./offset/none.js\";\nexport {default as stackOffsetSilhouette} from \"./offset/silhouette.js\";\nexport {default as stackOffsetWiggle} from \"./offset/wiggle.js\";\nexport {default as stackOrderAppearance} from \"./order/appearance.js\";\nexport {default as stackOrderAscending} from \"./order/ascending.js\";\nexport {default as stackOrderDescending} from \"./order/descending.js\";\nexport {default as stackOrderInsideOut} from \"./order/insideOut.js\";\nexport {default as stackOrderNone} from \"./order/none.js\";\nexport {default as stackOrderReverse} from \"./order/reverse.js\";\n","import {path} from \"d3-path\";\nimport constant from \"./constant.js\";\nimport curveLinear from \"./curve/linear.js\";\nimport {x as pointX, y as pointY} from \"./point.js\";\n\nexport default function() {\n  var x = pointX,\n      y = pointY,\n      defined = constant(true),\n      context = null,\n      curve = curveLinear,\n      output = null;\n\n  function line(data) {\n    var i,\n        n = data.length,\n        d,\n        defined0 = false,\n        buffer;\n\n    if (context == null) output = curve(buffer = path());\n\n    for (i = 0; i <= n; ++i) {\n      if (!(i < n && defined(d = data[i], i, data)) === defined0) {\n        if (defined0 = !defined0) output.lineStart();\n        else output.lineEnd();\n      }\n      if (defined0) output.point(+x(d, i, data), +y(d, i, data));\n    }\n\n    if (buffer) return output = null, buffer + \"\" || null;\n  }\n\n  line.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), line) : x;\n  };\n\n  line.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), line) : y;\n  };\n\n  line.defined = function(_) {\n    return arguments.length ? (defined = typeof _ === \"function\" ? _ : constant(!!_), line) : defined;\n  };\n\n  line.curve = function(_) {\n    return arguments.length ? (curve = _, context != null && (output = curve(context)), line) : curve;\n  };\n\n  line.context = function(_) {\n    return arguments.length ? (_ == null ? context = output = null : output = curve(context = _), line) : context;\n  };\n\n  return line;\n}\n","import curveRadial, {curveRadialLinear} from \"./curve/radial.js\";\nimport line from \"./line.js\";\n\nexport function lineRadial(l) {\n  var c = l.curve;\n\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n\n  l.curve = function(_) {\n    return arguments.length ? c(curveRadial(_)) : c()._curve;\n  };\n\n  return l;\n}\n\nexport default function() {\n  return lineRadial(line().curve(curveRadialLinear));\n}\n","import {path} from \"d3-path\";\nimport {slice} from \"../array.js\";\nimport constant from \"../constant.js\";\nimport {x as pointX, y as pointY} from \"../point.js\";\nimport pointRadial from \"../pointRadial.js\";\n\nfunction linkSource(d) {\n  return d.source;\n}\n\nfunction linkTarget(d) {\n  return d.target;\n}\n\nfunction link(curve) {\n  var source = linkSource,\n      target = linkTarget,\n      x = pointX,\n      y = pointY,\n      context = null;\n\n  function link() {\n    var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);\n    if (!context) context = buffer = path();\n    curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  link.source = function(_) {\n    return arguments.length ? (source = _, link) : source;\n  };\n\n  link.target = function(_) {\n    return arguments.length ? (target = _, link) : target;\n  };\n\n  link.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), link) : x;\n  };\n\n  link.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), link) : y;\n  };\n\n  link.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), link) : context;\n  };\n\n  return link;\n}\n\nfunction curveHorizontal(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);\n}\n\nfunction curveVertical(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);\n}\n\nfunction curveRadial(context, x0, y0, x1, y1) {\n  var p0 = pointRadial(x0, y0),\n      p1 = pointRadial(x0, y0 = (y0 + y1) / 2),\n      p2 = pointRadial(x1, y0),\n      p3 = pointRadial(x1, y1);\n  context.moveTo(p0[0], p0[1]);\n  context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\nexport function linkHorizontal() {\n  return link(curveHorizontal);\n}\n\nexport function linkVertical() {\n  return link(curveVertical);\n}\n\nexport function linkRadial() {\n  var l = link(curveRadial);\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n  return l;\n}\n","export var abs = Math.abs;\nexport var atan2 = Math.atan2;\nexport var cos = Math.cos;\nexport var max = Math.max;\nexport var min = Math.min;\nexport var sin = Math.sin;\nexport var sqrt = Math.sqrt;\n\nexport var epsilon = 1e-12;\nexport var pi = Math.PI;\nexport var halfPi = pi / 2;\nexport var tau = 2 * pi;\n\nexport function acos(x) {\n  return x > 1 ? 0 : x < -1 ? pi : Math.acos(x);\n}\n\nexport function asin(x) {\n  return x >= 1 ? halfPi : x <= -1 ? -halfPi : Math.asin(x);\n}\n","export default function() {}\n","export default function(series, order) {\n  if (!((n = series.length) > 0)) return;\n  for (var i, j = 0, d, dy, yp, yn, n, m = series[order[0]].length; j < m; ++j) {\n    for (yp = yn = 0, i = 0; i < n; ++i) {\n      if ((dy = (d = series[order[i]][j])[1] - d[0]) > 0) {\n        d[0] = yp, d[1] = yp += dy;\n      } else if (dy < 0) {\n        d[1] = yn, d[0] = yn += dy;\n      } else {\n        d[0] = 0, d[1] = dy;\n      }\n    }\n  }\n}\n","import none from \"./none.js\";\n\nexport default function(series, order) {\n  if (!((n = series.length) > 0)) return;\n  for (var i, n, j = 0, m = series[0].length, y; j < m; ++j) {\n    for (y = i = 0; i < n; ++i) y += series[i][j][1] || 0;\n    if (y) for (i = 0; i < n; ++i) series[i][j][1] /= y;\n  }\n  none(series, order);\n}\n","export default function(series, order) {\n  if (!((n = series.length) > 1)) return;\n  for (var i = 1, j, s0, s1 = series[order[0]], n, m = s1.length; i < n; ++i) {\n    s0 = s1, s1 = series[order[i]];\n    for (j = 0; j < m; ++j) {\n      s1[j][1] += s1[j][0] = isNaN(s0[j][1]) ? s0[j][0] : s0[j][1];\n    }\n  }\n}\n","import none from \"./none.js\";\n\nexport default function(series, order) {\n  if (!((n = series.length) > 0)) return;\n  for (var j = 0, s0 = series[order[0]], n, m = s0.length; j < m; ++j) {\n    for (var i = 0, y = 0; i < n; ++i) y += series[i][j][1] || 0;\n    s0[j][1] += s0[j][0] = -y / 2;\n  }\n  none(series, order);\n}\n","import none from \"./none.js\";\n\nexport default function(series, order) {\n  if (!((n = series.length) > 0) || !((m = (s0 = series[order[0]]).length) > 0)) return;\n  for (var y = 0, j = 1, s0, m, n; j < m; ++j) {\n    for (var i = 0, s1 = 0, s2 = 0; i < n; ++i) {\n      var si = series[order[i]],\n          sij0 = si[j][1] || 0,\n          sij1 = si[j - 1][1] || 0,\n          s3 = (sij0 - sij1) / 2;\n      for (var k = 0; k < i; ++k) {\n        var sk = series[order[k]],\n            skj0 = sk[j][1] || 0,\n            skj1 = sk[j - 1][1] || 0;\n        s3 += skj0 - skj1;\n      }\n      s1 += sij0, s2 += s3 * sij0;\n    }\n    s0[j - 1][1] += s0[j - 1][0] = y;\n    if (s1) y -= s2 / s1;\n  }\n  s0[j - 1][1] += s0[j - 1][0] = y;\n  none(series, order);\n}\n","import none from \"./none.js\";\n\nexport default function(series) {\n  var peaks = series.map(peak);\n  return none(series).sort(function(a, b) { return peaks[a] - peaks[b]; });\n}\n\nfunction peak(series) {\n  var i = -1, j = 0, n = series.length, vi, vj = -Infinity;\n  while (++i < n) if ((vi = +series[i][1]) > vj) vj = vi, j = i;\n  return j;\n}\n","import none from \"./none.js\";\n\nexport default function(series) {\n  var sums = series.map(sum);\n  return none(series).sort(function(a, b) { return sums[a] - sums[b]; });\n}\n\nexport function sum(series) {\n  var s = 0, i = -1, n = series.length, v;\n  while (++i < n) if (v = +series[i][1]) s += v;\n  return s;\n}\n","import ascending from \"./ascending.js\";\n\nexport default function(series) {\n  return ascending(series).reverse();\n}\n","import appearance from \"./appearance.js\";\nimport {sum} from \"./ascending.js\";\n\nexport default function(series) {\n  var n = series.length,\n      i,\n      j,\n      sums = series.map(sum),\n      order = appearance(series),\n      top = 0,\n      bottom = 0,\n      tops = [],\n      bottoms = [];\n\n  for (i = 0; i < n; ++i) {\n    j = order[i];\n    if (top < bottom) {\n      top += sums[j];\n      tops.push(j);\n    } else {\n      bottom += sums[j];\n      bottoms.push(j);\n    }\n  }\n\n  return bottoms.reverse().concat(tops);\n}\n","export default function(series) {\n  var n = series.length, o = new Array(n);\n  while (--n >= 0) o[n] = n;\n  return o;\n}\n","import none from \"./none.js\";\n\nexport default function(series) {\n  return none(series).reverse();\n}\n","import constant from \"./constant.js\";\nimport descending from \"./descending.js\";\nimport identity from \"./identity.js\";\nimport {tau} from \"./math.js\";\n\nexport default function() {\n  var value = identity,\n      sortValues = descending,\n      sort = null,\n      startAngle = constant(0),\n      endAngle = constant(tau),\n      padAngle = constant(0);\n\n  function pie(data) {\n    var i,\n        n = data.length,\n        j,\n        k,\n        sum = 0,\n        index = new Array(n),\n        arcs = new Array(n),\n        a0 = +startAngle.apply(this, arguments),\n        da = Math.min(tau, Math.max(-tau, endAngle.apply(this, arguments) - a0)),\n        a1,\n        p = Math.min(Math.abs(da) / n, padAngle.apply(this, arguments)),\n        pa = p * (da < 0 ? -1 : 1),\n        v;\n\n    for (i = 0; i < n; ++i) {\n      if ((v = arcs[index[i] = i] = +value(data[i], i, data)) > 0) {\n        sum += v;\n      }\n    }\n\n    // Optionally sort the arcs by previously-computed values or by data.\n    if (sortValues != null) index.sort(function(i, j) { return sortValues(arcs[i], arcs[j]); });\n    else if (sort != null) index.sort(function(i, j) { return sort(data[i], data[j]); });\n\n    // Compute the arcs! They are stored in the original data's order.\n    for (i = 0, k = sum ? (da - n * pa) / sum : 0; i < n; ++i, a0 = a1) {\n      j = index[i], v = arcs[j], a1 = a0 + (v > 0 ? v * k : 0) + pa, arcs[j] = {\n        data: data[j],\n        index: i,\n        value: v,\n        startAngle: a0,\n        endAngle: a1,\n        padAngle: p\n      };\n    }\n\n    return arcs;\n  }\n\n  pie.value = function(_) {\n    return arguments.length ? (value = typeof _ === \"function\" ? _ : constant(+_), pie) : value;\n  };\n\n  pie.sortValues = function(_) {\n    return arguments.length ? (sortValues = _, sort = null, pie) : sortValues;\n  };\n\n  pie.sort = function(_) {\n    return arguments.length ? (sort = _, sortValues = null, pie) : sort;\n  };\n\n  pie.startAngle = function(_) {\n    return arguments.length ? (startAngle = typeof _ === \"function\" ? _ : constant(+_), pie) : startAngle;\n  };\n\n  pie.endAngle = function(_) {\n    return arguments.length ? (endAngle = typeof _ === \"function\" ? _ : constant(+_), pie) : endAngle;\n  };\n\n  pie.padAngle = function(_) {\n    return arguments.length ? (padAngle = typeof _ === \"function\" ? _ : constant(+_), pie) : padAngle;\n  };\n\n  return pie;\n}\n","export function x(p) {\n  return p[0];\n}\n\nexport function y(p) {\n  return p[1];\n}\n","export default function(x, y) {\n  return [(y = +y) * Math.cos(x -= Math.PI / 2), y * Math.sin(x)];\n}\n","import {slice} from \"./array.js\";\nimport constant from \"./constant.js\";\nimport offsetNone from \"./offset/none.js\";\nimport orderNone from \"./order/none.js\";\n\nfunction stackValue(d, key) {\n  return d[key];\n}\n\nexport default function() {\n  var keys = constant([]),\n      order = orderNone,\n      offset = offsetNone,\n      value = stackValue;\n\n  function stack(data) {\n    var kz = keys.apply(this, arguments),\n        i,\n        m = data.length,\n        n = kz.length,\n        sz = new Array(n),\n        oz;\n\n    for (i = 0; i < n; ++i) {\n      for (var ki = kz[i], si = sz[i] = new Array(m), j = 0, sij; j < m; ++j) {\n        si[j] = sij = [0, +value(data[j], ki, j, data)];\n        sij.data = data[j];\n      }\n      si.key = ki;\n    }\n\n    for (i = 0, oz = order(sz); i < n; ++i) {\n      sz[oz[i]].index = i;\n    }\n\n    offset(sz, oz);\n    return sz;\n  }\n\n  stack.keys = function(_) {\n    return arguments.length ? (keys = typeof _ === \"function\" ? _ : constant(slice.call(_)), stack) : keys;\n  };\n\n  stack.value = function(_) {\n    return arguments.length ? (value = typeof _ === \"function\" ? _ : constant(+_), stack) : value;\n  };\n\n  stack.order = function(_) {\n    return arguments.length ? (order = _ == null ? orderNone : typeof _ === \"function\" ? _ : constant(slice.call(_)), stack) : order;\n  };\n\n  stack.offset = function(_) {\n    return arguments.length ? (offset = _ == null ? offsetNone : _, stack) : offset;\n  };\n\n  return stack;\n}\n","import {path} from \"d3-path\";\nimport circle from \"./symbol/circle.js\";\nimport cross from \"./symbol/cross.js\";\nimport diamond from \"./symbol/diamond.js\";\nimport star from \"./symbol/star.js\";\nimport square from \"./symbol/square.js\";\nimport triangle from \"./symbol/triangle.js\";\nimport wye from \"./symbol/wye.js\";\nimport constant from \"./constant.js\";\n\nexport var symbols = [\n  circle,\n  cross,\n  diamond,\n  square,\n  star,\n  triangle,\n  wye\n];\n\nexport default function() {\n  var type = constant(circle),\n      size = constant(64),\n      context = null;\n\n  function symbol() {\n    var buffer;\n    if (!context) context = buffer = path();\n    type.apply(this, arguments).draw(context, +size.apply(this, arguments));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  symbol.type = function(_) {\n    return arguments.length ? (type = typeof _ === \"function\" ? _ : constant(_), symbol) : type;\n  };\n\n  symbol.size = function(_) {\n    return arguments.length ? (size = typeof _ === \"function\" ? _ : constant(+_), symbol) : size;\n  };\n\n  symbol.context = function(_) {\n    return arguments.length ? (context = _ == null ? null : _, symbol) : context;\n  };\n\n  return symbol;\n}\n","import {pi, tau} from \"../math.js\";\n\nexport default {\n  draw: function(context, size) {\n    var r = Math.sqrt(size / pi);\n    context.moveTo(r, 0);\n    context.arc(0, 0, r, 0, tau);\n  }\n};\n","export default {\n  draw: function(context, size) {\n    var r = Math.sqrt(size / 5) / 2;\n    context.moveTo(-3 * r, -r);\n    context.lineTo(-r, -r);\n    context.lineTo(-r, -3 * r);\n    context.lineTo(r, -3 * r);\n    context.lineTo(r, -r);\n    context.lineTo(3 * r, -r);\n    context.lineTo(3 * r, r);\n    context.lineTo(r, r);\n    context.lineTo(r, 3 * r);\n    context.lineTo(-r, 3 * r);\n    context.lineTo(-r, r);\n    context.lineTo(-3 * r, r);\n    context.closePath();\n  }\n};\n","var tan30 = Math.sqrt(1 / 3),\n    tan30_2 = tan30 * 2;\n\nexport default {\n  draw: function(context, size) {\n    var y = Math.sqrt(size / tan30_2),\n        x = y * tan30;\n    context.moveTo(0, -y);\n    context.lineTo(x, 0);\n    context.lineTo(0, y);\n    context.lineTo(-x, 0);\n    context.closePath();\n  }\n};\n","export default {\n  draw: function(context, size) {\n    var w = Math.sqrt(size),\n        x = -w / 2;\n    context.rect(x, x, w, w);\n  }\n};\n","import {pi, tau} from \"../math.js\";\n\nvar ka = 0.89081309152928522810,\n    kr = Math.sin(pi / 10) / Math.sin(7 * pi / 10),\n    kx = Math.sin(tau / 10) * kr,\n    ky = -Math.cos(tau / 10) * kr;\n\nexport default {\n  draw: function(context, size) {\n    var r = Math.sqrt(size * ka),\n        x = kx * r,\n        y = ky * r;\n    context.moveTo(0, -r);\n    context.lineTo(x, y);\n    for (var i = 1; i < 5; ++i) {\n      var a = tau * i / 5,\n          c = Math.cos(a),\n          s = Math.sin(a);\n      context.lineTo(s * r, -c * r);\n      context.lineTo(c * x - s * y, s * x + c * y);\n    }\n    context.closePath();\n  }\n};\n","var sqrt3 = Math.sqrt(3);\n\nexport default {\n  draw: function(context, size) {\n    var y = -Math.sqrt(size / (sqrt3 * 3));\n    context.moveTo(0, y * 2);\n    context.lineTo(-sqrt3 * y, -y);\n    context.lineTo(sqrt3 * y, -y);\n    context.closePath();\n  }\n};\n","var c = -0.5,\n    s = Math.sqrt(3) / 2,\n    k = 1 / Math.sqrt(12),\n    a = (k / 2 + 1) * 3;\n\nexport default {\n  draw: function(context, size) {\n    var r = Math.sqrt(size / a),\n        x0 = r / 2,\n        y0 = r * k,\n        x1 = x0,\n        y1 = r * k + r,\n        x2 = -x1,\n        y2 = y1;\n    context.moveTo(x0, y0);\n    context.lineTo(x1, y1);\n    context.lineTo(x2, y2);\n    context.lineTo(c * x0 - s * y0, s * x0 + c * y0);\n    context.lineTo(c * x1 - s * y1, s * x1 + c * y1);\n    context.lineTo(c * x2 - s * y2, s * x2 + c * y2);\n    context.lineTo(c * x0 + s * y0, c * y0 - s * x0);\n    context.lineTo(c * x1 + s * y1, c * y1 - s * x1);\n    context.lineTo(c * x2 + s * y2, c * y2 - s * x2);\n    context.closePath();\n  }\n};\n","import formatLocale from \"./locale.js\";\n\nvar locale;\nexport var timeFormat;\nexport var timeParse;\nexport var utcFormat;\nexport var utcParse;\n\ndefaultLocale({\n  dateTime: \"%x, %X\",\n  date: \"%-m/%-d/%Y\",\n  time: \"%-I:%M:%S %p\",\n  periods: [\"AM\", \"PM\"],\n  days: [\"Sunday\", \"Monday\", \"Tuesday\", \"Wednesday\", \"Thursday\", \"Friday\", \"Saturday\"],\n  shortDays: [\"Sun\", \"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\"],\n  months: [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"],\n  shortMonths: [\"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\", \"Jul\", \"Aug\", \"Sep\", \"Oct\", \"Nov\", \"Dec\"]\n});\n\nexport default function defaultLocale(definition) {\n  locale = formatLocale(definition);\n  timeFormat = locale.format;\n  timeParse = locale.parse;\n  utcFormat = locale.utcFormat;\n  utcParse = locale.utcParse;\n  return locale;\n}\n","export {default as timeFormatDefaultLocale, timeFormat, timeParse, utcFormat, utcParse} from \"./defaultLocale.js\";\nexport {default as timeFormatLocale} from \"./locale.js\";\nexport {default as isoFormat} from \"./isoFormat.js\";\nexport {default as isoParse} from \"./isoParse.js\";\n","import {utcFormat} from \"./defaultLocale.js\";\n\nexport var isoSpecifier = \"%Y-%m-%dT%H:%M:%S.%LZ\";\n\nfunction formatIsoNative(date) {\n  return date.toISOString();\n}\n\nvar formatIso = Date.prototype.toISOString\n    ? formatIsoNative\n    : utcFormat(isoSpecifier);\n\nexport default formatIso;\n","import {isoSpecifier} from \"./isoFormat.js\";\nimport {utcParse} from \"./defaultLocale.js\";\n\nfunction parseIsoNative(string) {\n  var date = new Date(string);\n  return isNaN(date) ? null : date;\n}\n\nvar parseIso = +new Date(\"2000-01-01T00:00:00.000Z\")\n    ? parseIsoNative\n    : utcParse(isoSpecifier);\n\nexport default parseIso;\n","import {\n  timeDay,\n  timeSunday,\n  timeMonday,\n  timeThursday,\n  timeYear,\n  utcDay,\n  utcSunday,\n  utcMonday,\n  utcThursday,\n  utcYear\n} from \"d3-time\";\n\nfunction localDate(d) {\n  if (0 <= d.y && d.y < 100) {\n    var date = new Date(-1, d.m, d.d, d.H, d.M, d.S, d.L);\n    date.setFullYear(d.y);\n    return date;\n  }\n  return new Date(d.y, d.m, d.d, d.H, d.M, d.S, d.L);\n}\n\nfunction utcDate(d) {\n  if (0 <= d.y && d.y < 100) {\n    var date = new Date(Date.UTC(-1, d.m, d.d, d.H, d.M, d.S, d.L));\n    date.setUTCFullYear(d.y);\n    return date;\n  }\n  return new Date(Date.UTC(d.y, d.m, d.d, d.H, d.M, d.S, d.L));\n}\n\nfunction newDate(y, m, d) {\n  return {y: y, m: m, d: d, H: 0, M: 0, S: 0, L: 0};\n}\n\nexport default function formatLocale(locale) {\n  var locale_dateTime = locale.dateTime,\n      locale_date = locale.date,\n      locale_time = locale.time,\n      locale_periods = locale.periods,\n      locale_weekdays = locale.days,\n      locale_shortWeekdays = locale.shortDays,\n      locale_months = locale.months,\n      locale_shortMonths = locale.shortMonths;\n\n  var periodRe = formatRe(locale_periods),\n      periodLookup = formatLookup(locale_periods),\n      weekdayRe = formatRe(locale_weekdays),\n      weekdayLookup = formatLookup(locale_weekdays),\n      shortWeekdayRe = formatRe(locale_shortWeekdays),\n      shortWeekdayLookup = formatLookup(locale_shortWeekdays),\n      monthRe = formatRe(locale_months),\n      monthLookup = formatLookup(locale_months),\n      shortMonthRe = formatRe(locale_shortMonths),\n      shortMonthLookup = formatLookup(locale_shortMonths);\n\n  var formats = {\n    \"a\": formatShortWeekday,\n    \"A\": formatWeekday,\n    \"b\": formatShortMonth,\n    \"B\": formatMonth,\n    \"c\": null,\n    \"d\": formatDayOfMonth,\n    \"e\": formatDayOfMonth,\n    \"f\": formatMicroseconds,\n    \"H\": formatHour24,\n    \"I\": formatHour12,\n    \"j\": formatDayOfYear,\n    \"L\": formatMilliseconds,\n    \"m\": formatMonthNumber,\n    \"M\": formatMinutes,\n    \"p\": formatPeriod,\n    \"q\": formatQuarter,\n    \"Q\": formatUnixTimestamp,\n    \"s\": formatUnixTimestampSeconds,\n    \"S\": formatSeconds,\n    \"u\": formatWeekdayNumberMonday,\n    \"U\": formatWeekNumberSunday,\n    \"V\": formatWeekNumberISO,\n    \"w\": formatWeekdayNumberSunday,\n    \"W\": formatWeekNumberMonday,\n    \"x\": null,\n    \"X\": null,\n    \"y\": formatYear,\n    \"Y\": formatFullYear,\n    \"Z\": formatZone,\n    \"%\": formatLiteralPercent\n  };\n\n  var utcFormats = {\n    \"a\": formatUTCShortWeekday,\n    \"A\": formatUTCWeekday,\n    \"b\": formatUTCShortMonth,\n    \"B\": formatUTCMonth,\n    \"c\": null,\n    \"d\": formatUTCDayOfMonth,\n    \"e\": formatUTCDayOfMonth,\n    \"f\": formatUTCMicroseconds,\n    \"H\": formatUTCHour24,\n    \"I\": formatUTCHour12,\n    \"j\": formatUTCDayOfYear,\n    \"L\": formatUTCMilliseconds,\n    \"m\": formatUTCMonthNumber,\n    \"M\": formatUTCMinutes,\n    \"p\": formatUTCPeriod,\n    \"q\": formatUTCQuarter,\n    \"Q\": formatUnixTimestamp,\n    \"s\": formatUnixTimestampSeconds,\n    \"S\": formatUTCSeconds,\n    \"u\": formatUTCWeekdayNumberMonday,\n    \"U\": formatUTCWeekNumberSunday,\n    \"V\": formatUTCWeekNumberISO,\n    \"w\": formatUTCWeekdayNumberSunday,\n    \"W\": formatUTCWeekNumberMonday,\n    \"x\": null,\n    \"X\": null,\n    \"y\": formatUTCYear,\n    \"Y\": formatUTCFullYear,\n    \"Z\": formatUTCZone,\n    \"%\": formatLiteralPercent\n  };\n\n  var parses = {\n    \"a\": parseShortWeekday,\n    \"A\": parseWeekday,\n    \"b\": parseShortMonth,\n    \"B\": parseMonth,\n    \"c\": parseLocaleDateTime,\n    \"d\": parseDayOfMonth,\n    \"e\": parseDayOfMonth,\n    \"f\": parseMicroseconds,\n    \"H\": parseHour24,\n    \"I\": parseHour24,\n    \"j\": parseDayOfYear,\n    \"L\": parseMilliseconds,\n    \"m\": parseMonthNumber,\n    \"M\": parseMinutes,\n    \"p\": parsePeriod,\n    \"q\": parseQuarter,\n    \"Q\": parseUnixTimestamp,\n    \"s\": parseUnixTimestampSeconds,\n    \"S\": parseSeconds,\n    \"u\": parseWeekdayNumberMonday,\n    \"U\": parseWeekNumberSunday,\n    \"V\": parseWeekNumberISO,\n    \"w\": parseWeekdayNumberSunday,\n    \"W\": parseWeekNumberMonday,\n    \"x\": parseLocaleDate,\n    \"X\": parseLocaleTime,\n    \"y\": parseYear,\n    \"Y\": parseFullYear,\n    \"Z\": parseZone,\n    \"%\": parseLiteralPercent\n  };\n\n  // These recursive directive definitions must be deferred.\n  formats.x = newFormat(locale_date, formats);\n  formats.X = newFormat(locale_time, formats);\n  formats.c = newFormat(locale_dateTime, formats);\n  utcFormats.x = newFormat(locale_date, utcFormats);\n  utcFormats.X = newFormat(locale_time, utcFormats);\n  utcFormats.c = newFormat(locale_dateTime, utcFormats);\n\n  function newFormat(specifier, formats) {\n    return function(date) {\n      var string = [],\n          i = -1,\n          j = 0,\n          n = specifier.length,\n          c,\n          pad,\n          format;\n\n      if (!(date instanceof Date)) date = new Date(+date);\n\n      while (++i < n) {\n        if (specifier.charCodeAt(i) === 37) {\n          string.push(specifier.slice(j, i));\n          if ((pad = pads[c = specifier.charAt(++i)]) != null) c = specifier.charAt(++i);\n          else pad = c === \"e\" ? \" \" : \"0\";\n          if (format = formats[c]) c = format(date, pad);\n          string.push(c);\n          j = i + 1;\n        }\n      }\n\n      string.push(specifier.slice(j, i));\n      return string.join(\"\");\n    };\n  }\n\n  function newParse(specifier, Z) {\n    return function(string) {\n      var d = newDate(1900, undefined, 1),\n          i = parseSpecifier(d, specifier, string += \"\", 0),\n          week, day;\n      if (i != string.length) return null;\n\n      // If a UNIX timestamp is specified, return it.\n      if (\"Q\" in d) return new Date(d.Q);\n      if (\"s\" in d) return new Date(d.s * 1000 + (\"L\" in d ? d.L : 0));\n\n      // If this is utcParse, never use the local timezone.\n      if (Z && !(\"Z\" in d)) d.Z = 0;\n\n      // The am-pm flag is 0 for AM, and 1 for PM.\n      if (\"p\" in d) d.H = d.H % 12 + d.p * 12;\n\n      // If the month was not specified, inherit from the quarter.\n      if (d.m === undefined) d.m = \"q\" in d ? d.q : 0;\n\n      // Convert day-of-week and week-of-year to day-of-year.\n      if (\"V\" in d) {\n        if (d.V < 1 || d.V > 53) return null;\n        if (!(\"w\" in d)) d.w = 1;\n        if (\"Z\" in d) {\n          week = utcDate(newDate(d.y, 0, 1)), day = week.getUTCDay();\n          week = day > 4 || day === 0 ? utcMonday.ceil(week) : utcMonday(week);\n          week = utcDay.offset(week, (d.V - 1) * 7);\n          d.y = week.getUTCFullYear();\n          d.m = week.getUTCMonth();\n          d.d = week.getUTCDate() + (d.w + 6) % 7;\n        } else {\n          week = localDate(newDate(d.y, 0, 1)), day = week.getDay();\n          week = day > 4 || day === 0 ? timeMonday.ceil(week) : timeMonday(week);\n          week = timeDay.offset(week, (d.V - 1) * 7);\n          d.y = week.getFullYear();\n          d.m = week.getMonth();\n          d.d = week.getDate() + (d.w + 6) % 7;\n        }\n      } else if (\"W\" in d || \"U\" in d) {\n        if (!(\"w\" in d)) d.w = \"u\" in d ? d.u % 7 : \"W\" in d ? 1 : 0;\n        day = \"Z\" in d ? utcDate(newDate(d.y, 0, 1)).getUTCDay() : localDate(newDate(d.y, 0, 1)).getDay();\n        d.m = 0;\n        d.d = \"W\" in d ? (d.w + 6) % 7 + d.W * 7 - (day + 5) % 7 : d.w + d.U * 7 - (day + 6) % 7;\n      }\n\n      // If a time zone is specified, all fields are interpreted as UTC and then\n      // offset according to the specified time zone.\n      if (\"Z\" in d) {\n        d.H += d.Z / 100 | 0;\n        d.M += d.Z % 100;\n        return utcDate(d);\n      }\n\n      // Otherwise, all fields are in local time.\n      return localDate(d);\n    };\n  }\n\n  function parseSpecifier(d, specifier, string, j) {\n    var i = 0,\n        n = specifier.length,\n        m = string.length,\n        c,\n        parse;\n\n    while (i < n) {\n      if (j >= m) return -1;\n      c = specifier.charCodeAt(i++);\n      if (c === 37) {\n        c = specifier.charAt(i++);\n        parse = parses[c in pads ? specifier.charAt(i++) : c];\n        if (!parse || ((j = parse(d, string, j)) < 0)) return -1;\n      } else if (c != string.charCodeAt(j++)) {\n        return -1;\n      }\n    }\n\n    return j;\n  }\n\n  function parsePeriod(d, string, i) {\n    var n = periodRe.exec(string.slice(i));\n    return n ? (d.p = periodLookup[n[0].toLowerCase()], i + n[0].length) : -1;\n  }\n\n  function parseShortWeekday(d, string, i) {\n    var n = shortWeekdayRe.exec(string.slice(i));\n    return n ? (d.w = shortWeekdayLookup[n[0].toLowerCase()], i + n[0].length) : -1;\n  }\n\n  function parseWeekday(d, string, i) {\n    var n = weekdayRe.exec(string.slice(i));\n    return n ? (d.w = weekdayLookup[n[0].toLowerCase()], i + n[0].length) : -1;\n  }\n\n  function parseShortMonth(d, string, i) {\n    var n = shortMonthRe.exec(string.slice(i));\n    return n ? (d.m = shortMonthLookup[n[0].toLowerCase()], i + n[0].length) : -1;\n  }\n\n  function parseMonth(d, string, i) {\n    var n = monthRe.exec(string.slice(i));\n    return n ? (d.m = monthLookup[n[0].toLowerCase()], i + n[0].length) : -1;\n  }\n\n  function parseLocaleDateTime(d, string, i) {\n    return parseSpecifier(d, locale_dateTime, string, i);\n  }\n\n  function parseLocaleDate(d, string, i) {\n    return parseSpecifier(d, locale_date, string, i);\n  }\n\n  function parseLocaleTime(d, string, i) {\n    return parseSpecifier(d, locale_time, string, i);\n  }\n\n  function formatShortWeekday(d) {\n    return locale_shortWeekdays[d.getDay()];\n  }\n\n  function formatWeekday(d) {\n    return locale_weekdays[d.getDay()];\n  }\n\n  function formatShortMonth(d) {\n    return locale_shortMonths[d.getMonth()];\n  }\n\n  function formatMonth(d) {\n    return locale_months[d.getMonth()];\n  }\n\n  function formatPeriod(d) {\n    return locale_periods[+(d.getHours() >= 12)];\n  }\n\n  function formatQuarter(d) {\n    return 1 + ~~(d.getMonth() / 3);\n  }\n\n  function formatUTCShortWeekday(d) {\n    return locale_shortWeekdays[d.getUTCDay()];\n  }\n\n  function formatUTCWeekday(d) {\n    return locale_weekdays[d.getUTCDay()];\n  }\n\n  function formatUTCShortMonth(d) {\n    return locale_shortMonths[d.getUTCMonth()];\n  }\n\n  function formatUTCMonth(d) {\n    return locale_months[d.getUTCMonth()];\n  }\n\n  function formatUTCPeriod(d) {\n    return locale_periods[+(d.getUTCHours() >= 12)];\n  }\n\n  function formatUTCQuarter(d) {\n    return 1 + ~~(d.getUTCMonth() / 3);\n  }\n\n  return {\n    format: function(specifier) {\n      var f = newFormat(specifier += \"\", formats);\n      f.toString = function() { return specifier; };\n      return f;\n    },\n    parse: function(specifier) {\n      var p = newParse(specifier += \"\", false);\n      p.toString = function() { return specifier; };\n      return p;\n    },\n    utcFormat: function(specifier) {\n      var f = newFormat(specifier += \"\", utcFormats);\n      f.toString = function() { return specifier; };\n      return f;\n    },\n    utcParse: function(specifier) {\n      var p = newParse(specifier += \"\", true);\n      p.toString = function() { return specifier; };\n      return p;\n    }\n  };\n}\n\nvar pads = {\"-\": \"\", \"_\": \" \", \"0\": \"0\"},\n    numberRe = /^\\s*\\d+/, // note: ignores next directive\n    percentRe = /^%/,\n    requoteRe = /[\\\\^$*+?|[\\]().{}]/g;\n\nfunction pad(value, fill, width) {\n  var sign = value < 0 ? \"-\" : \"\",\n      string = (sign ? -value : value) + \"\",\n      length = string.length;\n  return sign + (length < width ? new Array(width - length + 1).join(fill) + string : string);\n}\n\nfunction requote(s) {\n  return s.replace(requoteRe, \"\\\\$&\");\n}\n\nfunction formatRe(names) {\n  return new RegExp(\"^(?:\" + names.map(requote).join(\"|\") + \")\", \"i\");\n}\n\nfunction formatLookup(names) {\n  var map = {}, i = -1, n = names.length;\n  while (++i < n) map[names[i].toLowerCase()] = i;\n  return map;\n}\n\nfunction parseWeekdayNumberSunday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 1));\n  return n ? (d.w = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekdayNumberMonday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 1));\n  return n ? (d.u = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekNumberSunday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.U = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekNumberISO(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.V = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekNumberMonday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.W = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseFullYear(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 4));\n  return n ? (d.y = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseYear(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.y = +n[0] + (+n[0] > 68 ? 1900 : 2000), i + n[0].length) : -1;\n}\n\nfunction parseZone(d, string, i) {\n  var n = /^(Z)|([+-]\\d\\d)(?::?(\\d\\d))?/.exec(string.slice(i, i + 6));\n  return n ? (d.Z = n[1] ? 0 : -(n[2] + (n[3] || \"00\")), i + n[0].length) : -1;\n}\n\nfunction parseQuarter(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 1));\n  return n ? (d.q = n[0] * 3 - 3, i + n[0].length) : -1;\n}\n\nfunction parseMonthNumber(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.m = n[0] - 1, i + n[0].length) : -1;\n}\n\nfunction parseDayOfMonth(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.d = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseDayOfYear(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 3));\n  return n ? (d.m = 0, d.d = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseHour24(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.H = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseMinutes(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.M = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseSeconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.S = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseMilliseconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 3));\n  return n ? (d.L = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseMicroseconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 6));\n  return n ? (d.L = Math.floor(n[0] / 1000), i + n[0].length) : -1;\n}\n\nfunction parseLiteralPercent(d, string, i) {\n  var n = percentRe.exec(string.slice(i, i + 1));\n  return n ? i + n[0].length : -1;\n}\n\nfunction parseUnixTimestamp(d, string, i) {\n  var n = numberRe.exec(string.slice(i));\n  return n ? (d.Q = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseUnixTimestampSeconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i));\n  return n ? (d.s = +n[0], i + n[0].length) : -1;\n}\n\nfunction formatDayOfMonth(d, p) {\n  return pad(d.getDate(), p, 2);\n}\n\nfunction formatHour24(d, p) {\n  return pad(d.getHours(), p, 2);\n}\n\nfunction formatHour12(d, p) {\n  return pad(d.getHours() % 12 || 12, p, 2);\n}\n\nfunction formatDayOfYear(d, p) {\n  return pad(1 + timeDay.count(timeYear(d), d), p, 3);\n}\n\nfunction formatMilliseconds(d, p) {\n  return pad(d.getMilliseconds(), p, 3);\n}\n\nfunction formatMicroseconds(d, p) {\n  return formatMilliseconds(d, p) + \"000\";\n}\n\nfunction formatMonthNumber(d, p) {\n  return pad(d.getMonth() + 1, p, 2);\n}\n\nfunction formatMinutes(d, p) {\n  return pad(d.getMinutes(), p, 2);\n}\n\nfunction formatSeconds(d, p) {\n  return pad(d.getSeconds(), p, 2);\n}\n\nfunction formatWeekdayNumberMonday(d) {\n  var day = d.getDay();\n  return day === 0 ? 7 : day;\n}\n\nfunction formatWeekNumberSunday(d, p) {\n  return pad(timeSunday.count(timeYear(d) - 1, d), p, 2);\n}\n\nfunction formatWeekNumberISO(d, p) {\n  var day = d.getDay();\n  d = (day >= 4 || day === 0) ? timeThursday(d) : timeThursday.ceil(d);\n  return pad(timeThursday.count(timeYear(d), d) + (timeYear(d).getDay() === 4), p, 2);\n}\n\nfunction formatWeekdayNumberSunday(d) {\n  return d.getDay();\n}\n\nfunction formatWeekNumberMonday(d, p) {\n  return pad(timeMonday.count(timeYear(d) - 1, d), p, 2);\n}\n\nfunction formatYear(d, p) {\n  return pad(d.getFullYear() % 100, p, 2);\n}\n\nfunction formatFullYear(d, p) {\n  return pad(d.getFullYear() % 10000, p, 4);\n}\n\nfunction formatZone(d) {\n  var z = d.getTimezoneOffset();\n  return (z > 0 ? \"-\" : (z *= -1, \"+\"))\n      + pad(z / 60 | 0, \"0\", 2)\n      + pad(z % 60, \"0\", 2);\n}\n\nfunction formatUTCDayOfMonth(d, p) {\n  return pad(d.getUTCDate(), p, 2);\n}\n\nfunction formatUTCHour24(d, p) {\n  return pad(d.getUTCHours(), p, 2);\n}\n\nfunction formatUTCHour12(d, p) {\n  return pad(d.getUTCHours() % 12 || 12, p, 2);\n}\n\nfunction formatUTCDayOfYear(d, p) {\n  return pad(1 + utcDay.count(utcYear(d), d), p, 3);\n}\n\nfunction formatUTCMilliseconds(d, p) {\n  return pad(d.getUTCMilliseconds(), p, 3);\n}\n\nfunction formatUTCMicroseconds(d, p) {\n  return formatUTCMilliseconds(d, p) + \"000\";\n}\n\nfunction formatUTCMonthNumber(d, p) {\n  return pad(d.getUTCMonth() + 1, p, 2);\n}\n\nfunction formatUTCMinutes(d, p) {\n  return pad(d.getUTCMinutes(), p, 2);\n}\n\nfunction formatUTCSeconds(d, p) {\n  return pad(d.getUTCSeconds(), p, 2);\n}\n\nfunction formatUTCWeekdayNumberMonday(d) {\n  var dow = d.getUTCDay();\n  return dow === 0 ? 7 : dow;\n}\n\nfunction formatUTCWeekNumberSunday(d, p) {\n  return pad(utcSunday.count(utcYear(d) - 1, d), p, 2);\n}\n\nfunction formatUTCWeekNumberISO(d, p) {\n  var day = d.getUTCDay();\n  d = (day >= 4 || day === 0) ? utcThursday(d) : utcThursday.ceil(d);\n  return pad(utcThursday.count(utcYear(d), d) + (utcYear(d).getUTCDay() === 4), p, 2);\n}\n\nfunction formatUTCWeekdayNumberSunday(d) {\n  return d.getUTCDay();\n}\n\nfunction formatUTCWeekNumberMonday(d, p) {\n  return pad(utcMonday.count(utcYear(d) - 1, d), p, 2);\n}\n\nfunction formatUTCYear(d, p) {\n  return pad(d.getUTCFullYear() % 100, p, 2);\n}\n\nfunction formatUTCFullYear(d, p) {\n  return pad(d.getUTCFullYear() % 10000, p, 4);\n}\n\nfunction formatUTCZone() {\n  return \"+0000\";\n}\n\nfunction formatLiteralPercent() {\n  return \"%\";\n}\n\nfunction formatUnixTimestamp(d) {\n  return +d;\n}\n\nfunction formatUnixTimestampSeconds(d) {\n  return Math.floor(+d / 1000);\n}\n","import interval from \"./interval.js\";\nimport {durationDay, durationMinute} from \"./duration.js\";\n\nvar day = interval(function(date) {\n  date.setHours(0, 0, 0, 0);\n}, function(date, step) {\n  date.setDate(date.getDate() + step);\n}, function(start, end) {\n  return (end - start - (end.getTimezoneOffset() - start.getTimezoneOffset()) * durationMinute) / durationDay;\n}, function(date) {\n  return date.getDate() - 1;\n});\n\nexport default day;\nexport var days = day.range;\n","export var durationSecond = 1e3;\nexport var durationMinute = 6e4;\nexport var durationHour = 36e5;\nexport var durationDay = 864e5;\nexport var durationWeek = 6048e5;\n","import interval from \"./interval.js\";\nimport {durationHour, durationMinute, durationSecond} from \"./duration.js\";\n\nvar hour = interval(function(date) {\n  date.setTime(date - date.getMilliseconds() - date.getSeconds() * durationSecond - date.getMinutes() * durationMinute);\n}, function(date, step) {\n  date.setTime(+date + step * durationHour);\n}, function(start, end) {\n  return (end - start) / durationHour;\n}, function(date) {\n  return date.getHours();\n});\n\nexport default hour;\nexport var hours = hour.range;\n","export {\n  default as timeInterval\n} from \"./interval.js\";\n\nexport {\n  default as timeMillisecond,\n  milliseconds as timeMilliseconds,\n  default as utcMillisecond,\n  milliseconds as utcMilliseconds\n} from \"./millisecond.js\";\n\nexport {\n  default as timeSecond,\n  seconds as timeSeconds,\n  default as utcSecond,\n  seconds as utcSeconds\n} from \"./second.js\";\n\nexport {\n  default as timeMinute,\n  minutes as timeMinutes\n} from \"./minute.js\";\n\nexport {\n  default as timeHour,\n  hours as timeHours\n} from \"./hour.js\";\n\nexport {\n  default as timeDay,\n  days as timeDays\n} from \"./day.js\";\n\nexport {\n  sunday as timeWeek,\n  sundays as timeWeeks,\n  sunday as timeSunday,\n  sundays as timeSundays,\n  monday as timeMonday,\n  mondays as timeMondays,\n  tuesday as timeTuesday,\n  tuesdays as timeTuesdays,\n  wednesday as timeWednesday,\n  wednesdays as timeWednesdays,\n  thursday as timeThursday,\n  thursdays as timeThursdays,\n  friday as timeFriday,\n  fridays as timeFridays,\n  saturday as timeSaturday,\n  saturdays as timeSaturdays\n} from \"./week.js\";\n\nexport {\n  default as timeMonth,\n  months as timeMonths\n} from \"./month.js\";\n\nexport {\n  default as timeYear,\n  years as timeYears\n} from \"./year.js\";\n\nexport {\n  default as utcMinute,\n  utcMinutes as utcMinutes\n} from \"./utcMinute.js\";\n\nexport {\n  default as utcHour,\n  utcHours as utcHours\n} from \"./utcHour.js\";\n\nexport {\n  default as utcDay,\n  utcDays as utcDays\n} from \"./utcDay.js\";\n\nexport {\n  utcSunday as utcWeek,\n  utcSundays as utcWeeks,\n  utcSunday as utcSunday,\n  utcSundays as utcSundays,\n  utcMonday as utcMonday,\n  utcMondays as utcMondays,\n  utcTuesday as utcTuesday,\n  utcTuesdays as utcTuesdays,\n  utcWednesday as utcWednesday,\n  utcWednesdays as utcWednesdays,\n  utcThursday as utcThursday,\n  utcThursdays as utcThursdays,\n  utcFriday as utcFriday,\n  utcFridays as utcFridays,\n  utcSaturday as utcSaturday,\n  utcSaturdays as utcSaturdays\n} from \"./utcWeek.js\";\n\nexport {\n  default as utcMonth,\n  utcMonths as utcMonths\n} from \"./utcMonth.js\";\n\nexport {\n  default as utcYear,\n  utcYears as utcYears\n} from \"./utcYear.js\";\n","var t0 = new Date,\n    t1 = new Date;\n\nexport default function newInterval(floori, offseti, count, field) {\n\n  function interval(date) {\n    return floori(date = arguments.length === 0 ? new Date : new Date(+date)), date;\n  }\n\n  interval.floor = function(date) {\n    return floori(date = new Date(+date)), date;\n  };\n\n  interval.ceil = function(date) {\n    return floori(date = new Date(date - 1)), offseti(date, 1), floori(date), date;\n  };\n\n  interval.round = function(date) {\n    var d0 = interval(date),\n        d1 = interval.ceil(date);\n    return date - d0 < d1 - date ? d0 : d1;\n  };\n\n  interval.offset = function(date, step) {\n    return offseti(date = new Date(+date), step == null ? 1 : Math.floor(step)), date;\n  };\n\n  interval.range = function(start, stop, step) {\n    var range = [], previous;\n    start = interval.ceil(start);\n    step = step == null ? 1 : Math.floor(step);\n    if (!(start < stop) || !(step > 0)) return range; // also handles Invalid Date\n    do range.push(previous = new Date(+start)), offseti(start, step), floori(start);\n    while (previous < start && start < stop);\n    return range;\n  };\n\n  interval.filter = function(test) {\n    return newInterval(function(date) {\n      if (date >= date) while (floori(date), !test(date)) date.setTime(date - 1);\n    }, function(date, step) {\n      if (date >= date) {\n        if (step < 0) while (++step <= 0) {\n          while (offseti(date, -1), !test(date)) {} // eslint-disable-line no-empty\n        } else while (--step >= 0) {\n          while (offseti(date, +1), !test(date)) {} // eslint-disable-line no-empty\n        }\n      }\n    });\n  };\n\n  if (count) {\n    interval.count = function(start, end) {\n      t0.setTime(+start), t1.setTime(+end);\n      floori(t0), floori(t1);\n      return Math.floor(count(t0, t1));\n    };\n\n    interval.every = function(step) {\n      step = Math.floor(step);\n      return !isFinite(step) || !(step > 0) ? null\n          : !(step > 1) ? interval\n          : interval.filter(field\n              ? function(d) { return field(d) % step === 0; }\n              : function(d) { return interval.count(0, d) % step === 0; });\n    };\n  }\n\n  return interval;\n}\n","import interval from \"./interval.js\";\n\nvar millisecond = interval(function() {\n  // noop\n}, function(date, step) {\n  date.setTime(+date + step);\n}, function(start, end) {\n  return end - start;\n});\n\n// An optimized implementation for this simple case.\nmillisecond.every = function(k) {\n  k = Math.floor(k);\n  if (!isFinite(k) || !(k > 0)) return null;\n  if (!(k > 1)) return millisecond;\n  return interval(function(date) {\n    date.setTime(Math.floor(date / k) * k);\n  }, function(date, step) {\n    date.setTime(+date + step * k);\n  }, function(start, end) {\n    return (end - start) / k;\n  });\n};\n\nexport default millisecond;\nexport var milliseconds = millisecond.range;\n","import interval from \"./interval.js\";\nimport {durationMinute, durationSecond} from \"./duration.js\";\n\nvar minute = interval(function(date) {\n  date.setTime(date - date.getMilliseconds() - date.getSeconds() * durationSecond);\n}, function(date, step) {\n  date.setTime(+date + step * durationMinute);\n}, function(start, end) {\n  return (end - start) / durationMinute;\n}, function(date) {\n  return date.getMinutes();\n});\n\nexport default minute;\nexport var minutes = minute.range;\n","import interval from \"./interval.js\";\n\nvar month = interval(function(date) {\n  date.setDate(1);\n  date.setHours(0, 0, 0, 0);\n}, function(date, step) {\n  date.setMonth(date.getMonth() + step);\n}, function(start, end) {\n  return end.getMonth() - start.getMonth() + (end.getFullYear() - start.getFullYear()) * 12;\n}, function(date) {\n  return date.getMonth();\n});\n\nexport default month;\nexport var months = month.range;\n","import interval from \"./interval.js\";\nimport {durationSecond} from \"./duration.js\";\n\nvar second = interval(function(date) {\n  date.setTime(date - date.getMilliseconds());\n}, function(date, step) {\n  date.setTime(+date + step * durationSecond);\n}, function(start, end) {\n  return (end - start) / durationSecond;\n}, function(date) {\n  return date.getUTCSeconds();\n});\n\nexport default second;\nexport var seconds = second.range;\n","import interval from \"./interval.js\";\nimport {durationDay} from \"./duration.js\";\n\nvar utcDay = interval(function(date) {\n  date.setUTCHours(0, 0, 0, 0);\n}, function(date, step) {\n  date.setUTCDate(date.getUTCDate() + step);\n}, function(start, end) {\n  return (end - start) / durationDay;\n}, function(date) {\n  return date.getUTCDate() - 1;\n});\n\nexport default utcDay;\nexport var utcDays = utcDay.range;\n","import interval from \"./interval.js\";\nimport {durationHour} from \"./duration.js\";\n\nvar utcHour = interval(function(date) {\n  date.setUTCMinutes(0, 0, 0);\n}, function(date, step) {\n  date.setTime(+date + step * durationHour);\n}, function(start, end) {\n  return (end - start) / durationHour;\n}, function(date) {\n  return date.getUTCHours();\n});\n\nexport default utcHour;\nexport var utcHours = utcHour.range;\n","import interval from \"./interval.js\";\nimport {durationMinute} from \"./duration.js\";\n\nvar utcMinute = interval(function(date) {\n  date.setUTCSeconds(0, 0);\n}, function(date, step) {\n  date.setTime(+date + step * durationMinute);\n}, function(start, end) {\n  return (end - start) / durationMinute;\n}, function(date) {\n  return date.getUTCMinutes();\n});\n\nexport default utcMinute;\nexport var utcMinutes = utcMinute.range;\n","import interval from \"./interval.js\";\n\nvar utcMonth = interval(function(date) {\n  date.setUTCDate(1);\n  date.setUTCHours(0, 0, 0, 0);\n}, function(date, step) {\n  date.setUTCMonth(date.getUTCMonth() + step);\n}, function(start, end) {\n  return end.getUTCMonth() - start.getUTCMonth() + (end.getUTCFullYear() - start.getUTCFullYear()) * 12;\n}, function(date) {\n  return date.getUTCMonth();\n});\n\nexport default utcMonth;\nexport var utcMonths = utcMonth.range;\n","import interval from \"./interval.js\";\nimport {durationWeek} from \"./duration.js\";\n\nfunction utcWeekday(i) {\n  return interval(function(date) {\n    date.setUTCDate(date.getUTCDate() - (date.getUTCDay() + 7 - i) % 7);\n    date.setUTCHours(0, 0, 0, 0);\n  }, function(date, step) {\n    date.setUTCDate(date.getUTCDate() + step * 7);\n  }, function(start, end) {\n    return (end - start) / durationWeek;\n  });\n}\n\nexport var utcSunday = utcWeekday(0);\nexport var utcMonday = utcWeekday(1);\nexport var utcTuesday = utcWeekday(2);\nexport var utcWednesday = utcWeekday(3);\nexport var utcThursday = utcWeekday(4);\nexport var utcFriday = utcWeekday(5);\nexport var utcSaturday = utcWeekday(6);\n\nexport var utcSundays = utcSunday.range;\nexport var utcMondays = utcMonday.range;\nexport var utcTuesdays = utcTuesday.range;\nexport var utcWednesdays = utcWednesday.range;\nexport var utcThursdays = utcThursday.range;\nexport var utcFridays = utcFriday.range;\nexport var utcSaturdays = utcSaturday.range;\n","import interval from \"./interval.js\";\n\nvar utcYear = interval(function(date) {\n  date.setUTCMonth(0, 1);\n  date.setUTCHours(0, 0, 0, 0);\n}, function(date, step) {\n  date.setUTCFullYear(date.getUTCFullYear() + step);\n}, function(start, end) {\n  return end.getUTCFullYear() - start.getUTCFullYear();\n}, function(date) {\n  return date.getUTCFullYear();\n});\n\n// An optimized implementation for this simple case.\nutcYear.every = function(k) {\n  return !isFinite(k = Math.floor(k)) || !(k > 0) ? null : interval(function(date) {\n    date.setUTCFullYear(Math.floor(date.getUTCFullYear() / k) * k);\n    date.setUTCMonth(0, 1);\n    date.setUTCHours(0, 0, 0, 0);\n  }, function(date, step) {\n    date.setUTCFullYear(date.getUTCFullYear() + step * k);\n  });\n};\n\nexport default utcYear;\nexport var utcYears = utcYear.range;\n","import interval from \"./interval.js\";\nimport {durationMinute, durationWeek} from \"./duration.js\";\n\nfunction weekday(i) {\n  return interval(function(date) {\n    date.setDate(date.getDate() - (date.getDay() + 7 - i) % 7);\n    date.setHours(0, 0, 0, 0);\n  }, function(date, step) {\n    date.setDate(date.getDate() + step * 7);\n  }, function(start, end) {\n    return (end - start - (end.getTimezoneOffset() - start.getTimezoneOffset()) * durationMinute) / durationWeek;\n  });\n}\n\nexport var sunday = weekday(0);\nexport var monday = weekday(1);\nexport var tuesday = weekday(2);\nexport var wednesday = weekday(3);\nexport var thursday = weekday(4);\nexport var friday = weekday(5);\nexport var saturday = weekday(6);\n\nexport var sundays = sunday.range;\nexport var mondays = monday.range;\nexport var tuesdays = tuesday.range;\nexport var wednesdays = wednesday.range;\nexport var thursdays = thursday.range;\nexport var fridays = friday.range;\nexport var saturdays = saturday.range;\n","import interval from \"./interval.js\";\n\nvar year = interval(function(date) {\n  date.setMonth(0, 1);\n  date.setHours(0, 0, 0, 0);\n}, function(date, step) {\n  date.setFullYear(date.getFullYear() + step);\n}, function(start, end) {\n  return end.getFullYear() - start.getFullYear();\n}, function(date) {\n  return date.getFullYear();\n});\n\n// An optimized implementation for this simple case.\nyear.every = function(k) {\n  return !isFinite(k = Math.floor(k)) || !(k > 0) ? null : interval(function(date) {\n    date.setFullYear(Math.floor(date.getFullYear() / k) * k);\n    date.setMonth(0, 1);\n    date.setHours(0, 0, 0, 0);\n  }, function(date, step) {\n    date.setFullYear(date.getFullYear() + step * k);\n  });\n};\n\nexport default year;\nexport var years = year.range;\n","/*! decimal.js-light v2.5.0 https://github.com/MikeMcl/decimal.js-light/LICENCE */\r\n;(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js-light v2.5.0\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js-light\r\n   *  Copyright (c) 2018 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Expat Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The limit on the value of `precision`, and on the value of the first argument to\r\n    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  var MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    Decimal = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed during run-time using `Decimal.config`.\r\n\r\n      // The maximum number of significant digits of the result of a calculation or base conversion.\r\n      // E.g. `Decimal.config({ precision: 20 });`\r\n      precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n      // The rounding mode used by default by `toInteger`, `toDecimalPlaces`, `toExponential`,\r\n      // `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n      //\r\n      // ROUND_UP         0 Away from zero.\r\n      // ROUND_DOWN       1 Towards zero.\r\n      // ROUND_CEIL       2 Towards +Infinity.\r\n      // ROUND_FLOOR      3 Towards -Infinity.\r\n      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      //\r\n      // E.g.\r\n      // `Decimal.rounding = 4;`\r\n      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n      rounding: 4,                           // 0 to 8\r\n\r\n      // The exponent value at and beneath which `toString` returns exponential notation.\r\n      // JavaScript numbers: -7\r\n      toExpNeg: -7,                          // 0 to -MAX_E\r\n\r\n      // The exponent value at and above which `toString` returns exponential notation.\r\n      // JavaScript numbers: 21\r\n      toExpPos:  21,                         // 0 to MAX_E\r\n\r\n      // The natural logarithm of 10.\r\n      // 115 digits\r\n      LN10: '2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286'\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    exponentOutOfRange = decimalError + 'Exponent out of range: ',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    ONE,\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n    MAX_E = mathfloor(MAX_SAFE_INTEGER / LOG_BASE),    // 1286742750677284\r\n\r\n    // Decimal.prototype object\r\n    P = {};\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue                       abs\r\n   *  comparedTo                          cmp\r\n   *  decimalPlaces                       dp\r\n   *  dividedBy                           div\r\n   *  dividedToIntegerBy                  idiv\r\n   *  equals                              eq\r\n   *  exponent\r\n   *  greaterThan                         gt\r\n   *  greaterThanOrEqualTo                gte\r\n   *  isInteger                           isint\r\n   *  isNegative                          isneg\r\n   *  isPositive                          ispos\r\n   *  isZero\r\n   *  lessThan                            lt\r\n   *  lessThanOrEqualTo                   lte\r\n   *  logarithm                           log\r\n   *  minus                               sub\r\n   *  modulo                              mod\r\n   *  naturalExponential                  exp\r\n   *  naturalLogarithm                    ln\r\n   *  negated                             neg\r\n   *  plus                                add\r\n   *  precision                           sd\r\n   *  squareRoot                          sqrt\r\n   *  times                               mul\r\n   *  toDecimalPlaces                     todp\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toInteger                           toint\r\n   *  toNumber\r\n   *  toPower                             pow\r\n   *  toPrecision\r\n   *  toSignificantDigits                 tosd\r\n   *  toString\r\n   *  valueOf                             val\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of this Decimal.\r\n   *\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new this.constructor(this);\r\n    if (x.s) x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value\r\n   *\r\n   */\r\n  P.comparedTo = P.cmp = function (y) {\r\n    var i, j, xdL, ydL,\r\n      x = this;\r\n\r\n    y = new x.constructor(y);\r\n\r\n    // Signs differ?\r\n    if (x.s !== y.s) return x.s || -y.s;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ x.s < 0 ? 1 : -1;\r\n\r\n    xdL = x.d.length;\r\n    ydL = y.d.length;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n      if (x.d[i] !== y.d[i]) return x.d[i] > y.d[i] ^ x.s < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ x.s < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of decimal places of the value of this Decimal.\r\n   *\r\n   */\r\n  P.decimalPlaces = P.dp = function () {\r\n    var x = this,\r\n      w = x.d.length - 1,\r\n      dp = (w - x.e) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = x.d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) dp--;\r\n\r\n    return dp < 0 ? 0 : dp;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedBy = P.div = function (y) {\r\n    return divide(this, new this.constructor(y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n   * by the value of `y`, truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.idiv = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(divide(x, new Ctor(y), 0, 1), Ctor.precision);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.equals = P.eq = function (y) {\r\n    return !this.cmp(y);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the (base 10) exponent value of this Decimal (this.e is the base 10000000 exponent).\r\n   *\r\n   */\r\n  P.exponent = function () {\r\n    return getBase10Exponent(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n   * false.\r\n   *\r\n   */\r\n  P.greaterThan = P.gt = function (y) {\r\n    return this.cmp(y) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  P.greaterThanOrEqualTo = P.gte = function (y) {\r\n    return this.cmp(y) >= 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is an integer, otherwise return false.\r\n   *\r\n   */\r\n  P.isInteger = P.isint = function () {\r\n    return this.e > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is negative, otherwise return false.\r\n   *\r\n   */\r\n  P.isNegative = P.isneg = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is positive, otherwise return false.\r\n   *\r\n   */\r\n  P.isPositive = P.ispos = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is 0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return this.s === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThan = P.lt = function (y) {\r\n    return this.cmp(y) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n   *\r\n   */\r\n  P.lessThanOrEqualTo = P.lte = function (y) {\r\n    return this.cmp(y) < 1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the logarithm of the value of this Decimal to the specified base, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   * If no base is specified, return log[10](x).\r\n   *\r\n   * log[base](x) = ln(x) / ln(base)\r\n   *\r\n   * The maximum error of the result is 1 ulp (unit in the last place).\r\n   *\r\n   * [base] {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  P.logarithm = P.log = function (base) {\r\n    var r,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      wpr = pr + 5;\r\n\r\n    // Default base is 10.\r\n    if (base === void 0) {\r\n      base = new Ctor(10);\r\n    } else {\r\n      base = new Ctor(base);\r\n\r\n      // log[-b](x) = NaN\r\n      // log[0](x)  = NaN\r\n      // log[1](x)  = NaN\r\n      if (base.s < 1 || base.eq(ONE)) throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    // log[b](-x) = NaN\r\n    // log[b](0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // log[b](1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    external = false;\r\n    r = divide(ln(x, wpr), ln(base, wpr), wpr);\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? subtract(x, y) : add(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.modulo = P.mod = function (y) {\r\n    var q,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // x % 0 = NaN\r\n    if (!y.s) throw Error(decimalError + 'NaN');\r\n\r\n    // Return x if x is 0.\r\n    if (!x.s) return round(new Ctor(x), pr);\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n    q = divide(x, y, 0, 1).times(y);\r\n    external = true;\r\n\r\n    return x.minus(q);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n   * i.e. the base e raised to the power the value of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return exp(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return ln(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n   * -1.\r\n   *\r\n   */\r\n  P.negated = P.neg = function () {\r\n    var x = new this.constructor(this);\r\n    x.s = -x.s || 0;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var x = this;\r\n    y = new x.constructor(y);\r\n    return x.s == y.s ? add(x, y) : subtract(x, (y.s = -y.s, y));\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the number of significant digits of the value of this Decimal.\r\n   *\r\n   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n   *\r\n   */\r\n  P.precision = P.sd = function (z) {\r\n    var e, sd, w,\r\n      x = this;\r\n\r\n    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n    e = getBase10Exponent(x) + 1;\r\n    w = x.d.length - 1;\r\n    sd = w * LOG_BASE + 1;\r\n    w = x.d[w];\r\n\r\n    // If non-zero...\r\n    if (w) {\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      for (; w % 10 == 0; w /= 10) sd--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = x.d[0]; w >= 10; w /= 10) sd++;\r\n    }\r\n\r\n    return z && e > sd ? e : sd;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, truncated to `precision`\r\n   * significant digits.\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var e, n, pr, r, s, t, wpr,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative or zero?\r\n    if (x.s < 1) {\r\n      if (!x.s) return new Ctor(0);\r\n\r\n      // sqrt(-x) = NaN\r\n      throw Error(decimalError + 'NaN');\r\n    }\r\n\r\n    e = getBase10Exponent(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+x);\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(n);\r\n      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '1e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new Ctor(n);\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    pr = Ctor.precision;\r\n    s = wpr = pr + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, wpr + 2)).times(0.5);\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === (n = digitsToString(r.d)).slice(0, wpr)) {\r\n        n = n.slice(wpr - 3, wpr + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n        // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n        if (s == wpr && n == '4999') {\r\n\r\n          // On the first iteration only, check to see if rounding up gives the exact result as the\r\n          // nines may infinitely repeat.\r\n          round(t, pr + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        } else if (n != '9999') {\r\n          break;\r\n        }\r\n\r\n        wpr += 4;\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return round(r, pr);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal times `y`, truncated to\r\n   * `precision` significant digits.\r\n   *\r\n   */\r\n  P.times = P.mul = function (y) {\r\n    var carry, e, i, k, r, rL, t, xdL, ydL,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      xd = x.d,\r\n      yd = (y = new Ctor(y)).d;\r\n\r\n    // Return 0 if either is 0.\r\n    if (!x.s || !y.s) return new Ctor(0);\r\n\r\n    y.s *= x.s;\r\n    e = x.e + y.e;\r\n    xdL = xd.length;\r\n    ydL = yd.length;\r\n\r\n    // Ensure xd points to the longer array.\r\n    if (xdL < ydL) {\r\n      r = xd;\r\n      xd = yd;\r\n      yd = r;\r\n      rL = xdL;\r\n      xdL = ydL;\r\n      ydL = rL;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    r = [];\r\n    rL = xdL + ydL;\r\n    for (i = rL; i--;) r.push(0);\r\n\r\n    // Multiply!\r\n    for (i = ydL; --i >= 0;) {\r\n      carry = 0;\r\n      for (k = xdL + i; k > i;) {\r\n        t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n        r[k--] = t % BASE | 0;\r\n        carry = t / BASE | 0;\r\n      }\r\n\r\n      r[k] = (r[k] + carry) % BASE | 0;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; !r[--rL];) r.pop();\r\n\r\n    if (carry) ++e;\r\n    else r.shift();\r\n\r\n    y.d = r;\r\n    y.e = e;\r\n\r\n    return external ? round(y, Ctor.precision) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n   *\r\n   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toDecimalPlaces = P.todp = function (dp, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n    if (dp === void 0) return x;\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    return round(x, dp + getBase10Exponent(x) + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in exponential notation rounded to\r\n   * `dp` fixed decimal places using rounding mode `rounding`.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    var str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) {\r\n      str = toString(x, true);\r\n    } else {\r\n      checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), dp + 1, rm);\r\n      str = toString(x, true, dp + 1);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n   * omitted.\r\n   *\r\n   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n   * (-0).toFixed(3) is '0.000'.\r\n   * (-0.5).toFixed(0) is '-0'.\r\n   *\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    var str, y,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (dp === void 0) return toString(x);\r\n\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = round(new Ctor(x), dp + getBase10Exponent(x) + 1, rm);\r\n    str = toString(y.abs(), false, dp + getBase10Exponent(y) + 1);\r\n\r\n    // To determine whether to add the minus sign look at the value before it was rounded,\r\n    // i.e. look at `x` rather than `y`.\r\n    return x.isneg() && !x.isZero() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n   * rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.toInteger = P.toint = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return round(new Ctor(x), getBase10Exponent(x) + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   *\r\n   */\r\n  P.toNumber = function () {\r\n    return +this;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`,\r\n   * truncated to `precision` significant digits.\r\n   *\r\n   * For non-integer or very large exponents pow(x, y) is calculated using\r\n   *\r\n   *   x^y = exp(y*ln(x))\r\n   *\r\n   * The maximum error is 1 ulp (unit in last place).\r\n   *\r\n   * y {number|string|Decimal} The power to which to raise this Decimal.\r\n   *\r\n   */\r\n  P.toPower = P.pow = function (y) {\r\n    var e, k, pr, r, sign, yIsInt,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      guard = 12,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // pow(x, 0) = 1\r\n    if (!y.s) return new Ctor(ONE);\r\n\r\n    x = new Ctor(x);\r\n\r\n    // pow(0, y > 0) = 0\r\n    // pow(0, y < 0) = Infinity\r\n    if (!x.s) {\r\n      if (y.s < 1) throw Error(decimalError + 'Infinity');\r\n      return x;\r\n    }\r\n\r\n    // pow(1, y) = 1\r\n    if (x.eq(ONE)) return x;\r\n\r\n    pr = Ctor.precision;\r\n\r\n    // pow(x, 1) = x\r\n    if (y.eq(ONE)) return round(x, pr);\r\n\r\n    e = y.e;\r\n    k = y.d.length - 1;\r\n    yIsInt = e >= k;\r\n    sign = x.s;\r\n\r\n    if (!yIsInt) {\r\n\r\n      // pow(x < 0, y non-integer) = NaN\r\n      if (sign < 0) throw Error(decimalError + 'NaN');\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    } else if ((k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = new Ctor(ONE);\r\n\r\n      // Max k of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      e = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n      external = false;\r\n\r\n      for (;;) {\r\n        if (k % 2) {\r\n          r = r.times(x);\r\n          truncate(r.d, e);\r\n        }\r\n\r\n        k = mathfloor(k / 2);\r\n        if (k === 0) break;\r\n\r\n        x = x.times(x);\r\n        truncate(x.d, e);\r\n      }\r\n\r\n      external = true;\r\n\r\n      return y.s < 0 ? new Ctor(ONE).div(r) : round(r, pr);\r\n    }\r\n\r\n    // Result is negative if x is negative and the last digit of integer y is odd.\r\n    sign = sign < 0 && y.d[Math.max(e, k)] & 1 ? -1 : 1;\r\n\r\n    x.s = 1;\r\n    external = false;\r\n    r = y.times(ln(x, pr + guard));\r\n    external = true;\r\n    r = exp(r);\r\n    r.s = sign;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n   * the integer part of the value in normal notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    var e, str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n\r\n      x = round(new Ctor(x), sd, rm);\r\n      e = getBase10Exponent(x);\r\n      str = toString(x, sd <= e || e <= Ctor.toExpNeg, sd);\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n   * omitted.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   */\r\n  P.toSignificantDigits = P.tosd = function (sd, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    return round(new Ctor(x), sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   *\r\n   * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n   *\r\n   */\r\n  P.toString = P.valueOf = P.val = P.toJSON = function () {\r\n    var x = this,\r\n      e = getBase10Exponent(x),\r\n      Ctor = x.constructor;\r\n\r\n    return toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\r\n  };\r\n\r\n\r\n  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n  /*\r\n   *  add                 P.minus, P.plus\r\n   *  checkInt32          P.todp, P.toExponential, P.toFixed, P.toPrecision, P.tosd\r\n   *  digitsToString      P.log, P.sqrt, P.pow, toString, exp, ln\r\n   *  divide              P.div, P.idiv, P.log, P.mod, P.sqrt, exp, ln\r\n   *  exp                 P.exp, P.pow\r\n   *  getBase10Exponent   P.exponent, P.sd, P.toint, P.sqrt, P.todp, P.toFixed, P.toPrecision,\r\n   *                      P.toString, divide, round, toString, exp, ln\r\n   *  getLn10             P.log, ln\r\n   *  getZeroString       digitsToString, toString\r\n   *  ln                  P.log, P.ln, P.pow, exp\r\n   *  parseDecimal        Decimal\r\n   *  round               P.abs, P.idiv, P.log, P.minus, P.mod, P.neg, P.plus, P.toint, P.sqrt,\r\n   *                      P.times, P.todp, P.toExponential, P.toFixed, P.pow, P.toPrecision, P.tosd,\r\n   *                      divide, getLn10, exp, ln\r\n   *  subtract            P.minus, P.plus\r\n   *  toString            P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf\r\n   *  truncate            P.pow\r\n   *\r\n   *  Throws:             P.log, P.mod, P.sd, P.sqrt, P.pow,  checkInt32, divide, round,\r\n   *                      getLn10, exp, ln, parseDecimal, Decimal, config\r\n   */\r\n\r\n\r\n  function add(x, y) {\r\n    var carry, d, e, i, k, len, xd, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // If either is zero...\r\n    if (!x.s || !y.s) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!y.s) y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    k = x.e;\r\n    e = y.e;\r\n    xd = xd.slice();\r\n    i = k - e;\r\n\r\n    // If base 1e7 exponents differ...\r\n    if (i) {\r\n      if (i < 0) {\r\n        d = xd;\r\n        i = -i;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = k;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n      k = Math.ceil(pr / LOG_BASE);\r\n      len = k > len ? k + 1 : len + 1;\r\n\r\n      if (i > len) {\r\n        i = len;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n      d.reverse();\r\n      for (; i--;) d.push(0);\r\n      d.reverse();\r\n    }\r\n\r\n    len = xd.length;\r\n    i = yd.length;\r\n\r\n    // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n    if (len - i < 0) {\r\n      i = len;\r\n      d = yd;\r\n      yd = xd;\r\n      xd = d;\r\n    }\r\n\r\n    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n    for (carry = 0; i;) {\r\n      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n      xd[i] %= BASE;\r\n    }\r\n\r\n    if (carry) {\r\n      xd.unshift(carry);\r\n      ++e;\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function checkInt32(i, min, max) {\r\n    if (i !== ~~i || i < min || i > max) {\r\n      throw Error(invalidArgument + i);\r\n    }\r\n  }\r\n\r\n\r\n  function digitsToString(d) {\r\n    var i, k, ws,\r\n      indexOfLastWord = d.length - 1,\r\n      str = '',\r\n      w = d[0];\r\n\r\n    if (indexOfLastWord > 0) {\r\n      str += w;\r\n      for (i = 1; i < indexOfLastWord; i++) {\r\n        ws = d[i] + '';\r\n        k = LOG_BASE - ws.length;\r\n        if (k) str += getZeroString(k);\r\n        str += ws;\r\n      }\r\n\r\n      w = d[i];\r\n      ws = w + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n    } else if (w === 0) {\r\n      return '0';\r\n    }\r\n\r\n    // Remove trailing zeros of last w.\r\n    for (; w % 10 === 0;) w /= 10;\r\n\r\n    return str + w;\r\n  }\r\n\r\n\r\n  var divide = (function () {\r\n\r\n    // Assumes non-zero x and k, and hence non-zero result.\r\n    function multiplyInteger(x, k) {\r\n      var temp,\r\n        carry = 0,\r\n        i = x.length;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        temp = x[i] * k + carry;\r\n        x[i] = temp % BASE | 0;\r\n        carry = temp / BASE | 0;\r\n      }\r\n\r\n      if (carry) x.unshift(carry);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, r;\r\n\r\n      if (aL != bL) {\r\n        r = aL > bL ? 1 : -1;\r\n      } else {\r\n        for (i = r = 0; i < aL; i++) {\r\n          if (a[i] != b[i]) {\r\n            r = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return r;\r\n    }\r\n\r\n    function subtract(a, b, aL) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * BASE + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1;) a.shift();\r\n    }\r\n\r\n    return function (x, y, pr, dp) {\r\n      var cmp, e, i, k, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0, yL, yz,\r\n        Ctor = x.constructor,\r\n        sign = x.s == y.s ? 1 : -1,\r\n        xd = x.d,\r\n        yd = y.d;\r\n\r\n      // Either 0?\r\n      if (!x.s) return new Ctor(x);\r\n      if (!y.s) throw Error(decimalError + 'Division by zero');\r\n\r\n      e = x.e - y.e;\r\n      yL = yd.length;\r\n      xL = xd.length;\r\n      q = new Ctor(sign);\r\n      qd = q.d = [];\r\n\r\n      // Result exponent may be one less than e.\r\n      for (i = 0; yd[i] == (xd[i] || 0); ) ++i;\r\n      if (yd[i] > (xd[i] || 0)) --e;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n      } else if (dp) {\r\n        sd = pr + (getBase10Exponent(x) - getBase10Exponent(y)) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) return new Ctor(0);\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / LOG_BASE + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * BASE + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= BASE/2\r\n        k = BASE / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k);\r\n          xd = multiplyInteger(xd, k);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= BASE / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * BASE + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= BASE) k = BASE - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n\r\n      q.e = e;\r\n\r\n      return round(q, dp ? pr + getBase10Exponent(q) + 1 : pr);\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` truncated to `sd`\r\n   * significant digits.\r\n   *\r\n   * Taylor/Maclaurin series.\r\n   *\r\n   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n   *\r\n   * Argument reduction:\r\n   *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n   *   exp(x) = exp(x / 2^k)^(2^k)\r\n   *\r\n   * Previously, the argument was initially reduced by\r\n   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n   * found to be slower than just dividing repeatedly by 32 as above.\r\n   *\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   */\r\n  function exp(x, sd) {\r\n    var denominator, guard, pow, sum, t, wpr,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    if (getBase10Exponent(x) > 16) throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n\r\n    // exp(0) = 1\r\n    if (!x.s) return new Ctor(ONE);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    t = new Ctor(0.03125);\r\n\r\n    while (x.abs().gte(0.1)) {\r\n      x = x.times(t);    // x = x / 2^5\r\n      k += 5;\r\n    }\r\n\r\n    // Estimate the precision increase necessary to ensure the first 4 rounding digits are correct.\r\n    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n    wpr += guard;\r\n    denominator = pow = sum = new Ctor(ONE);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = round(pow.times(x), wpr);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        while (k--) sum = round(sum.times(sum), wpr);\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(x) {\r\n    var e = x.e * LOG_BASE,\r\n      w = x.d[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for (; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n\r\n    if (sd > Ctor.LN10.sd()) {\r\n\r\n\r\n      // Reset global state in case the exception is caught.\r\n      external = true;\r\n      if (pr) Ctor.precision = pr;\r\n      throw Error(decimalError + 'LN10 precision limit exceeded');\r\n    }\r\n\r\n    return round(new Ctor(Ctor.LN10), sd);\r\n  }\r\n\r\n\r\n  function getZeroString(k) {\r\n    var zs = '';\r\n    for (; k--;) zs += '0';\r\n    return zs;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` truncated to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(n) is non-terminating (n != 1)\r\n   *\r\n   */\r\n  function ln(y, sd) {\r\n    var c, c0, denominator, e, numerator, sum, t, wpr, x2,\r\n      n = 1,\r\n      guard = 10,\r\n      x = y,\r\n      xd = x.d,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // ln(-x) = NaN\r\n    // ln(0) = -Infinity\r\n    if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n    // ln(1) = 0\r\n    if (x.eq(ONE)) return new Ctor(0);\r\n\r\n    if (sd == null) {\r\n      external = false;\r\n      wpr = pr;\r\n    } else {\r\n      wpr = sd;\r\n    }\r\n\r\n    if (x.eq(10)) {\r\n      if (sd == null) external = true;\r\n      return getLn10(Ctor, wpr);\r\n    }\r\n\r\n    wpr += guard;\r\n    Ctor.precision = wpr;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n    e = getBase10Exponent(x);\r\n\r\n    if (Math.abs(e) < 1.5e15) {\r\n\r\n      // Argument reduction.\r\n      // The series converges faster the closer the argument is to 1, so using\r\n      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n      // later be divided by this number, then separate out the power of 10 using\r\n      // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n      // max n is 6 (gives 0.7 - 1.3)\r\n      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n        x = x.times(y);\r\n        c = digitsToString(x.d);\r\n        c0 = c.charAt(0);\r\n        n++;\r\n      }\r\n\r\n      e = getBase10Exponent(x);\r\n\r\n      if (c0 > 1) {\r\n        x = new Ctor('0.' + c);\r\n        e++;\r\n      } else {\r\n        x = new Ctor(c0 + '.' + c.slice(1));\r\n      }\r\n    } else {\r\n\r\n      // The argument reduction method above may result in overflow if the argument y is a massive\r\n      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n      // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n      t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n      x = ln(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n\r\n      Ctor.precision = pr;\r\n      return sd == null ? (external = true, round(x, pr)) : x;\r\n    }\r\n\r\n    // x is reduced to a value near 1.\r\n\r\n    // Taylor series.\r\n    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n    // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n    sum = numerator = x = divide(x.minus(ONE), x.plus(ONE), wpr);\r\n    x2 = round(x.times(x), wpr);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = round(numerator.times(x2), wpr);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        sum = sum.times(2);\r\n\r\n        // Reverse the argument reduction.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr);\r\n\r\n        Ctor.precision = pr;\r\n        return sd == null ? (external = true, round(sum, pr)) : sum;\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Parse the value of a new Decimal `x` from string `str`.\r\n   */\r\n  function parseDecimal(x, str) {\r\n    var e, i, len;\r\n\r\n    // Decimal point?\r\n    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n    // Exponential form?\r\n    if ((i = str.search(/e/i)) > 0) {\r\n\r\n      // Determine exponent.\r\n      if (e < 0) e = i;\r\n      e += +str.slice(i + 1);\r\n      str = str.substring(0, i);\r\n    } else if (e < 0) {\r\n\r\n      // Integer.\r\n      e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48;) ++i;\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(len - 1) === 48;) --len;\r\n    str = str.slice(i, len);\r\n\r\n    if (str) {\r\n      len -= i;\r\n      e = e - i - 1;\r\n      x.e = mathfloor(e / LOG_BASE);\r\n      x.d = [];\r\n\r\n      // Transform base\r\n\r\n      // e is the base 10 exponent.\r\n      // i is where to slice str to get the first word of the digits array.\r\n      i = (e + 1) % LOG_BASE;\r\n      if (e < 0) i += LOG_BASE;\r\n\r\n      if (i < len) {\r\n        if (i) x.d.push(+str.slice(0, i));\r\n        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n        str = str.slice(i);\r\n        i = LOG_BASE - str.length;\r\n      } else {\r\n        i -= len;\r\n      }\r\n\r\n      for (; i--;) str += '0';\r\n      x.d.push(+str);\r\n\r\n      if (external && (x.e > MAX_E || x.e < -MAX_E)) throw Error(exponentOutOfRange + e);\r\n    } else {\r\n\r\n      // Zero.\r\n      x.s = 0;\r\n      x.e = 0;\r\n      x.d = [0];\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits, using rounding mode `rm` if present (truncate otherwise).\r\n   */\r\n   function round(x, sd, rm) {\r\n    var i, j, k, n, rd, doRound, w, xdi,\r\n      xd = x.d;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd which contains the rounding digit, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // n: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (n = 1, k = xd[0]; k >= 10; k /= 10) n++;\r\n    i = sd - n;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) return x;\r\n      w = k = xd[xdi];\r\n\r\n      // Get the number of digits of w.\r\n      for (n = 1; k >= 10; k /= 10) n++;\r\n\r\n      // Get the index of rd within w.\r\n      i %= LOG_BASE;\r\n\r\n      // Get the index of rd within w, adjusted for leading zeros.\r\n      // The number of leading zeros of w is given by LOG_BASE - n.\r\n      j = i - LOG_BASE + n;\r\n    }\r\n\r\n    if (rm !== void 0) {\r\n      k = mathpow(10, n - j - 1);\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / k % 10 | 0;\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      doRound = sd < 0 || xd[xdi + 1] !== void 0 || w % k;\r\n\r\n      // The expression `w % mathpow(10, n - j - 1)` returns all the digits of w to the right of the\r\n      // digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression will give\r\n      // 714.\r\n\r\n      doRound = rm < 4\r\n        ? (rd || doRound) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || doRound || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? w / mathpow(10, n - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n    }\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      if (doRound) {\r\n        k = getBase10Exponent(x);\r\n        xd.length = 1;\r\n\r\n        // Convert sd to decimal places.\r\n        sd = sd - k - 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = mathfloor(-sd / LOG_BASE) || 0;\r\n      } else {\r\n        xd.length = 1;\r\n\r\n        // Zero.\r\n        xd[0] = x.e = x.s = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, n - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (doRound) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n          if ((xd[0] += k) == BASE) {\r\n            xd[0] = 1;\r\n            ++x.e;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n\r\n    if (external && (x.e > MAX_E || x.e < -MAX_E)) {\r\n      throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function subtract(x, y) {\r\n    var d, e, i, j, k, len, xd, xe, xLTy, yd,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision;\r\n\r\n    // Return y negated if x is zero.\r\n    // Return x if y is zero and x is non-zero.\r\n    if (!x.s || !y.s) {\r\n      if (y.s) y.s = -y.s;\r\n      else y = new Ctor(x);\r\n      return external ? round(y, pr) : y;\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n\r\n    // x and y are non-zero numbers with the same sign.\r\n\r\n    e = y.e;\r\n    xe = x.e;\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If exponents differ...\r\n    if (k) {\r\n      xLTy = k < 0;\r\n\r\n      if (xLTy) {\r\n        d = xd;\r\n        k = -k;\r\n        len = yd.length;\r\n      } else {\r\n        d = yd;\r\n        e = xe;\r\n        len = xd.length;\r\n      }\r\n\r\n      // Numbers with massively different exponents would result in a very high number of zeros\r\n      // needing to be prepended, but this can be avoided while still ensuring correct rounding by\r\n      // limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n      if (k > i) {\r\n        k = i;\r\n        d.length = 1;\r\n      }\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      d.reverse();\r\n      for (i = k; i--;) d.push(0);\r\n      d.reverse();\r\n\r\n    // Base 1e7 exponents equal.\r\n    } else {\r\n\r\n      // Check digits to determine which is the bigger number.\r\n\r\n      i = xd.length;\r\n      len = yd.length;\r\n      xLTy = i < len;\r\n      if (xLTy) len = i;\r\n\r\n      for (i = 0; i < len; i++) {\r\n        if (xd[i] != yd[i]) {\r\n          xLTy = xd[i] < yd[i];\r\n          break;\r\n        }\r\n      }\r\n\r\n      k = 0;\r\n    }\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      xd = yd;\r\n      yd = d;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    len = xd.length;\r\n\r\n    // Append zeros to xd if shorter.\r\n    // Don't add zeros to yd if shorter as subtraction only needs to start at yd length.\r\n    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n    // Subtract yd from xd.\r\n    for (i = yd.length; i > k;) {\r\n      if (xd[--i] < yd[i]) {\r\n        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n        --xd[j];\r\n        xd[i] += BASE;\r\n      }\r\n\r\n      xd[i] -= yd[i];\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] === 0;) xd.pop();\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n    // Zero?\r\n    if (!xd[0]) return new Ctor(0);\r\n\r\n    y.d = xd;\r\n    y.e = e;\r\n\r\n    //return external && xd.length >= pr / LOG_BASE ? round(y, pr) : y;\r\n    return external ? round(y, pr) : y;\r\n  }\r\n\r\n\r\n  function toString(x, isExp, sd) {\r\n    var k,\r\n      e = getBase10Exponent(x),\r\n      str = digitsToString(x.d),\r\n      len = str.length;\r\n\r\n    if (isExp) {\r\n      if (sd && (k = sd - len) > 0) {\r\n        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n      } else if (len > 1) {\r\n        str = str.charAt(0) + '.' + str.slice(1);\r\n      }\r\n\r\n      str = str + (e < 0 ? 'e' : 'e+') + e;\r\n    } else if (e < 0) {\r\n      str = '0.' + getZeroString(-e - 1) + str;\r\n      if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n    } else if (e >= len) {\r\n      str += getZeroString(e + 1 - len);\r\n      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n    } else {\r\n      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n      if (sd && (k = sd - len) > 0) {\r\n        if (e + 1 === len) str += '.';\r\n        str += getZeroString(k);\r\n      }\r\n    }\r\n\r\n    return x.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Does not strip trailing zeros.\r\n  function truncate(arr, len) {\r\n    if (arr.length > len) {\r\n      arr.length = len;\r\n      return true;\r\n    }\r\n  }\r\n\r\n\r\n  // Decimal methods\r\n\r\n\r\n  /*\r\n   *  clone\r\n   *  config/set\r\n   */\r\n\r\n\r\n  /*\r\n   * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n   * constructor.\r\n   *\r\n   */\r\n  function clone(obj) {\r\n    var i, p, ps;\r\n\r\n    /*\r\n     * The Decimal constructor and exported function.\r\n     * Return a new Decimal instance.\r\n     *\r\n     * value {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(value) {\r\n      var x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(value);\r\n\r\n      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n      // which points to Object.\r\n      x.constructor = Decimal;\r\n\r\n      // Duplicate.\r\n      if (value instanceof Decimal) {\r\n        x.s = value.s;\r\n        x.e = value.e;\r\n        x.d = (value = value.d) ? value.slice() : value;\r\n        return;\r\n      }\r\n\r\n      if (typeof value === 'number') {\r\n\r\n        // Reject Infinity/NaN.\r\n        if (value * 0 !== 0) {\r\n          throw Error(invalidArgument + value);\r\n        }\r\n\r\n        if (value > 0) {\r\n          x.s = 1;\r\n        } else if (value < 0) {\r\n          value = -value;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 0;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (value === ~~value && value < 1e7) {\r\n          x.e = 0;\r\n          x.d = [value];\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, value.toString());\r\n      } else if (typeof value !== 'string') {\r\n        throw Error(invalidArgument + value);\r\n      }\r\n\r\n      // Minus sign?\r\n      if (value.charCodeAt(0) === 45) {\r\n        value = value.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      if (isDecimal.test(value)) parseDecimal(x, value);\r\n      else throw Error(invalidArgument + value);\r\n    }\r\n\r\n    Decimal.prototype = P;\r\n\r\n    Decimal.ROUND_UP = 0;\r\n    Decimal.ROUND_DOWN = 1;\r\n    Decimal.ROUND_CEIL = 2;\r\n    Decimal.ROUND_FLOOR = 3;\r\n    Decimal.ROUND_HALF_UP = 4;\r\n    Decimal.ROUND_HALF_DOWN = 5;\r\n    Decimal.ROUND_HALF_EVEN = 6;\r\n    Decimal.ROUND_HALF_CEIL = 7;\r\n    Decimal.ROUND_HALF_FLOOR = 8;\r\n\r\n    Decimal.clone = clone;\r\n    Decimal.config = Decimal.set = config;\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'LN10'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n\r\n    Decimal.config(obj);\r\n\r\n    return Decimal;\r\n  }\r\n\r\n\r\n  /*\r\n   * Configure global settings for a Decimal constructor.\r\n   *\r\n   * `obj` is an object with one or more of the following properties,\r\n   *\r\n   *   precision  {number}\r\n   *   rounding   {number}\r\n   *   toExpNeg   {number}\r\n   *   toExpPos   {number}\r\n   *\r\n   * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n   *\r\n   */\r\n  function config(obj) {\r\n    if (!obj || typeof obj !== 'object') {\r\n      throw Error(decimalError + 'Object expected');\r\n    }\r\n    var i, p, v,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -1 / 0, 0,\r\n        'toExpPos', 0, 1 / 0\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if ((v = obj[p = ps[i]]) !== void 0) {\r\n        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    if ((v = obj[p = 'LN10']) !== void 0) {\r\n        if (v == Math.LN10) this[p] = new this(v);\r\n        else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(Decimal);\r\n\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Internal constant.\r\n  ONE = new Decimal(1);\r\n\r\n\r\n  // Export.\r\n\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () {\r\n      return Decimal;\r\n    });\r\n\r\n  // Node and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = Decimal;\r\n\r\n    // Browser.\r\n  } else {\r\n    if (!globalScope) {\r\n      globalScope = typeof self != 'undefined' && self && self.self == self\r\n        ? self : Function('return this')();\r\n    }\r\n\r\n    globalScope.Decimal = Decimal;\r\n  }\r\n})(this);\r\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\n\nexports.__esModule = true;\nexports.default = addClass;\n\nvar _hasClass = _interopRequireDefault(require(\"./hasClass\"));\n\nfunction addClass(element, className) {\n  if (element.classList) element.classList.add(className);else if (!(0, _hasClass.default)(element, className)) if (typeof element.className === 'string') element.className = element.className + ' ' + className;else element.setAttribute('class', (element.className && element.className.baseVal || '') + ' ' + className);\n}\n\nmodule.exports = exports[\"default\"];","\"use strict\";\n\nexports.__esModule = true;\nexports.default = hasClass;\n\nfunction hasClass(element, className) {\n  if (element.classList) return !!className && element.classList.contains(className);else return (\" \" + (element.className.baseVal || element.className) + \" \").indexOf(\" \" + className + \" \") !== -1;\n}\n\nmodule.exports = exports[\"default\"];","'use strict';\n\nfunction replaceClassName(origClass, classToRemove) {\n  return origClass.replace(new RegExp('(^|\\\\s)' + classToRemove + '(?:\\\\s|$)', 'g'), '$1').replace(/\\s+/g, ' ').replace(/^\\s*|\\s*$/g, '');\n}\n\nmodule.exports = function removeClass(element, className) {\n  if (element.classList) element.classList.remove(className);else if (typeof element.className === 'string') element.className = replaceClassName(element.className, className);else element.setAttribute('class', replaceClassName(element.className && element.className.baseVal || '', className));\n};","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nexport default baseGetTag;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import Symbol from './_Symbol.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 * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nexport default getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","import isObject from './isObject.js';\nimport now from './now.js';\nimport toNumber from './toNumber.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nexport default debounce;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\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 debounce from './debounce.js';\nimport isObject from './isObject.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n *  Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\nfunction throttle(func, wait, options) {\n  var leading = true,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    'leading': leading,\n    'maxWait': wait,\n    'trailing': trailing\n  });\n}\n\nexport default throttle;\n","import 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 match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\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 = value.replace(reTrim, '');\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","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arraySome;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var baseForOwn = require('./_baseForOwn'),\n    createBaseEach = require('./_createBaseEach');\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","var baseEach = require('./_baseEach');\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nmodule.exports = baseFilter;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","var createBaseFor = require('./_createBaseFor');\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\n","var castPath = require('./_castPath'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseIntersection;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n    equalArrays = require('./_equalArrays'),\n    equalByTag = require('./_equalByTag'),\n    equalObjects = require('./_equalObjects'),\n    getTag = require('./_getTag'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var Stack = require('./_Stack'),\n    baseIsEqual = require('./_baseIsEqual');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nmodule.exports = baseIsMatch;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseMatches = require('./_baseMatches'),\n    baseMatchesProperty = require('./_baseMatchesProperty'),\n    identity = require('./identity'),\n    isArray = require('./isArray'),\n    property = require('./property');\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","var baseIsMatch = require('./_baseIsMatch'),\n    getMatchData = require('./_getMatchData'),\n    matchesStrictComparable = require('./_matchesStrictComparable');\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nmodule.exports = baseMatches;\n","var baseIsEqual = require('./_baseIsEqual'),\n    get = require('./get'),\n    hasIn = require('./hasIn'),\n    isKey = require('./_isKey'),\n    isStrictComparable = require('./_isStrictComparable'),\n    matchesStrictComparable = require('./_matchesStrictComparable'),\n    toKey = require('./_toKey');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nmodule.exports = baseMatchesProperty;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nmodule.exports = basePropertyDeep;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\n}\n\nmodule.exports = castArrayLikeObject;\n","var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var isArrayLike = require('./isArrayLike');\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nmodule.exports = createBaseEach;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nmodule.exports = createBaseFor;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var SetCache = require('./_SetCache'),\n    arraySome = require('./_arraySome'),\n    cacheHas = require('./_cacheHas');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Assume cyclic values are equal.\n  var stacked = stack.get(array);\n  if (stacked && stack.get(other)) {\n    return stacked == other;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalArrays;\n","var Symbol = require('./_Symbol'),\n    Uint8Array = require('./_Uint8Array'),\n    eq = require('./eq'),\n    equalArrays = require('./_equalArrays'),\n    mapToArray = require('./_mapToArray'),\n    setToArray = require('./_setToArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Assume cyclic values are equal.\n  var stacked = stack.get(object);\n  if (stacked && stack.get(other)) {\n    return stacked == other;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalObjects;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","var isStrictComparable = require('./_isStrictComparable'),\n    keys = require('./keys');\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nmodule.exports = getMatchData;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var DataView = require('./_DataView'),\n    Map = require('./_Map'),\n    Promise = require('./_Promise'),\n    Set = require('./_Set'),\n    WeakMap = require('./_WeakMap'),\n    baseGetTag = require('./_baseGetTag'),\n    toSource = require('./_toSource');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nmodule.exports = getTag;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var isObject = require('./isObject');\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nmodule.exports = mapToArray;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nmodule.exports = matchesStrictComparable;\n","var memoize = require('./memoize');\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nmodule.exports = memoizeCapped;\n","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nmodule.exports = stringToPath;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var arrayFilter = require('./_arrayFilter'),\n    baseFilter = require('./_baseFilter'),\n    baseIteratee = require('./_baseIteratee'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nmodule.exports = filter;\n","var baseGet = require('./_baseGet');\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject');\n\n/**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\n});\n\nmodule.exports = intersection;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","var baseIsEqual = require('./_baseIsEqual');\n\n/**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\n}\n\nmodule.exports = isEqual;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar numberTag = '[object Number]';\n\n/**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\nfunction isNumber(value) {\n  return typeof value == 'number' ||\n    (isObjectLike(value) && baseGetTag(value) == numberTag);\n}\n\nmodule.exports = isNumber;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.17.15';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Error message constants. */\n  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n      FUNC_ERROR_TEXT = 'Expected a function';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used as the maximum memoize cache size. */\n  var MAX_MEMOIZE_SIZE = 500;\n\n  /** Used as the internal argument placeholder. */\n  var PLACEHOLDER = '__lodash_placeholder__';\n\n  /** Used to compose bitmasks for cloning. */\n  var CLONE_DEEP_FLAG = 1,\n      CLONE_FLAT_FLAG = 2,\n      CLONE_SYMBOLS_FLAG = 4;\n\n  /** Used to compose bitmasks for value comparisons. */\n  var COMPARE_PARTIAL_FLAG = 1,\n      COMPARE_UNORDERED_FLAG = 2;\n\n  /** Used to compose bitmasks for function metadata. */\n  var WRAP_BIND_FLAG = 1,\n      WRAP_BIND_KEY_FLAG = 2,\n      WRAP_CURRY_BOUND_FLAG = 4,\n      WRAP_CURRY_FLAG = 8,\n      WRAP_CURRY_RIGHT_FLAG = 16,\n      WRAP_PARTIAL_FLAG = 32,\n      WRAP_PARTIAL_RIGHT_FLAG = 64,\n      WRAP_ARY_FLAG = 128,\n      WRAP_REARG_FLAG = 256,\n      WRAP_FLIP_FLAG = 512;\n\n  /** Used as default options for `_.truncate`. */\n  var DEFAULT_TRUNC_LENGTH = 30,\n      DEFAULT_TRUNC_OMISSION = '...';\n\n  /** Used to detect hot functions by number of calls within a span of milliseconds. */\n  var HOT_COUNT = 800,\n      HOT_SPAN = 16;\n\n  /** Used to indicate the type of lazy iteratees. */\n  var LAZY_FILTER_FLAG = 1,\n      LAZY_MAP_FLAG = 2,\n      LAZY_WHILE_FLAG = 3;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991,\n      MAX_INTEGER = 1.7976931348623157e+308,\n      NAN = 0 / 0;\n\n  /** Used as references for the maximum length and index of an array. */\n  var MAX_ARRAY_LENGTH = 4294967295,\n      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n  /** Used to associate wrap methods with their bit flags. */\n  var wrapFlags = [\n    ['ary', WRAP_ARY_FLAG],\n    ['bind', WRAP_BIND_FLAG],\n    ['bindKey', WRAP_BIND_KEY_FLAG],\n    ['curry', WRAP_CURRY_FLAG],\n    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n    ['flip', WRAP_FLIP_FLAG],\n    ['partial', WRAP_PARTIAL_FLAG],\n    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n    ['rearg', WRAP_REARG_FLAG]\n  ];\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      asyncTag = '[object AsyncFunction]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      domExcTag = '[object DOMException]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      nullTag = '[object Null]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      proxyTag = '[object Proxy]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      undefinedTag = '[object Undefined]',\n      weakMapTag = '[object WeakMap]',\n      weakSetTag = '[object WeakSet]';\n\n  var 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 match empty string literals in compiled template source. */\n  var reEmptyStringLeading = /\\b__p \\+= '';/g,\n      reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n      reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n  /** Used to match HTML entities and HTML characters. */\n  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n      reUnescapedHtml = /[&<>\"']/g,\n      reHasEscapedHtml = RegExp(reEscapedHtml.source),\n      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n  /** Used to match template delimiters. */\n  var reEscape = /<%-([\\s\\S]+?)%>/g,\n      reEvaluate = /<%([\\s\\S]+?)%>/g,\n      reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n      reHasRegExpChar = RegExp(reRegExpChar.source);\n\n  /** Used to match leading and trailing whitespace. */\n  var reTrim = /^\\s+|\\s+$/g,\n      reTrimStart = /^\\s+/,\n      reTrimEnd = /\\s+$/;\n\n  /** Used to match wrap detail comments. */\n  var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n      reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n      reSplitDetails = /,? & /;\n\n  /** Used to match words composed of alphanumeric characters. */\n  var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /**\n   * Used to match\n   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n   */\n  var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect bad signed hexadecimal string values. */\n  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n  /** Used to detect binary string values. */\n  var reIsBinary = /^0b[01]+$/i;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect octal string values. */\n  var reIsOctal = /^0o[0-7]+$/i;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to match Latin Unicode letters (excluding mathematical operators). */\n  var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n  /** Used to ensure capturing order of template delimiters. */\n  var reNoMatch = /($^)/;\n\n  /** Used to match unescaped characters in compiled string literals. */\n  var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n  /** Used to compose unicode character classes. */\n  var rsAstralRange = '\\\\ud800-\\\\udfff',\n      rsComboMarksRange = '\\\\u0300-\\\\u036f',\n      reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n      rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n      rsDingbatRange = '\\\\u2700-\\\\u27bf',\n      rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n      rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n      rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n      rsPunctuationRange = '\\\\u2000-\\\\u206f',\n      rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n      rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n      rsVarRange = '\\\\ufe0e\\\\ufe0f',\n      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n  /** Used to compose unicode capture groups. */\n  var rsApos = \"['\\u2019]\",\n      rsAstral = '[' + rsAstralRange + ']',\n      rsBreak = '[' + rsBreakRange + ']',\n      rsCombo = '[' + rsComboRange + ']',\n      rsDigits = '\\\\d+',\n      rsDingbat = '[' + rsDingbatRange + ']',\n      rsLower = '[' + rsLowerRange + ']',\n      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\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      rsUpper = '[' + rsUpperRange + ']',\n      rsZWJ = '\\\\u200d';\n\n  /** Used to compose unicode regexes. */\n  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n      reOptMod = rsModifier + '?',\n      rsOptVar = '[' + rsVarRange + ']?',\n      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n      rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n      rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n      rsSeq = rsOptVar + reOptMod + rsOptJoin,\n      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n  /** Used to match apostrophes. */\n  var reApos = RegExp(rsApos, 'g');\n\n  /**\n   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n   */\n  var reComboMark = RegExp(rsCombo, 'g');\n\n  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n  /** Used to match complex or compound words. */\n  var reUnicodeWord = RegExp([\n    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n    rsUpper + '+' + rsOptContrUpper,\n    rsOrdUpper,\n    rsOrdLower,\n    rsDigits,\n    rsEmoji\n  ].join('|'), 'g');\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/). */\n  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n  /** Used to detect strings that need a more robust regexp to match words. */\n  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n  /** Used to assign default `context` object properties. */\n  var contextProps = [\n    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n  ];\n\n  /** Used to make template sourceURLs easier to identify. */\n  var templateCounter = -1;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Used to map Latin Unicode letters to basic Latin letters. */\n  var deburredLetters = {\n    // Latin-1 Supplement block.\n    '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n    '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n    '\\xc7': 'C',  '\\xe7': 'c',\n    '\\xd0': 'D',  '\\xf0': 'd',\n    '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n    '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n    '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n    '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n    '\\xd1': 'N',  '\\xf1': 'n',\n    '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n    '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n    '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n    '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n    '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n    '\\xc6': 'Ae', '\\xe6': 'ae',\n    '\\xde': 'Th', '\\xfe': 'th',\n    '\\xdf': 'ss',\n    // Latin Extended-A block.\n    '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n    '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n    '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n    '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n    '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n    '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n    '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n    '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n    '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n    '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n    '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n    '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n    '\\u0134': 'J',  '\\u0135': 'j',\n    '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n    '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n    '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n    '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n    '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n    '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n    '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n    '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n    '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n    '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n    '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n    '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n    '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n    '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n    '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n    '\\u0174': 'W',  '\\u0175': 'w',\n    '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n    '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n    '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n    '\\u0132': 'IJ', '\\u0133': 'ij',\n    '\\u0152': 'Oe', '\\u0153': 'oe',\n    '\\u0149': \"'n\", '\\u017f': 's'\n  };\n\n  /** Used to map characters to HTML entities. */\n  var htmlEscapes = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\n  };\n\n  /** Used to escape characters for inclusion in compiled string literals. */\n  var stringEscapes = {\n    '\\\\': '\\\\',\n    \"'\": \"'\",\n    '\\n': 'n',\n    '\\r': 'r',\n    '\\u2028': 'u2028',\n    '\\u2029': 'u2029'\n  };\n\n  /** Built-in method references without a dependency on `root`. */\n  var freeParseFloat = parseFloat,\n      freeParseInt = parseInt;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var nodeUtil = (function() {\n    try {\n      // Use `util.types` for Node.js 10+.\n      var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n      if (types) {\n        return types;\n      }\n\n      // Legacy `process.binding('util')` for Node.js < 10.\n      return freeProcess && freeProcess.binding && freeProcess.binding('util');\n    } catch (e) {}\n  }());\n\n  /* Node.js helper references. */\n  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n      nodeIsDate = nodeUtil && nodeUtil.isDate,\n      nodeIsMap = nodeUtil && nodeUtil.isMap,\n      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n      nodeIsSet = nodeUtil && nodeUtil.isSet,\n      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * A faster alternative to `Function#apply`, this function invokes `func`\n   * with the `this` binding of `thisArg` and the arguments of `args`.\n   *\n   * @private\n   * @param {Function} func The function to invoke.\n   * @param {*} thisArg The `this` binding of `func`.\n   * @param {Array} args The arguments to invoke `func` with.\n   * @returns {*} Returns the result of `func`.\n   */\n  function apply(func, thisArg, args) {\n    switch (args.length) {\n      case 0: return func.call(thisArg);\n      case 1: return func.call(thisArg, args[0]);\n      case 2: return func.call(thisArg, args[0], args[1]);\n      case 3: return func.call(thisArg, args[0], args[1], args[2]);\n    }\n    return func.apply(thisArg, args);\n  }\n\n  /**\n   * A specialized version of `baseAggregator` for arrays.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} setter The function to set `accumulator` values.\n   * @param {Function} iteratee The iteratee to transform keys.\n   * @param {Object} accumulator The initial aggregated object.\n   * @returns {Function} Returns `accumulator`.\n   */\n  function arrayAggregator(array, setter, iteratee, accumulator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      var value = array[index];\n      setter(accumulator, value, iteratee(value), array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.forEach` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.forEachRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEachRight(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n\n    while (length--) {\n      if (iteratee(array[length], length, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.every` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if all elements pass the predicate check,\n   *  else `false`.\n   */\n  function arrayEvery(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (!predicate(array[index], index, array)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * A specialized version of `_.filter` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {Array} Returns the new filtered array.\n   */\n  function arrayFilter(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (predicate(value, index, array)) {\n        result[resIndex++] = value;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.includes` for arrays without support for\n   * specifying an index to search from.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludes(array, value) {\n    var length = array == null ? 0 : array.length;\n    return !!length && baseIndexOf(array, value, 0) > -1;\n  }\n\n  /**\n   * This function is like `arrayIncludes` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludesWith(array, value, comparator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (comparator(value, array[index])) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * A specialized version of `_.map` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the new mapped array.\n   */\n  function arrayMap(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        result = Array(length);\n\n    while (++index < length) {\n      result[index] = iteratee(array[index], index, array);\n    }\n    return result;\n  }\n\n  /**\n   * Appends the elements of `values` to `array`.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {Array} values The values to append.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayPush(array, values) {\n    var index = -1,\n        length = values.length,\n        offset = array.length;\n\n    while (++index < length) {\n      array[offset + index] = values[index];\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.reduceRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the last element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n    var length = array == null ? 0 : array.length;\n    if (initAccum && length) {\n      accumulator = array[--length];\n    }\n    while (length--) {\n      accumulator = iteratee(accumulator, array[length], length, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.some` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if any element passes the predicate check,\n   *  else `false`.\n   */\n  function arraySome(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (predicate(array[index], index, array)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\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   */\n  var asciiSize = baseProperty('length');\n\n  /**\n   * Converts an ASCII `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function asciiToArray(string) {\n    return string.split('');\n  }\n\n  /**\n   * Splits an ASCII `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function asciiWords(string) {\n    return string.match(reAsciiWord) || [];\n  }\n\n  /**\n   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n   * without support for iteratee shorthands, which iterates over `collection`\n   * using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the found element or its key, else `undefined`.\n   */\n  function baseFindKey(collection, predicate, eachFunc) {\n    var result;\n    eachFunc(collection, function(value, key, collection) {\n      if (predicate(value, key, collection)) {\n        result = key;\n        return false;\n      }\n    });\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.findIndex` and `_.findLastIndex` without\n   * support for iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {number} fromIndex The index to search from.\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseFindIndex(array, predicate, fromIndex, fromRight) {\n    var length = array.length,\n        index = fromIndex + (fromRight ? 1 : -1);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (predicate(array[index], index, array)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOf(array, value, fromIndex) {\n    return value === value\n      ? strictIndexOf(array, value, fromIndex)\n      : baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n\n  /**\n   * This function is like `baseIndexOf` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOfWith(array, value, fromIndex, comparator) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (comparator(array[index], value)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.isNaN` without support for number objects.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n   */\n  function baseIsNaN(value) {\n    return value !== value;\n  }\n\n  /**\n   * The base implementation of `_.mean` and `_.meanBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the mean.\n   */\n  function baseMean(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n    return length ? (baseSum(array, iteratee) / length) : NAN;\n  }\n\n  /**\n   * The base implementation of `_.property` without support for deep paths.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.propertyOf` without support for deep paths.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyOf(object) {\n    return function(key) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.reduce` and `_.reduceRight`, without support\n   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} accumulator The initial value.\n   * @param {boolean} initAccum Specify using the first or last element of\n   *  `collection` as the initial value.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the accumulated value.\n   */\n  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n    eachFunc(collection, function(value, index, collection) {\n      accumulator = initAccum\n        ? (initAccum = false, value)\n        : iteratee(accumulator, value, index, collection);\n    });\n    return accumulator;\n  }\n\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   */\n  function 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\n  /**\n   * The base implementation of `_.sum` and `_.sumBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the sum.\n   */\n  function baseSum(array, iteratee) {\n    var result,\n        index = -1,\n        length = array.length;\n\n    while (++index < length) {\n      var current = iteratee(array[index]);\n      if (current !== undefined) {\n        result = result === undefined ? current : (result + current);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.times` without support for iteratee shorthands\n   * or max array length checks.\n   *\n   * @private\n   * @param {number} n The number of times to invoke `iteratee`.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the array of results.\n   */\n  function baseTimes(n, iteratee) {\n    var index = -1,\n        result = Array(n);\n\n    while (++index < n) {\n      result[index] = iteratee(index);\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n   * of key-value pairs for `object` corresponding to the property names of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the key-value pairs.\n   */\n  function baseToPairs(object, props) {\n    return arrayMap(props, function(key) {\n      return [key, object[key]];\n    });\n  }\n\n  /**\n   * The base implementation of `_.unary` without support for storing metadata.\n   *\n   * @private\n   * @param {Function} func The function to cap arguments for.\n   * @returns {Function} Returns the new capped function.\n   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * The base implementation of `_.values` and `_.valuesIn` which creates an\n   * array of `object` property values corresponding to the property names\n   * of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the array of property values.\n   */\n  function baseValues(object, props) {\n    return arrayMap(props, function(key) {\n      return object[key];\n    });\n  }\n\n  /**\n   * Checks if a `cache` value for `key` exists.\n   *\n   * @private\n   * @param {Object} cache The cache to query.\n   * @param {string} key The key of the entry to check.\n   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n   */\n  function cacheHas(cache, key) {\n    return cache.has(key);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the first unmatched string symbol.\n   */\n  function charsStartIndex(strSymbols, chrSymbols) {\n    var index = -1,\n        length = strSymbols.length;\n\n    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the last unmatched string symbol.\n   */\n  function charsEndIndex(strSymbols, chrSymbols) {\n    var index = strSymbols.length;\n\n    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Gets the number of `placeholder` occurrences in `array`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} placeholder The placeholder to search for.\n   * @returns {number} Returns the placeholder count.\n   */\n  function countHolders(array, placeholder) {\n    var length = array.length,\n        result = 0;\n\n    while (length--) {\n      if (array[length] === placeholder) {\n        ++result;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n   * letters to basic Latin letters.\n   *\n   * @private\n   * @param {string} letter The matched letter to deburr.\n   * @returns {string} Returns the deburred letter.\n   */\n  var deburrLetter = basePropertyOf(deburredLetters);\n\n  /**\n   * Used by `_.escape` to convert characters to HTML entities.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n  /**\n   * Used by `_.template` to escape characters for inclusion in compiled string literals.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  function escapeStringChar(chr) {\n    return '\\\\' + stringEscapes[chr];\n  }\n\n  /**\n   * Gets the value at `key` of `object`.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {string} key The key of the property to get.\n   * @returns {*} Returns the property value.\n   */\n  function getValue(object, key) {\n    return object == null ? undefined : object[key];\n  }\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   */\n  function hasUnicode(string) {\n    return reHasUnicode.test(string);\n  }\n\n  /**\n   * Checks if `string` contains a word composed of Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a word is found, else `false`.\n   */\n  function hasUnicodeWord(string) {\n    return reHasUnicodeWord.test(string);\n  }\n\n  /**\n   * Converts `iterator` to an array.\n   *\n   * @private\n   * @param {Object} iterator The iterator to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function iteratorToArray(iterator) {\n    var data,\n        result = [];\n\n    while (!(data = iterator.next()).done) {\n      result.push(data.value);\n    }\n    return result;\n  }\n\n  /**\n   * Converts `map` to its key-value pairs.\n   *\n   * @private\n   * @param {Object} map The map to convert.\n   * @returns {Array} Returns the key-value pairs.\n   */\n  function mapToArray(map) {\n    var index = -1,\n        result = Array(map.size);\n\n    map.forEach(function(value, key) {\n      result[++index] = [key, value];\n    });\n    return result;\n  }\n\n  /**\n   * Creates a unary function that invokes `func` with its argument transformed.\n   *\n   * @private\n   * @param {Function} func The function to wrap.\n   * @param {Function} transform The argument transform.\n   * @returns {Function} Returns the new function.\n   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Replaces all `placeholder` elements in `array` with an internal placeholder\n   * and returns an array of their indexes.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {*} placeholder The placeholder to replace.\n   * @returns {Array} Returns the new array of placeholder indexes.\n   */\n  function replaceHolders(array, placeholder) {\n    var index = -1,\n        length = array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value === placeholder || value === PLACEHOLDER) {\n        array[index] = PLACEHOLDER;\n        result[resIndex++] = index;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Converts `set` to an array of its values.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the values.\n   */\n  function setToArray(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = value;\n    });\n    return result;\n  }\n\n  /**\n   * Converts `set` to its value-value pairs.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the value-value pairs.\n   */\n  function setToPairs(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = [value, value];\n    });\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.indexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictIndexOf(array, value, fromIndex) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * A specialized version of `_.lastIndexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictLastIndexOf(array, value, fromIndex) {\n    var index = fromIndex + 1;\n    while (index--) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return index;\n  }\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   */\n  function stringSize(string) {\n    return hasUnicode(string)\n      ? unicodeSize(string)\n      : asciiSize(string);\n  }\n\n  /**\n   * Converts `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function stringToArray(string) {\n    return hasUnicode(string)\n      ? unicodeToArray(string)\n      : asciiToArray(string);\n  }\n\n  /**\n   * Used by `_.unescape` to convert HTML entities to characters.\n   *\n   * @private\n   * @param {string} chr The matched character to unescape.\n   * @returns {string} Returns the unescaped character.\n   */\n  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\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   */\n  function unicodeSize(string) {\n    var result = reUnicode.lastIndex = 0;\n    while (reUnicode.test(string)) {\n      ++result;\n    }\n    return result;\n  }\n\n  /**\n   * Converts a Unicode `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function unicodeToArray(string) {\n    return string.match(reUnicode) || [];\n  }\n\n  /**\n   * Splits a Unicode `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function unicodeWords(string) {\n    return string.match(reUnicodeWord) || [];\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Create a new pristine `lodash` function using the `context` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 1.1.0\n   * @category Util\n   * @param {Object} [context=root] The context object.\n   * @returns {Function} Returns a new `lodash` function.\n   * @example\n   *\n   * _.mixin({ 'foo': _.constant('foo') });\n   *\n   * var lodash = _.runInContext();\n   * lodash.mixin({ 'bar': lodash.constant('bar') });\n   *\n   * _.isFunction(_.foo);\n   * // => true\n   * _.isFunction(_.bar);\n   * // => false\n   *\n   * lodash.isFunction(lodash.foo);\n   * // => false\n   * lodash.isFunction(lodash.bar);\n   * // => true\n   *\n   * // Create a suped-up `defer` in Node.js.\n   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n   */\n  var runInContext = (function runInContext(context) {\n    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n    /** Built-in constructor references. */\n    var Array = context.Array,\n        Date = context.Date,\n        Error = context.Error,\n        Function = context.Function,\n        Math = context.Math,\n        Object = context.Object,\n        RegExp = context.RegExp,\n        String = context.String,\n        TypeError = context.TypeError;\n\n    /** Used for built-in method references. */\n    var arrayProto = Array.prototype,\n        funcProto = Function.prototype,\n        objectProto = Object.prototype;\n\n    /** Used to detect overreaching core-js shims. */\n    var coreJsData = context['__core-js_shared__'];\n\n    /** Used to resolve the decompiled source of functions. */\n    var funcToString = funcProto.toString;\n\n    /** Used to check objects for own properties. */\n    var hasOwnProperty = objectProto.hasOwnProperty;\n\n    /** Used to generate unique IDs. */\n    var idCounter = 0;\n\n    /** Used to detect methods masquerading as native. */\n    var maskSrcKey = (function() {\n      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n      return uid ? ('Symbol(src)_1.' + uid) : '';\n    }());\n\n    /**\n     * Used to resolve the\n     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n     * of values.\n     */\n    var nativeObjectToString = objectProto.toString;\n\n    /** Used to infer the `Object` constructor. */\n    var objectCtorString = funcToString.call(Object);\n\n    /** Used to restore the original `_` reference in `_.noConflict`. */\n    var oldDash = root._;\n\n    /** Used to detect if a method is native. */\n    var reIsNative = RegExp('^' +\n      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n      .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n    );\n\n    /** Built-in value references. */\n    var Buffer = moduleExports ? context.Buffer : undefined,\n        Symbol = context.Symbol,\n        Uint8Array = context.Uint8Array,\n        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n        getPrototype = overArg(Object.getPrototypeOf, Object),\n        objectCreate = Object.create,\n        propertyIsEnumerable = objectProto.propertyIsEnumerable,\n        splice = arrayProto.splice,\n        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n        symIterator = Symbol ? Symbol.iterator : undefined,\n        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n    var defineProperty = (function() {\n      try {\n        var func = getNative(Object, 'defineProperty');\n        func({}, '', {});\n        return func;\n      } catch (e) {}\n    }());\n\n    /** Mocked built-ins. */\n    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n        ctxNow = Date && Date.now !== root.Date.now && Date.now,\n        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n    /* Built-in method references for those with the same name as other `lodash` methods. */\n    var nativeCeil = Math.ceil,\n        nativeFloor = Math.floor,\n        nativeGetSymbols = Object.getOwnPropertySymbols,\n        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n        nativeIsFinite = context.isFinite,\n        nativeJoin = arrayProto.join,\n        nativeKeys = overArg(Object.keys, Object),\n        nativeMax = Math.max,\n        nativeMin = Math.min,\n        nativeNow = Date.now,\n        nativeParseInt = context.parseInt,\n        nativeRandom = Math.random,\n        nativeReverse = arrayProto.reverse;\n\n    /* Built-in method references that are verified to be native. */\n    var DataView = getNative(context, 'DataView'),\n        Map = getNative(context, 'Map'),\n        Promise = getNative(context, 'Promise'),\n        Set = getNative(context, 'Set'),\n        WeakMap = getNative(context, 'WeakMap'),\n        nativeCreate = getNative(Object, 'create');\n\n    /** Used to store function metadata. */\n    var metaMap = WeakMap && new WeakMap;\n\n    /** Used to lookup unminified function names. */\n    var realNames = {};\n\n    /** Used to detect maps, sets, and weakmaps. */\n    var dataViewCtorString = toSource(DataView),\n        mapCtorString = toSource(Map),\n        promiseCtorString = toSource(Promise),\n        setCtorString = toSource(Set),\n        weakMapCtorString = toSource(WeakMap);\n\n    /** Used to convert symbols to primitives and strings. */\n    var symbolProto = Symbol ? Symbol.prototype : undefined,\n        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n        symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` object which wraps `value` to enable implicit method\n     * chain sequences. Methods that operate on and return arrays, collections,\n     * and functions can be chained together. Methods that retrieve a single value\n     * or may return a primitive value will automatically end the chain sequence\n     * and return the unwrapped value. Otherwise, the value must be unwrapped\n     * with `_#value`.\n     *\n     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n     * enabled using `_.chain`.\n     *\n     * The execution of chained methods is lazy, that is, it's deferred until\n     * `_#value` is implicitly or explicitly called.\n     *\n     * Lazy evaluation allows several methods to support shortcut fusion.\n     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n     * the creation of intermediate arrays and can greatly reduce the number of\n     * iteratee executions. Sections of a chain sequence qualify for shortcut\n     * fusion if the section is applied to an array and iteratees accept only\n     * one argument. The heuristic for whether a section qualifies for shortcut\n     * fusion is subject to change.\n     *\n     * Chaining is supported in custom builds as long as the `_#value` method is\n     * directly or indirectly included in the build.\n     *\n     * In addition to lodash methods, wrappers have `Array` and `String` methods.\n     *\n     * The wrapper `Array` methods are:\n     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n     *\n     * The wrapper `String` methods are:\n     * `replace` and `split`\n     *\n     * The wrapper methods that support shortcut fusion are:\n     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n     *\n     * The chainable wrapper methods are:\n     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n     * `zipObject`, `zipObjectDeep`, and `zipWith`\n     *\n     * The wrapper methods that are **not** chainable by default are:\n     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n     * `upperFirst`, `value`, and `words`\n     *\n     * @name _\n     * @constructor\n     * @category Seq\n     * @param {*} value The value to wrap in a `lodash` instance.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2, 3]);\n     *\n     * // Returns an unwrapped value.\n     * wrapped.reduce(_.add);\n     * // => 6\n     *\n     * // Returns a wrapped value.\n     * var squares = wrapped.map(square);\n     *\n     * _.isArray(squares);\n     * // => false\n     *\n     * _.isArray(squares.value());\n     * // => true\n     */\n    function lodash(value) {\n      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n        if (value instanceof LodashWrapper) {\n          return value;\n        }\n        if (hasOwnProperty.call(value, '__wrapped__')) {\n          return wrapperClone(value);\n        }\n      }\n      return new LodashWrapper(value);\n    }\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     */\n    var 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\n    /**\n     * The function whose prototype chain sequence wrappers inherit from.\n     *\n     * @private\n     */\n    function baseLodash() {\n      // No operation performed.\n    }\n\n    /**\n     * The base constructor for creating `lodash` wrapper objects.\n     *\n     * @private\n     * @param {*} value The value to wrap.\n     * @param {boolean} [chainAll] Enable explicit method chain sequences.\n     */\n    function LodashWrapper(value, chainAll) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__chain__ = !!chainAll;\n      this.__index__ = 0;\n      this.__values__ = undefined;\n    }\n\n    /**\n     * By default, the template delimiters used by lodash are like those in\n     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n     * following template settings to use alternative delimiters.\n     *\n     * @static\n     * @memberOf _\n     * @type {Object}\n     */\n    lodash.templateSettings = {\n\n      /**\n       * Used to detect `data` property values to be HTML-escaped.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'escape': reEscape,\n\n      /**\n       * Used to detect code to be evaluated.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'evaluate': reEvaluate,\n\n      /**\n       * Used to detect `data` property values to inject.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'interpolate': reInterpolate,\n\n      /**\n       * Used to reference the data object in the template text.\n       *\n       * @memberOf _.templateSettings\n       * @type {string}\n       */\n      'variable': '',\n\n      /**\n       * Used to import variables into the compiled template.\n       *\n       * @memberOf _.templateSettings\n       * @type {Object}\n       */\n      'imports': {\n\n        /**\n         * A reference to the `lodash` function.\n         *\n         * @memberOf _.templateSettings.imports\n         * @type {Function}\n         */\n        '_': lodash\n      }\n    };\n\n    // Ensure wrappers are instances of `baseLodash`.\n    lodash.prototype = baseLodash.prototype;\n    lodash.prototype.constructor = lodash;\n\n    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n    LodashWrapper.prototype.constructor = LodashWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n     *\n     * @private\n     * @constructor\n     * @param {*} value The value to wrap.\n     */\n    function LazyWrapper(value) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__dir__ = 1;\n      this.__filtered__ = false;\n      this.__iteratees__ = [];\n      this.__takeCount__ = MAX_ARRAY_LENGTH;\n      this.__views__ = [];\n    }\n\n    /**\n     * Creates a clone of the lazy wrapper object.\n     *\n     * @private\n     * @name clone\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the cloned `LazyWrapper` object.\n     */\n    function lazyClone() {\n      var result = new LazyWrapper(this.__wrapped__);\n      result.__actions__ = copyArray(this.__actions__);\n      result.__dir__ = this.__dir__;\n      result.__filtered__ = this.__filtered__;\n      result.__iteratees__ = copyArray(this.__iteratees__);\n      result.__takeCount__ = this.__takeCount__;\n      result.__views__ = copyArray(this.__views__);\n      return result;\n    }\n\n    /**\n     * Reverses the direction of lazy iteration.\n     *\n     * @private\n     * @name reverse\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the new reversed `LazyWrapper` object.\n     */\n    function lazyReverse() {\n      if (this.__filtered__) {\n        var result = new LazyWrapper(this);\n        result.__dir__ = -1;\n        result.__filtered__ = true;\n      } else {\n        result = this.clone();\n        result.__dir__ *= -1;\n      }\n      return result;\n    }\n\n    /**\n     * Extracts the unwrapped value from its lazy wrapper.\n     *\n     * @private\n     * @name value\n     * @memberOf LazyWrapper\n     * @returns {*} Returns the unwrapped value.\n     */\n    function lazyValue() {\n      var array = this.__wrapped__.value(),\n          dir = this.__dir__,\n          isArr = isArray(array),\n          isRight = dir < 0,\n          arrLength = isArr ? array.length : 0,\n          view = getView(0, arrLength, this.__views__),\n          start = view.start,\n          end = view.end,\n          length = end - start,\n          index = isRight ? end : (start - 1),\n          iteratees = this.__iteratees__,\n          iterLength = iteratees.length,\n          resIndex = 0,\n          takeCount = nativeMin(length, this.__takeCount__);\n\n      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n        return baseWrapperValue(array, this.__actions__);\n      }\n      var result = [];\n\n      outer:\n      while (length-- && resIndex < takeCount) {\n        index += dir;\n\n        var iterIndex = -1,\n            value = array[index];\n\n        while (++iterIndex < iterLength) {\n          var data = iteratees[iterIndex],\n              iteratee = data.iteratee,\n              type = data.type,\n              computed = iteratee(value);\n\n          if (type == LAZY_MAP_FLAG) {\n            value = computed;\n          } else if (!computed) {\n            if (type == LAZY_FILTER_FLAG) {\n              continue outer;\n            } else {\n              break outer;\n            }\n          }\n        }\n        result[resIndex++] = value;\n      }\n      return result;\n    }\n\n    // Ensure `LazyWrapper` is an instance of `baseLodash`.\n    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n    LazyWrapper.prototype.constructor = LazyWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a hash object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Hash(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the hash.\n     *\n     * @private\n     * @name clear\n     * @memberOf Hash\n     */\n    function hashClear() {\n      this.__data__ = nativeCreate ? nativeCreate(null) : {};\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the hash.\n     *\n     * @private\n     * @name delete\n     * @memberOf Hash\n     * @param {Object} hash The hash to modify.\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function hashDelete(key) {\n      var result = this.has(key) && delete this.__data__[key];\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the hash value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Hash\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function hashGet(key) {\n      var data = this.__data__;\n      if (nativeCreate) {\n        var result = data[key];\n        return result === HASH_UNDEFINED ? undefined : result;\n      }\n      return hasOwnProperty.call(data, key) ? data[key] : undefined;\n    }\n\n    /**\n     * Checks if a hash value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Hash\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function hashHas(key) {\n      var data = this.__data__;\n      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n    }\n\n    /**\n     * Sets the hash `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Hash\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the hash instance.\n     */\n    function hashSet(key, value) {\n      var data = this.__data__;\n      this.size += this.has(key) ? 0 : 1;\n      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n      return this;\n    }\n\n    // Add methods to `Hash`.\n    Hash.prototype.clear = hashClear;\n    Hash.prototype['delete'] = hashDelete;\n    Hash.prototype.get = hashGet;\n    Hash.prototype.has = hashHas;\n    Hash.prototype.set = hashSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an list cache object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function ListCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the list cache.\n     *\n     * @private\n     * @name clear\n     * @memberOf ListCache\n     */\n    function listCacheClear() {\n      this.__data__ = [];\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the list cache.\n     *\n     * @private\n     * @name delete\n     * @memberOf ListCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function listCacheDelete(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        return false;\n      }\n      var lastIndex = data.length - 1;\n      if (index == lastIndex) {\n        data.pop();\n      } else {\n        splice.call(data, index, 1);\n      }\n      --this.size;\n      return true;\n    }\n\n    /**\n     * Gets the list cache value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf ListCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function listCacheGet(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      return index < 0 ? undefined : data[index][1];\n    }\n\n    /**\n     * Checks if a list cache value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf ListCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function listCacheHas(key) {\n      return assocIndexOf(this.__data__, key) > -1;\n    }\n\n    /**\n     * Sets the list cache `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf ListCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the list cache instance.\n     */\n    function listCacheSet(key, value) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        ++this.size;\n        data.push([key, value]);\n      } else {\n        data[index][1] = value;\n      }\n      return this;\n    }\n\n    // Add methods to `ListCache`.\n    ListCache.prototype.clear = listCacheClear;\n    ListCache.prototype['delete'] = listCacheDelete;\n    ListCache.prototype.get = listCacheGet;\n    ListCache.prototype.has = listCacheHas;\n    ListCache.prototype.set = listCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a map cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function MapCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the map.\n     *\n     * @private\n     * @name clear\n     * @memberOf MapCache\n     */\n    function mapCacheClear() {\n      this.size = 0;\n      this.__data__ = {\n        'hash': new Hash,\n        'map': new (Map || ListCache),\n        'string': new Hash\n      };\n    }\n\n    /**\n     * Removes `key` and its value from the map.\n     *\n     * @private\n     * @name delete\n     * @memberOf MapCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function mapCacheDelete(key) {\n      var result = getMapData(this, key)['delete'](key);\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the map value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf MapCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function mapCacheGet(key) {\n      return getMapData(this, key).get(key);\n    }\n\n    /**\n     * Checks if a map value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf MapCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function mapCacheHas(key) {\n      return getMapData(this, key).has(key);\n    }\n\n    /**\n     * Sets the map `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf MapCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the map cache instance.\n     */\n    function mapCacheSet(key, value) {\n      var data = getMapData(this, key),\n          size = data.size;\n\n      data.set(key, value);\n      this.size += data.size == size ? 0 : 1;\n      return this;\n    }\n\n    // Add methods to `MapCache`.\n    MapCache.prototype.clear = mapCacheClear;\n    MapCache.prototype['delete'] = mapCacheDelete;\n    MapCache.prototype.get = mapCacheGet;\n    MapCache.prototype.has = mapCacheHas;\n    MapCache.prototype.set = mapCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     *\n     * Creates an array cache object to store unique values.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [values] The values to cache.\n     */\n    function SetCache(values) {\n      var index = -1,\n          length = values == null ? 0 : values.length;\n\n      this.__data__ = new MapCache;\n      while (++index < length) {\n        this.add(values[index]);\n      }\n    }\n\n    /**\n     * Adds `value` to the array cache.\n     *\n     * @private\n     * @name add\n     * @memberOf SetCache\n     * @alias push\n     * @param {*} value The value to cache.\n     * @returns {Object} Returns the cache instance.\n     */\n    function setCacheAdd(value) {\n      this.__data__.set(value, HASH_UNDEFINED);\n      return this;\n    }\n\n    /**\n     * Checks if `value` is in the array cache.\n     *\n     * @private\n     * @name has\n     * @memberOf SetCache\n     * @param {*} value The value to search for.\n     * @returns {number} Returns `true` if `value` is found, else `false`.\n     */\n    function setCacheHas(value) {\n      return this.__data__.has(value);\n    }\n\n    // Add methods to `SetCache`.\n    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n    SetCache.prototype.has = setCacheHas;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a stack cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Stack(entries) {\n      var data = this.__data__ = new ListCache(entries);\n      this.size = data.size;\n    }\n\n    /**\n     * Removes all key-value entries from the stack.\n     *\n     * @private\n     * @name clear\n     * @memberOf Stack\n     */\n    function stackClear() {\n      this.__data__ = new ListCache;\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the stack.\n     *\n     * @private\n     * @name delete\n     * @memberOf Stack\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function stackDelete(key) {\n      var data = this.__data__,\n          result = data['delete'](key);\n\n      this.size = data.size;\n      return result;\n    }\n\n    /**\n     * Gets the stack value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Stack\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function stackGet(key) {\n      return this.__data__.get(key);\n    }\n\n    /**\n     * Checks if a stack value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Stack\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function stackHas(key) {\n      return this.__data__.has(key);\n    }\n\n    /**\n     * Sets the stack `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Stack\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the stack cache instance.\n     */\n    function stackSet(key, value) {\n      var data = this.__data__;\n      if (data instanceof ListCache) {\n        var pairs = data.__data__;\n        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n          pairs.push([key, value]);\n          this.size = ++data.size;\n          return this;\n        }\n        data = this.__data__ = new MapCache(pairs);\n      }\n      data.set(key, value);\n      this.size = data.size;\n      return this;\n    }\n\n    // Add methods to `Stack`.\n    Stack.prototype.clear = stackClear;\n    Stack.prototype['delete'] = stackDelete;\n    Stack.prototype.get = stackGet;\n    Stack.prototype.has = stackHas;\n    Stack.prototype.set = stackSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of the enumerable property names of the array-like `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @param {boolean} inherited Specify returning inherited property names.\n     * @returns {Array} Returns the array of property names.\n     */\n    function arrayLikeKeys(value, inherited) {\n      var isArr = isArray(value),\n          isArg = !isArr && isArguments(value),\n          isBuff = !isArr && !isArg && isBuffer(value),\n          isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n          skipIndexes = isArr || isArg || isBuff || isType,\n          result = skipIndexes ? baseTimes(value.length, String) : [],\n          length = result.length;\n\n      for (var key in value) {\n        if ((inherited || hasOwnProperty.call(value, key)) &&\n            !(skipIndexes && (\n               // Safari 9 has enumerable `arguments.length` in strict mode.\n               key == 'length' ||\n               // Node.js 0.10 has enumerable non-index properties on buffers.\n               (isBuff && (key == 'offset' || key == 'parent')) ||\n               // PhantomJS 2 has enumerable non-index properties on typed arrays.\n               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n               // Skip index properties.\n               isIndex(key, length)\n            ))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `_.sample` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @returns {*} Returns the random element.\n     */\n    function arraySample(array) {\n      var length = array.length;\n      return length ? array[baseRandom(0, length - 1)] : undefined;\n    }\n\n    /**\n     * A specialized version of `_.sampleSize` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function arraySampleSize(array, n) {\n      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * A specialized version of `_.shuffle` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function arrayShuffle(array) {\n      return shuffleSelf(copyArray(array));\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * Gets the index at which the `key` is found in `array` of key-value pairs.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {*} key The key to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     */\n    function assocIndexOf(array, key) {\n      var length = array.length;\n      while (length--) {\n        if (eq(array[length][0], key)) {\n          return length;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * Aggregates elements of `collection` on `accumulator` with keys transformed\n     * by `iteratee` and values set by `setter`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform keys.\n     * @param {Object} accumulator The initial aggregated object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseAggregator(collection, setter, iteratee, accumulator) {\n      baseEach(collection, function(value, key, collection) {\n        setter(accumulator, value, iteratee(value), collection);\n      });\n      return accumulator;\n    }\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     */\n    function baseAssign(object, source) {\n      return object && copyObject(source, keys(source), object);\n    }\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     */\n    function baseAssignIn(object, source) {\n      return object && copyObject(source, keysIn(source), object);\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.at` without support for individual paths.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Array} Returns the picked elements.\n     */\n    function baseAt(object, paths) {\n      var index = -1,\n          length = paths.length,\n          result = Array(length),\n          skip = object == null;\n\n      while (++index < length) {\n        result[index] = skip ? undefined : get(object, paths[index]);\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.clamp` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     */\n    function baseClamp(number, lower, upper) {\n      if (number === number) {\n        if (upper !== undefined) {\n          number = number <= upper ? number : upper;\n        }\n        if (lower !== undefined) {\n          number = number >= lower ? number : lower;\n        }\n      }\n      return number;\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.conforms` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseConforms(source) {\n      var props = keys(source);\n      return function(object) {\n        return baseConformsTo(object, source, props);\n      };\n    }\n\n    /**\n     * The base implementation of `_.conformsTo` which accepts `props` to check.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     */\n    function baseConformsTo(object, source, props) {\n      var length = props.length;\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (length--) {\n        var key = props[length],\n            predicate = source[key],\n            value = object[key];\n\n        if ((value === undefined && !(key in object)) || !predicate(value)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.delay` and `_.defer` which accepts `args`\n     * to provide to `func`.\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {Array} args The arguments to provide to `func`.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    function baseDelay(func, wait, args) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return setTimeout(function() { func.apply(undefined, args); }, wait);\n    }\n\n    /**\n     * The base implementation of methods like `_.difference` without support\n     * for excluding multiple arrays or iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Array} values The values to exclude.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     */\n    function baseDifference(array, values, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          isCommon = true,\n          length = array.length,\n          result = [],\n          valuesLength = values.length;\n\n      if (!length) {\n        return result;\n      }\n      if (iteratee) {\n        values = arrayMap(values, baseUnary(iteratee));\n      }\n      if (comparator) {\n        includes = arrayIncludesWith;\n        isCommon = false;\n      }\n      else if (values.length >= LARGE_ARRAY_SIZE) {\n        includes = cacheHas;\n        isCommon = false;\n        values = new SetCache(values);\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee == null ? value : iteratee(value);\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var valuesIndex = valuesLength;\n          while (valuesIndex--) {\n            if (values[valuesIndex] === computed) {\n              continue outer;\n            }\n          }\n          result.push(value);\n        }\n        else if (!includes(values, computed, comparator)) {\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.forEach` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEach = createBaseEach(baseForOwn);\n\n    /**\n     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n    /**\n     * The base implementation of `_.every` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`\n     */\n    function baseEvery(collection, predicate) {\n      var result = true;\n      baseEach(collection, function(value, index, collection) {\n        result = !!predicate(value, index, collection);\n        return result;\n      });\n      return result;\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.fill` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     */\n    function baseFill(array, value, start, end) {\n      var length = array.length;\n\n      start = toInteger(start);\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = (end === undefined || end > length) ? length : toInteger(end);\n      if (end < 0) {\n        end += length;\n      }\n      end = start > end ? 0 : toLength(end);\n      while (start < end) {\n        array[start++] = value;\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.filter` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     */\n    function baseFilter(collection, predicate) {\n      var result = [];\n      baseEach(collection, function(value, index, collection) {\n        if (predicate(value, index, collection)) {\n          result.push(value);\n        }\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.flatten` with support for restricting flattening.\n     *\n     * @private\n     * @param {Array} array The array to flatten.\n     * @param {number} depth The maximum recursion depth.\n     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n     * @param {Array} [result=[]] The initial result value.\n     * @returns {Array} Returns the new flattened array.\n     */\n    function baseFlatten(array, depth, predicate, isStrict, result) {\n      var index = -1,\n          length = array.length;\n\n      predicate || (predicate = isFlattenable);\n      result || (result = []);\n\n      while (++index < length) {\n        var value = array[index];\n        if (depth > 0 && predicate(value)) {\n          if (depth > 1) {\n            // Recursively flatten arrays (susceptible to call stack limits).\n            baseFlatten(value, depth - 1, predicate, isStrict, result);\n          } else {\n            arrayPush(result, value);\n          }\n        } else if (!isStrict) {\n          result[result.length] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `baseForOwn` which iterates over `object`\n     * properties returned by `keysFunc` and invokes `iteratee` for each property.\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseFor = createBaseFor();\n\n    /**\n     * This function is like `baseFor` except that it iterates over properties\n     * in the opposite order.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseForRight = createBaseFor(true);\n\n    /**\n     * The base implementation of `_.forOwn` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwn(object, iteratee) {\n      return object && baseFor(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwnRight(object, iteratee) {\n      return object && baseForRight(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.functions` which creates an array of\n     * `object` function property names filtered from `props`.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Array} props The property names to filter.\n     * @returns {Array} Returns the function names.\n     */\n    function baseFunctions(object, props) {\n      return arrayFilter(props, function(key) {\n        return isFunction(object[key]);\n      });\n    }\n\n    /**\n     * The base implementation of `_.get` without support for default values.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseGet(object, path) {\n      path = castPath(path, object);\n\n      var index = 0,\n          length = path.length;\n\n      while (object != null && index < length) {\n        object = object[toKey(path[index++])];\n      }\n      return (index && index == length) ? object : undefined;\n    }\n\n    /**\n     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n     * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @param {Function} symbolsFunc The function to get the symbols of `object`.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n      var result = keysFunc(object);\n      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n    }\n\n    /**\n     * The base implementation of `getTag` without fallbacks for buggy environments.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    function baseGetTag(value) {\n      if (value == null) {\n        return value === undefined ? undefinedTag : nullTag;\n      }\n      return (symToStringTag && symToStringTag in Object(value))\n        ? getRawTag(value)\n        : objectToString(value);\n    }\n\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     */\n    function baseGt(value, other) {\n      return value > other;\n    }\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     */\n    function baseHas(object, key) {\n      return object != null && hasOwnProperty.call(object, key);\n    }\n\n    /**\n     * The base implementation of `_.hasIn` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHasIn(object, key) {\n      return object != null && key in Object(object);\n    }\n\n    /**\n     * The base implementation of `_.inRange` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to check.\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     */\n    function baseInRange(number, start, end) {\n      return number >= nativeMin(start, end) && number < nativeMax(start, end);\n    }\n\n    /**\n     * The base implementation of methods like `_.intersection`, without support\n     * for iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of shared values.\n     */\n    function baseIntersection(arrays, iteratee, comparator) {\n      var includes = comparator ? arrayIncludesWith : arrayIncludes,\n          length = arrays[0].length,\n          othLength = arrays.length,\n          othIndex = othLength,\n          caches = Array(othLength),\n          maxLength = Infinity,\n          result = [];\n\n      while (othIndex--) {\n        var array = arrays[othIndex];\n        if (othIndex && iteratee) {\n          array = arrayMap(array, baseUnary(iteratee));\n        }\n        maxLength = nativeMin(array.length, maxLength);\n        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n          ? new SetCache(othIndex && array)\n          : undefined;\n      }\n      array = arrays[0];\n\n      var index = -1,\n          seen = caches[0];\n\n      outer:\n      while (++index < length && result.length < maxLength) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (!(seen\n              ? cacheHas(seen, computed)\n              : includes(result, computed, comparator)\n            )) {\n          othIndex = othLength;\n          while (--othIndex) {\n            var cache = caches[othIndex];\n            if (!(cache\n                  ? cacheHas(cache, computed)\n                  : includes(arrays[othIndex], computed, comparator))\n                ) {\n              continue outer;\n            }\n          }\n          if (seen) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.invert` and `_.invertBy` which inverts\n     * `object` with values transformed by `iteratee` and set by `setter`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform values.\n     * @param {Object} accumulator The initial inverted object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseInverter(object, setter, iteratee, accumulator) {\n      baseForOwn(object, function(value, key, object) {\n        setter(accumulator, iteratee(value), key, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.invoke` without support for individual\n     * method arguments.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {Array} args The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     */\n    function baseInvoke(object, path, args) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      var func = object == null ? object : object[toKey(last(path))];\n      return func == null ? undefined : apply(func, object, args);\n    }\n\n    /**\n     * The base implementation of `_.isArguments`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     */\n    function baseIsArguments(value) {\n      return isObjectLike(value) && baseGetTag(value) == argsTag;\n    }\n\n    /**\n     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     */\n    function baseIsArrayBuffer(value) {\n      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n    }\n\n    /**\n     * The base implementation of `_.isDate` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     */\n    function baseIsDate(value) {\n      return isObjectLike(value) && baseGetTag(value) == dateTag;\n    }\n\n    /**\n     * The base implementation of `_.isEqual` which supports partial comparisons\n     * and tracks traversed objects.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Unordered comparison\n     *  2 - Partial comparison\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     */\n    function baseIsEqual(value, other, bitmask, customizer, stack) {\n      if (value === other) {\n        return true;\n      }\n      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n        return value !== value && other !== other;\n      }\n      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n    }\n\n    /**\n     * A specialized version of `baseIsEqual` for arrays and objects which performs\n     * deep comparisons and tracks traversed objects enabling objects with circular\n     * references to be compared.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n      var objIsArr = isArray(object),\n          othIsArr = isArray(other),\n          objTag = objIsArr ? arrayTag : getTag(object),\n          othTag = othIsArr ? arrayTag : getTag(other);\n\n      objTag = objTag == argsTag ? objectTag : objTag;\n      othTag = othTag == argsTag ? objectTag : othTag;\n\n      var objIsObj = objTag == objectTag,\n          othIsObj = othTag == objectTag,\n          isSameTag = objTag == othTag;\n\n      if (isSameTag && isBuffer(object)) {\n        if (!isBuffer(other)) {\n          return false;\n        }\n        objIsArr = true;\n        objIsObj = false;\n      }\n      if (isSameTag && !objIsObj) {\n        stack || (stack = new Stack);\n        return (objIsArr || isTypedArray(object))\n          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n      }\n      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n        if (objIsWrapped || othIsWrapped) {\n          var objUnwrapped = objIsWrapped ? object.value() : object,\n              othUnwrapped = othIsWrapped ? other.value() : other;\n\n          stack || (stack = new Stack);\n          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n        }\n      }\n      if (!isSameTag) {\n        return false;\n      }\n      stack || (stack = new Stack);\n      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n    }\n\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     */\n    function baseIsMap(value) {\n      return isObjectLike(value) && getTag(value) == mapTag;\n    }\n\n    /**\n     * The base implementation of `_.isMatch` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Array} matchData The property names, values, and compare flags to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     */\n    function baseIsMatch(object, source, matchData, customizer) {\n      var index = matchData.length,\n          length = index,\n          noCustomizer = !customizer;\n\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (index--) {\n        var data = matchData[index];\n        if ((noCustomizer && data[2])\n              ? data[1] !== object[data[0]]\n              : !(data[0] in object)\n            ) {\n          return false;\n        }\n      }\n      while (++index < length) {\n        data = matchData[index];\n        var key = data[0],\n            objValue = object[key],\n            srcValue = data[1];\n\n        if (noCustomizer && data[2]) {\n          if (objValue === undefined && !(key in object)) {\n            return false;\n          }\n        } else {\n          var stack = new Stack;\n          if (customizer) {\n            var result = customizer(objValue, srcValue, key, object, source, stack);\n          }\n          if (!(result === undefined\n                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n                : result\n              )) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.isNative` without bad shim checks.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     */\n    function baseIsNative(value) {\n      if (!isObject(value) || isMasked(value)) {\n        return false;\n      }\n      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n      return pattern.test(toSource(value));\n    }\n\n    /**\n     * The base implementation of `_.isRegExp` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     */\n    function baseIsRegExp(value) {\n      return isObjectLike(value) && baseGetTag(value) == regexpTag;\n    }\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     */\n    function baseIsSet(value) {\n      return isObjectLike(value) && getTag(value) == setTag;\n    }\n\n    /**\n     * The base implementation of `_.isTypedArray` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     */\n    function baseIsTypedArray(value) {\n      return isObjectLike(value) &&\n        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n    }\n\n    /**\n     * The base implementation of `_.iteratee`.\n     *\n     * @private\n     * @param {*} [value=_.identity] The value to convert to an iteratee.\n     * @returns {Function} Returns the iteratee.\n     */\n    function baseIteratee(value) {\n      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n      if (typeof value == 'function') {\n        return value;\n      }\n      if (value == null) {\n        return identity;\n      }\n      if (typeof value == 'object') {\n        return isArray(value)\n          ? baseMatchesProperty(value[0], value[1])\n          : baseMatches(value);\n      }\n      return property(value);\n    }\n\n    /**\n     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeys(object) {\n      if (!isPrototype(object)) {\n        return nativeKeys(object);\n      }\n      var result = [];\n      for (var key in Object(object)) {\n        if (hasOwnProperty.call(object, key) && key != 'constructor') {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\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     */\n    function 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\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     */\n    function baseLt(value, other) {\n      return value < other;\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.matches` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatches(source) {\n      var matchData = getMatchData(source);\n      if (matchData.length == 1 && matchData[0][2]) {\n        return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n      }\n      return function(object) {\n        return object === source || baseIsMatch(object, source, matchData);\n      };\n    }\n\n    /**\n     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n     *\n     * @private\n     * @param {string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatchesProperty(path, srcValue) {\n      if (isKey(path) && isStrictComparable(srcValue)) {\n        return matchesStrictComparable(toKey(path), srcValue);\n      }\n      return function(object) {\n        var objValue = get(object, path);\n        return (objValue === undefined && objValue === srcValue)\n          ? hasIn(object, path)\n          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n      };\n    }\n\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     */\n    function 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\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     */\n    function 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\n    /**\n     * The base implementation of `_.nth` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {number} n The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     */\n    function baseNth(array, n) {\n      var length = array.length;\n      if (!length) {\n        return;\n      }\n      n += n < 0 ? length : 0;\n      return isIndex(n, length) ? array[n] : undefined;\n    }\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     */\n    function baseOrderBy(collection, iteratees, orders) {\n      var index = -1;\n      iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee()));\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\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     */\n    function basePick(object, paths) {\n      return basePickBy(object, paths, function(value, path) {\n        return hasIn(object, path);\n      });\n    }\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     */\n    function 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\n    /**\n     * A specialized version of `baseProperty` which supports deep paths.\n     *\n     * @private\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     */\n    function basePropertyDeep(path) {\n      return function(object) {\n        return baseGet(object, path);\n      };\n    }\n\n    /**\n     * The base implementation of `_.pullAllBy` without support for iteratee\n     * shorthands.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAll(array, values, iteratee, comparator) {\n      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n          index = -1,\n          length = values.length,\n          seen = array;\n\n      if (array === values) {\n        values = copyArray(values);\n      }\n      if (iteratee) {\n        seen = arrayMap(array, baseUnary(iteratee));\n      }\n      while (++index < length) {\n        var fromIndex = 0,\n            value = values[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n          if (seen !== array) {\n            splice.call(seen, fromIndex, 1);\n          }\n          splice.call(array, fromIndex, 1);\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.pullAt` without support for individual\n     * indexes or capturing the removed elements.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {number[]} indexes The indexes of elements to remove.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAt(array, indexes) {\n      var length = array ? indexes.length : 0,\n          lastIndex = length - 1;\n\n      while (length--) {\n        var index = indexes[length];\n        if (length == lastIndex || index !== previous) {\n          var previous = index;\n          if (isIndex(index)) {\n            splice.call(array, index, 1);\n          } else {\n            baseUnset(array, index);\n          }\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.random` without support for returning\n     * floating-point numbers.\n     *\n     * @private\n     * @param {number} lower The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the random number.\n     */\n    function baseRandom(lower, upper) {\n      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n    }\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     */\n    function 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\n    /**\n     * The base implementation of `_.repeat` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {string} string The string to repeat.\n     * @param {number} n The number of times to repeat the string.\n     * @returns {string} Returns the repeated string.\n     */\n    function baseRepeat(string, n) {\n      var result = '';\n      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n        return result;\n      }\n      // Leverage the exponentiation by squaring algorithm for a faster repeat.\n      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n      do {\n        if (n % 2) {\n          result += string;\n        }\n        n = nativeFloor(n / 2);\n        if (n) {\n          string += string;\n        }\n      } while (n);\n\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     */\n    function baseRest(func, start) {\n      return setToString(overRest(func, start, identity), func + '');\n    }\n\n    /**\n     * The base implementation of `_.sample`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     */\n    function baseSample(collection) {\n      return arraySample(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.sampleSize` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function baseSampleSize(collection, n) {\n      var array = values(collection);\n      return shuffleSelf(array, baseClamp(n, 0, array.length));\n    }\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     */\n    function 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 (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\n    /**\n     * The base implementation of `setData` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetData = !metaMap ? identity : function(func, data) {\n      metaMap.set(func, data);\n      return func;\n    };\n\n    /**\n     * The base implementation of `setToString` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetToString = !defineProperty ? identity : function(func, string) {\n      return defineProperty(func, 'toString', {\n        'configurable': true,\n        'enumerable': false,\n        'value': constant(string),\n        'writable': true\n      });\n    };\n\n    /**\n     * The base implementation of `_.shuffle`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function baseShuffle(collection) {\n      return shuffleSelf(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.slice` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseSlice(array, start, end) {\n      var index = -1,\n          length = array.length;\n\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = end > length ? length : end;\n      if (end < 0) {\n        end += length;\n      }\n      length = start > end ? 0 : ((end - start) >>> 0);\n      start >>>= 0;\n\n      var result = Array(length);\n      while (++index < length) {\n        result[index] = array[index + start];\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.some` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     */\n    function baseSome(collection, predicate) {\n      var result;\n\n      baseEach(collection, function(value, index, collection) {\n        result = predicate(value, index, collection);\n        return !result;\n      });\n      return !!result;\n    }\n\n    /**\n     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n     * performs a binary search of `array` to determine the index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndex(array, value, retHighest) {\n      var low = 0,\n          high = array == null ? low : array.length;\n\n      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n        while (low < high) {\n          var mid = (low + high) >>> 1,\n              computed = array[mid];\n\n          if (computed !== null && !isSymbol(computed) &&\n              (retHighest ? (computed <= value) : (computed < value))) {\n            low = mid + 1;\n          } else {\n            high = mid;\n          }\n        }\n        return high;\n      }\n      return baseSortedIndexBy(array, value, identity, retHighest);\n    }\n\n    /**\n     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n     * which invokes `iteratee` for `value` and each element of `array` to compute\n     * their sort ranking. The iteratee is invoked with one argument; (value).\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} iteratee The iteratee invoked per element.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndexBy(array, value, iteratee, retHighest) {\n      value = iteratee(value);\n\n      var low = 0,\n          high = array == null ? 0 : array.length,\n          valIsNaN = value !== value,\n          valIsNull = value === null,\n          valIsSymbol = isSymbol(value),\n          valIsUndefined = value === undefined;\n\n      while (low < high) {\n        var mid = nativeFloor((low + high) / 2),\n            computed = iteratee(array[mid]),\n            othIsDefined = computed !== undefined,\n            othIsNull = computed === null,\n            othIsReflexive = computed === computed,\n            othIsSymbol = isSymbol(computed);\n\n        if (valIsNaN) {\n          var setLow = retHighest || othIsReflexive;\n        } else if (valIsUndefined) {\n          setLow = othIsReflexive && (retHighest || othIsDefined);\n        } else if (valIsNull) {\n          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n        } else if (valIsSymbol) {\n          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n        } else if (othIsNull || othIsSymbol) {\n          setLow = false;\n        } else {\n          setLow = retHighest ? (computed <= value) : (computed < value);\n        }\n        if (setLow) {\n          low = mid + 1;\n        } else {\n          high = mid;\n        }\n      }\n      return nativeMin(high, MAX_ARRAY_INDEX);\n    }\n\n    /**\n     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n     * support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseSortedUniq(array, iteratee) {\n      var index = -1,\n          length = array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        if (!index || !eq(computed, seen)) {\n          var seen = computed;\n          result[resIndex++] = value === 0 ? 0 : value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.toNumber` which doesn't ensure correct\n     * conversions of binary, hexadecimal, or octal string values.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     */\n    function baseToNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      return +value;\n    }\n\n    /**\n     * The base implementation of `_.toString` which doesn't convert nullish\n     * values to empty strings.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {string} Returns the string.\n     */\n    function baseToString(value) {\n      // Exit early for strings to avoid a performance hit in some environments.\n      if (typeof value == 'string') {\n        return value;\n      }\n      if (isArray(value)) {\n        // Recursively convert values (susceptible to call stack limits).\n        return arrayMap(value, baseToString) + '';\n      }\n      if (isSymbol(value)) {\n        return symbolToString ? symbolToString.call(value) : '';\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseUniq(array, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          length = array.length,\n          isCommon = true,\n          result = [],\n          seen = result;\n\n      if (comparator) {\n        isCommon = false;\n        includes = arrayIncludesWith;\n      }\n      else if (length >= LARGE_ARRAY_SIZE) {\n        var set = iteratee ? null : createSet(array);\n        if (set) {\n          return setToArray(set);\n        }\n        isCommon = false;\n        includes = cacheHas;\n        seen = new SetCache;\n      }\n      else {\n        seen = iteratee ? [] : result;\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var seenIndex = seen.length;\n          while (seenIndex--) {\n            if (seen[seenIndex] === computed) {\n              continue outer;\n            }\n          }\n          if (iteratee) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n        else if (!includes(seen, computed, comparator)) {\n          if (seen !== result) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.unset`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The property path to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     */\n    function baseUnset(object, path) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      return object == null || delete object[toKey(last(path))];\n    }\n\n    /**\n     * The base implementation of `_.update`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to update.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseUpdate(object, path, updater, customizer) {\n      return baseSet(object, path, updater(baseGet(object, path)), customizer);\n    }\n\n    /**\n     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n     * without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {Function} predicate The function invoked per iteration.\n     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseWhile(array, predicate, isDrop, fromRight) {\n      var length = array.length,\n          index = fromRight ? length : -1;\n\n      while ((fromRight ? index-- : ++index < length) &&\n        predicate(array[index], index, array)) {}\n\n      return isDrop\n        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n    }\n\n    /**\n     * The base implementation of `wrapperValue` which returns the result of\n     * performing a sequence of actions on the unwrapped `value`, where each\n     * successive action is supplied the return value of the previous.\n     *\n     * @private\n     * @param {*} value The unwrapped value.\n     * @param {Array} actions Actions to perform to resolve the unwrapped value.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseWrapperValue(value, actions) {\n      var result = value;\n      if (result instanceof LazyWrapper) {\n        result = result.value();\n      }\n      return arrayReduce(actions, function(result, action) {\n        return action.func.apply(action.thisArg, arrayPush([result], action.args));\n      }, result);\n    }\n\n    /**\n     * The base implementation of methods like `_.xor`, without support for\n     * iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of values.\n     */\n    function baseXor(arrays, iteratee, comparator) {\n      var length = arrays.length;\n      if (length < 2) {\n        return length ? baseUniq(arrays[0]) : [];\n      }\n      var index = -1,\n          result = Array(length);\n\n      while (++index < length) {\n        var array = arrays[index],\n            othIndex = -1;\n\n        while (++othIndex < length) {\n          if (othIndex != index) {\n            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n          }\n        }\n      }\n      return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n    }\n\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     */\n    function 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\n    /**\n     * Casts `value` to an empty array if it's not an array like object.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Array|Object} Returns the cast array-like object.\n     */\n    function castArrayLikeObject(value) {\n      return isArrayLikeObject(value) ? value : [];\n    }\n\n    /**\n     * Casts `value` to `identity` if it's not a function.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Function} Returns cast function.\n     */\n    function castFunction(value) {\n      return typeof value == 'function' ? value : identity;\n    }\n\n    /**\n     * Casts `value` to a path array if it's not one.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {Array} Returns the cast property path array.\n     */\n    function castPath(value, object) {\n      if (isArray(value)) {\n        return value;\n      }\n      return isKey(value, object) ? [value] : stringToPath(toString(value));\n    }\n\n    /**\n     * A `baseRest` alias which can be replaced with `identity` by module\n     * replacement plugins.\n     *\n     * @private\n     * @type {Function}\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    var castRest = baseRest;\n\n    /**\n     * Casts `array` to a slice if it's needed.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {number} start The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the cast slice.\n     */\n    function castSlice(array, start, end) {\n      var length = array.length;\n      end = end === undefined ? length : end;\n      return (!start && end >= length) ? array : baseSlice(array, start, end);\n    }\n\n    /**\n     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n     *\n     * @private\n     * @param {number|Object} id The timer id or timeout object of the timer to clear.\n     */\n    var clearTimeout = ctxClearTimeout || function(id) {\n      return root.clearTimeout(id);\n    };\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     */\n    function 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\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     */\n    function cloneArrayBuffer(arrayBuffer) {\n      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n      return result;\n    }\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     */\n    function cloneDataView(dataView, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n    }\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     */\n    function cloneRegExp(regexp) {\n      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n      result.lastIndex = regexp.lastIndex;\n      return result;\n    }\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     */\n    function cloneSymbol(symbol) {\n      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n    }\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     */\n    function cloneTypedArray(typedArray, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n    }\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     */\n    function 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\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     */\n    function 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\n    /**\n     * Creates an array that is the composition of partially applied arguments,\n     * placeholders, and provided arguments into a single array of arguments.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to prepend to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgs(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersLength = holders.length,\n          leftIndex = -1,\n          leftLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(leftLength + rangeLength),\n          isUncurried = !isCurried;\n\n      while (++leftIndex < leftLength) {\n        result[leftIndex] = partials[leftIndex];\n      }\n      while (++argsIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[holders[argsIndex]] = args[argsIndex];\n        }\n      }\n      while (rangeLength--) {\n        result[leftIndex++] = args[argsIndex++];\n      }\n      return result;\n    }\n\n    /**\n     * This function is like `composeArgs` except that the arguments composition\n     * is tailored for `_.partialRight`.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to append to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgsRight(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersIndex = -1,\n          holdersLength = holders.length,\n          rightIndex = -1,\n          rightLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(rangeLength + rightLength),\n          isUncurried = !isCurried;\n\n      while (++argsIndex < rangeLength) {\n        result[argsIndex] = args[argsIndex];\n      }\n      var offset = argsIndex;\n      while (++rightIndex < rightLength) {\n        result[offset + rightIndex] = partials[rightIndex];\n      }\n      while (++holdersIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[offset + holders[holdersIndex]] = args[argsIndex++];\n        }\n      }\n      return result;\n    }\n\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     */\n    function 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\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     */\n    function 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\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     */\n    function copySymbols(source, object) {\n      return copyObject(source, getSymbols(source), object);\n    }\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     */\n    function copySymbolsIn(source, object) {\n      return copyObject(source, getSymbolsIn(source), object);\n    }\n\n    /**\n     * Creates a function like `_.groupBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} [initializer] The accumulator object initializer.\n     * @returns {Function} Returns the new aggregator function.\n     */\n    function createAggregator(setter, initializer) {\n      return function(collection, iteratee) {\n        var func = isArray(collection) ? arrayAggregator : baseAggregator,\n            accumulator = initializer ? initializer() : {};\n\n        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n      };\n    }\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     */\n    function 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\n    /**\n     * Creates a `baseEach` or `baseEachRight` function.\n     *\n     * @private\n     * @param {Function} eachFunc The function to iterate over a collection.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseEach(eachFunc, fromRight) {\n      return function(collection, iteratee) {\n        if (collection == null) {\n          return collection;\n        }\n        if (!isArrayLike(collection)) {\n          return eachFunc(collection, iteratee);\n        }\n        var length = collection.length,\n            index = fromRight ? length : -1,\n            iterable = Object(collection);\n\n        while ((fromRight ? index-- : ++index < length)) {\n          if (iteratee(iterable[index], index, iterable) === false) {\n            break;\n          }\n        }\n        return collection;\n      };\n    }\n\n    /**\n     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseFor(fromRight) {\n      return function(object, iteratee, keysFunc) {\n        var index = -1,\n            iterable = Object(object),\n            props = keysFunc(object),\n            length = props.length;\n\n        while (length--) {\n          var key = props[fromRight ? length : ++index];\n          if (iteratee(iterable[key], key, iterable) === false) {\n            break;\n          }\n        }\n        return object;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the optional `this`\n     * binding of `thisArg`.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createBind(func, bitmask, thisArg) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return fn.apply(isBind ? thisArg : this, arguments);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.lowerFirst`.\n     *\n     * @private\n     * @param {string} methodName The name of the `String` case method to use.\n     * @returns {Function} Returns the new case function.\n     */\n    function createCaseFirst(methodName) {\n      return function(string) {\n        string = toString(string);\n\n        var strSymbols = hasUnicode(string)\n          ? stringToArray(string)\n          : undefined;\n\n        var chr = strSymbols\n          ? strSymbols[0]\n          : string.charAt(0);\n\n        var trailing = strSymbols\n          ? castSlice(strSymbols, 1).join('')\n          : string.slice(1);\n\n        return chr[methodName]() + trailing;\n      };\n    }\n\n    /**\n     * Creates a function like `_.camelCase`.\n     *\n     * @private\n     * @param {Function} callback The function to combine each word.\n     * @returns {Function} Returns the new compounder function.\n     */\n    function createCompounder(callback) {\n      return function(string) {\n        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n      };\n    }\n\n    /**\n     * Creates a function that produces an instance of `Ctor` regardless of\n     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n     *\n     * @private\n     * @param {Function} Ctor The constructor to wrap.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCtor(Ctor) {\n      return function() {\n        // Use a `switch` statement to work with class constructors. See\n        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n        // for more details.\n        var args = arguments;\n        switch (args.length) {\n          case 0: return new Ctor;\n          case 1: return new Ctor(args[0]);\n          case 2: return new Ctor(args[0], args[1]);\n          case 3: return new Ctor(args[0], args[1], args[2]);\n          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n        }\n        var thisBinding = baseCreate(Ctor.prototype),\n            result = Ctor.apply(thisBinding, args);\n\n        // Mimic the constructor's `return` behavior.\n        // See https://es5.github.io/#x13.2.2 for more details.\n        return isObject(result) ? result : thisBinding;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to enable currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {number} arity The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCurry(func, bitmask, arity) {\n      var Ctor = createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length,\n            placeholder = getHolder(wrapper);\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n          ? []\n          : replaceHolders(args, placeholder);\n\n        length -= holders.length;\n        if (length < arity) {\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, undefined,\n            args, holders, undefined, undefined, arity - length);\n        }\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return apply(fn, this, args);\n      }\n      return wrapper;\n    }\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     */\n    function createFind(findIndexFunc) {\n      return function(collection, predicate, fromIndex) {\n        var iterable = Object(collection);\n        if (!isArrayLike(collection)) {\n          var iteratee = getIteratee(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\n    /**\n     * Creates a `_.flow` or `_.flowRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new flow function.\n     */\n    function createFlow(fromRight) {\n      return flatRest(function(funcs) {\n        var length = funcs.length,\n            index = length,\n            prereq = LodashWrapper.prototype.thru;\n\n        if (fromRight) {\n          funcs.reverse();\n        }\n        while (index--) {\n          var func = funcs[index];\n          if (typeof func != 'function') {\n            throw new TypeError(FUNC_ERROR_TEXT);\n          }\n          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n            var wrapper = new LodashWrapper([], true);\n          }\n        }\n        index = wrapper ? index : length;\n        while (++index < length) {\n          func = funcs[index];\n\n          var funcName = getFuncName(func),\n              data = funcName == 'wrapper' ? getData(func) : undefined;\n\n          if (data && isLaziable(data[0]) &&\n                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n                !data[4].length && data[9] == 1\n              ) {\n            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n          } else {\n            wrapper = (func.length == 1 && isLaziable(func))\n              ? wrapper[funcName]()\n              : wrapper.thru(func);\n          }\n        }\n        return function() {\n          var args = arguments,\n              value = args[0];\n\n          if (wrapper && args.length == 1 && isArray(value)) {\n            return wrapper.plant(value).value();\n          }\n          var index = 0,\n              result = length ? funcs[index].apply(this, args) : value;\n\n          while (++index < length) {\n            result = funcs[index].call(this, result);\n          }\n          return result;\n        };\n      });\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with optional `this`\n     * binding of `thisArg`, partial application, and currying.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [partialsRight] The arguments to append to those provided\n     *  to the new function.\n     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n      var isAry = bitmask & WRAP_ARY_FLAG,\n          isBind = bitmask & WRAP_BIND_FLAG,\n          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n          isFlip = bitmask & WRAP_FLIP_FLAG,\n          Ctor = isBindKey ? undefined : createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length;\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        if (isCurried) {\n          var placeholder = getHolder(wrapper),\n              holdersCount = countHolders(args, placeholder);\n        }\n        if (partials) {\n          args = composeArgs(args, partials, holders, isCurried);\n        }\n        if (partialsRight) {\n          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n        }\n        length -= holdersCount;\n        if (isCurried && length < arity) {\n          var newHolders = replaceHolders(args, placeholder);\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n            args, newHolders, argPos, ary, arity - length\n          );\n        }\n        var thisBinding = isBind ? thisArg : this,\n            fn = isBindKey ? thisBinding[func] : func;\n\n        length = args.length;\n        if (argPos) {\n          args = reorder(args, argPos);\n        } else if (isFlip && length > 1) {\n          args.reverse();\n        }\n        if (isAry && ary < length) {\n          args.length = ary;\n        }\n        if (this && this !== root && this instanceof wrapper) {\n          fn = Ctor || createCtor(fn);\n        }\n        return fn.apply(thisBinding, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.invertBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} toIteratee The function to resolve iteratees.\n     * @returns {Function} Returns the new inverter function.\n     */\n    function createInverter(setter, toIteratee) {\n      return function(object, iteratee) {\n        return baseInverter(object, setter, toIteratee(iteratee), {});\n      };\n    }\n\n    /**\n     * Creates a function that performs a mathematical operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @param {number} [defaultValue] The value used for `undefined` arguments.\n     * @returns {Function} Returns the new mathematical operation function.\n     */\n    function createMathOperation(operator, defaultValue) {\n      return function(value, other) {\n        var result;\n        if (value === undefined && other === undefined) {\n          return defaultValue;\n        }\n        if (value !== undefined) {\n          result = value;\n        }\n        if (other !== undefined) {\n          if (result === undefined) {\n            return other;\n          }\n          if (typeof value == 'string' || typeof other == 'string') {\n            value = baseToString(value);\n            other = baseToString(other);\n          } else {\n            value = baseToNumber(value);\n            other = baseToNumber(other);\n          }\n          result = operator(value, other);\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function like `_.over`.\n     *\n     * @private\n     * @param {Function} arrayFunc The function to iterate over iteratees.\n     * @returns {Function} Returns the new over function.\n     */\n    function createOver(arrayFunc) {\n      return flatRest(function(iteratees) {\n        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n        return baseRest(function(args) {\n          var thisArg = this;\n          return arrayFunc(iteratees, function(iteratee) {\n            return apply(iteratee, thisArg, args);\n          });\n        });\n      });\n    }\n\n    /**\n     * Creates the padding for `string` based on `length`. The `chars` string\n     * is truncated if the number of characters exceeds `length`.\n     *\n     * @private\n     * @param {number} length The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padding for `string`.\n     */\n    function createPadding(length, chars) {\n      chars = chars === undefined ? ' ' : baseToString(chars);\n\n      var charsLength = chars.length;\n      if (charsLength < 2) {\n        return charsLength ? baseRepeat(chars, length) : chars;\n      }\n      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n      return hasUnicode(chars)\n        ? castSlice(stringToArray(result), 0, length).join('')\n        : result.slice(0, length);\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the `this` binding\n     * of `thisArg` and `partials` prepended to the arguments it receives.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {Array} partials The arguments to prepend to those provided to\n     *  the new function.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createPartial(func, bitmask, thisArg, partials) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var argsIndex = -1,\n            argsLength = arguments.length,\n            leftIndex = -1,\n            leftLength = partials.length,\n            args = Array(leftLength + argsLength),\n            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n        while (++leftIndex < leftLength) {\n          args[leftIndex] = partials[leftIndex];\n        }\n        while (argsLength--) {\n          args[leftIndex++] = arguments[++argsIndex];\n        }\n        return apply(fn, isBind ? thisArg : this, args);\n      }\n      return wrapper;\n    }\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     */\n    function 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\n    /**\n     * Creates a function that performs a relational operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @returns {Function} Returns the new relational operation function.\n     */\n    function createRelationalOperation(operator) {\n      return function(value, other) {\n        if (!(typeof value == 'string' && typeof other == 'string')) {\n          value = toNumber(value);\n          other = toNumber(other);\n        }\n        return operator(value, other);\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to continue currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {Function} wrapFunc The function to create the `func` wrapper.\n     * @param {*} placeholder The placeholder value.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n      var isCurry = bitmask & WRAP_CURRY_FLAG,\n          newHolders = isCurry ? holders : undefined,\n          newHoldersRight = isCurry ? undefined : holders,\n          newPartials = isCurry ? partials : undefined,\n          newPartialsRight = isCurry ? undefined : partials;\n\n      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n      }\n      var newData = [\n        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n        newHoldersRight, argPos, ary, arity\n      ];\n\n      var result = wrapFunc.apply(undefined, newData);\n      if (isLaziable(func)) {\n        setData(result, newData);\n      }\n      result.placeholder = placeholder;\n      return setWrapToString(result, func, bitmask);\n    }\n\n    /**\n     * Creates a function like `_.round`.\n     *\n     * @private\n     * @param {string} methodName The name of the `Math` method to use when rounding.\n     * @returns {Function} Returns the new round function.\n     */\n    function createRound(methodName) {\n      var func = Math[methodName];\n      return function(number, precision) {\n        number = toNumber(number);\n        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n        if (precision && nativeIsFinite(number)) {\n          // Shift with exponential notation to avoid floating-point issues.\n          // See [MDN](https://mdn.io/round#Examples) for more details.\n          var pair = (toString(number) + 'e').split('e'),\n              value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n          pair = (toString(value) + 'e').split('e');\n          return +(pair[0] + 'e' + (+pair[1] - precision));\n        }\n        return func(number);\n      };\n    }\n\n    /**\n     * Creates a set object of `values`.\n     *\n     * @private\n     * @param {Array} values The values to add to the set.\n     * @returns {Object} Returns the new set.\n     */\n    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n      return new Set(values);\n    };\n\n    /**\n     * Creates a `_.toPairs` or `_.toPairsIn` function.\n     *\n     * @private\n     * @param {Function} keysFunc The function to get the keys of a given object.\n     * @returns {Function} Returns the new pairs function.\n     */\n    function createToPairs(keysFunc) {\n      return function(object) {\n        var tag = getTag(object);\n        if (tag == mapTag) {\n          return mapToArray(object);\n        }\n        if (tag == setTag) {\n          return setToPairs(object);\n        }\n        return baseToPairs(object, keysFunc(object));\n      };\n    }\n\n    /**\n     * Creates a function that either curries or invokes `func` with optional\n     * `this` binding and partially applied arguments.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags.\n     *    1 - `_.bind`\n     *    2 - `_.bindKey`\n     *    4 - `_.curry` or `_.curryRight` of a bound function\n     *    8 - `_.curry`\n     *   16 - `_.curryRight`\n     *   32 - `_.partial`\n     *   64 - `_.partialRight`\n     *  128 - `_.rearg`\n     *  256 - `_.ary`\n     *  512 - `_.flip`\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to be partially applied.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n      if (!isBindKey && typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var length = partials ? partials.length : 0;\n      if (!length) {\n        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n        partials = holders = undefined;\n      }\n      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n      arity = arity === undefined ? arity : toInteger(arity);\n      length -= holders ? holders.length : 0;\n\n      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n        var partialsRight = partials,\n            holdersRight = holders;\n\n        partials = holders = undefined;\n      }\n      var data = isBindKey ? undefined : getData(func);\n\n      var newData = [\n        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n        argPos, ary, arity\n      ];\n\n      if (data) {\n        mergeData(newData, data);\n      }\n      func = newData[0];\n      bitmask = newData[1];\n      thisArg = newData[2];\n      partials = newData[3];\n      holders = newData[4];\n      arity = newData[9] = newData[9] === undefined\n        ? (isBindKey ? 0 : func.length)\n        : nativeMax(newData[9] - length, 0);\n\n      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n      }\n      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n        var result = createBind(func, bitmask, thisArg);\n      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n        result = createCurry(func, bitmask, arity);\n      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n        result = createPartial(func, bitmask, thisArg, partials);\n      } else {\n        result = createHybrid.apply(undefined, newData);\n      }\n      var setter = data ? baseSetData : setData;\n      return setWrapToString(setter(result, newData), func, bitmask);\n    }\n\n    /**\n     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n     * of source objects to the destination object for all destination properties\n     * that resolve to `undefined`.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to assign.\n     * @param {Object} object The parent object of `objValue`.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsAssignIn(objValue, srcValue, key, object) {\n      if (objValue === undefined ||\n          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        return srcValue;\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n     * objects into destination objects that are passed thru.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to merge.\n     * @param {Object} object The parent object of `objValue`.\n     * @param {Object} source The parent object of `srcValue`.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n      if (isObject(objValue) && isObject(srcValue)) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, objValue);\n        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n        stack['delete'](srcValue);\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n     * objects.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {string} key The key of the property to inspect.\n     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n     */\n    function customOmitClone(value) {\n      return isPlainObject(value) ? undefined : value;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for arrays with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Array} array The array to compare.\n     * @param {Array} other The other array to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `array` and `other` objects.\n     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n     */\n    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          arrLength = array.length,\n          othLength = other.length;\n\n      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(array);\n      if (stacked && stack.get(other)) {\n        return stacked == other;\n      }\n      var index = -1,\n          result = true,\n          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n      stack.set(array, other);\n      stack.set(other, array);\n\n      // Ignore non-index properties.\n      while (++index < arrLength) {\n        var arrValue = array[index],\n            othValue = other[index];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, arrValue, index, other, array, stack)\n            : customizer(arrValue, othValue, index, array, other, stack);\n        }\n        if (compared !== undefined) {\n          if (compared) {\n            continue;\n          }\n          result = false;\n          break;\n        }\n        // Recursively compare arrays (susceptible to call stack limits).\n        if (seen) {\n          if (!arraySome(other, function(othValue, othIndex) {\n                if (!cacheHas(seen, othIndex) &&\n                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n                  return seen.push(othIndex);\n                }\n              })) {\n            result = false;\n            break;\n          }\n        } else if (!(\n              arrValue === othValue ||\n                equalFunc(arrValue, othValue, bitmask, customizer, stack)\n            )) {\n          result = false;\n          break;\n        }\n      }\n      stack['delete'](array);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for comparing objects of\n     * the same `toStringTag`.\n     *\n     * **Note:** This function only supports comparing values with tags of\n     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {string} tag The `toStringTag` of the objects to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n      switch (tag) {\n        case dataViewTag:\n          if ((object.byteLength != other.byteLength) ||\n              (object.byteOffset != other.byteOffset)) {\n            return false;\n          }\n          object = object.buffer;\n          other = other.buffer;\n\n        case arrayBufferTag:\n          if ((object.byteLength != other.byteLength) ||\n              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n            return false;\n          }\n          return true;\n\n        case boolTag:\n        case dateTag:\n        case numberTag:\n          // Coerce booleans to `1` or `0` and dates to milliseconds.\n          // Invalid dates are coerced to `NaN`.\n          return eq(+object, +other);\n\n        case errorTag:\n          return object.name == other.name && object.message == other.message;\n\n        case regexpTag:\n        case stringTag:\n          // Coerce regexes to strings and treat strings, primitives and objects,\n          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n          // for more details.\n          return object == (other + '');\n\n        case mapTag:\n          var convert = mapToArray;\n\n        case setTag:\n          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n          convert || (convert = setToArray);\n\n          if (object.size != other.size && !isPartial) {\n            return false;\n          }\n          // Assume cyclic values are equal.\n          var stacked = stack.get(object);\n          if (stacked) {\n            return stacked == other;\n          }\n          bitmask |= COMPARE_UNORDERED_FLAG;\n\n          // Recursively compare objects (susceptible to call stack limits).\n          stack.set(object, other);\n          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n          stack['delete'](object);\n          return result;\n\n        case symbolTag:\n          if (symbolValueOf) {\n            return symbolValueOf.call(object) == symbolValueOf.call(other);\n          }\n      }\n      return false;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for objects with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          objProps = getAllKeys(object),\n          objLength = objProps.length,\n          othProps = getAllKeys(other),\n          othLength = othProps.length;\n\n      if (objLength != othLength && !isPartial) {\n        return false;\n      }\n      var index = objLength;\n      while (index--) {\n        var key = objProps[index];\n        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n          return false;\n        }\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked && stack.get(other)) {\n        return stacked == other;\n      }\n      var result = true;\n      stack.set(object, other);\n      stack.set(other, object);\n\n      var skipCtor = isPartial;\n      while (++index < objLength) {\n        key = objProps[index];\n        var objValue = object[key],\n            othValue = other[key];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, objValue, key, other, object, stack)\n            : customizer(objValue, othValue, key, object, other, stack);\n        }\n        // Recursively compare objects (susceptible to call stack limits).\n        if (!(compared === undefined\n              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n              : compared\n            )) {\n          result = false;\n          break;\n        }\n        skipCtor || (skipCtor = key == 'constructor');\n      }\n      if (result && !skipCtor) {\n        var objCtor = object.constructor,\n            othCtor = other.constructor;\n\n        // Non `Object` object instances with different constructors are not equal.\n        if (objCtor != othCtor &&\n            ('constructor' in object && 'constructor' in other) &&\n            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n              typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n          result = false;\n        }\n      }\n      stack['delete'](object);\n      stack['delete'](other);\n      return result;\n    }\n\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     */\n    function flatRest(func) {\n      return setToString(overRest(func, undefined, flatten), func + '');\n    }\n\n    /**\n     * Creates an array of own enumerable property names and symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeys(object) {\n      return baseGetAllKeys(object, keys, getSymbols);\n    }\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     */\n    function getAllKeysIn(object) {\n      return baseGetAllKeys(object, keysIn, getSymbolsIn);\n    }\n\n    /**\n     * Gets metadata for `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {*} Returns the metadata for `func`.\n     */\n    var getData = !metaMap ? noop : function(func) {\n      return metaMap.get(func);\n    };\n\n    /**\n     * Gets the name of `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {string} Returns the function name.\n     */\n    function getFuncName(func) {\n      var result = (func.name + ''),\n          array = realNames[result],\n          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n      while (length--) {\n        var data = array[length],\n            otherFunc = data.func;\n        if (otherFunc == null || otherFunc == func) {\n          return data.name;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Gets the argument placeholder value for `func`.\n     *\n     * @private\n     * @param {Function} func The function to inspect.\n     * @returns {*} Returns the placeholder value.\n     */\n    function getHolder(func) {\n      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n      return object.placeholder;\n    }\n\n    /**\n     * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n     * this function returns the custom method, otherwise it returns `baseIteratee`.\n     * If arguments are provided, the chosen function is invoked with them and\n     * its result is returned.\n     *\n     * @private\n     * @param {*} [value] The value to convert to an iteratee.\n     * @param {number} [arity] The arity of the created iteratee.\n     * @returns {Function} Returns the chosen function or its result.\n     */\n    function getIteratee() {\n      var result = lodash.iteratee || iteratee;\n      result = result === iteratee ? baseIteratee : result;\n      return arguments.length ? result(arguments[0], arguments[1]) : result;\n    }\n\n    /**\n     * Gets the data for `map`.\n     *\n     * @private\n     * @param {Object} map The map to query.\n     * @param {string} key The reference key.\n     * @returns {*} Returns the map data.\n     */\n    function getMapData(map, key) {\n      var data = map.__data__;\n      return isKeyable(key)\n        ? data[typeof key == 'string' ? 'string' : 'hash']\n        : data.map;\n    }\n\n    /**\n     * Gets the property names, values, and compare flags of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the match data of `object`.\n     */\n    function getMatchData(object) {\n      var result = keys(object),\n          length = result.length;\n\n      while (length--) {\n        var key = result[length],\n            value = object[key];\n\n        result[length] = [key, value, isStrictComparable(value)];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the native function at `key` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the method to get.\n     * @returns {*} Returns the function if it's native, else `undefined`.\n     */\n    function getNative(object, key) {\n      var value = getValue(object, key);\n      return baseIsNative(value) ? value : undefined;\n    }\n\n    /**\n     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the raw `toStringTag`.\n     */\n    function getRawTag(value) {\n      var isOwn = hasOwnProperty.call(value, symToStringTag),\n          tag = value[symToStringTag];\n\n      try {\n        value[symToStringTag] = undefined;\n        var unmasked = true;\n      } catch (e) {}\n\n      var result = nativeObjectToString.call(value);\n      if (unmasked) {\n        if (isOwn) {\n          value[symToStringTag] = tag;\n        } else {\n          delete value[symToStringTag];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array of the own enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n      if (object == null) {\n        return [];\n      }\n      object = Object(object);\n      return arrayFilter(nativeGetSymbols(object), function(symbol) {\n        return propertyIsEnumerable.call(object, symbol);\n      });\n    };\n\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     */\n    var 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\n    /**\n     * Gets the `toStringTag` of `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    var getTag = baseGetTag;\n\n    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n        (Map && getTag(new Map) != mapTag) ||\n        (Promise && getTag(Promise.resolve()) != promiseTag) ||\n        (Set && getTag(new Set) != setTag) ||\n        (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n      getTag = function(value) {\n        var result = baseGetTag(value),\n            Ctor = result == objectTag ? value.constructor : undefined,\n            ctorString = Ctor ? toSource(Ctor) : '';\n\n        if (ctorString) {\n          switch (ctorString) {\n            case dataViewCtorString: return dataViewTag;\n            case mapCtorString: return mapTag;\n            case promiseCtorString: return promiseTag;\n            case setCtorString: return setTag;\n            case weakMapCtorString: return weakMapTag;\n          }\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Gets the view, applying any `transforms` to the `start` and `end` positions.\n     *\n     * @private\n     * @param {number} start The start of the view.\n     * @param {number} end The end of the view.\n     * @param {Array} transforms The transformations to apply to the view.\n     * @returns {Object} Returns an object containing the `start` and `end`\n     *  positions of the view.\n     */\n    function getView(start, end, transforms) {\n      var index = -1,\n          length = transforms.length;\n\n      while (++index < length) {\n        var data = transforms[index],\n            size = data.size;\n\n        switch (data.type) {\n          case 'drop':      start += size; break;\n          case 'dropRight': end -= size; break;\n          case 'take':      end = nativeMin(end, start + size); break;\n          case 'takeRight': start = nativeMax(start, end - size); break;\n        }\n      }\n      return { 'start': start, 'end': end };\n    }\n\n    /**\n     * Extracts wrapper details from the `source` body comment.\n     *\n     * @private\n     * @param {string} source The source to inspect.\n     * @returns {Array} Returns the wrapper details.\n     */\n    function getWrapDetails(source) {\n      var match = source.match(reWrapDetails);\n      return match ? match[1].split(reSplitDetails) : [];\n    }\n\n    /**\n     * Checks if `path` exists on `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @param {Function} hasFunc The function to check properties.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     */\n    function hasPath(object, path, hasFunc) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          result = false;\n\n      while (++index < length) {\n        var key = toKey(path[index]);\n        if (!(result = object != null && hasFunc(object, key))) {\n          break;\n        }\n        object = object[key];\n      }\n      if (result || ++index != length) {\n        return result;\n      }\n      length = object == null ? 0 : object.length;\n      return !!length && isLength(length) && isIndex(key, length) &&\n        (isArray(object) || isArguments(object));\n    }\n\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     */\n    function 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\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     */\n    function initCloneObject(object) {\n      return (typeof object.constructor == 'function' && !isPrototype(object))\n        ? baseCreate(getPrototype(object))\n        : {};\n    }\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     */\n    function 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\n    /**\n     * Inserts wrapper `details` in a comment at the top of the `source` body.\n     *\n     * @private\n     * @param {string} source The source to modify.\n     * @returns {Array} details The details to insert.\n     * @returns {string} Returns the modified source.\n     */\n    function insertWrapDetails(source, details) {\n      var length = details.length;\n      if (!length) {\n        return source;\n      }\n      var lastIndex = length - 1;\n      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n      details = details.join(length > 2 ? ', ' : ' ');\n      return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n    }\n\n    /**\n     * Checks if `value` is a flattenable `arguments` object or array.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n     */\n    function isFlattenable(value) {\n      return isArray(value) || isArguments(value) ||\n        !!(spreadableSymbol && value && value[spreadableSymbol]);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like index.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n     */\n    function isIndex(value, length) {\n      var type = typeof value;\n      length = length == null ? MAX_SAFE_INTEGER : length;\n\n      return !!length &&\n        (type == 'number' ||\n          (type != 'symbol' && reIsUint.test(value))) &&\n            (value > -1 && value % 1 == 0 && value < length);\n    }\n\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     */\n    function 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\n    /**\n     * Checks if `value` is a property name and not a property path.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n     */\n    function isKey(value, object) {\n      if (isArray(value)) {\n        return false;\n      }\n      var type = typeof value;\n      if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n          value == null || isSymbol(value)) {\n        return true;\n      }\n      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n        (object != null && value in Object(object));\n    }\n\n    /**\n     * Checks if `value` is suitable for use as unique object key.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n     */\n    function isKeyable(value) {\n      var type = typeof value;\n      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n        ? (value !== '__proto__')\n        : (value === null);\n    }\n\n    /**\n     * Checks if `func` has a lazy counterpart.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n     *  else `false`.\n     */\n    function isLaziable(func) {\n      var funcName = getFuncName(func),\n          other = lodash[funcName];\n\n      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n        return false;\n      }\n      if (func === other) {\n        return true;\n      }\n      var data = getData(other);\n      return !!data && func === data[0];\n    }\n\n    /**\n     * Checks if `func` has its source masked.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n     */\n    function isMasked(func) {\n      return !!maskSrcKey && (maskSrcKey in func);\n    }\n\n    /**\n     * Checks if `func` is capable of being masked.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n     */\n    var isMaskable = coreJsData ? isFunction : stubFalse;\n\n    /**\n     * Checks if `value` is likely a prototype object.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n     */\n    function isPrototype(value) {\n      var Ctor = value && value.constructor,\n          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n      return value === proto;\n    }\n\n    /**\n     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` if suitable for strict\n     *  equality comparisons, else `false`.\n     */\n    function isStrictComparable(value) {\n      return value === value && !isObject(value);\n    }\n\n    /**\n     * A specialized version of `matchesProperty` for source values suitable\n     * for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {string} key The key of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function matchesStrictComparable(key, srcValue) {\n      return function(object) {\n        if (object == null) {\n          return false;\n        }\n        return object[key] === srcValue &&\n          (srcValue !== undefined || (key in Object(object)));\n      };\n    }\n\n    /**\n     * A specialized version of `_.memoize` which clears the memoized function's\n     * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n     *\n     * @private\n     * @param {Function} func The function to have its output memoized.\n     * @returns {Function} Returns the new memoized function.\n     */\n    function memoizeCapped(func) {\n      var result = memoize(func, function(key) {\n        if (cache.size === MAX_MEMOIZE_SIZE) {\n          cache.clear();\n        }\n        return key;\n      });\n\n      var cache = result.cache;\n      return result;\n    }\n\n    /**\n     * Merges the function metadata of `source` into `data`.\n     *\n     * Merging metadata reduces the number of wrappers used to invoke a function.\n     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n     * may be applied regardless of execution order. Methods like `_.ary` and\n     * `_.rearg` modify function arguments, making the order in which they are\n     * executed important, preventing the merging of metadata. However, we make\n     * an exception for a safe combined case where curried functions have `_.ary`\n     * and or `_.rearg` applied.\n     *\n     * @private\n     * @param {Array} data The destination metadata.\n     * @param {Array} source The source metadata.\n     * @returns {Array} Returns `data`.\n     */\n    function mergeData(data, source) {\n      var bitmask = data[1],\n          srcBitmask = source[1],\n          newBitmask = bitmask | srcBitmask,\n          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n      var isCombo =\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n      // Exit early if metadata can't be merged.\n      if (!(isCommon || isCombo)) {\n        return data;\n      }\n      // Use source `thisArg` if available.\n      if (srcBitmask & WRAP_BIND_FLAG) {\n        data[2] = source[2];\n        // Set when currying a bound function.\n        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n      }\n      // Compose partial arguments.\n      var value = source[3];\n      if (value) {\n        var partials = data[3];\n        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n      }\n      // Compose partial right arguments.\n      value = source[5];\n      if (value) {\n        partials = data[5];\n        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n      }\n      // Use source `argPos` if available.\n      value = source[7];\n      if (value) {\n        data[7] = value;\n      }\n      // Use source `ary` if it's smaller.\n      if (srcBitmask & WRAP_ARY_FLAG) {\n        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n      }\n      // Use source `arity` if one is not provided.\n      if (data[9] == null) {\n        data[9] = source[9];\n      }\n      // Use source `func` and merge bitmasks.\n      data[0] = source[0];\n      data[1] = newBitmask;\n\n      return data;\n    }\n\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     */\n    function 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\n    /**\n     * Converts `value` to a string using `Object.prototype.toString`.\n     *\n     * @private\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     */\n    function objectToString(value) {\n      return nativeObjectToString.call(value);\n    }\n\n    /**\n     * A specialized version of `baseRest` which transforms the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @param {Function} transform The rest array transform.\n     * @returns {Function} Returns the new function.\n     */\n    function overRest(func, start, transform) {\n      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n      return function() {\n        var args = arguments,\n            index = -1,\n            length = nativeMax(args.length - start, 0),\n            array = Array(length);\n\n        while (++index < length) {\n          array[index] = args[start + index];\n        }\n        index = -1;\n        var otherArgs = Array(start + 1);\n        while (++index < start) {\n          otherArgs[index] = args[index];\n        }\n        otherArgs[start] = transform(array);\n        return apply(func, this, otherArgs);\n      };\n    }\n\n    /**\n     * Gets the parent value at `path` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array} path The path to get the parent value of.\n     * @returns {*} Returns the parent value.\n     */\n    function parent(object, path) {\n      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n    }\n\n    /**\n     * Reorder `array` according to the specified indexes where the element at\n     * the first index is assigned as the first element, the element at\n     * the second index is assigned as the second element, and so on.\n     *\n     * @private\n     * @param {Array} array The array to reorder.\n     * @param {Array} indexes The arranged array indexes.\n     * @returns {Array} Returns `array`.\n     */\n    function reorder(array, indexes) {\n      var arrLength = array.length,\n          length = nativeMin(indexes.length, arrLength),\n          oldArray = copyArray(array);\n\n      while (length--) {\n        var index = indexes[length];\n        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n      }\n      return array;\n    }\n\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     */\n    function 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\n    /**\n     * Sets metadata for `func`.\n     *\n     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n     * period of time, it will trip its breaker and transition to an identity\n     * function to avoid garbage collection pauses in V8. See\n     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n     * for more details.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var setData = shortOut(baseSetData);\n\n    /**\n     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    var setTimeout = ctxSetTimeout || function(func, wait) {\n      return root.setTimeout(func, wait);\n    };\n\n    /**\n     * Sets the `toString` method of `func` to return `string`.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var setToString = shortOut(baseSetToString);\n\n    /**\n     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n     * with wrapper details in a comment at the top of the source body.\n     *\n     * @private\n     * @param {Function} wrapper The function to modify.\n     * @param {Function} reference The reference function.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Function} Returns `wrapper`.\n     */\n    function setWrapToString(wrapper, reference, bitmask) {\n      var source = (reference + '');\n      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n    }\n\n    /**\n     * Creates a function that'll short out and invoke `identity` instead\n     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n     * milliseconds.\n     *\n     * @private\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new shortable function.\n     */\n    function shortOut(func) {\n      var count = 0,\n          lastCalled = 0;\n\n      return function() {\n        var stamp = nativeNow(),\n            remaining = HOT_SPAN - (stamp - lastCalled);\n\n        lastCalled = stamp;\n        if (remaining > 0) {\n          if (++count >= HOT_COUNT) {\n            return arguments[0];\n          }\n        } else {\n          count = 0;\n        }\n        return func.apply(undefined, arguments);\n      };\n    }\n\n    /**\n     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @param {number} [size=array.length] The size of `array`.\n     * @returns {Array} Returns `array`.\n     */\n    function shuffleSelf(array, size) {\n      var index = -1,\n          length = array.length,\n          lastIndex = length - 1;\n\n      size = size === undefined ? length : size;\n      while (++index < size) {\n        var rand = baseRandom(index, lastIndex),\n            value = array[rand];\n\n        array[rand] = array[index];\n        array[index] = value;\n      }\n      array.length = size;\n      return array;\n    }\n\n    /**\n     * Converts `string` to a property path array.\n     *\n     * @private\n     * @param {string} string The string to convert.\n     * @returns {Array} Returns the property path array.\n     */\n    var stringToPath = memoizeCapped(function(string) {\n      var result = [];\n      if (string.charCodeAt(0) === 46 /* . */) {\n        result.push('');\n      }\n      string.replace(rePropName, function(match, number, quote, subString) {\n        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n      });\n      return result;\n    });\n\n    /**\n     * Converts `value` to a string key if it's not a string or symbol.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {string|symbol} Returns the key.\n     */\n    function toKey(value) {\n      if (typeof value == 'string' || isSymbol(value)) {\n        return value;\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * Converts `func` to its source code.\n     *\n     * @private\n     * @param {Function} func The function to convert.\n     * @returns {string} Returns the source code.\n     */\n    function toSource(func) {\n      if (func != null) {\n        try {\n          return funcToString.call(func);\n        } catch (e) {}\n        try {\n          return (func + '');\n        } catch (e) {}\n      }\n      return '';\n    }\n\n    /**\n     * Updates wrapper `details` based on `bitmask` flags.\n     *\n     * @private\n     * @returns {Array} details The details to modify.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Array} Returns `details`.\n     */\n    function updateWrapDetails(details, bitmask) {\n      arrayEach(wrapFlags, function(pair) {\n        var value = '_.' + pair[0];\n        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n          details.push(value);\n        }\n      });\n      return details.sort();\n    }\n\n    /**\n     * Creates a clone of `wrapper`.\n     *\n     * @private\n     * @param {Object} wrapper The wrapper to clone.\n     * @returns {Object} Returns the cloned wrapper.\n     */\n    function wrapperClone(wrapper) {\n      if (wrapper instanceof LazyWrapper) {\n        return wrapper.clone();\n      }\n      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n      result.__actions__ = copyArray(wrapper.__actions__);\n      result.__index__  = wrapper.__index__;\n      result.__values__ = wrapper.__values__;\n      return result;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of elements split into groups the length of `size`.\n     * If `array` can't be split evenly, the final chunk will be the remaining\n     * elements.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to process.\n     * @param {number} [size=1] The length of each chunk\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the new array of chunks.\n     * @example\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 2);\n     * // => [['a', 'b'], ['c', 'd']]\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 3);\n     * // => [['a', 'b', 'c'], ['d']]\n     */\n    function chunk(array, size, guard) {\n      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n        size = 1;\n      } else {\n        size = nativeMax(toInteger(size), 0);\n      }\n      var length = array == null ? 0 : array.length;\n      if (!length || size < 1) {\n        return [];\n      }\n      var index = 0,\n          resIndex = 0,\n          result = Array(nativeCeil(length / size));\n\n      while (index < length) {\n        result[resIndex++] = baseSlice(array, index, (index += size));\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array with all falsey values removed. The values `false`, `null`,\n     * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to compact.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.compact([0, 1, false, 2, '', 3]);\n     * // => [1, 2, 3]\n     */\n    function compact(array) {\n      var index = -1,\n          length = array == null ? 0 : array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index];\n        if (value) {\n          result[resIndex++] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates a new array concatenating `array` with any additional arrays\n     * and/or values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to concatenate.\n     * @param {...*} [values] The values to concatenate.\n     * @returns {Array} Returns the new concatenated array.\n     * @example\n     *\n     * var array = [1];\n     * var other = _.concat(array, 2, [3], [[4]]);\n     *\n     * console.log(other);\n     * // => [1, 2, 3, [4]]\n     *\n     * console.log(array);\n     * // => [1]\n     */\n    function concat() {\n      var length = arguments.length;\n      if (!length) {\n        return [];\n      }\n      var args = Array(length - 1),\n          array = arguments[0],\n          index = length;\n\n      while (index--) {\n        args[index - 1] = arguments[index];\n      }\n      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n    }\n\n    /**\n     * Creates an array of `array` values not included in the other given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * **Note:** Unlike `_.pullAll`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.without, _.xor\n     * @example\n     *\n     * _.difference([2, 1], [2, 3]);\n     * // => [1]\n     */\n    var difference = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `iteratee` which\n     * is invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var differenceBy = baseRest(function(array, values) {\n      var iteratee = last(values);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `comparator`\n     * which is invoked to compare elements of `array` to `values`. The order and\n     * references of result values are determined by the first array. The comparator\n     * is invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     *\n     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }]\n     */\n    var differenceWith = baseRest(function(array, values) {\n      var comparator = last(values);\n      if (isArrayLikeObject(comparator)) {\n        comparator = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.drop([1, 2, 3]);\n     * // => [2, 3]\n     *\n     * _.drop([1, 2, 3], 2);\n     * // => [3]\n     *\n     * _.drop([1, 2, 3], 5);\n     * // => []\n     *\n     * _.drop([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function drop(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.dropRight([1, 2, 3]);\n     * // => [1, 2]\n     *\n     * _.dropRight([1, 2, 3], 2);\n     * // => [1]\n     *\n     * _.dropRight([1, 2, 3], 5);\n     * // => []\n     *\n     * _.dropRight([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function dropRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the end.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.dropRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropRightWhile(users, ['active', false]);\n     * // => objects for ['barney']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropRightWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the beginning.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.dropWhile(users, function(o) { return !o.active; });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropWhile(users, ['active', false]);\n     * // => objects for ['pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true)\n        : [];\n    }\n\n    /**\n     * Fills elements of `array` with `value` from `start` up to, but not\n     * including, `end`.\n     *\n     * **Note:** This method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Array\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.fill(array, 'a');\n     * console.log(array);\n     * // => ['a', 'a', 'a']\n     *\n     * _.fill(Array(3), 2);\n     * // => [2, 2, 2]\n     *\n     * _.fill([4, 6, 8, 10], '*', 1, 3);\n     * // => [4, '*', '*', 10]\n     */\n    function fill(array, value, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n        start = 0;\n        end = length;\n      }\n      return baseFill(array, value, start, end);\n    }\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     */\n    function 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, getIteratee(predicate, 3), index);\n    }\n\n    /**\n     * This method is like `_.findIndex` except that it iterates over elements\n     * of `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.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=array.length-1] 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': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n     * // => 2\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n     * // => 0\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastIndex(users, ['active', false]);\n     * // => 2\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastIndex(users, 'active');\n     * // => 0\n     */\n    function findLastIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length - 1;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = fromIndex < 0\n          ? nativeMax(length + index, 0)\n          : nativeMin(index, length - 1);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n    }\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     */\n    function flatten(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, 1) : [];\n    }\n\n    /**\n     * Recursively flattens `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flattenDeep([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, 3, 4, 5]\n     */\n    function flattenDeep(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, INFINITY) : [];\n    }\n\n    /**\n     * Recursively flatten `array` up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * var array = [1, [2, [3, [4]], 5]];\n     *\n     * _.flattenDepth(array, 1);\n     * // => [1, 2, [3, [4]], 5]\n     *\n     * _.flattenDepth(array, 2);\n     * // => [1, 2, 3, [4], 5]\n     */\n    function flattenDepth(array, depth) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(array, depth);\n    }\n\n    /**\n     * The inverse of `_.toPairs`; this method returns an object composed\n     * from key-value `pairs`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} pairs The key-value pairs.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.fromPairs([['a', 1], ['b', 2]]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function fromPairs(pairs) {\n      var index = -1,\n          length = pairs == null ? 0 : pairs.length,\n          result = {};\n\n      while (++index < length) {\n        var pair = pairs[index];\n        result[pair[0]] = pair[1];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias first\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the first element of `array`.\n     * @example\n     *\n     * _.head([1, 2, 3]);\n     * // => 1\n     *\n     * _.head([]);\n     * // => undefined\n     */\n    function head(array) {\n      return (array && array.length) ? array[0] : undefined;\n    }\n\n    /**\n     * Gets the index at which the first occurrence of `value` is found in `array`\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. If `fromIndex` is negative, it's used as the\n     * offset from the end of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.indexOf([1, 2, 1, 2], 2);\n     * // => 1\n     *\n     * // Search from the `fromIndex`.\n     * _.indexOf([1, 2, 1, 2], 2, 2);\n     * // => 3\n     */\n    function indexOf(array, value, 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 baseIndexOf(array, value, index);\n    }\n\n    /**\n     * Gets all but 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 {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.initial([1, 2, 3]);\n     * // => [1, 2]\n     */\n    function initial(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 0, -1) : [];\n    }\n\n    /**\n     * Creates an array of unique values that are included in all given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersection([2, 1], [2, 3]);\n     * // => [2]\n     */\n    var intersection = baseRest(function(arrays) {\n      var mapped = arrayMap(arrays, castArrayLikeObject);\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped)\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `iteratee`\n     * which is invoked for each element of each `arrays` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [2.1]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }]\n     */\n    var intersectionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      if (iteratee === last(mapped)) {\n        iteratee = undefined;\n      } else {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `comparator`\n     * which is invoked to compare elements of `arrays`. The order and references\n     * of result values are determined by the first array. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.intersectionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }]\n     */\n    var intersectionWith = baseRest(function(arrays) {\n      var comparator = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      if (comparator) {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Converts all elements in `array` into a string separated by `separator`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to convert.\n     * @param {string} [separator=','] The element separator.\n     * @returns {string} Returns the joined string.\n     * @example\n     *\n     * _.join(['a', 'b', 'c'], '~');\n     * // => 'a~b~c'\n     */\n    function join(array, separator) {\n      return array == null ? '' : nativeJoin.call(array, separator);\n    }\n\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     */\n    function last(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? array[length - 1] : undefined;\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it iterates over elements of\n     * `array` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.lastIndexOf([1, 2, 1, 2], 2);\n     * // => 3\n     *\n     * // Search from the `fromIndex`.\n     * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n     * // => 1\n     */\n    function lastIndexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n      }\n      return value === value\n        ? strictLastIndexOf(array, value, index)\n        : baseFindIndex(array, baseIsNaN, index, true);\n    }\n\n    /**\n     * Gets the element at index `n` of `array`. If `n` is negative, the nth\n     * element from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.11.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=0] The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     *\n     * _.nth(array, 1);\n     * // => 'b'\n     *\n     * _.nth(array, -2);\n     * // => 'c';\n     */\n    function nth(array, n) {\n      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n    }\n\n    /**\n     * Removes all given values from `array` using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n     * to remove elements from an array by predicate.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...*} [values] The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pull(array, 'a', 'c');\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    var pull = baseRest(pullAll);\n\n    /**\n     * This method is like `_.pull` except that it accepts an array of values to remove.\n     *\n     * **Note:** Unlike `_.difference`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pullAll(array, ['a', 'c']);\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    function pullAll(array, values) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values)\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `iteratee` which is\n     * invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The iteratee is invoked with one argument: (value).\n     *\n     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n     *\n     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n     * console.log(array);\n     * // => [{ 'x': 2 }]\n     */\n    function pullAllBy(array, values, iteratee) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, getIteratee(iteratee, 2))\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `comparator` which\n     * is invoked to compare elements of `array` to `values`. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n     *\n     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n     * console.log(array);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n     */\n    function pullAllWith(array, values, comparator) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, undefined, comparator)\n        : array;\n    }\n\n    /**\n     * Removes elements from `array` corresponding to `indexes` and returns an\n     * array of removed elements.\n     *\n     * **Note:** Unlike `_.at`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     * var pulled = _.pullAt(array, [1, 3]);\n     *\n     * console.log(array);\n     * // => ['a', 'c']\n     *\n     * console.log(pulled);\n     * // => ['b', 'd']\n     */\n    var pullAt = flatRest(function(array, indexes) {\n      var length = array == null ? 0 : array.length,\n          result = baseAt(array, indexes);\n\n      basePullAt(array, arrayMap(indexes, function(index) {\n        return isIndex(index, length) ? +index : index;\n      }).sort(compareAscending));\n\n      return result;\n    });\n\n    /**\n     * Removes all elements from `array` that `predicate` returns truthy for\n     * and returns an array of the removed elements. The predicate is invoked\n     * with three arguments: (value, index, array).\n     *\n     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n     * to pull elements from an array by value.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = [1, 2, 3, 4];\n     * var evens = _.remove(array, function(n) {\n     *   return n % 2 == 0;\n     * });\n     *\n     * console.log(array);\n     * // => [1, 3]\n     *\n     * console.log(evens);\n     * // => [2, 4]\n     */\n    function remove(array, predicate) {\n      var result = [];\n      if (!(array && array.length)) {\n        return result;\n      }\n      var index = -1,\n          indexes = [],\n          length = array.length;\n\n      predicate = getIteratee(predicate, 3);\n      while (++index < length) {\n        var value = array[index];\n        if (predicate(value, index, array)) {\n          result.push(value);\n          indexes.push(index);\n        }\n      }\n      basePullAt(array, indexes);\n      return result;\n    }\n\n    /**\n     * Reverses `array` so that the first element becomes the last, the second\n     * element becomes the second to last, and so on.\n     *\n     * **Note:** This method mutates `array` and is based on\n     * [`Array#reverse`](https://mdn.io/Array/reverse).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.reverse(array);\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function reverse(array) {\n      return array == null ? array : nativeReverse.call(array);\n    }\n\n    /**\n     * Creates a slice of `array` from `start` up to, but not including, `end`.\n     *\n     * **Note:** This method is used instead of\n     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n     * returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function slice(array, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n        start = 0;\n        end = length;\n      }\n      else {\n        start = start == null ? 0 : toInteger(start);\n        end = end === undefined ? length : toInteger(end);\n      }\n      return baseSlice(array, start, end);\n    }\n\n    /**\n     * Uses a binary search to determine the lowest index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedIndex([30, 50], 40);\n     * // => 1\n     */\n    function sortedIndex(array, value) {\n      return baseSortedIndex(array, value);\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 0\n     */\n    function sortedIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 1\n     */\n    function sortedIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value);\n        if (index < length && eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it returns the highest\n     * index at which `value` should be inserted into `array` in order to\n     * maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n     * // => 4\n     */\n    function sortedLastIndex(array, value) {\n      return baseSortedIndex(array, value, true);\n    }\n\n    /**\n     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 1\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 1\n     */\n    function sortedLastIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n    }\n\n    /**\n     * This method is like `_.lastIndexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 3\n     */\n    function sortedLastIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value, true) - 1;\n        if (eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.uniq` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniq([1, 1, 2]);\n     * // => [1, 2]\n     */\n    function sortedUniq(array) {\n      return (array && array.length)\n        ? baseSortedUniq(array)\n        : [];\n    }\n\n    /**\n     * This method is like `_.uniqBy` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n     * // => [1.1, 2.3]\n     */\n    function sortedUniqBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSortedUniq(array, getIteratee(iteratee, 2))\n        : [];\n    }\n\n    /**\n     * Gets all but the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.tail([1, 2, 3]);\n     * // => [2, 3]\n     */\n    function tail(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 1, length) : [];\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.take([1, 2, 3]);\n     * // => [1]\n     *\n     * _.take([1, 2, 3], 2);\n     * // => [1, 2]\n     *\n     * _.take([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.take([1, 2, 3], 0);\n     * // => []\n     */\n    function take(array, n, guard) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.takeRight([1, 2, 3]);\n     * // => [3]\n     *\n     * _.takeRight([1, 2, 3], 2);\n     * // => [2, 3]\n     *\n     * _.takeRight([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.takeRight([1, 2, 3], 0);\n     * // => []\n     */\n    function takeRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the end. Elements are\n     * taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.takeRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeRightWhile(users, ['active', false]);\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeRightWhile(users, 'active');\n     * // => []\n     */\n    function takeRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), false, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the beginning. Elements\n     * are taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.takeWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeWhile(users, ['active', false]);\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeWhile(users, 'active');\n     * // => []\n     */\n    function takeWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3))\n        : [];\n    }\n\n    /**\n     * Creates an array of unique values, in order, from all given arrays using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.union([2], [1, 2]);\n     * // => [2, 1]\n     */\n    var union = baseRest(function(arrays) {\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which uniqueness is computed. Result values are chosen from the first\n     * array in which the value occurs. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    var unionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `comparator` which\n     * is invoked to compare elements of `arrays`. Result values are chosen from\n     * the first array in which the value occurs. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.unionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var unionWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n    });\n\n    /**\n     * Creates a duplicate-free version of an array, using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons, in which only the first occurrence of each element\n     * is kept. The order of result values is determined by the order they occur\n     * in the array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniq([2, 1, 2]);\n     * // => [2, 1]\n     */\n    function uniq(array) {\n      return (array && array.length) ? baseUniq(array) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * uniqueness is computed. The order of result values is determined by the\n     * order they occur in the array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    function uniqBy(array, iteratee) {\n      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `comparator` which\n     * is invoked to compare elements of `array`. The order of result values is\n     * determined by the order they occur in the array.The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.uniqWith(objects, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n     */\n    function uniqWith(array, comparator) {\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts an array of grouped\n     * elements and creates an array regrouping the elements to their pre-zip\n     * configuration.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.2.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     *\n     * _.unzip(zipped);\n     * // => [['a', 'b'], [1, 2], [true, false]]\n     */\n    function unzip(array) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var length = 0;\n      array = arrayFilter(array, function(group) {\n        if (isArrayLikeObject(group)) {\n          length = nativeMax(group.length, length);\n          return true;\n        }\n      });\n      return baseTimes(length, function(index) {\n        return arrayMap(array, baseProperty(index));\n      });\n    }\n\n    /**\n     * This method is like `_.unzip` except that it accepts `iteratee` to specify\n     * how regrouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  regrouped values.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n     * // => [[1, 10, 100], [2, 20, 200]]\n     *\n     * _.unzipWith(zipped, _.add);\n     * // => [3, 30, 300]\n     */\n    function unzipWith(array, iteratee) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var result = unzip(array);\n      if (iteratee == null) {\n        return result;\n      }\n      return arrayMap(result, function(group) {\n        return apply(iteratee, undefined, group);\n      });\n    }\n\n    /**\n     * Creates an array excluding all given values using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.pull`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...*} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.xor\n     * @example\n     *\n     * _.without([2, 1, 2, 3], 1, 2);\n     * // => [3]\n     */\n    var without = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, values)\n        : [];\n    });\n\n    /**\n     * Creates an array of unique values that is the\n     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n     * of the given arrays. The order of result values is determined by the order\n     * they occur in the arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.without\n     * @example\n     *\n     * _.xor([2, 1], [2, 3]);\n     * // => [1, 3]\n     */\n    var xor = baseRest(function(arrays) {\n      return baseXor(arrayFilter(arrays, isArrayLikeObject));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which by which they're compared. The order of result values is determined\n     * by the order they occur in the arrays. The iteratee is invoked with one\n     * argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2, 3.4]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var xorBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `comparator` which is\n     * invoked to compare elements of `arrays`. The order of result values is\n     * determined by the order they occur in the arrays. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.xorWith(objects, others, _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var xorWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n    });\n\n    /**\n     * Creates an array of grouped elements, the first of which contains the\n     * first elements of the given arrays, the second of which contains the\n     * second elements of the given arrays, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     */\n    var zip = baseRest(unzip);\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     */\n    function zipObject(props, values) {\n      return baseZipObject(props || [], values || [], assignValue);\n    }\n\n    /**\n     * This method is like `_.zipObject` except that it supports property paths.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.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     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n     */\n    function zipObjectDeep(props, values) {\n      return baseZipObject(props || [], values || [], baseSet);\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts `iteratee` to specify\n     * how grouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  grouped values.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n     *   return a + b + c;\n     * });\n     * // => [111, 222]\n     */\n    var zipWith = baseRest(function(arrays) {\n      var length = arrays.length,\n          iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n      return unzipWith(arrays, iteratee);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n     * chain sequences enabled. The result of such sequences must be unwrapped\n     * with `_#value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Seq\n     * @param {*} value The value to wrap.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36 },\n     *   { 'user': 'fred',    'age': 40 },\n     *   { 'user': 'pebbles', 'age': 1 }\n     * ];\n     *\n     * var youngest = _\n     *   .chain(users)\n     *   .sortBy('age')\n     *   .map(function(o) {\n     *     return o.user + ' is ' + o.age;\n     *   })\n     *   .head()\n     *   .value();\n     * // => 'pebbles is 1'\n     */\n    function chain(value) {\n      var result = lodash(value);\n      result.__chain__ = true;\n      return result;\n    }\n\n    /**\n     * This method invokes `interceptor` and returns `value`. The interceptor\n     * is invoked with one argument; (value). The purpose of this method is to\n     * \"tap into\" a method chain sequence in order to modify intermediate results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * _([1, 2, 3])\n     *  .tap(function(array) {\n     *    // Mutate input array.\n     *    array.pop();\n     *  })\n     *  .reverse()\n     *  .value();\n     * // => [2, 1]\n     */\n    function tap(value, interceptor) {\n      interceptor(value);\n      return value;\n    }\n\n    /**\n     * This method is like `_.tap` except that it returns the result of `interceptor`.\n     * The purpose of this method is to \"pass thru\" values replacing intermediate\n     * results in a method chain sequence.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns the result of `interceptor`.\n     * @example\n     *\n     * _('  abc  ')\n     *  .chain()\n     *  .trim()\n     *  .thru(function(value) {\n     *    return [value];\n     *  })\n     *  .value();\n     * // => ['abc']\n     */\n    function thru(value, interceptor) {\n      return interceptor(value);\n    }\n\n    /**\n     * This method is the wrapper version of `_.at`.\n     *\n     * @name at\n     * @memberOf _\n     * @since 1.0.0\n     * @category Seq\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _(object).at(['a[0].b.c', 'a[1]']).value();\n     * // => [3, 4]\n     */\n    var wrapperAt = flatRest(function(paths) {\n      var length = paths.length,\n          start = length ? paths[0] : 0,\n          value = this.__wrapped__,\n          interceptor = function(object) { return baseAt(object, paths); };\n\n      if (length > 1 || this.__actions__.length ||\n          !(value instanceof LazyWrapper) || !isIndex(start)) {\n        return this.thru(interceptor);\n      }\n      value = value.slice(start, +start + (length ? 1 : 0));\n      value.__actions__.push({\n        'func': thru,\n        'args': [interceptor],\n        'thisArg': undefined\n      });\n      return new LodashWrapper(value, this.__chain__).thru(function(array) {\n        if (length && !array.length) {\n          array.push(undefined);\n        }\n        return array;\n      });\n    });\n\n    /**\n     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n     *\n     * @name chain\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 }\n     * ];\n     *\n     * // A sequence without explicit chaining.\n     * _(users).head();\n     * // => { 'user': 'barney', 'age': 36 }\n     *\n     * // A sequence with explicit chaining.\n     * _(users)\n     *   .chain()\n     *   .head()\n     *   .pick('user')\n     *   .value();\n     * // => { 'user': 'barney' }\n     */\n    function wrapperChain() {\n      return chain(this);\n    }\n\n    /**\n     * Executes the chain sequence and returns the wrapped result.\n     *\n     * @name commit\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2];\n     * var wrapped = _(array).push(3);\n     *\n     * console.log(array);\n     * // => [1, 2]\n     *\n     * wrapped = wrapped.commit();\n     * console.log(array);\n     * // => [1, 2, 3]\n     *\n     * wrapped.last();\n     * // => 3\n     *\n     * console.log(array);\n     * // => [1, 2, 3]\n     */\n    function wrapperCommit() {\n      return new LodashWrapper(this.value(), this.__chain__);\n    }\n\n    /**\n     * Gets the next value on a wrapped object following the\n     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n     *\n     * @name next\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the next iterator value.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 1 }\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 2 }\n     *\n     * wrapped.next();\n     * // => { 'done': true, 'value': undefined }\n     */\n    function wrapperNext() {\n      if (this.__values__ === undefined) {\n        this.__values__ = toArray(this.value());\n      }\n      var done = this.__index__ >= this.__values__.length,\n          value = done ? undefined : this.__values__[this.__index__++];\n\n      return { 'done': done, 'value': value };\n    }\n\n    /**\n     * Enables the wrapper to be iterable.\n     *\n     * @name Symbol.iterator\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the wrapper object.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped[Symbol.iterator]() === wrapped;\n     * // => true\n     *\n     * Array.from(wrapped);\n     * // => [1, 2]\n     */\n    function wrapperToIterator() {\n      return this;\n    }\n\n    /**\n     * Creates a clone of the chain sequence planting `value` as the wrapped value.\n     *\n     * @name plant\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @param {*} value The value to plant.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2]).map(square);\n     * var other = wrapped.plant([3, 4]);\n     *\n     * other.value();\n     * // => [9, 16]\n     *\n     * wrapped.value();\n     * // => [1, 4]\n     */\n    function wrapperPlant(value) {\n      var result,\n          parent = this;\n\n      while (parent instanceof baseLodash) {\n        var clone = wrapperClone(parent);\n        clone.__index__ = 0;\n        clone.__values__ = undefined;\n        if (result) {\n          previous.__wrapped__ = clone;\n        } else {\n          result = clone;\n        }\n        var previous = clone;\n        parent = parent.__wrapped__;\n      }\n      previous.__wrapped__ = value;\n      return result;\n    }\n\n    /**\n     * This method is the wrapper version of `_.reverse`.\n     *\n     * **Note:** This method mutates the wrapped array.\n     *\n     * @name reverse\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _(array).reverse().value()\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function wrapperReverse() {\n      var value = this.__wrapped__;\n      if (value instanceof LazyWrapper) {\n        var wrapped = value;\n        if (this.__actions__.length) {\n          wrapped = new LazyWrapper(this);\n        }\n        wrapped = wrapped.reverse();\n        wrapped.__actions__.push({\n          'func': thru,\n          'args': [reverse],\n          'thisArg': undefined\n        });\n        return new LodashWrapper(wrapped, this.__chain__);\n      }\n      return this.thru(reverse);\n    }\n\n    /**\n     * Executes the chain sequence to resolve the unwrapped value.\n     *\n     * @name value\n     * @memberOf _\n     * @since 0.1.0\n     * @alias toJSON, valueOf\n     * @category Seq\n     * @returns {*} Returns the resolved unwrapped value.\n     * @example\n     *\n     * _([1, 2, 3]).value();\n     * // => [1, 2, 3]\n     */\n    function wrapperValue() {\n      return baseWrapperValue(this.__wrapped__, this.__actions__);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the number of times the key was returned by `iteratee`. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.countBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': 1, '6': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.countBy(['one', 'two', 'three'], 'length');\n     * // => { '3': 2, '5': 1 }\n     */\n    var countBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        ++result[key];\n      } else {\n        baseAssignValue(result, key, 1);\n      }\n    });\n\n    /**\n     * Checks if `predicate` returns truthy for **all** elements of `collection`.\n     * Iteration is stopped once `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * **Note:** This method returns `true` for\n     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n     * elements of empty collections.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.every([true, 1, null, 'yes'], Boolean);\n     * // => false\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.every(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.every(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.every(users, 'active');\n     * // => false\n     */\n    function every(collection, predicate, guard) {\n      var func = isArray(collection) ? arrayEvery : baseEvery;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning an array of all elements\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * **Note:** Unlike `_.remove`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.reject\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * _.filter(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, { 'age': 36, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.filter(users, 'active');\n     * // => objects for ['barney']\n     */\n    function filter(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, getIteratee(predicate, 3));\n    }\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     */\n    var find = createFind(findIndex);\n\n    /**\n     * This method is like `_.find` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.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=collection.length-1] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * _.findLast([1, 2, 3, 4], function(n) {\n     *   return n % 2 == 1;\n     * });\n     * // => 3\n     */\n    var findLast = createFind(findLastIndex);\n\n    /**\n     * Creates a flattened array of values by running each element in `collection`\n     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n     * with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.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 flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [n, n];\n     * }\n     *\n     * _.flatMap([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMap(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), 1);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.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 flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDeep([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMapDeep(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), INFINITY);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDepth([1, 2], duplicate, 2);\n     * // => [[1, 1], [2, 2]]\n     */\n    function flatMapDepth(collection, iteratee, depth) {\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(map(collection, iteratee), depth);\n    }\n\n    /**\n     * Iterates over elements of `collection` and invokes `iteratee` for each element.\n     * The iteratee is invoked with three arguments: (value, index|key, collection).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n     * property are iterated like arrays. To avoid this behavior use `_.forIn`\n     * or `_.forOwn` for object iteration.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias each\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEachRight\n     * @example\n     *\n     * _.forEach([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `1` then `2`.\n     *\n     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forEach(collection, iteratee) {\n      var func = isArray(collection) ? arrayEach : baseEach;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forEach` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @alias eachRight\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEach\n     * @example\n     *\n     * _.forEachRight([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `2` then `1`.\n     */\n    function forEachRight(collection, iteratee) {\n      var func = isArray(collection) ? arrayEachRight : baseEachRight;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The order of grouped values\n     * is determined by the order they occur in `collection`. The corresponding\n     * value of each key is an array of elements responsible for generating the\n     * key. The iteratee is 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} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': [4.2], '6': [6.1, 6.3] }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.groupBy(['one', 'two', 'three'], 'length');\n     * // => { '3': ['one', 'two'], '5': ['three'] }\n     */\n    var groupBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        baseAssignValue(result, key, [value]);\n      }\n    });\n\n    /**\n     * Checks if `value` is in `collection`. If `collection` is a string, it's\n     * checked for a substring of `value`, otherwise\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * is used for equality comparisons. If `fromIndex` is negative, it's used as\n     * the offset from the end of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {boolean} Returns `true` if `value` is found, else `false`.\n     * @example\n     *\n     * _.includes([1, 2, 3], 1);\n     * // => true\n     *\n     * _.includes([1, 2, 3], 1, 2);\n     * // => false\n     *\n     * _.includes({ 'a': 1, 'b': 2 }, 1);\n     * // => true\n     *\n     * _.includes('abcd', 'bc');\n     * // => true\n     */\n    function includes(collection, value, fromIndex, guard) {\n      collection = isArrayLike(collection) ? collection : values(collection);\n      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n      var length = collection.length;\n      if (fromIndex < 0) {\n        fromIndex = nativeMax(length + fromIndex, 0);\n      }\n      return isString(collection)\n        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n    }\n\n    /**\n     * Invokes the method at `path` of each element in `collection`, returning\n     * an array of the results of each invoked method. Any additional arguments\n     * are provided to each invoked method. If `path` is a function, it's invoked\n     * for, and `this` bound to, each element in `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array|Function|string} path The path of the method to invoke or\n     *  the function invoked per iteration.\n     * @param {...*} [args] The arguments to invoke each method with.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n     * // => [[1, 5, 7], [1, 2, 3]]\n     *\n     * _.invokeMap([123, 456], String.prototype.split, '');\n     * // => [['1', '2', '3'], ['4', '5', '6']]\n     */\n    var invokeMap = baseRest(function(collection, path, args) {\n      var index = -1,\n          isFunc = typeof path == 'function',\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value) {\n        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n      });\n      return result;\n    });\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the last element responsible for generating the key. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * var array = [\n     *   { 'dir': 'left', 'code': 97 },\n     *   { 'dir': 'right', 'code': 100 }\n     * ];\n     *\n     * _.keyBy(array, function(o) {\n     *   return String.fromCharCode(o.code);\n     * });\n     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n     *\n     * _.keyBy(array, 'dir');\n     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n     */\n    var keyBy = createAggregator(function(result, value, key) {\n      baseAssignValue(result, key, value);\n    });\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     */\n    function map(collection, iteratee) {\n      var func = isArray(collection) ? arrayMap : baseMap;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.sortBy` except that it allows specifying the sort\n     * orders of the iteratees to sort by. If `orders` is unspecified, all values\n     * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n     * descending or \"asc\" for ascending sort order of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @param {string[]} [orders] The sort orders of `iteratees`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 34 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 36 }\n     * ];\n     *\n     * // Sort by `user` in ascending order and by `age` in descending order.\n     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     */\n    function orderBy(collection, iteratees, orders, guard) {\n      if (collection == null) {\n        return [];\n      }\n      if (!isArray(iteratees)) {\n        iteratees = iteratees == null ? [] : [iteratees];\n      }\n      orders = guard ? undefined : orders;\n      if (!isArray(orders)) {\n        orders = orders == null ? [] : [orders];\n      }\n      return baseOrderBy(collection, iteratees, orders);\n    }\n\n    /**\n     * Creates an array of elements split into two groups, the first of which\n     * contains elements `predicate` returns truthy for, the second of which\n     * contains elements `predicate` returns falsey for. The predicate is\n     * invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of grouped elements.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': false },\n     *   { 'user': 'fred',    'age': 40, 'active': true },\n     *   { 'user': 'pebbles', 'age': 1,  'active': false }\n     * ];\n     *\n     * _.partition(users, function(o) { return o.active; });\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.partition(users, { 'age': 1, 'active': false });\n     * // => objects for [['pebbles'], ['barney', 'fred']]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.partition(users, ['active', false]);\n     * // => objects for [['barney', 'pebbles'], ['fred']]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.partition(users, 'active');\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     */\n    var partition = createAggregator(function(result, value, key) {\n      result[key ? 0 : 1].push(value);\n    }, function() { return [[], []]; });\n\n    /**\n     * Reduces `collection` to a value which is the accumulated result of running\n     * each element in `collection` thru `iteratee`, where each successive\n     * invocation is supplied the return value of the previous. If `accumulator`\n     * is not given, the first element of `collection` is used as the initial\n     * value. The iteratee is invoked with four arguments:\n     * (accumulator, value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.reduce`, `_.reduceRight`, and `_.transform`.\n     *\n     * The guarded methods are:\n     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n     * and `sortBy`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduceRight\n     * @example\n     *\n     * _.reduce([1, 2], function(sum, n) {\n     *   return sum + n;\n     * }, 0);\n     * // => 3\n     *\n     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     *   return result;\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n     */\n    function reduce(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduce : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n    }\n\n    /**\n     * This method is like `_.reduce` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduce\n     * @example\n     *\n     * var array = [[0, 1], [2, 3], [4, 5]];\n     *\n     * _.reduceRight(array, function(flattened, other) {\n     *   return flattened.concat(other);\n     * }, []);\n     * // => [4, 5, 2, 3, 0, 1]\n     */\n    function reduceRight(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduceRight : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n    }\n\n    /**\n     * The opposite of `_.filter`; this method returns the elements of `collection`\n     * that `predicate` does **not** return truthy for.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.filter\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': true }\n     * ];\n     *\n     * _.reject(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.reject(users, { 'age': 40, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.reject(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.reject(users, 'active');\n     * // => objects for ['barney']\n     */\n    function reject(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, negate(getIteratee(predicate, 3)));\n    }\n\n    /**\n     * Gets a random element from `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     * @example\n     *\n     * _.sample([1, 2, 3, 4]);\n     * // => 2\n     */\n    function sample(collection) {\n      var func = isArray(collection) ? arraySample : baseSample;\n      return func(collection);\n    }\n\n    /**\n     * Gets `n` random elements at unique keys from `collection` up to the\n     * size of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} [n=1] The number of elements to sample.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the random elements.\n     * @example\n     *\n     * _.sampleSize([1, 2, 3], 2);\n     * // => [3, 1]\n     *\n     * _.sampleSize([1, 2, 3], 4);\n     * // => [2, 3, 1]\n     */\n    function sampleSize(collection, n, guard) {\n      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n      return func(collection, n);\n    }\n\n    /**\n     * Creates an array of shuffled values, using a version of the\n     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     * @example\n     *\n     * _.shuffle([1, 2, 3, 4]);\n     * // => [4, 1, 3, 2]\n     */\n    function shuffle(collection) {\n      var func = isArray(collection) ? arrayShuffle : baseShuffle;\n      return func(collection);\n    }\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     */\n    function 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\n    /**\n     * Checks if `predicate` returns truthy for **any** element of `collection`.\n     * Iteration is stopped once `predicate` returns truthy. The predicate is\n     * invoked with three 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 iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.some([null, 0, 'yes', false], Boolean);\n     * // => true\n     *\n     * var users = [\n     *   { 'user': 'barney', 'active': true },\n     *   { 'user': 'fred',   'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.some(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.some(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.some(users, 'active');\n     * // => true\n     */\n    function some(collection, predicate, guard) {\n      var func = isArray(collection) ? arraySome : baseSome;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\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': 40 },\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', 40]]\n     *\n     * _.sortBy(users, ['user', 'age']);\n     * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]\n     */\n    var 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\n    /*------------------------------------------------------------------------*/\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     */\n    var now = ctxNow || function() {\n      return root.Date.now();\n    };\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The opposite of `_.before`; this method creates a function that invokes\n     * `func` once it's called `n` or more times.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {number} n The number of calls before `func` is invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var saves = ['profile', 'settings'];\n     *\n     * var done = _.after(saves.length, function() {\n     *   console.log('done saving!');\n     * });\n     *\n     * _.forEach(saves, function(type) {\n     *   asyncSave({ 'type': type, 'complete': done });\n     * });\n     * // => Logs 'done saving!' after the two async saves have completed.\n     */\n    function after(n, func) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n < 1) {\n          return func.apply(this, arguments);\n        }\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func`, with up to `n` arguments,\n     * ignoring any additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @param {number} [n=func.length] The arity cap.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n     * // => [6, 8, 10]\n     */\n    function ary(func, n, guard) {\n      n = guard ? undefined : n;\n      n = (func && n == null) ? func.length : n;\n      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n    }\n\n    /**\n     * Creates a function that invokes `func`, with the `this` binding and arguments\n     * of the created function, while it's called less than `n` times. Subsequent\n     * calls to the created function return the result of the last `func` invocation.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {number} n The number of calls at which `func` is no longer invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * jQuery(element).on('click', _.before(5, addContactToList));\n     * // => Allows adding up to 4 contacts to the list.\n     */\n    function before(n, func) {\n      var result;\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n > 0) {\n          result = func.apply(this, arguments);\n        }\n        if (n <= 1) {\n          func = undefined;\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of `thisArg`\n     * and `partials` prepended to the arguments it receives.\n     *\n     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n     * property of bound functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to bind.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * function greet(greeting, punctuation) {\n     *   return greeting + ' ' + this.user + punctuation;\n     * }\n     *\n     * var object = { 'user': 'fred' };\n     *\n     * var bound = _.bind(greet, object, 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bind(greet, object, _, '!');\n     * bound('hi');\n     * // => 'hi fred!'\n     */\n    var bind = baseRest(function(func, thisArg, partials) {\n      var bitmask = WRAP_BIND_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bind));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(func, bitmask, thisArg, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes the method at `object[key]` with `partials`\n     * prepended to the arguments it receives.\n     *\n     * This method differs from `_.bind` by allowing bound functions to reference\n     * methods that may be redefined or don't yet exist. See\n     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n     * for more details.\n     *\n     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Function\n     * @param {Object} object The object to invoke the method on.\n     * @param {string} key The key of the method.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * var object = {\n     *   'user': 'fred',\n     *   'greet': function(greeting, punctuation) {\n     *     return greeting + ' ' + this.user + punctuation;\n     *   }\n     * };\n     *\n     * var bound = _.bindKey(object, 'greet', 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * object.greet = function(greeting, punctuation) {\n     *   return greeting + 'ya ' + this.user + punctuation;\n     * };\n     *\n     * bound('!');\n     * // => 'hiya fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bindKey(object, 'greet', _, '!');\n     * bound('hi');\n     * // => 'hiya fred!'\n     */\n    var bindKey = baseRest(function(object, key, partials) {\n      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bindKey));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(key, bitmask, object, partials, holders);\n    });\n\n    /**\n     * Creates a function that accepts arguments of `func` and either invokes\n     * `func` returning its result, if at least `arity` number of arguments have\n     * been provided, or returns a function that accepts the remaining `func`\n     * arguments, and so on. The arity of `func` may be specified if `func.length`\n     * is not sufficient.\n     *\n     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curry(abc);\n     *\n     * curried(1)(2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(1)(_, 3)(2);\n     * // => [1, 2, 3]\n     */\n    function curry(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curry.placeholder;\n      return result;\n    }\n\n    /**\n     * This method is like `_.curry` except that arguments are applied to `func`\n     * in the manner of `_.partialRight` instead of `_.partial`.\n     *\n     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curryRight(abc);\n     *\n     * curried(3)(2)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(2, 3)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(3)(1, _)(2);\n     * // => [1, 2, 3]\n     */\n    function curryRight(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curryRight.placeholder;\n      return result;\n    }\n\n    /**\n     * Creates a debounced function that delays invoking `func` until after `wait`\n     * milliseconds have elapsed since the last time the debounced function was\n     * invoked. The debounced function comes with a `cancel` method to cancel\n     * delayed `func` invocations and a `flush` method to immediately invoke them.\n     * Provide `options` to indicate whether `func` should be invoked on the\n     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n     * with the last arguments provided to the debounced function. Subsequent\n     * calls to the debounced function return the result of the last `func`\n     * invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the debounced function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.debounce` and `_.throttle`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to debounce.\n     * @param {number} [wait=0] The number of milliseconds to delay.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=false]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {number} [options.maxWait]\n     *  The maximum time `func` is allowed to be delayed before it's invoked.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new debounced function.\n     * @example\n     *\n     * // Avoid costly calculations while the window size is in flux.\n     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n     *\n     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n     * jQuery(element).on('click', _.debounce(sendMail, 300, {\n     *   'leading': true,\n     *   'trailing': false\n     * }));\n     *\n     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n     * var source = new EventSource('/stream');\n     * jQuery(source).on('message', debounced);\n     *\n     * // Cancel the trailing debounced invocation.\n     * jQuery(window).on('popstate', debounced.cancel);\n     */\n    function debounce(func, wait, options) {\n      var lastArgs,\n          lastThis,\n          maxWait,\n          result,\n          timerId,\n          lastCallTime,\n          lastInvokeTime = 0,\n          leading = false,\n          maxing = false,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      wait = toNumber(wait) || 0;\n      if (isObject(options)) {\n        leading = !!options.leading;\n        maxing = 'maxWait' in options;\n        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n\n      function invokeFunc(time) {\n        var args = lastArgs,\n            thisArg = lastThis;\n\n        lastArgs = lastThis = undefined;\n        lastInvokeTime = time;\n        result = func.apply(thisArg, args);\n        return result;\n      }\n\n      function leadingEdge(time) {\n        // Reset any `maxWait` timer.\n        lastInvokeTime = time;\n        // Start the timer for the trailing edge.\n        timerId = setTimeout(timerExpired, wait);\n        // Invoke the leading edge.\n        return leading ? invokeFunc(time) : result;\n      }\n\n      function remainingWait(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime,\n            timeWaiting = wait - timeSinceLastCall;\n\n        return maxing\n          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n          : timeWaiting;\n      }\n\n      function shouldInvoke(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime;\n\n        // Either this is the first call, activity has stopped and we're at the\n        // trailing edge, the system time has gone backwards and we're treating\n        // it as the trailing edge, or we've hit the `maxWait` limit.\n        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n      }\n\n      function timerExpired() {\n        var time = now();\n        if (shouldInvoke(time)) {\n          return trailingEdge(time);\n        }\n        // Restart the timer.\n        timerId = setTimeout(timerExpired, remainingWait(time));\n      }\n\n      function trailingEdge(time) {\n        timerId = undefined;\n\n        // Only invoke if we have `lastArgs` which means `func` has been\n        // debounced at least once.\n        if (trailing && lastArgs) {\n          return invokeFunc(time);\n        }\n        lastArgs = lastThis = undefined;\n        return result;\n      }\n\n      function cancel() {\n        if (timerId !== undefined) {\n          clearTimeout(timerId);\n        }\n        lastInvokeTime = 0;\n        lastArgs = lastCallTime = lastThis = timerId = undefined;\n      }\n\n      function flush() {\n        return timerId === undefined ? result : trailingEdge(now());\n      }\n\n      function debounced() {\n        var time = now(),\n            isInvoking = shouldInvoke(time);\n\n        lastArgs = arguments;\n        lastThis = this;\n        lastCallTime = time;\n\n        if (isInvoking) {\n          if (timerId === undefined) {\n            return leadingEdge(lastCallTime);\n          }\n          if (maxing) {\n            // Handle invocations in a tight loop.\n            clearTimeout(timerId);\n            timerId = setTimeout(timerExpired, wait);\n            return invokeFunc(lastCallTime);\n          }\n        }\n        if (timerId === undefined) {\n          timerId = setTimeout(timerExpired, wait);\n        }\n        return result;\n      }\n      debounced.cancel = cancel;\n      debounced.flush = flush;\n      return debounced;\n    }\n\n    /**\n     * Defers invoking the `func` until the current call stack has cleared. Any\n     * additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to defer.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.defer(function(text) {\n     *   console.log(text);\n     * }, 'deferred');\n     * // => Logs 'deferred' after one millisecond.\n     */\n    var defer = baseRest(function(func, args) {\n      return baseDelay(func, 1, args);\n    });\n\n    /**\n     * Invokes `func` after `wait` milliseconds. Any additional arguments are\n     * provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.delay(function(text) {\n     *   console.log(text);\n     * }, 1000, 'later');\n     * // => Logs 'later' after one second.\n     */\n    var delay = baseRest(function(func, wait, args) {\n      return baseDelay(func, toNumber(wait) || 0, args);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments reversed.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to flip arguments for.\n     * @returns {Function} Returns the new flipped function.\n     * @example\n     *\n     * var flipped = _.flip(function() {\n     *   return _.toArray(arguments);\n     * });\n     *\n     * flipped('a', 'b', 'c', 'd');\n     * // => ['d', 'c', 'b', 'a']\n     */\n    function flip(func) {\n      return createWrap(func, WRAP_FLIP_FLAG);\n    }\n\n    /**\n     * Creates a function that memoizes the result of `func`. If `resolver` is\n     * provided, it determines the cache key for storing the result based on the\n     * arguments provided to the memoized function. By default, the first argument\n     * provided to the memoized function is used as the map cache key. The `func`\n     * is invoked with the `this` binding of the memoized function.\n     *\n     * **Note:** The cache is exposed as the `cache` property on the memoized\n     * function. Its creation may be customized by replacing the `_.memoize.Cache`\n     * constructor with one whose instances implement the\n     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n     * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to have its output memoized.\n     * @param {Function} [resolver] The function to resolve the cache key.\n     * @returns {Function} Returns the new memoized function.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     * var other = { 'c': 3, 'd': 4 };\n     *\n     * var values = _.memoize(_.values);\n     * values(object);\n     * // => [1, 2]\n     *\n     * values(other);\n     * // => [3, 4]\n     *\n     * object.a = 2;\n     * values(object);\n     * // => [1, 2]\n     *\n     * // Modify the result cache.\n     * values.cache.set(object, ['a', 'b']);\n     * values(object);\n     * // => ['a', 'b']\n     *\n     * // Replace `_.memoize.Cache`.\n     * _.memoize.Cache = WeakMap;\n     */\n    function memoize(func, resolver) {\n      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var memoized = function() {\n        var args = arguments,\n            key = resolver ? resolver.apply(this, args) : args[0],\n            cache = memoized.cache;\n\n        if (cache.has(key)) {\n          return cache.get(key);\n        }\n        var result = func.apply(this, args);\n        memoized.cache = cache.set(key, result) || cache;\n        return result;\n      };\n      memoized.cache = new (memoize.Cache || MapCache);\n      return memoized;\n    }\n\n    // Expose `MapCache`.\n    memoize.Cache = MapCache;\n\n    /**\n     * Creates a function that negates the result of the predicate `func`. The\n     * `func` predicate is invoked with the `this` binding and arguments of the\n     * created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} predicate The predicate to negate.\n     * @returns {Function} Returns the new negated function.\n     * @example\n     *\n     * function isEven(n) {\n     *   return n % 2 == 0;\n     * }\n     *\n     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n     * // => [1, 3, 5]\n     */\n    function negate(predicate) {\n      if (typeof predicate != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return function() {\n        var args = arguments;\n        switch (args.length) {\n          case 0: return !predicate.call(this);\n          case 1: return !predicate.call(this, args[0]);\n          case 2: return !predicate.call(this, args[0], args[1]);\n          case 3: return !predicate.call(this, args[0], args[1], args[2]);\n        }\n        return !predicate.apply(this, args);\n      };\n    }\n\n    /**\n     * Creates a function that is restricted to invoking `func` once. Repeat calls\n     * to the function return the value of the first invocation. The `func` is\n     * invoked with the `this` binding and arguments of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var initialize = _.once(createApplication);\n     * initialize();\n     * initialize();\n     * // => `createApplication` is invoked once\n     */\n    function once(func) {\n      return before(2, func);\n    }\n\n    /**\n     * Creates a function that invokes `func` with its arguments transformed.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Function\n     * @param {Function} func The function to wrap.\n     * @param {...(Function|Function[])} [transforms=[_.identity]]\n     *  The argument transforms.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * function doubled(n) {\n     *   return n * 2;\n     * }\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var func = _.overArgs(function(x, y) {\n     *   return [x, y];\n     * }, [square, doubled]);\n     *\n     * func(9, 3);\n     * // => [81, 6]\n     *\n     * func(10, 5);\n     * // => [100, 10]\n     */\n    var overArgs = castRest(function(func, transforms) {\n      transforms = (transforms.length == 1 && isArray(transforms[0]))\n        ? arrayMap(transforms[0], baseUnary(getIteratee()))\n        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n      var funcsLength = transforms.length;\n      return baseRest(function(args) {\n        var index = -1,\n            length = nativeMin(args.length, funcsLength);\n\n        while (++index < length) {\n          args[index] = transforms[index].call(this, args[index]);\n        }\n        return apply(func, this, args);\n      });\n    });\n\n    /**\n     * Creates a function that invokes `func` with `partials` prepended to the\n     * arguments it receives. This method is like `_.bind` except it does **not**\n     * alter the `this` binding.\n     *\n     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.2.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var sayHelloTo = _.partial(greet, 'hello');\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     *\n     * // Partially applied with placeholders.\n     * var greetFred = _.partial(greet, _, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     */\n    var partial = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partial));\n      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * This method is like `_.partial` except that partially applied arguments\n     * are appended to the arguments it receives.\n     *\n     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var greetFred = _.partialRight(greet, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     *\n     * // Partially applied with placeholders.\n     * var sayHelloTo = _.partialRight(greet, 'hello', _);\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     */\n    var partialRight = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partialRight));\n      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments arranged according\n     * to the specified `indexes` where the argument value at the first index is\n     * provided as the first argument, the argument value at the second index is\n     * provided as the second argument, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to rearrange arguments for.\n     * @param {...(number|number[])} indexes The arranged argument indexes.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var rearged = _.rearg(function(a, b, c) {\n     *   return [a, b, c];\n     * }, [2, 0, 1]);\n     *\n     * rearged('b', 'c', 'a')\n     * // => ['a', 'b', 'c']\n     */\n    var rearg = flatRest(function(func, indexes) {\n      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n    });\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * created function and arguments from `start` and beyond provided as\n     * an array.\n     *\n     * **Note:** This method is based on the\n     * [rest parameter](https://mdn.io/rest_parameters).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.rest(function(what, names) {\n     *   return what + ' ' + _.initial(names).join(', ') +\n     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n     * });\n     *\n     * say('hello', 'fred', 'barney', 'pebbles');\n     * // => 'hello fred, barney, & pebbles'\n     */\n    function rest(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start === undefined ? start : toInteger(start);\n      return baseRest(func, start);\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * create function and an array of arguments much like\n     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n     *\n     * **Note:** This method is based on the\n     * [spread operator](https://mdn.io/spread_operator).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Function\n     * @param {Function} func The function to spread arguments over.\n     * @param {number} [start=0] The start position of the spread.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.spread(function(who, what) {\n     *   return who + ' says ' + what;\n     * });\n     *\n     * say(['fred', 'hello']);\n     * // => 'fred says hello'\n     *\n     * var numbers = Promise.all([\n     *   Promise.resolve(40),\n     *   Promise.resolve(36)\n     * ]);\n     *\n     * numbers.then(_.spread(function(x, y) {\n     *   return x + y;\n     * }));\n     * // => a Promise of 76\n     */\n    function spread(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start == null ? 0 : nativeMax(toInteger(start), 0);\n      return baseRest(function(args) {\n        var array = args[start],\n            otherArgs = castSlice(args, 0, start);\n\n        if (array) {\n          arrayPush(otherArgs, array);\n        }\n        return apply(func, this, otherArgs);\n      });\n    }\n\n    /**\n     * Creates a throttled function that only invokes `func` at most once per\n     * every `wait` milliseconds. The throttled function comes with a `cancel`\n     * method to cancel delayed `func` invocations and a `flush` method to\n     * immediately invoke them. Provide `options` to indicate whether `func`\n     * should be invoked on the leading and/or trailing edge of the `wait`\n     * timeout. The `func` is invoked with the last arguments provided to the\n     * throttled function. Subsequent calls to the throttled function return the\n     * result of the last `func` invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the throttled function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.throttle` and `_.debounce`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to throttle.\n     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=true]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new throttled function.\n     * @example\n     *\n     * // Avoid excessively updating the position while scrolling.\n     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n     *\n     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n     * jQuery(element).on('click', throttled);\n     *\n     * // Cancel the trailing throttled invocation.\n     * jQuery(window).on('popstate', throttled.cancel);\n     */\n    function throttle(func, wait, options) {\n      var leading = true,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      if (isObject(options)) {\n        leading = 'leading' in options ? !!options.leading : leading;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n      return debounce(func, wait, {\n        'leading': leading,\n        'maxWait': wait,\n        'trailing': trailing\n      });\n    }\n\n    /**\n     * Creates a function that accepts up to one argument, ignoring any\n     * additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.unary(parseInt));\n     * // => [6, 8, 10]\n     */\n    function unary(func) {\n      return ary(func, 1);\n    }\n\n    /**\n     * Creates a function that provides `value` to `wrapper` as its first\n     * argument. Any additional arguments provided to the function are appended\n     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n     * binding of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {*} value The value to wrap.\n     * @param {Function} [wrapper=identity] The wrapper function.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var p = _.wrap(_.escape, function(func, text) {\n     *   return '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\n     */\n    function wrap(value, wrapper) {\n      return partial(castFunction(wrapper), value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Casts `value` as an array if it's not one.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Lang\n     * @param {*} value The value to inspect.\n     * @returns {Array} Returns the cast array.\n     * @example\n     *\n     * _.castArray(1);\n     * // => [1]\n     *\n     * _.castArray({ 'a': 1 });\n     * // => [{ 'a': 1 }]\n     *\n     * _.castArray('abc');\n     * // => ['abc']\n     *\n     * _.castArray(null);\n     * // => [null]\n     *\n     * _.castArray(undefined);\n     * // => [undefined]\n     *\n     * _.castArray();\n     * // => []\n     *\n     * var array = [1, 2, 3];\n     * console.log(_.castArray(array) === array);\n     * // => true\n     */\n    function castArray() {\n      if (!arguments.length) {\n        return [];\n      }\n      var value = arguments[0];\n      return isArray(value) ? value : [value];\n    }\n\n    /**\n     * Creates a shallow clone of `value`.\n     *\n     * **Note:** This method is loosely based on the\n     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n     * and supports cloning arrays, array buffers, booleans, date objects, maps,\n     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n     * arrays. The own enumerable properties of `arguments` objects are cloned\n     * as plain objects. An empty object is returned for uncloneable values such\n     * as error objects, functions, DOM nodes, and WeakMaps.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeep\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var shallow = _.clone(objects);\n     * console.log(shallow[0] === objects[0]);\n     * // => true\n     */\n    function clone(value) {\n      return baseClone(value, CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.clone` except that it accepts `customizer` which\n     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n     * cloning is handled by the method instead. The `customizer` is invoked with\n     * up to four arguments; (value [, index|key, object, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeepWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(false);\n     *   }\n     * }\n     *\n     * var el = _.cloneWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 0\n     */\n    function cloneWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n    }\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     */\n    function cloneDeep(value) {\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.cloneWith` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.cloneWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(true);\n     *   }\n     * }\n     *\n     * var el = _.cloneDeepWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 20\n     */\n    function cloneDeepWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * Checks if `object` conforms to `source` by invoking the predicate\n     * properties of `source` with the corresponding property values of `object`.\n     *\n     * **Note:** This method is equivalent to `_.conforms` when `source` is\n     * partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n     * // => true\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n     * // => false\n     */\n    function conformsTo(object, source) {\n      return source == null || baseConformsTo(object, source, keys(source));\n    }\n\n    /**\n     * Performs a\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * comparison between two values to determine if they are equivalent.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.eq(object, object);\n     * // => true\n     *\n     * _.eq(object, other);\n     * // => false\n     *\n     * _.eq('a', 'a');\n     * // => true\n     *\n     * _.eq('a', Object('a'));\n     * // => false\n     *\n     * _.eq(NaN, NaN);\n     * // => true\n     */\n    function eq(value, other) {\n      return value === other || (value !== value && other !== other);\n    }\n\n    /**\n     * Checks if `value` is greater than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     * @see _.lt\n     * @example\n     *\n     * _.gt(3, 1);\n     * // => true\n     *\n     * _.gt(3, 3);\n     * // => false\n     *\n     * _.gt(1, 3);\n     * // => false\n     */\n    var gt = createRelationalOperation(baseGt);\n\n    /**\n     * Checks if `value` is greater than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than or equal to\n     *  `other`, else `false`.\n     * @see _.lte\n     * @example\n     *\n     * _.gte(3, 1);\n     * // => true\n     *\n     * _.gte(3, 3);\n     * // => true\n     *\n     * _.gte(1, 3);\n     * // => false\n     */\n    var gte = createRelationalOperation(function(value, other) {\n      return value >= other;\n    });\n\n    /**\n     * Checks if `value` is likely an `arguments` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArguments(function() { return arguments; }());\n     * // => true\n     *\n     * _.isArguments([1, 2, 3]);\n     * // => false\n     */\n    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n        !propertyIsEnumerable.call(value, 'callee');\n    };\n\n    /**\n     * Checks if `value` is classified as an `Array` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n     * @example\n     *\n     * _.isArray([1, 2, 3]);\n     * // => true\n     *\n     * _.isArray(document.body.children);\n     * // => false\n     *\n     * _.isArray('abc');\n     * // => false\n     *\n     * _.isArray(_.noop);\n     * // => false\n     */\n    var isArray = Array.isArray;\n\n    /**\n     * Checks if `value` is classified as an `ArrayBuffer` 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 an array buffer, else `false`.\n     * @example\n     *\n     * _.isArrayBuffer(new ArrayBuffer(2));\n     * // => true\n     *\n     * _.isArrayBuffer(new Array(2));\n     * // => false\n     */\n    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n    /**\n     * Checks if `value` is array-like. A value is considered array-like if it's\n     * not a function and has a `value.length` that's an integer greater than or\n     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n     * @example\n     *\n     * _.isArrayLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLike(document.body.children);\n     * // => true\n     *\n     * _.isArrayLike('abc');\n     * // => true\n     *\n     * _.isArrayLike(_.noop);\n     * // => false\n     */\n    function isArrayLike(value) {\n      return value != null && isLength(value.length) && !isFunction(value);\n    }\n\n    /**\n     * This method is like `_.isArrayLike` except that it also checks if `value`\n     * is an object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array-like object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArrayLikeObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLikeObject(document.body.children);\n     * // => true\n     *\n     * _.isArrayLikeObject('abc');\n     * // => false\n     *\n     * _.isArrayLikeObject(_.noop);\n     * // => false\n     */\n    function isArrayLikeObject(value) {\n      return isObjectLike(value) && isArrayLike(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a boolean primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n     * @example\n     *\n     * _.isBoolean(false);\n     * // => true\n     *\n     * _.isBoolean(null);\n     * // => false\n     */\n    function isBoolean(value) {\n      return value === true || value === false ||\n        (isObjectLike(value) && baseGetTag(value) == boolTag);\n    }\n\n    /**\n     * Checks if `value` is a buffer.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n     * @example\n     *\n     * _.isBuffer(new Buffer(2));\n     * // => true\n     *\n     * _.isBuffer(new Uint8Array(2));\n     * // => false\n     */\n    var isBuffer = nativeIsBuffer || stubFalse;\n\n    /**\n     * Checks if `value` is classified as a `Date` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     * @example\n     *\n     * _.isDate(new Date);\n     * // => true\n     *\n     * _.isDate('Mon April 23 2012');\n     * // => false\n     */\n    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n    /**\n     * Checks if `value` is likely a DOM element.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n     * @example\n     *\n     * _.isElement(document.body);\n     * // => true\n     *\n     * _.isElement('<body>');\n     * // => false\n     */\n    function isElement(value) {\n      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n    }\n\n    /**\n     * Checks if `value` is an empty object, collection, map, or set.\n     *\n     * Objects are considered empty if they have no own enumerable string keyed\n     * properties.\n     *\n     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n     * jQuery-like collections are considered empty if they have a `length` of `0`.\n     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n     * @example\n     *\n     * _.isEmpty(null);\n     * // => true\n     *\n     * _.isEmpty(true);\n     * // => true\n     *\n     * _.isEmpty(1);\n     * // => true\n     *\n     * _.isEmpty([1, 2, 3]);\n     * // => false\n     *\n     * _.isEmpty({ 'a': 1 });\n     * // => false\n     */\n    function isEmpty(value) {\n      if (value == null) {\n        return true;\n      }\n      if (isArrayLike(value) &&\n          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n        return !value.length;\n      }\n      var tag = getTag(value);\n      if (tag == mapTag || tag == setTag) {\n        return !value.size;\n      }\n      if (isPrototype(value)) {\n        return !baseKeys(value).length;\n      }\n      for (var key in value) {\n        if (hasOwnProperty.call(value, key)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * Performs a deep comparison between two values to determine if they are\n     * equivalent.\n     *\n     * **Note:** This method supports comparing arrays, array buffers, booleans,\n     * date objects, error objects, maps, numbers, `Object` objects, regexes,\n     * sets, strings, symbols, and typed arrays. `Object` objects are compared\n     * by their own, not inherited, enumerable properties. Functions and DOM\n     * nodes are compared by strict equality, i.e. `===`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.isEqual(object, other);\n     * // => true\n     *\n     * object === other;\n     * // => false\n     */\n    function isEqual(value, other) {\n      return baseIsEqual(value, other);\n    }\n\n    /**\n     * This method is like `_.isEqual` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with up to\n     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, othValue) {\n     *   if (isGreeting(objValue) && isGreeting(othValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var array = ['hello', 'goodbye'];\n     * var other = ['hi', 'goodbye'];\n     *\n     * _.isEqualWith(array, other, customizer);\n     * // => true\n     */\n    function isEqualWith(value, other, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      var result = customizer ? customizer(value, other) : undefined;\n      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n    }\n\n    /**\n     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n     * `SyntaxError`, `TypeError`, or `URIError` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n     * @example\n     *\n     * _.isError(new Error);\n     * // => true\n     *\n     * _.isError(Error);\n     * // => false\n     */\n    function isError(value) {\n      if (!isObjectLike(value)) {\n        return false;\n      }\n      var tag = baseGetTag(value);\n      return tag == errorTag || tag == domExcTag ||\n        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n    }\n\n    /**\n     * Checks if `value` is a finite primitive number.\n     *\n     * **Note:** This method is based on\n     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n     * @example\n     *\n     * _.isFinite(3);\n     * // => true\n     *\n     * _.isFinite(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isFinite(Infinity);\n     * // => false\n     *\n     * _.isFinite('3');\n     * // => false\n     */\n    function isFinite(value) {\n      return typeof value == 'number' && nativeIsFinite(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Function` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n     * @example\n     *\n     * _.isFunction(_);\n     * // => true\n     *\n     * _.isFunction(/abc/);\n     * // => false\n     */\n    function isFunction(value) {\n      if (!isObject(value)) {\n        return false;\n      }\n      // The use of `Object#toString` avoids issues with the `typeof` operator\n      // in Safari 9 which returns 'object' for typed arrays and other constructors.\n      var tag = baseGetTag(value);\n      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n    }\n\n    /**\n     * Checks if `value` is an integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n     * @example\n     *\n     * _.isInteger(3);\n     * // => true\n     *\n     * _.isInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isInteger(Infinity);\n     * // => false\n     *\n     * _.isInteger('3');\n     * // => false\n     */\n    function isInteger(value) {\n      return typeof value == 'number' && value == toInteger(value);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like length.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n     * @example\n     *\n     * _.isLength(3);\n     * // => true\n     *\n     * _.isLength(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isLength(Infinity);\n     * // => false\n     *\n     * _.isLength('3');\n     * // => false\n     */\n    function isLength(value) {\n      return typeof value == 'number' &&\n        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is the\n     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n     * @example\n     *\n     * _.isObject({});\n     * // => true\n     *\n     * _.isObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isObject(_.noop);\n     * // => true\n     *\n     * _.isObject(null);\n     * // => false\n     */\n    function isObject(value) {\n      var type = typeof value;\n      return value != null && (type == 'object' || type == 'function');\n    }\n\n    /**\n     * Checks if `value` is object-like. A value is object-like if it's not `null`\n     * and has a `typeof` result of \"object\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n     * @example\n     *\n     * _.isObjectLike({});\n     * // => true\n     *\n     * _.isObjectLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isObjectLike(_.noop);\n     * // => false\n     *\n     * _.isObjectLike(null);\n     * // => false\n     */\n    function isObjectLike(value) {\n      return value != null && typeof value == 'object';\n    }\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     */\n    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n    /**\n     * Performs a partial deep comparison between `object` and `source` to\n     * determine if `object` contains equivalent property values.\n     *\n     * **Note:** This method is equivalent to `_.matches` when `source` is\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.isMatch(object, { 'b': 2 });\n     * // => true\n     *\n     * _.isMatch(object, { 'b': 1 });\n     * // => false\n     */\n    function isMatch(object, source) {\n      return object === source || baseIsMatch(object, source, getMatchData(source));\n    }\n\n    /**\n     * This method is like `_.isMatch` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with five\n     * arguments: (objValue, srcValue, index|key, object, source).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var object = { 'greeting': 'hello' };\n     * var source = { 'greeting': 'hi' };\n     *\n     * _.isMatchWith(object, source, customizer);\n     * // => true\n     */\n    function isMatchWith(object, source, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseIsMatch(object, source, getMatchData(source), customizer);\n    }\n\n    /**\n     * Checks if `value` is `NaN`.\n     *\n     * **Note:** This method is based on\n     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n     * `undefined` and other non-number values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n     * @example\n     *\n     * _.isNaN(NaN);\n     * // => true\n     *\n     * _.isNaN(new Number(NaN));\n     * // => true\n     *\n     * isNaN(undefined);\n     * // => true\n     *\n     * _.isNaN(undefined);\n     * // => false\n     */\n    function isNaN(value) {\n      // An `NaN` primitive is the only value that is not equal to itself.\n      // Perform the `toStringTag` check first to avoid errors with some\n      // ActiveX objects in IE.\n      return isNumber(value) && value != +value;\n    }\n\n    /**\n     * Checks if `value` is a pristine native function.\n     *\n     * **Note:** This method can't reliably detect native functions in the presence\n     * of the core-js package because core-js circumvents this kind of detection.\n     * Despite multiple requests, the core-js maintainer has made it clear: any\n     * attempt to fix the detection will be obstructed. As a result, we're left\n     * with little choice but to throw an error. Unfortunately, this also affects\n     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n     * which rely on core-js.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     * @example\n     *\n     * _.isNative(Array.prototype.push);\n     * // => true\n     *\n     * _.isNative(_);\n     * // => false\n     */\n    function isNative(value) {\n      if (isMaskable(value)) {\n        throw new Error(CORE_ERROR_TEXT);\n      }\n      return baseIsNative(value);\n    }\n\n    /**\n     * Checks if `value` is `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n     * @example\n     *\n     * _.isNull(null);\n     * // => true\n     *\n     * _.isNull(void 0);\n     * // => false\n     */\n    function isNull(value) {\n      return value === null;\n    }\n\n    /**\n     * Checks if `value` is `null` or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n     * @example\n     *\n     * _.isNil(null);\n     * // => true\n     *\n     * _.isNil(void 0);\n     * // => true\n     *\n     * _.isNil(NaN);\n     * // => false\n     */\n    function isNil(value) {\n      return value == null;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Number` primitive or object.\n     *\n     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n     * classified as numbers, use the `_.isFinite` method.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n     * @example\n     *\n     * _.isNumber(3);\n     * // => true\n     *\n     * _.isNumber(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isNumber(Infinity);\n     * // => true\n     *\n     * _.isNumber('3');\n     * // => false\n     */\n    function isNumber(value) {\n      return typeof value == 'number' ||\n        (isObjectLike(value) && baseGetTag(value) == numberTag);\n    }\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     */\n    function 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\n    /**\n     * Checks if `value` is classified as a `RegExp` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     * @example\n     *\n     * _.isRegExp(/abc/);\n     * // => true\n     *\n     * _.isRegExp('/abc/');\n     * // => false\n     */\n    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n    /**\n     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n     * double precision number which isn't the result of a rounded unsafe integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n     * @example\n     *\n     * _.isSafeInteger(3);\n     * // => true\n     *\n     * _.isSafeInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isSafeInteger(Infinity);\n     * // => false\n     *\n     * _.isSafeInteger('3');\n     * // => false\n     */\n    function isSafeInteger(value) {\n      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n    }\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     */\n    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\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     */\n    function isString(value) {\n      return typeof value == 'string' ||\n        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Symbol` primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n     * @example\n     *\n     * _.isSymbol(Symbol.iterator);\n     * // => true\n     *\n     * _.isSymbol('abc');\n     * // => false\n     */\n    function isSymbol(value) {\n      return typeof value == 'symbol' ||\n        (isObjectLike(value) && baseGetTag(value) == symbolTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a typed array.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     * @example\n     *\n     * _.isTypedArray(new Uint8Array);\n     * // => true\n     *\n     * _.isTypedArray([]);\n     * // => false\n     */\n    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n    /**\n     * Checks if `value` is `undefined`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n     * @example\n     *\n     * _.isUndefined(void 0);\n     * // => true\n     *\n     * _.isUndefined(null);\n     * // => false\n     */\n    function isUndefined(value) {\n      return value === undefined;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakMap` 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 weak map, else `false`.\n     * @example\n     *\n     * _.isWeakMap(new WeakMap);\n     * // => true\n     *\n     * _.isWeakMap(new Map);\n     * // => false\n     */\n    function isWeakMap(value) {\n      return isObjectLike(value) && getTag(value) == weakMapTag;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakSet` 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 weak set, else `false`.\n     * @example\n     *\n     * _.isWeakSet(new WeakSet);\n     * // => true\n     *\n     * _.isWeakSet(new Set);\n     * // => false\n     */\n    function isWeakSet(value) {\n      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n    }\n\n    /**\n     * Checks if `value` is less than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     * @see _.gt\n     * @example\n     *\n     * _.lt(1, 3);\n     * // => true\n     *\n     * _.lt(3, 3);\n     * // => false\n     *\n     * _.lt(3, 1);\n     * // => false\n     */\n    var lt = createRelationalOperation(baseLt);\n\n    /**\n     * Checks if `value` is less than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than or equal to\n     *  `other`, else `false`.\n     * @see _.gte\n     * @example\n     *\n     * _.lte(1, 3);\n     * // => true\n     *\n     * _.lte(3, 3);\n     * // => true\n     *\n     * _.lte(3, 1);\n     * // => false\n     */\n    var lte = createRelationalOperation(function(value, other) {\n      return value <= other;\n    });\n\n    /**\n     * Converts `value` to an array.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the converted array.\n     * @example\n     *\n     * _.toArray({ 'a': 1, 'b': 2 });\n     * // => [1, 2]\n     *\n     * _.toArray('abc');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toArray(1);\n     * // => []\n     *\n     * _.toArray(null);\n     * // => []\n     */\n    function toArray(value) {\n      if (!value) {\n        return [];\n      }\n      if (isArrayLike(value)) {\n        return isString(value) ? stringToArray(value) : copyArray(value);\n      }\n      if (symIterator && value[symIterator]) {\n        return iteratorToArray(value[symIterator]());\n      }\n      var tag = getTag(value),\n          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n      return func(value);\n    }\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     */\n    function 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\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     */\n    function toInteger(value) {\n      var result = toFinite(value),\n          remainder = result % 1;\n\n      return result === result ? (remainder ? result - remainder : result) : 0;\n    }\n\n    /**\n     * Converts `value` to an integer suitable for use as the length of an\n     * array-like object.\n     *\n     * **Note:** This method is based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toLength(3.2);\n     * // => 3\n     *\n     * _.toLength(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toLength(Infinity);\n     * // => 4294967295\n     *\n     * _.toLength('3.2');\n     * // => 3\n     */\n    function toLength(value) {\n      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n    }\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     */\n    function 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 = value.replace(reTrim, '');\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\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     */\n    function toPlainObject(value) {\n      return copyObject(value, keysIn(value));\n    }\n\n    /**\n     * Converts `value` to a safe integer. A safe integer can be compared and\n     * represented correctly.\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     * _.toSafeInteger(3.2);\n     * // => 3\n     *\n     * _.toSafeInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toSafeInteger(Infinity);\n     * // => 9007199254740991\n     *\n     * _.toSafeInteger('3.2');\n     * // => 3\n     */\n    function toSafeInteger(value) {\n      return value\n        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n        : (value === 0 ? value : 0);\n    }\n\n    /**\n     * Converts `value` to a string. An empty string is returned for `null`\n     * and `undefined` values. The sign of `-0` is preserved.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.toString(null);\n     * // => ''\n     *\n     * _.toString(-0);\n     * // => '-0'\n     *\n     * _.toString([1, 2, 3]);\n     * // => '1,2,3'\n     */\n    function toString(value) {\n      return value == null ? '' : baseToString(value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Assigns own enumerable string keyed properties of source objects to the\n     * destination object. Source objects are applied from left to right.\n     * Subsequent sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object` and is loosely based on\n     * [`Object.assign`](https://mdn.io/Object/assign).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assignIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assign({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var assign = createAssigner(function(object, source) {\n      if (isPrototype(source) || isArrayLike(source)) {\n        copyObject(source, keys(source), object);\n        return;\n      }\n      for (var key in source) {\n        if (hasOwnProperty.call(source, key)) {\n          assignValue(object, key, source[key]);\n        }\n      }\n    });\n\n    /**\n     * This method is like `_.assign` except that it iterates over own and\n     * inherited source properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extend\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assign\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n     */\n    var assignIn = createAssigner(function(object, source) {\n      copyObject(source, keysIn(source), object);\n    });\n\n    /**\n     * This method is like `_.assignIn` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extendWith\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignInWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keysIn(source), object, customizer);\n    });\n\n    /**\n     * This method is like `_.assign` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignInWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keys(source), object, customizer);\n    });\n\n    /**\n     * Creates an array of values corresponding to `paths` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Array} Returns the picked values.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _.at(object, ['a[0].b.c', 'a[1]']);\n     * // => [3, 4]\n     */\n    var at = flatRest(baseAt);\n\n    /**\n     * Creates an object that inherits from the `prototype` object. If a\n     * `properties` object is given, its own enumerable string keyed properties\n     * are assigned to the created object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Object\n     * @param {Object} prototype The object to inherit from.\n     * @param {Object} [properties] The properties to assign to the object.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * function Shape() {\n     *   this.x = 0;\n     *   this.y = 0;\n     * }\n     *\n     * function Circle() {\n     *   Shape.call(this);\n     * }\n     *\n     * Circle.prototype = _.create(Shape.prototype, {\n     *   'constructor': Circle\n     * });\n     *\n     * var circle = new Circle;\n     * circle instanceof Circle;\n     * // => true\n     *\n     * circle instanceof Shape;\n     * // => true\n     */\n    function create(prototype, properties) {\n      var result = baseCreate(prototype);\n      return properties == null ? result : baseAssign(result, properties);\n    }\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     */\n    var 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\n    /**\n     * This method is like `_.defaults` except that it recursively assigns\n     * default properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaults\n     * @example\n     *\n     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n     * // => { 'a': { 'b': 2, 'c': 3 } }\n     */\n    var defaultsDeep = baseRest(function(args) {\n      args.push(undefined, customDefaultsMerge);\n      return apply(mergeWith, undefined, args);\n    });\n\n    /**\n     * This method is like `_.find` except that it returns the key 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 Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findKey(users, function(o) { return o.age < 40; });\n     * // => 'barney' (iteration order is not guaranteed)\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findKey(users, { 'age': 1, 'active': true });\n     * // => 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findKey(users, 'active');\n     * // => 'barney'\n     */\n    function findKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n    }\n\n    /**\n     * This method is like `_.findKey` except that it iterates over elements of\n     * a collection in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findLastKey(users, function(o) { return o.age < 40; });\n     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastKey(users, { 'age': 36, 'active': true });\n     * // => 'barney'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastKey(users, 'active');\n     * // => 'pebbles'\n     */\n    function findLastKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n    }\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     */\n    function forIn(object, iteratee) {\n      return object == null\n        ? object\n        : baseFor(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * This method is like `_.forIn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.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 _.forIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forInRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n     */\n    function forInRight(object, iteratee) {\n      return object == null\n        ? object\n        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n    }\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     */\n    function forOwn(object, iteratee) {\n      return object && baseForOwn(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forOwn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.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 _.forOwn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwnRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n     */\n    function forOwnRight(object, iteratee) {\n      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an array of function property names from own enumerable properties\n     * of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functionsIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functions(new Foo);\n     * // => ['a', 'b']\n     */\n    function functions(object) {\n      return object == null ? [] : baseFunctions(object, keys(object));\n    }\n\n    /**\n     * Creates an array of function property names from own and inherited\n     * enumerable properties of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functions\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functionsIn(new Foo);\n     * // => ['a', 'b', 'c']\n     */\n    function functionsIn(object) {\n      return object == null ? [] : baseFunctions(object, keysIn(object));\n    }\n\n    /**\n     * Gets the value at `path` of `object`. If the resolved value is\n     * `undefined`, the `defaultValue` is returned in its place.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.get(object, 'a[0].b.c');\n     * // => 3\n     *\n     * _.get(object, ['a', '0', 'b', 'c']);\n     * // => 3\n     *\n     * _.get(object, 'a.b.c', 'default');\n     * // => 'default'\n     */\n    function get(object, path, defaultValue) {\n      var result = object == null ? undefined : baseGet(object, path);\n      return result === undefined ? defaultValue : result;\n    }\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     */\n    function has(object, path) {\n      return object != null && hasPath(object, path, baseHas);\n    }\n\n    /**\n     * Checks if `path` is a direct or inherited property of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.hasIn(object, 'a');\n     * // => true\n     *\n     * _.hasIn(object, 'a.b');\n     * // => true\n     *\n     * _.hasIn(object, ['a', 'b']);\n     * // => true\n     *\n     * _.hasIn(object, 'b');\n     * // => false\n     */\n    function hasIn(object, path) {\n      return object != null && hasPath(object, path, baseHasIn);\n    }\n\n    /**\n     * Creates an object composed of the inverted keys and values of `object`.\n     * If `object` contains duplicate values, subsequent values overwrite\n     * property assignments of previous values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invert(object);\n     * // => { '1': 'c', '2': 'b' }\n     */\n    var invert = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      result[value] = key;\n    }, constant(identity));\n\n    /**\n     * This method is like `_.invert` except that the inverted object is generated\n     * from the results of running each element of `object` thru `iteratee`. The\n     * corresponding inverted value of each inverted key is an array of keys\n     * responsible for generating the inverted value. The iteratee is invoked\n     * with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invertBy(object);\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     *\n     * _.invertBy(object, function(value) {\n     *   return 'group' + value;\n     * });\n     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n     */\n    var invertBy = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      if (hasOwnProperty.call(result, value)) {\n        result[value].push(key);\n      } else {\n        result[value] = [key];\n      }\n    }, getIteratee);\n\n    /**\n     * Invokes the method at `path` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n     *\n     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n     * // => [2, 3]\n     */\n    var invoke = baseRest(baseInvoke);\n\n    /**\n     * Creates an array of the own enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects. See the\n     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * for more details.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keys(new Foo);\n     * // => ['a', 'b'] (iteration order is not guaranteed)\n     *\n     * _.keys('hi');\n     * // => ['0', '1']\n     */\n    function keys(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n    }\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     */\n    function keysIn(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n    }\n\n    /**\n     * The opposite of `_.mapValues`; this method creates an object with the\n     * same values as `object` and keys generated by running each own enumerable\n     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n     * with three arguments: (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.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 _.mapValues\n     * @example\n     *\n     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   return key + value;\n     * });\n     * // => { 'a1': 1, 'b2': 2 }\n     */\n    function mapKeys(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, iteratee(value, key, object), value);\n      });\n      return result;\n    }\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     */\n    function mapValues(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, key, iteratee(value, key, object));\n      });\n      return result;\n    }\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     */\n    var merge = createAssigner(function(object, source, srcIndex) {\n      baseMerge(object, source, srcIndex);\n    });\n\n    /**\n     * This method is like `_.merge` except that it accepts `customizer` which\n     * is invoked to produce the merged values of the destination and source\n     * properties. If `customizer` returns `undefined`, merging is handled by the\n     * method instead. The `customizer` is invoked with six arguments:\n     * (objValue, srcValue, key, object, source, stack).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} customizer The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (_.isArray(objValue)) {\n     *     return objValue.concat(srcValue);\n     *   }\n     * }\n     *\n     * var object = { 'a': [1], 'b': [2] };\n     * var other = { 'a': [3], 'b': [4] };\n     *\n     * _.mergeWith(object, other, customizer);\n     * // => { 'a': [1, 3], 'b': [2, 4] }\n     */\n    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n      baseMerge(object, source, srcIndex, customizer);\n    });\n\n    /**\n     * The opposite of `_.pick`; this method creates an object composed of the\n     * own and inherited enumerable property paths of `object` that are not omitted.\n     *\n     * **Note:** This method is considerably slower than `_.pick`.\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 omit.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omit(object, ['a', 'c']);\n     * // => { 'b': '2' }\n     */\n    var omit = flatRest(function(object, paths) {\n      var result = {};\n      if (object == null) {\n        return result;\n      }\n      var isDeep = false;\n      paths = arrayMap(paths, function(path) {\n        path = castPath(path, object);\n        isDeep || (isDeep = path.length > 1);\n        return path;\n      });\n      copyObject(object, getAllKeysIn(object), result);\n      if (isDeep) {\n        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n      }\n      var length = paths.length;\n      while (length--) {\n        baseUnset(result, paths[length]);\n      }\n      return result;\n    });\n\n    /**\n     * The opposite of `_.pickBy`; this method creates an object composed of\n     * the own and inherited enumerable string keyed properties of `object` that\n     * `predicate` doesn't return truthy for. The predicate is invoked with two\n     * arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omitBy(object, _.isNumber);\n     * // => { 'b': '2' }\n     */\n    function omitBy(object, predicate) {\n      return pickBy(object, negate(getIteratee(predicate)));\n    }\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     */\n    var pick = flatRest(function(object, paths) {\n      return object == null ? {} : basePick(object, paths);\n    });\n\n    /**\n     * Creates an object composed of the `object` properties `predicate` returns\n     * truthy for. The predicate is invoked with two arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pickBy(object, _.isNumber);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    function pickBy(object, predicate) {\n      if (object == null) {\n        return {};\n      }\n      var props = arrayMap(getAllKeysIn(object), function(prop) {\n        return [prop];\n      });\n      predicate = getIteratee(predicate);\n      return basePickBy(object, props, function(value, path) {\n        return predicate(value, path[0]);\n      });\n    }\n\n    /**\n     * This method is like `_.get` except that if the resolved value is a\n     * function it's invoked with the `this` binding of its parent object and\n     * its result is returned.\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 of the property to resolve.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n     *\n     * _.result(object, 'a[0].b.c1');\n     * // => 3\n     *\n     * _.result(object, 'a[0].b.c2');\n     * // => 4\n     *\n     * _.result(object, 'a[0].b.c3', 'default');\n     * // => 'default'\n     *\n     * _.result(object, 'a[0].b.c3', _.constant('default'));\n     * // => 'default'\n     */\n    function result(object, path, defaultValue) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length;\n\n      // Ensure the loop is entered when path is empty.\n      if (!length) {\n        length = 1;\n        object = undefined;\n      }\n      while (++index < length) {\n        var value = object == null ? undefined : object[toKey(path[index])];\n        if (value === undefined) {\n          index = length;\n          value = defaultValue;\n        }\n        object = isFunction(value) ? value.call(object) : value;\n      }\n      return object;\n    }\n\n    /**\n     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n     * it's created. Arrays are created for missing index properties while objects\n     * are created for all other missing properties. Use `_.setWith` to customize\n     * `path` creation.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\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     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.set(object, 'a[0].b.c', 4);\n     * console.log(object.a[0].b.c);\n     * // => 4\n     *\n     * _.set(object, ['x', '0', 'y', 'z'], 5);\n     * console.log(object.x[0].y.z);\n     * // => 5\n     */\n    function set(object, path, value) {\n      return object == null ? object : baseSet(object, path, value);\n    }\n\n    /**\n     * This method is like `_.set` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\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 assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.setWith(object, '[0][1]', 'a', Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function setWith(object, path, value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseSet(object, path, value, customizer);\n    }\n\n    /**\n     * Creates an array of own enumerable string keyed-value pairs for `object`\n     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n     * entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entries\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairs(new Foo);\n     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n     */\n    var toPairs = createToPairs(keys);\n\n    /**\n     * Creates an array of own and inherited enumerable string keyed-value pairs\n     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n     * or set, its entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entriesIn\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairsIn(new Foo);\n     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n     */\n    var toPairsIn = createToPairs(keysIn);\n\n    /**\n     * An alternative to `_.reduce`; this method transforms `object` to a new\n     * `accumulator` object which is the result of running each of its own\n     * enumerable string keyed properties thru `iteratee`, with each invocation\n     * potentially mutating the `accumulator` object. If `accumulator` is not\n     * provided, a new object with the same `[[Prototype]]` will be used. The\n     * iteratee is invoked with four arguments: (accumulator, value, key, object).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The custom accumulator value.\n     * @returns {*} Returns the accumulated value.\n     * @example\n     *\n     * _.transform([2, 3, 4], function(result, n) {\n     *   result.push(n *= n);\n     *   return n % 2 == 0;\n     * }, []);\n     * // => [4, 9]\n     *\n     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     */\n    function transform(object, iteratee, accumulator) {\n      var isArr = isArray(object),\n          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n      iteratee = getIteratee(iteratee, 4);\n      if (accumulator == null) {\n        var Ctor = object && object.constructor;\n        if (isArrLike) {\n          accumulator = isArr ? new Ctor : [];\n        }\n        else if (isObject(object)) {\n          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n        }\n        else {\n          accumulator = {};\n        }\n      }\n      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n        return iteratee(accumulator, value, index, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * Removes the property at `path` of `object`.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n     * _.unset(object, 'a[0].b.c');\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     *\n     * _.unset(object, ['a', '0', 'b', 'c']);\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     */\n    function unset(object, path) {\n      return object == null ? true : baseUnset(object, path);\n    }\n\n    /**\n     * This method is like `_.set` except that accepts `updater` to produce the\n     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n     * is invoked with one argument: (value).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n     * console.log(object.a[0].b.c);\n     * // => 9\n     *\n     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n     * console.log(object.x[0].y.z);\n     * // => 0\n     */\n    function update(object, path, updater) {\n      return object == null ? object : baseUpdate(object, path, castFunction(updater));\n    }\n\n    /**\n     * This method is like `_.update` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function updateWith(object, path, updater, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n    }\n\n    /**\n     * Creates an array of the own enumerable string keyed property values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.values(new Foo);\n     * // => [1, 2] (iteration order is not guaranteed)\n     *\n     * _.values('hi');\n     * // => ['h', 'i']\n     */\n    function values(object) {\n      return object == null ? [] : baseValues(object, keys(object));\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable string keyed property\n     * values 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 values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.valuesIn(new Foo);\n     * // => [1, 2, 3] (iteration order is not guaranteed)\n     */\n    function valuesIn(object) {\n      return object == null ? [] : baseValues(object, keysIn(object));\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Clamps `number` within the inclusive `lower` and `upper` bounds.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Number\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     * @example\n     *\n     * _.clamp(-10, -5, 5);\n     * // => -5\n     *\n     * _.clamp(10, -5, 5);\n     * // => 5\n     */\n    function clamp(number, lower, upper) {\n      if (upper === undefined) {\n        upper = lower;\n        lower = undefined;\n      }\n      if (upper !== undefined) {\n        upper = toNumber(upper);\n        upper = upper === upper ? upper : 0;\n      }\n      if (lower !== undefined) {\n        lower = toNumber(lower);\n        lower = lower === lower ? lower : 0;\n      }\n      return baseClamp(toNumber(number), lower, upper);\n    }\n\n    /**\n     * Checks if `n` is between `start` and up to, but not including, `end`. If\n     * `end` is not specified, it's set to `start` with `start` then set to `0`.\n     * If `start` is greater than `end` the params are swapped to support\n     * negative ranges.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.3.0\n     * @category Number\n     * @param {number} number The number to check.\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     * @see _.range, _.rangeRight\n     * @example\n     *\n     * _.inRange(3, 2, 4);\n     * // => true\n     *\n     * _.inRange(4, 8);\n     * // => true\n     *\n     * _.inRange(4, 2);\n     * // => false\n     *\n     * _.inRange(2, 2);\n     * // => false\n     *\n     * _.inRange(1.2, 2);\n     * // => true\n     *\n     * _.inRange(5.2, 4);\n     * // => false\n     *\n     * _.inRange(-3, -2, -6);\n     * // => true\n     */\n    function inRange(number, start, end) {\n      start = toFinite(start);\n      if (end === undefined) {\n        end = start;\n        start = 0;\n      } else {\n        end = toFinite(end);\n      }\n      number = toNumber(number);\n      return baseInRange(number, start, end);\n    }\n\n    /**\n     * Produces a random number between the inclusive `lower` and `upper` bounds.\n     * If only one argument is provided a number between `0` and the given number\n     * is returned. If `floating` is `true`, or either `lower` or `upper` are\n     * floats, a floating-point number is returned instead of an integer.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Number\n     * @param {number} [lower=0] The lower bound.\n     * @param {number} [upper=1] The upper bound.\n     * @param {boolean} [floating] Specify returning a floating-point number.\n     * @returns {number} Returns the random number.\n     * @example\n     *\n     * _.random(0, 5);\n     * // => an integer between 0 and 5\n     *\n     * _.random(5);\n     * // => also an integer between 0 and 5\n     *\n     * _.random(5, true);\n     * // => a floating-point number between 0 and 5\n     *\n     * _.random(1.2, 5.2);\n     * // => a floating-point number between 1.2 and 5.2\n     */\n    function random(lower, upper, floating) {\n      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n        upper = floating = undefined;\n      }\n      if (floating === undefined) {\n        if (typeof upper == 'boolean') {\n          floating = upper;\n          upper = undefined;\n        }\n        else if (typeof lower == 'boolean') {\n          floating = lower;\n          lower = undefined;\n        }\n      }\n      if (lower === undefined && upper === undefined) {\n        lower = 0;\n        upper = 1;\n      }\n      else {\n        lower = toFinite(lower);\n        if (upper === undefined) {\n          upper = lower;\n          lower = 0;\n        } else {\n          upper = toFinite(upper);\n        }\n      }\n      if (lower > upper) {\n        var temp = lower;\n        lower = upper;\n        upper = temp;\n      }\n      if (floating || lower % 1 || upper % 1) {\n        var rand = nativeRandom();\n        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n      }\n      return baseRandom(lower, upper);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the camel cased string.\n     * @example\n     *\n     * _.camelCase('Foo Bar');\n     * // => 'fooBar'\n     *\n     * _.camelCase('--foo-bar--');\n     * // => 'fooBar'\n     *\n     * _.camelCase('__FOO_BAR__');\n     * // => 'fooBar'\n     */\n    var camelCase = createCompounder(function(result, word, index) {\n      word = word.toLowerCase();\n      return result + (index ? capitalize(word) : word);\n    });\n\n    /**\n     * Converts the first character of `string` to upper case and the remaining\n     * to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to capitalize.\n     * @returns {string} Returns the capitalized string.\n     * @example\n     *\n     * _.capitalize('FRED');\n     * // => 'Fred'\n     */\n    function capitalize(string) {\n      return upperFirst(toString(string).toLowerCase());\n    }\n\n    /**\n     * Deburrs `string` by converting\n     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n     * letters to basic Latin letters and removing\n     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to deburr.\n     * @returns {string} Returns the deburred string.\n     * @example\n     *\n     * _.deburr('déjà vu');\n     * // => 'deja vu'\n     */\n    function deburr(string) {\n      string = toString(string);\n      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n    }\n\n    /**\n     * Checks if `string` ends with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=string.length] The position to search up to.\n     * @returns {boolean} Returns `true` if `string` ends with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.endsWith('abc', 'c');\n     * // => true\n     *\n     * _.endsWith('abc', 'b');\n     * // => false\n     *\n     * _.endsWith('abc', 'b', 2);\n     * // => true\n     */\n    function endsWith(string, target, position) {\n      string = toString(string);\n      target = baseToString(target);\n\n      var length = string.length;\n      position = position === undefined\n        ? length\n        : baseClamp(toInteger(position), 0, length);\n\n      var end = position;\n      position -= target.length;\n      return position >= 0 && string.slice(position, end) == target;\n    }\n\n    /**\n     * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n     * corresponding HTML entities.\n     *\n     * **Note:** No other characters are escaped. To escape additional\n     * characters use a third-party library like [_he_](https://mths.be/he).\n     *\n     * Though the \">\" character is escaped for symmetry, characters like\n     * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n     * unless they're part of a tag or unquoted attribute value. See\n     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n     * (under \"semi-related fun fact\") for more details.\n     *\n     * When working with HTML you should always\n     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n     * XSS vectors.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escape('fred, barney, & pebbles');\n     * // => 'fred, barney, &amp; pebbles'\n     */\n    function escape(string) {\n      string = toString(string);\n      return (string && reHasUnescapedHtml.test(string))\n        ? string.replace(reUnescapedHtml, escapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n     * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escapeRegExp('[lodash](https://lodash.com/)');\n     * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n     */\n    function escapeRegExp(string) {\n      string = toString(string);\n      return (string && reHasRegExpChar.test(string))\n        ? string.replace(reRegExpChar, '\\\\$&')\n        : string;\n    }\n\n    /**\n     * Converts `string` to\n     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the kebab cased string.\n     * @example\n     *\n     * _.kebabCase('Foo Bar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('fooBar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('__FOO_BAR__');\n     * // => 'foo-bar'\n     */\n    var kebabCase = createCompounder(function(result, word, index) {\n      return result + (index ? '-' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts `string`, as space separated words, to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.lowerCase('--Foo-Bar--');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('fooBar');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('__FOO_BAR__');\n     * // => 'foo bar'\n     */\n    var lowerCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts the first character of `string` to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.lowerFirst('Fred');\n     * // => 'fred'\n     *\n     * _.lowerFirst('FRED');\n     * // => 'fRED'\n     */\n    var lowerFirst = createCaseFirst('toLowerCase');\n\n    /**\n     * Pads `string` on the left and right sides if it's shorter than `length`.\n     * Padding characters are truncated if they can't be evenly divided by `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.pad('abc', 8);\n     * // => '  abc   '\n     *\n     * _.pad('abc', 8, '_-');\n     * // => '_-abc_-_'\n     *\n     * _.pad('abc', 3);\n     * // => 'abc'\n     */\n    function pad(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      if (!length || strLength >= length) {\n        return string;\n      }\n      var mid = (length - strLength) / 2;\n      return (\n        createPadding(nativeFloor(mid), chars) +\n        string +\n        createPadding(nativeCeil(mid), chars)\n      );\n    }\n\n    /**\n     * Pads `string` on the right side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padEnd('abc', 6);\n     * // => 'abc   '\n     *\n     * _.padEnd('abc', 6, '_-');\n     * // => 'abc_-_'\n     *\n     * _.padEnd('abc', 3);\n     * // => 'abc'\n     */\n    function padEnd(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (string + createPadding(length - strLength, chars))\n        : string;\n    }\n\n    /**\n     * Pads `string` on the left side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padStart('abc', 6);\n     * // => '   abc'\n     *\n     * _.padStart('abc', 6, '_-');\n     * // => '_-_abc'\n     *\n     * _.padStart('abc', 3);\n     * // => 'abc'\n     */\n    function padStart(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (createPadding(length - strLength, chars) + string)\n        : string;\n    }\n\n    /**\n     * Converts `string` to an integer of the specified radix. If `radix` is\n     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n     * hexadecimal, in which case a `radix` of `16` is used.\n     *\n     * **Note:** This method aligns with the\n     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category String\n     * @param {string} string The string to convert.\n     * @param {number} [radix=10] The radix to interpret `value` by.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.parseInt('08');\n     * // => 8\n     *\n     * _.map(['6', '08', '10'], _.parseInt);\n     * // => [6, 8, 10]\n     */\n    function parseInt(string, radix, guard) {\n      if (guard || radix == null) {\n        radix = 0;\n      } else if (radix) {\n        radix = +radix;\n      }\n      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n    }\n\n    /**\n     * Repeats the given string `n` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to repeat.\n     * @param {number} [n=1] The number of times to repeat the string.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the repeated string.\n     * @example\n     *\n     * _.repeat('*', 3);\n     * // => '***'\n     *\n     * _.repeat('abc', 2);\n     * // => 'abcabc'\n     *\n     * _.repeat('abc', 0);\n     * // => ''\n     */\n    function repeat(string, n, guard) {\n      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      return baseRepeat(toString(string), n);\n    }\n\n    /**\n     * Replaces matches for `pattern` in `string` with `replacement`.\n     *\n     * **Note:** This method is based on\n     * [`String#replace`](https://mdn.io/String/replace).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to modify.\n     * @param {RegExp|string} pattern The pattern to replace.\n     * @param {Function|string} replacement The match replacement.\n     * @returns {string} Returns the modified string.\n     * @example\n     *\n     * _.replace('Hi Fred', 'Fred', 'Barney');\n     * // => 'Hi Barney'\n     */\n    function replace() {\n      var args = arguments,\n          string = toString(args[0]);\n\n      return args.length < 3 ? string : string.replace(args[1], args[2]);\n    }\n\n    /**\n     * Converts `string` to\n     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the snake cased string.\n     * @example\n     *\n     * _.snakeCase('Foo Bar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('fooBar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('--FOO-BAR--');\n     * // => 'foo_bar'\n     */\n    var snakeCase = createCompounder(function(result, word, index) {\n      return result + (index ? '_' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Splits `string` by `separator`.\n     *\n     * **Note:** This method is based on\n     * [`String#split`](https://mdn.io/String/split).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to split.\n     * @param {RegExp|string} separator The separator pattern to split by.\n     * @param {number} [limit] The length to truncate results to.\n     * @returns {Array} Returns the string segments.\n     * @example\n     *\n     * _.split('a-b-c', '-', 2);\n     * // => ['a', 'b']\n     */\n    function split(string, separator, limit) {\n      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n        separator = limit = undefined;\n      }\n      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n      if (!limit) {\n        return [];\n      }\n      string = toString(string);\n      if (string && (\n            typeof separator == 'string' ||\n            (separator != null && !isRegExp(separator))\n          )) {\n        separator = baseToString(separator);\n        if (!separator && hasUnicode(string)) {\n          return castSlice(stringToArray(string), 0, limit);\n        }\n      }\n      return string.split(separator, limit);\n    }\n\n    /**\n     * Converts `string` to\n     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.1.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the start cased string.\n     * @example\n     *\n     * _.startCase('--foo-bar--');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('fooBar');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('__FOO_BAR__');\n     * // => 'FOO BAR'\n     */\n    var startCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + upperFirst(word);\n    });\n\n    /**\n     * Checks if `string` starts with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=0] The position to search from.\n     * @returns {boolean} Returns `true` if `string` starts with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.startsWith('abc', 'a');\n     * // => true\n     *\n     * _.startsWith('abc', 'b');\n     * // => false\n     *\n     * _.startsWith('abc', 'b', 1);\n     * // => true\n     */\n    function startsWith(string, target, position) {\n      string = toString(string);\n      position = position == null\n        ? 0\n        : baseClamp(toInteger(position), 0, string.length);\n\n      target = baseToString(target);\n      return string.slice(position, position + target.length) == target;\n    }\n\n    /**\n     * Creates a compiled template function that can interpolate data properties\n     * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n     * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n     * properties may be accessed as free variables in the template. If a setting\n     * object is given, it takes precedence over `_.templateSettings` values.\n     *\n     * **Note:** In the development build `_.template` utilizes\n     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n     * for easier debugging.\n     *\n     * For more information on precompiling templates see\n     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n     *\n     * For more information on Chrome extension sandboxes see\n     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The template string.\n     * @param {Object} [options={}] The options object.\n     * @param {RegExp} [options.escape=_.templateSettings.escape]\n     *  The HTML \"escape\" delimiter.\n     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n     *  The \"evaluate\" delimiter.\n     * @param {Object} [options.imports=_.templateSettings.imports]\n     *  An object to import into the template as free variables.\n     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n     *  The \"interpolate\" delimiter.\n     * @param {string} [options.sourceURL='lodash.templateSources[n]']\n     *  The sourceURL of the compiled template.\n     * @param {string} [options.variable='obj']\n     *  The data object variable name.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the compiled template function.\n     * @example\n     *\n     * // Use the \"interpolate\" delimiter to create a compiled template.\n     * var compiled = _.template('hello <%= user %>!');\n     * compiled({ 'user': 'fred' });\n     * // => 'hello fred!'\n     *\n     * // Use the HTML \"escape\" delimiter to escape data property values.\n     * var compiled = _.template('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // with lookup (in case of e.g. prototype pollution), and strip newlines if any.\n      // A newline wouldn't be a valid sourceURL anyway, and it'd enable code injection.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/[\\r\\n]/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      // Like with sourceURL, we take care to not check the option's prototype,\n      // as this configuration is a code injection vector.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrim, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimEnd, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that returns `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {*} value The value to return from the new function.\n     * @returns {Function} Returns the new constant function.\n     * @example\n     *\n     * var objects = _.times(2, _.constant({ 'a': 1 }));\n     *\n     * console.log(objects);\n     * // => [{ 'a': 1 }, { 'a': 1 }]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => true\n     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\n    /**\n     * This method returns the first argument it receives.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {*} value Any value.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     *\n     * console.log(_.identity(object) === object);\n     * // => true\n     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\n    /**\n     * This method returns `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Util\n     * @example\n     *\n     * _.times(2, _.noop);\n     * // => [undefined, undefined]\n     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overSome = createOver(arraySome);\n\n    /**\n     * Creates a function that returns the value at `path` of a given object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': 2 } },\n     *   { 'a': { 'b': 1 } }\n     * ];\n     *\n     * _.map(objects, _.property('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n     * // => [1, 2]\n     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\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     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\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, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\n    /**\n     * This method returns a new empty array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Array} Returns the new empty array.\n     * @example\n     *\n     * var arrays = _.times(2, _.stubArray);\n     *\n     * console.log(arrays);\n     * // => [[], []]\n     *\n     * console.log(arrays[0] === arrays[1]);\n     * // => false\n     */\n    function stubArray() {\n      return [];\n    }\n\n    /**\n     * This method returns `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `false`.\n     * @example\n     *\n     * _.times(2, _.stubFalse);\n     * // => [false, false]\n     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\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     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\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     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` 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 maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.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 {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\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     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\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     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * 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 {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n","var MapCache = require('./_MapCache');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var baseProperty = require('./_baseProperty'),\n    basePropertyDeep = require('./_basePropertyDeep'),\n    isKey = require('./_isKey'),\n    toKey = require('./_toKey');\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","// Generated by CoffeeScript 1.12.2\n(function() {\n  var getNanoSeconds, hrtime, loadTime, moduleLoadTime, nodeLoadTime, upTime;\n\n  if ((typeof performance !== \"undefined\" && performance !== null) && performance.now) {\n    module.exports = function() {\n      return performance.now();\n    };\n  } else if ((typeof process !== \"undefined\" && process !== null) && process.hrtime) {\n    module.exports = function() {\n      return (getNanoSeconds() - nodeLoadTime) / 1e6;\n    };\n    hrtime = process.hrtime;\n    getNanoSeconds = function() {\n      var hr;\n      hr = hrtime();\n      return hr[0] * 1e9 + hr[1];\n    };\n    moduleLoadTime = getNanoSeconds();\n    upTime = process.uptime() * 1e9;\n    nodeLoadTime = moduleLoadTime - upTime;\n  } else if (Date.now) {\n    module.exports = function() {\n      return Date.now() - loadTime;\n    };\n    loadTime = Date.now();\n  } else {\n    module.exports = function() {\n      return new Date().getTime() - loadTime;\n    };\n    loadTime = new Date().getTime();\n  }\n\n}).call(this);\n\n//# sourceMappingURL=performance-now.js.map\n","var parse = require(\"./parse\");\nvar walk = require(\"./walk\");\nvar stringify = require(\"./stringify\");\n\nfunction ValueParser(value) {\n  if (this instanceof ValueParser) {\n    this.nodes = parse(value);\n    return this;\n  }\n  return new ValueParser(value);\n}\n\nValueParser.prototype.toString = function() {\n  return Array.isArray(this.nodes) ? stringify(this.nodes) : \"\";\n};\n\nValueParser.prototype.walk = function(cb, bubble) {\n  walk(this.nodes, cb, bubble);\n  return this;\n};\n\nValueParser.unit = require(\"./unit\");\n\nValueParser.walk = walk;\n\nValueParser.stringify = stringify;\n\nmodule.exports = ValueParser;\n","var openParentheses = \"(\".charCodeAt(0);\nvar closeParentheses = \")\".charCodeAt(0);\nvar singleQuote = \"'\".charCodeAt(0);\nvar doubleQuote = '\"'.charCodeAt(0);\nvar backslash = \"\\\\\".charCodeAt(0);\nvar slash = \"/\".charCodeAt(0);\nvar comma = \",\".charCodeAt(0);\nvar colon = \":\".charCodeAt(0);\nvar star = \"*\".charCodeAt(0);\n\nmodule.exports = function(input) {\n  var tokens = [];\n  var value = input;\n\n  var next, quote, prev, token, escape, escapePos, whitespacePos;\n  var pos = 0;\n  var code = value.charCodeAt(pos);\n  var max = value.length;\n  var stack = [{ nodes: tokens }];\n  var balanced = 0;\n  var parent;\n\n  var name = \"\";\n  var before = \"\";\n  var after = \"\";\n\n  while (pos < max) {\n    // Whitespaces\n    if (code <= 32) {\n      next = pos;\n      do {\n        next += 1;\n        code = value.charCodeAt(next);\n      } while (code <= 32);\n      token = value.slice(pos, next);\n\n      prev = tokens[tokens.length - 1];\n      if (code === closeParentheses && balanced) {\n        after = token;\n      } else if (prev && prev.type === \"div\") {\n        prev.after = token;\n      } else if (\n        code === comma ||\n        code === colon ||\n        (code === slash && value.charCodeAt(next + 1) !== star)\n      ) {\n        before = token;\n      } else {\n        tokens.push({\n          type: \"space\",\n          sourceIndex: pos,\n          value: token\n        });\n      }\n\n      pos = next;\n\n      // Quotes\n    } else if (code === singleQuote || code === doubleQuote) {\n      next = pos;\n      quote = code === singleQuote ? \"'\" : '\"';\n      token = {\n        type: \"string\",\n        sourceIndex: pos,\n        quote: quote\n      };\n      do {\n        escape = false;\n        next = value.indexOf(quote, next + 1);\n        if (~next) {\n          escapePos = next;\n          while (value.charCodeAt(escapePos - 1) === backslash) {\n            escapePos -= 1;\n            escape = !escape;\n          }\n        } else {\n          value += quote;\n          next = value.length - 1;\n          token.unclosed = true;\n        }\n      } while (escape);\n      token.value = value.slice(pos + 1, next);\n\n      tokens.push(token);\n      pos = next + 1;\n      code = value.charCodeAt(pos);\n\n      // Comments\n    } else if (code === slash && value.charCodeAt(pos + 1) === star) {\n      token = {\n        type: \"comment\",\n        sourceIndex: pos\n      };\n\n      next = value.indexOf(\"*/\", pos);\n      if (next === -1) {\n        token.unclosed = true;\n        next = value.length;\n      }\n\n      token.value = value.slice(pos + 2, next);\n      tokens.push(token);\n\n      pos = next + 2;\n      code = value.charCodeAt(pos);\n\n      // Dividers\n    } else if (code === slash || code === comma || code === colon) {\n      token = value[pos];\n\n      tokens.push({\n        type: \"div\",\n        sourceIndex: pos - before.length,\n        value: token,\n        before: before,\n        after: \"\"\n      });\n      before = \"\";\n\n      pos += 1;\n      code = value.charCodeAt(pos);\n\n      // Open parentheses\n    } else if (openParentheses === code) {\n      // Whitespaces after open parentheses\n      next = pos;\n      do {\n        next += 1;\n        code = value.charCodeAt(next);\n      } while (code <= 32);\n      token = {\n        type: \"function\",\n        sourceIndex: pos - name.length,\n        value: name,\n        before: value.slice(pos + 1, next)\n      };\n      pos = next;\n\n      if (name === \"url\" && code !== singleQuote && code !== doubleQuote) {\n        next -= 1;\n        do {\n          escape = false;\n          next = value.indexOf(\")\", next + 1);\n          if (~next) {\n            escapePos = next;\n            while (value.charCodeAt(escapePos - 1) === backslash) {\n              escapePos -= 1;\n              escape = !escape;\n            }\n          } else {\n            value += \")\";\n            next = value.length - 1;\n            token.unclosed = true;\n          }\n        } while (escape);\n        // Whitespaces before closed\n        whitespacePos = next;\n        do {\n          whitespacePos -= 1;\n          code = value.charCodeAt(whitespacePos);\n        } while (code <= 32);\n        if (pos !== whitespacePos + 1) {\n          token.nodes = [\n            {\n              type: \"word\",\n              sourceIndex: pos,\n              value: value.slice(pos, whitespacePos + 1)\n            }\n          ];\n        } else {\n          token.nodes = [];\n        }\n        if (token.unclosed && whitespacePos + 1 !== next) {\n          token.after = \"\";\n          token.nodes.push({\n            type: \"space\",\n            sourceIndex: whitespacePos + 1,\n            value: value.slice(whitespacePos + 1, next)\n          });\n        } else {\n          token.after = value.slice(whitespacePos + 1, next);\n        }\n        pos = next + 1;\n        code = value.charCodeAt(pos);\n        tokens.push(token);\n      } else {\n        balanced += 1;\n        token.after = \"\";\n        tokens.push(token);\n        stack.push(token);\n        tokens = token.nodes = [];\n        parent = token;\n      }\n      name = \"\";\n\n      // Close parentheses\n    } else if (closeParentheses === code && balanced) {\n      pos += 1;\n      code = value.charCodeAt(pos);\n\n      parent.after = after;\n      after = \"\";\n      balanced -= 1;\n      stack.pop();\n      parent = stack[balanced];\n      tokens = parent.nodes;\n\n      // Words\n    } else {\n      next = pos;\n      do {\n        if (code === backslash) {\n          next += 1;\n        }\n        next += 1;\n        code = value.charCodeAt(next);\n      } while (\n        next < max &&\n        !(\n          code <= 32 ||\n          code === singleQuote ||\n          code === doubleQuote ||\n          code === comma ||\n          code === colon ||\n          code === slash ||\n          code === openParentheses ||\n          (code === closeParentheses && balanced)\n        )\n      );\n      token = value.slice(pos, next);\n\n      if (openParentheses === code) {\n        name = token;\n      } else {\n        tokens.push({\n          type: \"word\",\n          sourceIndex: pos,\n          value: token\n        });\n      }\n\n      pos = next;\n    }\n  }\n\n  for (pos = stack.length - 1; pos; pos -= 1) {\n    stack[pos].unclosed = true;\n  }\n\n  return stack[0].nodes;\n};\n","function stringifyNode(node, custom) {\n  var type = node.type;\n  var value = node.value;\n  var buf;\n  var customResult;\n\n  if (custom && (customResult = custom(node)) !== undefined) {\n    return customResult;\n  } else if (type === \"word\" || type === \"space\") {\n    return value;\n  } else if (type === \"string\") {\n    buf = node.quote || \"\";\n    return buf + value + (node.unclosed ? \"\" : buf);\n  } else if (type === \"comment\") {\n    return \"/*\" + value + (node.unclosed ? \"\" : \"*/\");\n  } else if (type === \"div\") {\n    return (node.before || \"\") + value + (node.after || \"\");\n  } else if (Array.isArray(node.nodes)) {\n    buf = stringify(node.nodes);\n    if (type !== \"function\") {\n      return buf;\n    }\n    return (\n      value +\n      \"(\" +\n      (node.before || \"\") +\n      buf +\n      (node.after || \"\") +\n      (node.unclosed ? \"\" : \")\")\n    );\n  }\n  return value;\n}\n\nfunction stringify(nodes, custom) {\n  var result, i;\n\n  if (Array.isArray(nodes)) {\n    result = \"\";\n    for (i = nodes.length - 1; ~i; i -= 1) {\n      result = stringifyNode(nodes[i], custom) + result;\n    }\n    return result;\n  }\n  return stringifyNode(nodes, custom);\n}\n\nmodule.exports = stringify;\n","var minus = \"-\".charCodeAt(0);\nvar plus = \"+\".charCodeAt(0);\nvar dot = \".\".charCodeAt(0);\nvar exp = \"e\".charCodeAt(0);\nvar EXP = \"E\".charCodeAt(0);\n\nmodule.exports = function(value) {\n  var pos = 0;\n  var length = value.length;\n  var dotted = false;\n  var sciPos = -1;\n  var containsNumber = false;\n  var code;\n\n  while (pos < length) {\n    code = value.charCodeAt(pos);\n\n    if (code >= 48 && code <= 57) {\n      containsNumber = true;\n    } else if (code === exp || code === EXP) {\n      if (sciPos > -1) {\n        break;\n      }\n      sciPos = pos;\n    } else if (code === dot) {\n      if (dotted) {\n        break;\n      }\n      dotted = true;\n    } else if (code === plus || code === minus) {\n      if (pos !== 0) {\n        break;\n      }\n    } else {\n      break;\n    }\n\n    pos += 1;\n  }\n\n  if (sciPos + 1 === pos) pos--;\n\n  return containsNumber\n    ? {\n        number: value.slice(0, pos),\n        unit: value.slice(pos)\n      }\n    : false;\n};\n","module.exports = function walk(nodes, cb, bubble) {\n  var i, max, node, result;\n\n  for (i = 0, max = nodes.length; i < max; i += 1) {\n    node = nodes[i];\n    if (!bubble) {\n      result = cb(node, i, nodes);\n    }\n\n    if (\n      result !== false &&\n      node.type === \"function\" &&\n      Array.isArray(node.nodes)\n    ) {\n      walk(node.nodes, cb, bubble);\n    }\n\n    if (bubble) {\n      cb(node, i, nodes);\n    }\n  }\n};\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","var rafSchd = function rafSchd(fn) {\n  var lastArgs = [];\n  var frameId = null;\n\n  var wrapperFn = function wrapperFn() {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    lastArgs = args;\n\n    if (frameId) {\n      return;\n    }\n\n    frameId = requestAnimationFrame(function () {\n      frameId = null;\n      fn.apply(void 0, lastArgs);\n    });\n  };\n\n  wrapperFn.cancel = function () {\n    if (!frameId) {\n      return;\n    }\n\n    cancelAnimationFrame(frameId);\n    frameId = null;\n  };\n\n  return wrapperFn;\n};\n\nexport default rafSchd;\n","var now = require('performance-now')\n  , root = typeof window === 'undefined' ? global : window\n  , vendors = ['moz', 'webkit']\n  , suffix = 'AnimationFrame'\n  , raf = root['request' + suffix]\n  , caf = root['cancel' + suffix] || root['cancelRequest' + suffix]\n\nfor(var i = 0; !raf && i < vendors.length; i++) {\n  raf = root[vendors[i] + 'Request' + suffix]\n  caf = root[vendors[i] + 'Cancel' + suffix]\n      || root[vendors[i] + 'CancelRequest' + suffix]\n}\n\n// Some versions of FF have rAF but not cAF\nif(!raf || !caf) {\n  var last = 0\n    , id = 0\n    , queue = []\n    , frameDuration = 1000 / 60\n\n  raf = function(callback) {\n    if(queue.length === 0) {\n      var _now = now()\n        , next = Math.max(0, frameDuration - (_now - last))\n      last = next + _now\n      setTimeout(function() {\n        var cp = queue.slice(0)\n        // Clear queue here to prevent\n        // callbacks from appending listeners\n        // to the current frame's queue\n        queue.length = 0\n        for(var i = 0; i < cp.length; i++) {\n          if(!cp[i].cancelled) {\n            try{\n              cp[i].callback(last)\n            } catch(e) {\n              setTimeout(function() { throw e }, 0)\n            }\n          }\n        }\n      }, Math.round(next))\n    }\n    queue.push({\n      handle: ++id,\n      callback: callback,\n      cancelled: false\n    })\n    return id\n  }\n\n  caf = function(handle) {\n    for(var i = 0; i < queue.length; i++) {\n      if(queue[i].handle === handle) {\n        queue[i].cancelled = true\n      }\n    }\n  }\n}\n\nmodule.exports = function(fn) {\n  // Wrap in a new function to prevent\n  // `cancel` potentially being assigned\n  // to the native rAF function\n  return raf.call(root, fn)\n}\nmodule.exports.cancel = function() {\n  caf.apply(root, arguments)\n}\nmodule.exports.polyfill = function(object) {\n  if (!object) {\n    object = root;\n  }\n  object.requestAnimationFrame = raf\n  object.cancelAnimationFrame = caf\n}\n","/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nfunction componentWillMount() {\n  // Call this.constructor.gDSFP to support sub-classes.\n  var state = this.constructor.getDerivedStateFromProps(this.props, this.state);\n  if (state !== null && state !== undefined) {\n    this.setState(state);\n  }\n}\n\nfunction componentWillReceiveProps(nextProps) {\n  // Call this.constructor.gDSFP to support sub-classes.\n  // Use the setState() updater to ensure state isn't stale in certain edge cases.\n  function updater(prevState) {\n    var state = this.constructor.getDerivedStateFromProps(nextProps, prevState);\n    return state !== null && state !== undefined ? state : null;\n  }\n  // Binding \"this\" is important for shallow renderer support.\n  this.setState(updater.bind(this));\n}\n\nfunction componentWillUpdate(nextProps, nextState) {\n  try {\n    var prevProps = this.props;\n    var prevState = this.state;\n    this.props = nextProps;\n    this.state = nextState;\n    this.__reactInternalSnapshotFlag = true;\n    this.__reactInternalSnapshot = this.getSnapshotBeforeUpdate(\n      prevProps,\n      prevState\n    );\n  } finally {\n    this.props = prevProps;\n    this.state = prevState;\n  }\n}\n\n// React may warn about cWM/cWRP/cWU methods being deprecated.\n// Add a flag to suppress these warnings for this special case.\ncomponentWillMount.__suppressDeprecationWarning = true;\ncomponentWillReceiveProps.__suppressDeprecationWarning = true;\ncomponentWillUpdate.__suppressDeprecationWarning = true;\n\nfunction polyfill(Component) {\n  var prototype = Component.prototype;\n\n  if (!prototype || !prototype.isReactComponent) {\n    throw new Error('Can only polyfill class components');\n  }\n\n  if (\n    typeof Component.getDerivedStateFromProps !== 'function' &&\n    typeof prototype.getSnapshotBeforeUpdate !== 'function'\n  ) {\n    return Component;\n  }\n\n  // If new component APIs are defined, \"unsafe\" lifecycles won't be called.\n  // Error if any of these lifecycles are present,\n  // Because they would work differently between older and newer (16.3+) versions of React.\n  var foundWillMountName = null;\n  var foundWillReceivePropsName = null;\n  var foundWillUpdateName = null;\n  if (typeof prototype.componentWillMount === 'function') {\n    foundWillMountName = 'componentWillMount';\n  } else if (typeof prototype.UNSAFE_componentWillMount === 'function') {\n    foundWillMountName = 'UNSAFE_componentWillMount';\n  }\n  if (typeof prototype.componentWillReceiveProps === 'function') {\n    foundWillReceivePropsName = 'componentWillReceiveProps';\n  } else if (typeof prototype.UNSAFE_componentWillReceiveProps === 'function') {\n    foundWillReceivePropsName = 'UNSAFE_componentWillReceiveProps';\n  }\n  if (typeof prototype.componentWillUpdate === 'function') {\n    foundWillUpdateName = 'componentWillUpdate';\n  } else if (typeof prototype.UNSAFE_componentWillUpdate === 'function') {\n    foundWillUpdateName = 'UNSAFE_componentWillUpdate';\n  }\n  if (\n    foundWillMountName !== null ||\n    foundWillReceivePropsName !== null ||\n    foundWillUpdateName !== null\n  ) {\n    var componentName = Component.displayName || Component.name;\n    var newApiName =\n      typeof Component.getDerivedStateFromProps === 'function'\n        ? 'getDerivedStateFromProps()'\n        : 'getSnapshotBeforeUpdate()';\n\n    throw Error(\n      'Unsafe legacy lifecycles will not be called for components using new component APIs.\\n\\n' +\n        componentName +\n        ' uses ' +\n        newApiName +\n        ' but also contains the following legacy lifecycles:' +\n        (foundWillMountName !== null ? '\\n  ' + foundWillMountName : '') +\n        (foundWillReceivePropsName !== null\n          ? '\\n  ' + foundWillReceivePropsName\n          : '') +\n        (foundWillUpdateName !== null ? '\\n  ' + foundWillUpdateName : '') +\n        '\\n\\nThe above lifecycles should be removed. Learn more about this warning here:\\n' +\n        'https://fb.me/react-async-component-lifecycle-hooks'\n    );\n  }\n\n  // React <= 16.2 does not support static getDerivedStateFromProps.\n  // As a workaround, use cWM and cWRP to invoke the new static lifecycle.\n  // Newer versions of React will ignore these lifecycles if gDSFP exists.\n  if (typeof Component.getDerivedStateFromProps === 'function') {\n    prototype.componentWillMount = componentWillMount;\n    prototype.componentWillReceiveProps = componentWillReceiveProps;\n  }\n\n  // React <= 16.2 does not support getSnapshotBeforeUpdate.\n  // As a workaround, use cWU to invoke the new lifecycle.\n  // Newer versions of React will ignore that lifecycle if gSBU exists.\n  if (typeof prototype.getSnapshotBeforeUpdate === 'function') {\n    if (typeof prototype.componentDidUpdate !== 'function') {\n      throw new Error(\n        'Cannot polyfill getSnapshotBeforeUpdate() for components that do not define componentDidUpdate() on the prototype'\n      );\n    }\n\n    prototype.componentWillUpdate = componentWillUpdate;\n\n    var componentDidUpdate = prototype.componentDidUpdate;\n\n    prototype.componentDidUpdate = function componentDidUpdatePolyfill(\n      prevProps,\n      prevState,\n      maybeSnapshot\n    ) {\n      // 16.3+ will not execute our will-update method;\n      // It will pass a snapshot value to did-update though.\n      // Older versions will require our polyfilled will-update value.\n      // We need to handle both cases, but can't just check for the presence of \"maybeSnapshot\",\n      // Because for <= 15.x versions this might be a \"prevContext\" object.\n      // We also can't just check \"__reactInternalSnapshot\",\n      // Because get-snapshot might return a falsy value.\n      // So check for the explicit __reactInternalSnapshotFlag flag to determine behavior.\n      var snapshot = this.__reactInternalSnapshotFlag\n        ? this.__reactInternalSnapshot\n        : maybeSnapshot;\n\n      componentDidUpdate.call(this, prevProps, prevState, snapshot);\n    };\n  }\n\n  return Component;\n}\n\nexport { polyfill };\n","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nimport { PureComponent } from 'react';\n\nvar ChildWrapper =\n/*#__PURE__*/\nfunction (_PureComponent) {\n  _inherits(ChildWrapper, _PureComponent);\n\n  function ChildWrapper() {\n    _classCallCheck(this, ChildWrapper);\n\n    return _possibleConstructorReturn(this, _getPrototypeOf(ChildWrapper).apply(this, arguments));\n  }\n\n  _createClass(ChildWrapper, [{\n    key: \"render\",\n    value: function render() {\n      // eslint-disable-next-line react/prop-types\n      return this.props.children;\n    }\n  }]);\n\n  return ChildWrapper;\n}(PureComponent);\n\nexport default ChildWrapper;","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nimport React, { PureComponent, isValidElement, cloneElement, createElement } from 'react';\nimport { findDOMNode } from 'react-dom';\nimport ResizeObserver from 'resize-observer-polyfill';\nimport rafSchd from 'raf-schd';\nimport { bool, number, string, shape, func, any, node } from 'prop-types';\nimport { getHandle, isFunction, isSSR, isDOMElement } from \"../lib/utils\";\nimport ChildWrapper from \"./ChildWrapper\";\n\nvar ResizeDetector =\n/*#__PURE__*/\nfunction (_PureComponent) {\n  _inherits(ResizeDetector, _PureComponent);\n\n  function ResizeDetector(props) {\n    var _this;\n\n    _classCallCheck(this, ResizeDetector);\n\n    _this = _possibleConstructorReturn(this, _getPrototypeOf(ResizeDetector).call(this, props));\n\n    _defineProperty(_assertThisInitialized(_this), \"cancelHandler\", function () {\n      if (_this.resizeHandler && _this.resizeHandler.cancel) {\n        // cancel debounced handler\n        _this.resizeHandler.cancel();\n\n        _this.resizeHandler = null;\n      }\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"rafClean\", function () {\n      if (_this.raf && _this.raf.cancel) {\n        _this.raf.cancel();\n\n        _this.raf = null;\n      }\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"toggleObserver\", function (type) {\n      var element = _this.getElement();\n\n      if (!element || !_this.resizeObserver[type]) return;\n\n      _this.resizeObserver[type](element);\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"getElement\", function () {\n      var _this$props = _this.props,\n          querySelector = _this$props.querySelector,\n          targetDomEl = _this$props.targetDomEl;\n      if (isSSR()) return undefined;\n      if (querySelector) return document.querySelector(querySelector);\n      if (targetDomEl && isDOMElement(targetDomEl)) return targetDomEl; // eslint-disable-next-line react/no-find-dom-node\n\n      var currentElement = _this.element && findDOMNode(_this.element);\n      if (!currentElement) return undefined;\n      return currentElement.parentElement;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"createUpdater\", function () {\n      _this.rafClean();\n\n      _this.raf = rafSchd(function (_ref) {\n        var width = _ref.width,\n            height = _ref.height;\n        var onResize = _this.props.onResize;\n\n        if (isFunction(onResize)) {\n          onResize(width, height);\n        }\n\n        _this.setState({\n          width: width,\n          height: height\n        });\n      });\n      return _this.raf;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"createResizeHandler\", function (entries) {\n      var _this$state = _this.state,\n          widthCurrent = _this$state.width,\n          heightCurrent = _this$state.height;\n      var _this$props2 = _this.props,\n          handleWidth = _this$props2.handleWidth,\n          handleHeight = _this$props2.handleHeight;\n      if (!handleWidth && !handleHeight) return;\n\n      var updater = _this.createUpdater();\n\n      entries.forEach(function (entry) {\n        var _ref2 = entry && entry.contentRect || {},\n            width = _ref2.width,\n            height = _ref2.height;\n\n        var isWidthChanged = handleWidth && widthCurrent !== width;\n        var isHeightChanged = handleHeight && heightCurrent !== height;\n        var isSizeChanged = isWidthChanged || isHeightChanged;\n        var shouldSetSize = !_this.skipOnMount && isSizeChanged && !isSSR();\n\n        if (shouldSetSize) {\n          updater({\n            width: width,\n            height: height\n          });\n        }\n\n        _this.skipOnMount = false;\n      });\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"onRef\", function (el) {\n      _this.element = el;\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"getRenderType\", function () {\n      var _this$props3 = _this.props,\n          render = _this$props3.render,\n          children = _this$props3.children;\n\n      if (isFunction(render)) {\n        return 'renderProp';\n      }\n\n      if (isFunction(children)) {\n        return 'childFunction';\n      }\n\n      if (isValidElement(children)) {\n        return 'child';\n      }\n\n      if (Array.isArray(children)) {\n        return 'childArray';\n      }\n\n      return 'parent';\n    });\n\n    _defineProperty(_assertThisInitialized(_this), \"getTargetComponent\", function () {\n      var _this$props4 = _this.props,\n          render = _this$props4.render,\n          children = _this$props4.children,\n          nodeType = _this$props4.nodeType;\n      var _this$state2 = _this.state,\n          width = _this$state2.width,\n          height = _this$state2.height;\n      var childProps = {\n        width: width,\n        height: height\n      };\n\n      var renderType = _this.getRenderType();\n\n      switch (renderType) {\n        case 'renderProp':\n          return cloneElement(render(childProps), {\n            key: 'resize-detector'\n          });\n\n        case 'childFunction':\n          return cloneElement(children(childProps));\n\n        case 'child':\n          return cloneElement(children, childProps);\n\n        case 'childArray':\n          return children.map(function (el) {\n            return !!el && cloneElement(el, childProps);\n          });\n\n        default:\n          return createElement(nodeType);\n      }\n    });\n\n    var skipOnMount = props.skipOnMount,\n        refreshMode = props.refreshMode,\n        refreshRate = props.refreshRate,\n        refreshOptions = props.refreshOptions;\n    _this.state = {\n      width: undefined,\n      height: undefined\n    };\n    _this.skipOnMount = skipOnMount;\n    _this.raf = null;\n    _this.element = null;\n    _this.unmounted = false;\n    var handle = getHandle(refreshMode);\n    _this.resizeHandler = handle ? handle(_this.createResizeHandler, refreshRate, refreshOptions) : _this.createResizeHandler;\n    _this.resizeObserver = new ResizeObserver(_this.resizeHandler);\n    return _this;\n  }\n\n  _createClass(ResizeDetector, [{\n    key: \"componentDidMount\",\n    value: function componentDidMount() {\n      this.toggleObserver('observe');\n    }\n  }, {\n    key: \"componentWillUnmount\",\n    value: function componentWillUnmount() {\n      this.toggleObserver('unobserve');\n      this.rafClean();\n      this.cancelHandler();\n      this.unmounted = true;\n    }\n  }, {\n    key: \"render\",\n    value: function render() {\n      return React.createElement(ChildWrapper, {\n        ref: this.onRef\n      }, this.getTargetComponent());\n    }\n  }]);\n\n  return ResizeDetector;\n}(PureComponent);\n\nResizeDetector.propTypes = {\n  handleWidth: bool,\n  handleHeight: bool,\n  skipOnMount: bool,\n  refreshRate: number,\n  refreshMode: string,\n  refreshOptions: shape({\n    leading: bool,\n    trailing: bool\n  }),\n  querySelector: string,\n  targetDomEl: any,\n  // eslint-disable-line react/forbid-prop-types\n  onResize: func,\n  render: func,\n  children: any,\n  // eslint-disable-line react/forbid-prop-types\n  nodeType: node\n};\nResizeDetector.defaultProps = {\n  handleWidth: false,\n  handleHeight: false,\n  skipOnMount: false,\n  refreshRate: 1000,\n  refreshMode: undefined,\n  refreshOptions: undefined,\n  querySelector: null,\n  targetDomEl: null,\n  onResize: null,\n  render: undefined,\n  children: null,\n  nodeType: 'div'\n};\nexport default ResizeDetector;","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nimport React, { Component } from 'react';\nimport ResizeDetector from \"../components/ResizeDetector\";\n\nvar withResizeDetector = function withResizeDetector(WrappedComponent) {\n  var props = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n    handleWidth: true,\n    handleHeight: true\n  };\n  return (\n    /*#__PURE__*/\n    // eslint-disable-next-line\n    function (_Component) {\n      _inherits(ResizeDetectorHOC, _Component);\n\n      function ResizeDetectorHOC() {\n        _classCallCheck(this, ResizeDetectorHOC);\n\n        return _possibleConstructorReturn(this, _getPrototypeOf(ResizeDetectorHOC).apply(this, arguments));\n      }\n\n      _createClass(ResizeDetectorHOC, [{\n        key: \"render\",\n        value: function render() {\n          return React.createElement(ResizeDetector, props, React.createElement(WrappedComponent, this.props));\n        }\n      }]);\n\n      return ResizeDetectorHOC;\n    }(Component)\n  );\n};\n\nexport default withResizeDetector;","import ResizeDetector from \"./components/ResizeDetector\";\nimport withResizeDetector from \"./hoc/withResizeDetector\";\nexport { withResizeDetector };\nexport default ResizeDetector;","import debounce from \"lodash-es/debounce\";\nimport throttle from \"lodash-es/throttle\";\nexport var listHandle = {\n  debounce: debounce,\n  throttle: throttle\n};\nexport var getHandle = function getHandle(type) {\n  return listHandle[type];\n};\nexport var isFunction = function isFunction(fn) {\n  return typeof fn === 'function';\n};\nexport var isSSR = function isSSR() {\n  return typeof window === 'undefined';\n};\nexport var isDOMElement = function isDOMElement(element) {\n  return element instanceof Element || element instanceof HTMLDocument;\n};","import _isEqual from \"lodash/isEqual\";\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\nfunction _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nimport React, { PureComponent, cloneElement, Children } from 'react';\nimport PropTypes from 'prop-types';\nimport createAnimateManager from './AnimateManager';\nimport { configEasing } from './easing';\nimport configUpdate from './configUpdate';\nimport { getTransitionVal, identity, translateStyle } from './util';\n\nvar Animate =\n/*#__PURE__*/\nfunction (_PureComponent) {\n  _inherits(Animate, _PureComponent);\n\n  function Animate(props, context) {\n    var _this;\n\n    _classCallCheck(this, Animate);\n\n    _this = _possibleConstructorReturn(this, _getPrototypeOf(Animate).call(this, props, context));\n    var _this$props = _this.props,\n        isActive = _this$props.isActive,\n        attributeName = _this$props.attributeName,\n        from = _this$props.from,\n        to = _this$props.to,\n        steps = _this$props.steps,\n        children = _this$props.children;\n    _this.handleStyleChange = _this.handleStyleChange.bind(_assertThisInitialized(_assertThisInitialized(_this)));\n    _this.changeStyle = _this.changeStyle.bind(_assertThisInitialized(_assertThisInitialized(_this)));\n\n    if (!isActive) {\n      _this.state = {\n        style: {}\n      }; // if children is a function and animation is not active, set style to 'to'\n\n      if (typeof children === 'function') {\n        _this.state = {\n          style: to\n        };\n      }\n\n      return _possibleConstructorReturn(_this);\n    }\n\n    if (steps && steps.length) {\n      _this.state = {\n        style: steps[0].style\n      };\n    } else if (from) {\n      if (typeof children === 'function') {\n        _this.state = {\n          style: from\n        };\n        return _possibleConstructorReturn(_this);\n      }\n\n      _this.state = {\n        style: attributeName ? _defineProperty({}, attributeName, from) : from\n      };\n    } else {\n      _this.state = {\n        style: {}\n      };\n    }\n\n    return _this;\n  }\n\n  _createClass(Animate, [{\n    key: \"componentDidMount\",\n    value: function componentDidMount() {\n      var _this$props2 = this.props,\n          isActive = _this$props2.isActive,\n          canBegin = _this$props2.canBegin;\n      this.mounted = true;\n\n      if (!isActive || !canBegin) {\n        return;\n      }\n\n      this.runAnimation(this.props);\n    }\n  }, {\n    key: \"componentDidUpdate\",\n    value: function componentDidUpdate(prevProps) {\n      var _this$props3 = this.props,\n          isActive = _this$props3.isActive,\n          canBegin = _this$props3.canBegin,\n          attributeName = _this$props3.attributeName,\n          shouldReAnimate = _this$props3.shouldReAnimate;\n\n      if (!canBegin) {\n        return;\n      }\n\n      if (!isActive) {\n        // eslint-disable-next-line react/no-did-update-set-state\n        this.setState({\n          style: attributeName ? _defineProperty({}, attributeName, this.props.to) : this.props.to\n        });\n        return;\n      }\n\n      if (_isEqual(prevProps.to, this.props.to) && prevProps.canBegin && prevProps.isActive) {\n        return;\n      }\n\n      var isTriggered = !prevProps.canBegin || !prevProps.isActive;\n\n      if (this.manager) {\n        this.manager.stop();\n      }\n\n      if (this.stopJSAnimation) {\n        this.stopJSAnimation();\n      }\n\n      var from = isTriggered || shouldReAnimate ? this.props.from : prevProps.to; // eslint-disable-next-line react/no-did-update-set-state\n\n      this.setState({\n        style: attributeName ? _defineProperty({}, attributeName, from) : from\n      });\n      this.runAnimation(_objectSpread({}, this.props, {\n        from: from,\n        begin: 0\n      }));\n    }\n  }, {\n    key: \"componentWillUnmount\",\n    value: function componentWillUnmount() {\n      this.mounted = false;\n\n      if (this.unSubscribe) {\n        this.unSubscribe();\n      }\n\n      if (this.manager) {\n        this.manager.stop();\n        this.manager = null;\n      }\n\n      if (this.stopJSAnimation) {\n        this.stopJSAnimation();\n      }\n    }\n  }, {\n    key: \"runJSAnimation\",\n    value: function runJSAnimation(props) {\n      var _this2 = this;\n\n      var from = props.from,\n          to = props.to,\n          duration = props.duration,\n          easing = props.easing,\n          begin = props.begin,\n          onAnimationEnd = props.onAnimationEnd,\n          onAnimationStart = props.onAnimationStart;\n      var startAnimation = configUpdate(from, to, configEasing(easing), duration, this.changeStyle);\n\n      var finalStartAnimation = function finalStartAnimation() {\n        _this2.stopJSAnimation = startAnimation();\n      };\n\n      this.manager.start([onAnimationStart, begin, finalStartAnimation, duration, onAnimationEnd]);\n    }\n  }, {\n    key: \"runStepAnimation\",\n    value: function runStepAnimation(props) {\n      var _this3 = this;\n\n      var steps = props.steps,\n          begin = props.begin,\n          onAnimationStart = props.onAnimationStart;\n      var _steps$ = steps[0],\n          initialStyle = _steps$.style,\n          _steps$$duration = _steps$.duration,\n          initialTime = _steps$$duration === void 0 ? 0 : _steps$$duration;\n\n      var addStyle = function addStyle(sequence, nextItem, index) {\n        if (index === 0) {\n          return sequence;\n        }\n\n        var duration = nextItem.duration,\n            _nextItem$easing = nextItem.easing,\n            easing = _nextItem$easing === void 0 ? 'ease' : _nextItem$easing,\n            style = nextItem.style,\n            nextProperties = nextItem.properties,\n            onAnimationEnd = nextItem.onAnimationEnd;\n        var preItem = index > 0 ? steps[index - 1] : nextItem;\n        var properties = nextProperties || Object.keys(style);\n\n        if (typeof easing === 'function' || easing === 'spring') {\n          return _toConsumableArray(sequence).concat([_this3.runJSAnimation.bind(_this3, {\n            from: preItem.style,\n            to: style,\n            duration: duration,\n            easing: easing\n          }), duration]);\n        }\n\n        var transition = getTransitionVal(properties, duration, easing);\n\n        var newStyle = _objectSpread({}, preItem.style, style, {\n          transition: transition\n        });\n\n        return _toConsumableArray(sequence).concat([newStyle, duration, onAnimationEnd]).filter(identity);\n      };\n\n      return this.manager.start([onAnimationStart].concat(_toConsumableArray(steps.reduce(addStyle, [initialStyle, Math.max(initialTime, begin)])), [props.onAnimationEnd]));\n    }\n  }, {\n    key: \"runAnimation\",\n    value: function runAnimation(props) {\n      if (!this.manager) {\n        this.manager = createAnimateManager();\n      }\n\n      var begin = props.begin,\n          duration = props.duration,\n          attributeName = props.attributeName,\n          propsTo = props.to,\n          easing = props.easing,\n          onAnimationStart = props.onAnimationStart,\n          onAnimationEnd = props.onAnimationEnd,\n          steps = props.steps,\n          children = props.children;\n      var manager = this.manager;\n      this.unSubscribe = manager.subscribe(this.handleStyleChange);\n\n      if (typeof easing === 'function' || typeof children === 'function' || easing === 'spring') {\n        this.runJSAnimation(props);\n        return;\n      }\n\n      if (steps.length > 1) {\n        this.runStepAnimation(props);\n        return;\n      }\n\n      var to = attributeName ? _defineProperty({}, attributeName, propsTo) : propsTo;\n      var transition = getTransitionVal(Object.keys(to), duration, easing);\n      manager.start([onAnimationStart, begin, _objectSpread({}, to, {\n        transition: transition\n      }), duration, onAnimationEnd]);\n    }\n  }, {\n    key: \"handleStyleChange\",\n    value: function handleStyleChange(style) {\n      this.changeStyle(style);\n    }\n  }, {\n    key: \"changeStyle\",\n    value: function changeStyle(style) {\n      if (this.mounted) {\n        this.setState({\n          style: style\n        });\n      }\n    }\n  }, {\n    key: \"render\",\n    value: function render() {\n      var _this$props4 = this.props,\n          children = _this$props4.children,\n          begin = _this$props4.begin,\n          duration = _this$props4.duration,\n          attributeName = _this$props4.attributeName,\n          easing = _this$props4.easing,\n          isActive = _this$props4.isActive,\n          steps = _this$props4.steps,\n          from = _this$props4.from,\n          to = _this$props4.to,\n          canBegin = _this$props4.canBegin,\n          onAnimationEnd = _this$props4.onAnimationEnd,\n          shouldReAnimate = _this$props4.shouldReAnimate,\n          onAnimationReStart = _this$props4.onAnimationReStart,\n          others = _objectWithoutProperties(_this$props4, [\"children\", \"begin\", \"duration\", \"attributeName\", \"easing\", \"isActive\", \"steps\", \"from\", \"to\", \"canBegin\", \"onAnimationEnd\", \"shouldReAnimate\", \"onAnimationReStart\"]);\n\n      var count = Children.count(children);\n      var stateStyle = translateStyle(this.state.style);\n\n      if (typeof children === 'function') {\n        return children(stateStyle);\n      }\n\n      if (!isActive || count === 0) {\n        return children;\n      }\n\n      var cloneContainer = function cloneContainer(container) {\n        var _container$props = container.props,\n            _container$props$styl = _container$props.style,\n            style = _container$props$styl === void 0 ? {} : _container$props$styl,\n            className = _container$props.className;\n        var res = cloneElement(container, _objectSpread({}, others, {\n          style: _objectSpread({}, style, stateStyle),\n          className: className\n        }));\n        return res;\n      };\n\n      if (count === 1) {\n        return cloneContainer(Children.only(children));\n      }\n\n      return React.createElement(\"div\", null, Children.map(children, function (child) {\n        return cloneContainer(child);\n      }));\n    }\n  }]);\n\n  return Animate;\n}(PureComponent);\n\nAnimate.displayName = 'Animate';\nAnimate.propTypes = {\n  from: PropTypes.oneOfType([PropTypes.object, PropTypes.string]),\n  to: PropTypes.oneOfType([PropTypes.object, PropTypes.string]),\n  attributeName: PropTypes.string,\n  // animation duration\n  duration: PropTypes.number,\n  begin: PropTypes.number,\n  easing: PropTypes.oneOfType([PropTypes.string, PropTypes.func]),\n  steps: PropTypes.arrayOf(PropTypes.shape({\n    duration: PropTypes.number.isRequired,\n    style: PropTypes.object.isRequired,\n    easing: PropTypes.oneOfType([PropTypes.oneOf(['ease', 'ease-in', 'ease-out', 'ease-in-out', 'linear']), PropTypes.func]),\n    // transition css properties(dash case), optional\n    properties: PropTypes.arrayOf('string'),\n    onAnimationEnd: PropTypes.func\n  })),\n  children: PropTypes.oneOfType([PropTypes.node, PropTypes.func]),\n  isActive: PropTypes.bool,\n  canBegin: PropTypes.bool,\n  onAnimationEnd: PropTypes.func,\n  // decide if it should reanimate with initial from style when props change\n  shouldReAnimate: PropTypes.bool,\n  onAnimationStart: PropTypes.func,\n  onAnimationReStart: PropTypes.func\n};\nAnimate.defaultProps = {\n  begin: 0,\n  duration: 1000,\n  from: '',\n  to: '',\n  attributeName: '',\n  easing: 'ease',\n  isActive: true,\n  canBegin: true,\n  steps: [],\n  onAnimationEnd: function onAnimationEnd() {},\n  onAnimationStart: function onAnimationStart() {}\n};\nexport default Animate;","import React, { Children } from 'react';\nimport { TransitionGroup } from 'react-transition-group';\nimport PropTypes from 'prop-types';\nimport AnimateGroupChild from './AnimateGroupChild';\n\nfunction AnimateGroup(props) {\n  var component = props.component,\n      children = props.children,\n      appear = props.appear,\n      enter = props.enter,\n      leave = props.leave;\n  return React.createElement(TransitionGroup, {\n    component: component\n  }, Children.map(children, function (child, index) {\n    return React.createElement(AnimateGroupChild, {\n      appearOptions: appear,\n      enterOptions: enter,\n      leaveOptions: leave,\n      key: \"child-\".concat(index)\n    }, child);\n  }));\n}\n\nAnimateGroup.propTypes = {\n  appear: PropTypes.object,\n  enter: PropTypes.object,\n  leave: PropTypes.object,\n  children: PropTypes.oneOfType([PropTypes.array, PropTypes.element]),\n  component: PropTypes.any\n};\nAnimateGroup.defaultProps = {\n  component: 'span'\n};\nexport default AnimateGroup;","import _isNumber from \"lodash/isNumber\";\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nimport React, { Component, Children } from 'react';\nimport { Transition } from 'react-transition-group';\nimport PropTypes from 'prop-types';\nimport Animate from './Animate';\n\nvar parseDurationOfSingleTransition = function parseDurationOfSingleTransition() {\n  var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n  var steps = options.steps,\n      duration = options.duration;\n\n  if (steps && steps.length) {\n    return steps.reduce(function (result, entry) {\n      return result + (_isNumber(entry.duration) && entry.duration > 0 ? entry.duration : 0);\n    }, 0);\n  }\n\n  if (_isNumber(duration)) {\n    return duration;\n  }\n\n  return 0;\n};\n\nvar AnimateGroupChild =\n/*#__PURE__*/\nfunction (_Component) {\n  _inherits(AnimateGroupChild, _Component);\n\n  function AnimateGroupChild() {\n    var _getPrototypeOf2;\n\n    var _this;\n\n    _classCallCheck(this, AnimateGroupChild);\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    _this = _possibleConstructorReturn(this, (_getPrototypeOf2 = _getPrototypeOf(AnimateGroupChild)).call.apply(_getPrototypeOf2, [this].concat(args)));\n    _this.state = {\n      isActive: false\n    };\n\n    _this.handleEnter = function (node, isAppearing) {\n      var _this$props = _this.props,\n          appearOptions = _this$props.appearOptions,\n          enterOptions = _this$props.enterOptions;\n\n      _this.handleStyleActive(isAppearing ? appearOptions : enterOptions);\n    };\n\n    _this.handleExit = function () {\n      _this.handleStyleActive(_this.props.leaveOptions);\n    };\n\n    return _this;\n  }\n\n  _createClass(AnimateGroupChild, [{\n    key: \"handleStyleActive\",\n    value: function handleStyleActive(style) {\n      if (style) {\n        var onAnimationEnd = style.onAnimationEnd ? function () {\n          style.onAnimationEnd();\n        } : null;\n        this.setState(_objectSpread({}, style, {\n          onAnimationEnd: onAnimationEnd,\n          isActive: true\n        }));\n      }\n    }\n  }, {\n    key: \"parseTimeout\",\n    value: function parseTimeout() {\n      var _this$props2 = this.props,\n          appearOptions = _this$props2.appearOptions,\n          enterOptions = _this$props2.enterOptions,\n          leaveOptions = _this$props2.leaveOptions;\n      return parseDurationOfSingleTransition(appearOptions) + parseDurationOfSingleTransition(enterOptions) + parseDurationOfSingleTransition(leaveOptions);\n    }\n  }, {\n    key: \"render\",\n    value: function render() {\n      var _this2 = this;\n\n      var _this$props3 = this.props,\n          children = _this$props3.children,\n          appearOptions = _this$props3.appearOptions,\n          enterOptions = _this$props3.enterOptions,\n          leaveOptions = _this$props3.leaveOptions,\n          props = _objectWithoutProperties(_this$props3, [\"children\", \"appearOptions\", \"enterOptions\", \"leaveOptions\"]);\n\n      return React.createElement(Transition, _extends({}, props, {\n        onEnter: this.handleEnter,\n        onExit: this.handleExit,\n        timeout: this.parseTimeout()\n      }), function () {\n        return React.createElement(Animate, _this2.state, Children.only(children));\n      });\n    }\n  }]);\n\n  return AnimateGroupChild;\n}(Component);\n\nAnimateGroupChild.propTypes = {\n  appearOptions: PropTypes.object,\n  enterOptions: PropTypes.object,\n  leaveOptions: PropTypes.object,\n  children: PropTypes.element\n};\nexport default AnimateGroupChild;","function _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nimport setRafTimeout from './setRafTimeout';\nexport default function createAnimateManager() {\n  var currStyle = {};\n\n  var handleChange = function handleChange() {\n    return null;\n  };\n\n  var shouldStop = false;\n\n  var setStyle = function setStyle(_style) {\n    if (shouldStop) {\n      return;\n    }\n\n    if (Array.isArray(_style)) {\n      if (!_style.length) {\n        return;\n      }\n\n      var styles = _style;\n\n      var _styles = _toArray(styles),\n          curr = _styles[0],\n          restStyles = _styles.slice(1);\n\n      if (typeof curr === 'number') {\n        setRafTimeout(setStyle.bind(null, restStyles), curr);\n        return;\n      }\n\n      setStyle(curr);\n      setRafTimeout(setStyle.bind(null, restStyles));\n      return;\n    }\n\n    if (_typeof(_style) === 'object') {\n      currStyle = _style;\n      handleChange(currStyle);\n    }\n\n    if (typeof _style === 'function') {\n      _style();\n    }\n  };\n\n  return {\n    stop: function stop() {\n      shouldStop = true;\n    },\n    start: function start(style) {\n      shouldStop = false;\n      setStyle(style);\n    },\n    subscribe: function subscribe(_handleChange) {\n      handleChange = _handleChange;\n      return function () {\n        handleChange = function handleChange() {\n          return null;\n        };\n      };\n    }\n  };\n}","import _filter from \"lodash/filter\";\n\nfunction _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nimport raf, { cancel as caf } from 'raf';\nimport { getIntersectionKeys, mapObject } from './util';\n\nvar alpha = function alpha(begin, end, k) {\n  return begin + (end - begin) * k;\n};\n\nvar needContinue = function needContinue(_ref) {\n  var from = _ref.from,\n      to = _ref.to;\n  return from !== to;\n};\n/*\n * @description: cal new from value and velocity in each stepper\n * @return: { [styleProperty]: { from, to, velocity } }\n */\n\n\nvar calStepperVals = function calStepperVals(easing, preVals, steps) {\n  var nextStepVals = mapObject(function (key, val) {\n    if (needContinue(val)) {\n      var _easing = easing(val.from, val.to, val.velocity),\n          _easing2 = _slicedToArray(_easing, 2),\n          newX = _easing2[0],\n          newV = _easing2[1];\n\n      return _objectSpread({}, val, {\n        from: newX,\n        velocity: newV\n      });\n    }\n\n    return val;\n  }, preVals);\n\n  if (steps < 1) {\n    return mapObject(function (key, val) {\n      if (needContinue(val)) {\n        return _objectSpread({}, val, {\n          velocity: alpha(val.velocity, nextStepVals[key].velocity, steps),\n          from: alpha(val.from, nextStepVals[key].from, steps)\n        });\n      }\n\n      return val;\n    }, preVals);\n  }\n\n  return calStepperVals(easing, nextStepVals, steps - 1);\n}; // configure update function\n\n\nexport default (function (from, to, easing, duration, render) {\n  var interKeys = getIntersectionKeys(from, to);\n  var timingStyle = interKeys.reduce(function (res, key) {\n    return _objectSpread({}, res, _defineProperty({}, key, [from[key], to[key]]));\n  }, {});\n  var stepperStyle = interKeys.reduce(function (res, key) {\n    return _objectSpread({}, res, _defineProperty({}, key, {\n      from: from[key],\n      velocity: 0,\n      to: to[key]\n    }));\n  }, {});\n  var cafId = -1;\n  var preTime;\n  var beginTime;\n\n  var update = function update() {\n    return null;\n  };\n\n  var getCurrStyle = function getCurrStyle() {\n    return mapObject(function (key, val) {\n      return val.from;\n    }, stepperStyle);\n  };\n\n  var shouldStopAnimation = function shouldStopAnimation() {\n    return !_filter(stepperStyle, needContinue).length;\n  }; // stepper timing function like spring\n\n\n  var stepperUpdate = function stepperUpdate(now) {\n    if (!preTime) {\n      preTime = now;\n    }\n\n    var deltaTime = now - preTime;\n    var steps = deltaTime / easing.dt;\n    stepperStyle = calStepperVals(easing, stepperStyle, steps); // get union set and add compatible prefix\n\n    render(_objectSpread({}, from, to, getCurrStyle(stepperStyle)));\n    preTime = now;\n\n    if (!shouldStopAnimation()) {\n      cafId = raf(update);\n    }\n  }; // t => val timing function like cubic-bezier\n\n\n  var timingUpdate = function timingUpdate(now) {\n    if (!beginTime) {\n      beginTime = now;\n    }\n\n    var t = (now - beginTime) / duration;\n    var currStyle = mapObject(function (key, val) {\n      return alpha.apply(void 0, _toConsumableArray(val).concat([easing(t)]));\n    }, timingStyle); // get union set and add compatible prefix\n\n    render(_objectSpread({}, from, to, currStyle));\n\n    if (t < 1) {\n      cafId = raf(update);\n    } else {\n      var finalStyle = mapObject(function (key, val) {\n        return alpha.apply(void 0, _toConsumableArray(val).concat([easing(1)]));\n      }, timingStyle);\n      render(_objectSpread({}, from, to, finalStyle));\n    }\n  };\n\n  update = easing.isStepper ? stepperUpdate : timingUpdate; // return start animation method\n\n  return function () {\n    raf(update); // return stop animation method\n\n    return function () {\n      caf(cafId);\n    };\n  };\n});","function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nfunction _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nimport { warn } from './util';\nvar ACCURACY = 1e-4;\n\nvar cubicBezierFactor = function cubicBezierFactor(c1, c2) {\n  return [0, 3 * c1, 3 * c2 - 6 * c1, 3 * c1 - 3 * c2 + 1];\n};\n\nvar multyTime = function multyTime(params, t) {\n  return params.map(function (param, i) {\n    return param * Math.pow(t, i);\n  }).reduce(function (pre, curr) {\n    return pre + curr;\n  });\n};\n\nvar cubicBezier = function cubicBezier(c1, c2) {\n  return function (t) {\n    var params = cubicBezierFactor(c1, c2);\n    return multyTime(params, t);\n  };\n};\n\nvar derivativeCubicBezier = function derivativeCubicBezier(c1, c2) {\n  return function (t) {\n    var params = cubicBezierFactor(c1, c2);\n\n    var newParams = _toConsumableArray(params.map(function (param, i) {\n      return param * i;\n    }).slice(1)).concat([0]);\n\n    return multyTime(newParams, t);\n  };\n}; // calculate cubic-bezier using Newton's method\n\n\nexport var configBezier = function configBezier() {\n  for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n    args[_key] = arguments[_key];\n  }\n\n  var x1 = args[0],\n      y1 = args[1],\n      x2 = args[2],\n      y2 = args[3];\n\n  if (args.length === 1) {\n    switch (args[0]) {\n      case 'linear':\n        x1 = 0.0;\n        y1 = 0.0;\n        x2 = 1.0;\n        y2 = 1.0;\n        break;\n\n      case 'ease':\n        x1 = 0.25;\n        y1 = 0.1;\n        x2 = 0.25;\n        y2 = 1.0;\n        break;\n\n      case 'ease-in':\n        x1 = 0.42;\n        y1 = 0.0;\n        x2 = 1.0;\n        y2 = 1.0;\n        break;\n\n      case 'ease-out':\n        x1 = 0.42;\n        y1 = 0.0;\n        x2 = 0.58;\n        y2 = 1.0;\n        break;\n\n      case 'ease-in-out':\n        x1 = 0.0;\n        y1 = 0.0;\n        x2 = 0.58;\n        y2 = 1.0;\n        break;\n\n      default:\n        {\n          var easing = args[0].split('(');\n\n          if (easing[0] === 'cubic-bezier' && easing[1].split(')')[0].split(',').length === 4) {\n            var _easing$1$split$0$spl = easing[1].split(')')[0].split(',').map(function (x) {\n              return parseFloat(x);\n            });\n\n            var _easing$1$split$0$spl2 = _slicedToArray(_easing$1$split$0$spl, 4);\n\n            x1 = _easing$1$split$0$spl2[0];\n            y1 = _easing$1$split$0$spl2[1];\n            x2 = _easing$1$split$0$spl2[2];\n            y2 = _easing$1$split$0$spl2[3];\n          } else {\n            warn(false, '[configBezier]: arguments should be one of ' + 'oneOf \\'linear\\', \\'ease\\', \\'ease-in\\', \\'ease-out\\', ' + '\\'ease-in-out\\',\\'cubic-bezier(x1,y1,x2,y2)\\', instead received %s', args);\n          }\n        }\n    }\n  }\n\n  warn([x1, x2, y1, y2].every(function (num) {\n    return typeof num === 'number' && num >= 0 && num <= 1;\n  }), '[configBezier]: arguments should be x1, y1, x2, y2 of [0, 1] instead received %s', args);\n  var curveX = cubicBezier(x1, x2);\n  var curveY = cubicBezier(y1, y2);\n  var derCurveX = derivativeCubicBezier(x1, x2);\n\n  var rangeValue = function rangeValue(value) {\n    if (value > 1) {\n      return 1;\n    } else if (value < 0) {\n      return 0;\n    }\n\n    return value;\n  };\n\n  var bezier = function bezier(_t) {\n    var t = _t > 1 ? 1 : _t;\n    var x = t;\n\n    for (var i = 0; i < 8; ++i) {\n      var evalT = curveX(x) - t;\n      var derVal = derCurveX(x);\n\n      if (Math.abs(evalT - t) < ACCURACY || derVal < ACCURACY) {\n        return curveY(x);\n      }\n\n      x = rangeValue(x - evalT / derVal);\n    }\n\n    return curveY(x);\n  };\n\n  bezier.isStepper = false;\n  return bezier;\n};\nexport var configSpring = function configSpring() {\n  var config = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n  var _config$stiff = config.stiff,\n      stiff = _config$stiff === void 0 ? 100 : _config$stiff,\n      _config$damping = config.damping,\n      damping = _config$damping === void 0 ? 8 : _config$damping,\n      _config$dt = config.dt,\n      dt = _config$dt === void 0 ? 17 : _config$dt;\n\n  var stepper = function stepper(currX, destX, currV) {\n    var FSpring = -(currX - destX) * stiff;\n    var FDamping = currV * damping;\n    var newV = currV + (FSpring - FDamping) * dt / 1000;\n    var newX = currV * dt / 1000 + currX;\n\n    if (Math.abs(newX - destX) < ACCURACY && Math.abs(newV) < ACCURACY) {\n      return [destX, 0];\n    }\n\n    return [newX, newV];\n  };\n\n  stepper.isStepper = true;\n  stepper.dt = dt;\n  return stepper;\n};\nexport var configEasing = function configEasing() {\n  for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n    args[_key2] = arguments[_key2];\n  }\n\n  var easing = args[0];\n\n  if (typeof easing === 'string') {\n    switch (easing) {\n      case 'ease':\n      case 'ease-in-out':\n      case 'ease-out':\n      case 'ease-in':\n      case 'linear':\n        return configBezier(easing);\n\n      case 'spring':\n        return configSpring();\n\n      default:\n        if (easing.split('(')[0] === 'cubic-bezier') {\n          return configBezier(easing);\n        }\n\n        warn(false, '[configEasing]: first argument should be one of \\'ease\\', \\'ease-in\\', ' + '\\'ease-out\\', \\'ease-in-out\\',\\'cubic-bezier(x1,y1,x2,y2)\\', \\'linear\\' and \\'spring\\', instead  received %s', args);\n    }\n  }\n\n  if (typeof easing === 'function') {\n    return easing;\n  }\n\n  warn(false, '[configEasing]: first argument type should be function or ' + 'string, instead received %s', args);\n  return null;\n};","import Animate from './Animate';\nimport { configBezier, configSpring } from './easing';\nimport { translateStyle } from './util';\nimport AnimateGroup from './AnimateGroup';\nexport { configSpring, configBezier, AnimateGroup, translateStyle };\nexport default Animate;","import raf from 'raf';\nexport default function setRafTimeout(callback) {\n  var timeout = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  var currTime = -1;\n\n  var shouldUpdate = function shouldUpdate(now) {\n    if (currTime < 0) {\n      currTime = now;\n    }\n\n    if (now - currTime > timeout) {\n      callback(now);\n      currTime = -1;\n    } else {\n      raf(shouldUpdate);\n    }\n  };\n\n  raf(shouldUpdate);\n}","import _intersection from \"lodash/intersection\";\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\n/* eslint no-console: 0 */\nvar PREFIX_LIST = ['Webkit', 'Moz', 'O', 'ms'];\nvar IN_LINE_PREFIX_LIST = ['-webkit-', '-moz-', '-o-', '-ms-'];\nvar IN_COMPATIBLE_PROPERTY = ['transform', 'transformOrigin', 'transition'];\nexport var getIntersectionKeys = function getIntersectionKeys(preObj, nextObj) {\n  return _intersection(Object.keys(preObj), Object.keys(nextObj));\n};\nexport var identity = function identity(param) {\n  return param;\n};\n/*\n * @description: convert camel case to dash case\n * string => string\n */\n\nexport var getDashCase = function getDashCase(name) {\n  return name.replace(/([A-Z])/g, function (v) {\n    return \"-\".concat(v.toLowerCase());\n  });\n};\n/*\n * @description: add compatible style prefix\n * (string, string) => object\n */\n\nexport var generatePrefixStyle = function generatePrefixStyle(name, value) {\n  if (IN_COMPATIBLE_PROPERTY.indexOf(name) === -1) {\n    return _defineProperty({}, name, value);\n  }\n\n  var isTransition = name === 'transition';\n  var camelName = name.replace(/(\\w)/, function (v) {\n    return v.toUpperCase();\n  });\n  var styleVal = value;\n  return PREFIX_LIST.reduce(function (result, property, i) {\n    if (isTransition) {\n      styleVal = value.replace(/(transform|transform-origin)/gim, \"\".concat(IN_LINE_PREFIX_LIST[i], \"$1\"));\n    }\n\n    return _objectSpread({}, result, _defineProperty({}, property + camelName, styleVal));\n  }, {});\n};\nexport var log = function log() {\n  var _console;\n\n  (_console = console).log.apply(_console, arguments);\n};\n/*\n * @description: log the value of a varible\n * string => any => any\n */\n\nexport var debug = function debug(name) {\n  return function (item) {\n    log(name, item);\n    return item;\n  };\n};\n/*\n * @description: log name, args, return value of a function\n * function => function\n */\n\nexport var debugf = function debugf(tag, f) {\n  return function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    var res = f.apply(void 0, args);\n    var name = tag || f.name || 'anonymous function';\n    var argNames = \"(\".concat(args.map(JSON.stringify).join(', '), \")\");\n    log(\"\".concat(name, \": \").concat(argNames, \" => \").concat(JSON.stringify(res)));\n    return res;\n  };\n};\n/*\n * @description: map object on every element in this object.\n * (function, object) => object\n */\n\nexport var mapObject = function mapObject(fn, obj) {\n  return Object.keys(obj).reduce(function (res, key) {\n    return _objectSpread({}, res, _defineProperty({}, key, fn(key, obj[key])));\n  }, {});\n};\n/*\n * @description: add compatible prefix to style\n * object => object\n */\n\nexport var translateStyle = function translateStyle(style) {\n  return Object.keys(style).reduce(function (res, key) {\n    return _objectSpread({}, res, generatePrefixStyle(key, res[key]));\n  }, style);\n};\nexport var compose = function compose() {\n  for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n    args[_key2] = arguments[_key2];\n  }\n\n  if (!args.length) {\n    return identity;\n  }\n\n  var fns = args.reverse(); // first function can receive multiply arguments\n\n  var firstFn = fns[0];\n  var tailsFn = fns.slice(1);\n  return function () {\n    return tailsFn.reduce(function (res, fn) {\n      return fn(res);\n    }, firstFn.apply(void 0, arguments));\n  };\n};\nexport var getTransitionVal = function getTransitionVal(props, duration, easing) {\n  return props.map(function (prop) {\n    return \"\".concat(getDashCase(prop), \" \").concat(duration, \"ms \").concat(easing);\n  }).join(',');\n};\nvar isDev = process.env.NODE_ENV !== 'production';\nexport var warn = function warn(condition, format, a, b, c, d, e, f) {\n  if (isDev && typeof console !== 'undefined' && console.warn) {\n    if (format === undefined) {\n      console.warn('LogUtils requires an error message argument');\n    }\n\n    if (!condition) {\n      if (format === undefined) {\n        console.warn('Minified exception occurred; use the non-minified dev environment ' + 'for the full error message and additional helpful warnings.');\n      } else {\n        var args = [a, b, c, d, e, f];\n        var argIndex = 0;\n        console.warn(format.replace(/%s/g, function () {\n          return args[argIndex++];\n        }));\n      }\n    }\n  }\n};","\"use strict\";\n\nexports.__esModule = true;\nexports.default = void 0;\n\nvar PropTypes = _interopRequireWildcard(require(\"prop-types\"));\n\nvar _addClass = _interopRequireDefault(require(\"dom-helpers/class/addClass\"));\n\nvar _removeClass = _interopRequireDefault(require(\"dom-helpers/class/removeClass\"));\n\nvar _react = _interopRequireDefault(require(\"react\"));\n\nvar _Transition = _interopRequireDefault(require(\"./Transition\"));\n\nvar _PropTypes = require(\"./utils/PropTypes\");\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }\n\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar addClass = function addClass(node, classes) {\n  return node && classes && classes.split(' ').forEach(function (c) {\n    return (0, _addClass.default)(node, c);\n  });\n};\n\nvar removeClass = function removeClass(node, classes) {\n  return node && classes && classes.split(' ').forEach(function (c) {\n    return (0, _removeClass.default)(node, c);\n  });\n};\n/**\n * A transition component inspired by the excellent\n * [ng-animate](http://www.nganimate.org/) library, you should use it if you're\n * using CSS transitions or animations. It's built upon the\n * [`Transition`](https://reactcommunity.org/react-transition-group/transition)\n * component, so it inherits all of its props.\n *\n * `CSSTransition` applies a pair of class names during the `appear`, `enter`,\n * and `exit` states of the transition. The first class is applied and then a\n * second `*-active` class in order to activate the CSSS transition. After the\n * transition, matching `*-done` class names are applied to persist the\n * transition state.\n *\n * ```jsx\n * function App() {\n *   const [inProp, setInProp] = useState(false);\n *   return (\n *     <div>\n *       <CSSTransition in={inProp} timeout={200} classNames=\"my-node\">\n *         <div>\n *           {\"I'll receive my-node-* classes\"}\n *         </div>\n *       </CSSTransition>\n *       <button type=\"button\" onClick={() => setInProp(true)}>\n *         Click to Enter\n *       </button>\n *     </div>\n *   );\n * }\n * ```\n *\n * When the `in` prop is set to `true`, the child component will first receive\n * the class `example-enter`, then the `example-enter-active` will be added in\n * the next tick. `CSSTransition` [forces a\n * reflow](https://github.com/reactjs/react-transition-group/blob/5007303e729a74be66a21c3e2205e4916821524b/src/CSSTransition.js#L208-L215)\n * between before adding the `example-enter-active`. This is an important trick\n * because it allows us to transition between `example-enter` and\n * `example-enter-active` even though they were added immediately one after\n * another. Most notably, this is what makes it possible for us to animate\n * _appearance_.\n *\n * ```css\n * .my-node-enter {\n *   opacity: 0;\n * }\n * .my-node-enter-active {\n *   opacity: 1;\n *   transition: opacity 200ms;\n * }\n * .my-node-exit {\n *   opacity: 1;\n * }\n * .my-node-exit-active {\n *   opacity: 0;\n *   transition: opacity: 200ms;\n * }\n * ```\n *\n * `*-active` classes represent which styles you want to animate **to**.\n */\n\n\nvar CSSTransition =\n/*#__PURE__*/\nfunction (_React$Component) {\n  _inheritsLoose(CSSTransition, _React$Component);\n\n  function CSSTransition() {\n    var _this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    _this = _React$Component.call.apply(_React$Component, [this].concat(args)) || this;\n\n    _this.onEnter = function (node, appearing) {\n      var _this$getClassNames = _this.getClassNames(appearing ? 'appear' : 'enter'),\n          className = _this$getClassNames.className;\n\n      _this.removeClasses(node, 'exit');\n\n      addClass(node, className);\n\n      if (_this.props.onEnter) {\n        _this.props.onEnter(node, appearing);\n      }\n    };\n\n    _this.onEntering = function (node, appearing) {\n      var _this$getClassNames2 = _this.getClassNames(appearing ? 'appear' : 'enter'),\n          activeClassName = _this$getClassNames2.activeClassName;\n\n      _this.reflowAndAddClass(node, activeClassName);\n\n      if (_this.props.onEntering) {\n        _this.props.onEntering(node, appearing);\n      }\n    };\n\n    _this.onEntered = function (node, appearing) {\n      var appearClassName = _this.getClassNames('appear').doneClassName;\n\n      var enterClassName = _this.getClassNames('enter').doneClassName;\n\n      var doneClassName = appearing ? appearClassName + \" \" + enterClassName : enterClassName;\n\n      _this.removeClasses(node, appearing ? 'appear' : 'enter');\n\n      addClass(node, doneClassName);\n\n      if (_this.props.onEntered) {\n        _this.props.onEntered(node, appearing);\n      }\n    };\n\n    _this.onExit = function (node) {\n      var _this$getClassNames3 = _this.getClassNames('exit'),\n          className = _this$getClassNames3.className;\n\n      _this.removeClasses(node, 'appear');\n\n      _this.removeClasses(node, 'enter');\n\n      addClass(node, className);\n\n      if (_this.props.onExit) {\n        _this.props.onExit(node);\n      }\n    };\n\n    _this.onExiting = function (node) {\n      var _this$getClassNames4 = _this.getClassNames('exit'),\n          activeClassName = _this$getClassNames4.activeClassName;\n\n      _this.reflowAndAddClass(node, activeClassName);\n\n      if (_this.props.onExiting) {\n        _this.props.onExiting(node);\n      }\n    };\n\n    _this.onExited = function (node) {\n      var _this$getClassNames5 = _this.getClassNames('exit'),\n          doneClassName = _this$getClassNames5.doneClassName;\n\n      _this.removeClasses(node, 'exit');\n\n      addClass(node, doneClassName);\n\n      if (_this.props.onExited) {\n        _this.props.onExited(node);\n      }\n    };\n\n    _this.getClassNames = function (type) {\n      var classNames = _this.props.classNames;\n      var isStringClassNames = typeof classNames === 'string';\n      var prefix = isStringClassNames && classNames ? classNames + '-' : '';\n      var className = isStringClassNames ? prefix + type : classNames[type];\n      var activeClassName = isStringClassNames ? className + '-active' : classNames[type + 'Active'];\n      var doneClassName = isStringClassNames ? className + '-done' : classNames[type + 'Done'];\n      return {\n        className: className,\n        activeClassName: activeClassName,\n        doneClassName: doneClassName\n      };\n    };\n\n    return _this;\n  }\n\n  var _proto = CSSTransition.prototype;\n\n  _proto.removeClasses = function removeClasses(node, type) {\n    var _this$getClassNames6 = this.getClassNames(type),\n        className = _this$getClassNames6.className,\n        activeClassName = _this$getClassNames6.activeClassName,\n        doneClassName = _this$getClassNames6.doneClassName;\n\n    className && removeClass(node, className);\n    activeClassName && removeClass(node, activeClassName);\n    doneClassName && removeClass(node, doneClassName);\n  };\n\n  _proto.reflowAndAddClass = function reflowAndAddClass(node, className) {\n    // This is for to force a repaint,\n    // which is necessary in order to transition styles when adding a class name.\n    if (className) {\n      /* eslint-disable no-unused-expressions */\n      node && node.scrollTop;\n      /* eslint-enable no-unused-expressions */\n\n      addClass(node, className);\n    }\n  };\n\n  _proto.render = function render() {\n    var props = _extends({}, this.props);\n\n    delete props.classNames;\n    return _react.default.createElement(_Transition.default, _extends({}, props, {\n      onEnter: this.onEnter,\n      onEntered: this.onEntered,\n      onEntering: this.onEntering,\n      onExit: this.onExit,\n      onExiting: this.onExiting,\n      onExited: this.onExited\n    }));\n  };\n\n  return CSSTransition;\n}(_react.default.Component);\n\nCSSTransition.defaultProps = {\n  classNames: ''\n};\nCSSTransition.propTypes = process.env.NODE_ENV !== \"production\" ? _extends({}, _Transition.default.propTypes, {\n  /**\n   * The animation classNames applied to the component as it enters, exits or\n   * has finished the transition. A single name can be provided and it will be\n   * suffixed for each stage: e.g.\n   *\n   * `classNames=\"fade\"` applies `fade-enter`, `fade-enter-active`,\n   * `fade-enter-done`, `fade-exit`, `fade-exit-active`, `fade-exit-done`,\n   * `fade-appear`, `fade-appear-active`, and `fade-appear-done`.\n   *\n   * **Note**: `fade-appear-done` and `fade-enter-done` will _both_ be applied.\n   * This allows you to define different behavior for when appearing is done and\n   * when regular entering is done, using selectors like\n   * `.fade-enter-done:not(.fade-appear-done)`. For example, you could apply an\n   * epic entrance animation when element first appears in the DOM using\n   * [Animate.css](https://daneden.github.io/animate.css/). Otherwise you can\n   * simply use `fade-enter-done` for defining both cases.\n   *\n   * Each individual classNames can also be specified independently like:\n   *\n   * ```js\n   * classNames={{\n   *  appear: 'my-appear',\n   *  appearActive: 'my-active-appear',\n   *  appearDone: 'my-done-appear',\n   *  enter: 'my-enter',\n   *  enterActive: 'my-active-enter',\n   *  enterDone: 'my-done-enter',\n   *  exit: 'my-exit',\n   *  exitActive: 'my-active-exit',\n   *  exitDone: 'my-done-exit',\n   * }}\n   * ```\n   *\n   * If you want to set these classes using CSS Modules:\n   *\n   * ```js\n   * import styles from './styles.css';\n   * ```\n   *\n   * you might want to use camelCase in your CSS file, that way could simply\n   * spread them instead of listing them one by one:\n   *\n   * ```js\n   * classNames={{ ...styles }}\n   * ```\n   *\n   * @type {string | {\n   *  appear?: string,\n   *  appearActive?: string,\n   *  appearDone?: string,\n   *  enter?: string,\n   *  enterActive?: string,\n   *  enterDone?: string,\n   *  exit?: string,\n   *  exitActive?: string,\n   *  exitDone?: string,\n   * }}\n   */\n  classNames: _PropTypes.classNamesShape,\n\n  /**\n   * A `<Transition>` callback fired immediately after the 'enter' or 'appear' class is\n   * applied.\n   *\n   * @type Function(node: HtmlElement, isAppearing: bool)\n   */\n  onEnter: PropTypes.func,\n\n  /**\n   * A `<Transition>` callback fired immediately after the 'enter-active' or\n   * 'appear-active' class is applied.\n   *\n   * @type Function(node: HtmlElement, isAppearing: bool)\n   */\n  onEntering: PropTypes.func,\n\n  /**\n   * A `<Transition>` callback fired immediately after the 'enter' or\n   * 'appear' classes are **removed** and the `done` class is added to the DOM node.\n   *\n   * @type Function(node: HtmlElement, isAppearing: bool)\n   */\n  onEntered: PropTypes.func,\n\n  /**\n   * A `<Transition>` callback fired immediately after the 'exit' class is\n   * applied.\n   *\n   * @type Function(node: HtmlElement)\n   */\n  onExit: PropTypes.func,\n\n  /**\n   * A `<Transition>` callback fired immediately after the 'exit-active' is applied.\n   *\n   * @type Function(node: HtmlElement)\n   */\n  onExiting: PropTypes.func,\n\n  /**\n   * A `<Transition>` callback fired immediately after the 'exit' classes\n   * are **removed** and the `exit-done` class is added to the DOM node.\n   *\n   * @type Function(node: HtmlElement)\n   */\n  onExited: PropTypes.func\n}) : {};\nvar _default = CSSTransition;\nexports.default = _default;\nmodule.exports = exports[\"default\"];","\"use strict\";\n\nexports.__esModule = true;\nexports.default = void 0;\n\nvar _propTypes = _interopRequireDefault(require(\"prop-types\"));\n\nvar _react = _interopRequireDefault(require(\"react\"));\n\nvar _reactDom = require(\"react-dom\");\n\nvar _TransitionGroup = _interopRequireDefault(require(\"./TransitionGroup\"));\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\n/**\n * The `<ReplaceTransition>` component is a specialized `Transition` component\n * that animates between two children.\n *\n * ```jsx\n * <ReplaceTransition in>\n *   <Fade><div>I appear first</div></Fade>\n *   <Fade><div>I replace the above</div></Fade>\n * </ReplaceTransition>\n * ```\n */\nvar ReplaceTransition =\n/*#__PURE__*/\nfunction (_React$Component) {\n  _inheritsLoose(ReplaceTransition, _React$Component);\n\n  function ReplaceTransition() {\n    var _this;\n\n    for (var _len = arguments.length, _args = new Array(_len), _key = 0; _key < _len; _key++) {\n      _args[_key] = arguments[_key];\n    }\n\n    _this = _React$Component.call.apply(_React$Component, [this].concat(_args)) || this;\n\n    _this.handleEnter = function () {\n      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n        args[_key2] = arguments[_key2];\n      }\n\n      return _this.handleLifecycle('onEnter', 0, args);\n    };\n\n    _this.handleEntering = function () {\n      for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n        args[_key3] = arguments[_key3];\n      }\n\n      return _this.handleLifecycle('onEntering', 0, args);\n    };\n\n    _this.handleEntered = function () {\n      for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {\n        args[_key4] = arguments[_key4];\n      }\n\n      return _this.handleLifecycle('onEntered', 0, args);\n    };\n\n    _this.handleExit = function () {\n      for (var _len5 = arguments.length, args = new Array(_len5), _key5 = 0; _key5 < _len5; _key5++) {\n        args[_key5] = arguments[_key5];\n      }\n\n      return _this.handleLifecycle('onExit', 1, args);\n    };\n\n    _this.handleExiting = function () {\n      for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n        args[_key6] = arguments[_key6];\n      }\n\n      return _this.handleLifecycle('onExiting', 1, args);\n    };\n\n    _this.handleExited = function () {\n      for (var _len7 = arguments.length, args = new Array(_len7), _key7 = 0; _key7 < _len7; _key7++) {\n        args[_key7] = arguments[_key7];\n      }\n\n      return _this.handleLifecycle('onExited', 1, args);\n    };\n\n    return _this;\n  }\n\n  var _proto = ReplaceTransition.prototype;\n\n  _proto.handleLifecycle = function handleLifecycle(handler, idx, originalArgs) {\n    var _child$props;\n\n    var children = this.props.children;\n\n    var child = _react.default.Children.toArray(children)[idx];\n\n    if (child.props[handler]) (_child$props = child.props)[handler].apply(_child$props, originalArgs);\n    if (this.props[handler]) this.props[handler]((0, _reactDom.findDOMNode)(this));\n  };\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        children = _this$props.children,\n        inProp = _this$props.in,\n        props = _objectWithoutPropertiesLoose(_this$props, [\"children\", \"in\"]);\n\n    var _React$Children$toArr = _react.default.Children.toArray(children),\n        first = _React$Children$toArr[0],\n        second = _React$Children$toArr[1];\n\n    delete props.onEnter;\n    delete props.onEntering;\n    delete props.onEntered;\n    delete props.onExit;\n    delete props.onExiting;\n    delete props.onExited;\n    return _react.default.createElement(_TransitionGroup.default, props, inProp ? _react.default.cloneElement(first, {\n      key: 'first',\n      onEnter: this.handleEnter,\n      onEntering: this.handleEntering,\n      onEntered: this.handleEntered\n    }) : _react.default.cloneElement(second, {\n      key: 'second',\n      onEnter: this.handleExit,\n      onEntering: this.handleExiting,\n      onEntered: this.handleExited\n    }));\n  };\n\n  return ReplaceTransition;\n}(_react.default.Component);\n\nReplaceTransition.propTypes = process.env.NODE_ENV !== \"production\" ? {\n  in: _propTypes.default.bool.isRequired,\n  children: function children(props, propName) {\n    if (_react.default.Children.count(props[propName]) !== 2) return new Error(\"\\\"\" + propName + \"\\\" must be exactly two transition components.\");\n    return null;\n  }\n} : {};\nvar _default = ReplaceTransition;\nexports.default = _default;\nmodule.exports = exports[\"default\"];","\"use strict\";\n\nexports.__esModule = true;\nexports.default = exports.EXITING = exports.ENTERED = exports.ENTERING = exports.EXITED = exports.UNMOUNTED = void 0;\n\nvar PropTypes = _interopRequireWildcard(require(\"prop-types\"));\n\nvar _react = _interopRequireDefault(require(\"react\"));\n\nvar _reactDom = _interopRequireDefault(require(\"react-dom\"));\n\nvar _reactLifecyclesCompat = require(\"react-lifecycles-compat\");\n\nvar _PropTypes = require(\"./utils/PropTypes\");\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar UNMOUNTED = 'unmounted';\nexports.UNMOUNTED = UNMOUNTED;\nvar EXITED = 'exited';\nexports.EXITED = EXITED;\nvar ENTERING = 'entering';\nexports.ENTERING = ENTERING;\nvar ENTERED = 'entered';\nexports.ENTERED = ENTERED;\nvar EXITING = 'exiting';\n/**\n * The Transition component lets you describe a transition from one component\n * state to another _over time_ with a simple declarative API. Most commonly\n * it's used to animate the mounting and unmounting of a component, but can also\n * be used to describe in-place transition states as well.\n *\n * ---\n *\n * **Note**: `Transition` is a platform-agnostic base component. If you're using\n * transitions in CSS, you'll probably want to use\n * [`CSSTransition`](https://reactcommunity.org/react-transition-group/css-transition)\n * instead. It inherits all the features of `Transition`, but contains\n * additional features necessary to play nice with CSS transitions (hence the\n * name of the component).\n *\n * ---\n *\n * By default the `Transition` component does not alter the behavior of the\n * component it renders, it only tracks \"enter\" and \"exit\" states for the\n * components. It's up to you to give meaning and effect to those states. For\n * example we can add styles to a component when it enters or exits:\n *\n * ```jsx\n * import { Transition } from 'react-transition-group';\n *\n * const duration = 300;\n *\n * const defaultStyle = {\n *   transition: `opacity ${duration}ms ease-in-out`,\n *   opacity: 0,\n * }\n *\n * const transitionStyles = {\n *   entering: { opacity: 0 },\n *   entered:  { opacity: 1 },\n * };\n *\n * const Fade = ({ in: inProp }) => (\n *   <Transition in={inProp} timeout={duration}>\n *     {state => (\n *       <div style={{\n *         ...defaultStyle,\n *         ...transitionStyles[state]\n *       }}>\n *         I'm a fade Transition!\n *       </div>\n *     )}\n *   </Transition>\n * );\n * ```\n *\n * There are 4 main states a Transition can be in:\n *  - `'entering'`\n *  - `'entered'`\n *  - `'exiting'`\n *  - `'exited'`\n *\n * Transition state is toggled via the `in` prop. When `true` the component\n * begins the \"Enter\" stage. During this stage, the component will shift from\n * its current transition state, to `'entering'` for the duration of the\n * transition and then to the `'entered'` stage once it's complete. Let's take\n * the following example (we'll use the\n * [useState](https://reactjs.org/docs/hooks-reference.html#usestate) hook):\n *\n * ```jsx\n * function App() {\n *   const [inProp, setInProp] = useState(false);\n *   return (\n *     <div>\n *       <Transition in={inProp} timeout={500}>\n *         {state => (\n *           // ...\n *         )}\n *       </Transition>\n *       <button onClick={() => setInProp(true)}>\n *         Click to Enter\n *       </button>\n *     </div>\n *   );\n * }\n * ```\n *\n * When the button is clicked the component will shift to the `'entering'` state\n * and stay there for 500ms (the value of `timeout`) before it finally switches\n * to `'entered'`.\n *\n * When `in` is `false` the same thing happens except the state moves from\n * `'exiting'` to `'exited'`.\n */\n\nexports.EXITING = EXITING;\n\nvar Transition =\n/*#__PURE__*/\nfunction (_React$Component) {\n  _inheritsLoose(Transition, _React$Component);\n\n  function Transition(props, context) {\n    var _this;\n\n    _this = _React$Component.call(this, props, context) || this;\n    var parentGroup = context.transitionGroup; // In the context of a TransitionGroup all enters are really appears\n\n    var appear = parentGroup && !parentGroup.isMounting ? props.enter : props.appear;\n    var initialStatus;\n    _this.appearStatus = null;\n\n    if (props.in) {\n      if (appear) {\n        initialStatus = EXITED;\n        _this.appearStatus = ENTERING;\n      } else {\n        initialStatus = ENTERED;\n      }\n    } else {\n      if (props.unmountOnExit || props.mountOnEnter) {\n        initialStatus = UNMOUNTED;\n      } else {\n        initialStatus = EXITED;\n      }\n    }\n\n    _this.state = {\n      status: initialStatus\n    };\n    _this.nextCallback = null;\n    return _this;\n  }\n\n  var _proto = Transition.prototype;\n\n  _proto.getChildContext = function getChildContext() {\n    return {\n      transitionGroup: null // allows for nested Transitions\n\n    };\n  };\n\n  Transition.getDerivedStateFromProps = function getDerivedStateFromProps(_ref, prevState) {\n    var nextIn = _ref.in;\n\n    if (nextIn && prevState.status === UNMOUNTED) {\n      return {\n        status: EXITED\n      };\n    }\n\n    return null;\n  }; // getSnapshotBeforeUpdate(prevProps) {\n  //   let nextStatus = null\n  //   if (prevProps !== this.props) {\n  //     const { status } = this.state\n  //     if (this.props.in) {\n  //       if (status !== ENTERING && status !== ENTERED) {\n  //         nextStatus = ENTERING\n  //       }\n  //     } else {\n  //       if (status === ENTERING || status === ENTERED) {\n  //         nextStatus = EXITING\n  //       }\n  //     }\n  //   }\n  //   return { nextStatus }\n  // }\n\n\n  _proto.componentDidMount = function componentDidMount() {\n    this.updateStatus(true, this.appearStatus);\n  };\n\n  _proto.componentDidUpdate = function componentDidUpdate(prevProps) {\n    var nextStatus = null;\n\n    if (prevProps !== this.props) {\n      var status = this.state.status;\n\n      if (this.props.in) {\n        if (status !== ENTERING && status !== ENTERED) {\n          nextStatus = ENTERING;\n        }\n      } else {\n        if (status === ENTERING || status === ENTERED) {\n          nextStatus = EXITING;\n        }\n      }\n    }\n\n    this.updateStatus(false, nextStatus);\n  };\n\n  _proto.componentWillUnmount = function componentWillUnmount() {\n    this.cancelNextCallback();\n  };\n\n  _proto.getTimeouts = function getTimeouts() {\n    var timeout = this.props.timeout;\n    var exit, enter, appear;\n    exit = enter = appear = timeout;\n\n    if (timeout != null && typeof timeout !== 'number') {\n      exit = timeout.exit;\n      enter = timeout.enter; // TODO: remove fallback for next major\n\n      appear = timeout.appear !== undefined ? timeout.appear : enter;\n    }\n\n    return {\n      exit: exit,\n      enter: enter,\n      appear: appear\n    };\n  };\n\n  _proto.updateStatus = function updateStatus(mounting, nextStatus) {\n    if (mounting === void 0) {\n      mounting = false;\n    }\n\n    if (nextStatus !== null) {\n      // nextStatus will always be ENTERING or EXITING.\n      this.cancelNextCallback();\n\n      var node = _reactDom.default.findDOMNode(this);\n\n      if (nextStatus === ENTERING) {\n        this.performEnter(node, mounting);\n      } else {\n        this.performExit(node);\n      }\n    } else if (this.props.unmountOnExit && this.state.status === EXITED) {\n      this.setState({\n        status: UNMOUNTED\n      });\n    }\n  };\n\n  _proto.performEnter = function performEnter(node, mounting) {\n    var _this2 = this;\n\n    var enter = this.props.enter;\n    var appearing = this.context.transitionGroup ? this.context.transitionGroup.isMounting : mounting;\n    var timeouts = this.getTimeouts();\n    var enterTimeout = appearing ? timeouts.appear : timeouts.enter; // no enter animation skip right to ENTERED\n    // if we are mounting and running this it means appear _must_ be set\n\n    if (!mounting && !enter) {\n      this.safeSetState({\n        status: ENTERED\n      }, function () {\n        _this2.props.onEntered(node);\n      });\n      return;\n    }\n\n    this.props.onEnter(node, appearing);\n    this.safeSetState({\n      status: ENTERING\n    }, function () {\n      _this2.props.onEntering(node, appearing);\n\n      _this2.onTransitionEnd(node, enterTimeout, function () {\n        _this2.safeSetState({\n          status: ENTERED\n        }, function () {\n          _this2.props.onEntered(node, appearing);\n        });\n      });\n    });\n  };\n\n  _proto.performExit = function performExit(node) {\n    var _this3 = this;\n\n    var exit = this.props.exit;\n    var timeouts = this.getTimeouts(); // no exit animation skip right to EXITED\n\n    if (!exit) {\n      this.safeSetState({\n        status: EXITED\n      }, function () {\n        _this3.props.onExited(node);\n      });\n      return;\n    }\n\n    this.props.onExit(node);\n    this.safeSetState({\n      status: EXITING\n    }, function () {\n      _this3.props.onExiting(node);\n\n      _this3.onTransitionEnd(node, timeouts.exit, function () {\n        _this3.safeSetState({\n          status: EXITED\n        }, function () {\n          _this3.props.onExited(node);\n        });\n      });\n    });\n  };\n\n  _proto.cancelNextCallback = function cancelNextCallback() {\n    if (this.nextCallback !== null) {\n      this.nextCallback.cancel();\n      this.nextCallback = null;\n    }\n  };\n\n  _proto.safeSetState = function safeSetState(nextState, callback) {\n    // This shouldn't be necessary, but there are weird race conditions with\n    // setState callbacks and unmounting in testing, so always make sure that\n    // we can cancel any pending setState callbacks after we unmount.\n    callback = this.setNextCallback(callback);\n    this.setState(nextState, callback);\n  };\n\n  _proto.setNextCallback = function setNextCallback(callback) {\n    var _this4 = this;\n\n    var active = true;\n\n    this.nextCallback = function (event) {\n      if (active) {\n        active = false;\n        _this4.nextCallback = null;\n        callback(event);\n      }\n    };\n\n    this.nextCallback.cancel = function () {\n      active = false;\n    };\n\n    return this.nextCallback;\n  };\n\n  _proto.onTransitionEnd = function onTransitionEnd(node, timeout, handler) {\n    this.setNextCallback(handler);\n    var doesNotHaveTimeoutOrListener = timeout == null && !this.props.addEndListener;\n\n    if (!node || doesNotHaveTimeoutOrListener) {\n      setTimeout(this.nextCallback, 0);\n      return;\n    }\n\n    if (this.props.addEndListener) {\n      this.props.addEndListener(node, this.nextCallback);\n    }\n\n    if (timeout != null) {\n      setTimeout(this.nextCallback, timeout);\n    }\n  };\n\n  _proto.render = function render() {\n    var status = this.state.status;\n\n    if (status === UNMOUNTED) {\n      return null;\n    }\n\n    var _this$props = this.props,\n        children = _this$props.children,\n        childProps = _objectWithoutPropertiesLoose(_this$props, [\"children\"]); // filter props for Transtition\n\n\n    delete childProps.in;\n    delete childProps.mountOnEnter;\n    delete childProps.unmountOnExit;\n    delete childProps.appear;\n    delete childProps.enter;\n    delete childProps.exit;\n    delete childProps.timeout;\n    delete childProps.addEndListener;\n    delete childProps.onEnter;\n    delete childProps.onEntering;\n    delete childProps.onEntered;\n    delete childProps.onExit;\n    delete childProps.onExiting;\n    delete childProps.onExited;\n\n    if (typeof children === 'function') {\n      return children(status, childProps);\n    }\n\n    var child = _react.default.Children.only(children);\n\n    return _react.default.cloneElement(child, childProps);\n  };\n\n  return Transition;\n}(_react.default.Component);\n\nTransition.contextTypes = {\n  transitionGroup: PropTypes.object\n};\nTransition.childContextTypes = {\n  transitionGroup: function transitionGroup() {}\n};\nTransition.propTypes = process.env.NODE_ENV !== \"production\" ? {\n  /**\n   * A `function` child can be used instead of a React element. This function is\n   * called with the current transition status (`'entering'`, `'entered'`,\n   * `'exiting'`, `'exited'`, `'unmounted'`), which can be used to apply context\n   * specific props to a component.\n   *\n   * ```jsx\n   * <Transition in={this.state.in} timeout={150}>\n   *   {state => (\n   *     <MyComponent className={`fade fade-${state}`} />\n   *   )}\n   * </Transition>\n   * ```\n   */\n  children: PropTypes.oneOfType([PropTypes.func.isRequired, PropTypes.element.isRequired]).isRequired,\n\n  /**\n   * Show the component; triggers the enter or exit states\n   */\n  in: PropTypes.bool,\n\n  /**\n   * By default the child component is mounted immediately along with\n   * the parent `Transition` component. If you want to \"lazy mount\" the component on the\n   * first `in={true}` you can set `mountOnEnter`. After the first enter transition the component will stay\n   * mounted, even on \"exited\", unless you also specify `unmountOnExit`.\n   */\n  mountOnEnter: PropTypes.bool,\n\n  /**\n   * By default the child component stays mounted after it reaches the `'exited'` state.\n   * Set `unmountOnExit` if you'd prefer to unmount the component after it finishes exiting.\n   */\n  unmountOnExit: PropTypes.bool,\n\n  /**\n   * Normally a component is not transitioned if it is shown when the `<Transition>` component mounts.\n   * If you want to transition on the first mount set `appear` to `true`, and the\n   * component will transition in as soon as the `<Transition>` mounts.\n   *\n   * > Note: there are no specific \"appear\" states. `appear` only adds an additional `enter` transition.\n   */\n  appear: PropTypes.bool,\n\n  /**\n   * Enable or disable enter transitions.\n   */\n  enter: PropTypes.bool,\n\n  /**\n   * Enable or disable exit transitions.\n   */\n  exit: PropTypes.bool,\n\n  /**\n   * The duration of the transition, in milliseconds.\n   * Required unless `addEndListener` is provided.\n   *\n   * You may specify a single timeout for all transitions:\n   *\n   * ```jsx\n   * timeout={500}\n   * ```\n   *\n   * or individually:\n   *\n   * ```jsx\n   * timeout={{\n   *  appear: 500,\n   *  enter: 300,\n   *  exit: 500,\n   * }}\n   * ```\n   *\n   * - `appear` defaults to the value of `enter`\n   * - `enter` defaults to `0`\n   * - `exit` defaults to `0`\n   *\n   * @type {number | { enter?: number, exit?: number, appear?: number }}\n   */\n  timeout: function timeout(props) {\n    var pt = _PropTypes.timeoutsShape;\n    if (!props.addEndListener) pt = pt.isRequired;\n\n    for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n      args[_key - 1] = arguments[_key];\n    }\n\n    return pt.apply(void 0, [props].concat(args));\n  },\n\n  /**\n   * Add a custom transition end trigger. Called with the transitioning\n   * DOM node and a `done` callback. Allows for more fine grained transition end\n   * logic. **Note:** Timeouts are still used as a fallback if provided.\n   *\n   * ```jsx\n   * addEndListener={(node, done) => {\n   *   // use the css transitionend event to mark the finish of a transition\n   *   node.addEventListener('transitionend', done, false);\n   * }}\n   * ```\n   */\n  addEndListener: PropTypes.func,\n\n  /**\n   * Callback fired before the \"entering\" status is applied. An extra parameter\n   * `isAppearing` is supplied to indicate if the enter stage is occurring on the initial mount\n   *\n   * @type Function(node: HtmlElement, isAppearing: bool) -> void\n   */\n  onEnter: PropTypes.func,\n\n  /**\n   * Callback fired after the \"entering\" status is applied. An extra parameter\n   * `isAppearing` is supplied to indicate if the enter stage is occurring on the initial mount\n   *\n   * @type Function(node: HtmlElement, isAppearing: bool)\n   */\n  onEntering: PropTypes.func,\n\n  /**\n   * Callback fired after the \"entered\" status is applied. An extra parameter\n   * `isAppearing` is supplied to indicate if the enter stage is occurring on the initial mount\n   *\n   * @type Function(node: HtmlElement, isAppearing: bool) -> void\n   */\n  onEntered: PropTypes.func,\n\n  /**\n   * Callback fired before the \"exiting\" status is applied.\n   *\n   * @type Function(node: HtmlElement) -> void\n   */\n  onExit: PropTypes.func,\n\n  /**\n   * Callback fired after the \"exiting\" status is applied.\n   *\n   * @type Function(node: HtmlElement) -> void\n   */\n  onExiting: PropTypes.func,\n\n  /**\n   * Callback fired after the \"exited\" status is applied.\n   *\n   * @type Function(node: HtmlElement) -> void\n   */\n  onExited: PropTypes.func // Name the function so it is clearer in the documentation\n\n} : {};\n\nfunction noop() {}\n\nTransition.defaultProps = {\n  in: false,\n  mountOnEnter: false,\n  unmountOnExit: false,\n  appear: false,\n  enter: true,\n  exit: true,\n  onEnter: noop,\n  onEntering: noop,\n  onEntered: noop,\n  onExit: noop,\n  onExiting: noop,\n  onExited: noop\n};\nTransition.UNMOUNTED = 0;\nTransition.EXITED = 1;\nTransition.ENTERING = 2;\nTransition.ENTERED = 3;\nTransition.EXITING = 4;\n\nvar _default = (0, _reactLifecyclesCompat.polyfill)(Transition);\n\nexports.default = _default;","\"use strict\";\n\nexports.__esModule = true;\nexports.default = void 0;\n\nvar _propTypes = _interopRequireDefault(require(\"prop-types\"));\n\nvar _react = _interopRequireDefault(require(\"react\"));\n\nvar _reactLifecyclesCompat = require(\"react-lifecycles-compat\");\n\nvar _ChildMapping = require(\"./utils/ChildMapping\");\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }\n\nfunction _extends() { _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nvar values = Object.values || function (obj) {\n  return Object.keys(obj).map(function (k) {\n    return obj[k];\n  });\n};\n\nvar defaultProps = {\n  component: 'div',\n  childFactory: function childFactory(child) {\n    return child;\n  }\n  /**\n   * The `<TransitionGroup>` component manages a set of transition components\n   * (`<Transition>` and `<CSSTransition>`) in a list. Like with the transition\n   * components, `<TransitionGroup>` is a state machine for managing the mounting\n   * and unmounting of components over time.\n   *\n   * Consider the example below. As items are removed or added to the TodoList the\n   * `in` prop is toggled automatically by the `<TransitionGroup>`.\n   *\n   * Note that `<TransitionGroup>`  does not define any animation behavior!\n   * Exactly _how_ a list item animates is up to the individual transition\n   * component. This means you can mix and match animations across different list\n   * items.\n   */\n\n};\n\nvar TransitionGroup =\n/*#__PURE__*/\nfunction (_React$Component) {\n  _inheritsLoose(TransitionGroup, _React$Component);\n\n  function TransitionGroup(props, context) {\n    var _this;\n\n    _this = _React$Component.call(this, props, context) || this;\n\n    var handleExited = _this.handleExited.bind(_assertThisInitialized(_assertThisInitialized(_this))); // Initial children should all be entering, dependent on appear\n\n\n    _this.state = {\n      handleExited: handleExited,\n      firstRender: true\n    };\n    return _this;\n  }\n\n  var _proto = TransitionGroup.prototype;\n\n  _proto.getChildContext = function getChildContext() {\n    return {\n      transitionGroup: {\n        isMounting: !this.appeared\n      }\n    };\n  };\n\n  _proto.componentDidMount = function componentDidMount() {\n    this.appeared = true;\n    this.mounted = true;\n  };\n\n  _proto.componentWillUnmount = function componentWillUnmount() {\n    this.mounted = false;\n  };\n\n  TransitionGroup.getDerivedStateFromProps = function getDerivedStateFromProps(nextProps, _ref) {\n    var prevChildMapping = _ref.children,\n        handleExited = _ref.handleExited,\n        firstRender = _ref.firstRender;\n    return {\n      children: firstRender ? (0, _ChildMapping.getInitialChildMapping)(nextProps, handleExited) : (0, _ChildMapping.getNextChildMapping)(nextProps, prevChildMapping, handleExited),\n      firstRender: false\n    };\n  };\n\n  _proto.handleExited = function handleExited(child, node) {\n    var currentChildMapping = (0, _ChildMapping.getChildMapping)(this.props.children);\n    if (child.key in currentChildMapping) return;\n\n    if (child.props.onExited) {\n      child.props.onExited(node);\n    }\n\n    if (this.mounted) {\n      this.setState(function (state) {\n        var children = _extends({}, state.children);\n\n        delete children[child.key];\n        return {\n          children: children\n        };\n      });\n    }\n  };\n\n  _proto.render = function render() {\n    var _this$props = this.props,\n        Component = _this$props.component,\n        childFactory = _this$props.childFactory,\n        props = _objectWithoutPropertiesLoose(_this$props, [\"component\", \"childFactory\"]);\n\n    var children = values(this.state.children).map(childFactory);\n    delete props.appear;\n    delete props.enter;\n    delete props.exit;\n\n    if (Component === null) {\n      return children;\n    }\n\n    return _react.default.createElement(Component, props, children);\n  };\n\n  return TransitionGroup;\n}(_react.default.Component);\n\nTransitionGroup.childContextTypes = {\n  transitionGroup: _propTypes.default.object.isRequired\n};\nTransitionGroup.propTypes = process.env.NODE_ENV !== \"production\" ? {\n  /**\n   * `<TransitionGroup>` renders a `<div>` by default. You can change this\n   * behavior by providing a `component` prop.\n   * If you use React v16+ and would like to avoid a wrapping `<div>` element\n   * you can pass in `component={null}`. This is useful if the wrapping div\n   * borks your css styles.\n   */\n  component: _propTypes.default.any,\n\n  /**\n   * A set of `<Transition>` components, that are toggled `in` and out as they\n   * leave. the `<TransitionGroup>` will inject specific transition props, so\n   * remember to spread them through if you are wrapping the `<Transition>` as\n   * with our `<Fade>` example.\n   *\n   * While this component is meant for multiple `Transition` or `CSSTransition`\n   * children, sometimes you may want to have a single transition child with\n   * content that you want to be transitioned out and in when you change it\n   * (e.g. routes, images etc.) In that case you can change the `key` prop of\n   * the transition child as you change its content, this will cause\n   * `TransitionGroup` to transition the child out and back in.\n   */\n  children: _propTypes.default.node,\n\n  /**\n   * A convenience prop that enables or disables appear animations\n   * for all children. Note that specifying this will override any defaults set\n   * on individual children Transitions.\n   */\n  appear: _propTypes.default.bool,\n\n  /**\n   * A convenience prop that enables or disables enter animations\n   * for all children. Note that specifying this will override any defaults set\n   * on individual children Transitions.\n   */\n  enter: _propTypes.default.bool,\n\n  /**\n   * A convenience prop that enables or disables exit animations\n   * for all children. Note that specifying this will override any defaults set\n   * on individual children Transitions.\n   */\n  exit: _propTypes.default.bool,\n\n  /**\n   * You may need to apply reactive updates to a child as it is exiting.\n   * This is generally done by using `cloneElement` however in the case of an exiting\n   * child the element has already been removed and not accessible to the consumer.\n   *\n   * If you do need to update a child as it leaves you can provide a `childFactory`\n   * to wrap every child, even the ones that are leaving.\n   *\n   * @type Function(child: ReactElement) -> ReactElement\n   */\n  childFactory: _propTypes.default.func\n} : {};\nTransitionGroup.defaultProps = defaultProps;\n\nvar _default = (0, _reactLifecyclesCompat.polyfill)(TransitionGroup);\n\nexports.default = _default;\nmodule.exports = exports[\"default\"];","\"use strict\";\n\nvar _CSSTransition = _interopRequireDefault(require(\"./CSSTransition\"));\n\nvar _ReplaceTransition = _interopRequireDefault(require(\"./ReplaceTransition\"));\n\nvar _TransitionGroup = _interopRequireDefault(require(\"./TransitionGroup\"));\n\nvar _Transition = _interopRequireDefault(require(\"./Transition\"));\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nmodule.exports = {\n  Transition: _Transition.default,\n  TransitionGroup: _TransitionGroup.default,\n  ReplaceTransition: _ReplaceTransition.default,\n  CSSTransition: _CSSTransition.default\n};","\"use strict\";\n\nexports.__esModule = true;\nexports.getChildMapping = getChildMapping;\nexports.mergeChildMappings = mergeChildMappings;\nexports.getInitialChildMapping = getInitialChildMapping;\nexports.getNextChildMapping = getNextChildMapping;\n\nvar _react = require(\"react\");\n\n/**\n * Given `this.props.children`, return an object mapping key to child.\n *\n * @param {*} children `this.props.children`\n * @return {object} Mapping of key to child\n */\nfunction getChildMapping(children, mapFn) {\n  var mapper = function mapper(child) {\n    return mapFn && (0, _react.isValidElement)(child) ? mapFn(child) : child;\n  };\n\n  var result = Object.create(null);\n  if (children) _react.Children.map(children, function (c) {\n    return c;\n  }).forEach(function (child) {\n    // run the map function here instead so that the key is the computed one\n    result[child.key] = mapper(child);\n  });\n  return result;\n}\n/**\n * When you're adding or removing children some may be added or removed in the\n * same render pass. We want to show *both* since we want to simultaneously\n * animate elements in and out. This function takes a previous set of keys\n * and a new set of keys and merges them with its best guess of the correct\n * ordering. In the future we may expose some of the utilities in\n * ReactMultiChild to make this easy, but for now React itself does not\n * directly have this concept of the union of prevChildren and nextChildren\n * so we implement it here.\n *\n * @param {object} prev prev children as returned from\n * `ReactTransitionChildMapping.getChildMapping()`.\n * @param {object} next next children as returned from\n * `ReactTransitionChildMapping.getChildMapping()`.\n * @return {object} a key set that contains all keys in `prev` and all keys\n * in `next` in a reasonable order.\n */\n\n\nfunction mergeChildMappings(prev, next) {\n  prev = prev || {};\n  next = next || {};\n\n  function getValueForKey(key) {\n    return key in next ? next[key] : prev[key];\n  } // For each key of `next`, the list of keys to insert before that key in\n  // the combined list\n\n\n  var nextKeysPending = Object.create(null);\n  var pendingKeys = [];\n\n  for (var prevKey in prev) {\n    if (prevKey in next) {\n      if (pendingKeys.length) {\n        nextKeysPending[prevKey] = pendingKeys;\n        pendingKeys = [];\n      }\n    } else {\n      pendingKeys.push(prevKey);\n    }\n  }\n\n  var i;\n  var childMapping = {};\n\n  for (var nextKey in next) {\n    if (nextKeysPending[nextKey]) {\n      for (i = 0; i < nextKeysPending[nextKey].length; i++) {\n        var pendingNextKey = nextKeysPending[nextKey][i];\n        childMapping[nextKeysPending[nextKey][i]] = getValueForKey(pendingNextKey);\n      }\n    }\n\n    childMapping[nextKey] = getValueForKey(nextKey);\n  } // Finally, add the keys which didn't appear before any key in `next`\n\n\n  for (i = 0; i < pendingKeys.length; i++) {\n    childMapping[pendingKeys[i]] = getValueForKey(pendingKeys[i]);\n  }\n\n  return childMapping;\n}\n\nfunction getProp(child, prop, props) {\n  return props[prop] != null ? props[prop] : child.props[prop];\n}\n\nfunction getInitialChildMapping(props, onExited) {\n  return getChildMapping(props.children, function (child) {\n    return (0, _react.cloneElement)(child, {\n      onExited: onExited.bind(null, child),\n      in: true,\n      appear: getProp(child, 'appear', props),\n      enter: getProp(child, 'enter', props),\n      exit: getProp(child, 'exit', props)\n    });\n  });\n}\n\nfunction getNextChildMapping(nextProps, prevChildMapping, onExited) {\n  var nextChildMapping = getChildMapping(nextProps.children);\n  var children = mergeChildMappings(prevChildMapping, nextChildMapping);\n  Object.keys(children).forEach(function (key) {\n    var child = children[key];\n    if (!(0, _react.isValidElement)(child)) return;\n    var hasPrev = key in prevChildMapping;\n    var hasNext = key in nextChildMapping;\n    var prevChild = prevChildMapping[key];\n    var isLeaving = (0, _react.isValidElement)(prevChild) && !prevChild.props.in; // item is new (entering)\n\n    if (hasNext && (!hasPrev || isLeaving)) {\n      // console.log('entering', key)\n      children[key] = (0, _react.cloneElement)(child, {\n        onExited: onExited.bind(null, child),\n        in: true,\n        exit: getProp(child, 'exit', nextProps),\n        enter: getProp(child, 'enter', nextProps)\n      });\n    } else if (!hasNext && hasPrev && !isLeaving) {\n      // item is old (exiting)\n      // console.log('leaving', key)\n      children[key] = (0, _react.cloneElement)(child, {\n        in: false\n      });\n    } else if (hasNext && hasPrev && (0, _react.isValidElement)(prevChild)) {\n      // item hasn't changed transition states\n      // copy over the last transition props;\n      // console.log('unchanged', key)\n      children[key] = (0, _react.cloneElement)(child, {\n        onExited: onExited.bind(null, child),\n        in: prevChild.props.in,\n        exit: getProp(child, 'exit', nextProps),\n        enter: getProp(child, 'enter', nextProps)\n      });\n    }\n  });\n  return children;\n}","\"use strict\";\n\nexports.__esModule = true;\nexports.classNamesShape = exports.timeoutsShape = void 0;\n\nvar _propTypes = _interopRequireDefault(require(\"prop-types\"));\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar timeoutsShape = process.env.NODE_ENV !== 'production' ? _propTypes.default.oneOfType([_propTypes.default.number, _propTypes.default.shape({\n  enter: _propTypes.default.number,\n  exit: _propTypes.default.number,\n  appear: _propTypes.default.number\n}).isRequired]) : null;\nexports.timeoutsShape = timeoutsShape;\nvar classNamesShape = process.env.NODE_ENV !== 'production' ? _propTypes.default.oneOfType([_propTypes.default.string, _propTypes.default.shape({\n  enter: _propTypes.default.string,\n  exit: _propTypes.default.string,\n  active: _propTypes.default.string\n}), _propTypes.default.shape({\n  enter: _propTypes.default.string,\n  enterDone: _propTypes.default.string,\n  enterActive: _propTypes.default.string,\n  exit: _propTypes.default.string,\n  exitDone: _propTypes.default.string,\n  exitActive: _propTypes.default.string\n})]) : null;\nexports.classNamesShape = classNamesShape;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getTickValuesFixedDomain = exports.getTickValues = exports.getNiceTickValues = void 0;\n\nvar _decimal = _interopRequireDefault(require(\"decimal.js-light\"));\n\nvar _utils = require(\"./util/utils\");\n\nvar _arithmetic = _interopRequireDefault(require(\"./util/arithmetic\"));\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\n/**\n * Calculate a interval of a minimum value and a maximum value\n *\n * @param  {Number} min       The minimum value\n * @param  {Number} max       The maximum value\n * @return {Array} An interval\n */\nfunction getValidInterval(_ref) {\n  var _ref2 = _slicedToArray(_ref, 2),\n      min = _ref2[0],\n      max = _ref2[1];\n\n  var validMin = min,\n      validMax = max; // exchange\n\n  if (min > max) {\n    validMin = max;\n    validMax = min;\n  }\n\n  return [validMin, validMax];\n}\n/**\n * Calculate the step which is easy to understand between ticks, like 10, 20, 25\n *\n * @param  {Decimal} roughStep        The rough step calculated by deviding the\n * difference by the tickCount\n * @param  {Boolean} allowDecimals    Allow the ticks to be decimals or not\n * @param  {Integer} correctionFactor A correction factor\n * @return {Decimal} The step which is easy to understand between two ticks\n */\n\n\nfunction getFormatStep(roughStep, allowDecimals, correctionFactor) {\n  if (roughStep.lte(0)) {\n    return new _decimal.default(0);\n  }\n\n  var digitCount = _arithmetic.default.getDigitCount(roughStep.toNumber()); // The ratio between the rough step and the smallest number which has a bigger\n  // order of magnitudes than the rough step\n\n\n  var digitCountValue = new _decimal.default(10).pow(digitCount);\n  var stepRatio = roughStep.div(digitCountValue); // When an integer and a float multiplied, the accuracy of result may be wrong\n\n  var stepRatioScale = digitCount !== 1 ? 0.05 : 0.1;\n  var amendStepRatio = new _decimal.default(Math.ceil(stepRatio.div(stepRatioScale).toNumber())).add(correctionFactor).mul(stepRatioScale);\n  var formatStep = amendStepRatio.mul(digitCountValue);\n  return allowDecimals ? formatStep : new _decimal.default(Math.ceil(formatStep));\n}\n/**\n * calculate the ticks when the minimum value equals to the maximum value\n *\n * @param  {Number}  value         The minimum valuue which is also the maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}                 ticks\n */\n\n\nfunction getTickOfSingleValue(value, tickCount, allowDecimals) {\n  var step = 1; // calculate the middle value of ticks\n\n  var middle = new _decimal.default(value);\n\n  if (!middle.isint() && allowDecimals) {\n    var absVal = Math.abs(value);\n\n    if (absVal < 1) {\n      // The step should be a float number when the difference is smaller than 1\n      step = new _decimal.default(10).pow(_arithmetic.default.getDigitCount(value) - 1);\n      middle = new _decimal.default(Math.floor(middle.div(step).toNumber())).mul(step);\n    } else if (absVal > 1) {\n      // Return the maximum integer which is smaller than 'value' when 'value' is greater than 1\n      middle = new _decimal.default(Math.floor(value));\n    }\n  } else if (value === 0) {\n    middle = new _decimal.default(Math.floor((tickCount - 1) / 2));\n  } else if (!allowDecimals) {\n    middle = new _decimal.default(Math.floor(value));\n  }\n\n  var middleIndex = Math.floor((tickCount - 1) / 2);\n  var fn = (0, _utils.compose)((0, _utils.map)(function (n) {\n    return middle.add(new _decimal.default(n - middleIndex).mul(step)).toNumber();\n  }), _utils.range);\n  return fn(0, tickCount);\n}\n/**\n * Calculate the step\n *\n * @param  {Number}  min              The minimum value of an interval\n * @param  {Number}  max              The maximum value of an interval\n * @param  {Integer} tickCount        The count of ticks\n * @param  {Boolean} allowDecimals    Allow the ticks to be decimals or not\n * @param  {Number}  correctionFactor A correction factor\n * @return {Object}  The step, minimum value of ticks, maximum value of ticks\n */\n\n\nfunction calculateStep(min, max, tickCount, allowDecimals) {\n  var correctionFactor = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;\n\n  // dirty hack (for recharts' test)\n  if (!Number.isFinite((max - min) / (tickCount - 1))) {\n    return {\n      step: new _decimal.default(0),\n      tickMin: new _decimal.default(0),\n      tickMax: new _decimal.default(0)\n    };\n  } // The step which is easy to understand between two ticks\n\n\n  var step = getFormatStep(new _decimal.default(max).sub(min).div(tickCount - 1), allowDecimals, correctionFactor); // A medial value of ticks\n\n  var middle; // When 0 is inside the interval, 0 should be a tick\n\n  if (min <= 0 && max >= 0) {\n    middle = new _decimal.default(0);\n  } else {\n    // calculate the middle value\n    middle = new _decimal.default(min).add(max).div(2); // minus modulo value\n\n    middle = middle.sub(new _decimal.default(middle).mod(step));\n  }\n\n  var belowCount = Math.ceil(middle.sub(min).div(step).toNumber());\n  var upCount = Math.ceil(new _decimal.default(max).sub(middle).div(step).toNumber());\n  var scaleCount = belowCount + upCount + 1;\n\n  if (scaleCount > tickCount) {\n    // When more ticks need to cover the interval, step should be bigger.\n    return calculateStep(min, max, tickCount, allowDecimals, correctionFactor + 1);\n  }\n\n  if (scaleCount < tickCount) {\n    // When less ticks can cover the interval, we should add some additional ticks\n    upCount = max > 0 ? upCount + (tickCount - scaleCount) : upCount;\n    belowCount = max > 0 ? belowCount : belowCount + (tickCount - scaleCount);\n  }\n\n  return {\n    step: step,\n    tickMin: middle.sub(new _decimal.default(belowCount).mul(step)),\n    tickMax: middle.add(new _decimal.default(upCount).mul(step))\n  };\n}\n/**\n * Calculate the ticks of an interval, the count of ticks will be guraranteed\n *\n * @param  {Number}  min, max      min: The minimum value, max: The maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}   ticks\n */\n\n\nfunction getNiceTickValuesFn(_ref3) {\n  var _ref4 = _slicedToArray(_ref3, 2),\n      min = _ref4[0],\n      max = _ref4[1];\n\n  var tickCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 6;\n  var allowDecimals = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n  // More than two ticks should be return\n  var count = Math.max(tickCount, 2);\n\n  var _getValidInterval = getValidInterval([min, max]),\n      _getValidInterval2 = _slicedToArray(_getValidInterval, 2),\n      cormin = _getValidInterval2[0],\n      cormax = _getValidInterval2[1];\n\n  if (cormin === -Infinity || cormax === Infinity) {\n    var _values = cormax === Infinity ? [cormin].concat(_toConsumableArray((0, _utils.range)(0, tickCount - 1).map(function () {\n      return Infinity;\n    }))) : _toConsumableArray((0, _utils.range)(0, tickCount - 1).map(function () {\n      return -Infinity;\n    })).concat([cormax]);\n\n    return min > max ? (0, _utils.reverse)(_values) : _values;\n  }\n\n  if (cormin === cormax) {\n    return getTickOfSingleValue(cormin, tickCount, allowDecimals);\n  } // Get the step between two ticks\n\n\n  var _calculateStep = calculateStep(cormin, cormax, count, allowDecimals),\n      step = _calculateStep.step,\n      tickMin = _calculateStep.tickMin,\n      tickMax = _calculateStep.tickMax;\n\n  var values = _arithmetic.default.rangeStep(tickMin, tickMax.add(new _decimal.default(0.1).mul(step)), step);\n\n  return min > max ? (0, _utils.reverse)(values) : values;\n}\n/**\n * Calculate the ticks of an interval, the count of ticks won't be guraranteed\n *\n * @param  {Number}  min, max      min: The minimum value, max: The maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}   ticks\n */\n\n\nfunction getTickValuesFn(_ref5) {\n  var _ref6 = _slicedToArray(_ref5, 2),\n      min = _ref6[0],\n      max = _ref6[1];\n\n  var tickCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 6;\n  var allowDecimals = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n  // More than two ticks should be return\n  var count = Math.max(tickCount, 2);\n\n  var _getValidInterval3 = getValidInterval([min, max]),\n      _getValidInterval4 = _slicedToArray(_getValidInterval3, 2),\n      cormin = _getValidInterval4[0],\n      cormax = _getValidInterval4[1];\n\n  if (cormin === -Infinity || cormax === Infinity) {\n    return [min, max];\n  }\n\n  if (cormin === cormax) {\n    return getTickOfSingleValue(cormin, tickCount, allowDecimals);\n  }\n\n  var step = getFormatStep(new _decimal.default(cormax).sub(cormin).div(count - 1), allowDecimals, 0);\n  var fn = (0, _utils.compose)((0, _utils.map)(function (n) {\n    return new _decimal.default(cormin).add(new _decimal.default(n).mul(step)).toNumber();\n  }), _utils.range);\n  var values = fn(0, count).filter(function (entry) {\n    return entry >= cormin && entry <= cormax;\n  });\n  return min > max ? (0, _utils.reverse)(values) : values;\n}\n/**\n * Calculate the ticks of an interval, the count of ticks won't be guraranteed,\n * but the domain will be guaranteed\n *\n * @param  {Number}  min, max      min: The minimum value, max: The maximum value\n * @param  {Integer} tickCount     The count of ticks\n * @param  {Boolean} allowDecimals Allow the ticks to be decimals or not\n * @return {Array}   ticks\n */\n\n\nfunction getTickValuesFixedDomainFn(_ref7, tickCount) {\n  var _ref8 = _slicedToArray(_ref7, 2),\n      min = _ref8[0],\n      max = _ref8[1];\n\n  var allowDecimals = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;\n\n  // More than two ticks should be return\n  var _getValidInterval5 = getValidInterval([min, max]),\n      _getValidInterval6 = _slicedToArray(_getValidInterval5, 2),\n      cormin = _getValidInterval6[0],\n      cormax = _getValidInterval6[1];\n\n  if (cormin === -Infinity || cormax === Infinity) {\n    return [min, max];\n  }\n\n  if (cormin === cormax) {\n    return [cormin];\n  }\n\n  var count = Math.max(tickCount, 2);\n  var step = getFormatStep(new _decimal.default(cormax).sub(cormin).div(count - 1), allowDecimals, 0);\n\n  var values = _toConsumableArray(_arithmetic.default.rangeStep(new _decimal.default(cormin), new _decimal.default(cormax).sub(new _decimal.default(0.99).mul(step)), step)).concat([cormax]);\n\n  return min > max ? (0, _utils.reverse)(values) : values;\n}\n\nvar getNiceTickValues = (0, _utils.memoize)(getNiceTickValuesFn);\nexports.getNiceTickValues = getNiceTickValues;\nvar getTickValues = (0, _utils.memoize)(getTickValuesFn);\nexports.getTickValues = getTickValues;\nvar getTickValuesFixedDomain = (0, _utils.memoize)(getTickValuesFixedDomainFn);\nexports.getTickValuesFixedDomain = getTickValuesFixedDomain;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nObject.defineProperty(exports, \"getTickValues\", {\n  enumerable: true,\n  get: function get() {\n    return _getNiceTickValues.getTickValues;\n  }\n});\nObject.defineProperty(exports, \"getNiceTickValues\", {\n  enumerable: true,\n  get: function get() {\n    return _getNiceTickValues.getNiceTickValues;\n  }\n});\nObject.defineProperty(exports, \"getTickValuesFixedDomain\", {\n  enumerable: true,\n  get: function get() {\n    return _getNiceTickValues.getTickValuesFixedDomain;\n  }\n});\n\nvar _getNiceTickValues = require(\"./getNiceTickValues\");","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.default = void 0;\n\nvar _decimal = _interopRequireDefault(require(\"decimal.js-light\"));\n\nvar _utils = require(\"./utils\");\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/**\n * @fileOverview 一些公用的运算方法\n * @author xile611\n * @date 2015-09-17\n */\n\n/**\n * 获取数值的位数\n * 其中绝对值属于区间[0.1, 1)， 得到的值为0\n * 绝对值属于区间[0.01, 0.1)，得到的位数为 -1\n * 绝对值属于区间[0.001, 0.01)，得到的位数为 -2\n *\n * @param  {Number} value 数值\n * @return {Integer} 位数\n */\nfunction getDigitCount(value) {\n  var result;\n\n  if (value === 0) {\n    result = 1;\n  } else {\n    result = Math.floor(new _decimal.default(value).abs().log(10).toNumber()) + 1;\n  }\n\n  return result;\n}\n/**\n * 按照固定的步长获取[start, end)这个区间的数据\n * 并且需要处理js计算精度的问题\n *\n * @param  {Decimal} start 起点\n * @param  {Decimal} end   终点，不包含该值\n * @param  {Decimal} step  步长\n * @return {Array}         若干数值\n */\n\n\nfunction rangeStep(start, end, step) {\n  var num = new _decimal.default(start);\n  var i = 0;\n  var result = []; // magic number to prevent infinite loop\n\n  while (num.lt(end) && i < 100000) {\n    result.push(num.toNumber());\n    num = num.add(step);\n    i++;\n  }\n\n  return result;\n}\n/**\n * 对数值进行线性插值\n *\n * @param  {Number} a  定义域的极点\n * @param  {Number} b  定义域的极点\n * @param  {Number} t  [0, 1]内的某个值\n * @return {Number}    定义域内的某个值\n */\n\n\nvar interpolateNumber = (0, _utils.curry)(function (a, b, t) {\n  var newA = +a;\n  var newB = +b;\n  return newA + t * (newB - newA);\n});\n/**\n * 线性插值的逆运算\n *\n * @param  {Number} a 定义域的极点\n * @param  {Number} b 定义域的极点\n * @param  {Number} x 可以认为是插值后的一个输出值\n * @return {Number}   当x在 a ~ b这个范围内时，返回值属于[0, 1]\n */\n\nvar uninterpolateNumber = (0, _utils.curry)(function (a, b, x) {\n  var diff = b - +a;\n  diff = diff || Infinity;\n  return (x - a) / diff;\n});\n/**\n * 线性插值的逆运算，并且有截断的操作\n *\n * @param  {Number} a 定义域的极点\n * @param  {Number} b 定义域的极点\n * @param  {Number} x 可以认为是插值后的一个输出值\n * @return {Number}   当x在 a ~ b这个区间内时，返回值属于[0, 1]，\n * 当x不在 a ~ b这个区间时，会截断到 a ~ b 这个区间\n */\n\nvar uninterpolateTruncation = (0, _utils.curry)(function (a, b, x) {\n  var diff = b - +a;\n  diff = diff || Infinity;\n  return Math.max(0, Math.min(1, (x - a) / diff));\n});\nvar _default = {\n  rangeStep: rangeStep,\n  getDigitCount: getDigitCount,\n  interpolateNumber: interpolateNumber,\n  uninterpolateNumber: uninterpolateNumber,\n  uninterpolateTruncation: uninterpolateTruncation\n};\nexports.default = _default;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.memoize = exports.reverse = exports.compose = exports.map = exports.range = exports.curry = exports.PLACE_HOLDER = void 0;\n\nfunction _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance\"); }\n\nfunction _iterableToArray(iter) { if (Symbol.iterator in Object(iter) || Object.prototype.toString.call(iter) === \"[object Arguments]\") return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = new Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } }\n\nvar identity = function identity(i) {\n  return i;\n};\n\nvar PLACE_HOLDER = {\n  '@@functional/placeholder': true\n};\nexports.PLACE_HOLDER = PLACE_HOLDER;\n\nvar isPlaceHolder = function isPlaceHolder(val) {\n  return val === PLACE_HOLDER;\n};\n\nvar curry0 = function curry0(fn) {\n  return function _curried() {\n    if (arguments.length === 0 || arguments.length === 1 && isPlaceHolder(arguments.length <= 0 ? undefined : arguments[0])) {\n      return _curried;\n    }\n\n    return fn.apply(void 0, arguments);\n  };\n};\n\nvar curryN = function curryN(n, fn) {\n  if (n === 1) {\n    return fn;\n  }\n\n  return curry0(function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    var argsLength = args.filter(function (arg) {\n      return arg !== PLACE_HOLDER;\n    }).length;\n\n    if (argsLength >= n) {\n      return fn.apply(void 0, args);\n    }\n\n    return curryN(n - argsLength, curry0(function () {\n      for (var _len2 = arguments.length, restArgs = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n        restArgs[_key2] = arguments[_key2];\n      }\n\n      var newArgs = args.map(function (arg) {\n        return isPlaceHolder(arg) ? restArgs.shift() : arg;\n      });\n      return fn.apply(void 0, _toConsumableArray(newArgs).concat(restArgs));\n    }));\n  });\n};\n\nvar curry = function curry(fn) {\n  return curryN(fn.length, fn);\n};\n\nexports.curry = curry;\n\nvar range = function range(begin, end) {\n  var arr = [];\n\n  for (var i = begin; i < end; ++i) {\n    arr[i - begin] = i;\n  }\n\n  return arr;\n};\n\nexports.range = range;\nvar map = curry(function (fn, arr) {\n  if (Array.isArray(arr)) {\n    return arr.map(fn);\n  }\n\n  return Object.keys(arr).map(function (key) {\n    return arr[key];\n  }).map(fn);\n});\nexports.map = map;\n\nvar compose = function compose() {\n  for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n    args[_key3] = arguments[_key3];\n  }\n\n  if (!args.length) {\n    return identity;\n  }\n\n  var fns = args.reverse(); // first function can receive multiply arguments\n\n  var firstFn = fns[0];\n  var tailsFn = fns.slice(1);\n  return function () {\n    return tailsFn.reduce(function (res, fn) {\n      return fn(res);\n    }, firstFn.apply(void 0, arguments));\n  };\n};\n\nexports.compose = compose;\n\nvar reverse = function reverse(arr) {\n  if (Array.isArray(arr)) {\n    return arr.reverse();\n  } // can be string\n\n\n  return arr.split('').reverse.join('');\n};\n\nexports.reverse = reverse;\n\nvar memoize = function memoize(fn) {\n  var lastArgs = null;\n  var lastResult = null;\n  return function () {\n    for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {\n      args[_key4] = arguments[_key4];\n    }\n\n    if (lastArgs && args.every(function (val, i) {\n      return val === lastArgs[i];\n    })) {\n      return lastResult;\n    }\n\n    lastArgs = args;\n    lastResult = fn.apply(void 0, args);\n    return lastResult;\n  };\n};\n\nexports.memoize = memoize;","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _postcssValueParser = require('postcss-value-parser');\n\nvar _postcssValueParser2 = _interopRequireDefault(_postcssValueParser);\n\nvar _parser = require('./parser');\n\nvar _reducer = require('./lib/reducer');\n\nvar _reducer2 = _interopRequireDefault(_reducer);\n\nvar _stringifier = require('./lib/stringifier');\n\nvar _stringifier2 = _interopRequireDefault(_stringifier);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n// eslint-disable-line\nvar MATCH_CALC = /((?:\\-[a-z]+\\-)?calc)/;\n\nexports.default = function (value) {\n  var precision = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 5;\n\n  return (0, _postcssValueParser2.default)(value).walk(function (node) {\n    // skip anything which isn't a calc() function\n    if (node.type !== 'function' || !MATCH_CALC.test(node.value)) return;\n\n    // stringify calc expression and produce an AST\n    var contents = _postcssValueParser2.default.stringify(node.nodes);\n\n    // skip constant() and env()\n    if (contents.indexOf('constant') >= 0 || contents.indexOf('env') >= 0) return;\n\n    var ast = _parser.parser.parse(contents);\n\n    // reduce AST to its simplest form, that is, either to a single value\n    // or a simplified calc expression\n    var reducedAst = (0, _reducer2.default)(ast, precision);\n\n    // stringify AST and write it back\n    node.type = 'word';\n    node.value = (0, _stringifier2.default)(node.value, reducedAst, precision);\n  }, true).toString();\n};\n\nmodule.exports = exports['default'];","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _cssUnitConverter = require('css-unit-converter');\n\nvar _cssUnitConverter2 = _interopRequireDefault(_cssUnitConverter);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction convertNodes(left, right, precision) {\n  switch (left.type) {\n    case 'LengthValue':\n    case 'AngleValue':\n    case 'TimeValue':\n    case 'FrequencyValue':\n    case 'ResolutionValue':\n      return convertAbsoluteLength(left, right, precision);\n    default:\n      return { left: left, right: right };\n  }\n}\n\nfunction convertAbsoluteLength(left, right, precision) {\n  if (right.type === left.type) {\n    right = {\n      type: left.type,\n      value: (0, _cssUnitConverter2.default)(right.value, right.unit, left.unit, precision),\n      unit: left.unit\n    };\n  }\n  return { left: left, right: right };\n}\n\nexports.default = convertNodes;\nmodule.exports = exports['default'];","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.flip = flip;\n\nvar _convert = require('./convert');\n\nvar _convert2 = _interopRequireDefault(_convert);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction reduce(node, precision) {\n  if (node.type === \"MathExpression\") return reduceMathExpression(node, precision);\n\n  return node;\n}\n\nfunction isEqual(left, right) {\n  return left.type === right.type && left.value === right.value;\n}\n\nfunction isValueType(type) {\n  switch (type) {\n    case 'LengthValue':\n    case 'AngleValue':\n    case 'TimeValue':\n    case 'FrequencyValue':\n    case 'ResolutionValue':\n    case 'EmValue':\n    case 'ExValue':\n    case 'ChValue':\n    case 'RemValue':\n    case 'VhValue':\n    case 'VwValue':\n    case 'VminValue':\n    case 'VmaxValue':\n    case 'PercentageValue':\n    case 'Value':\n      return true;\n  }\n  return false;\n}\n\nfunction convertMathExpression(node, precision) {\n  var nodes = (0, _convert2.default)(node.left, node.right, precision);\n  var left = reduce(nodes.left, precision);\n  var right = reduce(nodes.right, precision);\n\n  if (left.type === \"MathExpression\" && right.type === \"MathExpression\") {\n\n    if (left.operator === '/' && right.operator === '*' || left.operator === '-' && right.operator === '+' || left.operator === '*' && right.operator === '/' || left.operator === '+' && right.operator === '-') {\n\n      if (isEqual(left.right, right.right)) nodes = (0, _convert2.default)(left.left, right.left, precision);else if (isEqual(left.right, right.left)) nodes = (0, _convert2.default)(left.left, right.right, precision);\n\n      left = reduce(nodes.left, precision);\n      right = reduce(nodes.right, precision);\n    }\n  }\n\n  node.left = left;\n  node.right = right;\n  return node;\n}\n\nfunction flip(operator) {\n  return operator === '+' ? '-' : '+';\n}\n\nfunction flipValue(node) {\n  if (isValueType(node.type)) node.value = -node.value;else if (node.type == 'MathExpression') {\n    node.left = flipValue(node.left);\n    node.right = flipValue(node.right);\n  }\n  return node;\n}\n\nfunction reduceAddSubExpression(node, precision) {\n  var _node = node,\n      left = _node.left,\n      right = _node.right,\n      op = _node.operator;\n\n\n  if (left.type === 'CssVariable' || right.type === 'CssVariable') return node;\n\n  // something + 0 => something\n  // something - 0 => something\n  if (right.value === 0) return left;\n\n  // 0 + something => something\n  if (left.value === 0 && op === \"+\") return right;\n\n  // 0 - something => -something\n  if (left.value === 0 && op === \"-\") return flipValue(right);\n\n  // value + value\n  // value - value\n  if (left.type === right.type && isValueType(left.type)) {\n    node = Object.assign({}, left);\n    if (op === \"+\") node.value = left.value + right.value;else node.value = left.value - right.value;\n  }\n\n  // value <op> (expr)\n  if (isValueType(left.type) && (right.operator === '+' || right.operator === '-') && right.type === 'MathExpression') {\n    // value + (value + something) => (value + value) + something\n    // value + (value - something) => (value + value) - something\n    // value - (value + something) => (value - value) - something\n    // value - (value - something) => (value - value) + something\n    if (left.type === right.left.type) {\n      node = Object.assign({}, node);\n      node.left = reduce({\n        type: 'MathExpression',\n        operator: op,\n        left: left,\n        right: right.left\n      }, precision);\n      node.right = right.right;\n      node.operator = op === '-' ? flip(right.operator) : right.operator;\n      return reduce(node, precision);\n    }\n    // value + (something + value) => (value + value) + something\n    // value + (something - value) => (value - value) + something\n    // value - (something + value) => (value - value) - something\n    // value - (something - value) => (value + value) - something\n    else if (left.type === right.right.type) {\n        node = Object.assign({}, node);\n        node.left = reduce({\n          type: 'MathExpression',\n          operator: op === '-' ? flip(right.operator) : right.operator,\n          left: left,\n          right: right.right\n        }, precision);\n        node.right = right.left;\n        return reduce(node, precision);\n      }\n  }\n\n  // (expr) <op> value\n  if (left.type === 'MathExpression' && (left.operator === '+' || left.operator === '-') && isValueType(right.type)) {\n    // (value + something) + value => (value + value) + something\n    // (value - something) + value => (value + value) - something\n    // (value + something) - value => (value - value) + something\n    // (value - something) - value => (value - value) - something\n    if (right.type === left.left.type) {\n      node = Object.assign({}, left);\n      node.left = reduce({\n        type: 'MathExpression',\n        operator: op,\n        left: left.left,\n        right: right\n      }, precision);\n      return reduce(node, precision);\n    }\n    // (something + value) + value => something + (value + value)\n    // (something - value1) + value2 => something - (value2 - value1)\n    // (something + value) - value => something + (value - value)\n    // (something - value) - value => something - (value + value)\n    else if (right.type === left.right.type) {\n        node = Object.assign({}, left);\n        if (left.operator === '-') {\n          node.right = reduce({\n            type: 'MathExpression',\n            operator: op === '-' ? '+' : '-',\n            left: right,\n            right: left.right\n          }, precision);\n          node.operator = op === '-' ? '-' : '+';\n        } else {\n          node.right = reduce({\n            type: 'MathExpression',\n            operator: op,\n            left: left.right,\n            right: right\n          }, precision);\n        }\n        if (node.right.value < 0) {\n          node.right.value *= -1;\n          node.operator = node.operator === '-' ? '+' : '-';\n        }\n        return reduce(node, precision);\n      }\n  }\n  return node;\n}\n\nfunction reduceDivisionExpression(node, precision) {\n  if (!isValueType(node.right.type)) return node;\n\n  if (node.right.type !== 'Value') throw new Error('Cannot divide by \"' + node.right.unit + '\", number expected');\n\n  if (node.right.value === 0) throw new Error('Cannot divide by zero');\n\n  // (expr) / value\n  if (node.left.type === 'MathExpression') {\n    if (isValueType(node.left.left.type) && isValueType(node.left.right.type)) {\n      node.left.left.value /= node.right.value;\n      node.left.right.value /= node.right.value;\n      return reduce(node.left, precision);\n    }\n    return node;\n  }\n  // something / value\n  else if (isValueType(node.left.type)) {\n      node.left.value /= node.right.value;\n      return node.left;\n    }\n  return node;\n}\n\nfunction reduceMultiplicationExpression(node) {\n  // (expr) * value\n  if (node.left.type === 'MathExpression' && node.right.type === 'Value') {\n    if (isValueType(node.left.left.type) && isValueType(node.left.right.type)) {\n      node.left.left.value *= node.right.value;\n      node.left.right.value *= node.right.value;\n      return node.left;\n    }\n  }\n  // something * value\n  else if (isValueType(node.left.type) && node.right.type === 'Value') {\n      node.left.value *= node.right.value;\n      return node.left;\n    }\n    // value * (expr)\n    else if (node.left.type === 'Value' && node.right.type === 'MathExpression') {\n        if (isValueType(node.right.left.type) && isValueType(node.right.right.type)) {\n          node.right.left.value *= node.left.value;\n          node.right.right.value *= node.left.value;\n          return node.right;\n        }\n      }\n      // value * something\n      else if (node.left.type === 'Value' && isValueType(node.right.type)) {\n          node.right.value *= node.left.value;\n          return node.right;\n        }\n  return node;\n}\n\nfunction reduceMathExpression(node, precision) {\n  node = convertMathExpression(node, precision);\n\n  switch (node.operator) {\n    case \"+\":\n    case \"-\":\n      return reduceAddSubExpression(node, precision);\n    case \"/\":\n      return reduceDivisionExpression(node, precision);\n    case \"*\":\n      return reduceMultiplicationExpression(node);\n  }\n  return node;\n}\n\nexports.default = reduce;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nexports.default = function (calc, node, precision) {\n  var str = stringify(node, precision);\n\n  if (node.type === \"MathExpression\") {\n    // if calc expression couldn't be resolved to a single value, re-wrap it as\n    // a calc()\n    str = calc + \"(\" + str + \")\";\n  }\n  return str;\n};\n\nvar _reducer = require(\"./reducer\");\n\nvar order = {\n  \"*\": 0,\n  \"/\": 0,\n  \"+\": 1,\n  \"-\": 1\n};\n\nfunction round(value, prec) {\n  if (prec !== false) {\n    var precision = Math.pow(10, prec);\n    return Math.round(value * precision) / precision;\n  }\n  return value;\n}\n\nfunction stringify(node, prec) {\n  switch (node.type) {\n    case \"MathExpression\":\n      {\n        var left = node.left,\n            right = node.right,\n            op = node.operator;\n\n        var str = \"\";\n\n        if (left.type === 'MathExpression' && order[op] < order[left.operator]) str += \"(\" + stringify(left, prec) + \")\";else str += stringify(left, prec);\n\n        str += \" \" + node.operator + \" \";\n\n        if (right.type === 'MathExpression' && order[op] < order[right.operator]) str += \"(\" + stringify(right, prec) + \")\";else if (right.type === 'MathExpression' && op === \"-\" && [\"+\", \"-\"].includes(right.operator)) {\n          // fix #52 : a-(b+c) = a-b-c\n          right.operator = (0, _reducer.flip)(right.operator);\n          str += stringify(right, prec);\n        } else str += stringify(right, prec);\n\n        return str;\n      }\n    case \"Value\":\n      return round(node.value, prec);\n    case 'CssVariable':\n      return node.value;\n    default:\n      return round(node.value, prec) + node.unit;\n  }\n}\n\nmodule.exports = exports[\"default\"];","\n/* parser generated by jison 0.6.1-215 */\n\n/*\n * Returns a Parser object of the following structure:\n *\n *  Parser: {\n *    yy: {}     The so-called \"shared state\" or rather the *source* of it;\n *               the real \"shared state\" `yy` passed around to\n *               the rule actions, etc. is a derivative/copy of this one,\n *               not a direct reference!\n *  }\n *\n *  Parser.prototype: {\n *    yy: {},\n *    EOF: 1,\n *    TERROR: 2,\n *\n *    trace: function(errorMessage, ...),\n *\n *    JisonParserError: function(msg, hash),\n *\n *    quoteName: function(name),\n *               Helper function which can be overridden by user code later on: put suitable\n *               quotes around literal IDs in a description string.\n *\n *    originalQuoteName: function(name),\n *               The basic quoteName handler provided by JISON.\n *               `cleanupAfterParse()` will clean up and reset `quoteName()` to reference this function\n *               at the end of the `parse()`.\n *\n *    describeSymbol: function(symbol),\n *               Return a more-or-less human-readable description of the given symbol, when\n *               available, or the symbol itself, serving as its own 'description' for lack\n *               of something better to serve up.\n *\n *               Return NULL when the symbol is unknown to the parser.\n *\n *    symbols_: {associative list: name ==> number},\n *    terminals_: {associative list: number ==> name},\n *    nonterminals: {associative list: rule-name ==> {associative list: number ==> rule-alt}},\n *    terminal_descriptions_: (if there are any) {associative list: number ==> description},\n *    productions_: [...],\n *\n *    performAction: function parser__performAction(yytext, yyleng, yylineno, yyloc, yystate, yysp, yyvstack, yylstack, yystack, yysstack),\n *\n *               The function parameters and `this` have the following value/meaning:\n *               - `this`    : reference to the `yyval` internal object, which has members (`$` and `_$`)\n *                             to store/reference the rule value `$$` and location info `@$`.\n *\n *                 One important thing to note about `this` a.k.a. `yyval`: every *reduce* action gets\n *                 to see the same object via the `this` reference, i.e. if you wish to carry custom\n *                 data from one reduce action through to the next within a single parse run, then you\n *                 may get nasty and use `yyval` a.k.a. `this` for storing you own semi-permanent data.\n *\n *                 `this.yy` is a direct reference to the `yy` shared state object.\n *\n *                 `%parse-param`-specified additional `parse()` arguments have been added to this `yy`\n *                 object at `parse()` start and are therefore available to the action code via the\n *                 same named `yy.xxxx` attributes (where `xxxx` represents a identifier name from\n *                 the %parse-param` list.\n *\n *               - `yytext`  : reference to the lexer value which belongs to the last lexer token used\n *                             to match this rule. This is *not* the look-ahead token, but the last token\n *                             that's actually part of this rule.\n *\n *                 Formulated another way, `yytext` is the value of the token immediately preceeding\n *                 the current look-ahead token.\n *                 Caveats apply for rules which don't require look-ahead, such as epsilon rules.\n *\n *               - `yyleng`  : ditto as `yytext`, only now for the lexer.yyleng value.\n *\n *               - `yylineno`: ditto as `yytext`, only now for the lexer.yylineno value.\n *\n *               - `yyloc`   : ditto as `yytext`, only now for the lexer.yylloc lexer token location info.\n *\n *                               WARNING: since jison 0.4.18-186 this entry may be NULL/UNDEFINED instead\n *                               of an empty object when no suitable location info can be provided.\n *\n *               - `yystate` : the current parser state number, used internally for dispatching and\n *                               executing the action code chunk matching the rule currently being reduced.\n *\n *               - `yysp`    : the current state stack position (a.k.a. 'stack pointer')\n *\n *                 This one comes in handy when you are going to do advanced things to the parser\n *                 stacks, all of which are accessible from your action code (see the next entries below).\n *\n *                 Also note that you can access this and other stack index values using the new double-hash\n *                 syntax, i.e. `##$ === ##0 === yysp`, while `##1` is the stack index for all things\n *                 related to the first rule term, just like you have `$1`, `@1` and `#1`.\n *                 This is made available to write very advanced grammar action rules, e.g. when you want\n *                 to investigate the parse state stack in your action code, which would, for example,\n *                 be relevant when you wish to implement error diagnostics and reporting schemes similar\n *                 to the work described here:\n *\n *                 + Pottier, F., 2016. Reachability and error diagnosis in LR(1) automata.\n *                   In Journées Francophones des Languages Applicatifs.\n *\n *                 + Jeffery, C.L., 2003. Generating LR syntax error messages from examples.\n *                   ACM Transactions on Programming Languages and Systems (TOPLAS), 25(5), pp.631–640.\n *\n *               - `yyrulelength`: the current rule's term count, i.e. the number of entries occupied on the stack.\n *\n *                 This one comes in handy when you are going to do advanced things to the parser\n *                 stacks, all of which are accessible from your action code (see the next entries below).\n *\n *               - `yyvstack`: reference to the parser value stack. Also accessed via the `$1` etc.\n *                             constructs.\n *\n *               - `yylstack`: reference to the parser token location stack. Also accessed via\n *                             the `@1` etc. constructs.\n *\n *                             WARNING: since jison 0.4.18-186 this array MAY contain slots which are\n *                             UNDEFINED rather than an empty (location) object, when the lexer/parser\n *                             action code did not provide a suitable location info object when such a\n *                             slot was filled!\n *\n *               - `yystack` : reference to the parser token id stack. Also accessed via the\n *                             `#1` etc. constructs.\n *\n *                 Note: this is a bit of a **white lie** as we can statically decode any `#n` reference to\n *                 its numeric token id value, hence that code wouldn't need the `yystack` but *you* might\n *                 want access this array for your own purposes, such as error analysis as mentioned above!\n *\n *                 Note that this stack stores the current stack of *tokens*, that is the sequence of\n *                 already parsed=reduced *nonterminals* (tokens representing rules) and *terminals*\n *                 (lexer tokens *shifted* onto the stack until the rule they belong to is found and\n *                 *reduced*.\n *\n *               - `yysstack`: reference to the parser state stack. This one carries the internal parser\n *                             *states* such as the one in `yystate`, which are used to represent\n *                             the parser state machine in the *parse table*. *Very* *internal* stuff,\n *                             what can I say? If you access this one, you're clearly doing wicked things\n *\n *               - `...`     : the extra arguments you specified in the `%parse-param` statement in your\n *                             grammar definition file.\n *\n *    table: [...],\n *               State transition table\n *               ----------------------\n *\n *               index levels are:\n *               - `state`  --> hash table\n *               - `symbol` --> action (number or array)\n *\n *                 If the `action` is an array, these are the elements' meaning:\n *                 - index [0]: 1 = shift, 2 = reduce, 3 = accept\n *                 - index [1]: GOTO `state`\n *\n *                 If the `action` is a number, it is the GOTO `state`\n *\n *    defaultActions: {...},\n *\n *    parseError: function(str, hash, ExceptionClass),\n *    yyError: function(str, ...),\n *    yyRecovering: function(),\n *    yyErrOk: function(),\n *    yyClearIn: function(),\n *\n *    constructParseErrorInfo: function(error_message, exception_object, expected_token_set, is_recoverable),\n *               Helper function **which will be set up during the first invocation of the `parse()` method**.\n *               Produces a new errorInfo 'hash object' which can be passed into `parseError()`.\n *               See it's use in this parser kernel in many places; example usage:\n *\n *                   var infoObj = parser.constructParseErrorInfo('fail!', null,\n *                                     parser.collect_expected_token_set(state), true);\n *                   var retVal = parser.parseError(infoObj.errStr, infoObj, parser.JisonParserError);\n *\n *    originalParseError: function(str, hash, ExceptionClass),\n *               The basic `parseError` handler provided by JISON.\n *               `cleanupAfterParse()` will clean up and reset `parseError()` to reference this function\n *               at the end of the `parse()`.\n *\n *    options: { ... parser %options ... },\n *\n *    parse: function(input[, args...]),\n *               Parse the given `input` and return the parsed value (or `true` when none was provided by\n *               the root action, in which case the parser is acting as a *matcher*).\n *               You MAY use the additional `args...` parameters as per `%parse-param` spec of this grammar:\n *               these extra `args...` are added verbatim to the `yy` object reference as member variables.\n *\n *               WARNING:\n *               Parser's additional `args...` parameters (via `%parse-param`) MAY conflict with\n *               any attributes already added to `yy` by the jison run-time;\n *               when such a collision is detected an exception is thrown to prevent the generated run-time\n *               from silently accepting this confusing and potentially hazardous situation!\n *\n *               The lexer MAY add its own set of additional parameters (via the `%parse-param` line in\n *               the lexer section of the grammar spec): these will be inserted in the `yy` shared state\n *               object and any collision with those will be reported by the lexer via a thrown exception.\n *\n *    cleanupAfterParse: function(resultValue, invoke_post_methods, do_not_nuke_errorinfos),\n *               Helper function **which will be set up during the first invocation of the `parse()` method**.\n *               This helper API is invoked at the end of the `parse()` call, unless an exception was thrown\n *               and `%options no-try-catch` has been defined for this grammar: in that case this helper MAY\n *               be invoked by calling user code to ensure the `post_parse` callbacks are invoked and\n *               the internal parser gets properly garbage collected under these particular circumstances.\n *\n *    yyMergeLocationInfo: function(first_index, last_index, first_yylloc, last_yylloc, dont_look_back),\n *               Helper function **which will be set up during the first invocation of the `parse()` method**.\n *               This helper API can be invoked to calculate a spanning `yylloc` location info object.\n *\n *               Note: %epsilon rules MAY specify no `first_index` and `first_yylloc`, in which case\n *               this function will attempt to obtain a suitable location marker by inspecting the location stack\n *               backwards.\n *\n *               For more info see the documentation comment further below, immediately above this function's\n *               implementation.\n *\n *    lexer: {\n *        yy: {...},           A reference to the so-called \"shared state\" `yy` once\n *                             received via a call to the `.setInput(input, yy)` lexer API.\n *        EOF: 1,\n *        ERROR: 2,\n *        JisonLexerError: function(msg, hash),\n *        parseError: function(str, hash, ExceptionClass),\n *        setInput: function(input, [yy]),\n *        input: function(),\n *        unput: function(str),\n *        more: function(),\n *        reject: function(),\n *        less: function(n),\n *        pastInput: function(n),\n *        upcomingInput: function(n),\n *        showPosition: function(),\n *        test_match: function(regex_match_array, rule_index, ...),\n *        next: function(...),\n *        lex: function(...),\n *        begin: function(condition),\n *        pushState: function(condition),\n *        popState: function(),\n *        topState: function(),\n *        _currentRules: function(),\n *        stateStackSize: function(),\n *        cleanupAfterLex: function()\n *\n *        options: { ... lexer %options ... },\n *\n *        performAction: function(yy, yy_, $avoiding_name_collisions, YY_START, ...),\n *        rules: [...],\n *        conditions: {associative list: name ==> set},\n *    }\n *  }\n *\n *\n *  token location info (@$, _$, etc.): {\n *    first_line: n,\n *    last_line: n,\n *    first_column: n,\n *    last_column: n,\n *    range: [start_number, end_number]\n *               (where the numbers are indexes into the input string, zero-based)\n *  }\n *\n * ---\n *\n * The `parseError` function receives a 'hash' object with these members for lexer and\n * parser errors:\n *\n *  {\n *    text:        (matched text)\n *    token:       (the produced terminal token, if any)\n *    token_id:    (the produced terminal token numeric ID, if any)\n *    line:        (yylineno)\n *    loc:         (yylloc)\n *  }\n *\n * parser (grammar) errors will also provide these additional members:\n *\n *  {\n *    expected:    (array describing the set of expected tokens;\n *                  may be UNDEFINED when we cannot easily produce such a set)\n *    state:       (integer (or array when the table includes grammar collisions);\n *                  represents the current internal state of the parser kernel.\n *                  can, for example, be used to pass to the `collect_expected_token_set()`\n *                  API to obtain the expected token set)\n *    action:      (integer; represents the current internal action which will be executed)\n *    new_state:   (integer; represents the next/planned internal state, once the current\n *                  action has executed)\n *    recoverable: (boolean: TRUE when the parser MAY have an error recovery rule\n *                  available for this particular error)\n *    state_stack: (array: the current parser LALR/LR internal state stack; this can be used,\n *                  for instance, for advanced error analysis and reporting)\n *    value_stack: (array: the current parser LALR/LR internal `$$` value stack; this can be used,\n *                  for instance, for advanced error analysis and reporting)\n *    location_stack: (array: the current parser LALR/LR internal location stack; this can be used,\n *                  for instance, for advanced error analysis and reporting)\n *    yy:          (object: the current parser internal \"shared state\" `yy`\n *                  as is also available in the rule actions; this can be used,\n *                  for instance, for advanced error analysis and reporting)\n *    lexer:       (reference to the current lexer instance used by the parser)\n *    parser:      (reference to the current parser instance)\n *  }\n *\n * while `this` will reference the current parser instance.\n *\n * When `parseError` is invoked by the lexer, `this` will still reference the related *parser*\n * instance, while these additional `hash` fields will also be provided:\n *\n *  {\n *    lexer:       (reference to the current lexer instance which reported the error)\n *  }\n *\n * When `parseError` is invoked by the parser due to a **JavaScript exception** being fired\n * from either the parser or lexer, `this` will still reference the related *parser*\n * instance, while these additional `hash` fields will also be provided:\n *\n *  {\n *    exception:   (reference to the exception thrown)\n *  }\n *\n * Please do note that in the latter situation, the `expected` field will be omitted as\n * this type of failure is assumed not to be due to *parse errors* but rather due to user\n * action code in either parser or lexer failing unexpectedly.\n *\n * ---\n *\n * You can specify parser options by setting / modifying the `.yy` object of your Parser instance.\n * These options are available:\n *\n * ### options which are global for all parser instances\n *\n *  Parser.pre_parse: function(yy)\n *                 optional: you can specify a pre_parse() function in the chunk following\n *                 the grammar, i.e. after the last `%%`.\n *  Parser.post_parse: function(yy, retval, parseInfo) { return retval; }\n *                 optional: you can specify a post_parse() function in the chunk following\n *                 the grammar, i.e. after the last `%%`. When it does not return any value,\n *                 the parser will return the original `retval`.\n *\n * ### options which can be set up per parser instance\n *\n *  yy: {\n *      pre_parse:  function(yy)\n *                 optional: is invoked before the parse cycle starts (and before the first\n *                 invocation of `lex()`) but immediately after the invocation of\n *                 `parser.pre_parse()`).\n *      post_parse: function(yy, retval, parseInfo) { return retval; }\n *                 optional: is invoked when the parse terminates due to success ('accept')\n *                 or failure (even when exceptions are thrown).\n *                 `retval` contains the return value to be produced by `Parser.parse()`;\n *                 this function can override the return value by returning another.\n *                 When it does not return any value, the parser will return the original\n *                 `retval`.\n *                 This function is invoked immediately before `parser.post_parse()`.\n *\n *      parseError: function(str, hash, ExceptionClass)\n *                 optional: overrides the default `parseError` function.\n *      quoteName: function(name),\n *                 optional: overrides the default `quoteName` function.\n *  }\n *\n *  parser.lexer.options: {\n *      pre_lex:  function()\n *                 optional: is invoked before the lexer is invoked to produce another token.\n *                 `this` refers to the Lexer object.\n *      post_lex: function(token) { return token; }\n *                 optional: is invoked when the lexer has produced a token `token`;\n *                 this function can override the returned token value by returning another.\n *                 When it does not return any (truthy) value, the lexer will return\n *                 the original `token`.\n *                 `this` refers to the Lexer object.\n *\n *      ranges: boolean\n *                 optional: `true` ==> token location info will include a .range[] member.\n *      flex: boolean\n *                 optional: `true` ==> flex-like lexing behaviour where the rules are tested\n *                 exhaustively to find the longest match.\n *      backtrack_lexer: boolean\n *                 optional: `true` ==> lexer regexes are tested in order and for invoked;\n *                 the lexer terminates the scan when a token is returned by the action code.\n *      xregexp: boolean\n *                 optional: `true` ==> lexer rule regexes are \"extended regex format\" requiring the\n *                 `XRegExp` library. When this `%option` has not been specified at compile time, all lexer\n *                 rule regexes have been written as standard JavaScript RegExp expressions.\n *  }\n */\n\n        \n    \n            var parser = (function () {\n\n\n// See also:\n// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508\n// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility\n// with userland code which might access the derived class in a 'classic' way.\nfunction JisonParserError(msg, hash) {\n    Object.defineProperty(this, 'name', {\n        enumerable: false,\n        writable: false,\n        value: 'JisonParserError'\n    });\n\n    if (msg == null) msg = '???';\n\n    Object.defineProperty(this, 'message', {\n        enumerable: false,\n        writable: true,\n        value: msg\n    });\n\n    this.hash = hash;\n\n    var stacktrace;\n    if (hash && hash.exception instanceof Error) {\n        var ex2 = hash.exception;\n        this.message = ex2.message || msg;\n        stacktrace = ex2.stack;\n    }\n    if (!stacktrace) {\n        if (Error.hasOwnProperty('captureStackTrace')) {        // V8/Chrome engine\n            Error.captureStackTrace(this, this.constructor);\n        } else {\n            stacktrace = (new Error(msg)).stack;\n        }\n    }\n    if (stacktrace) {\n        Object.defineProperty(this, 'stack', {\n            enumerable: false,\n            writable: false,\n            value: stacktrace\n        });\n    }\n}\n\nif (typeof Object.setPrototypeOf === 'function') {\n    Object.setPrototypeOf(JisonParserError.prototype, Error.prototype);\n} else {\n    JisonParserError.prototype = Object.create(Error.prototype);\n}\nJisonParserError.prototype.constructor = JisonParserError;\nJisonParserError.prototype.name = 'JisonParserError';\n\n\n\n\n        // helper: reconstruct the productions[] table\n        function bp(s) {\n            var rv = [];\n            var p = s.pop;\n            var r = s.rule;\n            for (var i = 0, l = p.length; i < l; i++) {\n                rv.push([\n                    p[i],\n                    r[i]\n                ]);\n            }\n            return rv;\n        }\n    \n\n\n        // helper: reconstruct the defaultActions[] table\n        function bda(s) {\n            var rv = {};\n            var d = s.idx;\n            var g = s.goto;\n            for (var i = 0, l = d.length; i < l; i++) {\n                var j = d[i];\n                rv[j] = g[i];\n            }\n            return rv;\n        }\n    \n\n\n        // helper: reconstruct the 'goto' table\n        function bt(s) {\n            var rv = [];\n            var d = s.len;\n            var y = s.symbol;\n            var t = s.type;\n            var a = s.state;\n            var m = s.mode;\n            var g = s.goto;\n            for (var i = 0, l = d.length; i < l; i++) {\n                var n = d[i];\n                var q = {};\n                for (var j = 0; j < n; j++) {\n                    var z = y.shift();\n                    switch (t.shift()) {\n                    case 2:\n                        q[z] = [\n                            m.shift(),\n                            g.shift()\n                        ];\n                        break;\n\n                    case 0:\n                        q[z] = a.shift();\n                        break;\n\n                    default:\n                        // type === 1: accept\n                        q[z] = [\n                            3\n                        ];\n                    }\n                }\n                rv.push(q);\n            }\n            return rv;\n        }\n    \n\n\n        // helper: runlength encoding with increment step: code, length: step (default step = 0)\n        // `this` references an array\n        function s(c, l, a) {\n            a = a || 0;\n            for (var i = 0; i < l; i++) {\n                this.push(c);\n                c += a;\n            }\n        }\n\n        // helper: duplicate sequence from *relative* offset and length.\n        // `this` references an array\n        function c(i, l) {\n            i = this.length - i;\n            for (l += i; i < l; i++) {\n                this.push(this[i]);\n            }\n        }\n\n        // helper: unpack an array using helpers and data, all passed in an array argument 'a'.\n        function u(a) {\n            var rv = [];\n            for (var i = 0, l = a.length; i < l; i++) {\n                var e = a[i];\n                // Is this entry a helper function?\n                if (typeof e === 'function') {\n                    i++;\n                    e.apply(rv, a[i]);\n                } else {\n                    rv.push(e);\n                }\n            }\n            return rv;\n        }\n    \n\nvar parser = {\n    // Code Generator Information Report\n    // ---------------------------------\n    //\n    // Options:\n    //\n    //   default action mode: ............. [\"classic\",\"merge\"]\n    //   test-compile action mode: ........ \"parser:*,lexer:*\"\n    //   try..catch: ...................... true\n    //   default resolve on conflict: ..... true\n    //   on-demand look-ahead: ............ false\n    //   error recovery token skip maximum: 3\n    //   yyerror in parse actions is: ..... NOT recoverable,\n    //   yyerror in lexer actions and other non-fatal lexer are:\n    //   .................................. NOT recoverable,\n    //   debug grammar/output: ............ false\n    //   has partial LR conflict upgrade:   true\n    //   rudimentary token-stack support:   false\n    //   parser table compression mode: ... 2\n    //   export debug tables: ............. false\n    //   export *all* tables: ............. false\n    //   module type: ..................... commonjs\n    //   parser engine type: .............. lalr\n    //   output main() in the module: ..... true\n    //   has user-specified main(): ....... false\n    //   has user-specified require()/import modules for main():\n    //   .................................. false\n    //   number of expected conflicts: .... 0\n    //\n    //\n    // Parser Analysis flags:\n    //\n    //   no significant actions (parser is a language matcher only):\n    //   .................................. false\n    //   uses yyleng: ..................... false\n    //   uses yylineno: ................... false\n    //   uses yytext: ..................... false\n    //   uses yylloc: ..................... false\n    //   uses ParseError API: ............. false\n    //   uses YYERROR: .................... false\n    //   uses YYRECOVERING: ............... false\n    //   uses YYERROK: .................... false\n    //   uses YYCLEARIN: .................. false\n    //   tracks rule values: .............. true\n    //   assigns rule values: ............. true\n    //   uses location tracking: .......... false\n    //   assigns location: ................ false\n    //   uses yystack: .................... false\n    //   uses yysstack: ................... false\n    //   uses yysp: ....................... true\n    //   uses yyrulelength: ............... false\n    //   uses yyMergeLocationInfo API: .... false\n    //   has error recovery: .............. false\n    //   has error reporting: ............. false\n    //\n    // --------- END OF REPORT -----------\n\ntrace: function no_op_trace() { },\nJisonParserError: JisonParserError,\nyy: {},\noptions: {\n  type: \"lalr\",\n  hasPartialLrUpgradeOnConflict: true,\n  errorRecoveryTokenDiscardCount: 3\n},\nsymbols_: {\n  \"$accept\": 0,\n  \"$end\": 1,\n  \"ADD\": 3,\n  \"ANGLE\": 14,\n  \"CHS\": 20,\n  \"CSS_VAR\": 12,\n  \"DIV\": 6,\n  \"EMS\": 18,\n  \"EOF\": 1,\n  \"EXS\": 19,\n  \"FREQ\": 16,\n  \"LENGTH\": 13,\n  \"LPAREN\": 7,\n  \"MUL\": 5,\n  \"NESTED_CALC\": 9,\n  \"NUMBER\": 11,\n  \"PERCENTAGE\": 26,\n  \"PREFIX\": 10,\n  \"REMS\": 21,\n  \"RES\": 17,\n  \"RPAREN\": 8,\n  \"SUB\": 4,\n  \"TIME\": 15,\n  \"VHS\": 22,\n  \"VMAXS\": 25,\n  \"VMINS\": 24,\n  \"VWS\": 23,\n  \"css_value\": 31,\n  \"css_variable\": 30,\n  \"error\": 2,\n  \"expression\": 27,\n  \"math_expression\": 28,\n  \"value\": 29\n},\nterminals_: {\n  1: \"EOF\",\n  2: \"error\",\n  3: \"ADD\",\n  4: \"SUB\",\n  5: \"MUL\",\n  6: \"DIV\",\n  7: \"LPAREN\",\n  8: \"RPAREN\",\n  9: \"NESTED_CALC\",\n  10: \"PREFIX\",\n  11: \"NUMBER\",\n  12: \"CSS_VAR\",\n  13: \"LENGTH\",\n  14: \"ANGLE\",\n  15: \"TIME\",\n  16: \"FREQ\",\n  17: \"RES\",\n  18: \"EMS\",\n  19: \"EXS\",\n  20: \"CHS\",\n  21: \"REMS\",\n  22: \"VHS\",\n  23: \"VWS\",\n  24: \"VMINS\",\n  25: \"VMAXS\",\n  26: \"PERCENTAGE\"\n},\nTERROR: 2,\n    EOF: 1,\n\n    // internals: defined here so the object *structure* doesn't get modified by parse() et al,\n    // thus helping JIT compilers like Chrome V8.\n    originalQuoteName: null,\n    originalParseError: null,\n    cleanupAfterParse: null,\n    constructParseErrorInfo: null,\n    yyMergeLocationInfo: null,\n\n    __reentrant_call_depth: 0,      // INTERNAL USE ONLY\n    __error_infos: [],              // INTERNAL USE ONLY: the set of parseErrorInfo objects created since the last cleanup\n    __error_recovery_infos: [],     // INTERNAL USE ONLY: the set of parseErrorInfo objects created since the last cleanup\n\n    // APIs which will be set up depending on user action code analysis:\n    //yyRecovering: 0,\n    //yyErrOk: 0,\n    //yyClearIn: 0,\n\n    // Helper APIs\n    // -----------\n\n    // Helper function which can be overridden by user code later on: put suitable quotes around\n    // literal IDs in a description string.\n    quoteName: function parser_quoteName(id_str) {\n        return '\"' + id_str + '\"';\n    },\n\n    // Return the name of the given symbol (terminal or non-terminal) as a string, when available.\n    //\n    // Return NULL when the symbol is unknown to the parser.\n    getSymbolName: function parser_getSymbolName(symbol) {\n        if (this.terminals_[symbol]) {\n            return this.terminals_[symbol];\n        }\n\n        // Otherwise... this might refer to a RULE token i.e. a non-terminal: see if we can dig that one up.\n        //\n        // An example of this may be where a rule's action code contains a call like this:\n        //\n        //      parser.getSymbolName(#$)\n        //\n        // to obtain a human-readable name of the current grammar rule.\n        var s = this.symbols_;\n        for (var key in s) {\n            if (s[key] === symbol) {\n                return key;\n            }\n        }\n        return null;\n    },\n\n    // Return a more-or-less human-readable description of the given symbol, when available,\n    // or the symbol itself, serving as its own 'description' for lack of something better to serve up.\n    //\n    // Return NULL when the symbol is unknown to the parser.\n    describeSymbol: function parser_describeSymbol(symbol) {\n        if (symbol !== this.EOF && this.terminal_descriptions_ && this.terminal_descriptions_[symbol]) {\n            return this.terminal_descriptions_[symbol];\n        }\n        else if (symbol === this.EOF) {\n            return 'end of input';\n        }\n        var id = this.getSymbolName(symbol);\n        if (id) {\n            return this.quoteName(id);\n        }\n        return null;\n    },\n\n    // Produce a (more or less) human-readable list of expected tokens at the point of failure.\n    //\n    // The produced list may contain token or token set descriptions instead of the tokens\n    // themselves to help turning this output into something that easier to read by humans\n    // unless `do_not_describe` parameter is set, in which case a list of the raw, *numeric*,\n    // expected terminals and nonterminals is produced.\n    //\n    // The returned list (array) will not contain any duplicate entries.\n    collect_expected_token_set: function parser_collect_expected_token_set(state, do_not_describe) {\n        var TERROR = this.TERROR;\n        var tokenset = [];\n        var check = {};\n        // Has this (error?) state been outfitted with a custom expectations description text for human consumption?\n        // If so, use that one instead of the less palatable token set.\n        if (!do_not_describe && this.state_descriptions_ && this.state_descriptions_[state]) {\n            return [\n                this.state_descriptions_[state]\n            ];\n        }\n        for (var p in this.table[state]) {\n            p = +p;\n            if (p !== TERROR) {\n                var d = do_not_describe ? p : this.describeSymbol(p);\n                if (d && !check[d]) {\n                    tokenset.push(d);\n                    check[d] = true;        // Mark this token description as already mentioned to prevent outputting duplicate entries.\n                }\n            }\n        }\n        return tokenset;\n    },\nproductions_: bp({\n  pop: u([\n  27,\n  s,\n  [28, 10],\n  29,\n  29,\n  30,\n  s,\n  [31, 15]\n]),\n  rule: u([\n  2,\n  s,\n  [3, 5],\n  4,\n  7,\n  s,\n  [1, 4],\n  2,\n  s,\n  [1, 15],\n  2\n])\n}),\nperformAction: function parser__PerformAction(yystate /* action[1] */, yysp, yyvstack) {\n\n          /* this == yyval */\n\n          // the JS engine itself can go and remove these statements when `yy` turns out to be unused in any action code!\n          var yy = this.yy;\n          var yyparser = yy.parser;\n          var yylexer = yy.lexer;\n\n          \n\n          switch (yystate) {\ncase 0:\n    /*! Production::    $accept : expression $end */\n\n    // default action (generated by JISON mode classic/merge :: 1,VT,VA,-,-,-,-,-,-):\n    this.$ = yyvstack[yysp - 1];\n    // END of default action (generated by JISON mode classic/merge :: 1,VT,VA,-,-,-,-,-,-)\n    break;\n\ncase 1:\n    /*! Production::    expression : math_expression EOF */\n\n    // default action (generated by JISON mode classic/merge :: 2,VT,VA,-,-,-,-,-,-):\n    this.$ = yyvstack[yysp - 1];\n    // END of default action (generated by JISON mode classic/merge :: 2,VT,VA,-,-,-,-,-,-)\n    \n    \n    return yyvstack[yysp - 1];\n    break;\n\ncase 2:\n    /*! Production::    math_expression : math_expression ADD math_expression */\ncase 3:\n    /*! Production::    math_expression : math_expression SUB math_expression */\ncase 4:\n    /*! Production::    math_expression : math_expression MUL math_expression */\ncase 5:\n    /*! Production::    math_expression : math_expression DIV math_expression */\n\n    this.$ = { type: 'MathExpression', operator: yyvstack[yysp - 1], left: yyvstack[yysp - 2], right: yyvstack[yysp] };\n    break;\n\ncase 6:\n    /*! Production::    math_expression : LPAREN math_expression RPAREN */\ncase 7:\n    /*! Production::    math_expression : NESTED_CALC LPAREN math_expression RPAREN */\ncase 8:\n    /*! Production::    math_expression : SUB PREFIX SUB NESTED_CALC LPAREN math_expression RPAREN */\n\n    this.$ = yyvstack[yysp - 1];\n    break;\n\ncase 9:\n    /*! Production::    math_expression : css_variable */\ncase 10:\n    /*! Production::    math_expression : css_value */\ncase 11:\n    /*! Production::    math_expression : value */\n\n    this.$ = yyvstack[yysp];\n    break;\n\ncase 12:\n    /*! Production::    value : NUMBER */\n\n    this.$ = { type: 'Value', value: parseFloat(yyvstack[yysp]) };\n    break;\n\ncase 13:\n    /*! Production::    value : SUB NUMBER */\n\n    this.$ = { type: 'Value', value: parseFloat(yyvstack[yysp]) * -1 };\n    break;\n\ncase 14:\n    /*! Production::    css_variable : CSS_VAR */\n\n    this.$ = { type: 'CssVariable', value: yyvstack[yysp] };\n    break;\n\ncase 15:\n    /*! Production::    css_value : LENGTH */\n\n    this.$ = { type: 'LengthValue', value: parseFloat(yyvstack[yysp]), unit: /[a-z]+/.exec(yyvstack[yysp])[0] };\n    break;\n\ncase 16:\n    /*! Production::    css_value : ANGLE */\n\n    this.$ = { type: 'AngleValue', value: parseFloat(yyvstack[yysp]), unit: /[a-z]+/.exec(yyvstack[yysp])[0] };\n    break;\n\ncase 17:\n    /*! Production::    css_value : TIME */\n\n    this.$ = { type: 'TimeValue', value: parseFloat(yyvstack[yysp]), unit: /[a-z]+/.exec(yyvstack[yysp])[0] };\n    break;\n\ncase 18:\n    /*! Production::    css_value : FREQ */\n\n    this.$ = { type: 'FrequencyValue', value: parseFloat(yyvstack[yysp]), unit: /[a-z]+/.exec(yyvstack[yysp])[0] };\n    break;\n\ncase 19:\n    /*! Production::    css_value : RES */\n\n    this.$ = { type: 'ResolutionValue', value: parseFloat(yyvstack[yysp]), unit: /[a-z]+/.exec(yyvstack[yysp])[0] };\n    break;\n\ncase 20:\n    /*! Production::    css_value : EMS */\n\n    this.$ = { type: 'EmValue', value: parseFloat(yyvstack[yysp]), unit: 'em' };\n    break;\n\ncase 21:\n    /*! Production::    css_value : EXS */\n\n    this.$ = { type: 'ExValue', value: parseFloat(yyvstack[yysp]), unit: 'ex' };\n    break;\n\ncase 22:\n    /*! Production::    css_value : CHS */\n\n    this.$ = { type: 'ChValue', value: parseFloat(yyvstack[yysp]), unit: 'ch' };\n    break;\n\ncase 23:\n    /*! Production::    css_value : REMS */\n\n    this.$ = { type: 'RemValue', value: parseFloat(yyvstack[yysp]), unit: 'rem' };\n    break;\n\ncase 24:\n    /*! Production::    css_value : VHS */\n\n    this.$ = { type: 'VhValue', value: parseFloat(yyvstack[yysp]), unit: 'vh' };\n    break;\n\ncase 25:\n    /*! Production::    css_value : VWS */\n\n    this.$ = { type: 'VwValue', value: parseFloat(yyvstack[yysp]), unit: 'vw' };\n    break;\n\ncase 26:\n    /*! Production::    css_value : VMINS */\n\n    this.$ = { type: 'VminValue', value: parseFloat(yyvstack[yysp]), unit: 'vmin' };\n    break;\n\ncase 27:\n    /*! Production::    css_value : VMAXS */\n\n    this.$ = { type: 'VmaxValue', value: parseFloat(yyvstack[yysp]), unit: 'vmax' };\n    break;\n\ncase 28:\n    /*! Production::    css_value : PERCENTAGE */\n\n    this.$ = { type: 'PercentageValue', value: parseFloat(yyvstack[yysp]), unit: '%' };\n    break;\n\ncase 29:\n    /*! Production::    css_value : SUB css_value */\n\n    var prev = yyvstack[yysp]; prev.value *= -1; this.$ = prev;\n    break;\n\n}\n},\ntable: bt({\n  len: u([\n  24,\n  1,\n  5,\n  23,\n  1,\n  18,\n  s,\n  [0, 20],\n  s,\n  [23, 4],\n  c,\n  [28, 3],\n  0,\n  0,\n  16,\n  6,\n  6,\n  s,\n  [0, 3],\n  5,\n  1,\n  0,\n  1,\n  23,\n  5,\n  0\n]),\n  symbol: u([\n  4,\n  7,\n  9,\n  s,\n  [11, 21, 1],\n  1,\n  1,\n  s,\n  [3, 4, 1],\n  c,\n  [30, 19],\n  c,\n  [29, 4],\n  7,\n  4,\n  10,\n  11,\n  c,\n  [22, 14],\n  31,\n  c,\n  [42, 23],\n  c,\n  [23, 69],\n  c,\n  [138, 4],\n  8,\n  c,\n  [51, 24],\n  4,\n  c,\n  [137, 15],\n  c,\n  [184, 5],\n  8,\n  c,\n  [6, 6],\n  c,\n  [5, 5],\n  9,\n  7,\n  c,\n  [87, 28]\n]),\n  type: u([\n  s,\n  [2, 19],\n  s,\n  [0, 5],\n  1,\n  s,\n  [2, 24],\n  s,\n  [0, 4],\n  c,\n  [22, 19],\n  c,\n  [42, 41],\n  c,\n  [23, 70],\n  c,\n  [28, 25],\n  c,\n  [45, 25],\n  c,\n  [59, 23]\n]),\n  state: u([\n  1,\n  2,\n  8,\n  6,\n  7,\n  30,\n  c,\n  [4, 3],\n  33,\n  36,\n  c,\n  [5, 3],\n  37,\n  c,\n  [4, 3],\n  38,\n  c,\n  [4, 3],\n  39,\n  c,\n  [4, 3],\n  41,\n  c,\n  [21, 4],\n  46,\n  c,\n  [5, 3]\n]),\n  mode: u([\n  s,\n  [1, 177],\n  s,\n  [2, 3],\n  c,\n  [5, 5],\n  c,\n  [6, 4],\n  s,\n  [1, 31]\n]),\n  goto: u([\n  5,\n  3,\n  4,\n  24,\n  s,\n  [9, 15, 1],\n  s,\n  [25, 5, 1],\n  c,\n  [24, 19],\n  31,\n  35,\n  32,\n  34,\n  c,\n  [18, 14],\n  c,\n  [37, 19],\n  c,\n  [19, 57],\n  c,\n  [117, 4],\n  40,\n  c,\n  [24, 19],\n  42,\n  35,\n  c,\n  [16, 14],\n  s,\n  [2, 3],\n  28,\n  29,\n  2,\n  s,\n  [3, 3],\n  28,\n  29,\n  3,\n  c,\n  [52, 4],\n  43,\n  44,\n  45,\n  c,\n  [78, 23],\n  47\n])\n}),\ndefaultActions: bda({\n  idx: u([\n  s,\n  [6, 20, 1],\n  33,\n  34,\n  38,\n  39,\n  40,\n  43,\n  47\n]),\n  goto: u([\n  9,\n  10,\n  11,\n  s,\n  [14, 15, 1],\n  12,\n  1,\n  29,\n  13,\n  s,\n  [4, 5, 1]\n])\n}),\nparseError: function parseError(str, hash, ExceptionClass) {\n    if (hash.recoverable) {\n        if (typeof this.trace === 'function') {\n            this.trace(str);\n        }\n        hash.destroy();             // destroy... well, *almost*!\n    } else {\n        if (typeof this.trace === 'function') {\n            this.trace(str);\n        }\n        if (!ExceptionClass) {\n            ExceptionClass = this.JisonParserError;\n        }\n        throw new ExceptionClass(str, hash);\n    }\n},\nparse: function parse(input) {\n    var self = this;\n    var stack = new Array(128);         // token stack: stores token which leads to state at the same index (column storage)\n    var sstack = new Array(128);        // state stack: stores states (column storage)\n\n    var vstack = new Array(128);        // semantic value stack\n\n    var table = this.table;\n    var sp = 0;                         // 'stack pointer': index into the stacks\n\n\n    \n\n\n    var symbol = 0;\n\n\n\n    var TERROR = this.TERROR;\n    var EOF = this.EOF;\n    var ERROR_RECOVERY_TOKEN_DISCARD_COUNT = (this.options.errorRecoveryTokenDiscardCount | 0) || 3;\n    var NO_ACTION = [0, 48 /* === table.length :: ensures that anyone using this new state will fail dramatically! */];\n\n    var lexer;\n    if (this.__lexer__) {\n        lexer = this.__lexer__;\n    } else {\n        lexer = this.__lexer__ = Object.create(this.lexer);\n    }\n\n    var sharedState_yy = {\n        parseError: undefined,\n        quoteName: undefined,\n        lexer: undefined,\n        parser: undefined,\n        pre_parse: undefined,\n        post_parse: undefined,\n        pre_lex: undefined,\n        post_lex: undefined      // WARNING: must be written this way for the code expanders to work correctly in both ES5 and ES6 modes!\n    };\n\n    var ASSERT;\n    if (typeof assert !== 'function') {\n        ASSERT = function JisonAssert(cond, msg) {\n            if (!cond) {\n                throw new Error('assertion failed: ' + (msg || '***'));\n            }\n        };\n    } else {\n        ASSERT = assert;\n    }\n\n    this.yyGetSharedState = function yyGetSharedState() {\n        return sharedState_yy;\n    };\n\n\n\n\n\n\n\n\n    function shallow_copy_noclobber(dst, src) {\n        for (var k in src) {\n            if (typeof dst[k] === 'undefined' && Object.prototype.hasOwnProperty.call(src, k)) {\n                dst[k] = src[k];\n            }\n        }\n    }\n\n    // copy state\n    shallow_copy_noclobber(sharedState_yy, this.yy);\n\n    sharedState_yy.lexer = lexer;\n    sharedState_yy.parser = this;\n\n\n\n\n\n\n    // Does the shared state override the default `parseError` that already comes with this instance?\n    if (typeof sharedState_yy.parseError === 'function') {\n        this.parseError = function parseErrorAlt(str, hash, ExceptionClass) {\n            if (!ExceptionClass) {\n                ExceptionClass = this.JisonParserError;\n            }\n            return sharedState_yy.parseError.call(this, str, hash, ExceptionClass);\n        };\n    } else {\n        this.parseError = this.originalParseError;\n    }\n\n    // Does the shared state override the default `quoteName` that already comes with this instance?\n    if (typeof sharedState_yy.quoteName === 'function') {\n        this.quoteName = function quoteNameAlt(id_str) {\n            return sharedState_yy.quoteName.call(this, id_str);\n        };\n    } else {\n        this.quoteName = this.originalQuoteName;\n    }\n\n    // set up the cleanup function; make it an API so that external code can re-use this one in case of\n    // calamities or when the `%options no-try-catch` option has been specified for the grammar, in which\n    // case this parse() API method doesn't come with a `finally { ... }` block any more!\n    //\n    // NOTE: as this API uses parse() as a closure, it MUST be set again on every parse() invocation,\n    //       or else your `sharedState`, etc. references will be *wrong*!\n    this.cleanupAfterParse = function parser_cleanupAfterParse(resultValue, invoke_post_methods, do_not_nuke_errorinfos) {\n        var rv;\n\n        if (invoke_post_methods) {\n            var hash;\n\n            if (sharedState_yy.post_parse || this.post_parse) {\n                // create an error hash info instance: we re-use this API in a **non-error situation**\n                // as this one delivers all parser internals ready for access by userland code.\n                hash = this.constructParseErrorInfo(null /* no error! */, null /* no exception! */, null, false);\n            }\n\n            if (sharedState_yy.post_parse) {\n                rv = sharedState_yy.post_parse.call(this, sharedState_yy, resultValue, hash);\n                if (typeof rv !== 'undefined') resultValue = rv;\n            }\n            if (this.post_parse) {\n                rv = this.post_parse.call(this, sharedState_yy, resultValue, hash);\n                if (typeof rv !== 'undefined') resultValue = rv;\n            }\n\n            // cleanup:\n            if (hash && hash.destroy) {\n                hash.destroy();\n            }\n        }\n\n        if (this.__reentrant_call_depth > 1) return resultValue;        // do not (yet) kill the sharedState when this is a reentrant run.\n\n        // clean up the lingering lexer structures as well:\n        if (lexer.cleanupAfterLex) {\n            lexer.cleanupAfterLex(do_not_nuke_errorinfos);\n        }\n\n        // prevent lingering circular references from causing memory leaks:\n        if (sharedState_yy) {\n            sharedState_yy.lexer = undefined;\n            sharedState_yy.parser = undefined;\n            if (lexer.yy === sharedState_yy) {\n                lexer.yy = undefined;\n            }\n        }\n        sharedState_yy = undefined;\n        this.parseError = this.originalParseError;\n        this.quoteName = this.originalQuoteName;\n\n        // nuke the vstack[] array at least as that one will still reference obsoleted user values.\n        // To be safe, we nuke the other internal stack columns as well...\n        stack.length = 0;               // fastest way to nuke an array without overly bothering the GC\n        sstack.length = 0;\n\n        vstack.length = 0;\n        sp = 0;\n\n        // nuke the error hash info instances created during this run.\n        // Userland code must COPY any data/references\n        // in the error hash instance(s) it is more permanently interested in.\n        if (!do_not_nuke_errorinfos) {\n            for (var i = this.__error_infos.length - 1; i >= 0; i--) {\n                var el = this.__error_infos[i];\n                if (el && typeof el.destroy === 'function') {\n                    el.destroy();\n                }\n            }\n            this.__error_infos.length = 0;\n\n\n        }\n\n        return resultValue;\n    };\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n    // NOTE: as this API uses parse() as a closure, it MUST be set again on every parse() invocation,\n    //       or else your `lexer`, `sharedState`, etc. references will be *wrong*!\n    this.constructParseErrorInfo = function parser_constructParseErrorInfo(msg, ex, expected, recoverable) {\n        var pei = {\n            errStr: msg,\n            exception: ex,\n            text: lexer.match,\n            value: lexer.yytext,\n            token: this.describeSymbol(symbol) || symbol,\n            token_id: symbol,\n            line: lexer.yylineno,\n\n            expected: expected,\n            recoverable: recoverable,\n            state: state,\n            action: action,\n            new_state: newState,\n            symbol_stack: stack,\n            state_stack: sstack,\n            value_stack: vstack,\n\n            stack_pointer: sp,\n            yy: sharedState_yy,\n            lexer: lexer,\n            parser: this,\n\n            // and make sure the error info doesn't stay due to potential\n            // ref cycle via userland code manipulations.\n            // These would otherwise all be memory leak opportunities!\n            //\n            // Note that only array and object references are nuked as those\n            // constitute the set of elements which can produce a cyclic ref.\n            // The rest of the members is kept intact as they are harmless.\n            destroy: function destructParseErrorInfo() {\n                // remove cyclic references added to error info:\n                // info.yy = null;\n                // info.lexer = null;\n                // info.value = null;\n                // info.value_stack = null;\n                // ...\n                var rec = !!this.recoverable;\n                for (var key in this) {\n                    if (this.hasOwnProperty(key) && typeof key === 'object') {\n                        this[key] = undefined;\n                    }\n                }\n                this.recoverable = rec;\n            }\n        };\n        // track this instance so we can `destroy()` it once we deem it superfluous and ready for garbage collection!\n        this.__error_infos.push(pei);\n        return pei;\n    };\n\n\n\n\n\n\n\n\n\n\n\n\n\n    function getNonTerminalFromCode(symbol) {\n        var tokenName = self.getSymbolName(symbol);\n        if (!tokenName) {\n            tokenName = symbol;\n        }\n        return tokenName;\n    }\n\n\n    function stdLex() {\n        var token = lexer.lex();\n        // if token isn't its numeric value, convert\n        if (typeof token !== 'number') {\n            token = self.symbols_[token] || token;\n        }\n\n        return token || EOF;\n    }\n\n    function fastLex() {\n        var token = lexer.fastLex();\n        // if token isn't its numeric value, convert\n        if (typeof token !== 'number') {\n            token = self.symbols_[token] || token;\n        }\n\n        return token || EOF;\n    }\n\n    var lex = stdLex;\n\n\n    var state, action, r, t;\n    var yyval = {\n        $: true,\n        _$: undefined,\n        yy: sharedState_yy\n    };\n    var p;\n    var yyrulelen;\n    var this_production;\n    var newState;\n    var retval = false;\n\n\n    try {\n        this.__reentrant_call_depth++;\n\n        lexer.setInput(input, sharedState_yy);\n\n        // NOTE: we *assume* no lexer pre/post handlers are set up *after* \n        // this initial `setInput()` call: hence we can now check and decide\n        // whether we'll go with the standard, slower, lex() API or the\n        // `fast_lex()` one:\n        if (typeof lexer.canIUse === 'function') {\n            var lexerInfo = lexer.canIUse();\n            if (lexerInfo.fastLex && typeof fastLex === 'function') {\n                lex = fastLex;\n            }\n        } \n\n\n\n        vstack[sp] = null;\n        sstack[sp] = 0;\n        stack[sp] = 0;\n        ++sp;\n\n\n\n\n\n        if (this.pre_parse) {\n            this.pre_parse.call(this, sharedState_yy);\n        }\n        if (sharedState_yy.pre_parse) {\n            sharedState_yy.pre_parse.call(this, sharedState_yy);\n        }\n\n        newState = sstack[sp - 1];\n        for (;;) {\n            // retrieve state number from top of stack\n            state = newState;               // sstack[sp - 1];\n\n            // use default actions if available\n            if (this.defaultActions[state]) {\n                action = 2;\n                newState = this.defaultActions[state];\n            } else {\n                // The single `==` condition below covers both these `===` comparisons in a single\n                // operation:\n                //\n                //     if (symbol === null || typeof symbol === 'undefined') ...\n                if (!symbol) {\n                    symbol = lex();\n                }\n                // read action for current state and first input\n                t = (table[state] && table[state][symbol]) || NO_ACTION;\n                newState = t[1];\n                action = t[0];\n\n\n\n\n\n\n\n\n\n\n\n                // handle parse error\n                if (!action) {\n                    var errStr;\n                    var errSymbolDescr = (this.describeSymbol(symbol) || symbol);\n                    var expected = this.collect_expected_token_set(state);\n\n                    // Report error\n                    if (typeof lexer.yylineno === 'number') {\n                        errStr = 'Parse error on line ' + (lexer.yylineno + 1) + ': ';\n                    } else {\n                        errStr = 'Parse error: ';\n                    }\n                    if (typeof lexer.showPosition === 'function') {\n                        errStr += '\\n' + lexer.showPosition(79 - 10, 10) + '\\n';\n                    }\n                    if (expected.length) {\n                        errStr += 'Expecting ' + expected.join(', ') + ', got unexpected ' + errSymbolDescr;\n                    } else {\n                        errStr += 'Unexpected ' + errSymbolDescr;\n                    }\n                    // we cannot recover from the error!\n                    p = this.constructParseErrorInfo(errStr, null, expected, false);\n                    r = this.parseError(p.errStr, p, this.JisonParserError);\n                    if (typeof r !== 'undefined') {\n                        retval = r;\n                    }\n                    break;\n                }\n\n\n            }\n\n\n\n\n\n\n\n\n\n\n            switch (action) {\n            // catch misc. parse failures:\n            default:\n                // this shouldn't happen, unless resolve defaults are off\n                if (action instanceof Array) {\n                    p = this.constructParseErrorInfo('Parse Error: multiple actions possible at state: ' + state + ', token: ' + symbol, null, null, false);\n                    r = this.parseError(p.errStr, p, this.JisonParserError);\n                    if (typeof r !== 'undefined') {\n                        retval = r;\n                    }\n                    break;\n                }\n                // Another case of better safe than sorry: in case state transitions come out of another error recovery process\n                // or a buggy LUT (LookUp Table):\n                p = this.constructParseErrorInfo('Parsing halted. No viable error recovery approach available due to internal system failure.', null, null, false);\n                r = this.parseError(p.errStr, p, this.JisonParserError);\n                if (typeof r !== 'undefined') {\n                    retval = r;\n                }\n                break;\n\n            // shift:\n            case 1:\n                stack[sp] = symbol;\n                vstack[sp] = lexer.yytext;\n\n                sstack[sp] = newState; // push state\n\n                ++sp;\n                symbol = 0;\n\n\n\n\n                // Pick up the lexer details for the current symbol as that one is not 'look-ahead' any more:\n\n\n\n\n                continue;\n\n            // reduce:\n            case 2:\n\n\n\n                this_production = this.productions_[newState - 1];  // `this.productions_[]` is zero-based indexed while states start from 1 upwards...\n                yyrulelen = this_production[1];\n\n\n\n\n\n\n\n\n\n\n                r = this.performAction.call(yyval, newState, sp - 1, vstack);\n\n                if (typeof r !== 'undefined') {\n                    retval = r;\n                    break;\n                }\n\n                // pop off stack\n                sp -= yyrulelen;\n\n                // don't overwrite the `symbol` variable: use a local var to speed things up:\n                var ntsymbol = this_production[0];    // push nonterminal (reduce)\n                stack[sp] = ntsymbol;\n                vstack[sp] = yyval.$;\n\n                // goto new state = table[STATE][NONTERMINAL]\n                newState = table[sstack[sp - 1]][ntsymbol];\n                sstack[sp] = newState;\n                ++sp;\n\n\n\n\n\n\n\n\n\n                continue;\n\n            // accept:\n            case 3:\n                if (sp !== -2) {\n                    retval = true;\n                    // Return the `$accept` rule's `$$` result, if available.\n                    //\n                    // Also note that JISON always adds this top-most `$accept` rule (with implicit,\n                    // default, action):\n                    //\n                    //     $accept: <startSymbol> $end\n                    //                  %{ $$ = $1; @$ = @1; %}\n                    //\n                    // which, combined with the parse kernel's `$accept` state behaviour coded below,\n                    // will produce the `$$` value output of the <startSymbol> rule as the parse result,\n                    // IFF that result is *not* `undefined`. (See also the parser kernel code.)\n                    //\n                    // In code:\n                    //\n                    //                  %{\n                    //                      @$ = @1;            // if location tracking support is included\n                    //                      if (typeof $1 !== 'undefined')\n                    //                          return $1;\n                    //                      else\n                    //                          return true;           // the default parse result if the rule actions don't produce anything\n                    //                  %}\n                    sp--;\n                    if (typeof vstack[sp] !== 'undefined') {\n                        retval = vstack[sp];\n                    }\n                }\n                break;\n            }\n\n            // break out of loop: we accept or fail with error\n            break;\n        }\n    } catch (ex) {\n        // report exceptions through the parseError callback too, but keep the exception intact\n        // if it is a known parser or lexer error which has been thrown by parseError() already:\n        if (ex instanceof this.JisonParserError) {\n            throw ex;\n        }\n        else if (lexer && typeof lexer.JisonLexerError === 'function' && ex instanceof lexer.JisonLexerError) {\n            throw ex;\n        }\n\n        p = this.constructParseErrorInfo('Parsing aborted due to exception.', ex, null, false);\n        retval = false;\n        r = this.parseError(p.errStr, p, this.JisonParserError);\n        if (typeof r !== 'undefined') {\n            retval = r;\n        }\n    } finally {\n        retval = this.cleanupAfterParse(retval, true, true);\n        this.__reentrant_call_depth--;\n    }   // /finally\n\n    return retval;\n}\n};\nparser.originalParseError = parser.parseError;\nparser.originalQuoteName = parser.quoteName;\n/* lexer generated by jison-lex 0.6.1-215 */\n\n/*\n * Returns a Lexer object of the following structure:\n *\n *  Lexer: {\n *    yy: {}     The so-called \"shared state\" or rather the *source* of it;\n *               the real \"shared state\" `yy` passed around to\n *               the rule actions, etc. is a direct reference!\n *\n *               This \"shared context\" object was passed to the lexer by way of \n *               the `lexer.setInput(str, yy)` API before you may use it.\n *\n *               This \"shared context\" object is passed to the lexer action code in `performAction()`\n *               so userland code in the lexer actions may communicate with the outside world \n *               and/or other lexer rules' actions in more or less complex ways.\n *\n *  }\n *\n *  Lexer.prototype: {\n *    EOF: 1,\n *    ERROR: 2,\n *\n *    yy:        The overall \"shared context\" object reference.\n *\n *    JisonLexerError: function(msg, hash),\n *\n *    performAction: function lexer__performAction(yy, yyrulenumber, YY_START),\n *\n *               The function parameters and `this` have the following value/meaning:\n *               - `this`    : reference to the `lexer` instance. \n *                               `yy_` is an alias for `this` lexer instance reference used internally.\n *\n *               - `yy`      : a reference to the `yy` \"shared state\" object which was passed to the lexer\n *                             by way of the `lexer.setInput(str, yy)` API before.\n *\n *                             Note:\n *                             The extra arguments you specified in the `%parse-param` statement in your\n *                             **parser** grammar definition file are passed to the lexer via this object\n *                             reference as member variables.\n *\n *               - `yyrulenumber`   : index of the matched lexer rule (regex), used internally.\n *\n *               - `YY_START`: the current lexer \"start condition\" state.\n *\n *    parseError: function(str, hash, ExceptionClass),\n *\n *    constructLexErrorInfo: function(error_message, is_recoverable),\n *               Helper function.\n *               Produces a new errorInfo 'hash object' which can be passed into `parseError()`.\n *               See it's use in this lexer kernel in many places; example usage:\n *\n *                   var infoObj = lexer.constructParseErrorInfo('fail!', true);\n *                   var retVal = lexer.parseError(infoObj.errStr, infoObj, lexer.JisonLexerError);\n *\n *    options: { ... lexer %options ... },\n *\n *    lex: function(),\n *               Produce one token of lexed input, which was passed in earlier via the `lexer.setInput()` API.\n *               You MAY use the additional `args...` parameters as per `%parse-param` spec of the **lexer** grammar:\n *               these extra `args...` are added verbatim to the `yy` object reference as member variables.\n *\n *               WARNING:\n *               Lexer's additional `args...` parameters (via lexer's `%parse-param`) MAY conflict with\n *               any attributes already added to `yy` by the **parser** or the jison run-time; \n *               when such a collision is detected an exception is thrown to prevent the generated run-time \n *               from silently accepting this confusing and potentially hazardous situation! \n *\n *    cleanupAfterLex: function(do_not_nuke_errorinfos),\n *               Helper function.\n *\n *               This helper API is invoked when the **parse process** has completed: it is the responsibility\n *               of the **parser** (or the calling userland code) to invoke this method once cleanup is desired. \n *\n *               This helper may be invoked by user code to ensure the internal lexer gets properly garbage collected.\n *\n *    setInput: function(input, [yy]),\n *\n *\n *    input: function(),\n *\n *\n *    unput: function(str),\n *\n *\n *    more: function(),\n *\n *\n *    reject: function(),\n *\n *\n *    less: function(n),\n *\n *\n *    pastInput: function(n),\n *\n *\n *    upcomingInput: function(n),\n *\n *\n *    showPosition: function(),\n *\n *\n *    test_match: function(regex_match_array, rule_index),\n *\n *\n *    next: function(),\n *\n *\n *    begin: function(condition),\n *\n *\n *    pushState: function(condition),\n *\n *\n *    popState: function(),\n *\n *\n *    topState: function(),\n *\n *\n *    _currentRules: function(),\n *\n *\n *    stateStackSize: function(),\n *\n *\n *    performAction: function(yy, yy_, yyrulenumber, YY_START),\n *\n *\n *    rules: [...],\n *\n *\n *    conditions: {associative list: name ==> set},\n *  }\n *\n *\n *  token location info (`yylloc`): {\n *    first_line: n,\n *    last_line: n,\n *    first_column: n,\n *    last_column: n,\n *    range: [start_number, end_number]\n *               (where the numbers are indexes into the input string, zero-based)\n *  }\n *\n * ---\n *\n * The `parseError` function receives a 'hash' object with these members for lexer errors:\n *\n *  {\n *    text:        (matched text)\n *    token:       (the produced terminal token, if any)\n *    token_id:    (the produced terminal token numeric ID, if any)\n *    line:        (yylineno)\n *    loc:         (yylloc)\n *    recoverable: (boolean: TRUE when the parser MAY have an error recovery rule\n *                  available for this particular error)\n *    yy:          (object: the current parser internal \"shared state\" `yy`\n *                  as is also available in the rule actions; this can be used,\n *                  for instance, for advanced error analysis and reporting)\n *    lexer:       (reference to the current lexer instance used by the parser)\n *  }\n *\n * while `this` will reference the current lexer instance.\n *\n * When `parseError` is invoked by the lexer, the default implementation will\n * attempt to invoke `yy.parser.parseError()`; when this callback is not provided\n * it will try to invoke `yy.parseError()` instead. When that callback is also not\n * provided, a `JisonLexerError` exception will be thrown containing the error\n * message and `hash`, as constructed by the `constructLexErrorInfo()` API.\n *\n * Note that the lexer's `JisonLexerError` error class is passed via the\n * `ExceptionClass` argument, which is invoked to construct the exception\n * instance to be thrown, so technically `parseError` will throw the object\n * produced by the `new ExceptionClass(str, hash)` JavaScript expression.\n *\n * ---\n *\n * You can specify lexer options by setting / modifying the `.options` object of your Lexer instance.\n * These options are available:\n *\n * (Options are permanent.)\n *  \n *  yy: {\n *      parseError: function(str, hash, ExceptionClass)\n *                 optional: overrides the default `parseError` function.\n *  }\n *\n *  lexer.options: {\n *      pre_lex:  function()\n *                 optional: is invoked before the lexer is invoked to produce another token.\n *                 `this` refers to the Lexer object.\n *      post_lex: function(token) { return token; }\n *                 optional: is invoked when the lexer has produced a token `token`;\n *                 this function can override the returned token value by returning another.\n *                 When it does not return any (truthy) value, the lexer will return\n *                 the original `token`.\n *                 `this` refers to the Lexer object.\n *\n * WARNING: the next set of options are not meant to be changed. They echo the abilities of\n * the lexer as per when it was compiled!\n *\n *      ranges: boolean\n *                 optional: `true` ==> token location info will include a .range[] member.\n *      flex: boolean\n *                 optional: `true` ==> flex-like lexing behaviour where the rules are tested\n *                 exhaustively to find the longest match.\n *      backtrack_lexer: boolean\n *                 optional: `true` ==> lexer regexes are tested in order and for invoked;\n *                 the lexer terminates the scan when a token is returned by the action code.\n *      xregexp: boolean\n *                 optional: `true` ==> lexer rule regexes are \"extended regex format\" requiring the\n *                 `XRegExp` library. When this %option has not been specified at compile time, all lexer\n *                 rule regexes have been written as standard JavaScript RegExp expressions.\n *  }\n */\n\n\nvar lexer = function() {\n  /**\n   * See also:\n   * http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508\n   * but we keep the prototype.constructor and prototype.name assignment lines too for compatibility\n   * with userland code which might access the derived class in a 'classic' way.\n   *\n   * @public\n   * @constructor\n   * @nocollapse\n   */\n  function JisonLexerError(msg, hash) {\n    Object.defineProperty(this, 'name', {\n      enumerable: false,\n      writable: false,\n      value: 'JisonLexerError'\n    });\n\n    if (msg == null)\n      msg = '???';\n\n    Object.defineProperty(this, 'message', {\n      enumerable: false,\n      writable: true,\n      value: msg\n    });\n\n    this.hash = hash;\n    var stacktrace;\n\n    if (hash && hash.exception instanceof Error) {\n      var ex2 = hash.exception;\n      this.message = ex2.message || msg;\n      stacktrace = ex2.stack;\n    }\n\n    if (!stacktrace) {\n      if (Error.hasOwnProperty('captureStackTrace')) {\n        // V8\n        Error.captureStackTrace(this, this.constructor);\n      } else {\n        stacktrace = new Error(msg).stack;\n      }\n    }\n\n    if (stacktrace) {\n      Object.defineProperty(this, 'stack', {\n        enumerable: false,\n        writable: false,\n        value: stacktrace\n      });\n    }\n  }\n\n  if (typeof Object.setPrototypeOf === 'function') {\n    Object.setPrototypeOf(JisonLexerError.prototype, Error.prototype);\n  } else {\n    JisonLexerError.prototype = Object.create(Error.prototype);\n  }\n\n  JisonLexerError.prototype.constructor = JisonLexerError;\n  JisonLexerError.prototype.name = 'JisonLexerError';\n\n  var lexer = {\n    \n// Code Generator Information Report\n// ---------------------------------\n//\n// Options:\n//\n//   backtracking: .................... false\n//   location.ranges: ................. false\n//   location line+column tracking: ... true\n//\n//\n// Forwarded Parser Analysis flags:\n//\n//   uses yyleng: ..................... false\n//   uses yylineno: ................... false\n//   uses yytext: ..................... false\n//   uses yylloc: ..................... false\n//   uses lexer values: ............... true / true\n//   location tracking: ............... false\n//   location assignment: ............. false\n//\n//\n// Lexer Analysis flags:\n//\n//   uses yyleng: ..................... ???\n//   uses yylineno: ................... ???\n//   uses yytext: ..................... ???\n//   uses yylloc: ..................... ???\n//   uses ParseError API: ............. ???\n//   uses yyerror: .................... ???\n//   uses location tracking & editing:  ???\n//   uses more() API: ................. ???\n//   uses unput() API: ................ ???\n//   uses reject() API: ............... ???\n//   uses less() API: ................. ???\n//   uses display APIs pastInput(), upcomingInput(), showPosition():\n//        ............................. ???\n//   uses describeYYLLOC() API: ....... ???\n//\n// --------- END OF REPORT -----------\n\nEOF: 1,\n    ERROR: 2,\n\n    // JisonLexerError: JisonLexerError,        /// <-- injected by the code generator\n\n    // options: {},                             /// <-- injected by the code generator\n\n    // yy: ...,                                 /// <-- injected by setInput()\n\n    __currentRuleSet__: null,                   /// INTERNAL USE ONLY: internal rule set cache for the current lexer state  \n\n    __error_infos: [],                          /// INTERNAL USE ONLY: the set of lexErrorInfo objects created since the last cleanup  \n    __decompressed: false,                      /// INTERNAL USE ONLY: mark whether the lexer instance has been 'unfolded' completely and is now ready for use  \n    done: false,                                /// INTERNAL USE ONLY  \n    _backtrack: false,                          /// INTERNAL USE ONLY  \n    _input: '',                                 /// INTERNAL USE ONLY  \n    _more: false,                               /// INTERNAL USE ONLY  \n    _signaled_error_token: false,               /// INTERNAL USE ONLY  \n    conditionStack: [],                         /// INTERNAL USE ONLY; managed via `pushState()`, `popState()`, `topState()` and `stateStackSize()`  \n    match: '',                                  /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks input which has been matched so far for the lexer token under construction. `match` is identical to `yytext` except that this one still contains the matched input string after `lexer.performAction()` has been invoked, where userland code MAY have changed/replaced the `yytext` value entirely!  \n    matched: '',                                /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks entire input which has been matched so far  \n    matches: false,                             /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks RE match result for last (successful) match attempt  \n    yytext: '',                                 /// ADVANCED USE ONLY: tracks input which has been matched so far for the lexer token under construction; this value is transferred to the parser as the 'token value' when the parser consumes the lexer token produced through a call to the `lex()` API.  \n    offset: 0,                                  /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks the 'cursor position' in the input string, i.e. the number of characters matched so far  \n    yyleng: 0,                                  /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: length of matched input for the token under construction (`yytext`)  \n    yylineno: 0,                                /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: 'line number' at which the token under construction is located  \n    yylloc: null,                               /// READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks location info (lines + columns) for the token under construction  \n\n    /**\n     * INTERNAL USE: construct a suitable error info hash object instance for `parseError`.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    constructLexErrorInfo: function lexer_constructLexErrorInfo(msg, recoverable, show_input_position) {\n      msg = '' + msg;\n\n      // heuristic to determine if the error message already contains a (partial) source code dump\n      // as produced by either `showPosition()` or `prettyPrintRange()`:\n      if (show_input_position == undefined) {\n        show_input_position = !(msg.indexOf('\\n') > 0 && msg.indexOf('^') > 0);\n      }\n\n      if (this.yylloc && show_input_position) {\n        if (typeof this.prettyPrintRange === 'function') {\n          var pretty_src = this.prettyPrintRange(this.yylloc);\n\n          if (!/\\n\\s*$/.test(msg)) {\n            msg += '\\n';\n          }\n\n          msg += '\\n  Erroneous area:\\n' + this.prettyPrintRange(this.yylloc);\n        } else if (typeof this.showPosition === 'function') {\n          var pos_str = this.showPosition();\n\n          if (pos_str) {\n            if (msg.length && msg[msg.length - 1] !== '\\n' && pos_str[0] !== '\\n') {\n              msg += '\\n' + pos_str;\n            } else {\n              msg += pos_str;\n            }\n          }\n        }\n      }\n\n      /** @constructor */\n      var pei = {\n        errStr: msg,\n        recoverable: !!recoverable,\n        text: this.match,           // This one MAY be empty; userland code should use the `upcomingInput` API to obtain more text which follows the 'lexer cursor position'...  \n        token: null,\n        line: this.yylineno,\n        loc: this.yylloc,\n        yy: this.yy,\n        lexer: this,\n\n        /**\n         * and make sure the error info doesn't stay due to potential\n         * ref cycle via userland code manipulations.\n         * These would otherwise all be memory leak opportunities!\n         * \n         * Note that only array and object references are nuked as those\n         * constitute the set of elements which can produce a cyclic ref.\n         * The rest of the members is kept intact as they are harmless.\n         * \n         * @public\n         * @this {LexErrorInfo}\n         */\n        destroy: function destructLexErrorInfo() {\n          // remove cyclic references added to error info:\n          // info.yy = null;\n          // info.lexer = null;\n          // ...\n          var rec = !!this.recoverable;\n\n          for (var key in this) {\n            if (this.hasOwnProperty(key) && typeof key === 'object') {\n              this[key] = undefined;\n            }\n          }\n\n          this.recoverable = rec;\n        }\n      };\n\n      // track this instance so we can `destroy()` it once we deem it superfluous and ready for garbage collection!\n      this.__error_infos.push(pei);\n\n      return pei;\n    },\n\n    /**\n     * handler which is invoked when a lexer error occurs.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    parseError: function lexer_parseError(str, hash, ExceptionClass) {\n      if (!ExceptionClass) {\n        ExceptionClass = this.JisonLexerError;\n      }\n\n      if (this.yy) {\n        if (this.yy.parser && typeof this.yy.parser.parseError === 'function') {\n          return this.yy.parser.parseError.call(this, str, hash, ExceptionClass) || this.ERROR;\n        } else if (typeof this.yy.parseError === 'function') {\n          return this.yy.parseError.call(this, str, hash, ExceptionClass) || this.ERROR;\n        }\n      }\n\n      throw new ExceptionClass(str, hash);\n    },\n\n    /**\n     * method which implements `yyerror(str, ...args)` functionality for use inside lexer actions.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    yyerror: function yyError(str /*, ...args */) {\n      var lineno_msg = '';\n\n      if (this.yylloc) {\n        lineno_msg = ' on line ' + (this.yylineno + 1);\n      }\n\n      var p = this.constructLexErrorInfo(\n        'Lexical error' + lineno_msg + ': ' + str,\n        this.options.lexerErrorsAreRecoverable\n      );\n\n      // Add any extra args to the hash under the name `extra_error_attributes`:\n      var args = Array.prototype.slice.call(arguments, 1);\n\n      if (args.length) {\n        p.extra_error_attributes = args;\n      }\n\n      return this.parseError(p.errStr, p, this.JisonLexerError) || this.ERROR;\n    },\n\n    /**\n     * final cleanup function for when we have completed lexing the input;\n     * make it an API so that external code can use this one once userland\n     * code has decided it's time to destroy any lingering lexer error\n     * hash object instances and the like: this function helps to clean\n     * up these constructs, which *may* carry cyclic references which would\n     * otherwise prevent the instances from being properly and timely\n     * garbage-collected, i.e. this function helps prevent memory leaks!\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    cleanupAfterLex: function lexer_cleanupAfterLex(do_not_nuke_errorinfos) {\n      // prevent lingering circular references from causing memory leaks:\n      this.setInput('', {});\n\n      // nuke the error hash info instances created during this run.\n      // Userland code must COPY any data/references\n      // in the error hash instance(s) it is more permanently interested in.\n      if (!do_not_nuke_errorinfos) {\n        for (var i = this.__error_infos.length - 1; i >= 0; i--) {\n          var el = this.__error_infos[i];\n\n          if (el && typeof el.destroy === 'function') {\n            el.destroy();\n          }\n        }\n\n        this.__error_infos.length = 0;\n      }\n\n      return this;\n    },\n\n    /**\n     * clear the lexer token context; intended for internal use only\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    clear: function lexer_clear() {\n      this.yytext = '';\n      this.yyleng = 0;\n      this.match = '';\n\n      // - DO NOT reset `this.matched`\n      this.matches = false;\n\n      this._more = false;\n      this._backtrack = false;\n      var col = (this.yylloc ? this.yylloc.last_column : 0);\n\n      this.yylloc = {\n        first_line: this.yylineno + 1,\n        first_column: col,\n        last_line: this.yylineno + 1,\n        last_column: col,\n        range: [this.offset, this.offset]\n      };\n    },\n\n    /**\n     * resets the lexer, sets new input\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    setInput: function lexer_setInput(input, yy) {\n      this.yy = yy || this.yy || {};\n\n      // also check if we've fully initialized the lexer instance,\n      // including expansion work to be done to go from a loaded\n      // lexer to a usable lexer:\n      if (!this.__decompressed) {\n        // step 1: decompress the regex list:\n        var rules = this.rules;\n\n        for (var i = 0, len = rules.length; i < len; i++) {\n          var rule_re = rules[i];\n\n          // compression: is the RE an xref to another RE slot in the rules[] table?\n          if (typeof rule_re === 'number') {\n            rules[i] = rules[rule_re];\n          }\n        }\n\n        // step 2: unfold the conditions[] set to make these ready for use:\n        var conditions = this.conditions;\n\n        for (var k in conditions) {\n          var spec = conditions[k];\n          var rule_ids = spec.rules;\n          var len = rule_ids.length;\n          var rule_regexes = new Array(len + 1);             // slot 0 is unused; we use a 1-based index approach here to keep the hottest code in `lexer_next()` fast and simple! \n          var rule_new_ids = new Array(len + 1);\n\n          for (var i = 0; i < len; i++) {\n            var idx = rule_ids[i];\n            var rule_re = rules[idx];\n            rule_regexes[i + 1] = rule_re;\n            rule_new_ids[i + 1] = idx;\n          }\n\n          spec.rules = rule_new_ids;\n          spec.__rule_regexes = rule_regexes;\n          spec.__rule_count = len;\n        }\n\n        this.__decompressed = true;\n      }\n\n      this._input = input || '';\n      this.clear();\n      this._signaled_error_token = false;\n      this.done = false;\n      this.yylineno = 0;\n      this.matched = '';\n      this.conditionStack = ['INITIAL'];\n      this.__currentRuleSet__ = null;\n\n      this.yylloc = {\n        first_line: 1,\n        first_column: 0,\n        last_line: 1,\n        last_column: 0,\n        range: [0, 0]\n      };\n\n      this.offset = 0;\n      return this;\n    },\n\n    /**\n     * edit the remaining input via user-specified callback.\n     * This can be used to forward-adjust the input-to-parse, \n     * e.g. inserting macro expansions and alike in the\n     * input which has yet to be lexed.\n     * The behaviour of this API contrasts the `unput()` et al\n     * APIs as those act on the *consumed* input, while this\n     * one allows one to manipulate the future, without impacting\n     * the current `yyloc` cursor location or any history. \n     * \n     * Use this API to help implement C-preprocessor-like\n     * `#include` statements, etc.\n     * \n     * The provided callback must be synchronous and is\n     * expected to return the edited input (string).\n     *\n     * The `cpsArg` argument value is passed to the callback\n     * as-is.\n     *\n     * `callback` interface: \n     * `function callback(input, cpsArg)`\n     * \n     * - `input` will carry the remaining-input-to-lex string\n     *   from the lexer.\n     * - `cpsArg` is `cpsArg` passed into this API.\n     * \n     * The `this` reference for the callback will be set to\n     * reference this lexer instance so that userland code\n     * in the callback can easily and quickly access any lexer\n     * API. \n     *\n     * When the callback returns a non-string-type falsey value,\n     * we assume the callback did not edit the input and we\n     * will using the input as-is.\n     *\n     * When the callback returns a non-string-type value, it\n     * is converted to a string for lexing via the `\"\" + retval`\n     * operation. (See also why: http://2ality.com/2012/03/converting-to-string.html \n     * -- that way any returned object's `toValue()` and `toString()`\n     * methods will be invoked in a proper/desirable order.)\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    editRemainingInput: function lexer_editRemainingInput(callback, cpsArg) {\n      var rv = callback.call(this, this._input, cpsArg);\n\n      if (typeof rv !== 'string') {\n        if (rv) {\n          this._input = '' + rv;\n        } \n        // else: keep `this._input` as is.  \n      } else {\n        this._input = rv;\n      }\n\n      return this;\n    },\n\n    /**\n     * consumes and returns one char from the input\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    input: function lexer_input() {\n      if (!this._input) {\n        //this.done = true;    -- don't set `done` as we want the lex()/next() API to be able to produce one custom EOF token match after this anyhow. (lexer can match special <<EOF>> tokens and perform user action code for a <<EOF>> match, but only does so *once*)\n        return null;\n      }\n\n      var ch = this._input[0];\n      this.yytext += ch;\n      this.yyleng++;\n      this.offset++;\n      this.match += ch;\n      this.matched += ch;\n\n      // Count the linenumber up when we hit the LF (or a stand-alone CR).\n      // On CRLF, the linenumber is incremented when you fetch the CR or the CRLF combo\n      // and we advance immediately past the LF as well, returning both together as if\n      // it was all a single 'character' only.\n      var slice_len = 1;\n\n      var lines = false;\n\n      if (ch === '\\n') {\n        lines = true;\n      } else if (ch === '\\r') {\n        lines = true;\n        var ch2 = this._input[1];\n\n        if (ch2 === '\\n') {\n          slice_len++;\n          ch += ch2;\n          this.yytext += ch2;\n          this.yyleng++;\n          this.offset++;\n          this.match += ch2;\n          this.matched += ch2;\n          this.yylloc.range[1]++;\n        }\n      }\n\n      if (lines) {\n        this.yylineno++;\n        this.yylloc.last_line++;\n        this.yylloc.last_column = 0;\n      } else {\n        this.yylloc.last_column++;\n      }\n\n      this.yylloc.range[1]++;\n      this._input = this._input.slice(slice_len);\n      return ch;\n    },\n\n    /**\n     * unshifts one char (or an entire string) into the input\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    unput: function lexer_unput(ch) {\n      var len = ch.length;\n      var lines = ch.split(/(?:\\r\\n?|\\n)/g);\n      this._input = ch + this._input;\n      this.yytext = this.yytext.substr(0, this.yytext.length - len);\n      this.yyleng = this.yytext.length;\n      this.offset -= len;\n      this.match = this.match.substr(0, this.match.length - len);\n      this.matched = this.matched.substr(0, this.matched.length - len);\n\n      if (lines.length > 1) {\n        this.yylineno -= lines.length - 1;\n        this.yylloc.last_line = this.yylineno + 1;\n\n        // Get last entirely matched line into the `pre_lines[]` array's\n        // last index slot; we don't mind when other previously \n        // matched lines end up in the array too. \n        var pre = this.match;\n\n        var pre_lines = pre.split(/(?:\\r\\n?|\\n)/g);\n\n        if (pre_lines.length === 1) {\n          pre = this.matched;\n          pre_lines = pre.split(/(?:\\r\\n?|\\n)/g);\n        }\n\n        this.yylloc.last_column = pre_lines[pre_lines.length - 1].length;\n      } else {\n        this.yylloc.last_column -= len;\n      }\n\n      this.yylloc.range[1] = this.yylloc.range[0] + this.yyleng;\n      this.done = false;\n      return this;\n    },\n\n    /**\n     * cache matched text and append it on next action\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    more: function lexer_more() {\n      this._more = true;\n      return this;\n    },\n\n    /**\n     * signal the lexer that this rule fails to match the input, so the\n     * next matching rule (regex) should be tested instead.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    reject: function lexer_reject() {\n      if (this.options.backtrack_lexer) {\n        this._backtrack = true;\n      } else {\n        // when the `parseError()` call returns, we MUST ensure that the error is registered.\n        // We accomplish this by signaling an 'error' token to be produced for the current\n        // `.lex()` run.\n        var lineno_msg = '';\n\n        if (this.yylloc) {\n          lineno_msg = ' on line ' + (this.yylineno + 1);\n        }\n\n        var p = this.constructLexErrorInfo(\n          'Lexical error' + lineno_msg + ': You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).',\n          false\n        );\n\n        this._signaled_error_token = this.parseError(p.errStr, p, this.JisonLexerError) || this.ERROR;\n      }\n\n      return this;\n    },\n\n    /**\n     * retain first n characters of the match\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    less: function lexer_less(n) {\n      return this.unput(this.match.slice(n));\n    },\n\n    /**\n     * return (part of the) already matched input, i.e. for error\n     * messages.\n     * \n     * Limit the returned string length to `maxSize` (default: 20).\n     * \n     * Limit the returned string to the `maxLines` number of lines of\n     * input (default: 1).\n     * \n     * Negative limit values equal *unlimited*.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    pastInput: function lexer_pastInput(maxSize, maxLines) {\n      var past = this.matched.substring(0, this.matched.length - this.match.length);\n\n      if (maxSize < 0)\n        maxSize = past.length;\n      else if (!maxSize)\n        maxSize = 20;\n\n      if (maxLines < 0)\n        maxLines = past.length;          // can't ever have more input lines than this! \n      else if (!maxLines)\n        maxLines = 1;\n\n      // `substr` anticipation: treat \\r\\n as a single character and take a little\n      // more than necessary so that we can still properly check against maxSize\n      // after we've transformed and limited the newLines in here:\n      past = past.substr(-maxSize * 2 - 2);\n\n      // now that we have a significantly reduced string to process, transform the newlines\n      // and chop them, then limit them:\n      var a = past.replace(/\\r\\n|\\r/g, '\\n').split('\\n');\n\n      a = a.slice(-maxLines);\n      past = a.join('\\n');\n\n      // When, after limiting to maxLines, we still have too much to return,\n      // do add an ellipsis prefix...\n      if (past.length > maxSize) {\n        past = '...' + past.substr(-maxSize);\n      }\n\n      return past;\n    },\n\n    /**\n     * return (part of the) upcoming input, i.e. for error messages.\n     * \n     * Limit the returned string length to `maxSize` (default: 20).\n     * \n     * Limit the returned string to the `maxLines` number of lines of input (default: 1).\n     * \n     * Negative limit values equal *unlimited*.\n     *\n     * > ### NOTE ###\n     * >\n     * > *\"upcoming input\"* is defined as the whole of the both\n     * > the *currently lexed* input, together with any remaining input\n     * > following that. *\"currently lexed\"* input is the input \n     * > already recognized by the lexer but not yet returned with\n     * > the lexer token. This happens when you are invoking this API\n     * > from inside any lexer rule action code block. \n     * >\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    upcomingInput: function lexer_upcomingInput(maxSize, maxLines) {\n      var next = this.match;\n\n      if (maxSize < 0)\n        maxSize = next.length + this._input.length;\n      else if (!maxSize)\n        maxSize = 20;\n\n      if (maxLines < 0)\n        maxLines = maxSize;          // can't ever have more input lines than this! \n      else if (!maxLines)\n        maxLines = 1;\n\n      // `substring` anticipation: treat \\r\\n as a single character and take a little\n      // more than necessary so that we can still properly check against maxSize\n      // after we've transformed and limited the newLines in here:\n      if (next.length < maxSize * 2 + 2) {\n        next += this._input.substring(0, maxSize * 2 + 2);   // substring is faster on Chrome/V8 \n      }\n\n      // now that we have a significantly reduced string to process, transform the newlines\n      // and chop them, then limit them:\n      var a = next.replace(/\\r\\n|\\r/g, '\\n').split('\\n');\n\n      a = a.slice(0, maxLines);\n      next = a.join('\\n');\n\n      // When, after limiting to maxLines, we still have too much to return,\n      // do add an ellipsis postfix...\n      if (next.length > maxSize) {\n        next = next.substring(0, maxSize) + '...';\n      }\n\n      return next;\n    },\n\n    /**\n     * return a string which displays the character position where the\n     * lexing error occurred, i.e. for error messages\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    showPosition: function lexer_showPosition(maxPrefix, maxPostfix) {\n      var pre = this.pastInput(maxPrefix).replace(/\\s/g, ' ');\n      var c = new Array(pre.length + 1).join('-');\n      return pre + this.upcomingInput(maxPostfix).replace(/\\s/g, ' ') + '\\n' + c + '^';\n    },\n\n    /**\n     * return an YYLLOC info object derived off the given context (actual, preceding, following, current).\n     * Use this method when the given `actual` location is not guaranteed to exist (i.e. when\n     * it MAY be NULL) and you MUST have a valid location info object anyway:\n     * then we take the given context of the `preceding` and `following` locations, IFF those are available,\n     * and reconstruct the `actual` location info from those.\n     * If this fails, the heuristic is to take the `current` location, IFF available.\n     * If this fails as well, we assume the sought location is at/around the current lexer position\n     * and then produce that one as a response. DO NOTE that these heuristic/derived location info\n     * values MAY be inaccurate!\n     *\n     * NOTE: `deriveLocationInfo()` ALWAYS produces a location info object *copy* of `actual`, not just\n     * a *reference* hence all input location objects can be assumed to be 'constant' (function has no side-effects).\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    deriveLocationInfo: function lexer_deriveYYLLOC(actual, preceding, following, current) {\n      var loc = {\n        first_line: 1,\n        first_column: 0,\n        last_line: 1,\n        last_column: 0,\n        range: [0, 0]\n      };\n\n      if (actual) {\n        loc.first_line = actual.first_line | 0;\n        loc.last_line = actual.last_line | 0;\n        loc.first_column = actual.first_column | 0;\n        loc.last_column = actual.last_column | 0;\n\n        if (actual.range) {\n          loc.range[0] = actual.range[0] | 0;\n          loc.range[1] = actual.range[1] | 0;\n        }\n      }\n\n      if (loc.first_line <= 0 || loc.last_line < loc.first_line) {\n        // plan B: heuristic using preceding and following:\n        if (loc.first_line <= 0 && preceding) {\n          loc.first_line = preceding.last_line | 0;\n          loc.first_column = preceding.last_column | 0;\n\n          if (preceding.range) {\n            loc.range[0] = actual.range[1] | 0;\n          }\n        }\n\n        if ((loc.last_line <= 0 || loc.last_line < loc.first_line) && following) {\n          loc.last_line = following.first_line | 0;\n          loc.last_column = following.first_column | 0;\n\n          if (following.range) {\n            loc.range[1] = actual.range[0] | 0;\n          }\n        }\n\n        // plan C?: see if the 'current' location is useful/sane too:\n        if (loc.first_line <= 0 && current && (loc.last_line <= 0 || current.last_line <= loc.last_line)) {\n          loc.first_line = current.first_line | 0;\n          loc.first_column = current.first_column | 0;\n\n          if (current.range) {\n            loc.range[0] = current.range[0] | 0;\n          }\n        }\n\n        if (loc.last_line <= 0 && current && (loc.first_line <= 0 || current.first_line >= loc.first_line)) {\n          loc.last_line = current.last_line | 0;\n          loc.last_column = current.last_column | 0;\n\n          if (current.range) {\n            loc.range[1] = current.range[1] | 0;\n          }\n        }\n      }\n\n      // sanitize: fix last_line BEFORE we fix first_line as we use the 'raw' value of the latter\n      // or plan D heuristics to produce a 'sensible' last_line value:\n      if (loc.last_line <= 0) {\n        if (loc.first_line <= 0) {\n          loc.first_line = this.yylloc.first_line;\n          loc.last_line = this.yylloc.last_line;\n          loc.first_column = this.yylloc.first_column;\n          loc.last_column = this.yylloc.last_column;\n          loc.range[0] = this.yylloc.range[0];\n          loc.range[1] = this.yylloc.range[1];\n        } else {\n          loc.last_line = this.yylloc.last_line;\n          loc.last_column = this.yylloc.last_column;\n          loc.range[1] = this.yylloc.range[1];\n        }\n      }\n\n      if (loc.first_line <= 0) {\n        loc.first_line = loc.last_line;\n        loc.first_column = 0;  // loc.last_column; \n        loc.range[1] = loc.range[0];\n      }\n\n      if (loc.first_column < 0) {\n        loc.first_column = 0;\n      }\n\n      if (loc.last_column < 0) {\n        loc.last_column = (loc.first_column > 0 ? loc.first_column : 80);\n      }\n\n      return loc;\n    },\n\n    /**\n     * return a string which displays the lines & columns of input which are referenced \n     * by the given location info range, plus a few lines of context.\n     * \n     * This function pretty-prints the indicated section of the input, with line numbers \n     * and everything!\n     * \n     * This function is very useful to provide highly readable error reports, while\n     * the location range may be specified in various flexible ways:\n     * \n     * - `loc` is the location info object which references the area which should be\n     *   displayed and 'marked up': these lines & columns of text are marked up by `^`\n     *   characters below each character in the entire input range.\n     * \n     * - `context_loc` is the *optional* location info object which instructs this\n     *   pretty-printer how much *leading* context should be displayed alongside\n     *   the area referenced by `loc`. This can help provide context for the displayed\n     *   error, etc.\n     * \n     *   When this location info is not provided, a default context of 3 lines is\n     *   used.\n     * \n     * - `context_loc2` is another *optional* location info object, which serves\n     *   a similar purpose to `context_loc`: it specifies the amount of *trailing*\n     *   context lines to display in the pretty-print output.\n     * \n     *   When this location info is not provided, a default context of 1 line only is\n     *   used.\n     * \n     * Special Notes:\n     * \n     * - when the `loc`-indicated range is very large (about 5 lines or more), then\n     *   only the first and last few lines of this block are printed while a\n     *   `...continued...` message will be printed between them.\n     * \n     *   This serves the purpose of not printing a huge amount of text when the `loc`\n     *   range happens to be huge: this way a manageable & readable output results\n     *   for arbitrary large ranges.\n     * \n     * - this function can display lines of input which whave not yet been lexed.\n     *   `prettyPrintRange()` can access the entire input!\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    prettyPrintRange: function lexer_prettyPrintRange(loc, context_loc, context_loc2) {\n      loc = this.deriveLocationInfo(loc, context_loc, context_loc2);\n      const CONTEXT = 3;\n      const CONTEXT_TAIL = 1;\n      const MINIMUM_VISIBLE_NONEMPTY_LINE_COUNT = 2;\n      var input = this.matched + this._input;\n      var lines = input.split('\\n');\n      var l0 = Math.max(1, (context_loc ? context_loc.first_line : loc.first_line - CONTEXT));\n      var l1 = Math.max(1, (context_loc2 ? context_loc2.last_line : loc.last_line + CONTEXT_TAIL));\n      var lineno_display_width = 1 + Math.log10(l1 | 1) | 0;\n      var ws_prefix = new Array(lineno_display_width).join(' ');\n      var nonempty_line_indexes = [];\n\n      var rv = lines.slice(l0 - 1, l1 + 1).map(function injectLineNumber(line, index) {\n        var lno = index + l0;\n        var lno_pfx = (ws_prefix + lno).substr(-lineno_display_width);\n        var rv = lno_pfx + ': ' + line;\n        var errpfx = new Array(lineno_display_width + 1).join('^');\n        var offset = 2 + 1;\n        var len = 0;\n\n        if (lno === loc.first_line) {\n          offset += loc.first_column;\n\n          len = Math.max(\n            2,\n            ((lno === loc.last_line ? loc.last_column : line.length)) - loc.first_column + 1\n          );\n        } else if (lno === loc.last_line) {\n          len = Math.max(2, loc.last_column + 1);\n        } else if (lno > loc.first_line && lno < loc.last_line) {\n          len = Math.max(2, line.length + 1);\n        }\n\n        if (len) {\n          var lead = new Array(offset).join('.');\n          var mark = new Array(len).join('^');\n          rv += '\\n' + errpfx + lead + mark;\n\n          if (line.trim().length > 0) {\n            nonempty_line_indexes.push(index);\n          }\n        }\n\n        rv = rv.replace(/\\t/g, ' ');\n        return rv;\n      });\n\n      // now make sure we don't print an overly large amount of error area: limit it \n      // to the top and bottom line count:\n      if (nonempty_line_indexes.length > 2 * MINIMUM_VISIBLE_NONEMPTY_LINE_COUNT) {\n        var clip_start = nonempty_line_indexes[MINIMUM_VISIBLE_NONEMPTY_LINE_COUNT - 1] + 1;\n        var clip_end = nonempty_line_indexes[nonempty_line_indexes.length - MINIMUM_VISIBLE_NONEMPTY_LINE_COUNT] - 1;\n        var intermediate_line = new Array(lineno_display_width + 1).join(' ') + '  (...continued...)';\n        intermediate_line += '\\n' + new Array(lineno_display_width + 1).join('-') + '  (---------------)';\n        rv.splice(clip_start, clip_end - clip_start + 1, intermediate_line);\n      }\n\n      return rv.join('\\n');\n    },\n\n    /**\n     * helper function, used to produce a human readable description as a string, given\n     * the input `yylloc` location object.\n     * \n     * Set `display_range_too` to TRUE to include the string character index position(s)\n     * in the description if the `yylloc.range` is available.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    describeYYLLOC: function lexer_describe_yylloc(yylloc, display_range_too) {\n      var l1 = yylloc.first_line;\n      var l2 = yylloc.last_line;\n      var c1 = yylloc.first_column;\n      var c2 = yylloc.last_column;\n      var dl = l2 - l1;\n      var dc = c2 - c1;\n      var rv;\n\n      if (dl === 0) {\n        rv = 'line ' + l1 + ', ';\n\n        if (dc <= 1) {\n          rv += 'column ' + c1;\n        } else {\n          rv += 'columns ' + c1 + ' .. ' + c2;\n        }\n      } else {\n        rv = 'lines ' + l1 + '(column ' + c1 + ') .. ' + l2 + '(column ' + c2 + ')';\n      }\n\n      if (yylloc.range && display_range_too) {\n        var r1 = yylloc.range[0];\n        var r2 = yylloc.range[1] - 1;\n\n        if (r2 <= r1) {\n          rv += ' {String Offset: ' + r1 + '}';\n        } else {\n          rv += ' {String Offset range: ' + r1 + ' .. ' + r2 + '}';\n        }\n      }\n\n      return rv;\n    },\n\n    /**\n     * test the lexed token: return FALSE when not a match, otherwise return token.\n     * \n     * `match` is supposed to be an array coming out of a regex match, i.e. `match[0]`\n     * contains the actually matched text string.\n     * \n     * Also move the input cursor forward and update the match collectors:\n     * \n     * - `yytext`\n     * - `yyleng`\n     * - `match`\n     * - `matches`\n     * - `yylloc`\n     * - `offset`\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    test_match: function lexer_test_match(match, indexed_rule) {\n      var token, lines, backup, match_str, match_str_len;\n\n      if (this.options.backtrack_lexer) {\n        // save context\n        backup = {\n          yylineno: this.yylineno,\n\n          yylloc: {\n            first_line: this.yylloc.first_line,\n            last_line: this.yylloc.last_line,\n            first_column: this.yylloc.first_column,\n            last_column: this.yylloc.last_column,\n            range: this.yylloc.range.slice(0)\n          },\n\n          yytext: this.yytext,\n          match: this.match,\n          matches: this.matches,\n          matched: this.matched,\n          yyleng: this.yyleng,\n          offset: this.offset,\n          _more: this._more,\n          _input: this._input,\n\n          //_signaled_error_token: this._signaled_error_token,\n          yy: this.yy,\n\n          conditionStack: this.conditionStack.slice(0),\n          done: this.done\n        };\n      }\n\n      match_str = match[0];\n      match_str_len = match_str.length;\n\n      // if (match_str.indexOf('\\n') !== -1 || match_str.indexOf('\\r') !== -1) {\n      lines = match_str.split(/(?:\\r\\n?|\\n)/g);\n\n      if (lines.length > 1) {\n        this.yylineno += lines.length - 1;\n        this.yylloc.last_line = this.yylineno + 1;\n        this.yylloc.last_column = lines[lines.length - 1].length;\n      } else {\n        this.yylloc.last_column += match_str_len;\n      }\n\n      // }\n      this.yytext += match_str;\n\n      this.match += match_str;\n      this.matched += match_str;\n      this.matches = match;\n      this.yyleng = this.yytext.length;\n      this.yylloc.range[1] += match_str_len;\n\n      // previous lex rules MAY have invoked the `more()` API rather than producing a token:\n      // those rules will already have moved this `offset` forward matching their match lengths,\n      // hence we must only add our own match length now:\n      this.offset += match_str_len;\n\n      this._more = false;\n      this._backtrack = false;\n      this._input = this._input.slice(match_str_len);\n\n      // calling this method:\n      //\n      //   function lexer__performAction(yy, yyrulenumber, YY_START) {...}\n      token = this.performAction.call(\n        this,\n        this.yy,\n        indexed_rule,\n        this.conditionStack[this.conditionStack.length - 1] /* = YY_START */\n      );\n\n      // otherwise, when the action codes are all simple return token statements:\n      //token = this.simpleCaseActionClusters[indexed_rule];\n\n      if (this.done && this._input) {\n        this.done = false;\n      }\n\n      if (token) {\n        return token;\n      } else if (this._backtrack) {\n        // recover context\n        for (var k in backup) {\n          this[k] = backup[k];\n        }\n\n        this.__currentRuleSet__ = null;\n        return false;  // rule action called reject() implying the next rule should be tested instead. \n      } else if (this._signaled_error_token) {\n        // produce one 'error' token as `.parseError()` in `reject()`\n        // did not guarantee a failure signal by throwing an exception!\n        token = this._signaled_error_token;\n\n        this._signaled_error_token = false;\n        return token;\n      }\n\n      return false;\n    },\n\n    /**\n     * return next match in input\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    next: function lexer_next() {\n      if (this.done) {\n        this.clear();\n        return this.EOF;\n      }\n\n      if (!this._input) {\n        this.done = true;\n      }\n\n      var token, match, tempMatch, index;\n\n      if (!this._more) {\n        this.clear();\n      }\n\n      var spec = this.__currentRuleSet__;\n\n      if (!spec) {\n        // Update the ruleset cache as we apparently encountered a state change or just started lexing.\n        // The cache is set up for fast lookup -- we assume a lexer will switch states much less often than it will\n        // invoke the `lex()` token-producing API and related APIs, hence caching the set for direct access helps\n        // speed up those activities a tiny bit.\n        spec = this.__currentRuleSet__ = this._currentRules();\n\n        // Check whether a *sane* condition has been pushed before: this makes the lexer robust against\n        // user-programmer bugs such as https://github.com/zaach/jison-lex/issues/19\n        if (!spec || !spec.rules) {\n          var lineno_msg = '';\n\n          if (this.options.trackPosition) {\n            lineno_msg = ' on line ' + (this.yylineno + 1);\n          }\n\n          var p = this.constructLexErrorInfo(\n            'Internal lexer engine error' + lineno_msg + ': The lex grammar programmer pushed a non-existing condition name \"' + this.topState() + '\"; this is a fatal error and should be reported to the application programmer team!',\n            false\n          );\n\n          // produce one 'error' token until this situation has been resolved, most probably by parse termination!\n          return this.parseError(p.errStr, p, this.JisonLexerError) || this.ERROR;\n        }\n      }\n\n      var rule_ids = spec.rules;\n      var regexes = spec.__rule_regexes;\n      var len = spec.__rule_count;\n\n      // Note: the arrays are 1-based, while `len` itself is a valid index,\n      // hence the non-standard less-or-equal check in the next loop condition!\n      for (var i = 1; i <= len; i++) {\n        tempMatch = this._input.match(regexes[i]);\n\n        if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {\n          match = tempMatch;\n          index = i;\n\n          if (this.options.backtrack_lexer) {\n            token = this.test_match(tempMatch, rule_ids[i]);\n\n            if (token !== false) {\n              return token;\n            } else if (this._backtrack) {\n              match = undefined;\n              continue;  // rule action called reject() implying a rule MISmatch. \n            } else {\n              // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n              return false;\n            }\n          } else if (!this.options.flex) {\n            break;\n          }\n        }\n      }\n\n      if (match) {\n        token = this.test_match(match, rule_ids[index]);\n\n        if (token !== false) {\n          return token;\n        }\n\n        // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)\n        return false;\n      }\n\n      if (!this._input) {\n        this.done = true;\n        this.clear();\n        return this.EOF;\n      } else {\n        var lineno_msg = '';\n\n        if (this.options.trackPosition) {\n          lineno_msg = ' on line ' + (this.yylineno + 1);\n        }\n\n        var p = this.constructLexErrorInfo(\n          'Lexical error' + lineno_msg + ': Unrecognized text.',\n          this.options.lexerErrorsAreRecoverable\n        );\n\n        var pendingInput = this._input;\n        var activeCondition = this.topState();\n        var conditionStackDepth = this.conditionStack.length;\n        token = this.parseError(p.errStr, p, this.JisonLexerError) || this.ERROR;\n\n        if (token === this.ERROR) {\n          // we can try to recover from a lexer error that `parseError()` did not 'recover' for us\n          // by moving forward at least one character at a time IFF the (user-specified?) `parseError()`\n          // has not consumed/modified any pending input or changed state in the error handler:\n          if (!this.matches && // and make sure the input has been modified/consumed ...\n          pendingInput === this._input && // ...or the lexer state has been modified significantly enough\n          // to merit a non-consuming error handling action right now.\n          activeCondition === this.topState() && conditionStackDepth === this.conditionStack.length) {\n            this.input();\n          }\n        }\n\n        return token;\n      }\n    },\n\n    /**\n     * return next match that has a token\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    lex: function lexer_lex() {\n      var r;\n\n      // allow the PRE/POST handlers set/modify the return token for maximum flexibility of the generated lexer:\n      if (typeof this.pre_lex === 'function') {\n        r = this.pre_lex.call(this, 0);\n      }\n\n      if (typeof this.options.pre_lex === 'function') {\n        // (also account for a userdef function which does not return any value: keep the token as is)\n        r = this.options.pre_lex.call(this, r) || r;\n      }\n\n      if (this.yy && typeof this.yy.pre_lex === 'function') {\n        // (also account for a userdef function which does not return any value: keep the token as is)\n        r = this.yy.pre_lex.call(this, r) || r;\n      }\n\n      while (!r) {\n        r = this.next();\n      }\n\n      if (this.yy && typeof this.yy.post_lex === 'function') {\n        // (also account for a userdef function which does not return any value: keep the token as is)\n        r = this.yy.post_lex.call(this, r) || r;\n      }\n\n      if (typeof this.options.post_lex === 'function') {\n        // (also account for a userdef function which does not return any value: keep the token as is)\n        r = this.options.post_lex.call(this, r) || r;\n      }\n\n      if (typeof this.post_lex === 'function') {\n        // (also account for a userdef function which does not return any value: keep the token as is)\n        r = this.post_lex.call(this, r) || r;\n      }\n\n      return r;\n    },\n\n    /**\n     * return next match that has a token. Identical to the `lex()` API but does not invoke any of the \n     * `pre_lex()` nor any of the `post_lex()` callbacks.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    fastLex: function lexer_fastLex() {\n      var r;\n\n      while (!r) {\n        r = this.next();\n      }\n\n      return r;\n    },\n\n    /**\n     * return info about the lexer state that can help a parser or other lexer API user to use the\n     * most efficient means available. This API is provided to aid run-time performance for larger\n     * systems which employ this lexer.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    canIUse: function lexer_canIUse() {\n      var rv = {\n        fastLex: !(typeof this.pre_lex === 'function' || typeof this.options.pre_lex === 'function' || this.yy && typeof this.yy.pre_lex === 'function' || this.yy && typeof this.yy.post_lex === 'function' || typeof this.options.post_lex === 'function' || typeof this.post_lex === 'function') && typeof this.fastLex === 'function'\n      };\n\n      return rv;\n    },\n\n    /**\n     * backwards compatible alias for `pushState()`;\n     * the latter is symmetrical with `popState()` and we advise to use\n     * those APIs in any modern lexer code, rather than `begin()`.\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    begin: function lexer_begin(condition) {\n      return this.pushState(condition);\n    },\n\n    /**\n     * activates a new lexer condition state (pushes the new lexer\n     * condition state onto the condition stack)\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    pushState: function lexer_pushState(condition) {\n      this.conditionStack.push(condition);\n      this.__currentRuleSet__ = null;\n      return this;\n    },\n\n    /**\n     * pop the previously active lexer condition state off the condition\n     * stack\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    popState: function lexer_popState() {\n      var n = this.conditionStack.length - 1;\n\n      if (n > 0) {\n        this.__currentRuleSet__ = null;\n        return this.conditionStack.pop();\n      } else {\n        return this.conditionStack[0];\n      }\n    },\n\n    /**\n     * return the currently active lexer condition state; when an index\n     * argument is provided it produces the N-th previous condition state,\n     * if available\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    topState: function lexer_topState(n) {\n      n = this.conditionStack.length - 1 - Math.abs(n || 0);\n\n      if (n >= 0) {\n        return this.conditionStack[n];\n      } else {\n        return 'INITIAL';\n      }\n    },\n\n    /**\n     * (internal) determine the lexer rule set which is active for the\n     * currently active lexer condition state\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    _currentRules: function lexer__currentRules() {\n      if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {\n        return this.conditions[this.conditionStack[this.conditionStack.length - 1]];\n      } else {\n        return this.conditions['INITIAL'];\n      }\n    },\n\n    /**\n     * return the number of states currently on the stack\n     * \n     * @public\n     * @this {RegExpLexer}\n     */\n    stateStackSize: function lexer_stateStackSize() {\n      return this.conditionStack.length;\n    },\n\n    options: {\n      trackPosition: true\n    },\n\n    JisonLexerError: JisonLexerError,\n\n    performAction: function lexer__performAction(yy, yyrulenumber, YY_START) {\n      var yy_ = this;\n      var YYSTATE = YY_START;\n\n      switch (yyrulenumber) {\n      case 0:\n        /*! Conditions:: INITIAL */\n        /*! Rule::       \\s+ */\n        /* skip whitespace */\n        break;\n\n      default:\n        return this.simpleCaseActionClusters[yyrulenumber];\n      }\n    },\n\n    simpleCaseActionClusters: {\n      /*! Conditions:: INITIAL */\n      /*! Rule::       \\* */\n      1: 5,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       \\/ */\n      2: 6,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       \\+ */\n      3: 3,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       - */\n      4: 4,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)px\\b */\n      5: 13,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)cm\\b */\n      6: 13,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)mm\\b */\n      7: 13,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)in\\b */\n      8: 13,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)pt\\b */\n      9: 13,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)pc\\b */\n      10: 13,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)deg\\b */\n      11: 14,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)grad\\b */\n      12: 14,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)rad\\b */\n      13: 14,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)turn\\b */\n      14: 14,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)s\\b */\n      15: 15,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)ms\\b */\n      16: 15,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)Hz\\b */\n      17: 16,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)kHz\\b */\n      18: 16,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)dpi\\b */\n      19: 17,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)dpcm\\b */\n      20: 17,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)dppx\\b */\n      21: 17,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)em\\b */\n      22: 18,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)ex\\b */\n      23: 19,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)ch\\b */\n      24: 20,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)rem\\b */\n      25: 21,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)vw\\b */\n      26: 23,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)vh\\b */\n      27: 22,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)vmin\\b */\n      28: 24,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)vmax\\b */\n      29: 25,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)% */\n      30: 26,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([0-9]+(\\.[0-9]*)?|\\.[0-9]+)\\b */\n      31: 11,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       (calc) */\n      32: 9,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       (var\\([^\\)]*\\)) */\n      33: 12,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       ([a-z]+) */\n      34: 10,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       \\( */\n      35: 7,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       \\) */\n      36: 8,\n\n      /*! Conditions:: INITIAL */\n      /*! Rule::       $ */\n      37: 1\n    },\n\n    rules: [\n      /*  0: */  /^(?:\\s+)/,\n      /*  1: */  /^(?:\\*)/,\n      /*  2: */  /^(?:\\/)/,\n      /*  3: */  /^(?:\\+)/,\n      /*  4: */  /^(?:-)/,\n      /*  5: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)px\\b)/,\n      /*  6: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)cm\\b)/,\n      /*  7: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)mm\\b)/,\n      /*  8: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)in\\b)/,\n      /*  9: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)pt\\b)/,\n      /* 10: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)pc\\b)/,\n      /* 11: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)deg\\b)/,\n      /* 12: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)grad\\b)/,\n      /* 13: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)rad\\b)/,\n      /* 14: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)turn\\b)/,\n      /* 15: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)s\\b)/,\n      /* 16: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)ms\\b)/,\n      /* 17: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)Hz\\b)/,\n      /* 18: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)kHz\\b)/,\n      /* 19: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)dpi\\b)/,\n      /* 20: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)dpcm\\b)/,\n      /* 21: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)dppx\\b)/,\n      /* 22: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)em\\b)/,\n      /* 23: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)ex\\b)/,\n      /* 24: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)ch\\b)/,\n      /* 25: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)rem\\b)/,\n      /* 26: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)vw\\b)/,\n      /* 27: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)vh\\b)/,\n      /* 28: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)vmin\\b)/,\n      /* 29: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)vmax\\b)/,\n      /* 30: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)%)/,\n      /* 31: */  /^(?:(\\d+(\\.\\d*)?|\\.\\d+)\\b)/,\n      /* 32: */  /^(?:(calc))/,\n      /* 33: */  /^(?:(var\\([^)]*\\)))/,\n      /* 34: */  /^(?:([a-z]+))/,\n      /* 35: */  /^(?:\\()/,\n      /* 36: */  /^(?:\\))/,\n      /* 37: */  /^(?:$)/\n    ],\n\n    conditions: {\n      'INITIAL': {\n        rules: [\n          0,\n          1,\n          2,\n          3,\n          4,\n          5,\n          6,\n          7,\n          8,\n          9,\n          10,\n          11,\n          12,\n          13,\n          14,\n          15,\n          16,\n          17,\n          18,\n          19,\n          20,\n          21,\n          22,\n          23,\n          24,\n          25,\n          26,\n          27,\n          28,\n          29,\n          30,\n          31,\n          32,\n          33,\n          34,\n          35,\n          36,\n          37\n        ],\n\n        inclusive: true\n      }\n    }\n  };\n\n  return lexer;\n}();\nparser.lexer = lexer;\n\n\n\nfunction Parser() {\n  this.yy = {};\n}\nParser.prototype = parser;\nparser.Parser = Parser;\n\nreturn new Parser();\n})();\n\n        \n\n\nif (typeof require !== 'undefined' && typeof exports !== 'undefined') {\n  exports.parser = parser;\n  exports.Parser = parser.Parser;\n  exports.parse = function () {\n    return parser.parse.apply(parser, arguments);\n  };\n  \n}\n","/**\r\n * A collection of shims that provide minimal functionality of the ES6 collections.\r\n *\r\n * These implementations are not meant to be used outside of the ResizeObserver\r\n * modules as they cover only a limited range of use cases.\r\n */\r\n/* eslint-disable require-jsdoc, valid-jsdoc */\r\nvar MapShim = (function () {\r\n    if (typeof Map !== 'undefined') {\r\n        return Map;\r\n    }\r\n    /**\r\n     * Returns index in provided array that matches the specified key.\r\n     *\r\n     * @param {Array<Array>} arr\r\n     * @param {*} key\r\n     * @returns {number}\r\n     */\r\n    function getIndex(arr, key) {\r\n        var result = -1;\r\n        arr.some(function (entry, index) {\r\n            if (entry[0] === key) {\r\n                result = index;\r\n                return true;\r\n            }\r\n            return false;\r\n        });\r\n        return result;\r\n    }\r\n    return /** @class */ (function () {\r\n        function class_1() {\r\n            this.__entries__ = [];\r\n        }\r\n        Object.defineProperty(class_1.prototype, \"size\", {\r\n            /**\r\n             * @returns {boolean}\r\n             */\r\n            get: function () {\r\n                return this.__entries__.length;\r\n            },\r\n            enumerable: true,\r\n            configurable: true\r\n        });\r\n        /**\r\n         * @param {*} key\r\n         * @returns {*}\r\n         */\r\n        class_1.prototype.get = function (key) {\r\n            var index = getIndex(this.__entries__, key);\r\n            var entry = this.__entries__[index];\r\n            return entry && entry[1];\r\n        };\r\n        /**\r\n         * @param {*} key\r\n         * @param {*} value\r\n         * @returns {void}\r\n         */\r\n        class_1.prototype.set = function (key, value) {\r\n            var index = getIndex(this.__entries__, key);\r\n            if (~index) {\r\n                this.__entries__[index][1] = value;\r\n            }\r\n            else {\r\n                this.__entries__.push([key, value]);\r\n            }\r\n        };\r\n        /**\r\n         * @param {*} key\r\n         * @returns {void}\r\n         */\r\n        class_1.prototype.delete = function (key) {\r\n            var entries = this.__entries__;\r\n            var index = getIndex(entries, key);\r\n            if (~index) {\r\n                entries.splice(index, 1);\r\n            }\r\n        };\r\n        /**\r\n         * @param {*} key\r\n         * @returns {void}\r\n         */\r\n        class_1.prototype.has = function (key) {\r\n            return !!~getIndex(this.__entries__, key);\r\n        };\r\n        /**\r\n         * @returns {void}\r\n         */\r\n        class_1.prototype.clear = function () {\r\n            this.__entries__.splice(0);\r\n        };\r\n        /**\r\n         * @param {Function} callback\r\n         * @param {*} [ctx=null]\r\n         * @returns {void}\r\n         */\r\n        class_1.prototype.forEach = function (callback, ctx) {\r\n            if (ctx === void 0) { ctx = null; }\r\n            for (var _i = 0, _a = this.__entries__; _i < _a.length; _i++) {\r\n                var entry = _a[_i];\r\n                callback.call(ctx, entry[1], entry[0]);\r\n            }\r\n        };\r\n        return class_1;\r\n    }());\r\n})();\n\n/**\r\n * Detects whether window and document objects are available in current environment.\r\n */\r\nvar isBrowser = typeof window !== 'undefined' && typeof document !== 'undefined' && window.document === document;\n\n// Returns global object of a current environment.\r\nvar global$1 = (function () {\r\n    if (typeof global !== 'undefined' && global.Math === Math) {\r\n        return global;\r\n    }\r\n    if (typeof self !== 'undefined' && self.Math === Math) {\r\n        return self;\r\n    }\r\n    if (typeof window !== 'undefined' && window.Math === Math) {\r\n        return window;\r\n    }\r\n    // eslint-disable-next-line no-new-func\r\n    return Function('return this')();\r\n})();\n\n/**\r\n * A shim for the requestAnimationFrame which falls back to the setTimeout if\r\n * first one is not supported.\r\n *\r\n * @returns {number} Requests' identifier.\r\n */\r\nvar requestAnimationFrame$1 = (function () {\r\n    if (typeof requestAnimationFrame === 'function') {\r\n        // It's required to use a bounded function because IE sometimes throws\r\n        // an \"Invalid calling object\" error if rAF is invoked without the global\r\n        // object on the left hand side.\r\n        return requestAnimationFrame.bind(global$1);\r\n    }\r\n    return function (callback) { return setTimeout(function () { return callback(Date.now()); }, 1000 / 60); };\r\n})();\n\n// Defines minimum timeout before adding a trailing call.\r\nvar trailingTimeout = 2;\r\n/**\r\n * Creates a wrapper function which ensures that provided callback will be\r\n * invoked only once during the specified delay period.\r\n *\r\n * @param {Function} callback - Function to be invoked after the delay period.\r\n * @param {number} delay - Delay after which to invoke callback.\r\n * @returns {Function}\r\n */\r\nfunction throttle (callback, delay) {\r\n    var leadingCall = false, trailingCall = false, lastCallTime = 0;\r\n    /**\r\n     * Invokes the original callback function and schedules new invocation if\r\n     * the \"proxy\" was called during current request.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    function resolvePending() {\r\n        if (leadingCall) {\r\n            leadingCall = false;\r\n            callback();\r\n        }\r\n        if (trailingCall) {\r\n            proxy();\r\n        }\r\n    }\r\n    /**\r\n     * Callback invoked after the specified delay. It will further postpone\r\n     * invocation of the original function delegating it to the\r\n     * requestAnimationFrame.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    function timeoutCallback() {\r\n        requestAnimationFrame$1(resolvePending);\r\n    }\r\n    /**\r\n     * Schedules invocation of the original function.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    function proxy() {\r\n        var timeStamp = Date.now();\r\n        if (leadingCall) {\r\n            // Reject immediately following calls.\r\n            if (timeStamp - lastCallTime < trailingTimeout) {\r\n                return;\r\n            }\r\n            // Schedule new call to be in invoked when the pending one is resolved.\r\n            // This is important for \"transitions\" which never actually start\r\n            // immediately so there is a chance that we might miss one if change\r\n            // happens amids the pending invocation.\r\n            trailingCall = true;\r\n        }\r\n        else {\r\n            leadingCall = true;\r\n            trailingCall = false;\r\n            setTimeout(timeoutCallback, delay);\r\n        }\r\n        lastCallTime = timeStamp;\r\n    }\r\n    return proxy;\r\n}\n\n// Minimum delay before invoking the update of observers.\r\nvar REFRESH_DELAY = 20;\r\n// A list of substrings of CSS properties used to find transition events that\r\n// might affect dimensions of observed elements.\r\nvar transitionKeys = ['top', 'right', 'bottom', 'left', 'width', 'height', 'size', 'weight'];\r\n// Check if MutationObserver is available.\r\nvar mutationObserverSupported = typeof MutationObserver !== 'undefined';\r\n/**\r\n * Singleton controller class which handles updates of ResizeObserver instances.\r\n */\r\nvar ResizeObserverController = /** @class */ (function () {\r\n    /**\r\n     * Creates a new instance of ResizeObserverController.\r\n     *\r\n     * @private\r\n     */\r\n    function ResizeObserverController() {\r\n        /**\r\n         * Indicates whether DOM listeners have been added.\r\n         *\r\n         * @private {boolean}\r\n         */\r\n        this.connected_ = false;\r\n        /**\r\n         * Tells that controller has subscribed for Mutation Events.\r\n         *\r\n         * @private {boolean}\r\n         */\r\n        this.mutationEventsAdded_ = false;\r\n        /**\r\n         * Keeps reference to the instance of MutationObserver.\r\n         *\r\n         * @private {MutationObserver}\r\n         */\r\n        this.mutationsObserver_ = null;\r\n        /**\r\n         * A list of connected observers.\r\n         *\r\n         * @private {Array<ResizeObserverSPI>}\r\n         */\r\n        this.observers_ = [];\r\n        this.onTransitionEnd_ = this.onTransitionEnd_.bind(this);\r\n        this.refresh = throttle(this.refresh.bind(this), REFRESH_DELAY);\r\n    }\r\n    /**\r\n     * Adds observer to observers list.\r\n     *\r\n     * @param {ResizeObserverSPI} observer - Observer to be added.\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverController.prototype.addObserver = function (observer) {\r\n        if (!~this.observers_.indexOf(observer)) {\r\n            this.observers_.push(observer);\r\n        }\r\n        // Add listeners if they haven't been added yet.\r\n        if (!this.connected_) {\r\n            this.connect_();\r\n        }\r\n    };\r\n    /**\r\n     * Removes observer from observers list.\r\n     *\r\n     * @param {ResizeObserverSPI} observer - Observer to be removed.\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverController.prototype.removeObserver = function (observer) {\r\n        var observers = this.observers_;\r\n        var index = observers.indexOf(observer);\r\n        // Remove observer if it's present in registry.\r\n        if (~index) {\r\n            observers.splice(index, 1);\r\n        }\r\n        // Remove listeners if controller has no connected observers.\r\n        if (!observers.length && this.connected_) {\r\n            this.disconnect_();\r\n        }\r\n    };\r\n    /**\r\n     * Invokes the update of observers. It will continue running updates insofar\r\n     * it detects changes.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverController.prototype.refresh = function () {\r\n        var changesDetected = this.updateObservers_();\r\n        // Continue running updates if changes have been detected as there might\r\n        // be future ones caused by CSS transitions.\r\n        if (changesDetected) {\r\n            this.refresh();\r\n        }\r\n    };\r\n    /**\r\n     * Updates every observer from observers list and notifies them of queued\r\n     * entries.\r\n     *\r\n     * @private\r\n     * @returns {boolean} Returns \"true\" if any observer has detected changes in\r\n     *      dimensions of it's elements.\r\n     */\r\n    ResizeObserverController.prototype.updateObservers_ = function () {\r\n        // Collect observers that have active observations.\r\n        var activeObservers = this.observers_.filter(function (observer) {\r\n            return observer.gatherActive(), observer.hasActive();\r\n        });\r\n        // Deliver notifications in a separate cycle in order to avoid any\r\n        // collisions between observers, e.g. when multiple instances of\r\n        // ResizeObserver are tracking the same element and the callback of one\r\n        // of them changes content dimensions of the observed target. Sometimes\r\n        // this may result in notifications being blocked for the rest of observers.\r\n        activeObservers.forEach(function (observer) { return observer.broadcastActive(); });\r\n        return activeObservers.length > 0;\r\n    };\r\n    /**\r\n     * Initializes DOM listeners.\r\n     *\r\n     * @private\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverController.prototype.connect_ = function () {\r\n        // Do nothing if running in a non-browser environment or if listeners\r\n        // have been already added.\r\n        if (!isBrowser || this.connected_) {\r\n            return;\r\n        }\r\n        // Subscription to the \"Transitionend\" event is used as a workaround for\r\n        // delayed transitions. This way it's possible to capture at least the\r\n        // final state of an element.\r\n        document.addEventListener('transitionend', this.onTransitionEnd_);\r\n        window.addEventListener('resize', this.refresh);\r\n        if (mutationObserverSupported) {\r\n            this.mutationsObserver_ = new MutationObserver(this.refresh);\r\n            this.mutationsObserver_.observe(document, {\r\n                attributes: true,\r\n                childList: true,\r\n                characterData: true,\r\n                subtree: true\r\n            });\r\n        }\r\n        else {\r\n            document.addEventListener('DOMSubtreeModified', this.refresh);\r\n            this.mutationEventsAdded_ = true;\r\n        }\r\n        this.connected_ = true;\r\n    };\r\n    /**\r\n     * Removes DOM listeners.\r\n     *\r\n     * @private\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverController.prototype.disconnect_ = function () {\r\n        // Do nothing if running in a non-browser environment or if listeners\r\n        // have been already removed.\r\n        if (!isBrowser || !this.connected_) {\r\n            return;\r\n        }\r\n        document.removeEventListener('transitionend', this.onTransitionEnd_);\r\n        window.removeEventListener('resize', this.refresh);\r\n        if (this.mutationsObserver_) {\r\n            this.mutationsObserver_.disconnect();\r\n        }\r\n        if (this.mutationEventsAdded_) {\r\n            document.removeEventListener('DOMSubtreeModified', this.refresh);\r\n        }\r\n        this.mutationsObserver_ = null;\r\n        this.mutationEventsAdded_ = false;\r\n        this.connected_ = false;\r\n    };\r\n    /**\r\n     * \"Transitionend\" event handler.\r\n     *\r\n     * @private\r\n     * @param {TransitionEvent} event\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverController.prototype.onTransitionEnd_ = function (_a) {\r\n        var _b = _a.propertyName, propertyName = _b === void 0 ? '' : _b;\r\n        // Detect whether transition may affect dimensions of an element.\r\n        var isReflowProperty = transitionKeys.some(function (key) {\r\n            return !!~propertyName.indexOf(key);\r\n        });\r\n        if (isReflowProperty) {\r\n            this.refresh();\r\n        }\r\n    };\r\n    /**\r\n     * Returns instance of the ResizeObserverController.\r\n     *\r\n     * @returns {ResizeObserverController}\r\n     */\r\n    ResizeObserverController.getInstance = function () {\r\n        if (!this.instance_) {\r\n            this.instance_ = new ResizeObserverController();\r\n        }\r\n        return this.instance_;\r\n    };\r\n    /**\r\n     * Holds reference to the controller's instance.\r\n     *\r\n     * @private {ResizeObserverController}\r\n     */\r\n    ResizeObserverController.instance_ = null;\r\n    return ResizeObserverController;\r\n}());\n\n/**\r\n * Defines non-writable/enumerable properties of the provided target object.\r\n *\r\n * @param {Object} target - Object for which to define properties.\r\n * @param {Object} props - Properties to be defined.\r\n * @returns {Object} Target object.\r\n */\r\nvar defineConfigurable = (function (target, props) {\r\n    for (var _i = 0, _a = Object.keys(props); _i < _a.length; _i++) {\r\n        var key = _a[_i];\r\n        Object.defineProperty(target, key, {\r\n            value: props[key],\r\n            enumerable: false,\r\n            writable: false,\r\n            configurable: true\r\n        });\r\n    }\r\n    return target;\r\n});\n\n/**\r\n * Returns the global object associated with provided element.\r\n *\r\n * @param {Object} target\r\n * @returns {Object}\r\n */\r\nvar getWindowOf = (function (target) {\r\n    // Assume that the element is an instance of Node, which means that it\r\n    // has the \"ownerDocument\" property from which we can retrieve a\r\n    // corresponding global object.\r\n    var ownerGlobal = target && target.ownerDocument && target.ownerDocument.defaultView;\r\n    // Return the local global object if it's not possible extract one from\r\n    // provided element.\r\n    return ownerGlobal || global$1;\r\n});\n\n// Placeholder of an empty content rectangle.\r\nvar emptyRect = createRectInit(0, 0, 0, 0);\r\n/**\r\n * Converts provided string to a number.\r\n *\r\n * @param {number|string} value\r\n * @returns {number}\r\n */\r\nfunction toFloat(value) {\r\n    return parseFloat(value) || 0;\r\n}\r\n/**\r\n * Extracts borders size from provided styles.\r\n *\r\n * @param {CSSStyleDeclaration} styles\r\n * @param {...string} positions - Borders positions (top, right, ...)\r\n * @returns {number}\r\n */\r\nfunction getBordersSize(styles) {\r\n    var positions = [];\r\n    for (var _i = 1; _i < arguments.length; _i++) {\r\n        positions[_i - 1] = arguments[_i];\r\n    }\r\n    return positions.reduce(function (size, position) {\r\n        var value = styles['border-' + position + '-width'];\r\n        return size + toFloat(value);\r\n    }, 0);\r\n}\r\n/**\r\n * Extracts paddings sizes from provided styles.\r\n *\r\n * @param {CSSStyleDeclaration} styles\r\n * @returns {Object} Paddings box.\r\n */\r\nfunction getPaddings(styles) {\r\n    var positions = ['top', 'right', 'bottom', 'left'];\r\n    var paddings = {};\r\n    for (var _i = 0, positions_1 = positions; _i < positions_1.length; _i++) {\r\n        var position = positions_1[_i];\r\n        var value = styles['padding-' + position];\r\n        paddings[position] = toFloat(value);\r\n    }\r\n    return paddings;\r\n}\r\n/**\r\n * Calculates content rectangle of provided SVG element.\r\n *\r\n * @param {SVGGraphicsElement} target - Element content rectangle of which needs\r\n *      to be calculated.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction getSVGContentRect(target) {\r\n    var bbox = target.getBBox();\r\n    return createRectInit(0, 0, bbox.width, bbox.height);\r\n}\r\n/**\r\n * Calculates content rectangle of provided HTMLElement.\r\n *\r\n * @param {HTMLElement} target - Element for which to calculate the content rectangle.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction getHTMLElementContentRect(target) {\r\n    // Client width & height properties can't be\r\n    // used exclusively as they provide rounded values.\r\n    var clientWidth = target.clientWidth, clientHeight = target.clientHeight;\r\n    // By this condition we can catch all non-replaced inline, hidden and\r\n    // detached elements. Though elements with width & height properties less\r\n    // than 0.5 will be discarded as well.\r\n    //\r\n    // Without it we would need to implement separate methods for each of\r\n    // those cases and it's not possible to perform a precise and performance\r\n    // effective test for hidden elements. E.g. even jQuery's ':visible' filter\r\n    // gives wrong results for elements with width & height less than 0.5.\r\n    if (!clientWidth && !clientHeight) {\r\n        return emptyRect;\r\n    }\r\n    var styles = getWindowOf(target).getComputedStyle(target);\r\n    var paddings = getPaddings(styles);\r\n    var horizPad = paddings.left + paddings.right;\r\n    var vertPad = paddings.top + paddings.bottom;\r\n    // Computed styles of width & height are being used because they are the\r\n    // only dimensions available to JS that contain non-rounded values. It could\r\n    // be possible to utilize the getBoundingClientRect if only it's data wasn't\r\n    // affected by CSS transformations let alone paddings, borders and scroll bars.\r\n    var width = toFloat(styles.width), height = toFloat(styles.height);\r\n    // Width & height include paddings and borders when the 'border-box' box\r\n    // model is applied (except for IE).\r\n    if (styles.boxSizing === 'border-box') {\r\n        // Following conditions are required to handle Internet Explorer which\r\n        // doesn't include paddings and borders to computed CSS dimensions.\r\n        //\r\n        // We can say that if CSS dimensions + paddings are equal to the \"client\"\r\n        // properties then it's either IE, and thus we don't need to subtract\r\n        // anything, or an element merely doesn't have paddings/borders styles.\r\n        if (Math.round(width + horizPad) !== clientWidth) {\r\n            width -= getBordersSize(styles, 'left', 'right') + horizPad;\r\n        }\r\n        if (Math.round(height + vertPad) !== clientHeight) {\r\n            height -= getBordersSize(styles, 'top', 'bottom') + vertPad;\r\n        }\r\n    }\r\n    // Following steps can't be applied to the document's root element as its\r\n    // client[Width/Height] properties represent viewport area of the window.\r\n    // Besides, it's as well not necessary as the <html> itself neither has\r\n    // rendered scroll bars nor it can be clipped.\r\n    if (!isDocumentElement(target)) {\r\n        // In some browsers (only in Firefox, actually) CSS width & height\r\n        // include scroll bars size which can be removed at this step as scroll\r\n        // bars are the only difference between rounded dimensions + paddings\r\n        // and \"client\" properties, though that is not always true in Chrome.\r\n        var vertScrollbar = Math.round(width + horizPad) - clientWidth;\r\n        var horizScrollbar = Math.round(height + vertPad) - clientHeight;\r\n        // Chrome has a rather weird rounding of \"client\" properties.\r\n        // E.g. for an element with content width of 314.2px it sometimes gives\r\n        // the client width of 315px and for the width of 314.7px it may give\r\n        // 314px. And it doesn't happen all the time. So just ignore this delta\r\n        // as a non-relevant.\r\n        if (Math.abs(vertScrollbar) !== 1) {\r\n            width -= vertScrollbar;\r\n        }\r\n        if (Math.abs(horizScrollbar) !== 1) {\r\n            height -= horizScrollbar;\r\n        }\r\n    }\r\n    return createRectInit(paddings.left, paddings.top, width, height);\r\n}\r\n/**\r\n * Checks whether provided element is an instance of the SVGGraphicsElement.\r\n *\r\n * @param {Element} target - Element to be checked.\r\n * @returns {boolean}\r\n */\r\nvar isSVGGraphicsElement = (function () {\r\n    // Some browsers, namely IE and Edge, don't have the SVGGraphicsElement\r\n    // interface.\r\n    if (typeof SVGGraphicsElement !== 'undefined') {\r\n        return function (target) { return target instanceof getWindowOf(target).SVGGraphicsElement; };\r\n    }\r\n    // If it's so, then check that element is at least an instance of the\r\n    // SVGElement and that it has the \"getBBox\" method.\r\n    // eslint-disable-next-line no-extra-parens\r\n    return function (target) { return (target instanceof getWindowOf(target).SVGElement &&\r\n        typeof target.getBBox === 'function'); };\r\n})();\r\n/**\r\n * Checks whether provided element is a document element (<html>).\r\n *\r\n * @param {Element} target - Element to be checked.\r\n * @returns {boolean}\r\n */\r\nfunction isDocumentElement(target) {\r\n    return target === getWindowOf(target).document.documentElement;\r\n}\r\n/**\r\n * Calculates an appropriate content rectangle for provided html or svg element.\r\n *\r\n * @param {Element} target - Element content rectangle of which needs to be calculated.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction getContentRect(target) {\r\n    if (!isBrowser) {\r\n        return emptyRect;\r\n    }\r\n    if (isSVGGraphicsElement(target)) {\r\n        return getSVGContentRect(target);\r\n    }\r\n    return getHTMLElementContentRect(target);\r\n}\r\n/**\r\n * Creates rectangle with an interface of the DOMRectReadOnly.\r\n * Spec: https://drafts.fxtf.org/geometry/#domrectreadonly\r\n *\r\n * @param {DOMRectInit} rectInit - Object with rectangle's x/y coordinates and dimensions.\r\n * @returns {DOMRectReadOnly}\r\n */\r\nfunction createReadOnlyRect(_a) {\r\n    var x = _a.x, y = _a.y, width = _a.width, height = _a.height;\r\n    // If DOMRectReadOnly is available use it as a prototype for the rectangle.\r\n    var Constr = typeof DOMRectReadOnly !== 'undefined' ? DOMRectReadOnly : Object;\r\n    var rect = Object.create(Constr.prototype);\r\n    // Rectangle's properties are not writable and non-enumerable.\r\n    defineConfigurable(rect, {\r\n        x: x, y: y, width: width, height: height,\r\n        top: y,\r\n        right: x + width,\r\n        bottom: height + y,\r\n        left: x\r\n    });\r\n    return rect;\r\n}\r\n/**\r\n * Creates DOMRectInit object based on the provided dimensions and the x/y coordinates.\r\n * Spec: https://drafts.fxtf.org/geometry/#dictdef-domrectinit\r\n *\r\n * @param {number} x - X coordinate.\r\n * @param {number} y - Y coordinate.\r\n * @param {number} width - Rectangle's width.\r\n * @param {number} height - Rectangle's height.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction createRectInit(x, y, width, height) {\r\n    return { x: x, y: y, width: width, height: height };\r\n}\n\n/**\r\n * Class that is responsible for computations of the content rectangle of\r\n * provided DOM element and for keeping track of it's changes.\r\n */\r\nvar ResizeObservation = /** @class */ (function () {\r\n    /**\r\n     * Creates an instance of ResizeObservation.\r\n     *\r\n     * @param {Element} target - Element to be observed.\r\n     */\r\n    function ResizeObservation(target) {\r\n        /**\r\n         * Broadcasted width of content rectangle.\r\n         *\r\n         * @type {number}\r\n         */\r\n        this.broadcastWidth = 0;\r\n        /**\r\n         * Broadcasted height of content rectangle.\r\n         *\r\n         * @type {number}\r\n         */\r\n        this.broadcastHeight = 0;\r\n        /**\r\n         * Reference to the last observed content rectangle.\r\n         *\r\n         * @private {DOMRectInit}\r\n         */\r\n        this.contentRect_ = createRectInit(0, 0, 0, 0);\r\n        this.target = target;\r\n    }\r\n    /**\r\n     * Updates content rectangle and tells whether it's width or height properties\r\n     * have changed since the last broadcast.\r\n     *\r\n     * @returns {boolean}\r\n     */\r\n    ResizeObservation.prototype.isActive = function () {\r\n        var rect = getContentRect(this.target);\r\n        this.contentRect_ = rect;\r\n        return (rect.width !== this.broadcastWidth ||\r\n            rect.height !== this.broadcastHeight);\r\n    };\r\n    /**\r\n     * Updates 'broadcastWidth' and 'broadcastHeight' properties with a data\r\n     * from the corresponding properties of the last observed content rectangle.\r\n     *\r\n     * @returns {DOMRectInit} Last observed content rectangle.\r\n     */\r\n    ResizeObservation.prototype.broadcastRect = function () {\r\n        var rect = this.contentRect_;\r\n        this.broadcastWidth = rect.width;\r\n        this.broadcastHeight = rect.height;\r\n        return rect;\r\n    };\r\n    return ResizeObservation;\r\n}());\n\nvar ResizeObserverEntry = /** @class */ (function () {\r\n    /**\r\n     * Creates an instance of ResizeObserverEntry.\r\n     *\r\n     * @param {Element} target - Element that is being observed.\r\n     * @param {DOMRectInit} rectInit - Data of the element's content rectangle.\r\n     */\r\n    function ResizeObserverEntry(target, rectInit) {\r\n        var contentRect = createReadOnlyRect(rectInit);\r\n        // According to the specification following properties are not writable\r\n        // and are also not enumerable in the native implementation.\r\n        //\r\n        // Property accessors are not being used as they'd require to define a\r\n        // private WeakMap storage which may cause memory leaks in browsers that\r\n        // don't support this type of collections.\r\n        defineConfigurable(this, { target: target, contentRect: contentRect });\r\n    }\r\n    return ResizeObserverEntry;\r\n}());\n\nvar ResizeObserverSPI = /** @class */ (function () {\r\n    /**\r\n     * Creates a new instance of ResizeObserver.\r\n     *\r\n     * @param {ResizeObserverCallback} callback - Callback function that is invoked\r\n     *      when one of the observed elements changes it's content dimensions.\r\n     * @param {ResizeObserverController} controller - Controller instance which\r\n     *      is responsible for the updates of observer.\r\n     * @param {ResizeObserver} callbackCtx - Reference to the public\r\n     *      ResizeObserver instance which will be passed to callback function.\r\n     */\r\n    function ResizeObserverSPI(callback, controller, callbackCtx) {\r\n        /**\r\n         * Collection of resize observations that have detected changes in dimensions\r\n         * of elements.\r\n         *\r\n         * @private {Array<ResizeObservation>}\r\n         */\r\n        this.activeObservations_ = [];\r\n        /**\r\n         * Registry of the ResizeObservation instances.\r\n         *\r\n         * @private {Map<Element, ResizeObservation>}\r\n         */\r\n        this.observations_ = new MapShim();\r\n        if (typeof callback !== 'function') {\r\n            throw new TypeError('The callback provided as parameter 1 is not a function.');\r\n        }\r\n        this.callback_ = callback;\r\n        this.controller_ = controller;\r\n        this.callbackCtx_ = callbackCtx;\r\n    }\r\n    /**\r\n     * Starts observing provided element.\r\n     *\r\n     * @param {Element} target - Element to be observed.\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverSPI.prototype.observe = function (target) {\r\n        if (!arguments.length) {\r\n            throw new TypeError('1 argument required, but only 0 present.');\r\n        }\r\n        // Do nothing if current environment doesn't have the Element interface.\r\n        if (typeof Element === 'undefined' || !(Element instanceof Object)) {\r\n            return;\r\n        }\r\n        if (!(target instanceof getWindowOf(target).Element)) {\r\n            throw new TypeError('parameter 1 is not of type \"Element\".');\r\n        }\r\n        var observations = this.observations_;\r\n        // Do nothing if element is already being observed.\r\n        if (observations.has(target)) {\r\n            return;\r\n        }\r\n        observations.set(target, new ResizeObservation(target));\r\n        this.controller_.addObserver(this);\r\n        // Force the update of observations.\r\n        this.controller_.refresh();\r\n    };\r\n    /**\r\n     * Stops observing provided element.\r\n     *\r\n     * @param {Element} target - Element to stop observing.\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverSPI.prototype.unobserve = function (target) {\r\n        if (!arguments.length) {\r\n            throw new TypeError('1 argument required, but only 0 present.');\r\n        }\r\n        // Do nothing if current environment doesn't have the Element interface.\r\n        if (typeof Element === 'undefined' || !(Element instanceof Object)) {\r\n            return;\r\n        }\r\n        if (!(target instanceof getWindowOf(target).Element)) {\r\n            throw new TypeError('parameter 1 is not of type \"Element\".');\r\n        }\r\n        var observations = this.observations_;\r\n        // Do nothing if element is not being observed.\r\n        if (!observations.has(target)) {\r\n            return;\r\n        }\r\n        observations.delete(target);\r\n        if (!observations.size) {\r\n            this.controller_.removeObserver(this);\r\n        }\r\n    };\r\n    /**\r\n     * Stops observing all elements.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverSPI.prototype.disconnect = function () {\r\n        this.clearActive();\r\n        this.observations_.clear();\r\n        this.controller_.removeObserver(this);\r\n    };\r\n    /**\r\n     * Collects observation instances the associated element of which has changed\r\n     * it's content rectangle.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverSPI.prototype.gatherActive = function () {\r\n        var _this = this;\r\n        this.clearActive();\r\n        this.observations_.forEach(function (observation) {\r\n            if (observation.isActive()) {\r\n                _this.activeObservations_.push(observation);\r\n            }\r\n        });\r\n    };\r\n    /**\r\n     * Invokes initial callback function with a list of ResizeObserverEntry\r\n     * instances collected from active resize observations.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverSPI.prototype.broadcastActive = function () {\r\n        // Do nothing if observer doesn't have active observations.\r\n        if (!this.hasActive()) {\r\n            return;\r\n        }\r\n        var ctx = this.callbackCtx_;\r\n        // Create ResizeObserverEntry instance for every active observation.\r\n        var entries = this.activeObservations_.map(function (observation) {\r\n            return new ResizeObserverEntry(observation.target, observation.broadcastRect());\r\n        });\r\n        this.callback_.call(ctx, entries, ctx);\r\n        this.clearActive();\r\n    };\r\n    /**\r\n     * Clears the collection of active observations.\r\n     *\r\n     * @returns {void}\r\n     */\r\n    ResizeObserverSPI.prototype.clearActive = function () {\r\n        this.activeObservations_.splice(0);\r\n    };\r\n    /**\r\n     * Tells whether observer has active observations.\r\n     *\r\n     * @returns {boolean}\r\n     */\r\n    ResizeObserverSPI.prototype.hasActive = function () {\r\n        return this.activeObservations_.length > 0;\r\n    };\r\n    return ResizeObserverSPI;\r\n}());\n\n// Registry of internal observers. If WeakMap is not available use current shim\r\n// for the Map collection as it has all required methods and because WeakMap\r\n// can't be fully polyfilled anyway.\r\nvar observers = typeof WeakMap !== 'undefined' ? new WeakMap() : new MapShim();\r\n/**\r\n * ResizeObserver API. Encapsulates the ResizeObserver SPI implementation\r\n * exposing only those methods and properties that are defined in the spec.\r\n */\r\nvar ResizeObserver = /** @class */ (function () {\r\n    /**\r\n     * Creates a new instance of ResizeObserver.\r\n     *\r\n     * @param {ResizeObserverCallback} callback - Callback that is invoked when\r\n     *      dimensions of the observed elements change.\r\n     */\r\n    function ResizeObserver(callback) {\r\n        if (!(this instanceof ResizeObserver)) {\r\n            throw new TypeError('Cannot call a class as a function.');\r\n        }\r\n        if (!arguments.length) {\r\n            throw new TypeError('1 argument required, but only 0 present.');\r\n        }\r\n        var controller = ResizeObserverController.getInstance();\r\n        var observer = new ResizeObserverSPI(callback, controller, this);\r\n        observers.set(this, observer);\r\n    }\r\n    return ResizeObserver;\r\n}());\r\n// Expose public methods of ResizeObserver.\r\n[\r\n    'observe',\r\n    'unobserve',\r\n    'disconnect'\r\n].forEach(function (method) {\r\n    ResizeObserver.prototype[method] = function () {\r\n        var _a;\r\n        return (_a = observers.get(this))[method].apply(_a, arguments);\r\n    };\r\n});\n\nvar index = (function () {\r\n    // Export existing implementation if available.\r\n    if (typeof global$1.ResizeObserver !== 'undefined') {\r\n        return global$1.ResizeObserver;\r\n    }\r\n    return ResizeObserver;\r\n})();\n\nexport default index;\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","module.exports = function(module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n","/**\n * @fileOverview Area\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport classNames from 'classnames';\nimport Animate from 'react-smooth';\nimport _ from 'lodash';\nimport Curve, { CurveType, Point as CurvePoint } from '../shape/Curve';\nimport Dot, { Props as DotProps } from '../shape/Dot';\nimport Layer from '../container/Layer';\nimport LabelList from '../component/LabelList';\nimport Global from '../util/Global';\nimport { isNumber, uniqueId, interpolateNumber } from '../util/DataUtils';\nimport { getCateCoordinateOfLine, getValueByDataKey } from '../util/ChartUtils';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\nimport {\n  D3Scale,\n  LegendType,\n  TooltipType,\n  AnimationTiming,\n  PresentationAttributes,\n  filterProps,\n  ChartOffset,\n  Coordinate,\n  DataKey,\n  TickItem,\n} from '../util/types';\n\ntype AreaDot = ReactElement<SVGElement> | ((props: any) => SVGElement) | DotProps | boolean;\ninterface AreaPointItem extends CurvePoint {\n  value?: number | number[];\n  payload?: any;\n}\n\ninterface InternalAreaProps {\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  top?: number;\n  left?: number;\n  width?: number;\n  height?: number;\n  points?: AreaPointItem[];\n  baseLine?: number | Coordinate[];\n}\n\ninterface AreaProps extends InternalAreaProps {\n  className?: string;\n  dataKey: DataKey<any>;\n  type?: CurveType;\n  unit?: string | number;\n  name?: string | number;\n  xAxisId?: string | number;\n  yAxisId?: string | number;\n\n  stackId?: string | number;\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  connectNulls?: boolean;\n  // whether have dot in line\n  activeDot?: AreaDot;\n  dot?: AreaDot;\n\n  label?: any;\n  layout?: 'horizontal' | 'vertical';\n  hide?: boolean;\n  baseValue?: number | 'dataMin' | 'dataMax';\n  isRange?: boolean;\n\n  onAnimationStart?: () => void;\n  onAnimationEnd?: () => void;\n\n  isAnimationActive?: boolean;\n  animateNewValues?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n  animationId?: number;\n  id?: string;\n}\n\ntype Props = PresentationAttributes<SVGElement> & AreaProps;\n\ninterface State {\n  prevPoints?: AreaPointItem[];\n  prevBaseLine?: number | Coordinate[];\n  isAnimationFinished?: boolean;\n  totalLength?: number;\n}\n\nclass Area extends PureComponent<Props, State> {\n  static displayName = 'Area';\n\n  static defaultProps = {\n    stroke: '#3182bd',\n    fill: '#3182bd',\n    fillOpacity: 0.6,\n    xAxisId: 0,\n    yAxisId: 0,\n    legendType: 'line',\n    connectNulls: false,\n    // points of area\n    points: [] as AreaPointItem[],\n    dot: false,\n    activeDot: true,\n    hide: false,\n\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n  };\n\n  static getBaseValue = (props: Props, xAxis: Props['xAxis'], yAxis: Props['yAxis']): number => {\n    const { layout, baseValue } = props;\n\n    if (isNumber(baseValue) && typeof baseValue === 'number') {\n      return baseValue;\n    }\n\n    const numericAxis = layout === 'horizontal' ? yAxis : xAxis;\n    const domain = numericAxis.scale.domain();\n\n    if (numericAxis.type === 'number') {\n      const max = Math.max(domain[0], domain[1]);\n      const min = Math.min(domain[0], domain[1]);\n\n      if (baseValue === 'dataMin') {\n        return min;\n      }\n      if (baseValue === 'dataMax') {\n        return max;\n      }\n\n      return max < 0 ? max : Math.max(Math.min(domain[0], domain[1]), 0);\n    }\n\n    if (baseValue === 'dataMin') {\n      return domain[0];\n    }\n    if (baseValue === 'dataMax') {\n      return domain[1];\n    }\n\n    return domain[0];\n  };\n\n  static getComposedData = ({\n    props,\n    xAxis,\n    yAxis,\n    xAxisTicks,\n    yAxisTicks,\n    bandSize,\n    dataKey,\n    stackedData,\n    dataStartIndex,\n    displayedData,\n    offset,\n  }: {\n    props: Props;\n    item: Area;\n    bandSize: number;\n    xAxis: InternalAreaProps['xAxis'];\n    yAxis: InternalAreaProps['yAxis'];\n    xAxisTicks: TickItem[];\n    yAxisTicks: TickItem[];\n    stackedData: number[][];\n    dataStartIndex: number;\n    offset: ChartOffset;\n    displayedData: any[];\n    dataKey: Props['dataKey'];\n  }) => {\n    const { layout } = props;\n    const hasStack = stackedData && stackedData.length;\n    const baseValue = Area.getBaseValue(props, xAxis, yAxis);\n    let isRange = false;\n\n    const points = displayedData.map((entry, index) => {\n      const originalValue = getValueByDataKey(entry, dataKey);\n      let value;\n\n      if (hasStack) {\n        value = stackedData[dataStartIndex + index];\n      } else {\n        value = originalValue;\n\n        if (!_.isArray(value)) {\n          value = [baseValue, value];\n        } else {\n          isRange = true;\n        }\n      }\n\n      const isBreakPoint = _.isNil(value[1]) || (hasStack && _.isNil(originalValue));\n      if (layout === 'horizontal') {\n        return {\n          x: getCateCoordinateOfLine({ axis: xAxis, ticks: xAxisTicks, bandSize, entry, index }),\n          y: isBreakPoint ? null : yAxis.scale(value[1]),\n          value,\n          payload: entry,\n        };\n      }\n\n      return {\n        x: isBreakPoint ? null : xAxis.scale(value[1]),\n        y: getCateCoordinateOfLine({ axis: yAxis, ticks: yAxisTicks, bandSize, entry, index }),\n        value,\n        payload: entry,\n      };\n    });\n\n    let baseLine;\n    if (hasStack || isRange) {\n      baseLine = points.map(entry => {\n        if (layout === 'horizontal') {\n          return {\n            x: entry.x,\n            y: !_.isNil(_.get(entry, 'value[0]')) ? yAxis.scale(_.get(entry, 'value[0]')) : null,\n          };\n        }\n        return {\n          x: !_.isNil(_.get(entry, 'value[0]')) ? xAxis.scale(_.get(entry, 'value[0]')) : null,\n          y: entry.y,\n        };\n      });\n    } else if (layout === 'horizontal') {\n      baseLine = yAxis.scale(baseValue);\n    } else {\n      baseLine = xAxis.scale(baseValue);\n    }\n\n    return { points, baseLine, layout, isRange, ...offset };\n  };\n\n  static renderDotItem = (option: AreaDot, props: any) => {\n    let dotItem;\n\n    if (React.isValidElement(option)) {\n      dotItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      dotItem = option(props);\n    } else {\n      dotItem = <Dot {...props} className=\"recharts-area-dot\" />;\n    }\n\n    return dotItem;\n  };\n\n  state: State = { isAnimationFinished: true };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, points, baseLine } = this.props;\n\n    if (nextProps.animationId !== animationId) {\n      this.cachePrevData(points, baseLine);\n    }\n  }\n\n  id = uniqueId('recharts-area-');\n\n  cachePrevData = (points: AreaPointItem[], baseLine: Props['baseLine']) => {\n    this.setState({\n      prevPoints: points,\n      prevBaseLine: baseLine,\n    });\n  };\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n\n    this.setState({ isAnimationFinished: true });\n\n    if (_.isFunction(onAnimationEnd)) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n    this.setState({ isAnimationFinished: false });\n\n    if (_.isFunction(onAnimationStart)) {\n      onAnimationStart();\n    }\n  };\n\n  renderDots(needClip: boolean, clipPathId: string) {\n    const { isAnimationActive } = this.props;\n    const { isAnimationFinished } = this.state;\n\n    if (isAnimationActive && !isAnimationFinished) {\n      return null;\n    }\n\n    const { dot, points, dataKey } = this.props;\n    const areaProps = filterProps(this.props);\n    const customDotProps = filterProps(dot, true);\n\n    const dots = points.map((entry, i) => {\n      const dotProps = {\n        key: `dot-${i}`,\n        r: 3,\n        ...areaProps,\n        ...customDotProps,\n        dataKey,\n        cx: entry.x,\n        cy: entry.y,\n        index: i,\n        value: entry.value,\n        payload: entry.payload,\n      };\n\n      return Area.renderDotItem(dot, dotProps);\n    });\n    const dotsProps = {\n      clipPath: needClip ? `url(#clipPath-${clipPathId})` : null,\n    };\n    return (\n      <Layer className=\"recharts-area-dots\" {...dotsProps}>\n        {dots}\n      </Layer>\n    );\n  }\n\n  renderHorizontalRect(alpha: number) {\n    const { baseLine, points, strokeWidth } = this.props;\n    const startX = points[0].x;\n    const endX = points[points.length - 1].x;\n    const width = alpha * Math.abs(startX - endX);\n    let maxY = _.max(points.map(entry => entry.y || 0));\n\n    if (isNumber(baseLine) && typeof baseLine === 'number') {\n      maxY = Math.max(baseLine, maxY);\n    } else if (baseLine && _.isArray(baseLine) && baseLine.length) {\n      maxY = Math.max(_.max(baseLine.map(entry => entry.y || 0)), maxY);\n    }\n\n    if (isNumber(maxY)) {\n      return (\n        <rect\n          x={startX < endX ? startX : startX - width}\n          y={0}\n          width={width}\n          height={Math.floor(maxY + (strokeWidth ? parseInt(`${strokeWidth}`, 10) : 1))}\n        />\n      );\n    }\n\n    return null;\n  }\n\n  renderVerticalRect(alpha: number) {\n    const { baseLine, points, strokeWidth } = this.props;\n    const startY = points[0].y;\n    const endY = points[points.length - 1].y;\n    const height = alpha * Math.abs(startY - endY);\n    let maxX = _.max(points.map(entry => entry.x || 0));\n\n    if (isNumber(baseLine) && typeof baseLine === 'number') {\n      maxX = Math.max(baseLine, maxX);\n    } else if (baseLine && _.isArray(baseLine) && baseLine.length) {\n      maxX = Math.max(_.max(baseLine.map(entry => entry.x || 0)), maxX);\n    }\n\n    if (isNumber(maxX)) {\n      return (\n        <rect\n          x={0}\n          y={startY < endY ? startY : startY - height}\n          width={maxX + (strokeWidth ? parseInt(`${strokeWidth}`, 10) : 1)}\n          height={Math.floor(height)}\n        />\n      );\n    }\n\n    return null;\n  }\n\n  renderClipRect(alpha: number) {\n    const { layout } = this.props;\n\n    if (layout === 'vertical') {\n      return this.renderVerticalRect(alpha);\n    }\n\n    return this.renderHorizontalRect(alpha);\n  }\n\n  renderAreaStatically(points: AreaPointItem[], baseLine: Props['baseLine'], needClip: boolean, clipPathId: string) {\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    const { layout, type, stroke, connectNulls, isRange, ref, ...others } = this.props;\n\n    return (\n      <Layer clipPath={needClip ? `url(#clipPath-${clipPathId})` : null}>\n        <Curve\n          {...filterProps(others, true)}\n          points={points}\n          connectNulls={connectNulls}\n          type={type}\n          baseLine={baseLine}\n          layout={layout}\n          stroke=\"none\"\n          className=\"recharts-area-area\"\n        />\n        {stroke !== 'none' && (\n          <Curve\n            {...filterProps(this.props)}\n            className=\"recharts-area-curve\"\n            layout={layout}\n            type={type}\n            connectNulls={connectNulls}\n            fill=\"none\"\n            points={points}\n          />\n        )}\n        {stroke !== 'none' && isRange && (\n          <Curve\n            {...filterProps(this.props)}\n            className=\"recharts-area-curve\"\n            layout={layout}\n            type={type}\n            connectNulls={connectNulls}\n            fill=\"none\"\n            points={baseLine as CurvePoint[]}\n          />\n        )}\n      </Layer>\n    );\n  }\n\n  renderAreaWithAnimation(needClip: boolean, clipPathId: string) {\n    const {\n      points,\n      baseLine,\n      isAnimationActive,\n      animationBegin,\n      animationDuration,\n      animationEasing,\n      animationId,\n    } = this.props;\n    const { prevPoints, prevBaseLine } = this.state;\n    // const clipPathId = _.isNil(id) ? this.id : id;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`area-${animationId}`}\n        onAnimationEnd={this.handleAnimationEnd}\n        onAnimationStart={this.handleAnimationStart}\n      >\n        {({ t }: { t: number }) => {\n          if (prevPoints) {\n            const prevPointsDiffFactor = prevPoints.length / points.length;\n            // update animtaion\n            const stepPoints = points.map((entry, index) => {\n              const prevPointIndex = Math.floor(index * prevPointsDiffFactor);\n              if (prevPoints[prevPointIndex]) {\n                const prev = prevPoints[prevPointIndex];\n                const interpolatorX = interpolateNumber(prev.x, entry.x);\n                const interpolatorY = interpolateNumber(prev.y, entry.y);\n\n                return { ...entry, x: interpolatorX(t), y: interpolatorY(t) };\n              }\n\n              return entry;\n            });\n            let stepBaseLine;\n\n            if (isNumber(baseLine) && typeof baseLine === 'number') {\n              const interpolator = interpolateNumber(prevBaseLine as number, baseLine);\n              stepBaseLine = interpolator(t);\n            } else if (_.isNil(baseLine) || _.isNaN(baseLine)) {\n              const interpolator = interpolateNumber(prevBaseLine as number, 0);\n              stepBaseLine = interpolator(t);\n            } else {\n              stepBaseLine = (baseLine as Coordinate[]).map((entry, index) => {\n                const prevPointIndex = Math.floor(index * prevPointsDiffFactor);\n                if ((prevBaseLine as Coordinate[])[prevPointIndex]) {\n                  const prev = (prevBaseLine as Coordinate[])[prevPointIndex];\n                  const interpolatorX = interpolateNumber(prev.x, entry.x);\n                  const interpolatorY = interpolateNumber(prev.y, entry.y);\n\n                  return { ...entry, x: interpolatorX(t), y: interpolatorY(t) };\n                }\n\n                return entry;\n              });\n            }\n\n            return this.renderAreaStatically(stepPoints, stepBaseLine, needClip, clipPathId);\n          }\n\n          return (\n            <Layer>\n              <defs>\n                <clipPath id={`animationClipPath-${clipPathId}`}>{this.renderClipRect(t)}</clipPath>\n              </defs>\n              <Layer clipPath={`url(#animationClipPath-${clipPathId})`}>\n                {this.renderAreaStatically(points, baseLine, needClip, clipPathId)}\n              </Layer>\n            </Layer>\n          );\n        }}\n      </Animate>\n    );\n  }\n\n  renderArea(needClip: boolean, clipPathId: string) {\n    const { points, baseLine, isAnimationActive } = this.props;\n    const { prevPoints, prevBaseLine, totalLength } = this.state;\n\n    if (\n      isAnimationActive &&\n      points &&\n      points.length &&\n      ((!prevPoints && totalLength > 0) || !_.isEqual(prevPoints, points) || !_.isEqual(prevBaseLine, baseLine))\n    ) {\n      return this.renderAreaWithAnimation(needClip, clipPathId);\n    }\n\n    return this.renderAreaStatically(points, baseLine, needClip, clipPathId);\n  }\n\n  render() {\n    const { hide, dot, points, className, top, left, xAxis, yAxis, width, height, isAnimationActive, id } = this.props;\n\n    if (hide || !points || !points.length) {\n      return null;\n    }\n\n    const { isAnimationFinished } = this.state;\n    const hasSinglePoint = points.length === 1;\n    const layerClass = classNames('recharts-area', className);\n    const needClip = (xAxis && xAxis.allowDataOverflow) || (yAxis && yAxis.allowDataOverflow);\n    const clipPathId = _.isNil(id) ? this.id : id;\n\n    return (\n      <Layer className={layerClass}>\n        {needClip ? (\n          <defs>\n            <clipPath id={`clipPath-${clipPathId}`}>\n              <rect x={left} y={top} width={width} height={Math.floor(height)} />\n            </clipPath>\n          </defs>\n        ) : null}\n        {!hasSinglePoint ? this.renderArea(needClip, clipPathId) : null}\n        {(dot || hasSinglePoint) && this.renderDots(needClip, clipPathId)}\n        {(!isAnimationActive || isAnimationFinished) && LabelList.renderCallByParent(this.props, points)}\n      </Layer>\n    );\n  }\n}\n\nexport default Area;\n","/**\n * @fileOverview Render a group of bar\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport classNames from 'classnames';\nimport Animate from 'react-smooth';\nimport _ from 'lodash';\nimport Rectangle, { Props as RectangleProps } from '../shape/Rectangle';\nimport Layer from '../container/Layer';\nimport ErrorBar, { Props as ErrorBarProps } from './ErrorBar';\nimport Cell from '../component/Cell';\nimport LabelList from '../component/LabelList';\nimport { uniqueId, mathSign, interpolateNumber } from '../util/DataUtils';\nimport { findAllByType } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport {\n  getCateCoordinateOfBar,\n  getValueByDataKey,\n  truncateByDomain,\n  getBaseValueOfBar,\n  findPositionOfBar,\n} from '../util/ChartUtils';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\nimport {\n  D3Scale,\n  TooltipType,\n  LegendType,\n  AnimationTiming,\n  PresentationAttributes,\n  filterProps,\n  ChartOffset,\n  DataKey,\n  TickItem,\n  adaptEventsOfChild,\n} from '../util/types';\n\ninterface BarRectangleItem extends RectangleProps {\n  value?: number;\n  /** the coordinate of background rectangle */\n  background?: {\n    x?: number;\n    y?: number;\n    width?: number;\n    height?: number;\n  };\n}\n\ninterface InternalBarProps {\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number>; x?: number; width?: number };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number>; y?: number; height?: number };\n  data?: BarRectangleItem[];\n  top?: number;\n  left?: number;\n}\n\ntype RectangleShapeType = ReactElement<SVGElement> | ((props: any) => SVGElement) | RectangleProps | boolean;\n\ninterface BarProps extends InternalBarProps {\n  className?: string;\n  layout?: 'horizontal' | 'vertical';\n  xAxisId?: string | number;\n  yAxisId?: string | number;\n  stackId?: string | number;\n  barSize?: number;\n  unit?: string | number;\n  name?: string | number;\n  dataKey: DataKey<any>;\n  tooltipType?: TooltipType;\n  legendType?: LegendType;\n  minPointSize?: number;\n  maxBarSize?: number;\n  hide?: boolean;\n  shape?: ReactElement<SVGElement> | ((props: any) => SVGElement);\n  background?: RectangleShapeType;\n\n  onAnimationStart?: () => void;\n  onAnimationEnd?: () => void;\n\n  isAnimationActive?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n  animationId?: number;\n  id?: string;\n}\n\ntype Props = PresentationAttributes<SVGPathElement> & BarProps;\n\ninterface State {\n  readonly isAnimationFinished?: boolean;\n  readonly prevData?: BarRectangleItem[];\n}\n\nclass Bar extends PureComponent<Props, State> {\n  static displayName = 'Bar';\n\n  static defaultProps = {\n    xAxisId: 0,\n    yAxisId: 0,\n    legendType: 'rect',\n    minPointSize: 0,\n    hide: false,\n    // data of bar\n    data: [] as BarRectangleItem[],\n    layout: 'vertical',\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 0,\n    animationDuration: 400,\n    animationEasing: 'ease',\n  };\n\n  /**\n   * Compose the data of each group\n   * @param {Object} props Props for the component\n   * @param {Object} item        An instance of Bar\n   * @param {Array} barPosition  The offset and size of each bar\n   * @param {Object} xAxis       The configuration of x-axis\n   * @param {Object} yAxis       The configuration of y-axis\n   * @param {Array} stackedData  The stacked data of a bar item\n   * @return{Array} Composed data\n   */\n  static getComposedData = ({\n    props,\n    item,\n    barPosition,\n    bandSize,\n    xAxis,\n    yAxis,\n    xAxisTicks,\n    yAxisTicks,\n    stackedData,\n    dataStartIndex,\n    displayedData,\n    offset,\n  }: {\n    props: Props;\n    item: Bar;\n    barPosition: any;\n    bandSize: number;\n    xAxis: InternalBarProps['xAxis'];\n    yAxis: InternalBarProps['yAxis'];\n    xAxisTicks: TickItem[];\n    yAxisTicks: TickItem[];\n    stackedData: number[][];\n    dataStartIndex: number;\n    offset: ChartOffset;\n    displayedData: any[];\n  }) => {\n    const pos = findPositionOfBar(barPosition, item);\n    if (!pos) {\n      return null;\n    }\n\n    const { layout } = props;\n    const { dataKey, children, minPointSize } = item.props;\n    const numericAxis = layout === 'horizontal' ? yAxis : xAxis;\n    const stackedDomain = stackedData ? numericAxis.scale.domain() : null;\n    const baseValue = getBaseValueOfBar({ numericAxis });\n    const cells = findAllByType(children, Cell.displayName);\n\n    const rects = displayedData.map((entry, index) => {\n      let value, x, y, width, height, background;\n\n      if (stackedData) {\n        value = truncateByDomain(stackedData[dataStartIndex + index], stackedDomain);\n      } else {\n        value = getValueByDataKey(entry, dataKey);\n\n        if (!_.isArray(value)) {\n          value = [baseValue, value];\n        }\n      }\n\n      if (layout === 'horizontal') {\n        x = getCateCoordinateOfBar({\n          axis: xAxis,\n          ticks: xAxisTicks,\n          bandSize,\n          offset: pos.offset,\n          entry,\n          index,\n        });\n        y = yAxis.scale(value[1]);\n        width = pos.size;\n        height = yAxis.scale(value[0]) - yAxis.scale(value[1]);\n        background = { x, y: yAxis.y, width, height: yAxis.height };\n\n        if (Math.abs(minPointSize) > 0 && Math.abs(height) < Math.abs(minPointSize)) {\n          const delta = mathSign(height || minPointSize) * (Math.abs(minPointSize) - Math.abs(height));\n\n          y -= delta;\n          height += delta;\n        }\n      } else {\n        x = xAxis.scale(value[0]);\n        y = getCateCoordinateOfBar({\n          axis: yAxis,\n          ticks: yAxisTicks,\n          bandSize,\n          offset: pos.offset,\n          entry,\n          index,\n        });\n        width = xAxis.scale(value[1]) - xAxis.scale(value[0]);\n        height = pos.size;\n        background = { x: xAxis.x, y, width: xAxis.width, height };\n\n        if (Math.abs(minPointSize) > 0 && Math.abs(width) < Math.abs(minPointSize)) {\n          const delta = mathSign(width || minPointSize) * (Math.abs(minPointSize) - Math.abs(width));\n          width += delta;\n        }\n      }\n\n      return {\n        ...entry,\n        x,\n        y,\n        width,\n        height,\n        value: stackedData ? value : value[1],\n        payload: entry,\n        background,\n        ...(cells && cells[index] && cells[index].props),\n      };\n    });\n\n    return { data: rects, layout, ...offset };\n  };\n\n  state: State = { isAnimationFinished: false };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, data } = this.props;\n\n    if (nextProps.animationId !== animationId) {\n      this.cachePrevData(data);\n    }\n  }\n\n  id = uniqueId('recharts-bar-');\n\n  cachePrevData = (data: BarRectangleItem[]) => {\n    this.setState({ prevData: data });\n  };\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n    this.setState({ isAnimationFinished: true });\n\n    if (onAnimationEnd) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n    this.setState({ isAnimationFinished: false });\n\n    if (onAnimationStart) {\n      onAnimationStart();\n    }\n  };\n\n  static renderRectangle(option: RectangleShapeType, props: any) {\n    let rectangle;\n\n    if (React.isValidElement(option)) {\n      rectangle = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      rectangle = option(props);\n    } else {\n      rectangle = <Rectangle {...props} />;\n    }\n\n    return rectangle;\n  }\n\n  renderRectanglesStatically(data: BarRectangleItem[]) {\n    const { shape } = this.props;\n    const baseProps = filterProps(this.props);\n\n    return (\n      data &&\n      data.map((entry, i) => {\n        const props = { ...baseProps, ...entry, index: i };\n\n        return (\n          <Layer\n            className=\"recharts-bar-rectangle\"\n            {...adaptEventsOfChild(this.props, entry, i)}\n            key={`rectangle-${i}`} // eslint-disable-line react/no-array-index-key\n          >\n            {Bar.renderRectangle(shape, props)}\n          </Layer>\n        );\n      })\n    );\n  }\n\n  renderRectanglesWithAnimation() {\n    const {\n      data,\n      layout,\n      isAnimationActive,\n      animationBegin,\n      animationDuration,\n      animationEasing,\n      animationId,\n    } = this.props;\n    const { prevData } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`bar-${animationId}`}\n        onAnimationEnd={this.handleAnimationEnd}\n        onAnimationStart={this.handleAnimationStart}\n      >\n        {({ t }: { t: number }) => {\n          const stepData = data.map((entry, index) => {\n            const prev = prevData && prevData[index];\n\n            if (prev) {\n              const interpolatorX = interpolateNumber(prev.x, entry.x);\n              const interpolatorY = interpolateNumber(prev.y, entry.y);\n              const interpolatorWidth = interpolateNumber(prev.width, entry.width);\n              const interpolatorHeight = interpolateNumber(prev.height, entry.height);\n\n              return {\n                ...entry,\n                x: interpolatorX(t),\n                y: interpolatorY(t),\n                width: interpolatorWidth(t),\n                height: interpolatorHeight(t),\n              };\n            }\n\n            if (layout === 'horizontal') {\n              const interpolatorHeight = interpolateNumber(0, entry.height);\n              const h = interpolatorHeight(t);\n\n              return {\n                ...entry,\n                y: entry.y + entry.height - h,\n                height: h,\n              };\n            }\n\n            const interpolator = interpolateNumber(0, entry.width);\n            const w = interpolator(t);\n\n            return { ...entry, width: w };\n          });\n\n          return <Layer>{this.renderRectanglesStatically(stepData)}</Layer>;\n        }}\n      </Animate>\n    );\n  }\n\n  renderRectangles() {\n    const { data, isAnimationActive } = this.props;\n    const { prevData } = this.state;\n\n    if (isAnimationActive && data && data.length && (!prevData || !_.isEqual(prevData, data))) {\n      return this.renderRectanglesWithAnimation();\n    }\n\n    return this.renderRectanglesStatically(data);\n  }\n\n  renderBackground() {\n    const { data } = this.props;\n    const backgroundProps = filterProps(this.props.background);\n\n    return data.map((entry, i) => {\n      // eslint-disable-next-line @typescript-eslint/no-unused-vars\n      const { value, background, ...rest } = entry;\n\n      if (!background) {\n        return null;\n      }\n\n      const props = {\n        ...rest,\n        fill: '#eee',\n        ...background,\n        ...backgroundProps,\n        ...adaptEventsOfChild(this.props, entry, i),\n        index: i,\n        key: `background-bar-${i}`,\n        className: 'recharts-bar-background-rectangle',\n      };\n\n      return Bar.renderRectangle(this.props.background, props);\n    });\n  }\n\n  renderErrorBar() {\n    if (this.props.isAnimationActive && !this.state.isAnimationFinished) {\n      return null;\n    }\n\n    const { data, xAxis, yAxis, layout, children } = this.props;\n    const errorBarItems = findAllByType(children, ErrorBar.displayName);\n\n    if (!errorBarItems) {\n      return null;\n    }\n\n    const offset = layout === 'vertical' ? data[0].height / 2 : data[0].width / 2;\n\n    function dataPointFormatter(dataPoint: BarRectangleItem, dataKey: Props['dataKey']) {\n      return {\n        x: dataPoint.x,\n        y: dataPoint.y,\n        value: dataPoint.value,\n        errorVal: getValueByDataKey(dataPoint, dataKey),\n      };\n    }\n\n    return errorBarItems.map((item: ReactElement<ErrorBarProps>, i: number) =>\n      React.cloneElement(item, {\n        key: `error-bar-${i}`, // eslint-disable-line react/no-array-index-key\n        data,\n        xAxis,\n        yAxis,\n        layout,\n        offset,\n        dataPointFormatter,\n      }),\n    );\n  }\n\n  render() {\n    const {\n      hide,\n      data,\n      className,\n      xAxis,\n      yAxis,\n      left,\n      top,\n      width,\n      height,\n      isAnimationActive,\n      background,\n      id,\n    } = this.props;\n    if (hide || !data || !data.length) {\n      return null;\n    }\n\n    const { isAnimationFinished } = this.state;\n    const layerClass = classNames('recharts-bar', className);\n    const needClip = (xAxis && xAxis.allowDataOverflow) || (yAxis && yAxis.allowDataOverflow);\n    const clipPathId = _.isNil(id) ? this.id : id;\n\n    return (\n      <Layer className={layerClass}>\n        {needClip ? (\n          <defs>\n            <clipPath id={`clipPath-${clipPathId}`}>\n              <rect x={left} y={top} width={width} height={height} />\n            </clipPath>\n          </defs>\n        ) : null}\n        <Layer className=\"recharts-bar-rectangles\" clipPath={needClip ? `url(#clipPath-${clipPathId})` : null}>\n          {background ? this.renderBackground() : null}\n          {this.renderRectangles()}\n        </Layer>\n        {this.renderErrorBar()}\n        {(!isAnimationActive || isAnimationFinished) && LabelList.renderCallByParent(this.props, data)}\n      </Layer>\n    );\n  }\n}\n\nexport default Bar;\n","/**\n * @fileOverview Brush\n */\nimport React, { PureComponent, Children, ReactText, MouseEvent, ReactElement, TouchEvent } from 'react';\nimport classNames from 'classnames';\nimport { scalePoint, ScalePoint } from 'd3-scale';\nimport _ from 'lodash';\nimport Layer from '../container/Layer';\nimport Text from '../component/Text';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport { isNumber } from '../util/DataUtils';\nimport { generatePrefixStyle } from '../util/CssPrefixUtils';\n\nimport { Padding, PresentationAttributes, DataKey, filterProps } from '../util/types';\n\n\ntype BrushTravellerType = ReactElement<SVGElement> | ((props: any) => SVGElement);\ninterface BrushStartEndIndex {\n  startIndex?: number;\n  endIndex?: number;\n}\n\ninterface InternalBrushProps {\n  x?: number;\n  y?: number;\n  width?: number;\n  data?: any[];\n  updateId?: string | number;\n}\n\ninterface BrushProps extends InternalBrushProps {\n  className?: string;\n\n  height: number;\n  travellerWidth?: number;\n  traveller?: BrushTravellerType;\n  gap?: number;\n  padding?: Padding;\n\n  dataKey?: DataKey<any>;\n  startIndex?: number;\n  endIndex?: number;\n  tickFormatter?: (value: any, index: number) => ReactText;\n\n  children?: ReactElement;\n\n  onChange?: (newIndex: BrushStartEndIndex) => void;\n  leaveTimeOut?: number;\n  alwaysShowText?: boolean;\n}\n\ntype Props = PresentationAttributes<SVGElement> & BrushProps;\n\ntype BrushTravellerId = 'startX' | 'endX';\n\ninterface State {\n  isTravellerMoving?: boolean;\n  isSlideMoving?: boolean;\n  startX?: number;\n  endX?: number;\n  slideMoveStartX?: number;\n  movingTravellerId?: BrushTravellerId;\n  isTextActive?: boolean;\n  brushMoveStartX?: number;\n}\n\nconst isTouch = (e: TouchEvent<SVGElement> | MouseEvent<SVGElement>): e is TouchEvent<SVGElement> =>\n  (e as TouchEvent<SVGElement>).changedTouches && !!(e as TouchEvent<SVGElement>).changedTouches.length;\n\nclass Brush extends PureComponent<Props, State> {\n  static displayName = 'Brush';\n\n  static defaultProps = {\n    height: 40,\n    travellerWidth: 5,\n    gap: 1,\n    fill: '#fff',\n    stroke: '#666',\n    padding: { top: 1, right: 1, bottom: 1, left: 1 },\n    leaveTimeOut: 1000,\n    alwaysShowText: false,\n  };\n\n  constructor(props: Props) {\n    super(props);\n\n    this.travellerDragStartHandlers = {\n      startX: this.handleTravellerDragStart.bind(this, 'startX'),\n      endX: this.handleTravellerDragStart.bind(this, 'endX'),\n    };\n\n    this.state = props.data && props.data.length ? this.createScale(props) : {};\n  }\n\n  leaveTimer?: number;\n\n  scale?: ScalePoint<number>;\n\n  scaleValues?: number[];\n\n  travellerDragStartHandlers?: Record<\n    BrushTravellerId,\n    (event: MouseEvent<SVGGElement> | TouchEvent<SVGGElement>) => void\n  >;\n\n  static renderDefaultTraveller(props: any) {\n    const { x, y, width, height, stroke } = props;\n    const lineY = Math.floor(y + height / 2) - 1;\n\n    return (\n      <>\n        <rect x={x} y={y} width={width} height={height} fill={stroke} stroke=\"none\" />\n        <line x1={x + 1} y1={lineY} x2={x + width - 1} y2={lineY} fill=\"none\" stroke=\"#fff\" />\n        <line x1={x + 1} y1={lineY + 2} x2={x + width - 1} y2={lineY + 2} fill=\"none\" stroke=\"#fff\" />\n      </>\n    );\n  }\n\n  static renderTraveller(option: BrushTravellerType, props: any) {\n    let rectangle;\n\n    if (React.isValidElement(option)) {\n      rectangle = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      rectangle = option(props);\n    } else {\n      rectangle = Brush.renderDefaultTraveller(props);\n    }\n\n    return rectangle;\n  }\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { data, width, x, travellerWidth, updateId } = this.props;\n\n    if ((nextProps.data !== data || nextProps.updateId !== updateId)) {\n      if (nextProps.data && nextProps.data.length) {\n        this.setState(this.createScale(nextProps));\n      } else {\n        this.removeScale();\n      }\n    } else if (this.scale && nextProps.width !== width || nextProps.x !== x || nextProps.travellerWidth !== travellerWidth) {\n      this.scale.range([nextProps.x, nextProps.x + nextProps.width - nextProps.travellerWidth]);\n      this.scaleValues = this.scale.domain().map(entry => this.scale(entry));\n\n      this.setState({\n        startX: this.scale(nextProps.startIndex),\n        endX: this.scale(nextProps.endIndex),\n      });\n    }\n  }\n\n  componentWillUnmount() {\n    this.removeScale();\n    if (this.leaveTimer) {\n      clearTimeout(this.leaveTimer);\n      this.leaveTimer = null;\n    }\n\n    this.detachDragEndListener();\n  }\n\n  static getIndexInRange(range: number[], x: number) {\n    const len = range.length;\n    let start = 0;\n    let end = len - 1;\n\n    while (end - start > 1) {\n      const middle = Math.floor((start + end) / 2);\n\n      if (range[middle] > x) {\n        end = middle;\n      } else {\n        start = middle;\n      }\n    }\n\n    return x >= range[end] ? end : start;\n  }\n\n  getIndex({ startX, endX }: { startX: number; endX: number }) {\n    const { gap, data } = this.props;\n    const lastIndex = data.length - 1;\n    const min = Math.min(startX, endX);\n    const max = Math.max(startX, endX);\n    const minIndex = Brush.getIndexInRange(this.scaleValues, min);\n    const maxIndex = Brush.getIndexInRange(this.scaleValues, max);\n    return {\n      startIndex: minIndex - (minIndex % gap),\n      endIndex: maxIndex === lastIndex ? lastIndex : maxIndex - (maxIndex % gap),\n    };\n  }\n\n  getTextOfTick(index: number) {\n    const { data, tickFormatter, dataKey } = this.props;\n    const text = getValueByDataKey(data[index], dataKey, index);\n\n    return _.isFunction(tickFormatter) ? tickFormatter(text, index) : text;\n  }\n\n  handleDrag = (e: React.Touch | MouseEvent<SVGGElement>) => {\n    if (this.leaveTimer) {\n      clearTimeout(this.leaveTimer);\n      this.leaveTimer = null;\n    }\n\n    if (this.state.isTravellerMoving) {\n      this.handleTravellerMove(e);\n    } else if (this.state.isSlideMoving) {\n      this.handleSlideDrag(e);\n    }\n  };\n\n  handleTouchMove = (e: TouchEvent<SVGGElement>) => {\n    if (e.changedTouches != null && e.changedTouches.length > 0) {\n      this.handleDrag(e.changedTouches[0]);\n    }\n  };\n\n  attachDragEndListener() {\n    window.addEventListener('mouseup', this.handleDragEnd, true);\n    window.addEventListener('touchend', this.handleDragEnd, true);\n  }\n\n  detachDragEndListener() {\n    window.removeEventListener('mouseup', this.handleDragEnd, true);\n    window.removeEventListener('touchend', this.handleDragEnd, true);\n  }\n\n  handleDragEnd = () => {\n    this.setState({\n      isTravellerMoving: false,\n      isSlideMoving: false,\n    });\n    this.detachDragEndListener();\n  };\n\n  handleLeaveWrapper = () => {\n    if (this.state.isTravellerMoving || this.state.isSlideMoving) {\n      this.leaveTimer = window.setTimeout(this.handleDragEnd, this.props.leaveTimeOut);\n    }\n  };\n\n  handleEnterSlideOrTraveller = () => {\n    this.setState({\n      isTextActive: true,\n    });\n  };\n\n  handleLeaveSlideOrTraveller = () => {\n    this.setState({\n      isTextActive: false,\n    });\n  };\n\n  handleSlideDragStart = (e: TouchEvent<SVGRectElement> | MouseEvent<SVGRectElement>) => {\n    const event = isTouch(e) ? e.changedTouches[0] : e;\n\n    this.setState({\n      isTravellerMoving: false,\n      isSlideMoving: true,\n      slideMoveStartX: event.pageX,\n    });\n\n    this.attachDragEndListener();\n  };\n\n  handleSlideDrag(e: React.Touch | MouseEvent<SVGGElement>) {\n    const { slideMoveStartX, startX, endX } = this.state;\n    const { x, width, travellerWidth, startIndex, endIndex, onChange } = this.props;\n    let delta = e.pageX - slideMoveStartX;\n\n    if (delta > 0) {\n      delta = Math.min(delta, x + width - travellerWidth - endX, x + width - travellerWidth - startX);\n    } else if (delta < 0) {\n      delta = Math.max(delta, x - startX, x - endX);\n    }\n    const newIndex = this.getIndex({\n      startX: startX + delta,\n      endX: endX + delta,\n    });\n\n    if ((newIndex.startIndex !== startIndex || newIndex.endIndex !== endIndex) && onChange) {\n      onChange(newIndex);\n    }\n\n    this.setState({\n      startX: startX + delta,\n      endX: endX + delta,\n      slideMoveStartX: e.pageX,\n    });\n  }\n\n  handleTravellerDragStart(id: BrushTravellerId, e: MouseEvent<SVGGElement> | TouchEvent<SVGGElement>) {\n    const event = isTouch(e) ? e.changedTouches[0] : e;\n\n    this.setState({\n      isSlideMoving: false,\n      isTravellerMoving: true,\n      movingTravellerId: id,\n      brushMoveStartX: event.pageX,\n    });\n\n    this.attachDragEndListener();\n  }\n\n  handleTravellerMove(e: React.Touch | MouseEvent<SVGGElement>) {\n    const { brushMoveStartX, movingTravellerId, endX, startX } = this.state;\n    const prevValue = this.state[movingTravellerId];\n\n    const { x, width, travellerWidth, onChange, gap, data } = this.props;\n    const params = { startX: this.state.startX, endX: this.state.endX };\n\n    let delta = e.pageX - brushMoveStartX;\n    if (delta > 0) {\n      delta = Math.min(delta, x + width - travellerWidth - prevValue);\n    } else if (delta < 0) {\n      delta = Math.max(delta, x - prevValue);\n    }\n\n    params[movingTravellerId] = prevValue + delta;\n\n    const newIndex = this.getIndex(params);\n    const { startIndex, endIndex } = newIndex;\n    const isFullGap = () => {\n      const lastIndex = data.length - 1;\n      if (\n        (movingTravellerId === 'startX' && (endX > startX ? startIndex % gap === 0 : endIndex % gap === 0)) ||\n        (endX < startX && endIndex === lastIndex) ||\n        (movingTravellerId === 'endX' && (endX > startX ? endIndex % gap === 0 : startIndex % gap === 0)) ||\n        (endX > startX && endIndex === lastIndex)\n      ) {\n        return true;\n      }\n      return false;\n    };\n\n    this.setState(\n      {\n        [movingTravellerId]: prevValue + delta,\n        brushMoveStartX: e.pageX,\n      },\n      () => {\n        if (onChange) {\n          if (isFullGap()) {\n            onChange(newIndex);\n          }\n        }\n      },\n    );\n  }\n\n  createScale(props: Props) {\n    const { data, startIndex, endIndex, x, width, travellerWidth } = props;\n    const len = data.length;\n    this.scale = scalePoint<number>()\n      .domain(_.range(0, len))\n      .range([x, x + width - travellerWidth]);\n    this.scaleValues = this.scale.domain().map(entry => this.scale(entry));\n    return {\n      isTextActive: false,\n      isSlideMoving: false,\n      isTravellerMoving: false,\n      startX: this.scale(startIndex),\n      endX: this.scale(endIndex),\n    };\n  }\n\n  removeScale() {\n    this.scale = null;\n    this.scaleValues = null;\n  }\n\n  renderBackground() {\n    const { x, y, width, height, fill, stroke } = this.props;\n\n    return <rect stroke={stroke} fill={fill} x={x} y={y} width={width} height={height} />;\n  }\n\n  renderPanorama() {\n    const { x, y, width, height, data, children, padding } = this.props;\n    const chartElement = Children.only(children);\n\n    if (!chartElement) {\n      return null;\n    }\n\n    return React.cloneElement(chartElement, {\n      x,\n      y,\n      width,\n      height,\n      margin: padding,\n      compact: true,\n      data,\n    });\n  }\n\n  renderTravellerLayer(travellerX: number, id: BrushTravellerId) {\n    const { y, travellerWidth, height, traveller } = this.props;\n    const x = Math.max(travellerX, this.props.x);\n    const travellerProps = {\n      ...filterProps(this.props),\n      x,\n      y,\n      width: travellerWidth,\n      height,\n    }\n\n    return (\n      <Layer\n        className=\"recharts-brush-traveller\"\n        onMouseEnter={this.handleEnterSlideOrTraveller}\n        onMouseLeave={this.handleLeaveSlideOrTraveller}\n        onMouseDown={this.travellerDragStartHandlers[id]}\n        onTouchStart={this.travellerDragStartHandlers[id]}\n        style={{ cursor: 'col-resize' }}\n      >\n        {Brush.renderTraveller(traveller, travellerProps)}\n      </Layer>\n    );\n  }\n\n  renderSlide(startX: number, endX: number) {\n    const { y, height, stroke, travellerWidth } = this.props;\n    const x = Math.min(startX, endX) + travellerWidth;\n    const width = Math.max(Math.abs(endX - startX) - travellerWidth, 0);\n\n    return (\n      <rect\n        className=\"recharts-brush-slide\"\n        onMouseEnter={this.handleEnterSlideOrTraveller}\n        onMouseLeave={this.handleLeaveSlideOrTraveller}\n        onMouseDown={this.handleSlideDragStart}\n        onTouchStart={this.handleSlideDragStart}\n        style={{ cursor: 'move' }}\n        stroke=\"none\"\n        fill={stroke}\n        fillOpacity={0.2}\n        x={x}\n        y={y}\n        width={width}\n        height={height}\n      />\n    );\n  }\n\n  renderText() {\n    const { startIndex, endIndex, y, height, travellerWidth, stroke } = this.props;\n    const { startX, endX } = this.state;\n    const offset = 5;\n    const attrs = {\n      pointerEvents: 'none',\n      fill: stroke,\n    };\n\n    return (\n      <Layer className=\"recharts-brush-texts\">\n        <Text\n          textAnchor=\"end\"\n          verticalAnchor=\"middle\"\n          x={Math.min(startX, endX) - offset}\n          y={y + height / 2}\n          {...attrs}\n        >\n          {this.getTextOfTick(startIndex)}\n        </Text>\n        <Text\n          textAnchor=\"start\"\n          verticalAnchor=\"middle\"\n          x={Math.max(startX, endX) + travellerWidth + offset}\n          y={y + height / 2}\n          {...attrs}\n        >\n          {this.getTextOfTick(endIndex)}\n        </Text>\n      </Layer>\n    );\n  }\n\n  render() {\n    const { data, className, children, x, y, width, height, alwaysShowText } = this.props;\n    const { startX, endX, isTextActive, isSlideMoving, isTravellerMoving } = this.state;\n\n    if (\n      !data ||\n      !data.length ||\n      !isNumber(x) ||\n      !isNumber(y) ||\n      !isNumber(width) ||\n      !isNumber(height) ||\n      width <= 0 ||\n      height <= 0\n    ) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-brush', className);\n    const isPanoramic = React.Children.count(children) === 1;\n    const style = generatePrefixStyle('userSelect', 'none');\n\n    return (\n      <Layer\n        className={layerClass}\n        onMouseMove={this.handleDrag}\n        onMouseLeave={this.handleLeaveWrapper}\n        onTouchMove={this.handleTouchMove}\n        style={style}\n      >\n        {this.renderBackground()}\n        {isPanoramic && this.renderPanorama()}\n        {this.renderSlide(startX, endX)}\n        {this.renderTravellerLayer(startX, 'startX')}\n        {this.renderTravellerLayer(endX, 'endX')}\n        {(isTextActive || isSlideMoving || isTravellerMoving || alwaysShowText) && this.renderText()}\n      </Layer>\n    );\n  }\n}\n\nexport default Brush;\n","/**\n * @fileOverview Cartesian Axis\n */\nimport React, { ReactElement, ReactNode, Component } from 'react';\nimport _ from 'lodash';\nimport classNames from 'classnames';\nimport { shallowEqual } from '../util/ShallowEqual';\nimport { getStringSize } from '../util/DOMUtils';\nimport Layer from '../container/Layer';\nimport Text from '../component/Text';\nimport Label from '../component/Label';\nimport Global from '../util/Global';\nimport { isNumber, mathSign } from '../util/DataUtils';\nimport { ViewBox, PresentationAttributes, filterProps, TickItem, adaptEventsOfChild } from '../util/types';\n\ninterface CartesianTickItem extends TickItem {\n  tickCoord?: number;\n  tickSize?: number;\n  isShow?: boolean;\n}\n\nexport interface CartesianAxisProps {\n  className?: string;\n  x?: number;\n  y?: number;\n  width?: number;\n  height?: number;\n  unit?: string | number;\n  orientation?: 'top' | 'bottom' | 'left' | 'right';\n  // The viewBox of svg\n  viewBox?: ViewBox;\n  tick?: PresentationAttributes<SVGTextElement> | ReactElement<SVGElement> | ((props: any) => SVGElement) | boolean;\n  axisLine?: boolean | PresentationAttributes<SVGLineElement>;\n  tickLine?: boolean | PresentationAttributes<SVGLineElement>;\n  mirror?: boolean;\n  tickMargin: number;\n  hide?: boolean;\n\n  minTickGap?: number;\n  ticks?: CartesianTickItem[];\n  tickSize?: number;\n  /** The formatter function of tick */\n  tickFormatter?: (value: any, index: number) => string;\n  ticksGenerator?: (props?: CartesianAxisProps) => CartesianTickItem[];\n  interval?: number | 'preserveStart' | 'preserveEnd' | 'preserveStartEnd';\n}\n\ntype Props = PresentationAttributes<SVGElement> & CartesianAxisProps;\n\nclass CartesianAxis extends Component<Props> {\n  static displayName = 'CartesianAxis';\n\n  static defaultProps = {\n    x: 0,\n    y: 0,\n    width: 0,\n    height: 0,\n    viewBox: { x: 0, y: 0, width: 0, height: 0 },\n    // The orientation of axis\n    orientation: 'bottom',\n    // The ticks\n    ticks: [] as CartesianAxisProps['ticks'],\n\n    stroke: '#666',\n    tickLine: true,\n    axisLine: true,\n    tick: true,\n    mirror: false,\n\n    minTickGap: 5,\n    // The width or height of tick\n    tickSize: 6,\n    tickMargin: 2,\n    interval: 'preserveEnd',\n  };\n\n  // todo Array<Tick>\n  static getTicks(props: Props): any[] {\n    const { tick, ticks, viewBox, minTickGap, orientation, interval, tickFormatter, unit } = props;\n\n    if (!ticks || !ticks.length || !tick) {\n      return [];\n    }\n\n    if (isNumber(interval) || Global.isSsr) {\n      return CartesianAxis.getNumberIntervalTicks(\n        ticks,\n        typeof interval === 'number' && isNumber(interval) ? interval : 0,\n      );\n    }\n\n    if (interval === 'preserveStartEnd') {\n      return CartesianAxis.getTicksStart(\n        {\n          ticks,\n          tickFormatter,\n          viewBox,\n          orientation,\n          minTickGap,\n          unit,\n        },\n        true,\n      );\n    }\n    if (interval === 'preserveStart') {\n      return CartesianAxis.getTicksStart({\n        ticks,\n        tickFormatter,\n        viewBox,\n        orientation,\n        minTickGap,\n        unit,\n      });\n    }\n\n    return CartesianAxis.getTicksEnd({\n      ticks,\n      tickFormatter,\n      viewBox,\n      orientation,\n      minTickGap,\n      unit,\n    });\n  }\n\n  static getNumberIntervalTicks(ticks: CartesianTickItem[], interval: number) {\n    return ticks.filter((entry, i) => i % (interval + 1) === 0);\n  }\n\n  static getTicksStart(\n    { ticks, tickFormatter, viewBox, orientation, minTickGap, unit }: Omit<Props, 'tickMargin'>,\n    preserveEnd?: boolean,\n  ) {\n    const { x, y, width, height } = viewBox;\n    const sizeKey = orientation === 'top' || orientation === 'bottom' ? 'width' : 'height';\n    const result = (ticks || []).slice();\n    // we need add the width of 'unit' only when sizeKey === 'width'\n    const unitSize = unit && sizeKey === 'width' ? getStringSize(unit)[sizeKey] : 0;\n    const len = result.length;\n    const sign = len >= 2 ? mathSign(result[1].coordinate - result[0].coordinate) : 1;\n\n    let start, end;\n\n    if (sign === 1) {\n      start = sizeKey === 'width' ? x : y;\n      end = sizeKey === 'width' ? x + width : y + height;\n    } else {\n      start = sizeKey === 'width' ? x + width : y + height;\n      end = sizeKey === 'width' ? x : y;\n    }\n\n    if (preserveEnd) {\n      // Try to guarantee the tail to be displayed\n      let tail = ticks[len - 1];\n      const tailContent = _.isFunction(tickFormatter) ? tickFormatter(tail.value, len - 1) : tail.value;\n      const tailSize = getStringSize(tailContent)[sizeKey] + unitSize;\n      const tailGap = sign * (tail.coordinate + (sign * tailSize) / 2 - end);\n      result[len - 1] = tail = {\n        ...tail,\n        tickCoord: tailGap > 0 ? tail.coordinate - tailGap * sign : tail.coordinate,\n      };\n\n      const isTailShow =\n        sign * (tail.tickCoord - (sign * tailSize) / 2 - start) >= 0 &&\n        sign * (tail.tickCoord + (sign * tailSize) / 2 - end) <= 0;\n\n      if (isTailShow) {\n        end = tail.tickCoord - sign * (tailSize / 2 + minTickGap);\n        result[len - 1] = { ...tail, isShow: true };\n      }\n    }\n\n    const count = preserveEnd ? len - 1 : len;\n    for (let i = 0; i < count; i++) {\n      let entry = result[i];\n      const content = _.isFunction(tickFormatter) ? tickFormatter(entry.value, i) : entry.value;\n      const size = getStringSize(content)[sizeKey] + unitSize;\n\n      if (i === 0) {\n        const gap = sign * (entry.coordinate - (sign * size) / 2 - start);\n        result[i] = entry = {\n          ...entry,\n          tickCoord: gap < 0 ? entry.coordinate - gap * sign : entry.coordinate,\n        };\n      } else {\n        result[i] = entry = { ...entry, tickCoord: entry.coordinate };\n      }\n\n      const isShow =\n        sign * (entry.tickCoord - (sign * size) / 2 - start) >= 0 &&\n        sign * (entry.tickCoord + (sign * size) / 2 - end) <= 0;\n\n      if (isShow) {\n        start = entry.tickCoord + sign * (size / 2 + minTickGap);\n        result[i] = { ...entry, isShow: true };\n      }\n    }\n\n    return result.filter(entry => entry.isShow);\n  }\n\n  static getTicksEnd({ ticks, tickFormatter, viewBox, orientation, minTickGap, unit }: Omit<Props, 'tickMargin'>) {\n    const { x, y, width, height } = viewBox;\n    const sizeKey = orientation === 'top' || orientation === 'bottom' ? 'width' : 'height';\n    // we need add the width of 'unit' only when sizeKey === 'width'\n    const unitSize = unit && sizeKey === 'width' ? getStringSize(unit)[sizeKey] : 0;\n    const result = (ticks || []).slice();\n    const len = result.length;\n    const sign = len >= 2 ? mathSign(result[1].coordinate - result[0].coordinate) : 1;\n\n    let start, end;\n\n    if (sign === 1) {\n      start = sizeKey === 'width' ? x : y;\n      end = sizeKey === 'width' ? x + width : y + height;\n    } else {\n      start = sizeKey === 'width' ? x + width : y + height;\n      end = sizeKey === 'width' ? x : y;\n    }\n\n    for (let i = len - 1; i >= 0; i--) {\n      let entry = result[i];\n      const content = _.isFunction(tickFormatter) ? tickFormatter(entry.value, len - i - 1) : entry.value;\n      const size = getStringSize(content)[sizeKey] + unitSize;\n\n      if (i === len - 1) {\n        const gap = sign * (entry.coordinate + (sign * size) / 2 - end);\n        result[i] = entry = {\n          ...entry,\n          tickCoord: gap > 0 ? entry.coordinate - gap * sign : entry.coordinate,\n        };\n      } else {\n        result[i] = entry = { ...entry, tickCoord: entry.coordinate };\n      }\n\n      const isShow =\n        sign * (entry.tickCoord - (sign * size) / 2 - start) >= 0 &&\n        sign * (entry.tickCoord + (sign * size) / 2 - end) <= 0;\n\n      if (isShow) {\n        end = entry.tickCoord - sign * (size / 2 + minTickGap);\n        result[i] = { ...entry, isShow: true };\n      }\n    }\n\n    return result.filter(entry => entry.isShow);\n  }\n\n  shouldComponentUpdate({ viewBox, ...restProps }: Props) {\n    // props.viewBox is sometimes generated every time -\n    // check that specially as object equality is likely to fail\n    const { viewBox: viewBoxOld, ...restPropsOld } = this.props;\n    return !shallowEqual(viewBox, viewBoxOld) || !shallowEqual(restProps, restPropsOld);\n  }\n\n  /**\n   * Calculate the coordinates of endpoints in ticks\n   * @param  {Object} data The data of a simple tick\n   * @return {Object} (x1, y1): The coordinate of endpoint close to tick text\n   *  (x2, y2): The coordinate of endpoint close to axis\n   */\n  getTickLineCoord(data: CartesianTickItem) {\n    const { x, y, width, height, orientation, tickSize, mirror, tickMargin } = this.props;\n    let x1, x2, y1, y2, tx, ty;\n\n    const sign = mirror ? -1 : 1;\n    const finalTickSize = data.tickSize || tickSize;\n    const tickCoord = isNumber(data.tickCoord) ? data.tickCoord : data.coordinate;\n\n    switch (orientation) {\n      case 'top':\n        x1 = x2 = data.coordinate;\n        y2 = y + +!mirror * height;\n        y1 = y2 - sign * finalTickSize;\n        ty = y1 - sign * tickMargin;\n        tx = tickCoord;\n        break;\n      case 'left':\n        y1 = y2 = data.coordinate;\n        x2 = x + +!mirror * width;\n        x1 = x2 - sign * finalTickSize;\n        tx = x1 - sign * tickMargin;\n        ty = tickCoord;\n        break;\n      case 'right':\n        y1 = y2 = data.coordinate;\n        x2 = x + +mirror * width;\n        x1 = x2 + sign * finalTickSize;\n        tx = x1 + sign * tickMargin;\n        ty = tickCoord;\n        break;\n      default:\n        x1 = x2 = data.coordinate;\n        y2 = y + +mirror * height;\n        y1 = y2 + sign * finalTickSize;\n        ty = y1 + sign * tickMargin;\n        tx = tickCoord;\n        break;\n    }\n\n    return { line: { x1, y1, x2, y2 }, tick: { x: tx, y: ty } };\n  }\n\n  getTickTextAnchor() {\n    const { orientation, mirror } = this.props;\n    let textAnchor;\n\n    switch (orientation) {\n      case 'left':\n        textAnchor = mirror ? 'start' : 'end';\n        break;\n      case 'right':\n        textAnchor = mirror ? 'end' : 'start';\n        break;\n      default:\n        textAnchor = 'middle';\n        break;\n    }\n\n    return textAnchor;\n  }\n\n  getTickVerticalAnchor() {\n    const { orientation, mirror } = this.props;\n    let verticalAnchor = 'end';\n\n    switch (orientation) {\n      case 'left':\n      case 'right':\n        verticalAnchor = 'middle';\n        break;\n      case 'top':\n        verticalAnchor = mirror ? 'start' : 'end';\n        break;\n      default:\n        verticalAnchor = mirror ? 'end' : 'start';\n        break;\n    }\n\n    return verticalAnchor;\n  }\n\n  renderAxisLine() {\n    const { x, y, width, height, orientation, mirror, axisLine } = this.props;\n    let props: PresentationAttributes<SVGLineElement> = {\n      ...filterProps(this.props),\n      ...filterProps(axisLine),\n      fill: 'none',\n    };\n\n    if (orientation === 'top' || orientation === 'bottom') {\n      const needHeight = +((orientation === 'top' && !mirror) || (orientation === 'bottom' && mirror));\n      props = {\n        ...props,\n        x1: x,\n        y1: y + needHeight * height,\n        x2: x + width,\n        y2: y + needHeight * height,\n      };\n    } else {\n      const needWidth = +((orientation === 'left' && !mirror) || (orientation === 'right' && mirror));\n      props = {\n        ...props,\n        x1: x + needWidth * width,\n        y1: y,\n        x2: x + needWidth * width,\n        y2: y + height,\n      };\n    }\n\n    return <line {...props} className={classNames('recharts-cartesian-axis-line', _.get(axisLine, 'className'))} />;\n  }\n\n  static renderTickItem(option: Props['tick'], props: any, value: ReactNode) {\n    let tickItem;\n\n    if (React.isValidElement(option)) {\n      tickItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      tickItem = option(props);\n    } else {\n      tickItem = (\n        <Text {...props} className=\"recharts-cartesian-axis-tick-value\">\n          {value}\n        </Text>\n      );\n    }\n\n    return tickItem;\n  }\n\n  /**\n   * render the ticks\n   * @param {Array} ticks The ticks to actually render (overrides what was passed in props)\n   * @return {ReactComponent} renderedTicks\n   */\n  renderTicks(ticks: CartesianTickItem[]) {\n    const { tickLine, stroke, tick, tickFormatter, unit } = this.props;\n    const finalTicks = CartesianAxis.getTicks({ ...this.props, ticks });\n    const textAnchor = this.getTickTextAnchor();\n    const verticalAnchor = this.getTickVerticalAnchor();\n    const axisProps = filterProps(this.props);\n    const customTickProps = filterProps(tick);\n    const tickLineProps = {\n      ...axisProps,\n      fill: 'none',\n      ...filterProps(tickLine),\n    };\n    const items = finalTicks.map((entry, i) => {\n      const { line: lineCoord, tick: tickCoord } = this.getTickLineCoord(entry);\n      const tickProps = {\n        textAnchor,\n        verticalAnchor,\n        ...axisProps,\n        stroke: 'none',\n        fill: stroke,\n        ...customTickProps,\n        ...tickCoord,\n        index: i,\n        payload: entry,\n        visibleTicksCount: finalTicks.length,\n      };\n\n      return (\n        <Layer\n          className=\"recharts-cartesian-axis-tick\"\n          key={`tick-${i}`} // eslint-disable-line react/no-array-index-key\n          {...adaptEventsOfChild(this.props, entry, i)}\n        >\n          {tickLine && (\n            <line\n              {...tickLineProps}\n              {...lineCoord}\n              className={classNames('recharts-cartesian-axis-tick-line', _.get(tickLine, 'className'))}\n            />\n          )}\n          {tick &&\n            CartesianAxis.renderTickItem(\n              tick,\n              tickProps,\n              `${_.isFunction(tickFormatter) ? tickFormatter(entry.value, i) : entry.value}${unit || ''}`,\n            )}\n        </Layer>\n      );\n    });\n\n    return <g className=\"recharts-cartesian-axis-ticks\">{items}</g>;\n  }\n\n  render() {\n    const { axisLine, width, height, ticksGenerator, className, hide } = this.props;\n\n    if (hide) {\n      return null;\n    }\n\n    const { ticks, ...noTicksProps } = this.props;\n    let finalTicks = ticks;\n\n    if (_.isFunction(ticksGenerator)) {\n      finalTicks = ticks && ticks.length > 0 ? ticksGenerator(this.props) : ticksGenerator(noTicksProps);\n    }\n\n    if (width <= 0 || height <= 0 || !finalTicks || !finalTicks.length) {\n      return null;\n    }\n\n    return (\n      <Layer className={classNames('recharts-cartesian-axis', className)}>\n        {axisLine && this.renderAxisLine()}\n        {this.renderTicks(finalTicks)}\n        {Label.renderCallByParent(this.props)}\n      </Layer>\n    );\n  }\n}\n\nexport default CartesianAxis;\n","/**\n * @fileOverview Cartesian Grid\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport _ from 'lodash';\nimport { isNumber } from '../util/DataUtils';\nimport { PresentationAttributes, ChartOffset, D3Scale, filterProps } from '../util/types';\n\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\n\ntype GridLineType =\n  | PresentationAttributes<SVGLineElement>\n  | ReactElement<SVGElement>\n  | ((props: any) => SVGElement)\n  | boolean;\n\ninterface IntrnalCartesianGridProps {\n  x?: number;\n  y?: number;\n  width?: number;\n  height?: number;\n  horizontalCoordinatesGenerator?: (props: any) => number[];\n  verticalCoordinatesGenerator?: (props: any) => number[];\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  offset?: ChartOffset;\n  chartWidth?: number;\n  chartHeight?: number;\n}\n\ninterface CartesianGridProps extends IntrnalCartesianGridProps {\n  horizontal?: GridLineType;\n  vertical?: GridLineType;\n  horizontalPoints?: number[];\n  verticalPoints?: number[];\n  verticalFill?: string[];\n  horizontalFill?: string[];\n}\n\ntype Props = PresentationAttributes<SVGElement> & CartesianGridProps;\n\nclass CartesianGrid extends PureComponent<Props> {\n  static displayName = 'CartesianGrid';\n\n  static defaultProps = {\n    horizontal: true,\n    vertical: true,\n    // The ordinates of horizontal grid lines\n    horizontalPoints: [] as CartesianGridProps['horizontalPoints'],\n    // The abscissas of vertical grid lines\n    verticalPoints: [] as CartesianGridProps['verticalPoints'],\n\n    stroke: '#ccc',\n    fill: 'none',\n    // The fill of colors of grid lines\n    verticalFill: [] as CartesianGridProps['verticalFill'],\n    horizontalFill: [] as CartesianGridProps['horizontalFill'],\n  };\n\n  static renderLineItem(option: GridLineType, props: any) {\n    let lineItem;\n\n    if (React.isValidElement(option)) {\n      lineItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      lineItem = option(props);\n    } else {\n      const { x1, y1, x2, y2, key, ...others } = props;\n\n      lineItem = <line {...filterProps(others)} x1={x1} y1={y1} x2={x2} y2={y2} fill=\"none\" key={key} />;\n    }\n\n    return lineItem;\n  }\n\n  /**\n   * Draw the horizontal grid lines\n   * @param {Array} horizontalPoints either passed in as props or generated from function\n   * @return {Group} Horizontal lines\n   */\n  renderHorizontal(horizontalPoints: number[]) {\n    const { x, width, horizontal } = this.props;\n\n    if (!horizontalPoints || !horizontalPoints.length) {\n      return null;\n    }\n\n    const items = horizontalPoints.map((entry, i) => {\n      const props = {\n        ...this.props,\n        x1: x,\n        y1: entry,\n        x2: x + width,\n        y2: entry,\n        key: `line-${i}`,\n        index: i,\n      };\n\n      return CartesianGrid.renderLineItem(horizontal, props);\n    });\n\n    return <g className=\"recharts-cartesian-grid-horizontal\">{items}</g>;\n  }\n\n  /**\n   * Draw vertical grid lines\n   * @param {Array} verticalPoints either passed in as props or generated from function\n   * @return {Group} Vertical lines\n   */\n  renderVertical(verticalPoints: number[]) {\n    const { y, height, vertical } = this.props;\n\n    if (!verticalPoints || !verticalPoints.length) {\n      return null;\n    }\n\n    const items = verticalPoints.map((entry, i) => {\n      const props = {\n        ...this.props,\n        x1: entry,\n        y1: y,\n        x2: entry,\n        y2: y + height,\n        key: `line-${i}`,\n        index: i,\n      };\n\n      return CartesianGrid.renderLineItem(vertical, props);\n    });\n\n    return <g className=\"recharts-cartesian-grid-vertical\">{items}</g>;\n  }\n\n  /**\n   * Draw vertical grid stripes filled by colors\n   * @param {Array} verticalPoints either passed in as props or generated from function\n   * @return {Group} Vertical stripes\n   */\n  renderVerticalStripes(verticalPoints: number[]) {\n    const { verticalFill } = this.props;\n    if (!verticalFill || !verticalFill.length) {\n      return null;\n    }\n\n    const { fillOpacity, x, y, width, height } = this.props;\n    const verticalPointsUpdated = verticalPoints.slice().sort((a, b) => a - b);\n\n    if (x !== verticalPointsUpdated[0]) {\n      verticalPointsUpdated.unshift(0);\n    }\n\n    const items = verticalPointsUpdated.map((entry, i) => {\n      const lineWidth = verticalPointsUpdated[i + 1] ? verticalPointsUpdated[i + 1] - entry : x + width - entry;\n      if (lineWidth <= 0) {\n        return null;\n      }\n      const colorIndex = i % verticalFill.length;\n      return (\n        <rect\n          key={`react-${i}`} // eslint-disable-line react/no-array-index-key\n          x={Math.round(entry + x - x)}\n          y={y}\n          width={lineWidth}\n          height={height}\n          stroke=\"none\"\n          fill={verticalFill[colorIndex]}\n          fillOpacity={fillOpacity}\n          className=\"recharts-cartesian-grid-bg\"\n        />\n      );\n    });\n\n    return <g className=\"recharts-cartesian-gridstripes-vertical\">{items}</g>;\n  }\n\n  /**\n   * Draw horizontal grid stripes filled by colors\n   * @param {Array} horizontalPoints either passed in as props or generated from function\n   * @return {Group} Horizontal stripes\n   */\n  renderHorizontalStripes(horizontalPoints: number[]) {\n    const { horizontalFill } = this.props;\n    if (!horizontalFill || !horizontalFill.length) {\n      return null;\n    }\n\n    const { fillOpacity, x, y, width, height } = this.props;\n    const horizontalPointsUpdated = horizontalPoints.slice().sort((a, b) => a - b);\n    if (y !== horizontalPointsUpdated[0]) {\n      horizontalPointsUpdated.unshift(0);\n    }\n\n    const items = horizontalPointsUpdated.map((entry, i) => {\n      const lineHeight = horizontalPointsUpdated[i + 1] ? horizontalPointsUpdated[i + 1] - entry : y + height - entry;\n      if (lineHeight <= 0) {\n        return null;\n      }\n      const colorIndex = i % horizontalFill.length;\n      return (\n        <rect\n          key={`react-${i}`} // eslint-disable-line react/no-array-index-key\n          y={Math.round(entry + y - y)}\n          x={x}\n          height={lineHeight}\n          width={width}\n          stroke=\"none\"\n          fill={horizontalFill[colorIndex]}\n          fillOpacity={fillOpacity}\n          className=\"recharts-cartesian-grid-bg\"\n        />\n      );\n    });\n\n    return <g className=\"recharts-cartesian-gridstripes-horizontal\">{items}</g>;\n  }\n\n  renderBackground() {\n    const { fill } = this.props;\n\n    if (!fill || fill === 'none') {\n      return null;\n    }\n\n    const { fillOpacity, x, y, width, height } = this.props;\n\n    return (\n      <rect\n        x={x}\n        y={y}\n        width={width}\n        height={height}\n        stroke=\"none\"\n        fill={fill}\n        fillOpacity={fillOpacity}\n        className=\"recharts-cartesian-grid-bg\"\n      />\n    );\n  }\n\n  render() {\n    const {\n      x,\n      y,\n      width,\n      height,\n      horizontal,\n      vertical,\n      horizontalCoordinatesGenerator,\n      verticalCoordinatesGenerator,\n      xAxis,\n      yAxis,\n      offset,\n      chartWidth,\n      chartHeight,\n    } = this.props;\n\n    if (\n      !isNumber(width) ||\n      width <= 0 ||\n      !isNumber(height) ||\n      height <= 0 ||\n      !isNumber(x) ||\n      x !== +x ||\n      !isNumber(y) ||\n      y !== +y\n    ) {\n      return null;\n    }\n\n    let { horizontalPoints, verticalPoints } = this.props;\n\n    // No horizontal points are specified\n    if ((!horizontalPoints || !horizontalPoints.length) && _.isFunction(horizontalCoordinatesGenerator)) {\n      horizontalPoints = horizontalCoordinatesGenerator({ yAxis, width: chartWidth, height: chartHeight, offset });\n    }\n\n    // No vertical points are specified\n    if ((!verticalPoints || !verticalPoints.length) && _.isFunction(verticalCoordinatesGenerator)) {\n      verticalPoints = verticalCoordinatesGenerator({ xAxis, width: chartWidth, height: chartHeight, offset });\n    }\n\n    return (\n      <g className=\"recharts-cartesian-grid\">\n        {this.renderBackground()}\n        {horizontal && this.renderHorizontal(horizontalPoints)}\n        {vertical && this.renderVertical(verticalPoints)}\n\n        {horizontal && this.renderHorizontalStripes(horizontalPoints)}\n        {vertical && this.renderVerticalStripes(verticalPoints)}\n      </g>\n    );\n  }\n}\n\nexport default CartesianGrid;\n","/**\n * @fileOverview Render a group of error bar\n */\nimport React from 'react';\nimport Layer from '../container/Layer';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\nimport { PresentationAttributes, filterProps, D3Scale, DataKey } from '../util/types';\n\ninterface ErrorBarDataItem {\n  x: number;\n  y: number;\n  value: number;\n  errorVal?: number[] | number;\n}\n\ninterface InternalErrorBarProps {\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  data?: any[];\n  layout?: 'horizontal' | 'vertical';\n  dataPointFormatter?: (entry: any, dataKey: DataKey<any>) => ErrorBarDataItem;\n  /** The offset between central and the given coordinate, often set by <Bar/> */\n  offset?: number;\n}\n\ninterface ErrorBarProps extends InternalErrorBarProps {\n  dataKey: DataKey<any>;\n  /** the width of the error bar ends */\n  width?: number;\n  /**\n   * Only used for ScatterChart with error bars in two directions.\n   * Only accepts a value of \"x\" or \"y\" and makes the error bars lie in that direction.\n   */\n  direction?: 'x' | 'y';\n}\n\nexport type Props = PresentationAttributes<SVGLineElement> & ErrorBarProps;\n\nfunction ErrorBar(props: Props) {\n  const { offset, layout, width, dataKey, data, dataPointFormatter, xAxis, yAxis, ...others } = props;\n  const svgProps = filterProps(others);\n  const errorBars = data.map((entry, i) => {\n    const { x, y, value, errorVal } = dataPointFormatter(entry, dataKey);\n\n    if (!errorVal) {\n      return null;\n    }\n\n    const lineCoordinates = [];\n    let lowBound, highBound;\n\n    if (Array.isArray(errorVal)) {\n      [lowBound, highBound] = errorVal;\n    } else {\n      lowBound = highBound = errorVal;\n    }\n\n    if (layout === 'vertical') {\n      // error bar for horizontal charts, the y is fixed, x is a range value\n      const { scale } = xAxis;\n\n      const yMid = y + offset;\n      const yMin = yMid + width;\n      const yMax = yMid - width;\n\n      const xMin = scale(value - lowBound);\n      const xMax = scale(value + highBound);\n\n      // the right line of |--|\n      lineCoordinates.push({ x1: xMax, y1: yMin, x2: xMax, y2: yMax });\n      // the middle line of |--|\n      lineCoordinates.push({ x1: xMin, y1: yMid, x2: xMax, y2: yMid });\n      // the left line of |--|\n      lineCoordinates.push({ x1: xMin, y1: yMin, x2: xMin, y2: yMax });\n    } else if (layout === 'horizontal') {\n      // error bar for horizontal charts, the x is fixed, y is a range value\n      const { scale } = yAxis;\n\n      const xMid = x + offset;\n      const xMin = xMid - width;\n      const xMax = xMid + width;\n\n      const yMin = scale(value - lowBound);\n      const yMax = scale(value + highBound);\n\n      // the top line\n      lineCoordinates.push({ x1: xMin, y1: yMax, x2: xMax, y2: yMax });\n      // the middle line\n      lineCoordinates.push({ x1: xMid, y1: yMin, x2: xMid, y2: yMax });\n      // the bottom line\n      lineCoordinates.push({ x1: xMin, y1: yMin, x2: xMax, y2: yMin });\n    }\n\n    return (\n      // eslint-disable-next-line react/no-array-index-key\n      <Layer className=\"recharts-errorBar\" key={`bar-${i}`} {...svgProps}>\n        {lineCoordinates.map((coordinates, index) => (\n          <line {...coordinates} key={`line-${index}`} />\n        ))}\n      </Layer>\n    );\n  });\n\n  return <Layer className=\"recharts-errorBars\">{errorBars}</Layer>;\n}\n\nErrorBar.defaultProps = {\n  stroke: 'black',\n  strokeWidth: 1.5,\n  width: 5,\n  offset: 0,\n  layout: 'horizontal',\n};\nErrorBar.displayName = 'ErrorBar';\n\nexport default ErrorBar;\n","/**\n * @fileOverview Line\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport Animate from 'react-smooth';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Curve, { CurveType, Props as CurveProps, Point as CurvePoint } from '../shape/Curve';\nimport Dot, { Props as DotProps } from '../shape/Dot';\nimport Layer from '../container/Layer';\nimport LabelList from '../component/LabelList';\nimport ErrorBar, { Props as ErrorBarProps } from './ErrorBar';\nimport { uniqueId, interpolateNumber } from '../util/DataUtils';\nimport { findAllByType } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport { getCateCoordinateOfLine, getValueByDataKey } from '../util/ChartUtils';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\nimport {\n  D3Scale,\n  LegendType,\n  TooltipType,\n  AnimationTiming,\n  filterProps,\n  ChartOffset,\n  DataKey,\n  TickItem,\n} from '../util/types';\n\ntype LineDot = ReactElement<SVGElement> | ((props: any) => SVGElement) | DotProps | boolean;\n\ninterface LinePointItem extends CurvePoint {\n  value?: number;\n  payload?: any;\n}\n\ninterface InternalLineProps {\n  top?: number;\n  left?: number;\n  width?: number;\n  height?: number;\n  points?: LinePointItem[];\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n}\n\ninterface LineProps extends InternalLineProps {\n  className?: string;\n  type?: CurveType;\n  unit?: string | number;\n  name?: string | number;\n  yAxisId?: string | number;\n  xAxisId?: string | number;\n  dataKey?: DataKey<any>;\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  layout?: 'horizontal' | 'vertical';\n  connectNulls?: boolean;\n  hide?: boolean;\n\n  // whether have dot in line\n  activeDot?: LineDot;\n  dot?: LineDot;\n\n  onAnimationStart?: () => void;\n  onAnimationEnd?: () => void;\n\n  isAnimationActive?: boolean;\n  animateNewValues?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n  animationId?: number;\n  id?: string;\n}\n\ntype Props = Omit<CurveProps, 'points' | 'pathRef'> & LineProps;\n\ninterface State {\n  isAnimationFinished?: boolean;\n  totalLength?: number;\n  prevPoints?: LinePointItem[];\n}\n\nclass Line extends PureComponent<Props, State> {\n  static displayName = 'Line';\n\n  static defaultProps = {\n    xAxisId: 0,\n    yAxisId: 0,\n    connectNulls: false,\n    activeDot: true,\n    dot: true,\n    legendType: 'line',\n    stroke: '#3182bd',\n    strokeWidth: 1,\n    fill: '#fff',\n    points: [] as LinePointItem[],\n    isAnimationActive: !Global.isSsr,\n    animateNewValues: true,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n    hide: false,\n  };\n\n  /**\n   * Compose the data of each group\n   * @param {Object} props The props from the component\n   * @param  {Object} xAxis   The configuration of x-axis\n   * @param  {Object} yAxis   The configuration of y-axis\n   * @param  {String} dataKey The unique key of a group\n   * @return {Array}  Composed data\n   */\n  static getComposedData = ({\n    props,\n    xAxis,\n    yAxis,\n    xAxisTicks,\n    yAxisTicks,\n    dataKey,\n    bandSize,\n    displayedData,\n    offset,\n  }: {\n    props: Props;\n    xAxis: Props['xAxis'];\n    yAxis: Props['yAxis'];\n    xAxisTicks: TickItem[];\n    yAxisTicks: TickItem[];\n    dataKey: Props['dataKey'];\n    bandSize: number;\n    displayedData: any[];\n    offset: ChartOffset;\n  }) => {\n    const { layout } = props;\n\n    const points = displayedData.map((entry, index) => {\n      const value = getValueByDataKey(entry, dataKey);\n\n      if (layout === 'horizontal') {\n        return {\n          x: getCateCoordinateOfLine({ axis: xAxis, ticks: xAxisTicks, bandSize, entry, index }),\n          y: _.isNil(value) ? null : yAxis.scale(value),\n          value,\n          payload: entry,\n        };\n      }\n\n      return {\n        x: _.isNil(value) ? null : xAxis.scale(value),\n        y: getCateCoordinateOfLine({ axis: yAxis, ticks: yAxisTicks, bandSize, entry, index }),\n        value,\n        payload: entry,\n      };\n    });\n\n    return { points, layout, ...offset };\n  };\n\n  mainCurve?: SVGPathElement;\n\n  state: State = {\n    isAnimationFinished: true,\n    totalLength: 0,\n  };\n\n  /* eslint-disable  react/no-did-mount-set-state */\n  componentDidMount() {\n    if (!this.props.isAnimationActive) {\n      return;\n    }\n\n    const totalLength = this.getTotalLength();\n    this.setState({ totalLength });\n  }\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, points } = this.props;\n\n    if (nextProps.animationId !== animationId) {\n      this.cachePrevData(points);\n    }\n  }\n\n  getTotalLength() {\n    const curveDom = this.mainCurve;\n\n    try {\n      return (curveDom && curveDom.getTotalLength && curveDom.getTotalLength()) || 0;\n    } catch (err) {\n      return 0;\n    }\n  }\n\n  getStrokeDasharray = (length: number, totalLength: number, lines: number[]) => {\n    const lineLength = lines.reduce((pre, next) => pre + next);\n\n    const count = Math.floor(length / lineLength);\n    const remainLength = length % lineLength;\n    const restLength = totalLength - length;\n\n    let remainLines = [];\n    for (let i = 0, sum = 0; ; sum += lines[i], ++i) {\n      if (sum + lines[i] > remainLength) {\n        remainLines = [...lines.slice(0, i), remainLength - sum];\n        break;\n      }\n    }\n\n    const emptyLines = remainLines.length % 2 === 0 ? [0, restLength] : [restLength];\n\n    return [...Line.repeat(lines, count), ...remainLines, ...emptyLines].map(line => `${line}px`).join(', ');\n  };\n\n  id = uniqueId('recharts-line-');\n\n  cachePrevData = (points: LinePointItem[]) => {\n    this.setState({ prevPoints: points });\n  };\n\n  pathRef = (node: SVGPathElement): void => {\n    this.mainCurve = node;\n  };\n\n  static repeat(lines: number[], count: number) {\n    const linesUnit = lines.length % 2 !== 0 ? [...lines, 0] : lines;\n    let result: number[] = [];\n\n    for (let i = 0; i < count; ++i) {\n      result = [...result, ...linesUnit];\n    }\n\n    return result;\n  }\n\n  handleAnimationEnd = () => {\n    this.setState({ isAnimationFinished: true });\n\n    if (this.props.onAnimationEnd) {\n      this.props.onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    this.setState({ isAnimationFinished: false });\n\n    if (this.props.onAnimationStart) {\n      this.props.onAnimationStart();\n    }\n  };\n\n  renderErrorBar() {\n    if (this.props.isAnimationActive && !this.state.isAnimationFinished) {\n      return null;\n    }\n\n    const { points, xAxis, yAxis, layout, children } = this.props;\n    const errorBarItems = findAllByType(children, ErrorBar.displayName);\n\n    if (!errorBarItems) {\n      return null;\n    }\n\n    function dataPointFormatter(dataPoint: LinePointItem, dataKey: Props['dataKey']) {\n      return {\n        x: dataPoint.x,\n        y: dataPoint.y,\n        value: dataPoint.value,\n        errorVal: getValueByDataKey(dataPoint.payload, dataKey),\n      };\n    }\n\n    return errorBarItems.map((item: ReactElement<ErrorBarProps>, i: number) =>\n      React.cloneElement(item, {\n        key: `bar-${i}`,\n        data: points,\n        xAxis,\n        yAxis,\n        layout,\n        dataPointFormatter,\n      }),\n    );\n  }\n\n  static renderDotItem(option: LineDot, props: any) {\n    let dotItem;\n\n    if (React.isValidElement(option)) {\n      dotItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      dotItem = option(props);\n    } else {\n      const className = classNames('recharts-line-dot', option ? (option as DotProps).className : '');\n      dotItem = <Dot {...props} className={className} />;\n    }\n\n    return dotItem;\n  }\n\n  renderDots(needClip: boolean, clipPathId: string) {\n    const { isAnimationActive } = this.props;\n\n    if (isAnimationActive && !this.state.isAnimationFinished) {\n      return null;\n    }\n    const { dot, points, dataKey } = this.props;\n    const lineProps = filterProps(this.props);\n    const customDotProps = filterProps(dot, true);\n    const dots = points.map((entry, i) => {\n      const dotProps = {\n        key: `dot-${i}`,\n        r: 3,\n        ...lineProps,\n        ...customDotProps,\n        value: entry.value,\n        dataKey,\n        cx: entry.x,\n        cy: entry.y,\n        index: i,\n        payload: entry.payload,\n      };\n\n      return Line.renderDotItem(dot, dotProps);\n    });\n    const dotsProps = {\n      clipPath: needClip ? `url(#clipPath-${clipPathId})` : null,\n    };\n\n    return (\n      <Layer className=\"recharts-line-dots\" key=\"dots\" {...dotsProps}>\n        {dots}\n      </Layer>\n    );\n  }\n\n  renderCurveStatically(\n    points: LinePointItem[],\n    needClip: boolean,\n    clipPathId: string,\n    props?: { strokeDasharray: string },\n  ) {\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    const { type, layout, connectNulls, ref, ...others } = this.props;\n    const curveProps = {\n      ...filterProps(others, true),\n      fill: 'none',\n      className: 'recharts-line-curve',\n      clipPath: needClip ? `url(#clipPath-${clipPathId})` : null,\n      points,\n      ...props,\n      type,\n      layout,\n      connectNulls,\n    };\n\n    return <Curve {...curveProps} pathRef={this.pathRef} />;\n  }\n\n  renderCurveWithAnimation(needClip: boolean, clipPathId: string) {\n    const {\n      points,\n      strokeDasharray,\n      isAnimationActive,\n      animationBegin,\n      animationDuration,\n      animationEasing,\n      animationId,\n      animateNewValues,\n      width,\n      height,\n    } = this.props;\n    const { prevPoints, totalLength } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`line-${animationId}`}\n        onAnimationEnd={this.handleAnimationEnd}\n        onAnimationStart={this.handleAnimationStart}\n      >\n        {({ t }: { t: number }) => {\n          if (prevPoints) {\n            const prevPointsDiffFactor = prevPoints.length / points.length;\n            const stepData = points.map((entry, index) => {\n              const prevPointIndex = Math.floor(index * prevPointsDiffFactor);\n              if (prevPoints[prevPointIndex]) {\n                const prev = prevPoints[prevPointIndex];\n                const interpolatorX = interpolateNumber(prev.x, entry.x);\n                const interpolatorY = interpolateNumber(prev.y, entry.y);\n\n                return { ...entry, x: interpolatorX(t), y: interpolatorY(t) };\n              }\n\n              // magic number of faking previous x and y location\n              if (animateNewValues) {\n                const interpolatorX = interpolateNumber(width * 2, entry.x);\n                const interpolatorY = interpolateNumber(height / 2, entry.y);\n                return { ...entry, x: interpolatorX(t), y: interpolatorY(t) };\n              }\n              return { ...entry, x: entry.x, y: entry.y };\n            });\n            return this.renderCurveStatically(stepData, needClip, clipPathId);\n          }\n          const interpolator = interpolateNumber(0, totalLength);\n          const curLength = interpolator(t);\n          let currentStrokeDasharray;\n\n          if (strokeDasharray) {\n            const lines = `${strokeDasharray}`.split(/[,\\s]+/gim).map(num => parseFloat(num));\n            currentStrokeDasharray = this.getStrokeDasharray(curLength, totalLength, lines);\n          } else {\n            currentStrokeDasharray = `${curLength}px ${totalLength - curLength}px`;\n          }\n\n          return this.renderCurveStatically(points, needClip, clipPathId, {\n            strokeDasharray: currentStrokeDasharray,\n          });\n        }}\n      </Animate>\n    );\n  }\n\n  renderCurve(needClip: boolean, clipPathId: string) {\n    const { points, isAnimationActive } = this.props;\n    const { prevPoints, totalLength } = this.state;\n\n    if (\n      isAnimationActive &&\n      points &&\n      points.length &&\n      ((!prevPoints && totalLength > 0) || !_.isEqual(prevPoints, points))\n    ) {\n      return this.renderCurveWithAnimation(needClip, clipPathId);\n    }\n\n    return this.renderCurveStatically(points, needClip, clipPathId);\n  }\n\n  render() {\n    const { hide, dot, points, className, xAxis, yAxis, top, left, width, height, isAnimationActive, id } = this.props;\n\n    if (hide || !points || !points.length) {\n      return null;\n    }\n\n    const { isAnimationFinished } = this.state;\n    const hasSinglePoint = points.length === 1;\n    const layerClass = classNames('recharts-line', className);\n    const needClip = (xAxis && xAxis.allowDataOverflow) || (yAxis && yAxis.allowDataOverflow);\n    const clipPathId = _.isNil(id) ? this.id : id;\n\n    return (\n      <Layer className={layerClass}>\n        {needClip ? (\n          <defs>\n            <clipPath id={`clipPath-${clipPathId}`}>\n              <rect x={left} y={top} width={width} height={height} />\n            </clipPath>\n          </defs>\n        ) : null}\n        {!hasSinglePoint && this.renderCurve(needClip, clipPathId)}\n        {this.renderErrorBar()}\n        {(hasSinglePoint || dot) && this.renderDots(needClip, clipPathId)}\n        {(!isAnimationActive || isAnimationFinished) && LabelList.renderCallByParent(this.props, points)}\n      </Layer>\n    );\n  }\n}\n\nexport default Line;\n","/**\n * @fileOverview Reference Line\n */\nimport React, { ReactElement } from 'react';\nimport _ from 'lodash';\nimport classNames from 'classnames';\nimport Layer from '../container/Layer';\nimport Label from '../component/Label';\nimport { createLabeldScales, rectWithPoints } from '../util/CartesianUtils';\nimport { ifOverflowMatches } from '../util/IfOverflowMatches';\nimport { isNumOrStr } from '../util/DataUtils';\nimport { warn } from '../util/LogUtils';\nimport Rectangle, { Props as RectangleProps } from '../shape/Rectangle';\nimport { ViewBox, D3Scale, filterProps } from '../util/types';\n\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\n\ninterface InternalReferenceAreaProps {\n  viewBox?: ViewBox;\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  clipPathId?: number | string;\n}\n\ninterface ReferenceAreaProps extends InternalReferenceAreaProps {\n  isFront?: boolean;\n  alwaysShow?: boolean;\n  ifOverflow?: 'hidden' | 'visible' | 'discard' | 'extendDomain';\n  x1?: number | string;\n  x2?: number | string;\n  y1?: number | string;\n  y2?: number | string;\n\n  className?: number | string;\n  yAxisId?: number | string;\n  xAxisId?: number | string;\n  shape?: ReactElement<SVGElement> | ((props: any) => SVGElement);\n}\n\ntype Props = RectangleProps & ReferenceAreaProps;\n\nconst getRect = (hasX1: boolean, hasX2: boolean, hasY1: boolean, hasY2: boolean, props: Props) => {\n  const { x1: xValue1, x2: xValue2, y1: yValue1, y2: yValue2, xAxis, yAxis } = props;\n\n  const scales = createLabeldScales({ x: xAxis.scale, y: yAxis.scale });\n\n  const p1 = {\n    x: hasX1 ? scales.x.apply(xValue1, { position: 'start' }) : scales.x.rangeMin,\n    y: hasY1 ? scales.y.apply(yValue1, { position: 'start' }) : scales.y.rangeMin,\n  };\n\n  const p2 = {\n    x: hasX2 ? scales.x.apply(xValue2, { position: 'end' }) : scales.x.rangeMax,\n    y: hasY2 ? scales.y.apply(yValue2, { position: 'end' }) : scales.y.rangeMax,\n  };\n\n  if (ifOverflowMatches(props, 'discard') && (!scales.isInRange(p1) || !scales.isInRange(p2))) {\n    return null;\n  }\n\n  return rectWithPoints(p1, p2);\n};\n\nfunction ReferenceArea(props: Props) {\n  const { x1, x2, y1, y2, className, alwaysShow, clipPathId } = props;\n\n  warn(alwaysShow === undefined, 'The alwaysShow prop is deprecated. Please use ifOverflow=\"extendDomain\" instead.');\n\n  const hasX1 = isNumOrStr(x1);\n  const hasX2 = isNumOrStr(x2);\n  const hasY1 = isNumOrStr(y1);\n  const hasY2 = isNumOrStr(y2);\n\n  const { shape } = props;\n\n  if (!hasX1 && !hasX2 && !hasY1 && !hasY2 && !shape) {\n    return null;\n  }\n\n  const rect = getRect(hasX1, hasX2, hasY1, hasY2, props);\n\n  if (!rect && !shape) {\n    return null;\n  }\n\n  const clipPath = ifOverflowMatches(props, 'hidden') ? `url(#${clipPathId})` : undefined;\n\n  return (\n    <Layer className={classNames('recharts-reference-area', className)}>\n      {ReferenceArea.renderRect(shape, { clipPath, ...filterProps(props, true), ...rect })}\n      {Label.renderCallByParent(props, rect)}\n    </Layer>\n  );\n}\n\nReferenceArea.displayName = 'ReferenceArea';\nReferenceArea.defaultProps = {\n  isFront: false,\n  ifOverflow: 'discard',\n  xAxisId: 0,\n  yAxisId: 0,\n  r: 10,\n  fill: '#ccc',\n  fillOpacity: 0.5,\n  stroke: 'none',\n  strokeWidth: 1,\n};\n\nReferenceArea.renderRect = (option: ReferenceAreaProps['shape'], props: any) => {\n  let rect;\n\n  if (React.isValidElement(option)) {\n    rect = React.cloneElement(option, props);\n  } else if (_.isFunction(option)) {\n    rect = option(props);\n  } else {\n    rect = <Rectangle {...props} className=\"recharts-reference-area-rect\" />;\n  }\n\n  return rect;\n};\n\nexport default ReferenceArea;\n","/**\n * @fileOverview Reference Dot\n */\nimport React, { ReactElement } from 'react';\nimport _ from 'lodash';\nimport classNames from 'classnames';\nimport Layer from '../container/Layer';\nimport Dot, { Props as DotProps } from '../shape/Dot';\nimport Label from '../component/Label';\nimport { isNumOrStr } from '../util/DataUtils';\nimport { ifOverflowMatches } from '../util/IfOverflowMatches';\nimport { createLabeldScales } from '../util/CartesianUtils';\nimport { warn } from '../util/LogUtils';\nimport { D3Scale, filterProps } from '../util/types';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\n\ninterface InternalReferenceDotProps {\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  clipPathId?: number | string;\n}\n\ninterface ReferenceDotProps extends InternalReferenceDotProps {\n  r?: number;\n\n  isFront?: boolean;\n  alwaysShow?: boolean;\n  ifOverflow?: 'hidden' | 'visible' | 'discard' | 'extendDomain';\n  x?: number | string;\n  y?: number | string;\n\n  className?: number | string;\n  yAxisId?: number | string;\n  xAxisId?: number | string;\n  shape?: ReactElement<SVGElement> | ((props: any) => SVGElement);\n}\n\ntype Props = DotProps & ReferenceDotProps;\n\nconst getCoordinate = (props: Props) => {\n  const { x, y, xAxis, yAxis } = props;\n  const scales = createLabeldScales({ x: xAxis.scale, y: yAxis.scale });\n\n  const result = scales.apply({ x, y }, { bandAware: true });\n\n  if (ifOverflowMatches(props, 'discard') && !scales.isInRange(result)) {\n    return null;\n  }\n\n  return result;\n};\n\nfunction ReferenceDot(props: Props) {\n  const { x, y, r, alwaysShow, clipPathId } = props;\n  const isX = isNumOrStr(x);\n  const isY = isNumOrStr(y);\n\n  warn(alwaysShow === undefined, 'The alwaysShow prop is deprecated. Please use ifOverflow=\"extendDomain\" instead.');\n\n  if (!isX || !isY) {\n    return null;\n  }\n\n  const coordinate = getCoordinate(props);\n\n  if (!coordinate) {\n    return null;\n  }\n\n  const { x: cx, y: cy } = coordinate;\n\n  const { shape, className } = props;\n\n  const clipPath = ifOverflowMatches(props, 'hidden') ? `url(#${clipPathId})` : undefined;\n\n  const dotProps = {\n    clipPath,\n    ...filterProps(props, true),\n    cx,\n    cy,\n  };\n\n  return (\n    <Layer className={classNames('recharts-reference-dot', className)}>\n      {ReferenceDot.renderDot(shape, dotProps)}\n      {Label.renderCallByParent(props, {\n        x: cx - r,\n        y: cy - r,\n        width: 2 * r,\n        height: 2 * r,\n      })}\n    </Layer>\n  );\n}\n\nReferenceDot.displayName = 'ReferenceDot';\nReferenceDot.defaultProps = {\n  isFront: false,\n  ifOverflow: 'discard',\n  xAxisId: 0,\n  yAxisId: 0,\n  r: 10,\n  fill: '#fff',\n  stroke: '#ccc',\n  fillOpacity: 1,\n  strokeWidth: 1,\n};\nReferenceDot.renderDot = (option: Props['shape'], props: any) => {\n  let dot;\n\n  if (React.isValidElement(option)) {\n    dot = React.cloneElement(option, props);\n  } else if (_.isFunction(option)) {\n    dot = option(props);\n  } else {\n    dot = <Dot {...props} cx={props.cx} cy={props.cy} className=\"recharts-reference-dot-dot\" />;\n  }\n\n  return dot;\n};\n\nexport default ReferenceDot;\n","/**\n * @fileOverview Reference Line\n */\nimport React, { ReactElement } from 'react';\nimport _ from 'lodash';\nimport classNames from 'classnames';\nimport Layer from '../container/Layer';\nimport Label from '../component/Label';\nimport { ifOverflowMatches } from '../util/IfOverflowMatches';\nimport { isNumOrStr } from '../util/DataUtils';\nimport { createLabeldScales, rectWithCoords } from '../util/CartesianUtils';\nimport { warn } from '../util/LogUtils';\nimport { ViewBox, D3Scale, PresentationAttributes, filterProps } from '../util/types';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\n\ninterface InternalReferenceLineProps {\n  viewBox?: ViewBox;\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  clipPathId?: number | string;\n}\n\ninterface ReferenceLineProps extends InternalReferenceLineProps {\n  isFront?: boolean;\n  alwaysShow?: boolean;\n  ifOverflow?: 'hidden' | 'visible' | 'discard' | 'extendDomain';\n\n  x?: number | string;\n  y?: number | string;\n\n  segment?: Array<{\n    x?: number | string;\n    y?: number | string;\n  }>;\n\n  position?: 'middle' | 'start' | 'end';\n\n  className?: number | string;\n  yAxisId?: number | string;\n  xAxisId?: number | string;\n  shape?: ReactElement<SVGElement> | ((props: any) => SVGElement);\n}\n\ntype Props = PresentationAttributes<SVGLineElement> & ReferenceLineProps;\n\nconst renderLine = (option: ReferenceLineProps['shape'], props: any) => {\n  let line;\n\n  if (React.isValidElement(option)) {\n    line = React.cloneElement(option, props);\n  } else if (_.isFunction(option)) {\n    line = option(props);\n  } else {\n    line = <line {...props} className=\"recharts-reference-line-line\" />;\n  }\n\n  return line;\n};\n\n// TODO: ScaleHelper\nconst getEndPoints = (scales: any, isFixedX: boolean, isFixedY: boolean, isSegment: boolean, props: Props) => {\n  const {\n    viewBox: { x, y, width, height },\n    position,\n  } = props;\n\n  if (isFixedY) {\n    const {\n      y: yCoord,\n      yAxis: { orientation },\n    } = props;\n    const coord = scales.y.apply(yCoord, { position });\n\n    if (ifOverflowMatches(props, 'discard') && !scales.y.isInRange(coord)) {\n      return null;\n    }\n\n    const points = [\n      { x: x + width, y: coord },\n      { x, y: coord },\n    ];\n    return orientation === 'left' ? points.reverse() : points;\n  }\n  if (isFixedX) {\n    const {\n      x: xCoord,\n      xAxis: { orientation },\n    } = props;\n    const coord = scales.x.apply(xCoord, { position });\n\n    if (ifOverflowMatches(props, 'discard') && !scales.x.isInRange(coord)) {\n      return null;\n    }\n\n    const points = [\n      { x: coord, y: y + height },\n      { x: coord, y },\n    ];\n    return orientation === 'top' ? points.reverse() : points;\n  }\n  if (isSegment) {\n    const { segment } = props;\n\n    const points = segment.map(p => scales.apply(p, { position }));\n\n    if (ifOverflowMatches(props, 'discard') && _.some(points, p => !scales.isInRange(p))) {\n      return null;\n    }\n\n    return points;\n  }\n\n  return null;\n};\n\nfunction ReferenceLine(props: Props) {\n  const { x: fixedX, y: fixedY, segment, xAxis, yAxis, shape, className, alwaysShow, clipPathId } = props;\n\n  warn(alwaysShow === undefined, 'The alwaysShow prop is deprecated. Please use ifOverflow=\"extendDomain\" instead.');\n\n  const scales = createLabeldScales({ x: xAxis.scale, y: yAxis.scale });\n\n  const isX = isNumOrStr(fixedX);\n  const isY = isNumOrStr(fixedY);\n  const isSegment = segment && segment.length === 2;\n\n  const endPoints = getEndPoints(scales, isX, isY, isSegment, props);\n  if (!endPoints) {\n    return null;\n  }\n\n  const [{ x: x1, y: y1 }, { x: x2, y: y2 }] = endPoints;\n\n  const clipPath = ifOverflowMatches(props, 'hidden') ? `url(#${clipPathId})` : undefined;\n\n  const lineProps = {\n    clipPath,\n    ...filterProps(props, true),\n    x1,\n    y1,\n    x2,\n    y2,\n  };\n\n  return (\n    <Layer className={classNames('recharts-reference-line', className)}>\n      {renderLine(shape, lineProps)}\n      {Label.renderCallByParent(props, rectWithCoords({ x1, y1, x2, y2 }))}\n    </Layer>\n  );\n}\n\nReferenceLine.displayName = 'ReferenceLine';\nReferenceLine.defaultProps = {\n  isFront: false,\n  ifOverflow: 'discard',\n  xAxisId: 0,\n  yAxisId: 0,\n  fill: 'none',\n  stroke: '#ccc',\n  fillOpacity: 1,\n  strokeWidth: 1,\n  position: 'middle',\n};\n\nexport default ReferenceLine;\n","/**\n * @fileOverview Render a group of scatters\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport Animate from 'react-smooth';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Layer from '../container/Layer';\nimport LabelList from '../component/LabelList';\nimport { findAllByType } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport ZAxis, { Props as ZAxisProps } from './ZAxis';\nimport Curve, { Props as CurveProps, CurveType } from '../shape/Curve';\nimport Symbols, { Props as SymbolsProps } from '../shape/Symbols';\nimport ErrorBar, { Props as ErrorBarProps } from './ErrorBar';\nimport Cell from '../component/Cell';\nimport { uniqueId, interpolateNumber, getLinearRegression } from '../util/DataUtils';\nimport { getValueByDataKey, getCateCoordinateOfLine } from '../util/ChartUtils';\nimport {\n  LegendType,\n  PresentationAttributes,\n  SymbolType,\n  AnimationTiming,\n  filterProps,\n  D3Scale,\n  ChartOffset,\n  DataKey,\n  TickItem,\n  adaptEventsOfChild,\n} from '../util/types';\nimport { TooltipType } from '../component/DefaultTooltipContent';\nimport { Props as XAxisProps } from './XAxis';\nimport { Props as YAxisProps } from './YAxis';\n\ninterface ScattterPointNode {\n  x?: number | string;\n  y?: number | string;\n  z?: number | string;\n}\n\ninterface ScatterPointItem {\n  cx?: number;\n  cy?: number;\n  size?: number;\n  node?: ScattterPointNode;\n  payload?: any;\n}\n\ninterface ScatterProps {\n  data?: any[];\n  xAxisId?: string | number;\n  yAxisId?: string | number;\n  zAxisId?: string | number;\n\n  left?: number;\n  top?: number;\n\n  xAxis?: Omit<XAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  yAxis?: Omit<YAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n  zAxis?: Omit<ZAxisProps, 'scale'> & { scale: D3Scale<string | number> };\n\n  dataKey?: DataKey<any>;\n\n  line?: ReactElement<SVGElement> | ((props: any) => SVGElement) | CurveProps | boolean;\n  lineType?: 'fitting' | 'joint';\n  lineJointType?: CurveType;\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  className: string;\n  name?: string | number;\n\n  activeIndex?: number;\n  activeShape?: ReactElement<SVGElement> | ((props: any) => SVGElement) | SymbolsProps;\n  shape?: SymbolType | ReactElement<SVGElement> | ((props: any) => SVGElement);\n  points?: ScatterPointItem[];\n  hide?: boolean;\n\n  isAnimationActive?: boolean;\n  animationId?: number;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n}\n\ntype Props = PresentationAttributes<SVGElement> & ScatterProps;\n\ninterface State {\n  isAnimationFinished?: boolean;\n  prevPoints?: ScatterPointItem[];\n}\n\nclass Scatter extends PureComponent<Props, State> {\n  static displayName = 'Scatter';\n\n  static defaultProps = {\n    xAxisId: 0,\n    yAxisId: 0,\n    zAxisId: 0,\n    legendType: 'circle',\n    lineType: 'joint',\n    lineJointType: 'linear',\n    data: [] as any[],\n    shape: 'circle',\n    hide: false,\n\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 0,\n    animationDuration: 400,\n    animationEasing: 'linear',\n  };\n\n  /**\n   * Compose the data of each group\n   * @param  {Object} xAxis   The configuration of x-axis\n   * @param  {Object} yAxis   The configuration of y-axis\n   * @param  {String} dataKey The unique key of a group\n   * @return {Array}  Composed data\n   */\n  static getComposedData = ({\n    xAxis,\n    yAxis,\n    zAxis,\n    item,\n    displayedData,\n    onItemMouseLeave,\n    onItemMouseEnter,\n    onItemClick,\n    xAxisTicks,\n    yAxisTicks,\n    offset,\n  }: {\n    props: Props;\n    xAxis: Props['xAxis'];\n    yAxis: Props['yAxis'];\n    zAxis: Props['zAxis'];\n    xAxisTicks: TickItem[];\n    yAxisTicks: TickItem[];\n    item: Scatter;\n    onItemMouseLeave?: PresentationAttributes<SVGElement>['onMouseLeave'];\n    onItemMouseEnter?: PresentationAttributes<SVGElement>['onMouseLeave'];\n    onItemClick?: PresentationAttributes<SVGElement>['onClick'];\n    bandSize: number;\n    displayedData: any[];\n    offset: ChartOffset;\n  }) => {\n    const { tooltipType } = item.props;\n    const cells = findAllByType(item.props.children, Cell.displayName);\n    const xAxisDataKey = _.isNil(xAxis.dataKey) ? item.props.dataKey : xAxis.dataKey;\n    const yAxisDataKey = _.isNil(yAxis.dataKey) ? item.props.dataKey : yAxis.dataKey;\n    const zAxisDataKey = zAxis && zAxis.dataKey;\n    const defaultRangeZ = zAxis ? zAxis.range : ZAxis.defaultProps.range;\n    const defaultZ = defaultRangeZ && defaultRangeZ[0];\n    const xBandSize = (xAxis.scale as any).bandwidth ? (xAxis.scale as any).bandwidth() : 0;\n    const yBandSize = (yAxis.scale as any).bandwidth ? (yAxis.scale as any).bandwidth() : 0;\n    const points = displayedData.map((entry, index) => {\n      const x = getValueByDataKey(entry, xAxisDataKey);\n      const y = getValueByDataKey(entry, yAxisDataKey);\n      const z = (!_.isNil(zAxisDataKey) && getValueByDataKey(entry, zAxisDataKey)) || '-';\n      const tooltipPayload = [\n        {\n          name: _.isNil(xAxis.dataKey) ? item.props.name : xAxis.name || xAxis.dataKey,\n          unit: xAxis.unit || '',\n          value: x,\n          payload: entry,\n          dataKey: xAxisDataKey,\n          type: tooltipType,\n        },\n        {\n          name: _.isNil(yAxis.dataKey) ? item.props.name : yAxis.name || yAxis.dataKey,\n          unit: yAxis.unit || '',\n          value: y,\n          payload: entry,\n          dataKey: yAxisDataKey,\n          type: tooltipType,\n        },\n      ];\n\n      if (z !== '-') {\n        tooltipPayload.push({\n          name: zAxis.name || zAxis.dataKey,\n          unit: zAxis.unit || '',\n          value: z,\n          payload: entry,\n          dataKey: zAxisDataKey,\n          type: tooltipType,\n        });\n      }\n      const cx = getCateCoordinateOfLine({\n        axis: xAxis,\n        ticks: xAxisTicks,\n        bandSize: xBandSize,\n        entry,\n        index,\n        dataKey: xAxisDataKey,\n      });\n      const cy = getCateCoordinateOfLine({\n        axis: yAxis,\n        ticks: yAxisTicks,\n        bandSize: yBandSize,\n        entry,\n        index,\n        dataKey: yAxisDataKey,\n      });\n      const size = z !== '-' ? zAxis.scale(z) : defaultZ;\n      const radius = Math.sqrt(Math.max(size, 0) / Math.PI);\n\n      return {\n        ...entry,\n        cx,\n        cy,\n        x: cx - radius,\n        y: cy - radius,\n        xAxis,\n        yAxis,\n        zAxis,\n        width: 2 * radius,\n        height: 2 * radius,\n        size,\n        node: { x, y, z },\n        tooltipPayload,\n        tooltipPosition: { x: cx, y: cy },\n        payload: entry,\n        ...(cells && cells[index] && cells[index].props),\n      };\n    });\n\n    return {\n      onMouseLeave: _.isFunction(onItemMouseLeave) ? onItemMouseLeave : item.props.onMouseLeave,\n      onMouseEnter: _.isFunction(onItemMouseEnter) ? onItemMouseEnter : item.props.onMouseEnter,\n      onClick: _.isFunction(onItemClick) ? onItemClick : item.props.onClick,\n      points,\n      ...offset,\n    };\n  };\n\n  state: State = { isAnimationFinished: false };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, points } = this.props;\n\n    if (nextProps.animationId !== animationId) {\n      this.cachePrevPoints(points);\n    }\n  }\n\n  cachePrevPoints = (points: ScatterPointItem[]) => {\n    this.setState({ prevPoints: points });\n  };\n\n  handleAnimationEnd = () => {\n    this.setState({ isAnimationFinished: true });\n  };\n\n  handleAnimationStart = () => {\n    this.setState({ isAnimationFinished: false });\n  };\n\n  id = uniqueId('recharts-scatter-');\n\n  static renderSymbolItem(option: Props['activeShape'] | Props['shape'], props: any) {\n    let symbol;\n\n    if (React.isValidElement(option)) {\n      symbol = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      symbol = option(props);\n    } else if (typeof option === 'string') {\n      symbol = <Symbols {...props} type={option} />;\n    }\n\n    return symbol;\n  }\n\n  renderSymbolsStatically(points: ScatterPointItem[]) {\n    const { shape, activeShape, activeIndex } = this.props;\n    const baseProps = filterProps(this.props);\n\n    return points.map((entry, i) => {\n      const props = { key: `symbol-${i}`, ...baseProps, ...entry };\n\n      return (\n        <Layer\n          className=\"recharts-scatter-symbol\"\n          {...adaptEventsOfChild(this.props, entry, i)}\n          key={`symbol-${i}`} // eslint-disable-line react/no-array-index-key\n        >\n          {Scatter.renderSymbolItem(activeIndex === i ? activeShape : shape, props)}\n        </Layer>\n      );\n    });\n  }\n\n  renderSymbolsWithAnimation() {\n    const { points, isAnimationActive, animationBegin, animationDuration, animationEasing, animationId } = this.props;\n    const { prevPoints } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`pie-${animationId}`}\n        onAnimationEnd={this.handleAnimationEnd}\n        onAnimationStart={this.handleAnimationStart}\n      >\n        {({ t }: { t: number }) => {\n          const stepData = points.map((entry, index) => {\n            const prev = prevPoints && prevPoints[index];\n\n            if (prev) {\n              const interpolatorCx = interpolateNumber(prev.cx, entry.cx);\n              const interpolatorCy = interpolateNumber(prev.cy, entry.cy);\n              const interpolatorSize = interpolateNumber(prev.size, entry.size);\n\n              return {\n                ...entry,\n                cx: interpolatorCx(t),\n                cy: interpolatorCy(t),\n                size: interpolatorSize(t),\n              };\n            }\n\n            const interpolator = interpolateNumber(0, entry.size);\n\n            return { ...entry, size: interpolator(t) };\n          });\n\n          return <Layer>{this.renderSymbolsStatically(stepData)}</Layer>;\n        }}\n      </Animate>\n    );\n  }\n\n  renderSymbols() {\n    const { points, isAnimationActive } = this.props;\n    const { prevPoints } = this.state;\n\n    if (isAnimationActive && points && points.length && (!prevPoints || !_.isEqual(prevPoints, points))) {\n      return this.renderSymbolsWithAnimation();\n    }\n\n    return this.renderSymbolsStatically(points);\n  }\n\n  renderErrorBar() {\n    const { isAnimationActive } = this.props;\n    if (isAnimationActive && !this.state.isAnimationFinished) {\n      return null;\n    }\n\n    const { points, xAxis, yAxis, children } = this.props;\n    const errorBarItems = findAllByType(children, ErrorBar.displayName);\n\n    if (!errorBarItems) {\n      return null;\n    }\n\n    function dataPointFormatterY(dataPoint: ScatterPointItem, dataKey: Props['dataKey']) {\n      return {\n        x: dataPoint.cx,\n        y: dataPoint.cy,\n        value: +dataPoint.node.y,\n        errorVal: getValueByDataKey(dataPoint, dataKey),\n      };\n    }\n\n    function dataPointFormatterX(dataPoint: ScatterPointItem, dataKey: Props['dataKey']) {\n      return {\n        x: dataPoint.cx,\n        y: dataPoint.cy,\n        value: +dataPoint.node.x,\n        errorVal: getValueByDataKey(dataPoint, dataKey),\n      };\n    }\n\n    return errorBarItems.map((item: ReactElement<ErrorBarProps>, i: number) => {\n      const { direction } = item.props;\n\n      return React.cloneElement(item, {\n        key: i, // eslint-disable-line react/no-array-index-key\n        data: points,\n        xAxis,\n        yAxis,\n        layout: direction === 'x' ? 'vertical' : 'horizontal',\n        dataPointFormatter: direction === 'x' ? dataPointFormatterX : dataPointFormatterY,\n      });\n    });\n  }\n\n  renderLine() {\n    const { points, line, lineType, lineJointType } = this.props;\n    const scatterProps = filterProps(this.props);\n    const customLineProps = filterProps(line);\n    let linePoints, lineItem;\n\n    if (lineType === 'joint') {\n      linePoints = points.map(entry => ({ x: entry.cx, y: entry.cy }));\n    } else if (lineType === 'fitting') {\n      const { xmin, xmax, a, b } = getLinearRegression(points);\n      const linearExp = (x: number) => a * x + b;\n      linePoints = [\n        { x: xmin, y: linearExp(xmin) },\n        { x: xmax, y: linearExp(xmax) },\n      ];\n    }\n    const lineProps = {\n      ...scatterProps,\n      fill: 'none',\n      stroke: scatterProps && scatterProps.fill,\n      ...customLineProps,\n      points: linePoints,\n    };\n\n    if (React.isValidElement(line)) {\n      lineItem = React.cloneElement(line as any, lineProps);\n    } else if (_.isFunction(line)) {\n      lineItem = line(lineProps);\n    } else {\n      lineItem = <Curve {...lineProps} type={lineJointType} />;\n    }\n\n    return (\n      <Layer className=\"recharts-scatter-line\" key=\"recharts-scatter-line\">\n        {lineItem}\n      </Layer>\n    );\n  }\n\n  render() {\n    const { hide, points, line, className, xAxis, yAxis, left, top, width, height, id, isAnimationActive } = this.props;\n    if (hide || !points || !points.length) {\n      return null;\n    }\n    const { isAnimationFinished } = this.state;\n    const layerClass = classNames('recharts-scatter', className);\n    const needClip = (xAxis && xAxis.allowDataOverflow) || (yAxis && yAxis.allowDataOverflow);\n    const clipPathId = _.isNil(id) ? this.id : id;\n\n    return (\n      <Layer className={layerClass} clipPath={needClip ? `url(#clipPath-${clipPathId})` : null}>\n        {needClip ? (\n          <defs>\n            <clipPath id={`clipPath-${clipPathId}`}>\n              <rect x={left} y={top} width={width} height={height} />\n            </clipPath>\n          </defs>\n        ) : null}\n        {line && this.renderLine()}\n        {this.renderErrorBar()}\n        <Layer key=\"recharts-scatter-symbols\">{this.renderSymbols()}</Layer>\n        {(!isAnimationActive || isAnimationFinished) && LabelList.renderCallByParent(this.props, points)}\n      </Layer>\n    );\n  }\n}\n\nexport default Scatter;\n","/**\n * @fileOverview X Axis\n */\nimport { BaseAxisProps, AxisInterval } from '../util/types';\n\n/** Define of XAxis props */\nexport interface Props extends BaseAxisProps {\n  /** The unique id of x-axis */\n  xAxisId?: string | number;\n  /** The width of axis which is usually calculated internally */\n  width?: number;\n  /** The height of axis, which need to be setted by user */\n  height?: number;\n  mirror?: boolean;\n  // The orientation of axis\n  orientation?: 'top' | 'bottom';\n  /**\n   * Ticks can be any type when the axis is the type of category\n   * Ticks must be numbers when the axis is the type of number\n   */\n  ticks?: (string | number)[];\n  padding?: { left?: number; right?: number };\n  minTickGap?: number;\n  interval?: AxisInterval;\n  reversed?: boolean;\n}\nfunction XAxis(props: Props): any {\n  return null;\n}\n\nXAxis.displayName = 'XAxis';\nXAxis.defaultProps = {\n  allowDecimals: true,\n  hide: false,\n  orientation: 'bottom',\n  width: 0,\n  height: 30,\n  mirror: false,\n  xAxisId: 0,\n  tickCount: 5,\n  type: 'category',\n  domain: [0, 'auto'],\n  padding: { left: 0, right: 0 },\n  allowDataOverflow: false,\n  scale: 'auto',\n  reversed: false,\n  allowDuplicatedCategory: true,\n};\n\nexport default XAxis;\n","/**\n * @fileOverview Y Axis\n */\nimport { BaseAxisProps, AxisInterval } from '../util/types';\n\nexport interface Props extends BaseAxisProps {\n  /** The unique id of y-axis */\n  yAxisId?: string | number;\n  /**\n   * Ticks can be any type when the axis is the type of category\n   * Ticks must be numbers when the axis is the type of number\n   */\n  ticks?: (string | number)[];\n  /** The width of axis, which need to be setted by user */\n  width?: number;\n  /** The height of axis which is usually calculated in Chart */\n  height?: number;\n  mirror?: boolean;\n  /** The orientation of axis */\n  orientation?: 'left' | 'right';\n  padding?: {\n    top?: number;\n    bottom?: number;\n  };\n  minTickGap?: number;\n  interval?: AxisInterval;\n  reversed?: boolean;\n}\n\nfunction YAxis(props: Props): any {\n  return null;\n}\n\nYAxis.displayName = 'YAxis';\nYAxis.defaultProps = {\n  allowDuplicatedCategory: true,\n  allowDecimals: true,\n  hide: false,\n  orientation: 'left',\n  width: 60,\n  height: 0,\n  mirror: false,\n  yAxisId: 0,\n  tickCount: 5,\n  type: 'number',\n  domain: [0, 'auto'],\n  padding: { top: 0, bottom: 0 },\n  allowDataOverflow: false,\n  scale: 'auto',\n  reversed: false,\n};\n\nexport default YAxis;\n","/**\n * @fileOverview Z Axis\n */\nimport { ScaleType, DataKey } from '../util/types';\n\nexport interface Props {\n  type?: 'number' | 'category';\n  /** The name of data displayed in the axis */\n  name?: string | number;\n  /** The unit of data displayed in the axis */\n  unit?: string | number;\n  /** The unique id of z-axis */\n  zAxisId?: string | number;\n  /** The key of data displayed in the axis */\n  dataKey?: DataKey<any>;\n  /** The range of axis */\n  range?: number[];\n  scale?: ScaleType | Function;\n}\n\nfunction ZAxis(props: Props): any {\n  return null;\n}\n\nZAxis.displayName = 'ZAxis';\nZAxis.defaultProps = {\n  zAxisId: 0,\n  range: [64, 64],\n  scale: 'auto',\n  type: 'number',\n};\n\nexport default ZAxis;\n","/**\n * @fileOverview Area Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Area from '../cartesian/Area';\nimport XAxis from '../cartesian/XAxis';\nimport YAxis from '../cartesian/YAxis';\nimport { formatAxisMap } from '../util/CartesianUtils';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'AreaChart',\n  GraphicalChild: Area,\n  axisComponents: [\n    { axisType: 'xAxis', AxisComp: XAxis },\n    { axisType: 'yAxis', AxisComp: YAxis },\n  ],\n  formatAxisMap,\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Bar Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Bar from '../cartesian/Bar';\nimport XAxis from '../cartesian/XAxis';\nimport YAxis from '../cartesian/YAxis';\nimport { formatAxisMap } from '../util/CartesianUtils';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'BarChart',\n  GraphicalChild: Bar,\n  axisComponents: [\n    { axisType: 'xAxis', AxisComp: XAxis },\n    { axisType: 'yAxis', AxisComp: YAxis },\n  ],\n  formatAxisMap,\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Composed Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Area from '../cartesian/Area';\nimport Bar from '../cartesian/Bar';\nimport Line from '../cartesian/Line';\nimport Scatter from '../cartesian/Scatter';\nimport XAxis from '../cartesian/XAxis';\nimport YAxis from '../cartesian/YAxis';\nimport ZAxis from '../cartesian/ZAxis';\nimport { formatAxisMap } from '../util/CartesianUtils';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'ComposedChart',\n  GraphicalChild: [Line, Area, Bar, Scatter],\n  axisComponents: [\n    { axisType: 'xAxis', AxisComp: XAxis },\n    { axisType: 'yAxis', AxisComp: YAxis },\n    { axisType: 'zAxis', AxisComp: ZAxis },\n  ],\n  formatAxisMap,\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Funnel Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Funnel from '../numberAxis/Funnel';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'FunnelChart',\n  GraphicalChild: Funnel,\n  eventType: 'item',\n  axisComponents: [],\n  defaultProps: {\n    layout: 'centric',\n  },\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Line Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Line from '../cartesian/Line';\nimport XAxis from '../cartesian/XAxis';\nimport YAxis from '../cartesian/YAxis';\nimport { formatAxisMap } from '../util/CartesianUtils';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'LineChart',\n  GraphicalChild: Line,\n  axisComponents: [\n    { axisType: 'xAxis', AxisComp: XAxis },\n    { axisType: 'yAxis', AxisComp: YAxis },\n  ],\n  formatAxisMap,\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Pie Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport PolarAngleAxis from '../polar/PolarAngleAxis';\nimport PolarRadiusAxis from '../polar/PolarRadiusAxis';\nimport { formatAxisMap } from '../util/PolarUtils';\nimport Pie from '../polar/Pie';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'PieChart',\n  GraphicalChild: Pie,\n  eventType: 'item',\n  legendContent: 'children',\n  axisComponents: [\n    { axisType: 'angleAxis', AxisComp: PolarAngleAxis },\n    { axisType: 'radiusAxis', AxisComp: PolarRadiusAxis },\n  ],\n  formatAxisMap,\n  defaultProps: {\n    layout: 'centric',\n    startAngle: 0,\n    endAngle: 360,\n    cx: '50%',\n    cy: '50%',\n    innerRadius: 0,\n    outerRadius: '80%',\n  },\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Radar Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Radar from '../polar/Radar';\nimport PolarAngleAxis from '../polar/PolarAngleAxis';\nimport PolarRadiusAxis from '../polar/PolarRadiusAxis';\nimport { formatAxisMap } from '../util/PolarUtils';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'RadarChart',\n  GraphicalChild: Radar,\n  axisComponents: [\n    { axisType: 'angleAxis', AxisComp: PolarAngleAxis },\n    { axisType: 'radiusAxis', AxisComp: PolarRadiusAxis },\n  ],\n  formatAxisMap,\n  defaultProps: {\n    layout: 'centric',\n    startAngle: 90,\n    endAngle: -270,\n    cx: '50%',\n    cy: '50%',\n    innerRadius: 0,\n    outerRadius: '80%',\n  },\n} as CategoricalChartOptions);\n","/**\n * @fileOverview Radar Bar Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport PolarAngleAxis from '../polar/PolarAngleAxis';\nimport PolarRadiusAxis from '../polar/PolarRadiusAxis';\nimport { formatAxisMap } from '../util/PolarUtils';\nimport RadialBar from '../polar/RadialBar';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'RadialBarChart',\n  GraphicalChild: RadialBar,\n  legendContent: 'children',\n  axisComponents: [\n    { axisType: 'angleAxis', AxisComp: PolarAngleAxis },\n    { axisType: 'radiusAxis', AxisComp: PolarRadiusAxis },\n  ],\n  formatAxisMap,\n  defaultProps: {\n    layout: 'radial',\n    startAngle: 0,\n    endAngle: 360,\n    cx: '50%',\n    cy: '50%',\n    innerRadius: 0,\n    outerRadius: '80%',\n  },\n} as CategoricalChartOptions);\n","/**\n * @file TreemapChart\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Surface from '../container/Surface';\nimport Layer from '../container/Layer';\nimport Tooltip from '../component/Tooltip';\nimport Rectangle from '../shape/Rectangle';\nimport { shallowEqual } from '../util/ShallowEqual';\nimport { filterSvgElements, validateWidthHeight, findChildByType } from '../util/ReactUtils';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport { Margin, DataKey, PresentationAttributes, filterProps, SankeyLink, SankeyNode } from '../util/types';\n\nconst defaultCoordinateOfTooltip = { x: 0, y: 0 };\n\nconst interpolationGenerator = (a: number, b: number) => {\n  const ka = +a;\n  const kb = b - ka;\n  return (t: any) => ka + kb * t;\n};\nconst centerY = (node: SankeyNode) => node.y + node.dy / 2;\nconst getValue = (entry: SankeyLink) => (entry && entry.value) || 0;\nconst getSumOfIds = (links: SankeyLink[], ids: number[]) =>\n  ids.reduce((result: any, id: any) => result + getValue(links[id]), 0);\nconst getSumWithWeightedSource = (tree: any, links: SankeyLink[], ids: number[]) =>\n  ids.reduce((result: any, id: any) => {\n    const link = links[id];\n    const sourceNode = tree[link.source];\n\n    return result + centerY(sourceNode) * getValue(links[id]);\n  }, 0);\nconst getSumWithWeightedTarget = (tree: any, links: SankeyLink[], ids: number[]) =>\n  ids.reduce((result: number, id: number) => {\n    const link = links[id];\n    const targetNode = tree[link.target];\n\n    return result + centerY(targetNode) * getValue(links[id]);\n  }, 0);\nconst ascendingY = (a: any, b: any) => a.y - b.y;\n\nconst searchTargetsAndSources = (links: SankeyLink[], id: number) => {\n  const sourceNodes: number[] = [];\n  const sourceLinks: number[] = [];\n  const targetNodes: number[] = [];\n  const targetLinks: number[] = [];\n\n  for (let i = 0, len = links.length; i < len; i++) {\n    const link = links[i];\n\n    if (link.source === id) {\n      targetNodes.push(link.target);\n      targetLinks.push(i);\n    }\n\n    if (link.target === id) {\n      sourceNodes.push(link.source);\n      sourceLinks.push(i);\n    }\n  }\n\n  return { sourceNodes, sourceLinks, targetLinks, targetNodes };\n};\n\nconst updateDepthOfTargets = (tree: any, curNode: any) => {\n  const { targetNodes } = curNode;\n\n  for (let i = 0, len = targetNodes.length; i < len; i++) {\n    const target = tree[targetNodes[i]];\n\n    if (target) {\n      target.depth = Math.max(curNode.depth + 1, target.depth);\n\n      updateDepthOfTargets(tree, target);\n    }\n  }\n};\n\nconst getNodesTree = ({ nodes, links }: any, width: number, nodeWidth: number): any => {\n  const tree = nodes.map((entry: any, index: number) => {\n    const result = searchTargetsAndSources(links, index);\n\n    return {\n      ...entry,\n      ...result,\n      value: Math.max(getSumOfIds(links, result.sourceLinks), getSumOfIds(links, result.targetLinks)),\n      depth: 0,\n    };\n  });\n\n  for (let i = 0, len = tree.length; i < len; i++) {\n    const node = tree[i];\n\n    if (!node.sourceNodes.length) {\n      updateDepthOfTargets(tree, node);\n    }\n  }\n  const maxDepth = _.maxBy(tree, (entry: SankeyNode) => entry.depth).depth;\n\n  if (maxDepth >= 1) {\n    const childWidth = (width - nodeWidth) / maxDepth;\n    for (let i = 0, len = tree.length; i < len; i++) {\n      const node = tree[i];\n\n      if (!node.targetNodes.length) {\n        node.depth = maxDepth;\n      }\n      node.x = node.depth * childWidth;\n      node.dx = nodeWidth;\n    }\n  }\n\n  return { tree, maxDepth };\n};\n\nconst getDepthTree = (tree: any): any[] => {\n  const result = [];\n\n  for (let i = 0, len = tree.length; i < len; i++) {\n    const node = tree[i];\n\n    if (!result[node.depth]) {\n      result[node.depth] = [];\n    }\n\n    result[node.depth].push(node);\n  }\n\n  return result;\n};\n\nconst updateYOfTree = (depthTree: any, height: number, nodePadding: number, links: any) => {\n  const yRatio: number = _.min(\n    depthTree.map((nodes: any) => (height - (nodes.length - 1) * nodePadding) / _.sumBy(nodes, getValue)),\n  );\n\n  for (let d = 0, maxDepth = depthTree.length; d < maxDepth; d++) {\n    for (let i = 0, len = depthTree[d].length; i < len; i++) {\n      const node = depthTree[d][i];\n\n      node.y = i;\n      node.dy = node.value * yRatio;\n    }\n  }\n\n  return links.map((link: any) => ({ ...link, dy: getValue(link) * yRatio }));\n};\n\nconst resolveCollisions = (depthTree: any[], height: number, nodePadding: number) => {\n  for (let i = 0, len = depthTree.length; i < len; i++) {\n    const nodes = depthTree[i];\n    const n = nodes.length;\n\n    // Sort by the value of y\n    nodes.sort(ascendingY);\n\n    let y0 = 0;\n    for (let j = 0; j < n; j++) {\n      const node = nodes[j];\n      const dy = y0 - node.y;\n\n      if (dy > 0) {\n        node.y += dy;\n      }\n\n      y0 = node.y + node.dy + nodePadding;\n    }\n\n    y0 = height + nodePadding;\n    for (let j = n - 1; j >= 0; j--) {\n      const node = nodes[j];\n      const dy = node.y + node.dy + nodePadding - y0;\n\n      if (dy > 0) {\n        node.y -= dy;\n        y0 = node.y;\n      } else {\n        break;\n      }\n    }\n  }\n};\n\nconst relaxLeftToRight = (tree: any, depthTree: any, links: any, alpha: any) => {\n  for (let i = 0, maxDepth = depthTree.length; i < maxDepth; i++) {\n    const nodes = depthTree[i];\n\n    for (let j = 0, len = nodes.length; j < len; j++) {\n      const node = nodes[j];\n\n      if (node.sourceLinks.length) {\n        const sourceSum = getSumOfIds(links, node.sourceLinks);\n        const weightedSum = getSumWithWeightedSource(tree, links, node.sourceLinks);\n        const y = weightedSum / sourceSum;\n\n        node.y += (y - centerY(node)) * alpha;\n      }\n    }\n  }\n};\nconst relaxRightToLeft = (tree: any, depthTree: any, links: any, alpha: any) => {\n  for (let i = depthTree.length - 1; i >= 0; i--) {\n    const nodes = depthTree[i];\n\n    for (let j = 0, len = nodes.length; j < len; j++) {\n      const node = nodes[j];\n\n      if (node.targetLinks.length) {\n        const targetSum = getSumOfIds(links, node.targetLinks);\n        const weightedSum = getSumWithWeightedTarget(tree, links, node.targetLinks);\n        const y = weightedSum / targetSum;\n\n        node.y += (y - centerY(node)) * alpha;\n      }\n    }\n  }\n};\nconst updateYOfLinks = (tree: any, links: any) => {\n  for (let i = 0, len = tree.length; i < len; i++) {\n    const node = tree[i];\n    let sy = 0;\n    let ty = 0;\n\n    node.targetLinks.sort((a: any, b: any) => tree[links[a].target].y - tree[links[b].target].y);\n    node.sourceLinks.sort((a: any, b: any) => tree[links[a].source].y - tree[links[b].source].y);\n\n    for (let j = 0, tLen = node.targetLinks.length; j < tLen; j++) {\n      const link = links[node.targetLinks[j]];\n\n      if (link) {\n        link.sy = sy;\n        sy += link.dy;\n      }\n    }\n\n    for (let j = 0, sLen = node.sourceLinks.length; j < sLen; j++) {\n      const link = links[node.sourceLinks[j]];\n\n      if (link) {\n        link.ty = ty;\n        ty += link.dy;\n      }\n    }\n  }\n};\n\nconst computeData = ({\n  data,\n  width,\n  height,\n  iterations,\n  nodeWidth,\n  nodePadding,\n}: {\n  data: any;\n  width: number;\n  height: number;\n  iterations: any;\n  nodeWidth: number;\n  nodePadding: number;\n}): {\n  nodes: SankeyNode[];\n  links: SankeyLink[];\n} => {\n  const { links } = data;\n  const { tree } = getNodesTree(data, width, nodeWidth);\n  const depthTree = getDepthTree(tree);\n  const newLinks = updateYOfTree(depthTree, height, nodePadding, links);\n\n  resolveCollisions(depthTree, height, nodePadding);\n\n  let alpha = 1;\n  for (let i = 1; i <= iterations; i++) {\n    relaxRightToLeft(tree, depthTree, newLinks, (alpha *= 0.99));\n\n    resolveCollisions(depthTree, height, nodePadding);\n\n    relaxLeftToRight(tree, depthTree, newLinks, alpha);\n\n    resolveCollisions(depthTree, height, nodePadding);\n  }\n\n  updateYOfLinks(tree, newLinks);\n\n  return { nodes: tree, links: newLinks };\n};\n\nconst getCoordinateOfTooltip = (el: any, type: string) => {\n  if (type === 'node') {\n    return { x: el.x + el.width / 2, y: el.y + el.height / 2 };\n  }\n\n  return {\n    x: (el.sourceX + el.targetX) / 2,\n    y: (el.sourceY + el.targetY) / 2,\n  };\n};\n\nconst getPayloadOfTooltip = (el: any, type: string, nameKey: DataKey<any>) => {\n  const { payload } = el;\n  if (type === 'node') {\n    return [\n      {\n        payload: el,\n        name: getValueByDataKey(payload, nameKey, ''),\n        value: getValueByDataKey(payload, 'value'),\n      },\n    ];\n  }\n  if (payload.source && payload.target) {\n    const sourceName = getValueByDataKey(payload.source, nameKey, '');\n    const targetName = getValueByDataKey(payload.target, nameKey, '');\n\n    return [\n      {\n        payload: el,\n        name: `${sourceName} - ${targetName}`,\n        value: getValueByDataKey(payload, 'value'),\n      },\n    ];\n  }\n\n  return [];\n};\n\ninterface SankeyProps {\n  nameKey?: DataKey<any>;\n\n  dataKey?: DataKey<any>;\n\n  width?: number;\n\n  height?: number;\n\n  data: {\n    node: SankeyNode[];\n    links: SankeyLink[];\n  };\n\n  nodePadding?: number;\n\n  nodeWidth?: number;\n\n  linkCurvature?: number;\n\n  iterations?: number;\n\n  // TODO object  func\n  node?: React.ReactElement;\n\n  link?: React.ReactElement;\n\n  style?: any;\n\n  className?: string;\n\n  children?: any;\n\n  margin?: Margin;\n\n  onClick?: any;\n\n  onMouseEnter?: any;\n\n  onMouseLeave?: any;\n}\n\ntype Props = PresentationAttributes<SVGElement> & SankeyProps;\n\ninterface State {\n  activeElement?: any;\n  activeElementType?: any;\n  isTooltipActive: boolean;\n  nodes: SankeyNode[];\n  links: SankeyLink[];\n}\n\nclass Sankey extends PureComponent<Props, State> {\n  static displayName = 'Sankey';\n\n  static defaultProps = {\n    nameKey: 'name',\n    dataKey: 'value',\n    nodePadding: 10,\n    nodeWidth: 10,\n    linkCurvature: 0.5,\n    iterations: 32,\n    margin: { top: 5, right: 5, bottom: 5, left: 5 },\n  };\n\n  state = {\n    activeElement: null as any,\n    activeElementType: null as any,\n    isTooltipActive: false,\n    nodes: [] as SankeyNode[],\n    links: [] as SankeyLink[],\n  };\n\n  constructor(props: Props) {\n    super(props);\n\n    this.state = (this.constructor as any).createDefaultState(props);\n  }\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { data, width, height, margin, iterations, nodeWidth, nodePadding, nameKey } = this.props;\n    if (\n      nextProps.data !== data ||\n      nextProps.width !== width ||\n      nextProps.height !== height ||\n      !shallowEqual(nextProps.margin, margin) ||\n      nextProps.iterations !== iterations ||\n      nextProps.nodeWidth !== nodeWidth ||\n      nextProps.nodePadding !== nodePadding ||\n      nextProps.nameKey !== nameKey\n    ) {\n      this.setState((this.constructor as any).createDefaultState(nextProps));\n    }\n  }\n\n  /**\n   * Returns default, reset state for the sankey chart.\n   * @param  {Object} props The latest props\n   * @return {Object} Whole new state\n   */\n  static createDefaultState(props: Props): State {\n    const { data, width, height, margin, iterations, nodeWidth, nodePadding } = props;\n    const contentWidth = width - ((margin && margin.left) || 0) - ((margin && margin.right) || 0);\n    const contentHeight = height - ((margin && margin.top) || 0) - ((margin && margin.bottom) || 0);\n    const { links, nodes } = computeData({\n      data,\n      width: contentWidth,\n      height: contentHeight,\n      iterations,\n      nodeWidth,\n      nodePadding,\n    });\n\n    return {\n      activeElement: null,\n      activeElementType: null,\n      isTooltipActive: false,\n      nodes,\n      links,\n    };\n  }\n\n  handleMouseEnter(el: React.ReactElement, type: string, e: any) {\n    const { onMouseEnter, children } = this.props;\n    const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n    if (tooltipItem) {\n      this.setState(\n        {\n          activeElement: el,\n          activeElementType: type,\n          isTooltipActive: true,\n        },\n        () => {\n          if (onMouseEnter) {\n            onMouseEnter(el, type, e);\n          }\n        },\n      );\n    } else if (onMouseEnter) {\n      onMouseEnter(el, type, e);\n    }\n  }\n\n  handleMouseLeave(el: React.ReactElement, type: string, e: any) {\n    const { onMouseLeave, children } = this.props;\n    const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n    if (tooltipItem) {\n      this.setState(\n        {\n          isTooltipActive: false,\n        },\n        () => {\n          if (onMouseLeave) {\n            onMouseLeave(el, type, e);\n          }\n        },\n      );\n    } else if (onMouseLeave) {\n      onMouseLeave(el, type, e);\n    }\n  }\n\n  handleClick(el: React.ReactElement, type: string, e: any) {\n    const { onClick } = this.props;\n    if (onClick) onClick(el, type, e);\n  }\n\n  static renderLinkItem(option: any, props: any) {\n    if (React.isValidElement(option)) {\n      return React.cloneElement(option, props);\n    }\n    if (_.isFunction(option)) {\n      return option(props);\n    }\n\n    const { sourceX, sourceY, sourceControlX, targetX, targetY, targetControlX, linkWidth, ...others } = props;\n\n    return (\n      <path\n        className=\"recharts-sankey-link\"\n        d={`\n          M${sourceX},${sourceY}\n          C${sourceControlX},${sourceY} ${targetControlX},${targetY} ${targetX},${targetY}\n        `}\n        fill=\"none\"\n        stroke=\"#333\"\n        strokeWidth={linkWidth}\n        strokeOpacity=\"0.2\"\n        {...filterProps(others)}\n      />\n    );\n  }\n\n  renderLinks(links: SankeyLink[], nodes: SankeyNode[]) {\n    const { linkCurvature, link: linkContent, margin } = this.props;\n    const top = _.get(margin, 'top') || 0;\n    const left = _.get(margin, 'left') || 0;\n\n    return (\n      <Layer className=\"recharts-sankey-links\" key=\"recharts-sankey-links\">\n        {links.map((link: SankeyLink, i: number) => {\n          const { sy: sourceRelativeY, ty: targetRelativeY, dy: linkWidth } = link;\n          const source = nodes[link.source];\n          const target = nodes[link.target];\n          const sourceX = source.x + source.dx + left;\n          const targetX = target.x + left;\n          const interpolationFunc = interpolationGenerator(sourceX, targetX);\n          const sourceControlX = interpolationFunc(linkCurvature);\n          const targetControlX = interpolationFunc(1 - linkCurvature);\n          const sourceY = source.y + sourceRelativeY + linkWidth / 2 + top;\n          const targetY = target.y + targetRelativeY + linkWidth / 2 + top;\n\n          const linkProps = {\n            sourceX,\n            targetX,\n            sourceY,\n            targetY,\n            sourceControlX,\n            targetControlX,\n            sourceRelativeY,\n            targetRelativeY,\n            linkWidth,\n            index: i,\n            payload: { ...link, source, target },\n            ...filterProps(linkContent),\n          };\n          const events = {\n            onMouseEnter: this.handleMouseEnter.bind(this, linkProps, 'link'),\n            onMouseLeave: this.handleMouseLeave.bind(this, linkProps, 'link'),\n            onClick: this.handleClick.bind(this, linkProps, 'link'),\n          };\n\n          return (\n            // eslint-disable-next-line react/no-array-index-key\n            <Layer key={`link${i}`} {...events}>\n              {(this.constructor as any).renderLinkItem(linkContent, linkProps)}\n            </Layer>\n          );\n        })}\n      </Layer>\n    );\n  }\n\n  static renderNodeItem(option: any, props: Props) {\n    if (React.isValidElement(option)) {\n      return React.cloneElement(option, props);\n    }\n    if (_.isFunction(option)) {\n      return option(props);\n    }\n\n    return <Rectangle className=\"recharts-sankey-node\" fill=\"#0088fe\" fillOpacity=\"0.8\" {...filterProps(props)} />;\n  }\n\n  renderNodes(nodes: SankeyNode[]) {\n    const { node: nodeContent, margin } = this.props;\n    const top = _.get(margin, 'top') || 0;\n    const left = _.get(margin, 'left') || 0;\n\n    return (\n      <Layer className=\"recharts-sankey-nodes\" key=\"recharts-sankey-nodes\">\n        {nodes.map((node, i) => {\n          const { x, y, dx, dy } = node;\n          const nodeProps = {\n            ...filterProps(nodeContent),\n            x: x + left,\n            y: y + top,\n            width: dx,\n            height: dy,\n            index: i,\n            payload: node,\n          };\n          const events = {\n            onMouseEnter: this.handleMouseEnter.bind(this, nodeProps, 'node'),\n            onMouseLeave: this.handleMouseLeave.bind(this, nodeProps, 'node'),\n            onClick: this.handleClick.bind(this, nodeProps, 'node'),\n          };\n\n          return (\n            // eslint-disable-next-line react/no-array-index-key\n            <Layer key={`node${i}`} {...events}>\n              {(this.constructor as any).renderNodeItem(nodeContent, nodeProps)}\n            </Layer>\n          );\n        })}\n      </Layer>\n    );\n  }\n\n  renderTooltip() {\n    const { children, width, height, nameKey } = this.props;\n    const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n    if (!tooltipItem) {\n      return null;\n    }\n\n    const { isTooltipActive, activeElement, activeElementType } = this.state;\n    const viewBox = { x: 0, y: 0, width, height };\n    const coordinate = activeElement\n      ? getCoordinateOfTooltip(activeElement, activeElementType)\n      : defaultCoordinateOfTooltip;\n    const payload = activeElement ? getPayloadOfTooltip(activeElement, activeElementType, nameKey) : [];\n\n    return React.cloneElement(tooltipItem, {\n      viewBox,\n      active: isTooltipActive,\n      coordinate,\n      label: '',\n      payload,\n    });\n  }\n\n  render() {\n    if (!validateWidthHeight(this)) {\n      return null;\n    }\n\n    const { width, height, className, style, children, ...others } = this.props;\n    const { links, nodes } = this.state;\n    const attrs = filterProps(others);\n\n    return (\n      <div\n        className={classNames('recharts-wrapper', className)}\n        style={{ ...style, position: 'relative', cursor: 'default', width, height }}\n      >\n        <Surface {...attrs} width={width} height={height}>\n          {filterSvgElements(children)}\n          {this.renderLinks(links, nodes)}\n          {this.renderNodes(nodes)}\n        </Surface>\n        {this.renderTooltip()}\n      </div>\n    );\n  }\n}\n\nexport default Sankey;\n","/**\n * @fileOverview Scatter Chart\n */\nimport generateCategoricalChart from './generateCategoricalChart';\nimport Scatter from '../cartesian/Scatter';\nimport XAxis from '../cartesian/XAxis';\nimport YAxis from '../cartesian/YAxis';\nimport ZAxis from '../cartesian/ZAxis';\nimport { formatAxisMap } from '../util/CartesianUtils';\nimport { CategoricalChartOptions } from '../util/types';\n\nexport default generateCategoricalChart({\n  chartName: 'ScatterChart',\n  GraphicalChild: Scatter,\n  eventType: 'single',\n  axisComponents: [\n    { axisType: 'xAxis', AxisComp: XAxis },\n    { axisType: 'yAxis', AxisComp: YAxis },\n    { axisType: 'zAxis', AxisComp: ZAxis },\n  ],\n  formatAxisMap,\n} as CategoricalChartOptions);\n","/* eslint-disable jsx-a11y/no-static-element-interactions */\n/**\n * @fileOverview TreemapChart\n */\nimport React, { PureComponent } from 'react';\nimport Smooth from 'react-smooth';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Surface from '../container/Surface';\nimport Layer from '../container/Layer';\nimport Rectangle from '../shape/Rectangle';\nimport { findChildByType, filterSvgElements, validateWidthHeight } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport Tooltip from '../component/Tooltip';\nimport Polygon from '../shape/Polygon';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport { COLOR_PANEL } from '../util/Constants';\nimport { getStringSize } from '../util/DOMUtils';\nimport { uniqueId } from '../util/DataUtils';\nimport { DataKey, filterProps, TreemapNode } from '../util/types';\n\nconst computeNode = ({\n  depth,\n  node,\n  index,\n  valueKey,\n}: {\n  depth: number;\n  node: TreemapNode;\n  index: number;\n  valueKey: DataKey<any>;\n}) => {\n  const { children } = node;\n  const childDepth = depth + 1;\n  const computedChildren =\n    children && children.length\n      ? children.map((child: TreemapNode, i: number) =>\n          computeNode({ depth: childDepth, node: child, index: i, valueKey }),\n        )\n      : null;\n  let value;\n\n  if (children && children.length) {\n    value = computedChildren.reduce((result: any, child: TreemapNode) => result + child.value, 0);\n  } else {\n    // TODO need to verify valueKey\n    value = _.isNaN(node[valueKey as string]) || node[valueKey as string] <= 0 ? 0 : node[valueKey as string];\n  }\n\n  return {\n    ...node,\n    children: computedChildren,\n    value,\n    depth,\n    index,\n  };\n};\n\nconst filterRect = (node: TreemapNode) => ({ x: node.x, y: node.y, width: node.width, height: node.height });\n\n// Compute the area for each child based on value & scale.\nconst getAreaOfChildren = (children: TreemapNode[], areaValueRatio: number) => {\n  const ratio = areaValueRatio < 0 ? 0 : areaValueRatio;\n\n  return children.map((child: TreemapNode) => {\n    const area = child.value * ratio;\n\n    return {\n      ...child,\n      area: _.isNaN(area) || area <= 0 ? 0 : area,\n    };\n  });\n};\n\n// Computes the score for the specified row, as the worst aspect ratio.\nconst getWorstScore = (row: any, parentSize: number, aspectRatio: number) => {\n  const parentArea = parentSize * parentSize;\n  const rowArea = row.area * row.area;\n  const { min, max } = row.reduce(\n    (result: any, child: any) => ({\n      min: Math.min(result.min, child.area),\n      max: Math.max(result.max, child.area),\n    }),\n    { min: Infinity, max: 0 },\n  );\n\n  return rowArea\n    ? Math.max((parentArea * max * aspectRatio) / rowArea, rowArea / (parentArea * min * aspectRatio))\n    : Infinity;\n};\n\nconst horizontalPosition = (row: any, parentSize: number, parentRect: TreemapNode, isFlush: boolean) => {\n  let rowHeight = parentSize ? Math.round(row.area / parentSize) : 0;\n\n  if (isFlush || rowHeight > parentRect.height) {\n    rowHeight = parentRect.height;\n  }\n\n  let curX = parentRect.x;\n  let child;\n  for (let i = 0, len = row.length; i < len; i++) {\n    child = row[i];\n    child.x = curX;\n    child.y = parentRect.y;\n    child.height = rowHeight;\n    child.width = Math.min(rowHeight ? Math.round(child.area / rowHeight) : 0, parentRect.x + parentRect.width - curX);\n    curX += child.width;\n  }\n  // what's z\n  child.z = true;\n  // add the remain x to the last one of row\n  child.width += parentRect.x + parentRect.width - curX;\n\n  return {\n    ...parentRect,\n    y: parentRect.y + rowHeight,\n    height: parentRect.height - rowHeight,\n  };\n};\n\nconst verticalPosition = (row: any, parentSize: number, parentRect: TreemapNode, isFlush: boolean): TreemapNode => {\n  let rowWidth = parentSize ? Math.round(row.area / parentSize) : 0;\n\n  if (isFlush || rowWidth > parentRect.width) {\n    rowWidth = parentRect.width;\n  }\n\n  let curY = parentRect.y;\n  let child;\n  for (let i = 0, len = row.length; i < len; i++) {\n    child = row[i];\n    child.x = parentRect.x;\n    child.y = curY;\n    child.width = rowWidth;\n    child.height = Math.min(rowWidth ? Math.round(child.area / rowWidth) : 0, parentRect.y + parentRect.height - curY);\n    curY += child.height;\n  }\n  if (child) {\n    child.z = false;\n    child.height += parentRect.y + parentRect.height - curY;\n  }\n\n  return {\n    ...parentRect,\n    x: parentRect.x + rowWidth,\n    width: parentRect.width - rowWidth,\n  };\n};\n\nconst position = (row: any, parentSize: number, parentRect: TreemapNode, isFlush: boolean): TreemapNode => {\n  if (parentSize === parentRect.width) {\n    return horizontalPosition(row, parentSize, parentRect, isFlush);\n  }\n\n  return verticalPosition(row, parentSize, parentRect, isFlush);\n};\n\n// Recursively arranges the specified node's children into squarified rows.\nconst squarify = (node: TreemapNode, aspectRatio: number): TreemapNode => {\n  const { children } = node;\n\n  if (children && children.length) {\n    let rect = filterRect(node) as any;\n    // maybe a bug\n    const row = [] as any;\n    let best = Infinity; // the best row score so far\n    let child, score; // the current row score\n    let size = Math.min(rect.width, rect.height); // initial orientation\n    const scaleChildren = getAreaOfChildren(children, (rect.width * rect.height) / node.value);\n    const tempChildren = scaleChildren.slice();\n\n    row.area = 0;\n\n    while (tempChildren.length > 0) {\n      // row first\n      // eslint-disable-next-line prefer-destructuring\n      row.push((child = tempChildren[0]));\n      row.area += child.area;\n\n      score = getWorstScore(row, size, aspectRatio);\n      if (score <= best) {\n        // continue with this orientation\n        tempChildren.shift();\n        best = score;\n      } else {\n        // abort, and try a different orientation\n        row.area -= row.pop().area;\n        rect = position(row, size, rect, false);\n        size = Math.min(rect.width, rect.height);\n        row.length = row.area = 0;\n        best = Infinity;\n      }\n    }\n\n    if (row.length) {\n      rect = position(row, size, rect, true);\n      row.length = row.area = 0;\n    }\n\n    return {\n      ...node,\n      children: scaleChildren.map(c => squarify(c, aspectRatio)),\n    };\n  }\n\n  return node;\n};\n\ninterface Props {\n  width?: number;\n\n  height?: number;\n\n  data?: any[];\n\n  animationId?: number;\n\n  style?: any;\n\n  aspectRatio?: number;\n\n  content?: React.ReactElement;\n\n  fill?: string;\n\n  stroke?: string;\n\n  className?: string;\n\n  nameKey?: DataKey<any>;\n\n  dataKey?: DataKey<any>;\n\n  children?: any;\n\n  // optional values flat/nest, flat show whole treemap, nest only show depth=1 node\n  type?: 'flat' | 'nest';\n\n  colorPanel?: [];\n\n  // customize nest index content\n  nestIndexContent?: React.ReactElement | ((item: any, i: number) => any);\n\n  onAnimationStart?: () => void;\n\n  onAnimationEnd?: () => void;\n\n  onMouseEnter?: (node: TreemapNode, e: any) => void;\n\n  onMouseLeave?: (node: TreemapNode, e: any) => void;\n\n  onClick?: (node: TreemapNode) => void;\n\n  isAnimationActive?: boolean;\n\n  isUpdateAnimationActive?: boolean;\n\n  animationBegin?: number;\n\n  animationDuration?: number;\n\n  animationEasing?: 'ease' | 'ease-in' | 'ease-out' | 'ease-in-out' | 'linear';\n}\n\ninterface State {\n  isTooltipActive: boolean;\n\n  isAnimationFinished: boolean;\n\n  activeNode?: TreemapNode;\n\n  formatRoot?: TreemapNode;\n\n  currentRoot?: TreemapNode;\n\n  nestIndex?: TreemapNode[];\n}\n\nconst defaultState: State = {\n  isTooltipActive: false,\n\n  isAnimationFinished: false,\n\n  activeNode: null as TreemapNode,\n\n  formatRoot: null as TreemapNode,\n\n  currentRoot: null as TreemapNode,\n\n  nestIndex: [] as TreemapNode[],\n};\n\nclass Treemap extends PureComponent<Props, State> {\n  static displayName = 'Treemap';\n\n  static defaultProps = {\n    aspectRatio: 0.5 * (1 + Math.sqrt(5)),\n    dataKey: 'value',\n    type: 'flat',\n    isAnimationActive: !Global.isSsr,\n    isUpdateAnimationActive: !Global.isSsr,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'linear',\n  };\n\n  state = {\n    ...defaultState,\n  };\n\n  componentDidMount() {\n    const { type, width, height, data, dataKey, aspectRatio } = this.props;\n    const { formatRoot, currentRoot, nestIndex } = this.computeRoot({\n      type,\n      width,\n      height,\n      data,\n      dataKey,\n      aspectRatio,\n    });\n\n    this.setState({\n      formatRoot,\n      currentRoot,\n      nestIndex,\n    });\n  }\n\n  computeRoot({\n    type,\n    width,\n    height,\n    data,\n    dataKey,\n    aspectRatio,\n  }: {\n    type: string;\n    width: number;\n    height: number;\n    data: any;\n    dataKey: DataKey<any>;\n    aspectRatio: number;\n  }): any {\n    const root = computeNode({\n      depth: 0,\n      node: { children: data, x: 0, y: 0, width, height } as TreemapNode,\n      index: 0,\n      valueKey: dataKey,\n    });\n\n    const formatRoot = squarify(root, aspectRatio);\n    const { nestIndex } = this.state;\n    if (type === 'nest') {\n      nestIndex.push(root);\n    }\n\n    return {\n      formatRoot,\n      currentRoot: root,\n      nestIndex,\n    };\n  }\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { type, width, height, data, dataKey, aspectRatio } = nextProps;\n\n    if (\n      data !== this.props.data ||\n      type !== this.props.type ||\n      width !== this.props.width ||\n      height !== this.props.height ||\n      dataKey !== this.props.dataKey ||\n      aspectRatio !== this.props.aspectRatio\n    ) {\n      const nextRoot = this.computeRoot({ type, width, height, data, dataKey, aspectRatio });\n      this.setState({\n        ...defaultState,\n        ...nextRoot,\n        nestIndex: [nextRoot.currentRoot],\n      });\n    }\n  }\n\n  handleMouseEnter(node: TreemapNode, e: any) {\n    const { onMouseEnter, children } = this.props;\n    const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n    if (tooltipItem) {\n      this.setState(\n        {\n          isTooltipActive: true,\n          activeNode: node,\n        },\n        () => {\n          if (onMouseEnter) {\n            onMouseEnter(node, e);\n          }\n        },\n      );\n    } else if (onMouseEnter) {\n      onMouseEnter(node, e);\n    }\n  }\n\n  handleMouseLeave(node: TreemapNode, e: any) {\n    const { onMouseLeave, children } = this.props;\n    const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n    if (tooltipItem) {\n      this.setState(\n        {\n          isTooltipActive: false,\n          activeNode: null,\n        },\n        () => {\n          if (onMouseLeave) {\n            onMouseLeave(node, e);\n          }\n        },\n      );\n    } else if (onMouseLeave) {\n      onMouseLeave(node, e);\n    }\n  }\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n    this.setState({ isAnimationFinished: true });\n\n    if (_.isFunction(onAnimationEnd)) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n    this.setState({ isAnimationFinished: false });\n\n    if (_.isFunction(onAnimationStart)) {\n      onAnimationStart();\n    }\n  };\n\n  handleClick(node: TreemapNode) {\n    const { onClick, type } = this.props;\n    if (type === 'nest' && node.children) {\n      const { width, height, dataKey, aspectRatio } = this.props;\n      const root = computeNode({\n        depth: 0,\n        node: { ...node, x: 0, y: 0, width, height },\n        index: 0,\n        valueKey: dataKey,\n      });\n\n      const formatRoot = squarify(root, aspectRatio);\n\n      const { nestIndex } = this.state;\n      nestIndex.push(node);\n\n      this.setState({\n        formatRoot,\n        currentRoot: root,\n        nestIndex,\n      });\n    }\n    if (onClick) {\n      onClick(node);\n    }\n  }\n\n  handleNestIndex(node: TreemapNode, i: number) {\n    let { nestIndex } = this.state;\n    const { width, height, dataKey, aspectRatio } = this.props;\n    const root = computeNode({\n      depth: 0,\n      node: { ...node, x: 0, y: 0, width, height },\n      index: 0,\n      valueKey: dataKey,\n    });\n\n    const formatRoot = squarify(root, aspectRatio);\n\n    nestIndex = nestIndex.slice(0, i + 1);\n    this.setState({\n      formatRoot,\n      currentRoot: node,\n      nestIndex,\n    });\n  }\n\n  renderItem(content: any, nodeProps: TreemapNode, isLeaf: boolean): React.ReactElement {\n    const {\n      isAnimationActive,\n      animationBegin,\n      animationDuration,\n      animationEasing,\n      isUpdateAnimationActive,\n      type,\n      animationId,\n      colorPanel,\n    } = this.props;\n    const { isAnimationFinished } = this.state;\n    const { width, height, x, y, depth } = nodeProps;\n    const translateX = parseInt(`${(Math.random() * 2 - 1) * width}`, 10);\n    let event = {} as any;\n    if (isLeaf || type === 'nest') {\n      event = {\n        onMouseEnter: this.handleMouseEnter.bind(this, nodeProps),\n        onMouseLeave: this.handleMouseLeave.bind(this, nodeProps),\n        onClick: this.handleClick.bind(this, nodeProps),\n      };\n    }\n\n    if (!isAnimationActive) {\n      return (\n        <Layer {...event}>\n          {(this.constructor as any).renderContentItem(\n            content,\n            {\n              ...nodeProps,\n              isAnimationActive: false,\n              isUpdateAnimationActive: false,\n              width,\n              height,\n              x,\n              y,\n            },\n            type,\n            colorPanel,\n          )}\n        </Layer>\n      );\n    }\n\n    return (\n      <Smooth\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        key={`treemap-${animationId}`}\n        from={{ x, y, width, height }}\n        to={{ x, y, width, height }}\n        onAnimationStart={this.handleAnimationStart}\n        onAnimationEnd={this.handleAnimationEnd}\n      >\n        {({ x: currX, y: currY, width: currWidth, height: currHeight }: TreemapNode) => (\n          <Smooth\n            from={`translate(${translateX}px, ${translateX}px)`}\n            to=\"translate(0, 0)\"\n            attributeName=\"transform\"\n            begin={animationBegin}\n            easing={animationEasing}\n            isActive={isAnimationActive}\n            duration={animationDuration}\n          >\n            <Layer {...event}>\n              {(() => {\n                // when animation Duration , only render depth=1 nodes\n                if (depth > 2 && !isAnimationFinished) {\n                  return null;\n                }\n                return (this.constructor as any).renderContentItem(\n                  content,\n                  {\n                    ...nodeProps,\n                    isAnimationActive,\n                    isUpdateAnimationActive: !isUpdateAnimationActive,\n                    width: currWidth,\n                    height: currHeight,\n                    x: currX,\n                    y: currY,\n                  },\n                  type,\n                  colorPanel,\n                );\n              })()}\n            </Layer>\n          </Smooth>\n        )}\n      </Smooth>\n    );\n  }\n\n  static renderContentItem(\n    content: any,\n    nodeProps: TreemapNode,\n    type: string,\n    colorPanel: string[],\n  ): React.ReactElement {\n    if (React.isValidElement(content)) {\n      return React.cloneElement(content, nodeProps);\n    }\n    if (_.isFunction(content)) {\n      return content(nodeProps);\n    }\n    // optimize default shape\n    const { x, y, width, height, index } = nodeProps;\n    let arrow = null;\n    if (width > 10 && height > 10 && nodeProps.children && type === 'nest') {\n      arrow = (\n        <Polygon\n          points={[\n            { x: x + 2, y: y + height / 2 },\n            { x: x + 6, y: y + height / 2 + 3 },\n            { x: x + 2, y: y + height / 2 + 6 },\n          ]}\n        />\n      );\n    }\n    let text = null;\n    const nameSize = getStringSize(nodeProps.name);\n    if (width > 20 && height > 20 && nameSize.width < width && nameSize.height < height) {\n      text = (\n        <text x={x + 8} y={y + height / 2 + 7} fontSize={14}>\n          {nodeProps.name}\n        </text>\n      );\n    }\n\n    const colors = colorPanel || COLOR_PANEL;\n    return (\n      <g>\n        <Rectangle\n          fill={nodeProps.depth < 2 ? colors[index % colors.length] : 'rgba(255,255,255,0)'}\n          stroke=\"#fff\"\n          {..._.omit(nodeProps, 'children')}\n        />\n        {arrow}\n        {text}\n      </g>\n    );\n  }\n\n  renderNode(root: TreemapNode, node: TreemapNode, i: number): React.ReactElement {\n    const { content, type } = this.props;\n    const nodeProps = { ...filterProps(this.props), ...node, root };\n    const isLeaf = !node.children || !node.children.length;\n\n    const { currentRoot } = this.state;\n    const isCurrentRootChild = (currentRoot.children || []).filter(\n      (item: TreemapNode) => item.depth === node.depth && item.name === node.name,\n    );\n\n    if (!isCurrentRootChild.length && root.depth && type === 'nest') {\n      return null;\n    }\n    return (\n      // eslint-disable-next-line react/no-array-index-key\n      <Layer key={`recharts-treemap-node-${i}`} className={`recharts-treemap-depth-${node.depth}`}>\n        {this.renderItem(content, nodeProps, isLeaf)}\n        {node.children && node.children.length\n          ? node.children.map((child: TreemapNode, index: number) => this.renderNode(node, child, index))\n          : null}\n      </Layer>\n    );\n  }\n\n  renderAllNodes(): React.ReactElement {\n    const { formatRoot } = this.state;\n\n    if (!formatRoot) {\n      return null;\n    }\n\n    return this.renderNode(formatRoot, formatRoot, 0);\n  }\n\n  renderTooltip(): React.ReactElement {\n    const { children, nameKey } = this.props;\n    const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n    if (!tooltipItem) {\n      return null;\n    }\n\n    const { width, height, dataKey } = this.props;\n    const { isTooltipActive, activeNode } = this.state;\n    const viewBox = { x: 0, y: 0, width, height };\n    const coordinate = activeNode\n      ? {\n          x: activeNode.x + activeNode.width / 2,\n          y: activeNode.y + activeNode.height / 2,\n        }\n      : null;\n    const payload =\n      isTooltipActive && activeNode\n        ? [\n            {\n              payload: activeNode,\n              name: getValueByDataKey(activeNode, nameKey, ''),\n              value: getValueByDataKey(activeNode, dataKey),\n            },\n          ]\n        : [];\n\n    return React.cloneElement(tooltipItem as React.DetailedReactHTMLElement<any, HTMLElement>, {\n      viewBox,\n      active: isTooltipActive,\n      coordinate,\n      label: '',\n      payload,\n    });\n  }\n\n  // render nest treemap\n  renderNestIndex(): React.ReactElement {\n    const { nameKey, nestIndexContent } = this.props;\n    const { nestIndex } = this.state;\n\n    return (\n      <div className=\"recharts-treemap-nest-index-wrapper\" style={{ marginTop: '8px', textAlign: 'center' }}>\n        {nestIndex.map((item: TreemapNode, i: number) => {\n          // TODO need to verify nameKey type\n          const name = _.get(item, nameKey as string, 'root');\n          let content = null;\n          if (React.isValidElement(nestIndexContent)) {\n            content = React.cloneElement(nestIndexContent, item, i);\n          }\n          if (_.isFunction(nestIndexContent)) {\n            content = nestIndexContent(item, i);\n          } else {\n            content = name;\n          }\n\n          return (\n            // eslint-disable-next-line jsx-a11y/click-events-have-key-events\n            <div\n              onClick={this.handleNestIndex.bind(this, item, i)}\n              key={`nest-index-${uniqueId()}`}\n              className=\"recharts-treemap-nest-index-box\"\n              style={{\n                cursor: 'pointer',\n                display: 'inline-block',\n                padding: '0 7px',\n                background: '#000',\n                color: '#fff',\n                marginRight: '3px',\n              }}\n            >\n              {content}\n            </div>\n          );\n        })}\n      </div>\n    );\n  }\n\n  render() {\n    if (!validateWidthHeight(this)) {\n      return null;\n    }\n\n    const { width, height, className, style, children, type, ...others } = this.props;\n    const attrs = filterProps(others);\n\n    return (\n      <div\n        className={classNames('recharts-wrapper', className)}\n        style={{ ...style, position: 'relative', cursor: 'default', width, height }}\n      >\n        <Surface {...attrs} width={width} height={type === 'nest' ? height - 30 : height}>\n          {this.renderAllNodes()}\n          {filterSvgElements(children)}\n        </Surface>\n        {this.renderTooltip()}\n        {type === 'nest' && this.renderNestIndex()}\n      </div>\n    );\n  }\n}\n\nexport default Treemap;\n","import React, { Component, cloneElement, isValidElement, createElement } from 'react';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Surface from '../container/Surface';\nimport Layer from '../container/Layer';\nimport Tooltip from '../component/Tooltip';\nimport Legend from '../component/Legend';\nimport Curve from '../shape/Curve';\nimport Cross from '../shape/Cross';\nimport Sector from '../shape/Sector';\nimport Dot from '../shape/Dot';\nimport Rectangle from '../shape/Rectangle';\n\nimport {\n  findAllByType,\n  findChildByType,\n  getDisplayName,\n  parseChildIndex,\n  validateWidthHeight,\n  isChildrenEqual,\n  renderByOrder,\n  getReactEventByType,\n} from '../util/ReactUtils';\n\nimport CartesianAxis from '../cartesian/CartesianAxis';\nimport Brush from '../cartesian/Brush';\nimport { getOffset, calculateChartCoordinate } from '../util/DOMUtils';\nimport { getAnyElementOfObject, hasDuplicate, uniqueId, isNumber, findEntryInArray } from '../util/DataUtils';\nimport {\n  calculateActiveTickIndex,\n  getMainColorOfGraphicItem,\n  getBarSizeList,\n  getBarPosition,\n  appendOffsetOfLegend,\n  getLegendProps,\n  combineEventHandlers,\n  getTicksOfAxis,\n  getCoordinatesOfGrid,\n  getStackedDataOfItem,\n  parseErrorBarsOfAxis,\n  getBandSizeOfAxis,\n  getStackGroupsByAxisId,\n  getValueByDataKey,\n  isCategoricalAxis,\n  getDomainOfItemsWithSameAxis,\n  getDomainOfStackGroups,\n  getDomainOfDataByKey,\n  parseSpecifiedDomain,\n  parseDomainOfCategoryAxis,\n} from '../util/ChartUtils';\nimport { detectReferenceElementsDomain } from '../util/DetectReferenceElementsDomain';\nimport { inRangeOfSector, polarToCartesian } from '../util/PolarUtils';\nimport { shallowEqual } from '../util/ShallowEqual';\nimport { eventCenter, SYNC_EVENT } from '../util/Events';\nimport {\n  LayoutType,\n  CategoricalChartOptions,\n  Margin,\n  ViewBox,\n  ChartOffset,\n  BaseAxisProps,\n  Coordinate,\n  ChartCoordinate,\n  TickItem,\n  filterProps,\n  adaptEventHandlers,\n} from '../util/types';\n\nconst ORIENT_MAP = {\n  xAxis: ['bottom', 'top'],\n  yAxis: ['left', 'right'],\n};\n\nconst originCoordinate: Coordinate = { x: 0, y: 0 };\n\nexport interface CategoricalChartState {\n  chartX?: number;\n\n  chartY?: number;\n\n  dataStartIndex?: number;\n\n  dataEndIndex?: number;\n\n  activeTooltipIndex?: number;\n\n  isTooltipActive?: boolean;\n\n  updateId?: number;\n\n  xAxisMap?: {\n    [k: string]: BaseAxisProps;\n  };\n\n  yAxisMap?: {\n    [k: string]: BaseAxisProps;\n  };\n\n  orderedTooltipTicks?: any;\n\n  tooltipAxis?: BaseAxisProps;\n\n  tooltipTicks?: TickItem[];\n\n  graphicalItems?: any;\n\n  activeCoordinate?: ChartCoordinate;\n\n  offset?: ChartOffset;\n\n  angleAxisMap?: any;\n\n  radiusAxisMap?: any;\n\n  formatedGraphicalItems?: any;\n\n  /** active tooltip payload */\n  activePayload?: any[];\n\n  tooltipAxisBandSize?: number;\n\n  /** active item */\n  activeItem?: any;\n\n  /** Active label of data */\n  activeLabel?: string;\n\n  xValue?: number;\n\n  yValue?: number;\n}\n\nexport interface CategoricalChartProps {\n  syncId?: number | string;\n  compact?: boolean;\n  width?: number;\n  height?: number;\n  data?: any[];\n  layout?: LayoutType;\n  stackOffset?: 'sign' | 'expand' | 'none' | 'wiggle' | 'silhouette';\n  throttleDelay?: number;\n  margin?: Margin;\n  barCategoryGap?: number | string;\n  barGap?: number | string;\n  barSize?: number | string;\n  maxBarSize?: number;\n  style?: any;\n  className?: string;\n  children?: any;\n  defaultShowTooltip?: boolean;\n  onClick?: any;\n  onMouseLeave?: any;\n  onMouseEnter?: any;\n  onMouseMove?: any;\n  onMouseDown?: any;\n  onMouseUp?: any;\n  reverseStackOrder?: boolean;\n  id?: string;\n\n  startAngle?: number;\n  endAngle?: number;\n  cx?: number | string;\n  cy?: number | string;\n  innerRadius?: number | string;\n  outerRadius?: number | string;\n}\n\nconst generateCategoricalChart = ({\n  chartName,\n  GraphicalChild,\n  eventType = 'axis',\n  axisComponents,\n  legendContent,\n  formatAxisMap,\n  defaultProps,\n}: CategoricalChartOptions) =>\n  class CategoricalChartWrapper extends Component<CategoricalChartProps, CategoricalChartState> {\n    static displayName = chartName;\n\n    uniqueChartId: any;\n\n    clipPathId: any;\n\n    legendInstance: any;\n\n    // todo join specific chart propTypes\n    static defaultProps: CategoricalChartProps = {\n      layout: 'horizontal',\n      stackOffset: 'none',\n      barCategoryGap: '10%',\n      barGap: 4,\n      margin: { top: 5, right: 5, bottom: 5, left: 5 } as Margin,\n      reverseStackOrder: false,\n      ...defaultProps,\n    };\n\n    /**\n     * Returns default, reset state for the categorical chart.\n     * @param {Object} props Props object to use when creating the default state\n     * @return {Object} Whole new state\n     */\n    static createDefaultState = (props: CategoricalChartProps): CategoricalChartState => {\n      const { children, defaultShowTooltip } = props;\n      const brushItem = findChildByType(children, Brush.displayName);\n      const startIndex = (brushItem && brushItem.props && brushItem.props.startIndex) || 0;\n      const endIndex =\n        (brushItem && brushItem.props && brushItem.props.endIndex) || (props.data && props.data.length - 1) || 0;\n      return {\n        chartX: 0,\n        chartY: 0,\n        dataStartIndex: startIndex,\n        dataEndIndex: endIndex,\n        activeTooltipIndex: -1,\n        isTooltipActive: !_.isNil(defaultShowTooltip) ? defaultShowTooltip : false,\n      };\n    };\n\n    static hasBar = (graphicalItems: any[]): any[] | boolean => {\n      if (!graphicalItems || !graphicalItems.length) {\n        return false;\n      }\n\n      return graphicalItems.some((item: any) => {\n        const name = getDisplayName(item && item.type);\n\n        return name && name.indexOf('Bar') >= 0;\n      });\n    };\n\n    static getDisplayedData = (\n      props: CategoricalChartProps,\n      { graphicalItems, dataStartIndex, dataEndIndex }: any,\n      item?: any,\n    ): any[] => {\n      const itemsData = (graphicalItems || []).reduce((result: any, child: any) => {\n        const itemData = child.props.data;\n\n        if (itemData && itemData.length) {\n          return [...result, ...itemData];\n        }\n\n        return result;\n      }, []);\n      if (itemsData && itemsData.length > 0) {\n        return itemsData;\n      }\n\n      if (item && item.props && item.props.data && item.props.data.length > 0) {\n        return item.props.data;\n      }\n\n      const { data } = props;\n\n      if (data && data.length && isNumber(dataStartIndex) && isNumber(dataEndIndex)) {\n        return data.slice(dataStartIndex, dataEndIndex + 1);\n      }\n\n      return [];\n    };\n\n    container?: any;\n\n    constructor(props: CategoricalChartProps) {\n      super(props);\n\n      const defaultState = CategoricalChartWrapper.createDefaultState(props);\n      const updateId = 0;\n      this.state = {\n        ...defaultState,\n        updateId: 0,\n        ...this.updateStateOfAxisMapsOffsetAndStackGroups({ props, ...defaultState, updateId }),\n      };\n\n      this.uniqueChartId = _.isNil(props.id) ? uniqueId('recharts') : props.id;\n      this.clipPathId = `${this.uniqueChartId}-clip`;\n\n      if (props.throttleDelay) {\n        this.triggeredAfterMouseMove = _.throttle(this.triggeredAfterMouseMove, props.throttleDelay);\n      }\n    }\n\n    /* eslint-disable  react/no-did-mount-set-state */\n    componentDidMount() {\n      if (!_.isNil(this.props.syncId)) {\n        this.addListener();\n      }\n    }\n\n    // eslint-disable-next-line camelcase\n    UNSAFE_componentWillReceiveProps(nextProps: CategoricalChartProps) {\n      const { data, children, width, height, layout, stackOffset, margin } = this.props;\n      const { updateId, isTooltipActive, activeItem, activeLabel, activePayload, activeCoordinate } = this.state;\n\n      if (\n        nextProps.data !== data ||\n        nextProps.width !== width ||\n        nextProps.height !== height ||\n        nextProps.layout !== layout ||\n        nextProps.stackOffset !== stackOffset ||\n        !shallowEqual(nextProps.margin, margin)\n      ) {\n        const defaultState = CategoricalChartWrapper.createDefaultState(nextProps);\n        this.setState({\n          ...defaultState,\n          updateId: updateId + 1,\n          ...this.updateStateOfAxisMapsOffsetAndStackGroups({\n            props: nextProps,\n            ...defaultState,\n            updateId: updateId + 1,\n          }),\n        });\n      } else if (!isChildrenEqual(nextProps.children, children)) {\n        // update configuration in chilren\n        const hasGlobalData = !_.isNil(nextProps.data);\n        const newUpdateId = hasGlobalData ? updateId : updateId + 1;\n\n        this.setState(prevState => ({\n          updateId: newUpdateId,\n          ...this.updateStateOfAxisMapsOffsetAndStackGroups({\n            props: nextProps,\n            ...prevState,\n            updateId: newUpdateId,\n          }),\n        }));\n      }\n      // add syncId\n      if (_.isNil(this.props.syncId) && !_.isNil(nextProps.syncId)) {\n        this.addListener();\n      }\n      // remove syncId\n      if (!_.isNil(this.props.syncId) && _.isNil(nextProps.syncId)) {\n        this.removeListener();\n      }\n    }\n\n    componentWillUnmount() {\n      if (!_.isNil(this.props.syncId)) {\n        this.removeListener();\n      }\n      this.cancelThrottledTriggerAfterMouseMove();\n    }\n\n    cancelThrottledTriggerAfterMouseMove() {\n      if (typeof (this.triggeredAfterMouseMove as any).cancel === 'function') {\n        (this.triggeredAfterMouseMove as any).cancel();\n      }\n    }\n\n    /**\n     * Get the configuration of all x-axis or y-axis\n     * @param  {Object} props          Latest props\n     * @param  {String} axisType       The type of axis\n     * @param  {Array}  graphicalItems The instances of item\n     * @param  {Object} stackGroups    The items grouped by axisId and stackId\n     * @param {Number} dataStartIndex  The start index of the data series when a brush is applied\n     * @param {Number} dataEndIndex    The end index of the data series when a brush is applied\n     * @return {Object}          Configuration\n     */\n    getAxisMap(\n      props: CategoricalChartProps,\n      { axisType = 'xAxis', AxisComp, graphicalItems, stackGroups, dataStartIndex, dataEndIndex }: any,\n    ) {\n      const { children } = props;\n      const axisIdKey = `${axisType}Id`;\n      // Get all the instance of Axis\n      const axes = findAllByType(children, AxisComp);\n\n      let axisMap = {};\n\n      if (axes && axes.length) {\n        axisMap = this.getAxisMapByAxes(props, {\n          axes,\n          graphicalItems,\n          axisType,\n          axisIdKey,\n          stackGroups,\n          dataStartIndex,\n          dataEndIndex,\n        });\n      } else if (graphicalItems && graphicalItems.length) {\n        axisMap = this.getAxisMapByItems(props, {\n          Axis: AxisComp,\n          graphicalItems,\n          axisType,\n          axisIdKey,\n          stackGroups,\n          dataStartIndex,\n          dataEndIndex,\n        });\n      }\n\n      return axisMap;\n    }\n\n    /**\n     * Get the configuration of axis by the options of axis instance\n     * @param  {Object} props         Latest props\n     * @param {Array}  axes           The instance of axes\n     * @param  {Array} graphicalItems The instances of item\n     * @param  {String} axisType      The type of axis, xAxis - x-axis, yAxis - y-axis\n     * @param  {String} axisIdKey     The unique id of an axis\n     * @param  {Object} stackGroups   The items grouped by axisId and stackId\n     * @param {Number} dataStartIndex The start index of the data series when a brush is applied\n     * @param {Number} dataEndIndex   The end index of the data series when a brush is applied\n     * @return {Object}      Configuration\n     */\n    getAxisMapByAxes = (\n      props: CategoricalChartProps,\n      { axes, graphicalItems, axisType, axisIdKey, stackGroups, dataStartIndex, dataEndIndex }: any,\n    ) => {\n      const { layout, children, stackOffset } = props;\n      const isCategorical = isCategoricalAxis(layout, axisType);\n\n      // Eliminate duplicated axes\n      const axisMap = axes.reduce((result: any, child: any) => {\n        const { type, dataKey, allowDataOverflow, allowDuplicatedCategory, scale, ticks } = child.props;\n        const axisId = child.props[axisIdKey];\n        const displayedData = CategoricalChartWrapper.getDisplayedData(props, {\n          graphicalItems: graphicalItems.filter((item: any) => item.props[axisIdKey] === axisId),\n          dataStartIndex,\n          dataEndIndex,\n        });\n        const len = displayedData.length;\n\n        if (!result[axisId]) {\n          let domain, duplicateDomain, categoricalDomain;\n\n          if (dataKey) {\n            // has dataKey in <Axis />\n            domain = getDomainOfDataByKey(displayedData, dataKey, type);\n\n            if (type === 'category' && isCategorical) {\n              // the field type is category data and this axis is catrgorical axis\n              const duplicate = hasDuplicate(domain);\n\n              if (allowDuplicatedCategory && duplicate) {\n                duplicateDomain = domain;\n                // When category axis has duplicated text, serial numbers are used to generate scale\n                domain = _.range(0, len);\n              } else if (!allowDuplicatedCategory) {\n                // remove duplicated category\n                domain = parseDomainOfCategoryAxis(child.props.domain, domain, child).reduce(\n                  (finalDomain: any, entry: any) =>\n                    finalDomain.indexOf(entry) >= 0 ? finalDomain : [...finalDomain, entry],\n                  [],\n                );\n              }\n            } else if (type === 'category') {\n              // the field type is category data and this axis is numerical axis\n              if (!allowDuplicatedCategory) {\n                domain = parseDomainOfCategoryAxis(child.props.domain, domain, child).reduce(\n                  (finalDomain: any, entry: any) =>\n                    finalDomain.indexOf(entry) >= 0 || entry === '' || _.isNil(entry)\n                      ? finalDomain\n                      : [...finalDomain, entry],\n                  [],\n                );\n              } else {\n                // eliminate undefined or null or empty string\n                domain = domain.filter((entry: any) => entry !== '' && !_.isNil(entry));\n              }\n            } else if (type === 'number') {\n              // the field type is numerical\n              const errorBarsDomain = parseErrorBarsOfAxis(\n                displayedData,\n                graphicalItems.filter((item: any) => item.props[axisIdKey] === axisId && !item.props.hide),\n                dataKey,\n                axisType,\n              );\n\n              if (errorBarsDomain) {\n                domain = errorBarsDomain;\n              }\n            }\n\n            if (isCategorical && (type === 'number' || scale !== 'auto')) {\n              categoricalDomain = getDomainOfDataByKey(displayedData, dataKey, 'category');\n            }\n          } else if (isCategorical) {\n            // the axis is a categorical axis\n            domain = _.range(0, len);\n          } else if (stackGroups && stackGroups[axisId] && stackGroups[axisId].hasStack && type === 'number') {\n            // when stackOffset is 'expand', the domain may be calculated as [0, 1.000000000002]\n            domain =\n              stackOffset === 'expand'\n                ? [0, 1]\n                : getDomainOfStackGroups(stackGroups[axisId].stackGroups, dataStartIndex, dataEndIndex);\n          } else {\n            domain = getDomainOfItemsWithSameAxis(\n              displayedData,\n              graphicalItems.filter((item: any) => item.props[axisIdKey] === axisId && !item.props.hide),\n              type,\n              true,\n            );\n          }\n\n          if (type === 'number') {\n            // To detect wether there is any reference lines whose props alwaysShow is true\n            domain = detectReferenceElementsDomain(children, domain, axisId, axisType, ticks);\n\n            if (child.props.domain) {\n              domain = parseSpecifiedDomain(child.props.domain, domain, allowDataOverflow);\n            }\n          } else if (type === 'category' && child.props.domain) {\n            const axisDomain = child.props.domain;\n            const isDomainValidate = domain.every((entry: string | number) => axisDomain.indexOf(entry) >= 0);\n\n            if (isDomainValidate) {\n              domain = axisDomain;\n            }\n          }\n\n          return {\n            ...result,\n            [axisId]: {\n              ...child.props,\n              axisType,\n              domain,\n              categoricalDomain,\n              duplicateDomain,\n              originalDomain: child.props.domain,\n              isCategorical,\n              layout,\n            },\n          };\n        }\n\n        return result;\n      }, {});\n      return axisMap;\n    };\n\n    /**\n     * Get the configuration of axis by the options of item,\n     * this kind of axis does not display in chart\n     * @param  {Object} props         Latest props\n     * @param  {Array} graphicalItems The instances of item\n     * @param  {ReactElement} Axis    Axis Component\n     * @param  {String} axisType      The type of axis, xAxis - x-axis, yAxis - y-axis\n     * @param  {String} axisIdKey     The unique id of an axis\n     * @param  {Object} stackGroups   The items grouped by axisId and stackId\n     * @param {Number} dataStartIndex The start index of the data series when a brush is applied\n     * @param {Number} dataEndIndex   The end index of the data series when a brush is applied\n     * @return {Object}               Configuration\n     */\n    getAxisMapByItems = (\n      props: CategoricalChartProps,\n      { graphicalItems, Axis, axisType, axisIdKey, stackGroups, dataStartIndex, dataEndIndex }: any,\n    ) => {\n      const { layout, children } = props;\n      const displayedData = CategoricalChartWrapper.getDisplayedData(props, {\n        graphicalItems,\n        dataStartIndex,\n        dataEndIndex,\n      });\n      const len = displayedData.length;\n      const isCategorical = isCategoricalAxis(layout, axisType);\n      let index = -1;\n\n      // The default type of x-axis is category axis,\n      // The default contents of x-axis is the serial numbers of data\n      // The default type of y-axis is number axis\n      // The default contents of y-axis is the domain of data\n      const axisMap = graphicalItems.reduce((result: any, child: any) => {\n        const axisId = child.props[axisIdKey];\n\n        if (!result[axisId]) {\n          index++;\n          let domain;\n\n          if (isCategorical) {\n            domain = _.range(0, len);\n          } else if (stackGroups && stackGroups[axisId] && stackGroups[axisId].hasStack) {\n            domain = getDomainOfStackGroups(stackGroups[axisId].stackGroups, dataStartIndex, dataEndIndex);\n            domain = detectReferenceElementsDomain(children, domain, axisId, axisType);\n          } else {\n            domain = parseSpecifiedDomain(\n              Axis.defaultProps.domain,\n              getDomainOfItemsWithSameAxis(\n                displayedData,\n                graphicalItems.filter((item: any) => item.props[axisIdKey] === axisId && !item.props.hide),\n                'number',\n              ),\n              Axis.defaultProps.allowDataOverflow,\n            );\n            domain = detectReferenceElementsDomain(children, domain, axisId, axisType);\n          }\n\n          return {\n            ...result,\n            [axisId]: {\n              axisType,\n              ...Axis.defaultProps,\n              hide: true,\n              orientation: _.get(ORIENT_MAP, `${axisType}.${index % 2}`, null),\n              domain,\n              originalDomain: Axis.defaultProps.domain,\n              isCategorical,\n              layout,\n              // specify scale when no Axis\n              // scale: isCategorical ? 'band' : 'linear',\n            },\n          };\n        }\n\n        return result;\n      }, {});\n\n      return axisMap;\n    };\n\n    getActiveCoordinate(tooltipTicks: TickItem[], activeIndex: any, rangeObj: any): ChartCoordinate {\n      const { layout } = this.props;\n      const entry = tooltipTicks.find((tick: any) => tick && tick.index === activeIndex);\n\n      if (entry) {\n        if (layout === 'horizontal') {\n          return { x: entry.coordinate, y: rangeObj.y };\n        }\n        if (layout === 'vertical') {\n          return { x: rangeObj.x, y: entry.coordinate };\n        }\n        if (layout === 'centric') {\n          const angle = entry.coordinate;\n          const { radius } = rangeObj;\n\n          return {\n            ...rangeObj,\n            ...polarToCartesian(rangeObj.cx, rangeObj.cy, radius, angle),\n            angle,\n            radius,\n          };\n        }\n\n        const radius = entry.coordinate;\n        const { angle } = rangeObj;\n\n        return {\n          ...rangeObj,\n          ...polarToCartesian(rangeObj.cx, rangeObj.cy, radius, angle),\n          angle,\n          radius,\n        };\n      }\n\n      return originCoordinate;\n    }\n\n    /**\n     * Get the information of mouse in chart, return null when the mouse is not in the chart\n     * @param  {Object} event    The event object\n     * @return {Object}          Mouse data\n     */\n    getMouseInfo(event: any) {\n      if (!this.container) {\n        return null;\n      }\n\n      const containerOffset = getOffset(this.container);\n      const e = calculateChartCoordinate(event, containerOffset);\n      const rangeObj = this.inRange(e.chartX, e.chartY);\n      if (!rangeObj) {\n        return null;\n      }\n\n      const { xAxisMap, yAxisMap } = this.state;\n\n      if (eventType !== 'axis' && xAxisMap && yAxisMap) {\n        const xScale = getAnyElementOfObject(xAxisMap).scale;\n        const yScale = getAnyElementOfObject(yAxisMap).scale;\n        const xValue = xScale && xScale.invert ? xScale.invert(e.chartX) : null;\n        const yValue = yScale && yScale.invert ? yScale.invert(e.chartY) : null;\n\n        return { ...e, xValue, yValue };\n      }\n\n      const { orderedTooltipTicks: ticks, tooltipAxis: axis, tooltipTicks } = this.state;\n      const pos = this.calculateTooltipPos(rangeObj);\n      const activeIndex = calculateActiveTickIndex(pos, ticks, tooltipTicks, axis);\n\n      if (activeIndex >= 0 && tooltipTicks) {\n        const activeLabel = tooltipTicks[activeIndex] && tooltipTicks[activeIndex].value;\n        const activePayload = this.getTooltipContent(activeIndex, activeLabel);\n        const activeCoordinate = this.getActiveCoordinate(ticks, activeIndex, rangeObj);\n\n        return {\n          ...e,\n          activeTooltipIndex: activeIndex,\n          activeLabel,\n          activePayload,\n          activeCoordinate,\n        };\n      }\n\n      return null;\n    }\n\n    /**\n     * Get the content to be displayed in the tooltip\n     * @param  {Number} activeIndex    Active index of data\n     * @param  {String} activeLabel    Active label of data\n     * @return {Array}                 The content of tooltip\n     */\n    getTooltipContent(activeIndex: number, activeLabel?: string): any[] {\n      const { graphicalItems, tooltipAxis } = this.state;\n      const displayedData = CategoricalChartWrapper.getDisplayedData(this.props, this.state);\n\n      if (activeIndex < 0 || !graphicalItems || !graphicalItems.length || activeIndex >= displayedData.length) {\n        return null;\n      }\n      // get data by activeIndex when the axis don't allow duplicated category\n      return graphicalItems.reduce((result: any, child: any) => {\n        const { hide } = child.props;\n\n        if (hide) {\n          return result;\n        }\n\n        const { dataKey, name, unit, formatter, data, tooltipType } = child.props;\n        let payload;\n\n        if (tooltipAxis.dataKey && !tooltipAxis.allowDuplicatedCategory) {\n          // graphic child has data props\n          payload = findEntryInArray(data || displayedData, tooltipAxis.dataKey, activeLabel);\n        } else {\n          payload = (data && data[activeIndex]) || displayedData[activeIndex];\n        }\n\n        if (!payload) {\n          return result;\n        }\n\n        return [\n          ...result,\n          {\n            ...filterProps(child),\n            dataKey,\n            unit,\n            formatter,\n            name: name || dataKey,\n            color: getMainColorOfGraphicItem(child),\n            value: getValueByDataKey(payload, dataKey),\n            type: tooltipType,\n            payload,\n          },\n        ];\n      }, []);\n    }\n\n    getFormatItems(props: CategoricalChartProps, currentState: any): any[] {\n      const { graphicalItems, stackGroups, offset, updateId, dataStartIndex, dataEndIndex } = currentState;\n      const { barSize, layout, barGap, barCategoryGap, maxBarSize: globalMaxBarSize } = props;\n      const { numericAxisName, cateAxisName } = CategoricalChartWrapper.getAxisNameByLayout(layout);\n      const hasBar = CategoricalChartWrapper.hasBar(graphicalItems);\n      const sizeList = hasBar && getBarSizeList({ barSize, stackGroups });\n      const formatedItems = [] as any[];\n      const tooltipItem = findChildByType(props.children, Tooltip.displayName);\n      const isTooltipTriggerByClick = tooltipItem && tooltipItem.props.trigger === 'click';\n\n      graphicalItems.forEach((item: any, index: number) => {\n        const displayedData = CategoricalChartWrapper.getDisplayedData(props, { dataStartIndex, dataEndIndex }, item);\n        const { dataKey, maxBarSize: childMaxBarSize } = item.props;\n        const numericAxisId = item.props[`${numericAxisName}Id`];\n        const cateAxisId = item.props[`${cateAxisName}Id`];\n        const axisObj = axisComponents.reduce((result: any, entry: any) => {\n          const axisMap = currentState[`${entry.axisType}Map`];\n          const id = item.props[`${entry.axisType}Id`];\n          const axis = axisMap && axisMap[id];\n\n          return {\n            ...result,\n            [entry.axisType]: axis,\n            [`${entry.axisType}Ticks`]: getTicksOfAxis(axis),\n          };\n        }, {});\n        const cateAxis = axisObj[cateAxisName];\n        const cateTicks = axisObj[`${cateAxisName}Ticks`];\n        const stackedData =\n          stackGroups &&\n          stackGroups[numericAxisId] &&\n          stackGroups[numericAxisId].hasStack &&\n          getStackedDataOfItem(item, stackGroups[numericAxisId].stackGroups);\n        const itemIsBar = getDisplayName(item.type).indexOf('Bar') >= 0;\n        const bandSize = getBandSizeOfAxis(cateAxis, cateTicks);\n        let barPosition = [];\n\n        if (itemIsBar) {\n          const barBandSize = getBandSizeOfAxis(cateAxis, cateTicks, true);\n          // 如果是bar，计算bar的位置\n          const maxBarSize = _.isNil(childMaxBarSize) ? globalMaxBarSize : childMaxBarSize;\n          barPosition = getBarPosition({\n            barGap,\n            barCategoryGap,\n            bandSize: barBandSize !== bandSize ? barBandSize : bandSize,\n            sizeList: sizeList[cateAxisId],\n            maxBarSize,\n          });\n\n          if (barBandSize !== bandSize) {\n            barPosition = barPosition.map((pos: { item: any; position: { offset: number; size: number } }) => ({\n              ...pos,\n              position: { ...pos.position, offset: pos.position.offset - barBandSize / 2 },\n            }));\n          }\n        }\n        const componsedFn = item && item.type && item.type.getComposedData;\n\n        if (componsedFn) {\n          const itemEvents = isTooltipTriggerByClick\n            ? {\n                onItemClick: combineEventHandlers(this.handleItemMouseEnter, null, item.props.onCLick),\n              }\n            : {\n                onItemMouseLeave: combineEventHandlers(this.handleItemMouseLeave, null, item.props.onMouseLeave),\n                onItemMouseEnter: combineEventHandlers(this.handleItemMouseEnter, null, item.props.onMouseEnter),\n              };\n          formatedItems.push({\n            props: {\n              ...componsedFn({\n                ...axisObj,\n                displayedData,\n                props,\n                dataKey,\n                item,\n                bandSize,\n                barPosition,\n                offset,\n                stackedData,\n                layout,\n                dataStartIndex,\n                dataEndIndex,\n                ...itemEvents,\n              }),\n              key: item.key || `item-${index}`,\n              [numericAxisName]: axisObj[numericAxisName],\n              [cateAxisName]: axisObj[cateAxisName],\n              animationId: updateId,\n            },\n            childIndex: parseChildIndex(item, props.children),\n            item,\n          });\n        }\n      });\n\n      return formatedItems;\n    }\n\n    getCursorRectangle(): any {\n      const { layout } = this.props;\n      const { activeCoordinate, offset, tooltipAxisBandSize } = this.state;\n      const halfSize = tooltipAxisBandSize / 2;\n\n      return {\n        stroke: 'none',\n        fill: '#ccc',\n        x: layout === 'horizontal' ? activeCoordinate.x - halfSize : offset.left + 0.5,\n        y: layout === 'horizontal' ? offset.top + 0.5 : activeCoordinate.y - halfSize,\n        width: layout === 'horizontal' ? tooltipAxisBandSize : offset.width - 1,\n        height: layout === 'horizontal' ? offset.height - 1 : tooltipAxisBandSize,\n      };\n    }\n\n    getCursorPoints(): any {\n      const { layout } = this.props;\n      const { activeCoordinate, offset } = this.state;\n      let x1, y1, x2, y2;\n\n      if (layout === 'horizontal') {\n        x1 = activeCoordinate.x;\n        x2 = x1;\n        y1 = offset.top;\n        y2 = offset.top + offset.height;\n      } else if (layout === 'vertical') {\n        y1 = activeCoordinate.y;\n        y2 = y1;\n        x1 = offset.left;\n        x2 = offset.left + offset.width;\n      } else if (!_.isNil(activeCoordinate.cx) || !_.isNil(activeCoordinate.cy)) {\n        if (layout === 'centric') {\n          const { cx, cy, innerRadius, outerRadius, angle } = activeCoordinate;\n          const innerPoint = polarToCartesian(cx, cy, innerRadius, angle);\n          const outerPoint = polarToCartesian(cx, cy, outerRadius, angle);\n          x1 = innerPoint.x;\n          y1 = innerPoint.y;\n          x2 = outerPoint.x;\n          y2 = outerPoint.y;\n        } else {\n          const { cx, cy, radius, startAngle, endAngle } = activeCoordinate;\n          const startPoint = polarToCartesian(cx, cy, radius, startAngle);\n          const endPoint = polarToCartesian(cx, cy, radius, endAngle);\n\n          return {\n            points: [startPoint, endPoint],\n            cx,\n            cy,\n            radius,\n            startAngle,\n            endAngle,\n          };\n        }\n      }\n\n      return [\n        { x: x1, y: y1 },\n        { x: x2, y: y2 },\n      ];\n    }\n\n    static getAxisNameByLayout(layout: LayoutType) {\n      if (layout === 'horizontal') {\n        return { numericAxisName: 'yAxis', cateAxisName: 'xAxis' };\n      }\n      if (layout === 'vertical') {\n        return { numericAxisName: 'xAxis', cateAxisName: 'yAxis' };\n      }\n      if (layout === 'centric') {\n        return { numericAxisName: 'radiusAxis', cateAxisName: 'angleAxis' };\n      }\n\n      return { numericAxisName: 'angleAxis', cateAxisName: 'radiusAxis' };\n    }\n\n    calculateTooltipPos(rangeObj: any): any {\n      const { layout } = this.props;\n\n      if (layout === 'horizontal') {\n        return rangeObj.x;\n      }\n      if (layout === 'vertical') {\n        return rangeObj.y;\n      }\n      if (layout === 'centric') {\n        return rangeObj.angle;\n      }\n\n      return rangeObj.radius;\n    }\n\n    inRange(x: number, y: number): any {\n      const { layout } = this.props;\n\n      if (layout === 'horizontal' || layout === 'vertical') {\n        const { offset } = this.state;\n        const isInRange =\n          x >= offset.left && x <= offset.left + offset.width && y >= offset.top && y <= offset.top + offset.height;\n\n        return isInRange ? { x, y } : null;\n      }\n\n      const { angleAxisMap, radiusAxisMap } = this.state;\n\n      if (angleAxisMap && radiusAxisMap) {\n        const angleAxis = getAnyElementOfObject(angleAxisMap);\n\n        return inRangeOfSector({ x, y }, angleAxis);\n      }\n\n      return null;\n    }\n\n    parseEventsOfWrapper() {\n      const { children } = this.props;\n      const tooltipItem = findChildByType(children, Tooltip.displayName);\n      let tooltipEvents: any = {};\n\n      if (tooltipItem && eventType === 'axis') {\n        if (tooltipItem.props.trigger === 'click') {\n          tooltipEvents = {\n            onClick: this.handleClick,\n          };\n        } else {\n          tooltipEvents = {\n            onMouseEnter: this.handleMouseEnter,\n            onMouseMove: this.handleMouseMove,\n            onMouseLeave: this.handleMouseLeave,\n            onTouchMove: this.handleTouchMove,\n            onTouchStart: this.handleTouchStart,\n            onTouchEnd: this.handleTouchEnd,\n          };\n        }\n      }\n      const outerEvents = adaptEventHandlers(this.props, this.handleOuterEvent);\n\n      return {\n        ...outerEvents,\n        ...tooltipEvents,\n      };\n    }\n\n    /**\n     * The AxisMaps are expensive to render on large data sets\n     * so provide the ability to store them in state and only update them when necessary\n     * they are dependent upon the start and end index of\n     * the brush so it's important that this method is called _after_\n     * the state is updated with any new start/end indices\n     *\n     * @param {Object} props          The props object to be used for updating the axismaps\n     * @param {Number} dataStartIndex The start index of the data series when a brush is applied\n     * @param {Number} dataEndIndex   The end index of the data series when a brush is applied\n     * @param {Number} updateId       The update id\n     * @return {Object} state New state to set\n     */\n    updateStateOfAxisMapsOffsetAndStackGroups({ props, dataStartIndex, dataEndIndex, updateId }: any): any {\n      if (!validateWidthHeight({ props })) {\n        return null;\n      }\n\n      const { children, layout, stackOffset, data, reverseStackOrder } = props;\n      const { numericAxisName, cateAxisName } = CategoricalChartWrapper.getAxisNameByLayout(layout);\n      const graphicalItems = findAllByType(children, GraphicalChild);\n      const stackGroups = getStackGroupsByAxisId(\n        data,\n        graphicalItems,\n        `${numericAxisName}Id`,\n        `${cateAxisName}Id`,\n        stackOffset,\n        reverseStackOrder,\n      );\n      const axisObj = axisComponents.reduce((result: any, entry: any) => {\n        const name = `${entry.axisType}Map`;\n\n        return {\n          ...result,\n          [name]: this.getAxisMap(props, {\n            ...entry,\n            graphicalItems,\n            stackGroups: entry.axisType === numericAxisName && stackGroups,\n            dataStartIndex,\n            dataEndIndex,\n          }),\n        };\n      }, {});\n\n      const offset = this.calculateOffset({ ...axisObj, props, graphicalItems });\n\n      Object.keys(axisObj).forEach(key => {\n        axisObj[key] = formatAxisMap(props, axisObj[key], offset, key.replace('Map', ''), chartName);\n      });\n      const cateAxisMap = axisObj[`${cateAxisName}Map`];\n      const ticksObj = this.tooltipTicksGenerator(cateAxisMap);\n\n      const formatedGraphicalItems = this.getFormatItems(props, {\n        ...axisObj,\n        dataStartIndex,\n        dataEndIndex,\n        updateId,\n        graphicalItems,\n        stackGroups,\n        offset,\n      });\n\n      return {\n        formatedGraphicalItems,\n        graphicalItems,\n        offset,\n        stackGroups,\n        ...ticksObj,\n        ...axisObj,\n      };\n    }\n\n    /* eslint-disable  no-underscore-dangle */\n    addListener() {\n      eventCenter.on(SYNC_EVENT, this.handleReceiveSyncEvent);\n\n      if (eventCenter.setMaxListeners && eventCenter._maxListeners) {\n        eventCenter.setMaxListeners(eventCenter._maxListeners + 1);\n      }\n    }\n\n    removeListener() {\n      eventCenter.removeListener(SYNC_EVENT, this.handleReceiveSyncEvent);\n\n      if (eventCenter.setMaxListeners && eventCenter._maxListeners) {\n        eventCenter.setMaxListeners(eventCenter._maxListeners - 1);\n      }\n    }\n\n    /**\n     * Calculate the offset of main part in the svg element\n     * @param  {Object} props          Latest props\n     * @param  {Array}  graphicalItems The instances of item\n     * @param  {Object} xAxisMap       The configuration of x-axis\n     * @param  {Object} yAxisMap       The configuration of y-axis\n     * @return {Object} The offset of main part in the svg element\n     */\n    calculateOffset({ props, graphicalItems, xAxisMap = {} as BaseAxisProps, yAxisMap = {} as BaseAxisProps }: any) {\n      const { width, height, children } = props;\n      const margin = props.margin || {};\n      const brushItem = findChildByType(children, Brush.displayName);\n      const legendItem = findChildByType(children, Legend.displayName);\n\n      const offsetH = Object.keys(yAxisMap).reduce(\n        (result: any, id: any) => {\n          const entry = yAxisMap[id];\n          const { orientation } = entry;\n\n          if (!entry.mirror && !entry.hide) {\n            return { ...result, [orientation]: result[orientation] + entry.width };\n          }\n\n          return result;\n        },\n        { left: margin.left || 0, right: margin.right || 0 },\n      );\n\n      const offsetV = Object.keys(xAxisMap).reduce(\n        (result, id) => {\n          const entry = xAxisMap[id];\n          const { orientation } = entry;\n\n          if (!entry.mirror && !entry.hide) {\n            return { ...result, [orientation]: _.get(result, `${orientation}`) + entry.height };\n          }\n\n          return result;\n        },\n        { top: margin.top || 0, bottom: margin.bottom || 0 },\n      );\n\n      let offset = { ...offsetV, ...offsetH };\n\n      const brushBottom = offset.bottom;\n\n      if (brushItem) {\n        offset.bottom += brushItem.props.height || Brush.defaultProps.height;\n      }\n\n      if (legendItem && this.legendInstance) {\n        const legendBox = this.legendInstance.getBBox();\n\n        offset = appendOffsetOfLegend(offset, graphicalItems, props, legendBox);\n      }\n\n      return {\n        brushBottom,\n        ...offset,\n        width: width - offset.left - offset.right,\n        height: height - offset.top - offset.bottom,\n      };\n    }\n\n    handleLegendBBoxUpdate = (box: any) => {\n      if (box && this.legendInstance) {\n        const { dataStartIndex, dataEndIndex, updateId } = this.state;\n\n        this.setState(\n          this.updateStateOfAxisMapsOffsetAndStackGroups({\n            props: this.props,\n            dataStartIndex,\n            dataEndIndex,\n            updateId,\n          }),\n        );\n      }\n    };\n\n    handleReceiveSyncEvent = (cId: any, chartId: any, data: any) => {\n      const { syncId, layout } = this.props;\n      const { updateId } = this.state;\n\n      if (syncId === cId && chartId !== this.uniqueChartId) {\n        const { dataStartIndex, dataEndIndex } = data;\n\n        if (!_.isNil(data.dataStartIndex) || !_.isNil(data.dataEndIndex)) {\n          this.setState({\n            dataStartIndex,\n            dataEndIndex,\n            ...this.updateStateOfAxisMapsOffsetAndStackGroups({\n              props: this.props,\n              dataStartIndex,\n              dataEndIndex,\n              updateId,\n            }),\n          });\n        } else if (!_.isNil(data.activeTooltipIndex)) {\n          const { chartX, chartY, activeTooltipIndex } = data;\n          const { offset, tooltipTicks } = this.state;\n          if (!offset) {\n            return;\n          }\n          const viewBox: ViewBox = { ...offset, x: offset.left, y: offset.top };\n          // When a categotical chart is combined with another chart, the value of chartX\n          // and chartY may beyond the boundaries.\n          const validateChartX = Math.min(chartX, viewBox.x + viewBox.width);\n          const validateChartY = Math.min(chartY, viewBox.y + viewBox.height);\n          const activeLabel = tooltipTicks[activeTooltipIndex] && tooltipTicks[activeTooltipIndex].value;\n          const activePayload: any = this.getTooltipContent(activeTooltipIndex);\n          const activeCoordinate = tooltipTicks[activeTooltipIndex]\n            ? {\n                x: layout === 'horizontal' ? tooltipTicks[activeTooltipIndex].coordinate : validateChartX,\n                y: layout === 'horizontal' ? validateChartY : tooltipTicks[activeTooltipIndex].coordinate,\n              }\n            : originCoordinate;\n\n          this.setState({ ...data, activeLabel, activeCoordinate, activePayload });\n        } else {\n          this.setState(data);\n        }\n      }\n    };\n\n    handleBrushChange = ({ startIndex, endIndex }: any) => {\n      // Only trigger changes if the extents of the brush have actually changed\n      if (startIndex !== this.state.dataStartIndex || endIndex !== this.state.dataEndIndex) {\n        const { updateId } = this.state;\n\n        this.setState(() => ({\n          dataStartIndex: startIndex,\n          dataEndIndex: endIndex,\n          ...this.updateStateOfAxisMapsOffsetAndStackGroups({\n            props: this.props,\n            dataStartIndex: startIndex,\n            dataEndIndex: endIndex,\n            updateId,\n          }),\n        }));\n\n        this.triggerSyncEvent({\n          dataStartIndex: startIndex,\n          dataEndIndex: endIndex,\n        });\n      }\n    };\n\n    /**\n     * The handler of mouse entering chart\n     * @param  {Object} e              Event object\n     * @return {Null}                  null\n     */\n    handleMouseEnter = (e: any) => {\n      const { onMouseEnter } = this.props;\n      const mouse = this.getMouseInfo(e);\n\n      if (mouse) {\n        const nextState: CategoricalChartState = { ...mouse, isTooltipActive: true };\n        this.setState(nextState);\n        this.triggerSyncEvent(nextState);\n\n        if (_.isFunction(onMouseEnter)) {\n          onMouseEnter(nextState, e);\n        }\n      }\n    };\n\n    triggeredAfterMouseMove = (e: any): any => {\n      const { onMouseMove } = this.props;\n      const mouse = this.getMouseInfo(e);\n      const nextState: CategoricalChartState = mouse ? { ...mouse, isTooltipActive: true } : { isTooltipActive: false };\n\n      this.setState(nextState);\n      this.triggerSyncEvent(nextState);\n\n      if (_.isFunction(onMouseMove)) {\n        onMouseMove(nextState, e);\n      }\n    };\n\n    /**\n     * The handler of mouse entering a scatter\n     * @param {Object} el     The active scatter\n     * @return {Object} no return\n     */\n    handleItemMouseEnter = (el: any) => {\n      this.setState(() => ({\n        isTooltipActive: true,\n        activeItem: el,\n        activePayload: el.tooltipPayload,\n        activeCoordinate: el.tooltipPosition || { x: el.cx, y: el.cy },\n      }));\n    };\n\n    /**\n     * The handler of mouse leaving a scatter\n     * @return {Object} no return\n     */\n    handleItemMouseLeave = () => {\n      this.setState(() => ({\n        isTooltipActive: false,\n      }));\n    };\n\n    /**\n     * The handler of mouse moving in chart\n     * @param  {Object} e        Event object\n     * @return {Null} no return\n     */\n    handleMouseMove = (e: any) => {\n      if (e && _.isFunction(e.persist)) {\n        e.persist();\n      }\n      this.triggeredAfterMouseMove(e);\n    };\n\n    /**\n     * The handler if mouse leaving chart\n     * @param {Object} e Event object\n     * @return {Null} no return\n     */\n    handleMouseLeave = (e: any) => {\n      const { onMouseLeave } = this.props;\n      const nextState = { isTooltipActive: false };\n\n      this.setState(nextState);\n      this.triggerSyncEvent(nextState);\n\n      if (_.isFunction(onMouseLeave)) {\n        onMouseLeave(nextState, e);\n      }\n\n      this.cancelThrottledTriggerAfterMouseMove();\n    };\n\n    handleOuterEvent = (e: any) => {\n      const eventName = getReactEventByType(e);\n\n      const event = _.get(this.props, `${eventName}`);\n      if (eventName && _.isFunction(event)) {\n        const mouse = this.getMouseInfo(e);\n        const handler = event;\n\n        handler(mouse, e);\n      }\n    };\n\n    handleClick = (e: any) => {\n      const { onClick } = this.props;\n      const mouse = this.getMouseInfo(e);\n\n      if (mouse) {\n        const nextState: CategoricalChartState = { ...mouse, isTooltipActive: true };\n        this.setState(nextState);\n        this.triggerSyncEvent(nextState);\n\n        if (_.isFunction(onClick)) {\n          onClick(nextState, e);\n        }\n      }\n    };\n\n    handleMouseDown = (e: any) => {\n      const { onMouseDown } = this.props;\n\n      if (_.isFunction(onMouseDown)) {\n        const mouse = this.getMouseInfo(e);\n\n        onMouseDown(mouse, e);\n      }\n    };\n\n    handleMouseUp = (e: any) => {\n      const { onMouseUp } = this.props;\n\n      if (_.isFunction(onMouseUp)) {\n        const mouse = this.getMouseInfo(e);\n\n        onMouseUp(mouse, e);\n      }\n    };\n\n    handleTouchMove = (e: any) => {\n      if (e.changedTouches != null && e.changedTouches.length > 0) {\n        this.handleMouseMove(e.changedTouches[0]);\n      }\n    };\n\n    handleTouchStart = (e: any) => {\n      if (e.changedTouches != null && e.changedTouches.length > 0) {\n        this.handleMouseDown(e.changedTouches[0]);\n      }\n    };\n\n    handleTouchEnd = (e: any) => {\n      if (e.changedTouches != null && e.changedTouches.length > 0) {\n        this.handleMouseUp(e.changedTouches[0]);\n      }\n    };\n\n    triggerSyncEvent(data: any) {\n      const { syncId } = this.props;\n\n      if (!_.isNil(syncId)) {\n        eventCenter.emit(SYNC_EVENT, syncId, this.uniqueChartId, data);\n      }\n    }\n\n    verticalCoordinatesGenerator = ({ xAxis, width, height, offset }: ChartCoordinate) =>\n      getCoordinatesOfGrid(\n        CartesianAxis.getTicks({\n          ...CartesianAxis.defaultProps,\n          ...xAxis,\n          ticks: getTicksOfAxis(xAxis, true),\n          viewBox: { x: 0, y: 0, width, height },\n        }),\n        offset.left,\n        offset.left + offset.width,\n      );\n\n    horizontalCoordinatesGenerator = ({ yAxis, width, height, offset }: ChartCoordinate) =>\n      getCoordinatesOfGrid(\n        CartesianAxis.getTicks({\n          ...CartesianAxis.defaultProps,\n          ...yAxis,\n          ticks: getTicksOfAxis(yAxis, true),\n          viewBox: { x: 0, y: 0, width, height },\n        }),\n        offset.top,\n        offset.top + offset.height,\n      );\n\n    axesTicksGenerator = (axis?: any) => getTicksOfAxis(axis, true);\n\n    tooltipTicksGenerator = (axisMap: any) => {\n      const axis: BaseAxisProps = getAnyElementOfObject(axisMap);\n      const tooltipTicks = getTicksOfAxis(axis, false, true);\n\n      return {\n        tooltipTicks,\n        orderedTooltipTicks: _.sortBy(tooltipTicks, o => o.coordinate),\n        tooltipAxis: axis,\n        tooltipAxisBandSize: getBandSizeOfAxis(axis),\n      };\n    };\n\n    filterFormatItem(item: any, displayName: any, childIndex: any) {\n      const { formatedGraphicalItems } = this.state;\n\n      for (let i = 0, len = formatedGraphicalItems.length; i < len; i++) {\n        const entry = formatedGraphicalItems[i];\n\n        if (\n          entry.item === item ||\n          entry.props.key === item.key ||\n          (displayName === getDisplayName(entry.item.type) && childIndex === entry.childIndex)\n        ) {\n          return entry;\n        }\n      }\n\n      return null;\n    }\n\n    renderCursor = (element: any) => {\n      const { isTooltipActive, activeCoordinate, activePayload, offset } = this.state;\n\n      if (!element || !element.props.cursor || !isTooltipActive || !activeCoordinate) {\n        return null;\n      }\n      const { layout } = this.props;\n      let restProps;\n      let cursorComp: any = Curve;\n\n      if (chartName === 'ScatterChart') {\n        restProps = activeCoordinate;\n        cursorComp = Cross;\n      } else if (chartName === 'BarChart') {\n        restProps = this.getCursorRectangle();\n        cursorComp = Rectangle;\n      } else if (layout === 'radial') {\n        const { cx, cy, radius, startAngle, endAngle }: any = this.getCursorPoints();\n        restProps = {\n          cx,\n          cy,\n          startAngle,\n          endAngle,\n          innerRadius: radius,\n          outerRadius: radius,\n        };\n        cursorComp = Sector;\n      } else {\n        restProps = { points: this.getCursorPoints() };\n        cursorComp = Curve;\n      }\n      const key = element.key || '_recharts-cursor';\n      const cursorProps = {\n        stroke: '#ccc',\n        pointerEvents: 'none',\n        ...offset,\n        ...restProps,\n        ...filterProps(element.props.cursor),\n        payload: activePayload,\n        key,\n        className: 'recharts-tooltip-cursor',\n      };\n\n      return isValidElement(element.props.cursor)\n        ? cloneElement(element.props.cursor, cursorProps)\n        : createElement(cursorComp, cursorProps);\n    };\n\n    renderPolarAxis = (element: any, displayName: string, index: number) => {\n      const axisType = _.get(element, 'type.axisType');\n      const axisMap = _.get(this.state, `${axisType}Map`);\n      const axisOption = axisMap[element.props[`${axisType}Id`]];\n\n      return cloneElement(element, {\n        ...axisOption,\n        className: axisType,\n        key: element.key || `${displayName}-${index}`,\n        ticks: getTicksOfAxis(axisOption, true),\n      });\n    };\n\n    renderXAxis = (element: any, displayName: string, index: number) => {\n      const { xAxisMap } = this.state;\n      const axisObj = xAxisMap[element.props.xAxisId];\n\n      return this.renderAxis(axisObj, element, displayName, index);\n    };\n\n    renderYAxis = (element: any, displayName: string, index: number) => {\n      const { yAxisMap } = this.state;\n      const axisObj = yAxisMap[element.props.yAxisId];\n\n      return this.renderAxis(axisObj, element, displayName, index);\n    };\n\n    /**\n     * Draw axis\n     * @param {Object} axisOptions The options of axis\n     * @param {Object} element      The axis element\n     * @param {String} displayName  The display name of axis\n     * @param {Number} index        The index of element\n     * @return {ReactElement}       The instance of x-axes\n     */\n    renderAxis(axisOptions: BaseAxisProps, element: any, displayName: string, index: number): React.ReactElement {\n      const { width, height } = this.props;\n\n      return (\n        <CartesianAxis\n          {...(axisOptions as any)}\n          className={`recharts-${axisOptions.axisType} ${axisOptions.axisType}`}\n          key={element.key || `${displayName}-${index}`}\n          viewBox={{ x: 0, y: 0, width, height } as any}\n          ticksGenerator={this.axesTicksGenerator}\n        />\n      );\n    }\n\n    /**\n     * Draw grid\n     * @param  {ReactElement} element the grid item\n     * @return {ReactElement} The instance of grid\n     */\n    renderGrid = (element: React.ReactElement): React.ReactElement => {\n      const { xAxisMap, yAxisMap, offset } = this.state;\n      const { width, height } = this.props;\n      const xAxis = getAnyElementOfObject(xAxisMap);\n      const yAxisWithFiniteDomain = _.find(yAxisMap, axis => _.every(axis.domain, Number.isFinite));\n      const yAxis = yAxisWithFiniteDomain || getAnyElementOfObject(yAxisMap);\n      const props = element.props || {};\n\n      return cloneElement(element, {\n        key: element.key || 'grid',\n        x: isNumber(props.x) ? props.x : offset.left,\n        y: isNumber(props.y) ? props.y : offset.top,\n        width: isNumber(props.width) ? props.width : offset.width,\n        height: isNumber(props.height) ? props.height : offset.height,\n        xAxis,\n        yAxis,\n        offset,\n        chartWidth: width,\n        chartHeight: height,\n        verticalCoordinatesGenerator: props.verticalCoordinatesGenerator || this.verticalCoordinatesGenerator,\n        horizontalCoordinatesGenerator: props.horizontalCoordinatesGenerator || this.horizontalCoordinatesGenerator,\n      });\n    };\n\n    renderPolarGrid = (element: React.ReactElement): React.ReactElement => {\n      const { radiusAxisMap, angleAxisMap } = this.state;\n      const radiusAxis = getAnyElementOfObject(radiusAxisMap);\n      const angleAxis = getAnyElementOfObject(angleAxisMap);\n      const { cx, cy, innerRadius, outerRadius } = angleAxis;\n\n      return cloneElement(element, {\n        polarAngles: getTicksOfAxis(angleAxis, true).map((entry: any) => entry.coordinate),\n        polarRadius: getTicksOfAxis(radiusAxis, true).map((entry: any) => entry.coordinate),\n        cx,\n        cy,\n        innerRadius,\n        outerRadius,\n        key: element.key || 'polar-grid',\n      });\n    };\n\n    /**\n     * Draw legend\n     * @return {ReactElement}            The instance of Legend\n     */\n    renderLegend = (): React.ReactElement => {\n      const { formatedGraphicalItems } = this.state;\n      const { children, width, height } = this.props;\n      const margin = this.props.margin || {};\n      const legendWidth: number = width - (margin.left || 0) - (margin.right || 0);\n      const props = getLegendProps({\n        children,\n        formatedGraphicalItems,\n        legendWidth,\n        legendContent,\n      });\n\n      if (!props) {\n        return null;\n      }\n\n      const { item, ...otherProps } = props;\n\n      return cloneElement(item, {\n        ...otherProps,\n        chartWidth: width,\n        chartHeight: height,\n        margin,\n        ref: (legend: any) => {\n          this.legendInstance = legend;\n        },\n        onBBoxUpdate: this.handleLegendBBoxUpdate,\n      });\n    };\n\n    /**\n     * Draw Tooltip\n     * @return {ReactElement}  The instance of Tooltip\n     */\n    renderTooltip = (): React.ReactElement => {\n      const { children } = this.props;\n      const tooltipItem = findChildByType(children, Tooltip.displayName);\n\n      if (!tooltipItem) {\n        return null;\n      }\n\n      const { isTooltipActive, activeCoordinate, activePayload, activeLabel, offset } = this.state;\n\n      return cloneElement(tooltipItem, {\n        viewBox: { ...offset, x: offset.left, y: offset.top },\n        active: isTooltipActive,\n        label: activeLabel,\n        payload: isTooltipActive ? activePayload : [],\n        coordinate: activeCoordinate,\n      });\n    };\n\n    renderBrush = (element: React.ReactElement) => {\n      const { margin, data } = this.props;\n      const { offset, dataStartIndex, dataEndIndex, updateId } = this.state;\n\n      // TODO: update brush when children update\n      return cloneElement(element, {\n        key: element.key || '_recharts-brush',\n        onChange: combineEventHandlers(this.handleBrushChange, null, element.props.onChange),\n        data,\n        x: isNumber(element.props.x) ? element.props.x : offset.left,\n        y: isNumber(element.props.y)\n          ? element.props.y\n          : offset.top + offset.height + offset.brushBottom - (margin.bottom || 0),\n        width: isNumber(element.props.width) ? element.props.width : offset.width,\n        startIndex: dataStartIndex,\n        endIndex: dataEndIndex,\n        updateId: `brush-${updateId}`,\n      });\n    };\n\n    renderReferenceElement = (element: React.ReactElement, displayName: string, index: number): React.ReactElement => {\n      if (!element) {\n        return null;\n      }\n      const { clipPathId } = this;\n      const { xAxisMap, yAxisMap, offset } = this.state;\n      const { xAxisId, yAxisId } = element.props;\n\n      return cloneElement(element, {\n        key: element.key || `${displayName}-${index}`,\n        xAxis: xAxisMap[xAxisId],\n        yAxis: yAxisMap[yAxisId],\n        viewBox: {\n          x: offset.left,\n          y: offset.top,\n          width: offset.width,\n          height: offset.height,\n        },\n        clipPathId,\n      });\n    };\n\n    static renderActiveDot(option: any, props: any): React.ReactElement {\n      let dot;\n\n      if (isValidElement(option)) {\n        dot = cloneElement(option, props);\n      } else if (_.isFunction(option)) {\n        dot = option(props);\n      } else {\n        dot = <Dot {...props} />;\n      }\n\n      return (\n        <Layer className=\"recharts-active-dot\" key={props.key}>\n          {dot}\n        </Layer>\n      );\n    }\n\n    renderActivePoints = ({ item, activePoint, basePoint, childIndex, isRange }: any) => {\n      const result = [];\n      const { key } = item.props;\n      const { activeDot, dataKey } = item.item.props;\n      const dotProps = {\n        index: childIndex,\n        dataKey,\n        cx: activePoint.x,\n        cy: activePoint.y,\n        r: 4,\n        fill: getMainColorOfGraphicItem(item.item),\n        strokeWidth: 2,\n        stroke: '#fff',\n        payload: activePoint.payload,\n        value: activePoint.value,\n        key: `${key}-activePoint-${childIndex}`,\n        ...filterProps(activeDot),\n        ...adaptEventHandlers(activeDot),\n      };\n\n      result.push(CategoricalChartWrapper.renderActiveDot(activeDot, dotProps));\n\n      if (basePoint) {\n        result.push(\n          CategoricalChartWrapper.renderActiveDot(activeDot, {\n            ...dotProps,\n            cx: basePoint.x,\n            cy: basePoint.y,\n            key: `${key}-basePoint-${childIndex}`,\n          }),\n        );\n      } else if (isRange) {\n        result.push(null);\n      }\n\n      return result;\n    };\n\n    renderGraphicChild = (element: React.ReactElement, displayName: string, index: number): any[] => {\n      const item = this.filterFormatItem(element, displayName, index);\n      if (!item) {\n        return null;\n      }\n\n      const graphicalItem = cloneElement(element, item.props);\n      const { isTooltipActive, tooltipAxis, activeTooltipIndex, activeLabel } = this.state;\n      const { children } = this.props;\n      const tooltipItem = findChildByType(children, Tooltip.displayName);\n      const { points, isRange, baseLine } = item.props;\n      const { activeDot, hide } = item.item.props;\n      const hasActive = !hide && isTooltipActive && tooltipItem && activeDot && activeTooltipIndex >= 0;\n\n      function findWithPayload(entry: any) {\n        // TODO needs to verify dataKey is Function\n        return typeof tooltipAxis.dataKey === 'function' ? tooltipAxis.dataKey(entry.payload) : null;\n      }\n\n      if (hasActive) {\n        let activePoint, basePoint;\n\n        if (tooltipAxis.dataKey && !tooltipAxis.allowDuplicatedCategory) {\n          // number transform to string\n          const specifiedKey =\n            typeof tooltipAxis.dataKey === 'function'\n              ? findWithPayload\n              : 'payload.'.concat(tooltipAxis.dataKey.toString());\n          activePoint = findEntryInArray(points, specifiedKey, activeLabel);\n          basePoint = isRange && baseLine && findEntryInArray(baseLine, specifiedKey, activeLabel);\n        } else {\n          activePoint = points[activeTooltipIndex];\n          basePoint = isRange && baseLine && baseLine[activeTooltipIndex];\n        }\n\n        if (!_.isNil(activePoint)) {\n          return [\n            graphicalItem,\n            ...this.renderActivePoints({\n              item,\n              activePoint,\n              basePoint,\n              childIndex: activeTooltipIndex,\n              isRange,\n            }),\n          ];\n        }\n      }\n\n      if (isRange) {\n        return [graphicalItem, null, null];\n      }\n\n      return [graphicalItem, null];\n    };\n\n    renderCustomized = (element: React.ReactElement): React.ReactElement =>\n      cloneElement(element, {\n        ...this.props,\n        ...this.state,\n      });\n\n    renderClipPath() {\n      const { clipPathId } = this;\n      const {\n        offset: { left, top, height, width },\n      } = this.state;\n\n      return (\n        <defs>\n          <clipPath id={clipPathId}>\n            <rect x={left} y={top} height={height} width={width} />\n          </clipPath>\n        </defs>\n      );\n    }\n\n    render() {\n      if (!validateWidthHeight(this)) {\n        return null;\n      }\n\n      const { children, className, width, height, style, compact, ...others } = this.props;\n      const attrs = filterProps(others);\n      const map = {\n        CartesianGrid: { handler: this.renderGrid, once: true },\n        ReferenceArea: { handler: this.renderReferenceElement },\n        ReferenceLine: { handler: this.renderReferenceElement },\n        ReferenceDot: { handler: this.renderReferenceElement },\n        XAxis: { handler: this.renderXAxis },\n        YAxis: { handler: this.renderYAxis },\n        Brush: { handler: this.renderBrush, once: true },\n        Bar: { handler: this.renderGraphicChild },\n        Line: { handler: this.renderGraphicChild },\n        Area: { handler: this.renderGraphicChild },\n        Radar: { handler: this.renderGraphicChild },\n        RadialBar: { handler: this.renderGraphicChild },\n        Scatter: { handler: this.renderGraphicChild },\n        Pie: { handler: this.renderGraphicChild },\n        Funnel: { handler: this.renderGraphicChild },\n        Tooltip: { handler: this.renderCursor, once: true },\n        PolarGrid: { handler: this.renderPolarGrid, once: true },\n        PolarAngleAxis: { handler: this.renderPolarAxis },\n        PolarRadiusAxis: { handler: this.renderPolarAxis },\n        Customized: { handler: this.renderCustomized },\n      } as any;\n\n      // The \"compact\" mode is mainly used as the panorama within Brush\n      if (compact) {\n        return (\n          <Surface {...attrs} width={width} height={height}>\n            {this.renderClipPath()}\n            {renderByOrder(children, map)}\n          </Surface>\n        );\n      }\n\n      const events = this.parseEventsOfWrapper();\n      return (\n        <div\n          className={classNames('recharts-wrapper', className)}\n          style={{ position: 'relative', cursor: 'default', width, height, ...style }}\n          {...events}\n          ref={node => {\n            this.container = node;\n          }}\n        >\n          <Surface {...attrs} width={width} height={height}>\n            {this.renderClipPath()}\n            {renderByOrder(children, map)}\n          </Surface>\n          {this.renderLegend()}\n          {this.renderTooltip()}\n        </div>\n      );\n    }\n  };\n\nexport default generateCategoricalChart;\n","/**\n * @fileOverview Cross\n */\nimport { PresentationAttributes } from '../util/types';\n\nexport type Props = PresentationAttributes<SVGElement>;\n\nfunction Cell(props: Props): null {\n  return null;\n}\nCell.displayName = 'Cell';\n\nexport default Cell;\n","/**\n * @fileOverview Customized\n */\nimport React, { isValidElement, cloneElement, createElement, Component, FunctionComponent } from 'react';\nimport _ from 'lodash';\nimport Layer from '../container/Layer';\nimport { warn } from '../util/LogUtils';\n\ntype Comp<P> = FunctionComponent<P> | Component<P>;\ntype Props<P, C extends Comp<P>> = P & {\n  component: C;\n};\n\n/**\n * custom svg elements by rechart instance props and state.\n * @returns {Object}   svg elements\n */\nexport default function Customized<P, C extends Comp<P>>({ component, ...props }: Props<P, C>) {\n  let child;\n  if (isValidElement(component)) {\n    child = cloneElement(component, props);\n  } else if (_.isFunction(component)) {\n    child = createElement(component, props as any);\n  } else {\n    warn(false, \"Customized's props `component` must be React.element or Function, but got %s.\", typeof component);\n  }\n  return <Layer className=\"recharts-customized-wrapper\">{child}</Layer>;\n}\n\nCustomized.displayName = 'Customized';\n","/**\n * @fileOverview Default Legend Content\n */\nimport React, { PureComponent, ReactNode, MouseEvent, ReactText, ReactElement } from 'react';\nimport classNames from 'classnames';\nimport Surface from '../container/Surface';\nimport Symbols from '../shape/Symbols';\nimport { LegendType, LayoutType, SymbolType, adaptEventsOfChild } from '../util/types';\n\nconst SIZE = 32;\nexport type ContentType<TValue, TID> = ReactElement | ((props: Props<TValue, TID>) => ReactNode);\nexport type IconType = Omit<LegendType, 'none'>;\nexport type HorizontalAlignmentType = 'center' | 'left' | 'right';\nexport type VerticalAlignmentType = 'top' | 'bottom' | 'middle';\nexport type Formatter<TValue, TID> = (value: any, entry: Payload<TValue, TID>, index: number) => ReactNode;\n\nexport interface Payload<TValue, TID> {\n  value: TValue;\n  id: TID;\n  type: LegendType;\n  color: string;\n  payload: {\n    strokeDasharray: ReactText;\n  };\n  formatter?: Formatter<TValue, TID>;\n  inactive?: boolean;\n}\n\nexport interface Props<TValue, TID> {\n  content?: ContentType<TValue, TID>;\n  iconSize?: number;\n  iconType?: IconType;\n  layout?: LayoutType;\n  align?: HorizontalAlignmentType;\n  verticalAlign?: VerticalAlignmentType;\n  payload?: Array<Payload<TValue, TID>>;\n  inactiveColor?: string;\n  formatter?: Formatter<TValue, TID>;\n  onMouseEnter?: (event: MouseEvent) => void;\n  onMouseLeave?: (event: MouseEvent) => void;\n  onClick?: (event: MouseEvent) => void;\n}\n\nclass DefaultLegendContent<TValue, TID> extends PureComponent<Props<TValue, TID>> {\n  static displayName = 'Legend';\n\n  static defaultProps = {\n    iconSize: 14,\n    layout: 'horizontal',\n    align: 'center',\n    verticalAlign: 'middle',\n    inactiveColor: '#ccc',\n  };\n\n  /**\n   * Render the path of icon\n   * @param {Object} data Data of each legend item\n   * @return {String} Path element\n   */\n  renderIcon(data: Payload<TValue, TID>) {\n    const { inactiveColor } = this.props;\n    const halfSize = SIZE / 2;\n    const sixthSize = SIZE / 6;\n    const thirdSize = SIZE / 3;\n    const color = data.inactive ? inactiveColor : data.color;\n\n    if (data.type === 'plainline') {\n      return (\n        <line\n          strokeWidth={4}\n          fill=\"none\"\n          stroke={color}\n          strokeDasharray={data.payload.strokeDasharray}\n          x1={0}\n          y1={halfSize}\n          x2={SIZE}\n          y2={halfSize}\n          className=\"recharts-legend-icon\"\n        />\n      );\n    }\n    if (data.type === 'line') {\n      return (\n        <path\n          strokeWidth={4}\n          fill=\"none\"\n          stroke={color}\n          d={`M0,${halfSize}h${thirdSize}\n            A${sixthSize},${sixthSize},0,1,1,${2 * thirdSize},${halfSize}\n            H${SIZE}M${2 * thirdSize},${halfSize}\n            A${sixthSize},${sixthSize},0,1,1,${thirdSize},${halfSize}`}\n          className=\"recharts-legend-icon\"\n        />\n      );\n    }\n    if (data.type === 'rect') {\n      return (\n        <path\n          stroke=\"none\"\n          fill={color}\n          d={`M0,${SIZE / 8}h${SIZE}v${(SIZE * 3) / 4}h${-SIZE}z`}\n          className=\"recharts-legend-icon\"\n        />\n      );\n    }\n\n    return (\n      <Symbols\n        fill={color}\n        cx={halfSize}\n        cy={halfSize}\n        size={SIZE}\n        sizeType=\"diameter\"\n        type={data.type as SymbolType}\n      />\n    );\n  }\n\n  /**\n   * Draw items of legend\n   * @return {ReactElement} Items\n   */\n  renderItems() {\n    const { payload, iconSize, layout, formatter } = this.props;\n    const viewBox = { x: 0, y: 0, width: SIZE, height: SIZE };\n    const itemStyle = {\n      display: layout === 'horizontal' ? 'inline-block' : 'block',\n      marginRight: 10,\n    };\n    const svgStyle = { display: 'inline-block', verticalAlign: 'middle', marginRight: 4 };\n\n    return payload.map((entry, i) => {\n      const finalFormatter = entry.formatter || formatter;\n      const className = classNames({\n        'recharts-legend-item': true,\n        [`legend-item-${i}`]: true,\n        inactive: entry.inactive,\n      });\n\n      if (entry.type === 'none') {\n        return null;\n      }\n\n      return (\n        <li\n          className={className}\n          style={itemStyle}\n          key={`legend-item-${i}`} // eslint-disable-line react/no-array-index-key\n          {...adaptEventsOfChild(this.props, entry, i)}\n        >\n          <Surface width={iconSize} height={iconSize} viewBox={viewBox} style={svgStyle}>\n            {this.renderIcon(entry)}\n          </Surface>\n          <span className=\"recharts-legend-item-text\">\n            {finalFormatter ? finalFormatter(entry.value, entry, i) : entry.value}\n          </span>\n        </li>\n      );\n    });\n  }\n\n  render() {\n    const { payload, layout, align } = this.props;\n\n    if (!payload || !payload.length) {\n      return null;\n    }\n\n    const finalStyle = {\n      padding: 0,\n      margin: 0,\n      textAlign: layout === 'horizontal' ? align : 'left',\n    };\n\n    return (\n      <ul className=\"recharts-default-legend\" style={finalStyle}>\n        {this.renderItems()}\n      </ul>\n    );\n  }\n}\n\nexport default DefaultLegendContent;\n","/**\n * @fileOverview Default Tooltip Content\n */\nimport _ from 'lodash';\nimport React, { PureComponent, CSSProperties, ReactNode } from 'react';\nimport classNames from 'classnames';\nimport { isNumOrStr } from '../util/DataUtils';\n\nfunction defaultFormatter<T>(value: T) {\n  return _.isArray(value) && isNumOrStr(value[0]) && isNumOrStr(value[1]) ? value.join(' ~ ') : value;\n}\n\nexport type TooltipType = 'none';\nexport type ValueType = number | string | Array<number | string>;\nexport type NameType = number | string;\nexport type Formatter<TValue extends ValueType, TName extends NameType> = (\n  value: TValue,\n  name: TName,\n  item: Payload<TValue, TName>,\n  index: number,\n  payload: Array<Payload<TValue, TName>>,\n) => [ReactNode, ReactNode] | ReactNode;\n\nexport interface Payload<TValue extends ValueType, TName extends NameType> {\n  type?: TooltipType;\n  color?: string;\n  formatter?: Formatter<TValue, TName>;\n  name?: TName;\n  value?: TValue;\n  unit?: ReactNode;\n  dataKey?: string | number;\n}\n\nexport interface Props<TValue extends ValueType, TName extends NameType> {\n  separator?: string;\n  wrapperClassName?: string;\n  labelClassName?: string;\n  formatter?: Function;\n  contentStyle?: CSSProperties;\n  itemStyle?: CSSProperties;\n  labelStyle?: CSSProperties;\n  labelFormatter?: (label: any, payload: Array<Payload<TValue, TName>>) => ReactNode;\n  label?: any;\n  payload?: Array<Payload<TValue, TName>>;\n  itemSorter?: (item: Payload<TValue, TName>) => number | string;\n}\n\nclass DefaultTooltipContent<TValue extends ValueType, TName extends NameType> extends PureComponent<\n  Props<TValue, TName>\n> {\n  static displayName = 'DefaultTooltipContent';\n\n  static defaultProps = {\n    separator: ' : ',\n    contentStyle: {},\n    itemStyle: {},\n    labelStyle: {},\n  };\n\n  renderContent() {\n    const { payload, separator, formatter, itemStyle, itemSorter } = this.props;\n\n    if (payload && payload.length) {\n      const listStyle = { padding: 0, margin: 0 };\n\n      const items = (itemSorter ? _.sortBy(payload, itemSorter) : payload).map((entry, i) => {\n        if (entry.type === 'none') {\n          return null;\n        }\n\n        const finalItemStyle = {\n          display: 'block',\n          paddingTop: 4,\n          paddingBottom: 4,\n          color: entry.color || '#000',\n          ...itemStyle,\n        };\n        const finalFormatter = entry.formatter || formatter || defaultFormatter;\n        let { name, value } = entry;\n        if (finalFormatter) {\n          const formatted = finalFormatter(value, name, entry, i, payload);\n          if (Array.isArray(formatted)) {\n            [value, name] = formatted;\n          } else {\n            value = formatted;\n          }\n        }\n        return (\n          // eslint-disable-next-line react/no-array-index-key\n          <li className=\"recharts-tooltip-item\" key={`tooltip-item-${i}`} style={finalItemStyle}>\n            {isNumOrStr(name) ? <span className=\"recharts-tooltip-item-name\">{name}</span> : null}\n            {isNumOrStr(name) ? <span className=\"recharts-tooltip-item-separator\">{separator}</span> : null}\n            <span className=\"recharts-tooltip-item-value\">{value}</span>\n            <span className=\"recharts-tooltip-item-unit\">{entry.unit || ''}</span>\n          </li>\n        );\n      });\n\n      return (\n        <ul className=\"recharts-tooltip-item-list\" style={listStyle}>\n          {items}\n        </ul>\n      );\n    }\n\n    return null;\n  }\n\n  render() {\n    const { wrapperClassName, contentStyle, labelClassName, labelStyle, label, labelFormatter, payload } = this.props;\n    const finalStyle: CSSProperties = {\n      margin: 0,\n      padding: 10,\n      backgroundColor: '#fff',\n      border: '1px solid #ccc',\n      whiteSpace: 'nowrap',\n      ...contentStyle,\n    };\n    const finalLabelStyle = {\n      margin: 0,\n      ...labelStyle,\n    };\n    const hasLabel = !_.isNil(label);\n    let finalLabel = hasLabel ? label : '';\n    const wrapperCN = classNames('recharts-default-tooltip', wrapperClassName);\n    const labelCN = classNames('recharts-tooltip-label', labelClassName);\n\n    if (hasLabel && labelFormatter) {\n      finalLabel = labelFormatter(label, payload);\n    }\n\n    return (\n      <div className={wrapperCN} style={finalStyle}>\n        <p className={labelCN} style={finalLabelStyle}>\n          {React.isValidElement(finalLabel) ? finalLabel : `${finalLabel}`}\n        </p>\n        {this.renderContent()}\n      </div>\n    );\n  }\n}\n\nexport default DefaultTooltipContent;\n","import React, { cloneElement, isValidElement, ReactNode, ReactElement, createElement } from 'react';\nimport _ from 'lodash';\nimport classNames from 'classnames';\nimport Text from './Text';\nimport { findAllByType } from '../util/ReactUtils';\nimport { isNumOrStr, isNumber, isPercent, getPercentValue, uniqueId, mathSign } from '../util/DataUtils';\nimport { polarToCartesian } from '../util/PolarUtils';\nimport { PresentationAttributes, filterProps } from '../util/types';\n\ninterface CartesianViewBox {\n  x?: number;\n  y?: number;\n  width?: number;\n  height?: number;\n}\n\ninterface PolarViewBox {\n  cx?: number;\n  cy?: number;\n  innerRadius?: number;\n  outerRadius?: number;\n  startAngle?: number;\n  endAngle?: number;\n  clockWise?: boolean;\n}\n\ntype ViewBox = CartesianViewBox | PolarViewBox;\nexport type ContentType = ReactElement | ((props: Props) => ReactNode);\n\ninterface LabelProps {\n  viewBox?: ViewBox;\n  formatter?: Function;\n  value?: number | string;\n  offset?: number;\n  position?:\n    | 'top'\n    | 'left'\n    | 'right'\n    | 'bottom'\n    | 'inside'\n    | 'outside'\n    | 'insideLeft'\n    | 'insideRight'\n    | 'insideTop'\n    | 'insideBottom'\n    | 'insideTopLeft'\n    | 'insideBottomLeft'\n    | 'insideTopRight'\n    | 'insideBottomRight'\n    | 'insideStart'\n    | 'insideEnd'\n    | 'end'\n    | 'center'\n    | 'centerTop'\n    | 'centerBottom'\n    | {\n        x?: number;\n        y?: number;\n      };\n  children?: ReactNode;\n  className?: string;\n  content?: ContentType;\n}\n\ntype Props = Omit<PresentationAttributes<SVGTextElement>, 'viewBox'> & LabelProps;\n\nconst getLabel = (props: Props) => {\n  const { value, formatter } = props;\n  const label = _.isNil(props.children) ? value : props.children;\n\n  if (_.isFunction(formatter)) {\n    return formatter(label);\n  }\n\n  return label;\n};\n\nconst getDeltaAngle = (startAngle: number, endAngle: number) => {\n  const sign = mathSign(endAngle - startAngle);\n  const deltaAngle = Math.min(Math.abs(endAngle - startAngle), 360);\n\n  return sign * deltaAngle;\n};\n\nconst renderRadialLabel = (labelProps: Props, label: ReactNode, attrs: PresentationAttributes<SVGTextElement>) => {\n  const { position, viewBox, offset, className } = labelProps;\n  const { cx, cy, innerRadius, outerRadius, startAngle, endAngle, clockWise } = viewBox as PolarViewBox;\n  const radius = (innerRadius + outerRadius) / 2;\n  const deltaAngle = getDeltaAngle(startAngle, endAngle);\n  const sign = deltaAngle >= 0 ? 1 : -1;\n  let labelAngle, direction;\n\n  if (position === 'insideStart') {\n    labelAngle = startAngle + sign * offset;\n    direction = clockWise;\n  } else if (position === 'insideEnd') {\n    labelAngle = endAngle - sign * offset;\n    direction = !clockWise;\n  } else if (position === 'end') {\n    labelAngle = endAngle + sign * offset;\n    direction = clockWise;\n  }\n\n  direction = deltaAngle <= 0 ? direction : !direction;\n\n  const startPoint = polarToCartesian(cx, cy, radius, labelAngle);\n  const endPoint = polarToCartesian(cx, cy, radius, labelAngle + (direction ? 1 : -1) * 359);\n  const path = `M${startPoint.x},${startPoint.y}\n    A${radius},${radius},0,1,${direction ? 0 : 1},\n    ${endPoint.x},${endPoint.y}`;\n  const id = _.isNil(labelProps.id) ? uniqueId('recharts-radial-line-') : labelProps.id;\n\n  return (\n    <text {...attrs} dominantBaseline=\"central\" className={classNames('recharts-radial-bar-label', className)}>\n      <defs>\n        <path id={id} d={path} />\n      </defs>\n      <textPath xlinkHref={`#${id}`}>{label}</textPath>\n    </text>\n  );\n};\n\nconst getAttrsOfPolarLabel = (props: Props) => {\n  const { viewBox, offset, position } = props;\n  const { cx, cy, innerRadius, outerRadius, startAngle, endAngle } = viewBox as PolarViewBox;\n  const midAngle = (startAngle + endAngle) / 2;\n\n  if (position === 'outside') {\n    const { x, y } = polarToCartesian(cx, cy, outerRadius + offset, midAngle);\n\n    return {\n      x,\n      y,\n      textAnchor: x >= cx ? 'start' : 'end',\n      verticalAnchor: 'middle',\n    };\n  }\n\n  if (position === 'center') {\n    return {\n      x: cx,\n      y: cy,\n      textAnchor: 'middle',\n      verticalAnchor: 'middle',\n    };\n  }\n\n  if (position === 'centerTop') {\n    return {\n      x: cx,\n      y: cy,\n      textAnchor: 'middle',\n      verticalAnchor: 'start',\n    };\n  }\n\n  if (position === 'centerBottom') {\n    return {\n      x: cx,\n      y: cy,\n      textAnchor: 'middle',\n      verticalAnchor: 'end',\n    };\n  }\n\n  const r = (innerRadius + outerRadius) / 2;\n  const { x, y } = polarToCartesian(cx, cy, r, midAngle);\n\n  return {\n    x,\n    y,\n    textAnchor: 'middle',\n    verticalAnchor: 'middle',\n  };\n};\n\nconst getAttrsOfCartesianLabel = (props: Props) => {\n  const { viewBox, offset, position } = props;\n  const { x, y, width, height } = viewBox as CartesianViewBox;\n\n  // Define vertical offsets and position inverts based on the value being positive or negative\n  const verticalSign = height >= 0 ? 1 : -1;\n  const verticalOffset = verticalSign * offset;\n  const verticalEnd = verticalSign > 0 ? 'end' : 'start';\n  const verticalStart = verticalSign > 0 ? 'start' : 'end';\n\n  // Define horizontal offsets and position inverts based on the value being positive or negative\n  const horizontalSign = width >= 0 ? 1 : -1;\n  const horizontalOffset = horizontalSign * offset;\n  const horizontalEnd = horizontalSign > 0 ? 'end' : 'start';\n  const horizontalStart = horizontalSign > 0 ? 'start' : 'end';\n\n  if (position === 'top') {\n    return {\n      x: x + width / 2,\n      y: y - verticalSign * offset,\n      textAnchor: 'middle',\n      verticalAnchor: verticalEnd,\n    };\n  }\n\n  if (position === 'bottom') {\n    return {\n      x: x + width / 2,\n      y: y + height + verticalOffset,\n      textAnchor: 'middle',\n      verticalAnchor: verticalStart,\n    };\n  }\n\n  if (position === 'left') {\n    return {\n      x: x - horizontalOffset,\n      y: y + height / 2,\n      textAnchor: horizontalEnd,\n      verticalAnchor: 'middle',\n    };\n  }\n\n  if (position === 'right') {\n    return {\n      x: x + width + horizontalOffset,\n      y: y + height / 2,\n      textAnchor: horizontalStart,\n      verticalAnchor: 'middle',\n    };\n  }\n\n  if (position === 'insideLeft') {\n    return {\n      x: x + horizontalOffset,\n      y: y + height / 2,\n      textAnchor: horizontalStart,\n      verticalAnchor: 'middle',\n    };\n  }\n\n  if (position === 'insideRight') {\n    return {\n      x: x + width - horizontalOffset,\n      y: y + height / 2,\n      textAnchor: horizontalEnd,\n      verticalAnchor: 'middle',\n    };\n  }\n\n  if (position === 'insideTop') {\n    return {\n      x: x + width / 2,\n      y: y + verticalOffset,\n      textAnchor: 'middle',\n      verticalAnchor: verticalStart,\n    };\n  }\n\n  if (position === 'insideBottom') {\n    return {\n      x: x + width / 2,\n      y: y + height - verticalOffset,\n      textAnchor: 'middle',\n      verticalAnchor: verticalEnd,\n    };\n  }\n\n  if (position === 'insideTopLeft') {\n    return {\n      x: x + horizontalOffset,\n      y: y + verticalOffset,\n      textAnchor: horizontalStart,\n      verticalAnchor: verticalStart,\n    };\n  }\n\n  if (position === 'insideTopRight') {\n    return {\n      x: x + width - horizontalOffset,\n      y: y + verticalOffset,\n      textAnchor: horizontalEnd,\n      verticalAnchor: verticalStart,\n    };\n  }\n\n  if (position === 'insideBottomLeft') {\n    return {\n      x: x + horizontalOffset,\n      y: y + height - verticalOffset,\n      textAnchor: horizontalStart,\n      verticalAnchor: verticalEnd,\n    };\n  }\n\n  if (position === 'insideBottomRight') {\n    return {\n      x: x + width - horizontalOffset,\n      y: y + height - verticalOffset,\n      textAnchor: horizontalEnd,\n      verticalAnchor: verticalEnd,\n    };\n  }\n\n  if (\n    _.isObject(position) &&\n    (isNumber(position.x) || isPercent(position.x)) &&\n    (isNumber(position.y) || isPercent(position.y))\n  ) {\n    return {\n      x: x + getPercentValue(position.x, width),\n      y: y + getPercentValue(position.y, height),\n      textAnchor: 'end',\n      verticalAnchor: 'end',\n    };\n  }\n\n  return {\n    x: x + width / 2,\n    y: y + height / 2,\n    textAnchor: 'middle',\n    verticalAnchor: 'middle',\n  };\n};\n\nconst isPolar = (viewBox: CartesianViewBox | PolarViewBox) => isNumber((viewBox as PolarViewBox).cx);\n\nfunction Label(props: Props) {\n  const { viewBox, position, value, children, content, className = '' } = props;\n\n  if (!viewBox || (_.isNil(value) && _.isNil(children) && !isValidElement(content) && !_.isFunction(content))) {\n    return null;\n  }\n\n  if (isValidElement(content)) {\n    return cloneElement(content, props);\n  }\n\n  let label: ReactNode;\n  if (_.isFunction(content)) {\n    label = createElement(content as any, props);\n\n    if (isValidElement(label)) {\n      return label;\n    }\n  } else {\n    label = getLabel(props);\n  }\n\n  const isPolarLabel = isPolar(viewBox);\n  const attrs = filterProps(props, true);\n\n  if (isPolarLabel && (position === 'insideStart' || position === 'insideEnd' || position === 'end')) {\n    return renderRadialLabel(props, label, attrs);\n  }\n\n  const positionAttrs = isPolarLabel ? getAttrsOfPolarLabel(props) : getAttrsOfCartesianLabel(props);\n\n  return (\n    <Text className={classNames('recharts-label', className)} {...attrs} {...(positionAttrs as any)}>\n      {label}\n    </Text>\n  );\n}\n\nLabel.displayName = 'Label';\nLabel.defaultProps = {\n  offset: 5,\n};\n\nconst parseViewBox = (props: any) => {\n  const {\n    cx,\n    cy,\n    angle,\n    startAngle,\n    endAngle,\n    r,\n    radius,\n    innerRadius,\n    outerRadius,\n    x,\n    y,\n    top,\n    left,\n    width,\n    height,\n    clockWise,\n  } = props;\n\n  if (isNumber(width) && isNumber(height)) {\n    if (isNumber(x) && isNumber(y)) {\n      return { x, y, width, height };\n    }\n    if (isNumber(top) && isNumber(left)) {\n      return { x: top, y: left, width, height };\n    }\n  }\n\n  if (isNumber(x) && isNumber(y)) {\n    return { x, y, width: 0, height: 0 };\n  }\n\n  if (isNumber(cx) && isNumber(cy)) {\n    return {\n      cx,\n      cy,\n      startAngle: startAngle || angle || 0,\n      endAngle: endAngle || angle || 0,\n      innerRadius: innerRadius || 0,\n      outerRadius: outerRadius || radius || r || 0,\n      clockWise,\n    };\n  }\n\n  if (props.viewBox) {\n    return props.viewBox;\n  }\n\n  return {};\n};\n\nconst parseLabel = (label: any, viewBox: ViewBox) => {\n  if (!label) {\n    return null;\n  }\n\n  if (label === true) {\n    return <Label key=\"label-implicit\" viewBox={viewBox} />;\n  }\n\n  if (isNumOrStr(label)) {\n    return <Label key=\"label-implicit\" viewBox={viewBox} value={label} />;\n  }\n\n  if (isValidElement(label)) {\n    if (label.type === Label) {\n      return cloneElement(label as any, { key: 'label-implicit', viewBox });\n    }\n\n    return <Label key=\"label-implicit\" content={label} viewBox={viewBox} />;\n  }\n\n  if (_.isFunction(label)) {\n    return <Label key=\"label-implicit\" content={label} viewBox={viewBox} />;\n  }\n\n  if (_.isObject(label)) {\n    return <Label viewBox={viewBox} {...label} key=\"label-implicit\" />;\n  }\n\n  return null;\n};\n\nconst renderCallByParent = (parentProps: any, viewBox?: ViewBox, ckeckPropsLabel = true) => {\n  if (!parentProps || (!parentProps.children && ckeckPropsLabel && !parentProps.label)) {\n    return null;\n  }\n  const { children } = parentProps;\n  const parentViewBox = parseViewBox(parentProps);\n\n  const explicitChilren = findAllByType(children, Label.displayName).map((child: any, index: number) =>\n    cloneElement(child, {\n      viewBox: viewBox || parentViewBox,\n      key: `label-${index}`,\n    }),\n  );\n\n  if (!ckeckPropsLabel) {\n    return explicitChilren;\n  }\n  const implicitLabel = parseLabel(parentProps.label, viewBox || parentViewBox);\n\n  return [implicitLabel, ...explicitChilren];\n};\n\nLabel.parseViewBox = parseViewBox;\nLabel.renderCallByParent = renderCallByParent;\n\nexport default Label;\n","import React, { cloneElement } from 'react';\nimport _ from 'lodash';\nimport Label, { ContentType } from './Label';\nimport Layer from '../container/Layer';\nimport { findAllByType } from '../util/ReactUtils';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport { filterProps, DataKey } from '../util/types';\n\ninterface Data {\n  value?: number | string | Array<number | string>;\n  payload?: any;\n}\n\ninterface Props<T extends Data> {\n  id?: string;\n  data: Array<T>;\n  valueAccessor?: Function;\n  clockWise?: boolean;\n  dataKey?: DataKey<T>;\n  content?: ContentType;\n}\n\nconst defaultProps = {\n  valueAccessor: (entry: Data) => (_.isArray(entry.value) ? _.last(entry.value) : entry.value),\n};\n\nfunction LabelList<T extends Data>(props: Props<T>) {\n  const { data, valueAccessor, dataKey, clockWise, id, ...others } = props;\n\n  if (!data || !data.length) {\n    return null;\n  }\n\n  return (\n    <Layer className=\"recharts-label-list\">\n      {data.map((entry, index) => {\n        const value = _.isNil(dataKey)\n          ? valueAccessor(entry, index)\n          : getValueByDataKey(entry && entry.payload, dataKey);\n        const idProps = _.isNil(id) ? {} : { id: `${id}-${index}` };\n\n        return (\n          <Label\n            {...(filterProps(entry, true) as any)}\n            {...others}\n            {...idProps}\n            index={index}\n            value={value}\n            viewBox={Label.parseViewBox(_.isNil(clockWise) ? entry : { ...entry, clockWise })}\n            key={`label-${index}`} // eslint-disable-line react/no-array-index-key\n          />\n        );\n      })}\n    </Layer>\n  );\n}\n\nLabelList.displayName = 'LabelList';\n\nfunction parseLabelList<T extends Data>(label: any, data: Array<T>) {\n  if (!label) {\n    return null;\n  }\n\n  if (label === true) {\n    return <LabelList key=\"labelList-implicit\" data={data} />;\n  }\n\n  if (React.isValidElement(label) || _.isFunction(label)) {\n    return <LabelList key=\"labelList-implicit\" data={data} content={label} />;\n  }\n\n  if (_.isObject(label)) {\n    return <LabelList data={data} {...label} key=\"labelList-implicit\" />;\n  }\n\n  return null;\n}\n\nfunction renderCallByParent<T extends Data>(parentProps: any, data: Array<T>, ckeckPropsLabel = true) {\n  if (!parentProps || (!parentProps.children && ckeckPropsLabel && !parentProps.label)) {\n    return null;\n  }\n  const { children } = parentProps;\n\n  const explicitChilren = findAllByType(children, LabelList.displayName).map((child: any, index: number) =>\n    cloneElement(child, {\n      data,\n      key: `labelList-${index}`,\n    }),\n  );\n  if (!ckeckPropsLabel) {\n    return explicitChilren;\n  }\n\n  const implicitLabelList = parseLabelList(parentProps.label, data);\n\n  return [implicitLabelList, ...explicitChilren];\n}\n\nLabelList.renderCallByParent = renderCallByParent;\nLabelList.defaultProps = defaultProps;\n\nexport default LabelList;\n","/**\n * @fileOverview Legend\n */\nimport React, { PureComponent, CSSProperties } from 'react';\nimport _ from 'lodash';\nimport DefaultLegendContent, { Payload, Props as DefaultProps, ContentType } from './DefaultLegendContent';\n\nimport { isNumber } from '../util/DataUtils';\n\ntype UniqueFunc<TValue, TID> = (entry: Payload<TValue, TID>) => unknown;\ntype UniqueOption<TValue, TID> = boolean | UniqueFunc<TValue, TID>;\nfunction defaultUniqBy<TValue, TID>(entry: Payload<TValue, TID>) {\n  return entry.value;\n}\nfunction getUniqPayload<TValue, TID>(option: UniqueOption<TValue, TID>, payload: Array<Payload<TValue, TID>>) {\n  if (option === true) {\n    return _.uniqBy(payload, defaultUniqBy);\n  }\n\n  if (_.isFunction(option)) {\n    return _.uniqBy(payload, option);\n  }\n\n  return payload;\n}\n\nfunction renderContent<TValue, TID>(content: ContentType<TValue, TID>, props: Props<TValue, TID>) {\n  if (React.isValidElement(content)) {\n    return React.cloneElement(content, props);\n  }\n  if (_.isFunction(content)) {\n    return React.createElement(content as any, props);\n  }\n\n  return <DefaultLegendContent {...props} />;\n}\n\nconst EPS = 1;\n\ntype Props<TValue, TID> = DefaultProps<TValue, TID> & {\n  wrapperStyle?: CSSProperties;\n  chartWidth?: number;\n  chartHeight?: number;\n  width?: number;\n  height?: number;\n  margin?: {\n    top?: number;\n    left?: number;\n    bottom?: number;\n    right?: number;\n  };\n  payloadUniqBy?: UniqueOption<TValue, TID>;\n  onBBoxUpdate?: (box: ClientRect | DOMRect | null) => void;\n};\n\ninterface State {\n  boxWidth: number;\n  boxHeight: number;\n}\n\nclass Legend<TValue, TID> extends PureComponent<Props<TValue, TID>, State> {\n  static displayName = 'Legend';\n\n  static defaultProps = {\n    iconSize: 14,\n    layout: 'horizontal',\n    align: 'center',\n    verticalAlign: 'bottom',\n  };\n\n  private wrapperNode: HTMLDivElement;\n\n  static getWithHeight(item: any, chartWidth: number) {\n    const { layout } = item.props;\n\n    if (layout === 'vertical' && isNumber(item.props.height)) {\n      return {\n        height: item.props.height,\n      };\n    }\n    if (layout === 'horizontal') {\n      return {\n        width: item.props.width || chartWidth,\n      };\n    }\n\n    return null;\n  }\n\n  state = {\n    boxWidth: -1,\n    boxHeight: -1,\n  };\n\n  public componentDidMount() {\n    this.updateBBox();\n  }\n\n  public componentDidUpdate() {\n    this.updateBBox();\n  }\n\n  public getBBox() {\n    if (this.wrapperNode && this.wrapperNode.getBoundingClientRect) {\n      return this.wrapperNode.getBoundingClientRect();\n    }\n\n    return null;\n  }\n\n  private getBBoxSnapshot() {\n    const { boxWidth, boxHeight } = this.state;\n\n    if (boxWidth >= 0 && boxHeight >= 0) {\n      return { width: boxWidth, height: boxHeight };\n    }\n\n    return null;\n  }\n\n  private getDefaultPosition(style: CSSProperties) {\n    const { layout, align, verticalAlign, margin, chartWidth, chartHeight } = this.props;\n    let hPos, vPos;\n\n    if (\n      !style ||\n      ((style.left === undefined || style.left === null) && (style.right === undefined || style.right === null))\n    ) {\n      if (align === 'center' && layout === 'vertical') {\n        const box = this.getBBoxSnapshot() || { width: 0 };\n        hPos = { left: ((chartWidth || 0) - box.width) / 2 };\n      } else {\n        hPos = align === 'right' ? { right: (margin && margin.right) || 0 } : { left: (margin && margin.left) || 0 };\n      }\n    }\n\n    if (\n      !style ||\n      ((style.top === undefined || style.top === null) && (style.bottom === undefined || style.bottom === null))\n    ) {\n      if (verticalAlign === 'middle') {\n        const box = this.getBBoxSnapshot() || { height: 0 };\n        vPos = { top: ((chartHeight || 0) - box.height) / 2 };\n      } else {\n        vPos =\n          verticalAlign === 'bottom'\n            ? { bottom: (margin && margin.bottom) || 0 }\n            : { top: (margin && margin.top) || 0 };\n      }\n    }\n\n    return { ...hPos, ...vPos };\n  }\n\n  private updateBBox() {\n    const { boxWidth, boxHeight } = this.state;\n    const { onBBoxUpdate } = this.props;\n\n    if (this.wrapperNode && this.wrapperNode.getBoundingClientRect) {\n      const box = this.wrapperNode.getBoundingClientRect();\n\n      if (Math.abs(box.width - boxWidth) > EPS || Math.abs(box.height - boxHeight) > EPS) {\n        this.setState(\n          {\n            boxWidth: box.width,\n            boxHeight: box.height,\n          },\n          () => {\n            if (onBBoxUpdate) {\n              onBBoxUpdate(box);\n            }\n          },\n        );\n      }\n    } else if (boxWidth !== -1 || boxHeight !== -1) {\n      this.setState(\n        {\n          boxWidth: -1,\n          boxHeight: -1,\n        },\n        () => {\n          if (onBBoxUpdate) {\n            onBBoxUpdate(null);\n          }\n        },\n      );\n    }\n  }\n\n  public render() {\n    const { content, width, height, wrapperStyle, payloadUniqBy, payload } = this.props;\n    const outerStyle: CSSProperties = {\n      position: 'absolute',\n      width: width || 'auto',\n      height: height || 'auto',\n      ...this.getDefaultPosition(wrapperStyle),\n      ...wrapperStyle,\n    };\n\n    return (\n      <div\n        className=\"recharts-legend-wrapper\"\n        style={outerStyle}\n        ref={node => {\n          this.wrapperNode = node;\n        }}\n      >\n        {renderContent(content, { ...this.props, payload: getUniqPayload(payloadUniqBy, payload) })}\n      </div>\n    );\n  }\n}\n\nexport default Legend;\n","/**\n * @fileOverview Wrapper component to make charts adapt to the size of parent * DOM\n */\nimport React, { Component, ReactElement } from 'react';\nimport classNames from 'classnames';\nimport ReactResizeDetector from 'react-resize-detector';\nimport _ from 'lodash';\nimport { isPercent } from '../util/DataUtils';\nimport { warn } from '../util/LogUtils';\n\ninterface Props {\n  aspect?: number;\n  width?: string | number;\n  height?: string | number;\n  minWidth?: string | number;\n  minHeight?: string | number;\n  maxHeight?: number;\n  children: ReactElement;\n  debounce?: number;\n  id?: string | number;\n  className?: string | number;\n}\n\ninterface State {\n  containerWidth: number;\n  containerHeight: number;\n}\n\nclass ResponsiveContainer extends Component<Props, State> {\n  static defaultProps = {\n    width: '100%',\n    height: '100%',\n    debounce: 0,\n  };\n\n  private handleResize: () => void;\n\n  private mounted: boolean;\n\n  private container: HTMLDivElement;\n\n  constructor(props: Props) {\n    super(props);\n\n    this.state = {\n      containerWidth: -1,\n      containerHeight: -1,\n    };\n\n    this.handleResize =\n      props.debounce > 0 ? _.debounce(this.updateDimensionsImmediate, props.debounce) : this.updateDimensionsImmediate;\n  }\n\n  /* eslint-disable  react/no-did-mount-set-state */\n  componentDidMount() {\n    this.mounted = true;\n\n    const size = this.getContainerSize();\n\n    if (size) {\n      this.setState(size);\n    }\n  }\n\n  componentWillUnmount() {\n    this.mounted = false;\n  }\n\n  getContainerSize() {\n    if (!this.container) {\n      return null;\n    }\n\n    return {\n      containerWidth: this.container.clientWidth,\n      containerHeight: this.container.clientHeight,\n    };\n  }\n\n  updateDimensionsImmediate = () => {\n    if (!this.mounted) {\n      return;\n    }\n\n    const newSize = this.getContainerSize();\n\n    if (newSize) {\n      const { containerWidth: oldWidth, containerHeight: oldHeight } = this.state;\n      const { containerWidth, containerHeight } = newSize;\n\n      if (containerWidth !== oldWidth || containerHeight !== oldHeight) {\n        this.setState({ containerWidth, containerHeight });\n      }\n    }\n  };\n\n  renderChart() {\n    const { containerWidth, containerHeight } = this.state;\n\n    if (containerWidth < 0 || containerHeight < 0) {\n      return null;\n    }\n\n    const { aspect, width, height, minWidth, minHeight, maxHeight, children } = this.props;\n\n    warn(\n      isPercent(width) || isPercent(height),\n      `The width(%s) and height(%s) are both fixed numbers,\n       maybe you don't need to use a ResponsiveContainer.`,\n      width,\n      height,\n    );\n\n    warn(!aspect || aspect > 0, 'The aspect(%s) must be greater than zero.', aspect);\n\n    let calculatedWidth: number = isPercent(width) ? containerWidth : (width as number);\n    let calculatedHeight: number = isPercent(height) ? containerHeight : (height as number);\n\n    if (aspect && aspect > 0) {\n      // Preserve the desired aspect ratio\n      if (calculatedWidth) {\n        // Will default to using width for aspect ratio\n        calculatedHeight = calculatedWidth / aspect;\n      } else if (calculatedHeight) {\n        // But we should also take height into consideration\n        calculatedWidth = calculatedHeight * aspect;\n      }\n\n      // if maxHeight is set, overwrite if calculatedHeight is greater than maxHeight\n      if (maxHeight && calculatedHeight > maxHeight) {\n        calculatedHeight = maxHeight;\n      }\n    }\n\n    warn(\n      calculatedWidth > 0 || calculatedHeight > 0,\n      `The width(%s) and height(%s) of chart should be greater than 0,\n       please check the style of container, or the props width(%s) and height(%s),\n       or add a minWidth(%s) or minHeight(%s) or use aspect(%s) to control the\n       height and width.`,\n      calculatedWidth,\n      calculatedHeight,\n      width,\n      height,\n      minWidth,\n      minHeight,\n      aspect,\n    );\n\n    return React.cloneElement(children, {\n      width: calculatedWidth,\n      height: calculatedHeight,\n    });\n  }\n\n  render() {\n    const { minWidth, minHeight, width, height, maxHeight, id, className } = this.props;\n    const style = { width, height, minWidth, minHeight, maxHeight };\n\n    return (\n      <div\n        id={`${id}`}\n        className={classNames('recharts-responsive-container', className)}\n        style={style}\n        ref={node => {\n          this.container = node;\n        }}\n      >\n        {this.renderChart()}\n        <ReactResizeDetector handleWidth handleHeight onResize={this.handleResize} />\n      </div>\n    );\n  }\n}\n\nexport default ResponsiveContainer;\n","import React, { Component, CSSProperties } from 'react';\nimport reduceCSSCalc from 'reduce-css-calc';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport { isNumber, isNumOrStr } from '../util/DataUtils';\nimport Global from '../util/Global';\nimport { PresentationAttributes, filterProps } from '../util/types';\nimport { getStringSize } from '../util/DOMUtils';\n\nconst BREAKING_SPACES = /[ \\f\\n\\r\\t\\v\\u2028\\u2029]+/;\n\ninterface WordWithComputedWidth {\n  word: string;\n  width: number;\n}\n\ninterface CalculatedWordWidths {\n  wordsWithComputedWidth: Array<WordWithComputedWidth>;\n  spaceWidth: number;\n}\n\nconst calculateWordWidths = (props: Props): CalculatedWordWidths => {\n  try {\n    const words = !_.isNil(props.children) ? props.children.toString().split(BREAKING_SPACES) : [];\n    const wordsWithComputedWidth = words.map(word => ({ word, width: getStringSize(word, props.style).width }));\n\n    const spaceWidth = getStringSize('\\u00A0', props.style).width;\n\n    return { wordsWithComputedWidth, spaceWidth };\n  } catch (e) {\n    return null;\n  }\n};\n\ninterface TextProps {\n  scaleToFit?: boolean;\n  angle?: number;\n  textAnchor?: 'start' | 'middle' | 'end' | 'inherit';\n  verticalAnchor?: 'start' | 'middle' | 'end';\n  style?: CSSProperties;\n  lineHeight?: number | string;\n}\n\nexport type Props = PresentationAttributes<SVGTextElement> & TextProps;\n\ninterface Words {\n  words: Array<string>;\n  width?: number;\n}\n\ninterface State {\n  wordsByLines: Array<Words>;\n}\n\nclass Text extends Component<Props, State> {\n  static defaultProps = {\n    x: 0,\n    y: 0,\n    lineHeight: '1em',\n    capHeight: '0.71em', // Magic number from d3\n    scaleToFit: false,\n    textAnchor: 'start',\n    verticalAnchor: 'end', // Maintain compat with existing charts / default SVG behavior\n  };\n\n  constructor(props: Props) {\n    super(props);\n    this.state = {\n      wordsByLines: this.getWordsByLines(props, true),\n    };\n  }\n\n  componentDidMount() {\n    this.updateWordsByLines(this.props, true);\n  }\n\n  componentDidUpdate(prevProps: Props) {\n    if (\n      prevProps.width !== this.props.width ||\n      prevProps.scaleToFit !== this.props.scaleToFit ||\n      prevProps.children !== this.props.children ||\n      prevProps.style !== this.props.style\n    ) {\n      const needCalculate = this.props.children !== prevProps.children || this.props.style !== prevProps.style;\n      this.updateWordsByLines(this.props, needCalculate);\n    }\n  }\n\n  updateWordsByLines(props: Props, needCalculate: boolean) {\n    this.setState({\n      wordsByLines: this.getWordsByLines(props, needCalculate),\n    });\n  }\n\n  getWordsByLines(props: Props, needCalculate: boolean) {\n    // Only perform calculations if using features that require them (multiline, scaleToFit)\n    if ((props.width || props.scaleToFit) && !Global.isSsr) {\n      let wordsWithComputedWidth: Array<WordWithComputedWidth>, spaceWidth: number;\n\n      if (needCalculate) {\n        const wordWidths = calculateWordWidths(props);\n\n        if (wordWidths) {\n          const { wordsWithComputedWidth: wcw, spaceWidth: sw } = wordWidths;\n\n          wordsWithComputedWidth = wcw;\n          spaceWidth = sw;\n        } else {\n          return this.getWordsWithoutCalculate(props);\n        }\n\n        return this.calculateWordsByLines(wordsWithComputedWidth, spaceWidth, props.width);\n      }\n    }\n    return this.getWordsWithoutCalculate(props);\n  }\n\n  getWordsWithoutCalculate = (props: Props): Array<Words> => {\n    const words = !_.isNil(props.children) ? props.children.toString().split(BREAKING_SPACES) : [];\n    return [{ words }];\n  };\n\n  calculateWordsByLines(\n    wordsWithComputedWidth: Array<WordWithComputedWidth>,\n    spaceWidth: number,\n    lineWidth: number | string,\n  ): Array<Words> {\n    const { scaleToFit } = this.props;\n    return (wordsWithComputedWidth || []).reduce((result, { word, width }) => {\n      const currentLine = result[result.length - 1];\n\n      if (currentLine && (lineWidth == null || scaleToFit || currentLine.width + width + spaceWidth < lineWidth)) {\n        // Word can be added to an existing line\n        currentLine.words.push(word);\n        currentLine.width += width + spaceWidth;\n      } else {\n        // Add first word to line or word is too long to scaleToFit on existing line\n        const newLine = { words: [word], width };\n        result.push(newLine);\n      }\n\n      return result;\n    }, []);\n  }\n\n  render() {\n    const {\n      dx,\n      dy,\n      textAnchor,\n      verticalAnchor,\n      scaleToFit,\n      angle,\n      lineHeight,\n      capHeight,\n      className,\n      ...textProps\n    } = this.props;\n    const { wordsByLines } = this.state;\n\n    if (!isNumOrStr(textProps.x) || !isNumOrStr(textProps.y)) {\n      return null;\n    }\n    const x = (textProps.x as number) + (isNumber(dx as number) ? (dx as number) : 0);\n    const y = (textProps.y as number) + (isNumber(dy as number) ? (dy as number) : 0);\n\n    let startDy: number;\n    switch (verticalAnchor) {\n      case 'start':\n        startDy = reduceCSSCalc(`calc(${capHeight})`);\n        break;\n      case 'middle':\n        startDy = reduceCSSCalc(`calc(${(wordsByLines.length - 1) / 2} * -${lineHeight} + (${capHeight} / 2))`);\n        break;\n      default:\n        startDy = reduceCSSCalc(`calc(${wordsByLines.length - 1} * -${lineHeight})`);\n        break;\n    }\n\n    const transforms = [];\n    if (scaleToFit) {\n      const lineWidth = wordsByLines[0].width;\n      const { width } = this.props;\n      transforms.push(`scale(${(isNumber(width as number) ? (width as number) / lineWidth : 1) / lineWidth})`);\n    }\n    if (angle) {\n      transforms.push(`rotate(${angle}, ${x}, ${y})`);\n    }\n    if (transforms.length) {\n      textProps.transform = transforms.join(' ');\n    }\n\n    return (\n      <text\n        {...filterProps(textProps, true)}\n        x={x}\n        y={y}\n        className={classNames('recharts-text', className)}\n        textAnchor={textAnchor}\n      >\n        {wordsByLines.map((line, index) => (\n          // eslint-disable-next-line react/no-array-index-key\n          <tspan x={x} dy={index === 0 ? startDy : lineHeight} key={index}>\n            {line.words.join(' ')}\n          </tspan>\n        ))}\n      </text>\n    );\n  }\n}\n\nexport default Text;\n","/**\n * @fileOverview Tooltip\n */\nimport React, { PureComponent, CSSProperties, ReactNode, ReactElement, ReactText } from 'react';\nimport { translateStyle } from 'react-smooth';\nimport _ from 'lodash';\nimport classNames from 'classnames';\nimport DefaultTooltipContent, { ValueType, NameType, Payload, Props as DefaultProps } from './DefaultTooltipContent';\n\nimport Global from '../util/Global';\nimport { isNumber } from '../util/DataUtils';\nimport { AnimationTiming } from '../util/types';\n\nconst CLS_PREFIX = 'recharts-tooltip-wrapper';\n\nconst EPS = 1;\nexport type ContentType<TValue extends ValueType, TName extends NameType> =\n  | ReactElement\n  | ((props: Props<TValue, TName>) => ReactNode);\n\ntype UniqueFunc<TValue extends ValueType, TName extends NameType> = (entry: Payload<TValue, TName>) => unknown;\ntype UniqueOption<TValue extends ValueType, TName extends NameType> = boolean | UniqueFunc<TValue, TName>;\nfunction defaultUniqBy<TValue extends ValueType, TName extends NameType>(entry: Payload<TValue, TName>) {\n  return entry.dataKey;\n}\nfunction getUniqPayload<TValue extends ValueType, TName extends NameType>(\n  option: UniqueOption<TValue, TName>,\n  payload: Array<Payload<TValue, TName>>,\n) {\n  if (option === true) {\n    return _.uniqBy(payload, defaultUniqBy);\n  }\n\n  if (_.isFunction(option)) {\n    return _.uniqBy(payload, option);\n  }\n\n  return payload;\n}\n\nfunction renderContent<TValue extends ValueType, TName extends NameType>(\n  content: ContentType<TValue, TName>,\n  props: Props<TValue, TName>,\n) {\n  if (React.isValidElement(content)) {\n    return React.cloneElement(content, props);\n  }\n  if (_.isFunction(content)) {\n    return React.createElement(content as any, props);\n  }\n\n  return <DefaultTooltipContent {...props} />;\n}\n\ntype Props<TValue extends ValueType, TName extends NameType> = DefaultProps<TValue, TName> & {\n  allowEscapeViewBox?: {\n    x?: boolean;\n    y?: boolean;\n  };\n  content?: ContentType<TValue, TName>;\n  viewBox?: {\n    x?: number;\n    y?: number;\n    width?: number;\n    height?: number;\n  };\n  active?: boolean;\n  offset?: number;\n  wrapperStyle?: CSSProperties;\n  cursor?:\n    | boolean\n    | ReactElement\n    | {\n        strokeDasharray: ReactText;\n        stroke?: string;\n      };\n  coordinate?: {\n    x?: number;\n    y?: number;\n  };\n  position?: {\n    x?: number;\n    y?: number;\n  };\n  trigger?: 'hover' | 'click';\n  payloadUniqBy?: UniqueOption<TValue, TName>;\n  isAnimationActive?: boolean;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n  filterNull?: boolean;\n  useTranslate3d?: boolean;\n};\n\nclass Tooltip<TValue extends ValueType, TName extends NameType> extends PureComponent<Props<TValue, TName>> {\n  static displayName = 'Tooltip';\n\n  static defaultProps = {\n    active: false,\n    allowEscapeViewBox: { x: false, y: false },\n    offset: 10,\n    viewBox: { x1: 0, x2: 0, y1: 0, y2: 0 },\n    coordinate: { x: 0, y: 0 },\n    cursorStyle: {},\n    separator: ' : ',\n    wrapperStyle: {},\n    contentStyle: {},\n    itemStyle: {},\n    labelStyle: {},\n    cursor: true,\n    trigger: 'hover',\n    isAnimationActive: !Global.isSsr,\n    animationEasing: 'ease',\n    animationDuration: 400,\n    filterNull: true,\n    useTranslate3d: false,\n  };\n\n  state = {\n    boxWidth: -1,\n    boxHeight: -1,\n  };\n\n  private wrapperNode: HTMLDivElement;\n\n  componentDidMount() {\n    this.updateBBox();\n  }\n\n  componentDidUpdate() {\n    this.updateBBox();\n  }\n\n  updateBBox() {\n    const { boxWidth, boxHeight } = this.state;\n\n    if (this.wrapperNode && this.wrapperNode.getBoundingClientRect) {\n      const box = this.wrapperNode.getBoundingClientRect();\n\n      if (Math.abs(box.width - boxWidth) > EPS || Math.abs(box.height - boxHeight) > EPS) {\n        this.setState({\n          boxWidth: box.width,\n          boxHeight: box.height,\n        });\n      }\n    } else if (boxWidth !== -1 || boxHeight !== -1) {\n      this.setState({\n        boxWidth: -1,\n        boxHeight: -1,\n      });\n    }\n  }\n\n  getTranslate = ({\n    key,\n    tooltipDimension,\n    viewBoxDimension,\n  }: {\n    key: 'x' | 'y';\n    tooltipDimension: number;\n    viewBoxDimension: number;\n  }) => {\n    const { allowEscapeViewBox, coordinate, offset, position, viewBox } = this.props;\n\n    if (position && isNumber(position[key])) {\n      return position[key];\n    }\n\n    const restricted = coordinate[key] - tooltipDimension - offset;\n    const unrestricted = coordinate[key] + offset;\n    if (allowEscapeViewBox[key]) {\n      return unrestricted;\n    }\n\n    const tooltipBoundary = coordinate[key] + tooltipDimension + offset;\n    const viewBoxBoundary = viewBox[key] + viewBoxDimension;\n    if (tooltipBoundary > viewBoxBoundary) {\n      return Math.max(restricted, viewBox[key]);\n    }\n    return Math.max(unrestricted, viewBox[key]);\n  };\n\n  render() {\n    const { payload, isAnimationActive, animationDuration, animationEasing, filterNull, payloadUniqBy } = this.props;\n    const finalPayload = getUniqPayload(\n      payloadUniqBy,\n      filterNull && payload && payload.length ? payload.filter(entry => !_.isNil(entry.value)) : payload,\n    );\n    const hasPayload = finalPayload && finalPayload.length;\n    const { content, viewBox, coordinate, position, active, wrapperStyle } = this.props;\n    let outerStyle: CSSProperties = {\n      pointerEvents: 'none',\n      visibility: active && hasPayload ? 'visible' : 'hidden',\n      position: 'absolute',\n      top: 0,\n      left: 0,\n      ...wrapperStyle,\n    };\n    let translateX, translateY;\n\n    if (position && isNumber(position.x) && isNumber(position.y)) {\n      translateX = position.x;\n      translateY = position.y;\n    } else {\n      const { boxWidth, boxHeight } = this.state;\n\n      if (boxWidth > 0 && boxHeight > 0 && coordinate) {\n        translateX = this.getTranslate({\n          key: 'x',\n          tooltipDimension: boxWidth,\n          viewBoxDimension: viewBox.width,\n        });\n\n        translateY = this.getTranslate({\n          key: 'y',\n          tooltipDimension: boxHeight,\n          viewBoxDimension: viewBox.height,\n        });\n      } else {\n        outerStyle.visibility = 'hidden';\n      }\n    }\n\n    outerStyle = {\n      ...translateStyle({\n        transform: this.props.useTranslate3d\n          ? `translate3d(${translateX}px, ${translateY}px, 0)`\n          : `translate(${translateX}px, ${translateY}px)`,\n      }),\n      ...outerStyle,\n    };\n\n    if (isAnimationActive && active) {\n      outerStyle = {\n        ...translateStyle({\n          transition: `transform ${animationDuration}ms ${animationEasing}`,\n        }),\n        ...outerStyle,\n      };\n    }\n\n    const cls = classNames(CLS_PREFIX, {\n      [`${CLS_PREFIX}-right`]:\n        isNumber(translateX) && coordinate && isNumber(coordinate.x) && translateX >= coordinate.x,\n      [`${CLS_PREFIX}-left`]: isNumber(translateX) && coordinate && isNumber(coordinate.x) && translateX < coordinate.x,\n      [`${CLS_PREFIX}-bottom`]:\n        isNumber(translateY) && coordinate && isNumber(coordinate.y) && translateY >= coordinate.y,\n      [`${CLS_PREFIX}-top`]: isNumber(translateY) && coordinate && isNumber(coordinate.y) && translateY < coordinate.y,\n    });\n\n    return (\n      <div\n        className={cls}\n        style={outerStyle}\n        ref={node => {\n          this.wrapperNode = node;\n        }}\n      >\n        {renderContent(content, { ...this.props, payload: finalPayload })}\n      </div>\n    );\n  }\n}\n\nexport default Tooltip;\n","/**\n * @fileOverview Layer\n */\nimport React, { ReactNode, SVGProps } from 'react';\nimport classNames from 'classnames';\nimport { filterProps } from '../util/types';\n\ninterface LayerProps {\n  className?: string;\n  children?: ReactNode;\n}\n\ntype Props = SVGProps<SVGGElement> & LayerProps;\n\nfunction Layer(props: Props) {\n  const { children, className, ...others } = props;\n  const layerClass = classNames('recharts-layer', className);\n\n  return (\n    <g className={layerClass} {...filterProps(others, true)}>\n      {children}\n    </g>\n  );\n}\n\nexport default Layer;\n","/**\n * @fileOverview Surface\n */\nimport React, { ReactNode, CSSProperties } from 'react';\nimport classNames from 'classnames';\nimport { PresentationAttributes, filterProps } from '../util/types';\n\ninterface SurfaceProps {\n  width: number;\n  height: number;\n  viewBox?: {\n    x?: number;\n    y?: number;\n    width?: number;\n    height?: number;\n  };\n  className?: string;\n  style?: CSSProperties;\n  children?: ReactNode;\n}\n\ntype Props = Omit<PresentationAttributes<SVGSVGElement>, 'viewBox'> & SurfaceProps;\n\nfunction Surface(props: Props) {\n  const { children, width, height, viewBox, className, style, ...others } = props;\n  const svgView = viewBox || { width, height, x: 0, y: 0 };\n  const layerClass = classNames('recharts-surface', className);\n\n  return (\n    <svg\n      {...filterProps(others, true, true)}\n      className={layerClass}\n      width={width}\n      height={height}\n      style={style}\n      viewBox={`${svgView.x} ${svgView.y} ${svgView.width} ${svgView.height}`}\n      version=\"1.1\"\n    >\n      {children}\n    </svg>\n  );\n}\n\nexport default Surface;\n","import './polyfill';\n\nexport { default as Surface } from './container/Surface';\nexport { default as Layer } from './container/Layer';\n\nexport { default as Legend } from './component/Legend';\nexport { default as Tooltip } from './component/Tooltip';\nexport { default as ResponsiveContainer } from './component/ResponsiveContainer';\nexport { default as Cell } from './component/Cell';\nexport { default as Text } from './component/Text';\nexport { default as Label } from './component/Label';\nexport { default as LabelList } from './component/LabelList';\nexport { default as Customized } from './component/Customized';\n\nexport { default as Sector } from './shape/Sector';\nexport { default as Curve } from './shape/Curve';\nexport { default as Rectangle } from './shape/Rectangle';\nexport { default as Polygon } from './shape/Polygon';\nexport { default as Dot } from './shape/Dot';\nexport { default as Cross } from './shape/Cross';\nexport { default as Symbols } from './shape/Symbols';\n\nexport { default as PolarGrid } from './polar/PolarGrid';\nexport { default as PolarRadiusAxis } from './polar/PolarRadiusAxis';\nexport { default as PolarAngleAxis } from './polar/PolarAngleAxis';\nexport { default as Pie } from './polar/Pie';\nexport { default as Radar } from './polar/Radar';\nexport { default as RadialBar } from './polar/RadialBar';\n\nexport { default as Brush } from './cartesian/Brush';\nexport { default as ReferenceLine } from './cartesian/ReferenceLine';\nexport { default as ReferenceDot } from './cartesian/ReferenceDot';\nexport { default as ReferenceArea } from './cartesian/ReferenceArea';\nexport { default as CartesianAxis } from './cartesian/CartesianAxis';\nexport { default as CartesianGrid } from './cartesian/CartesianGrid';\nexport { default as Line } from './cartesian/Line';\nexport { default as Area } from './cartesian/Area';\nexport { default as Bar } from './cartesian/Bar';\nexport { default as Scatter } from './cartesian/Scatter';\nexport { default as XAxis } from './cartesian/XAxis';\nexport { default as YAxis } from './cartesian/YAxis';\nexport { default as ZAxis } from './cartesian/ZAxis';\nexport { default as ErrorBar } from './cartesian/ErrorBar';\n\nexport { default as LineChart } from './chart/LineChart';\nexport { default as BarChart } from './chart/BarChart';\nexport { default as PieChart } from './chart/PieChart';\nexport { default as Treemap } from './chart/Treemap';\nexport { default as Sankey } from './chart/Sankey';\nexport { default as RadarChart } from './chart/RadarChart';\nexport { default as ScatterChart } from './chart/ScatterChart';\nexport { default as AreaChart } from './chart/AreaChart';\nexport { default as RadialBarChart } from './chart/RadialBarChart';\nexport { default as ComposedChart } from './chart/ComposedChart';\n\nexport { default as Funnel } from './numberAxis/Funnel';\nexport { default as FunnelChart } from './chart/FunnelChart';\nexport { default as Trapezoid } from './shape/Trapezoid';\n\nexport { default as Global } from './util/Global';\n","/**\n * @fileOverview Render sectors of a funnel\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport Animate from 'react-smooth';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Layer from '../container/Layer';\nimport Trapezoid, { Props as TrapezoidProps } from '../shape/Trapezoid';\nimport LabelList from '../component/LabelList';\nimport Cell, { Props as CellProps } from '../component/Cell';\nimport { findAllByType } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport { interpolateNumber } from '../util/DataUtils';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport {\n  LegendType,\n  TooltipType,\n  AnimationTiming,\n  ChartOffset,\n  PresentationAttributes,\n  DataKey,\n  filterProps,\n  adaptEventsOfChild,\n} from '../util/types';\n\ninterface FunnelTrapezoidItem extends TrapezoidProps {\n  value?: number | string;\n  payload?: any;\n}\n\ninterface InternalFunnelProps {\n  trapezoids?: FunnelTrapezoidItem[];\n  animationId?: number;\n}\n\ninterface FunnelProps extends InternalFunnelProps {\n  className?: string;\n  dataKey: DataKey<any>;\n  nameKey?: DataKey<any>;\n  data?: any[];\n  hide?: boolean;\n  activeShape: ReactElement<SVGElement> | ((props: any) => SVGElement) | TrapezoidProps;\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  activeIndex?: number | number[];\n\n  onAnimationStart?: () => void;\n  onAnimationEnd?: () => void;\n\n  isAnimationActive?: boolean;\n  animateNewValues?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n  id?: string;\n}\n\ntype Props = TrapezoidProps & FunnelProps;\n\ninterface State {\n  readonly prevTrapezoids?: FunnelTrapezoidItem[];\n  readonly isAnimationFinished?: boolean;\n}\n\nclass Funnel extends PureComponent<Props, State> {\n  static displayName = 'Funnel';\n\n  static defaultProps = {\n    stroke: '#fff',\n    fill: '#808080',\n    legendType: 'rect',\n    labelLine: true,\n    hide: false,\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 400,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n    nameKey: 'name',\n  };\n\n  static getRealFunnelData = (item: Funnel) => {\n    const { data, children } = item.props;\n    const presentationProps = filterProps(item.props);\n    const cells = findAllByType(children, Cell.displayName);\n\n    if (data && data.length) {\n      return data.map((entry, index) => ({\n        payload: entry,\n        ...presentationProps,\n        ...entry,\n        ...(cells && cells[index] && cells[index].props),\n      }));\n    }\n\n    if (cells && cells.length) {\n      return cells.map((cell: ReactElement<CellProps>) => ({ ...presentationProps, ...cell.props }));\n    }\n\n    return [];\n  };\n\n  static getRealWidthHeight = (item: Funnel, offset: ChartOffset) => {\n    const customWidth = item.props.width;\n    const { width, height, left, right, top, bottom } = offset;\n    const realHeight = height;\n    let realWidth = width;\n\n    if (_.isNumber(customWidth)) {\n      realWidth = customWidth;\n    } else if (_.isString(customWidth)) {\n      realWidth = (realWidth * parseFloat(customWidth)) / 100;\n    }\n\n    return {\n      realWidth: realWidth - left - right - 50,\n      realHeight: realHeight - bottom - top,\n      offsetX: (width - realWidth) / 2,\n      offsetY: (height - realHeight) / 2,\n    };\n  };\n\n  static getComposedData = ({\n    item,\n    offset,\n    onItemMouseLeave,\n    onItemMouseEnter,\n    onItemClick,\n  }: {\n    item: Funnel;\n    offset: ChartOffset;\n    onItemMouseLeave?: PresentationAttributes<SVGElement>['onMouseLeave'];\n    onItemMouseEnter?: PresentationAttributes<SVGElement>['onMouseEnter'];\n    onItemClick?: PresentationAttributes<SVGElement>['onClick'];\n  }) => {\n    const funnelData = Funnel.getRealFunnelData(item);\n    const { dataKey, nameKey, tooltipType } = item.props;\n    const { left, top } = offset;\n    const { realHeight, realWidth, offsetX, offsetY } = Funnel.getRealWidthHeight(item, offset);\n    const maxValue = getValueByDataKey(funnelData[0], dataKey, 0);\n    const len = funnelData.length;\n    const rowHeight = realHeight / len;\n\n    const trapezoids = funnelData.map((entry: any, i: number) => {\n      const val = getValueByDataKey(entry, dataKey, 0);\n      const name = getValueByDataKey(entry, nameKey, i);\n      let nextVal = 0;\n      if (i !== len - 1) {\n        nextVal = getValueByDataKey(funnelData[i + 1], dataKey, 0);\n      }\n\n      const x = ((maxValue - val) * realWidth) / (2 * maxValue) + top + 25 + offsetX;\n      const y = (realHeight / len) * i + left + offsetY;\n      const upperWidth = (val / maxValue) * realWidth;\n      const lowerWidth = (nextVal / maxValue) * realWidth;\n\n      const tooltipPayload = [{ name, value: val, payload: entry, dataKey, type: tooltipType }];\n      const tooltipPosition = {\n        x: x + upperWidth / 2,\n        y: y + rowHeight / 2,\n      };\n\n      return {\n        x,\n        y,\n        width: Math.max(upperWidth, lowerWidth),\n        upperWidth,\n        lowerWidth,\n        height: rowHeight,\n        name,\n        val,\n        tooltipPayload,\n        tooltipPosition,\n        ..._.omit(entry, 'width'),\n        payload: entry,\n      };\n    });\n\n    return {\n      trapezoids,\n      data: funnelData,\n      onMouseLeave: _.isFunction(onItemMouseLeave) ? onItemMouseLeave : item.props.onMouseLeave,\n      onMouseEnter: _.isFunction(onItemMouseEnter) ? onItemMouseEnter : item.props.onMouseEnter,\n      onClick: _.isFunction(onItemClick) ? onItemClick : item.props.onClick,\n    };\n  };\n\n  state: State = { isAnimationFinished: false };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, trapezoids } = this.props;\n\n    if (nextProps.isAnimationActive !== this.props.isAnimationActive) {\n      this.cachePrevData([]);\n    } else if (nextProps.animationId !== animationId) {\n      this.cachePrevData(trapezoids);\n    }\n  }\n\n  cachePrevData = (trapezoids: FunnelTrapezoidItem[]) => {\n    this.setState({ prevTrapezoids: trapezoids });\n  };\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n    this.setState({ isAnimationFinished: true });\n\n    if (_.isFunction(onAnimationEnd)) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n    this.setState({ isAnimationFinished: false });\n\n    if (_.isFunction(onAnimationStart)) {\n      onAnimationStart();\n    }\n  };\n\n  isActiveIndex(i: number) {\n    const { activeIndex } = this.props;\n\n    if (Array.isArray(activeIndex)) {\n      return activeIndex.indexOf(i) !== -1;\n    }\n\n    return i === activeIndex;\n  }\n\n  static renderTrapezoidItem(option: Props['activeShape'], props: any) {\n    if (React.isValidElement(option)) {\n      return React.cloneElement(option, props);\n    }\n    if (_.isFunction(option)) {\n      return option(props);\n    }\n    if (_.isPlainObject(option)) {\n      return <Trapezoid {...props} {...option} />;\n    }\n\n    return <Trapezoid {...props} />;\n  }\n\n  renderTrapezoidsStatically(trapezoids: FunnelTrapezoidItem[]) {\n    const { activeShape } = this.props;\n\n    return trapezoids.map((entry, i) => {\n      const trapezoidOptions = this.isActiveIndex(i) ? activeShape : null;\n      const trapezoidProps = {\n        ...entry,\n        stroke: entry.stroke,\n      };\n\n      return (\n        <Layer\n          className=\"recharts-funnel-trapezoid\"\n          {...adaptEventsOfChild(this.props, entry, i)}\n          key={`trapezoid-${i}`} // eslint-disable-line react/no-array-index-key\n        >\n          {Funnel.renderTrapezoidItem(trapezoidOptions, trapezoidProps)}\n        </Layer>\n      );\n    });\n  }\n\n  renderTrapezoidsWithAnimation() {\n    const {\n      trapezoids,\n      isAnimationActive,\n      animationBegin,\n      animationDuration,\n      animationEasing,\n      animationId,\n    } = this.props;\n    const { prevTrapezoids } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`funnel-${animationId}`}\n        onAnimationStart={this.handleAnimationStart}\n        onAnimationEnd={this.handleAnimationEnd}\n      >\n        {({ t }: { t: number }) => {\n          const stepData = trapezoids.map((entry, index) => {\n            const prev = prevTrapezoids && prevTrapezoids[index];\n\n            if (prev) {\n              const interpolatorX = interpolateNumber(prev.x, entry.x);\n              const interpolatorY = interpolateNumber(prev.y, entry.y);\n              const interpolatorUpperWidth = interpolateNumber(prev.upperWidth, entry.upperWidth);\n              const interpolatorLowerWidth = interpolateNumber(prev.lowerWidth, entry.lowerWidth);\n              const interpolatorHeight = interpolateNumber(prev.height, entry.height);\n\n              return {\n                ...entry,\n                x: interpolatorX(t),\n                y: interpolatorY(t),\n                upperWidth: interpolatorUpperWidth(t),\n                lowerWidth: interpolatorLowerWidth(t),\n                height: interpolatorHeight(t),\n              };\n            }\n\n            const interpolatorX = interpolateNumber(entry.x + entry.upperWidth / 2, entry.x);\n            const interpolatorY = interpolateNumber(entry.y + entry.height / 2, entry.y);\n            const interpolatorUpperWidth = interpolateNumber(0, entry.upperWidth);\n            const interpolatorLowerWidth = interpolateNumber(0, entry.lowerWidth);\n            const interpolatorHeight = interpolateNumber(0, entry.height);\n\n            return {\n              ...entry,\n              x: interpolatorX(t),\n              y: interpolatorY(t),\n              upperWidth: interpolatorUpperWidth(t),\n              lowerWidth: interpolatorLowerWidth(t),\n              height: interpolatorHeight(t),\n            };\n          });\n          return <Layer>{this.renderTrapezoidsStatically(stepData)}</Layer>;\n        }}\n      </Animate>\n    );\n  }\n\n  renderTrapezoids() {\n    const { trapezoids, isAnimationActive } = this.props;\n    const { prevTrapezoids } = this.state;\n\n    if (\n      isAnimationActive &&\n      trapezoids &&\n      trapezoids.length &&\n      (!prevTrapezoids || !_.isEqual(prevTrapezoids, trapezoids))\n    ) {\n      return this.renderTrapezoidsWithAnimation();\n    }\n    return this.renderTrapezoidsStatically(trapezoids);\n  }\n\n  render() {\n    const { hide, trapezoids, className, isAnimationActive } = this.props;\n    const { isAnimationFinished } = this.state;\n\n    if (hide || !trapezoids || !trapezoids.length) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-trapezoids', className);\n\n    return (\n      <Layer className={layerClass}>\n        {this.renderTrapezoids()}\n        {(!isAnimationActive || isAnimationFinished) && LabelList.renderCallByParent(this.props, trapezoids)}\n      </Layer>\n    );\n  }\n}\n\nexport default Funnel;\n","/**\n * @fileOverview Render sectors of a pie\n */\nimport React, { PureComponent, ReactElement } from 'react';\nimport Animate from 'react-smooth';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport Layer from '../container/Layer';\nimport Sector, { Props as SectorProps } from '../shape/Sector';\nimport Curve from '../shape/Curve';\nimport Text from '../component/Text';\nimport Label from '../component/Label';\nimport LabelList from '../component/LabelList';\nimport Cell, { Props as CellProps } from '../component/Cell';\nimport { findAllByType } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport { polarToCartesian, getMaxRadius } from '../util/PolarUtils';\nimport { isNumber, getPercentValue, mathSign, interpolateNumber, uniqueId } from '../util/DataUtils';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport { warn } from '../util/LogUtils';\nimport {\n  LegendType,\n  TooltipType,\n  AnimationTiming,\n  PresentationAttributes,\n  filterProps,\n  Coordinate,\n  ChartOffset,\n  DataKey,\n  adaptEventsOfChild,\n} from '../util/types';\n\ninterface PieDef {\n  /** The abscissa of pole in polar coordinate  */\n  cx?: number | string;\n  /** The ordinate of pole in polar coordinate  */\n  cy?: number | string;\n  /** The start angle of first sector */\n  startAngle?: number;\n  /** The end angle of last sector */\n  endAngle?: number;\n  paddingAngle?: number;\n  /** The inner radius of sectors */\n  innerRadius?: number | string;\n  /** The outer radius of sectors */\n  outerRadius?: number | string;\n  cornerRadius?: number | string;\n}\n\ntype PieActiveShape = ReactElement<SVGElement> | ((props: any) => SVGElement) | SectorProps;\ntype PieLabelLine =\n  | ReactElement<SVGElement>\n  | ((props: any) => SVGElement)\n  | PresentationAttributes<SVGPathElement>\n  | boolean;\ntype Pielabel = ReactElement<SVGElement> | ((props: any) => SVGElement) | { offsetRadius: number } | boolean;\ntype PieSectorDataItem = SectorProps & {\n  percent?: number;\n  name?: string | number;\n  midAngle?: number;\n  middleRadius?: number;\n  tooltipPosition?: Coordinate;\n  value?: number;\n  paddingAngle?: number;\n};\n\ninterface PieProps extends PieDef {\n  className?: string;\n  animationId?: number;\n  dataKey: DataKey<any>;\n  nameKey?: DataKey<any>;\n  valueKey?: DataKey<any>;\n  /** Match each sector's stroke color to it's fill color */\n  blendStroke?: boolean;\n  /** The minimum angle for no-zero element */\n  minAngle?: number;\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  /** the max radius of pie */\n  maxRadius?: number;\n  hide?: boolean;\n  /** the input data */\n  data?: any[];\n  sectors?: PieSectorDataItem[];\n  activeShape?: PieActiveShape;\n  labelLine?: PieLabelLine;\n  label?: Pielabel;\n\n  activeIndex?: number | number[];\n  animationEasing?: AnimationTiming;\n  isAnimationActive?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  onAnimationEnd?: () => void;\n  onAnimationStart?: () => void;\n  id?: string;\n}\n\ninterface State {\n  isAnimationFinished?: boolean;\n  prevSectors?: PieSectorDataItem[];\n}\n\ntype Props = PresentationAttributes<SVGElement> & PieProps;\n\nclass Pie extends PureComponent<Props, State> {\n  static displayName = 'Pie';\n\n  static defaultProps = {\n    stroke: '#fff',\n    fill: '#808080',\n    legendType: 'rect',\n    cx: '50%',\n    cy: '50%',\n    startAngle: 0,\n    endAngle: 360,\n    innerRadius: 0,\n    outerRadius: '80%',\n    paddingAngle: 0,\n    labelLine: true,\n    hide: false,\n    minAngle: 0,\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 400,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n    nameKey: 'name',\n    blendStroke: false,\n  };\n\n  static parseDeltaAngle = (startAngle: number, endAngle: number) => {\n    const sign = mathSign(endAngle - startAngle);\n    const deltaAngle = Math.min(Math.abs(endAngle - startAngle), 360);\n\n    return sign * deltaAngle;\n  };\n\n  static getRealPieData = (item: Pie) => {\n    const { data, children } = item.props;\n    const presentationProps = filterProps(item.props);\n    const cells = findAllByType(children, Cell.displayName);\n\n    if (data && data.length) {\n      return data.map((entry, index) => ({\n        payload: entry,\n        ...presentationProps,\n        ...entry,\n        ...(cells && cells[index] && cells[index].props),\n      }));\n    }\n\n    if (cells && cells.length) {\n      return cells.map((cell: ReactElement<CellProps>) => ({ ...presentationProps, ...cell.props }));\n    }\n\n    return [];\n  };\n\n  static parseCoordinateOfPie = (item: Pie, offset: ChartOffset) => {\n    const { top, left, width, height } = offset;\n    const maxPieRadius = getMaxRadius(width, height);\n    const cx = left + getPercentValue(item.props.cx, width, width / 2);\n    const cy = top + getPercentValue(item.props.cy, height, height / 2);\n    const innerRadius = getPercentValue(item.props.innerRadius, maxPieRadius, 0);\n    const outerRadius = getPercentValue(item.props.outerRadius, maxPieRadius, maxPieRadius * 0.8);\n    const maxRadius = item.props.maxRadius || Math.sqrt(width * width + height * height) / 2;\n\n    return { cx, cy, innerRadius, outerRadius, maxRadius };\n  };\n\n  static getComposedData = ({\n    item,\n    offset,\n    onItemMouseLeave,\n    onItemMouseEnter,\n    onItemClick,\n  }: {\n    item: Pie;\n    offset: ChartOffset;\n    onItemMouseLeave?: (event: React.MouseEvent<SVGElement, MouseEvent>) => void;\n    onItemMouseEnter?: (event: React.MouseEvent<SVGElement, MouseEvent>) => void;\n    onItemClick?: (event: React.MouseEvent<SVGElement, MouseEvent>) => void;\n  }): Omit<Props, 'dataKey'> => {\n    const pieData = Pie.getRealPieData(item);\n    if (!pieData || !pieData.length) {\n      return null;\n    }\n\n    const { cornerRadius, startAngle, endAngle, paddingAngle, dataKey, nameKey, valueKey, tooltipType } = item.props;\n    const minAngle = Math.abs(item.props.minAngle);\n    const coordinate = Pie.parseCoordinateOfPie(item, offset);\n    const len = pieData.length;\n    const deltaAngle = Pie.parseDeltaAngle(startAngle, endAngle);\n    const absDeltaAngle = Math.abs(deltaAngle);\n    const totalPadingAngle = (absDeltaAngle >= 360 ? len : len - 1) * paddingAngle;\n    const realTotalAngle = absDeltaAngle - len * minAngle - totalPadingAngle;\n    let realDataKey = dataKey;\n\n    if (_.isNil(dataKey) && _.isNil(valueKey)) {\n      warn(\n        false,\n        `Use \"dataKey\" to specify the value of pie,\n      the props \"valueKey\" will be deprecated in 1.1.0`,\n      );\n      realDataKey = 'value';\n    } else if (_.isNil(dataKey)) {\n      warn(\n        false,\n        `Use \"dataKey\" to specify the value of pie,\n      the props \"valueKey\" will be deprecated in 1.1.0`,\n      );\n      realDataKey = valueKey;\n    }\n\n    const sum = pieData.reduce((result: number, entry: any) => {\n      const val = getValueByDataKey(entry, realDataKey, 0);\n      return result + (isNumber(val) ? val : 0);\n    }, 0);\n    let sectors;\n\n    if (sum > 0) {\n      let prev: PieSectorDataItem;\n      sectors = pieData.map((entry: any, i: number) => {\n        const val = getValueByDataKey(entry, realDataKey, 0);\n        const name = getValueByDataKey(entry, nameKey, i);\n        const percent = (isNumber(val) ? val : 0) / sum;\n        let tempStartAngle;\n\n        if (i) {\n          tempStartAngle = prev.endAngle + mathSign(deltaAngle) * paddingAngle;\n        } else {\n          tempStartAngle = startAngle;\n        }\n\n        const tempEndAngle = tempStartAngle + mathSign(deltaAngle) * (minAngle + percent * realTotalAngle);\n        const midAngle = (tempStartAngle + tempEndAngle) / 2;\n        const middleRadius = (coordinate.innerRadius + coordinate.outerRadius) / 2;\n        const tooltipPayload = [\n          {\n            name,\n            value: val,\n            payload: entry,\n            dataKey: realDataKey,\n            type: tooltipType,\n          },\n        ];\n        const tooltipPosition = polarToCartesian(coordinate.cx, coordinate.cy, middleRadius, midAngle);\n\n        prev = {\n          percent,\n          cornerRadius,\n          name,\n          tooltipPayload,\n          midAngle,\n          middleRadius,\n          tooltipPosition,\n          ...entry,\n          ...coordinate,\n          value: getValueByDataKey(entry, realDataKey),\n          startAngle: tempStartAngle,\n          endAngle: tempEndAngle,\n          payload: entry,\n          paddingAngle: mathSign(deltaAngle) * paddingAngle,\n        };\n\n        return prev;\n      });\n    }\n\n    return {\n      ...coordinate,\n      sectors,\n      data: pieData,\n      onMouseLeave: _.isFunction(onItemMouseLeave) ? onItemMouseLeave : item.props.onMouseLeave,\n      onMouseEnter: _.isFunction(onItemMouseEnter) ? onItemMouseEnter : item.props.onMouseEnter,\n      onClick: _.isFunction(onItemClick) ? onItemClick : item.props.onClick,\n    };\n  };\n\n  state: State = { isAnimationFinished: false };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, sectors } = this.props;\n\n    if (nextProps.isAnimationActive !== this.props.isAnimationActive) {\n      this.cachePrevData([]);\n    } else if (nextProps.animationId !== animationId) {\n      this.cachePrevData(sectors);\n    }\n  }\n\n  static getTextAnchor(x: number, cx: number) {\n    if (x > cx) {\n      return 'start';\n    }\n    if (x < cx) {\n      return 'end';\n    }\n\n    return 'middle';\n  }\n\n  id = uniqueId('recharts-pie-');\n\n  cachePrevData = (sectors: PieSectorDataItem[]) => {\n    this.setState({ prevSectors: sectors });\n  };\n\n  isActiveIndex(i: number) {\n    const { activeIndex } = this.props;\n\n    if (Array.isArray(activeIndex)) {\n      return activeIndex.indexOf(i) !== -1;\n    }\n\n    return i === activeIndex;\n  }\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n\n    this.setState({\n      isAnimationFinished: true,\n    });\n\n    if (_.isFunction(onAnimationEnd)) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n\n    this.setState({\n      isAnimationFinished: false,\n    });\n\n    if (_.isFunction(onAnimationStart)) {\n      onAnimationStart();\n    }\n  };\n\n  static renderLabelLineItem(option: PieLabelLine, props: any) {\n    if (React.isValidElement(option)) {\n      return React.cloneElement(option, props);\n    }\n    if (_.isFunction(option)) {\n      return option(props);\n    }\n\n    return <Curve {...props} type=\"linear\" className=\"recharts-pie-label-line\" />;\n  }\n\n  static renderLabelItem(option: Pielabel, props: any, value: any) {\n    if (React.isValidElement(option)) {\n      return React.cloneElement(option, props);\n    }\n    let label = value;\n    if (_.isFunction(option)) {\n      label = option(props);\n      if (React.isValidElement(label)) {\n        return label;\n      }\n    }\n\n    return (\n      <Text {...props} alignmentBaseline=\"middle\" className=\"recharts-pie-label-text\">\n        {label}\n      </Text>\n    );\n  }\n\n  renderLabels(sectors: PieSectorDataItem[]) {\n    const { isAnimationActive } = this.props;\n\n    if (isAnimationActive && !this.state.isAnimationFinished) {\n      return null;\n    }\n    const { label, labelLine, dataKey, valueKey } = this.props;\n    const pieProps = filterProps(this.props);\n    const customLabelProps = filterProps(label);\n    const customLabelLineProps = filterProps(labelLine);\n    const offsetRadius = (label && (label as any).offsetRadius) || 20;\n\n    const labels = sectors.map((entry, i) => {\n      const midAngle = (entry.startAngle + entry.endAngle) / 2;\n      const endPoint = polarToCartesian(entry.cx, entry.cy, entry.outerRadius + offsetRadius, midAngle);\n      const labelProps = {\n        ...pieProps,\n        ...entry,\n        stroke: 'none',\n        ...customLabelProps,\n        index: i,\n        textAnchor: Pie.getTextAnchor(endPoint.x, entry.cx),\n        ...endPoint,\n      };\n      const lineProps = {\n        ...pieProps,\n        ...entry,\n        fill: 'none',\n        stroke: entry.fill,\n        ...customLabelLineProps,\n        index: i,\n        points: [polarToCartesian(entry.cx, entry.cy, entry.outerRadius, midAngle), endPoint],\n        key: 'line',\n      };\n      let realDataKey = dataKey;\n      // TODO: compatible to lower versions\n      if (_.isNil(dataKey) && _.isNil(valueKey)) {\n        realDataKey = 'value';\n      } else if (_.isNil(dataKey)) {\n        realDataKey = valueKey;\n      }\n\n      return (\n        // eslint-disable-next-line react/no-array-index-key\n        <Layer key={`label-${i}`}>\n          {labelLine && Pie.renderLabelLineItem(labelLine, lineProps)}\n          {Pie.renderLabelItem(label, labelProps, getValueByDataKey(entry, realDataKey))}\n        </Layer>\n      );\n    });\n\n    return <Layer className=\"recharts-pie-labels\">{labels}</Layer>;\n  }\n\n  static renderSectorItem(option: PieActiveShape, props: any) {\n    if (React.isValidElement(option)) {\n      return React.cloneElement(option, props);\n    }\n    if (_.isFunction(option)) {\n      return option(props);\n    }\n    if (_.isPlainObject(option)) {\n      return <Sector {...props} {...option} />;\n    }\n\n    return <Sector {...props} />;\n  }\n\n  renderSectorsStatically(sectors: PieSectorDataItem[]) {\n    const { activeShape, blendStroke } = this.props;\n\n    return sectors.map((entry, i) => {\n      const sectorOptions = this.isActiveIndex(i) ? activeShape : null;\n      const sectorProps = {\n        ...entry,\n        stroke: blendStroke ? entry.fill : entry.stroke,\n      };\n\n      return (\n        <Layer\n          className=\"recharts-pie-sector\"\n          {...adaptEventsOfChild(this.props, entry, i)}\n          key={`sector-${i}`} // eslint-disable-line react/no-array-index-key\n        >\n          {Pie.renderSectorItem(sectorOptions, sectorProps)}\n        </Layer>\n      );\n    });\n  }\n\n  renderSectorsWithAnimation() {\n    const { sectors, isAnimationActive, animationBegin, animationDuration, animationEasing, animationId } = this.props;\n    const { prevSectors } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`pie-${animationId}`}\n        onAnimationStart={this.handleAnimationStart}\n        onAnimationEnd={this.handleAnimationEnd}\n      >\n        {({ t }: { t: number }) => {\n          const stepData: PieSectorDataItem[] = [];\n          const first = sectors && sectors[0];\n          let curAngle = first.startAngle;\n\n          sectors.forEach((entry, index) => {\n            const prev = prevSectors && prevSectors[index];\n            const paddingAngle = index > 0 ? _.get(entry, 'paddingAngle', 0) : 0;\n\n            if (prev) {\n              const angleIp = interpolateNumber(prev.endAngle - prev.startAngle, entry.endAngle - entry.startAngle);\n              const latest = {\n                ...entry,\n                startAngle: curAngle + paddingAngle,\n                endAngle: curAngle + angleIp(t) + paddingAngle,\n              };\n\n              stepData.push(latest);\n              curAngle = latest.endAngle;\n            } else {\n              const { endAngle, startAngle } = entry;\n              const interpolatorAngle = interpolateNumber(0, endAngle - startAngle);\n              const deltaAngle = interpolatorAngle(t);\n              const latest = {\n                ...entry,\n                startAngle: curAngle + paddingAngle,\n                endAngle: curAngle + deltaAngle + paddingAngle,\n              };\n\n              stepData.push(latest);\n              curAngle = latest.endAngle;\n            }\n          });\n\n          return <Layer>{this.renderSectorsStatically(stepData)}</Layer>;\n        }}\n      </Animate>\n    );\n  }\n\n  renderSectors() {\n    const { sectors, isAnimationActive } = this.props;\n    const { prevSectors } = this.state;\n\n    if (isAnimationActive && sectors && sectors.length && (!prevSectors || !_.isEqual(prevSectors, sectors))) {\n      return this.renderSectorsWithAnimation();\n    }\n    return this.renderSectorsStatically(sectors);\n  }\n\n  render() {\n    const { hide, sectors, className, label, cx, cy, innerRadius, outerRadius, isAnimationActive } = this.props;\n    const { prevSectors } = this.state;\n\n    if (\n      hide ||\n      !sectors ||\n      !sectors.length ||\n      !isNumber(cx as number) ||\n      !isNumber(cy as number) ||\n      !isNumber(innerRadius as number) ||\n      !isNumber(outerRadius as number)\n    ) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-pie', className);\n\n    return (\n      <Layer className={layerClass}>\n        {this.renderSectors()}\n        {label && this.renderLabels(sectors)}\n        {Label.renderCallByParent(this.props, null, false)}\n        {(!isAnimationActive || (prevSectors && _.isEqual(prevSectors, sectors))) &&\n          LabelList.renderCallByParent(this.props, sectors, false)}\n      </Layer>\n    );\n  }\n}\n\nexport default Pie;\n","/**\n * @fileOverview Axis of radial direction\n */\nimport React, { PureComponent } from 'react';\nimport _ from 'lodash';\nimport Layer from '../container/Layer';\nimport Dot from '../shape/Dot';\nimport Polygon from '../shape/Polygon';\nimport Text from '../component/Text';\nimport { PresentationAttributes, BaseAxisProps, filterProps, TickItem, adaptEventsOfChild } from '../util/types';\nimport { polarToCartesian } from '../util/PolarUtils';\n\nconst RADIAN = Math.PI / 180;\nconst eps = 1e-5;\ninterface PolarAngleAxisProps extends BaseAxisProps {\n  angleAxisId?: string | number;\n  cx?: number;\n  cy?: number;\n  radius?: number;\n\n  axisLineType?: 'polygon' | 'circle';\n  ticks?: TickItem[];\n  orientation?: 'inner' | 'outer';\n}\nexport type Props = PresentationAttributes<SVGTextElement> & PolarAngleAxisProps;\n\nclass PolarAngleAxis extends PureComponent<Props> {\n  static displayName = 'PolarAngleAxis';\n\n  static axisType = 'angleAxis';\n\n  static defaultProps = {\n    type: 'category',\n    angleAxisId: 0,\n    scale: 'auto',\n    cx: 0,\n    cy: 0,\n    domain: [0, 'auto'],\n    orientation: 'outer',\n    axisLine: true,\n    tickLine: true,\n    tickSize: 8,\n    tick: true,\n    hide: false,\n    allowDuplicatedCategory: true,\n  };\n\n  /**\n   * Calculate the coordinate of line endpoint\n   * @param  {Object} data The Data if ticks\n   * @return {Object} (x0, y0): The start point of text,\n   *                  (x1, y1): The end point close to text,\n   *                  (x2, y2): The end point close to axis\n   */\n  getTickLineCoord(data: TickItem) {\n    const { cx, cy, radius, orientation, tickSize } = this.props;\n    const tickLineSize = tickSize || 8;\n    const p1 = polarToCartesian(cx, cy, radius, data.coordinate);\n    const p2 = polarToCartesian(cx, cy, radius + (orientation === 'inner' ? -1 : 1) * tickLineSize, data.coordinate);\n\n    return { x1: p1.x, y1: p1.y, x2: p2.x, y2: p2.y };\n  }\n\n  /**\n   * Get the text-anchor of each tick\n   * @param  {Object} data Data of ticks\n   * @return {String} text-anchor\n   */\n  getTickTextAnchor(data: TickItem) {\n    const { orientation } = this.props;\n    const cos = Math.cos(-data.coordinate * RADIAN);\n    let textAnchor;\n\n    if (cos > eps) {\n      textAnchor = orientation === 'outer' ? 'start' : 'end';\n    } else if (cos < -eps) {\n      textAnchor = orientation === 'outer' ? 'end' : 'start';\n    } else {\n      textAnchor = 'middle';\n    }\n\n    return textAnchor;\n  }\n\n  renderAxisLine() {\n    const { cx, cy, radius, axisLine, axisLineType } = this.props;\n    const props = {\n      ...filterProps(this.props),\n      fill: 'none',\n      ...filterProps(axisLine),\n    };\n\n    if (axisLineType === 'circle') {\n      return <Dot className=\"recharts-polar-angle-axis-line\" {...props} cx={cx} cy={cy} r={radius} />;\n    }\n    const { ticks } = this.props;\n    const points = ticks.map(entry => polarToCartesian(cx, cy, radius, entry.coordinate));\n\n    return <Polygon className=\"recharts-polar-angle-axis-line\" {...props} points={points} />;\n  }\n\n  static renderTickItem(option: PolarAngleAxisProps['tick'], props: any, value: string | number) {\n    let tickItem;\n\n    if (React.isValidElement(option)) {\n      tickItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      tickItem = option(props);\n    } else {\n      tickItem = (\n        <Text {...props} className=\"recharts-polar-angle-axis-tick-value\">\n          {value}\n        </Text>\n      );\n    }\n\n    return tickItem;\n  }\n\n  renderTicks() {\n    const { ticks, tick, tickLine, tickFormatter, stroke } = this.props;\n    const axisProps = filterProps(this.props);\n    const customTickProps = filterProps(tick);\n    const tickLineProps = {\n      ...axisProps,\n      fill: 'none',\n      ...filterProps(tickLine),\n    };\n\n    const items = ticks.map((entry, i) => {\n      const lineCoord = this.getTickLineCoord(entry);\n      const textAnchor = this.getTickTextAnchor(entry);\n      const tickProps = {\n        textAnchor,\n        ...axisProps,\n        stroke: 'none',\n        fill: stroke,\n        ...customTickProps,\n        index: i,\n        payload: entry,\n        x: lineCoord.x2,\n        y: lineCoord.y2,\n      };\n\n      return (\n        <Layer\n          className=\"recharts-polar-angle-axis-tick\"\n          key={`tick-${i}`} // eslint-disable-line react/no-array-index-key\n          {...adaptEventsOfChild(this.props, entry, i)}\n        >\n          {tickLine && <line className=\"recharts-polar-angle-axis-tick-line\" {...tickLineProps} {...lineCoord} />}\n          {tick &&\n            PolarAngleAxis.renderTickItem(tick, tickProps, tickFormatter ? tickFormatter(entry.value, i) : entry.value)}\n        </Layer>\n      );\n    });\n\n    return <Layer className=\"recharts-polar-angle-axis-ticks\">{items}</Layer>;\n  }\n\n  render() {\n    const { ticks, radius, axisLine } = this.props;\n\n    if (radius <= 0 || !ticks || !ticks.length) {\n      return null;\n    }\n\n    return (\n      <Layer className=\"recharts-polar-angle-axis\">\n        {axisLine && this.renderAxisLine()}\n        {this.renderTicks()}\n      </Layer>\n    );\n  }\n}\n\nexport default PolarAngleAxis;\n","/**\n * @fileOverview Polar Grid\n */\nimport React, { PureComponent } from 'react';\nimport { polarToCartesian } from '../util/PolarUtils';\nimport { filterProps, PresentationAttributes } from '../util/types';\n\ninterface PolarGridProps {\n  cx?: number;\n  cy?: number;\n  innerRadius?: number;\n  outerRadius?: number;\n\n  polarAngles?: number[];\n  polarRadius?: number[];\n  gridType?: 'polygon' | 'circle';\n}\ntype Props = PresentationAttributes<SVGPathElement> & PolarGridProps;\n\nclass PolarGrid extends PureComponent<Props> {\n  static displayName = 'PolarGrid';\n\n  static defaultProps = {\n    cx: 0,\n    cy: 0,\n    innerRadius: 0,\n    outerRadius: 0,\n    gridType: 'polygon',\n  };\n\n  getPolygonPath(radius: number) {\n    const { cx, cy, polarAngles } = this.props;\n\n    let path = '';\n\n    polarAngles.forEach((angle, i) => {\n      const point = polarToCartesian(cx, cy, radius, angle);\n\n      if (i) {\n        path += `L ${point.x},${point.y}`;\n      } else {\n        path += `M ${point.x},${point.y}`;\n      }\n    });\n    path += 'Z';\n\n    return path;\n  }\n\n  /**\n   * Draw axis of radial line\n   * @return {[type]} The lines\n   */\n  renderPolarAngles() {\n    const { cx, cy, innerRadius, outerRadius, polarAngles } = this.props;\n\n    if (!polarAngles || !polarAngles.length) {\n      return null;\n    }\n    const props = {\n      stroke: '#ccc',\n      ...filterProps(this.props),\n    };\n\n    return (\n      <g className=\"recharts-polar-grid-angle\">\n        {polarAngles.map((entry, i) => {\n          const start = polarToCartesian(cx, cy, innerRadius, entry);\n          const end = polarToCartesian(cx, cy, outerRadius, entry);\n\n          return (\n            <line\n              {...props}\n              key={`line-${i}`} // eslint-disable-line react/no-array-index-key\n              x1={start.x}\n              y1={start.y}\n              x2={end.x}\n              y2={end.y}\n            />\n          );\n        })}\n      </g>\n    );\n  }\n\n  /**\n   * Draw concentric circles\n   * @param {Number} radius The radius of circle\n   * @param {Number} index  The index of circle\n   * @param {Object} extraProps Extra props\n   * @return {ReactElement} circle\n   */\n  renderConcentricCircle(radius: number, index: number, extraProps?: PresentationAttributes<SVGCircleElement>) {\n    const { cx, cy } = this.props;\n    const props = {\n      stroke: '#ccc',\n      ...filterProps(this.props),\n      fill: 'none',\n      ...extraProps,\n    };\n\n    return (\n      <circle\n        {...props}\n        className=\"recharts-polar-grid-concentric-circle\"\n        key={`circle-${index}`}\n        cx={cx}\n        cy={cy}\n        r={radius}\n      />\n    );\n  }\n\n  /**\n   * Draw concentric polygons\n   * @param {Number} radius     The radius of polygon\n   * @param {Number} index      The index of polygon\n   * @param {Object} extraProps Extra props\n   * @return {ReactElement} polygon\n   */\n  renderConcentricPolygon(radius: number, index: number, extraProps?: PresentationAttributes<SVGPathElement>) {\n    const props = {\n      stroke: '#ccc',\n      ...filterProps(this.props),\n      fill: 'none',\n      ...extraProps,\n    };\n\n    return (\n      <path\n        {...props}\n        className=\"recharts-polar-grid-concentric-polygon\"\n        key={`path-${index}`}\n        d={this.getPolygonPath(radius)}\n      />\n    );\n  }\n\n  /**\n   * Draw concentric axis\n   * @return {ReactElement} Concentric axis\n   * @todo Optimize the name\n   */\n  renderConcentricPath() {\n    const { polarRadius, gridType } = this.props;\n\n    if (!polarRadius || !polarRadius.length) {\n      return null;\n    }\n\n    return (\n      <g className=\"recharts-polar-grid-concentric\">\n        {polarRadius.map((entry, i) =>\n          gridType === 'circle' ? this.renderConcentricCircle(entry, i) : this.renderConcentricPolygon(entry, i),\n        )}\n      </g>\n    );\n  }\n\n  render() {\n    const { outerRadius } = this.props;\n\n    if (outerRadius <= 0) {\n      return null;\n    }\n\n    return (\n      <g className=\"recharts-polar-grid\">\n        {this.renderPolarAngles()}\n        {this.renderConcentricPath()}\n      </g>\n    );\n  }\n}\n\nexport default PolarGrid;\n","/**\n * @fileOverview The axis of polar coordinate system\n */\nimport React, { PureComponent } from 'react';\nimport _ from 'lodash';\nimport Text from '../component/Text';\nimport Label from '../component/Label';\nimport Layer from '../container/Layer';\nimport { polarToCartesian } from '../util/PolarUtils';\nimport { PresentationAttributes, filterProps, BaseAxisProps, TickItem, adaptEventsOfChild } from '../util/types';\n\ninterface TickIem {\n  value?: any;\n  coordinate?: number;\n}\n\ninterface PolarRadiusAxisProps extends BaseAxisProps {\n  cx?: number;\n  cy?: number;\n  radiusAxisId?: string | number;\n  angle?: number;\n  orientation?: 'left' | 'right' | 'middle';\n  ticks?: TickItem[];\n}\n\nexport type Props = PresentationAttributes<SVGElement> & PolarRadiusAxisProps;\n\nclass PolarRadiusAxis extends PureComponent<Props> {\n  static displayName = 'PolarRadiusAxis';\n\n  static axisType = 'radiusAxis';\n\n  static defaultProps = {\n    type: 'number',\n    radiusAxisId: 0,\n    cx: 0,\n    cy: 0,\n    angle: 0,\n    orientation: 'right',\n    stroke: '#ccc',\n    axisLine: true,\n    tick: true,\n    tickCount: 5,\n    domain: [0, 'auto'],\n    allowDataOverflow: false,\n    scale: 'auto',\n    allowDuplicatedCategory: true,\n  };\n\n  /**\n   * Calculate the coordinate of tick\n   * @param  {Number} coordinate The radius of tick\n   * @return {Object} (x, y)\n   */\n  getTickValueCoord({ coordinate }: TickItem) {\n    const { angle, cx, cy } = this.props;\n\n    return polarToCartesian(cx, cy, coordinate, angle);\n  }\n\n  getTickTextAnchor() {\n    const { orientation } = this.props;\n    let textAnchor;\n\n    switch (orientation) {\n      case 'left':\n        textAnchor = 'end';\n        break;\n      case 'right':\n        textAnchor = 'start';\n        break;\n      default:\n        textAnchor = 'middle';\n        break;\n    }\n\n    return textAnchor;\n  }\n\n  getViewBox() {\n    const { cx, cy, angle, ticks } = this.props;\n    const maxRadiusTick = _.maxBy(ticks, (entry: TickItem) => entry.coordinate || 0);\n    const minRadiusTick = _.minBy(ticks, (entry: TickItem) => entry.coordinate || 0);\n\n    return {\n      cx,\n      cy,\n      startAngle: angle,\n      endAngle: angle,\n      innerRadius: minRadiusTick.coordinate || 0,\n      outerRadius: maxRadiusTick.coordinate || 0,\n    };\n  }\n\n  renderAxisLine() {\n    const { cx, cy, angle, ticks, axisLine, ...others } = this.props;\n    const extent = ticks.reduce(\n      (result, entry) => [Math.min(result[0], entry.coordinate), Math.max(result[1], entry.coordinate)],\n      [Infinity, -Infinity],\n    );\n    const point0 = polarToCartesian(cx, cy, extent[0], angle);\n    const point1 = polarToCartesian(cx, cy, extent[1], angle);\n\n    const props = {\n      ...filterProps(others),\n      fill: 'none',\n      ...filterProps(axisLine),\n      x1: point0.x,\n      y1: point0.y,\n      x2: point1.x,\n      y2: point1.y,\n    };\n\n    return <line className=\"recharts-polar-radius-axis-line\" {...props} />;\n  }\n\n  static renderTickItem(option: Props['tick'], props: any, value: string | number) {\n    let tickItem;\n\n    if (React.isValidElement(option)) {\n      tickItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      tickItem = option(props);\n    } else {\n      tickItem = (\n        <Text {...props} className=\"recharts-polar-radius-axis-tick-value\">\n          {value}\n        </Text>\n      );\n    }\n\n    return tickItem;\n  }\n\n  renderTicks() {\n    const { ticks, tick, angle, tickFormatter, stroke, ...others } = this.props;\n    const textAnchor = this.getTickTextAnchor();\n    const axisProps = filterProps(others);\n    const customTickProps = filterProps(tick);\n\n    const items = ticks.map((entry, i) => {\n      const coord = this.getTickValueCoord(entry);\n      const tickProps = {\n        textAnchor,\n        transform: `rotate(${90 - angle}, ${coord.x}, ${coord.y})`,\n        ...axisProps,\n        stroke: 'none',\n        fill: stroke,\n        ...customTickProps,\n        index: i,\n        ...coord,\n        payload: entry,\n      };\n\n      return (\n        <Layer\n          className=\"recharts-polar-radius-axis-tick\"\n          key={`tick-${i}`} // eslint-disable-line react/no-array-index-key\n          {...adaptEventsOfChild(this.props, entry, i)}\n        >\n          {PolarRadiusAxis.renderTickItem(tick, tickProps, tickFormatter ? tickFormatter(entry.value, i) : entry.value)}\n        </Layer>\n      );\n    });\n\n    return <Layer className=\"recharts-polar-radius-axis-ticks\">{items}</Layer>;\n  }\n\n  render() {\n    const { ticks, axisLine, tick } = this.props;\n\n    if (!ticks || !ticks.length) {\n      return null;\n    }\n\n    return (\n      <Layer className=\"recharts-polar-radius-axis\">\n        {axisLine && this.renderAxisLine()}\n        {tick && this.renderTicks()}\n        {Label.renderCallByParent(this.props, this.getViewBox())}\n      </Layer>\n    );\n  }\n}\n\nexport default PolarRadiusAxis;\n","/**\n * @fileOverview Radar\n */\nimport React, { PureComponent, ReactElement, MouseEvent } from 'react';\nimport Animate from 'react-smooth';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport { interpolateNumber } from '../util/DataUtils';\nimport Global from '../util/Global';\nimport { polarToCartesian } from '../util/PolarUtils';\nimport { getValueByDataKey } from '../util/ChartUtils';\nimport Polygon from '../shape/Polygon';\nimport Dot, { Props as DotProps } from '../shape/Dot';\nimport Layer from '../container/Layer';\nimport LabelList from '../component/LabelList';\nimport { PresentationAttributes, LegendType, TooltipType, AnimationTiming, filterProps, DataKey } from '../util/types';\nimport { Props as PolarAngleAxisProps } from './PolarAngleAxis';\nimport { Props as PolarRadiusAxisProps } from './PolarRadiusAxis';\n\ninterface RadarPoint {\n  x: number;\n  y: number;\n  cx?: number;\n  cy?: number;\n  angle?: number;\n  radius?: number;\n  value?: number;\n  payload?: any;\n}\n\ntype RadarDot = ReactElement<SVGElement> | ((props: any) => SVGElement) | DotProps | boolean;\n\ninterface RadarProps {\n  className?: string;\n  dataKey: DataKey<any>;\n  angleAxisId?: string | number;\n  radiusAxisId?: string | number;\n  points?: RadarPoint[];\n  shape?: ReactElement<SVGElement> | ((props: any) => SVGElement);\n  activeDot?: RadarDot;\n  dot?: RadarDot;\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  hide?: boolean;\n\n  label?: any;\n  onAnimationStart?: () => void;\n  onAnimationEnd?: () => void;\n  animationBegin?: number;\n  animationDuration?: number;\n  isAnimationActive?: boolean;\n  animationId?: number;\n  animationEasing?: AnimationTiming;\n\n  onMouseEnter?: (props: any, e: MouseEvent<SVGPolygonElement>) => void;\n  onMouseLeave?: (props: any, e: MouseEvent<SVGPolygonElement>) => void;\n}\n\ntype Props = Omit<PresentationAttributes<SVGElement>, 'onMouseEnter' | 'onMouseLeave'> & RadarProps;\n\ninterface State {\n  isAnimationFinished?: boolean;\n  prevPoints?: RadarPoint[];\n}\n\nclass Radar extends PureComponent<Props, State> {\n  static displayName = 'Radar';\n\n  static defaultProps = {\n    angleAxisId: 0,\n    radiusAxisId: 0,\n    hide: false,\n    activeDot: true,\n    dot: false,\n    legendType: 'rect',\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n  };\n\n  static getComposedData = ({\n    radiusAxis,\n    angleAxis,\n    displayedData,\n    dataKey,\n    bandSize,\n  }: {\n    radiusAxis: PolarRadiusAxisProps & { scale: (value: any) => number };\n    angleAxis: PolarAngleAxisProps & { scale: (value: any) => number };\n    displayedData: any[];\n    dataKey: RadarProps['dataKey'];\n    bandSize: number;\n  }) => {\n    const { cx, cy } = angleAxis;\n    const points = displayedData.map((entry, i) => {\n      const name = getValueByDataKey(entry, angleAxis.dataKey, i);\n      const value = getValueByDataKey(entry, dataKey, 0);\n      const angle = angleAxis.scale(name) + (bandSize || 0);\n      const radius = radiusAxis.scale(value);\n      return {\n        ...polarToCartesian(cx, cy, radius, angle),\n        name,\n        value,\n        cx,\n        cy,\n        radius,\n        angle,\n        payload: entry,\n      };\n    });\n\n    return { points };\n  };\n\n  state: State = { isAnimationFinished: false };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, points } = this.props;\n\n    if (nextProps.animationId !== animationId) {\n      this.cachePrevData(points);\n    }\n  }\n\n  cachePrevData = (points: RadarPoint[]) => {\n    this.setState({ prevPoints: points });\n  };\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n    this.setState({ isAnimationFinished: true });\n\n    if (_.isFunction(onAnimationEnd)) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n\n    this.setState({ isAnimationFinished: false });\n\n    if (_.isFunction(onAnimationStart)) {\n      onAnimationStart();\n    }\n  };\n\n  handleMouseEnter = (e: MouseEvent<SVGPolygonElement>) => {\n    const { onMouseEnter } = this.props;\n\n    if (onMouseEnter) {\n      onMouseEnter(this.props, e);\n    }\n  };\n\n  handleMouseLeave = (e: MouseEvent<SVGPolygonElement>) => {\n    const { onMouseLeave } = this.props;\n\n    if (onMouseLeave) {\n      onMouseLeave(this.props, e);\n    }\n  };\n\n  static renderDotItem(option: RadarDot, props: any) {\n    let dotItem;\n\n    if (React.isValidElement(option)) {\n      dotItem = React.cloneElement(option, props);\n    } else if (_.isFunction(option)) {\n      dotItem = option(props);\n    } else {\n      dotItem = <Dot {...props} className=\"recharts-radar-dot\" />;\n    }\n\n    return dotItem;\n  }\n\n  renderDots(points: RadarPoint[]) {\n    const { dot, dataKey } = this.props;\n    const baseProps = filterProps(this.props);\n    const customDotProps = filterProps(dot);\n\n    const dots = points.map((entry, i) => {\n      const dotProps = {\n        key: `dot-${i}`,\n        r: 3,\n        ...baseProps,\n        ...customDotProps,\n        dataKey,\n        cx: entry.x,\n        cy: entry.y,\n        index: i,\n        payload: entry,\n      };\n\n      return Radar.renderDotItem(dot, dotProps);\n    });\n\n    return <Layer className=\"recharts-radar-dots\">{dots}</Layer>;\n  }\n\n  renderPolygonStatically(points: RadarPoint[]) {\n    const { shape, dot } = this.props;\n\n    let radar;\n    if (React.isValidElement(shape)) {\n      radar = React.cloneElement(shape, { ...this.props, points } as any);\n    } else if (_.isFunction(shape)) {\n      radar = shape({ ...this.props, points });\n    } else {\n      radar = (\n        <Polygon\n          {...filterProps(this.props, true)}\n          onMouseEnter={this.handleMouseEnter}\n          onMouseLeave={this.handleMouseLeave}\n          points={points}\n        />\n      );\n    }\n\n    return (\n      <Layer className=\"recharts-radar-polygon\">\n        {radar}\n        {dot ? this.renderDots(points) : null}\n      </Layer>\n    );\n  }\n\n  renderPolygonWithAnimation() {\n    const { points, isAnimationActive, animationBegin, animationDuration, animationEasing, animationId } = this.props;\n    const { prevPoints } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`radar-${animationId}`}\n        onAnimationEnd={this.handleAnimationEnd}\n        onAnimationStart={this.handleAnimationStart}\n      >\n        {({ t }: { t: number }) => {\n          const prevPointsDiffFactor = prevPoints && prevPoints.length / points.length;\n          const stepData = points.map((entry, index) => {\n            const prev = prevPoints && prevPoints[Math.floor(index * prevPointsDiffFactor)];\n\n            if (prev) {\n              const interpolatorX = interpolateNumber(prev.x, entry.x);\n              const interpolatorY = interpolateNumber(prev.y, entry.y);\n\n              return {\n                ...entry,\n                x: interpolatorX(t),\n                y: interpolatorY(t),\n              };\n            }\n\n            const interpolatorX = interpolateNumber(entry.cx, entry.x);\n            const interpolatorY = interpolateNumber(entry.cy, entry.y);\n\n            return {\n              ...entry,\n              x: interpolatorX(t),\n              y: interpolatorY(t),\n            };\n          });\n\n          return this.renderPolygonStatically(stepData);\n        }}\n      </Animate>\n    );\n  }\n\n  renderPolygon() {\n    const { points, isAnimationActive } = this.props;\n    const { prevPoints } = this.state;\n\n    if (isAnimationActive && points && points.length && (!prevPoints || !_.isEqual(prevPoints, points))) {\n      return this.renderPolygonWithAnimation();\n    }\n\n    return this.renderPolygonStatically(points);\n  }\n\n  render() {\n    const { hide, className, points, isAnimationActive } = this.props;\n\n    if (hide || !points || !points.length) {\n      return null;\n    }\n\n    const { isAnimationFinished } = this.state;\n    const layerClass = classNames('recharts-radar', className);\n\n    return (\n      <Layer className={layerClass}>\n        {this.renderPolygon()}\n        {(!isAnimationActive || isAnimationFinished) && LabelList.renderCallByParent(this.props, points)}\n      </Layer>\n    );\n  }\n}\n\nexport default Radar;\n","/**\n * @fileOverview Render a group of radial bar\n */\nimport React, { PureComponent, ReactElement, ReactNode } from 'react';\nimport classNames from 'classnames';\nimport Animate from 'react-smooth';\nimport _ from 'lodash';\nimport Sector, { Props as SectorProps } from '../shape/Sector';\nimport Layer from '../container/Layer';\nimport { findAllByType } from '../util/ReactUtils';\nimport Global from '../util/Global';\nimport LabelList from '../component/LabelList';\nimport Cell from '../component/Cell';\nimport { mathSign, interpolateNumber } from '../util/DataUtils';\nimport {\n  getCateCoordinateOfBar,\n  findPositionOfBar,\n  getValueByDataKey,\n  truncateByDomain,\n  getBaseValueOfBar,\n} from '../util/ChartUtils';\nimport {\n  LegendType,\n  TooltipType,\n  AnimationTiming,\n  filterProps,\n  PresentationAttributes,\n  TickItem,\n  adaptEventsOfChild,\n} from '../util/types';\n// TODO: Cause of circular dependency. Needs refactoring of functions that need them.\n// import { AngleAxisProps, RadiusAxisProps } from './types';\n\ntype RadialBarDataItem = SectorProps & {\n  value?: any;\n  payload?: any;\n  background?: SectorProps;\n};\n\ntype RadialBarShape = ReactElement | ((props: Props) => ReactNode);\ntype RadialBarBackground = ReactElement | ((props: Props) => ReactNode) | SectorProps | boolean;\n\ninterface RadialBarProps {\n  animationId?: string | number;\n  className?: string;\n  angleAxisId?: string | number;\n  radiusAxisId?: string | number;\n  startAngle?: number;\n  endAngle?: number;\n  shape?: RadialBarShape;\n  activeShape?: RadialBarShape;\n  activeIndex?: number;\n  dataKey: string | number | ((obj: any) => any);\n  cornerRadius?: string | number;\n  forceCornerRadius?: boolean;\n  cornerIsExternal?: boolean;\n  minPointSize?: number;\n  maxBarSize?: number;\n  data?: RadialBarDataItem[];\n  legendType?: LegendType;\n  tooltipType?: TooltipType;\n  hide?: boolean;\n  label?: any;\n  background?: RadialBarBackground;\n  onAnimationStart?: () => void;\n  onAnimationEnd?: () => void;\n  isAnimationActive?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n}\n\ntype Props = PresentationAttributes<SVGElement> & RadialBarProps;\n\ninterface State {\n  isAnimationFinished?: boolean;\n  prevData?: RadialBarDataItem[];\n}\n\nclass RadialBar extends PureComponent<Props, State> {\n  static displayName = 'RadialBar';\n\n  static defaultProps = {\n    angleAxisId: 0,\n    radiusAxisId: 0,\n    minPointSize: 0,\n    hide: false,\n    legendType: 'rect',\n    data: [] as RadialBarDataItem[],\n    isAnimationActive: !Global.isSsr,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n    forceCornerRadius: false,\n    cornerIsExternal: false,\n  };\n\n  static getComposedData = ({\n    item,\n    props,\n    radiusAxis,\n    radiusAxisTicks,\n    angleAxis,\n    angleAxisTicks,\n    displayedData,\n    dataKey,\n    stackedData,\n    barPosition,\n    bandSize,\n    dataStartIndex,\n  }: {\n    item: RadialBar;\n    props: any;\n    radiusAxis: any; // RadiusAxisProps;\n    radiusAxisTicks: Array<TickItem>;\n    angleAxis: any; // AngleAxisProps;\n    angleAxisTicks: Array<TickItem>;\n    displayedData: any[];\n    dataKey: Props['dataKey'];\n    stackedData?: any[];\n    barPosition?: any[];\n    bandSize?: number;\n    dataStartIndex: number;\n  }) => {\n    const pos = findPositionOfBar(barPosition, item);\n    if (!pos) {\n      return null;\n    }\n\n    const { cx, cy } = angleAxis;\n    const { layout } = props;\n    const { children, minPointSize } = item.props;\n    const numericAxis = layout === 'radial' ? angleAxis : radiusAxis;\n    const stackedDomain = stackedData ? numericAxis.scale.domain() : null;\n    const baseValue = getBaseValueOfBar({ numericAxis });\n    const cells = findAllByType(children, Cell.displayName);\n    const sectors = displayedData.map((entry: any, index: number) => {\n      let value, innerRadius, outerRadius, startAngle, endAngle, backgroundSector;\n\n      if (stackedData) {\n        value = truncateByDomain(stackedData[dataStartIndex + index], stackedDomain);\n      } else {\n        value = getValueByDataKey(entry, dataKey);\n        if (!_.isArray(value)) {\n          value = [baseValue, value];\n        }\n      }\n\n      if (layout === 'radial') {\n        innerRadius = getCateCoordinateOfBar({\n          axis: radiusAxis,\n          ticks: radiusAxisTicks,\n          bandSize,\n          offset: pos.offset,\n          entry,\n          index,\n        });\n        endAngle = angleAxis.scale(value[1]);\n        startAngle = angleAxis.scale(value[0]);\n        outerRadius = innerRadius + pos.size;\n        const deltaAngle = endAngle - startAngle;\n\n        if (Math.abs(minPointSize) > 0 && Math.abs(deltaAngle) < Math.abs(minPointSize)) {\n          const delta = mathSign(deltaAngle || minPointSize) * (Math.abs(minPointSize) - Math.abs(deltaAngle));\n\n          endAngle += delta;\n        }\n        backgroundSector = {\n          background: {\n            cx,\n            cy,\n            innerRadius,\n            outerRadius,\n            startAngle: props.startAngle,\n            endAngle: props.endAngle,\n          },\n        };\n      } else {\n        innerRadius = radiusAxis.scale(value[0]);\n        outerRadius = radiusAxis.scale(value[1]);\n        startAngle = getCateCoordinateOfBar({\n          axis: angleAxis,\n          ticks: angleAxisTicks,\n          bandSize,\n          offset: pos.offset,\n          entry,\n          index,\n        });\n        endAngle = startAngle + pos.size;\n        const deltaRadius = outerRadius - innerRadius;\n\n        if (Math.abs(minPointSize) > 0 && Math.abs(deltaRadius) < Math.abs(minPointSize)) {\n          const delta = mathSign(deltaRadius || minPointSize) * (Math.abs(minPointSize) - Math.abs(deltaRadius));\n          outerRadius += delta;\n        }\n      }\n\n      return {\n        ...entry,\n        ...backgroundSector,\n        payload: entry,\n        value: stackedData ? value : value[1],\n        cx,\n        cy,\n        innerRadius,\n        outerRadius,\n        startAngle,\n        endAngle,\n        ...(cells && cells[index] && cells[index].props),\n      };\n    });\n\n    return { data: sectors, layout };\n  };\n\n  state: State = {\n    isAnimationFinished: false,\n  };\n\n  // eslint-disable-next-line camelcase\n  UNSAFE_componentWillReceiveProps(nextProps: Props) {\n    const { animationId, data } = this.props;\n\n    if (nextProps.animationId !== animationId) {\n      this.cachePrevData(data);\n    }\n  }\n\n  getDeltaAngle() {\n    const { startAngle, endAngle } = this.props;\n    const sign = mathSign(endAngle - startAngle);\n    const deltaAngle = Math.min(Math.abs(endAngle - startAngle), 360);\n\n    return sign * deltaAngle;\n  }\n\n  cachePrevData = (data: RadialBarDataItem[]) => {\n    this.setState({ prevData: data });\n  };\n\n  handleAnimationEnd = () => {\n    const { onAnimationEnd } = this.props;\n    this.setState({ isAnimationFinished: true });\n\n    if (_.isFunction(onAnimationEnd)) {\n      onAnimationEnd();\n    }\n  };\n\n  handleAnimationStart = () => {\n    const { onAnimationStart } = this.props;\n\n    this.setState({ isAnimationFinished: false });\n\n    if (_.isFunction(onAnimationStart)) {\n      onAnimationStart();\n    }\n  };\n\n  static renderSectorShape(shape: RadialBarBackground, props: any) {\n    let sectorShape;\n\n    if (React.isValidElement(shape)) {\n      sectorShape = React.cloneElement(shape, props);\n    } else if (_.isFunction(shape)) {\n      sectorShape = shape(props);\n    } else {\n      sectorShape = React.createElement(Sector, props);\n    }\n\n    return sectorShape;\n  }\n\n  renderSectorsStatically(sectors: SectorProps[]) {\n    const { shape, activeShape, activeIndex, cornerRadius, ...others } = this.props;\n    const baseProps = filterProps(others);\n\n    return sectors.map((entry, i) => {\n      const props = {\n        ...baseProps,\n        cornerRadius,\n        ...entry,\n        ...adaptEventsOfChild(this.props, entry, i),\n        key: `sector-${i}`,\n        className: 'recharts-radial-bar-sector',\n        forceCornerRadius: others.forceCornerRadius,\n        cornerIsExternal: others.cornerIsExternal,\n      };\n\n      return RadialBar.renderSectorShape(i === activeIndex ? activeShape : shape, props);\n    });\n  }\n\n  renderSectorsWithAnimation() {\n    const { data, isAnimationActive, animationBegin, animationDuration, animationEasing, animationId } = this.props;\n    const { prevData } = this.state;\n\n    return (\n      <Animate\n        begin={animationBegin}\n        duration={animationDuration}\n        isActive={isAnimationActive}\n        easing={animationEasing}\n        from={{ t: 0 }}\n        to={{ t: 1 }}\n        key={`radialBar-${animationId}`}\n        onAnimationStart={this.handleAnimationStart}\n        onAnimationEnd={this.handleAnimationEnd}\n      >\n        {({ t }: { t: number }) => {\n          const stepData = data.map((entry, index) => {\n            const prev = prevData && prevData[index];\n\n            if (prev) {\n              const interpolatorStartAngle = interpolateNumber(prev.startAngle, entry.startAngle);\n              const interpolatorEndAngle = interpolateNumber(prev.endAngle, entry.endAngle);\n\n              return {\n                ...entry,\n                startAngle: interpolatorStartAngle(t),\n                endAngle: interpolatorEndAngle(t),\n              };\n            }\n            const { endAngle, startAngle } = entry;\n            const interpolator = interpolateNumber(startAngle, endAngle);\n\n            return { ...entry, endAngle: interpolator(t) };\n          });\n\n          return <Layer>{this.renderSectorsStatically(stepData)}</Layer>;\n        }}\n      </Animate>\n    );\n  }\n\n  renderSectors() {\n    const { data, isAnimationActive } = this.props;\n    const { prevData } = this.state;\n\n    if (isAnimationActive && data && data.length && (!prevData || !_.isEqual(prevData, data))) {\n      return this.renderSectorsWithAnimation();\n    }\n\n    return this.renderSectorsStatically(data);\n  }\n\n  renderBackground(sectors?: RadialBarDataItem[]) {\n    const { cornerRadius } = this.props;\n    const backgroundProps = filterProps(this.props.background);\n\n    return sectors.map((entry, i) => {\n      // eslint-disable-next-line @typescript-eslint/no-unused-vars\n      const { value, background, ...rest } = entry;\n\n      if (!background) {\n        return null;\n      }\n\n      const props = {\n        cornerRadius,\n        ...rest,\n        fill: '#eee',\n        ...background,\n        ...backgroundProps,\n        ...adaptEventsOfChild(this.props, entry, i),\n        index: i,\n        key: `sector-${i}`,\n        className: 'recharts-radial-bar-background-sector',\n      };\n\n      return RadialBar.renderSectorShape(background, props);\n    });\n  }\n\n  render() {\n    const { hide, data, className, background, isAnimationActive } = this.props;\n\n    if (hide || !data || !data.length) {\n      return null;\n    }\n\n    const { isAnimationFinished } = this.state;\n    const layerClass = classNames('recharts-area', className);\n\n    return (\n      <Layer className={layerClass}>\n        {background && <Layer className=\"recharts-radial-bar-background\">{this.renderBackground(data)}</Layer>}\n\n        <Layer className=\"recharts-radial-bar-sectors\">{this.renderSectors()}</Layer>\n\n        {(!isAnimationActive || isAnimationFinished) &&\n          LabelList.renderCallByParent(\n            {\n              ...this.props,\n              clockWise: this.getDeltaAngle() < 0,\n            },\n            data,\n          )}\n      </Layer>\n    );\n  }\n}\n\nexport default RadialBar;\n","import 'core-js/es/math';\nimport 'core-js/es/number';\n/* eslint no-proto: 0 */\nconst testObject = {} as any;\n\nif (!(Object.setPrototypeOf || testObject.__proto__)) {\n  const nativeGetPrototypeOf = Object.getPrototypeOf;\n\n  Object.getPrototypeOf = object => {\n    if (object.__proto__) {\n      return object.__proto__;\n    }\n\n    return nativeGetPrototypeOf.call(Object, object);\n  };\n}\n","/**\n * @fileOverview Cross\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport { isNumber } from '../util/DataUtils';\nimport { PresentationAttributes, filterProps } from '../util/types';\n\ninterface CrossProps {\n  x?: number;\n  y?: number;\n  width?: number;\n  height?: number;\n  top?: number;\n  left?: number;\n  className?: number;\n}\n\ntype Props = PresentationAttributes<SVGPathElement> & CrossProps;\n\nclass Cross extends PureComponent<Props> {\n  static defaultProps = {\n    x: 0,\n    y: 0,\n    top: 0,\n    left: 0,\n    width: 0,\n    height: 0,\n  };\n\n  static getPath(x: number, y: number, width: number, height: number, top: number, left: number) {\n    return `M${x},${top}v${height}M${left},${y}h${width}`;\n  }\n\n  render() {\n    const { x, y, width, height, top, left, className } = this.props;\n\n    if (!isNumber(x) || !isNumber(y) || !isNumber(width) || !isNumber(height) || !isNumber(top) || !isNumber(left)) {\n      return null;\n    }\n\n    return (\n      <path\n        {...filterProps(this.props, true)}\n        className={classNames('recharts-cross', className)}\n        d={Cross.getPath(x, y, width, height, top, left)}\n      />\n    );\n  }\n}\n\nexport default Cross;\n","/**\n * @fileOverview Curve\n */\nimport React, { PureComponent } from 'react';\nimport {\n  line as shapeLine,\n  area as shapeArea,\n  CurveFactory,\n  curveBasisClosed,\n  curveBasisOpen,\n  curveBasis,\n  curveLinearClosed,\n  curveLinear,\n  curveMonotoneX,\n  curveMonotoneY,\n  curveNatural,\n  curveStep,\n  curveStepAfter,\n  curveStepBefore,\n} from 'd3-shape';\nimport classNames from 'classnames';\nimport _ from 'lodash';\nimport { LayoutType, PresentationAttributesWithProps, adaptEventHandlers, filterProps } from '../util/types';\nimport { isNumber } from '../util/DataUtils';\n\ninterface CurveFactories {\n  [index: string]: CurveFactory;\n}\n\nconst CURVE_FACTORIES: CurveFactories = {\n  curveBasisClosed,\n  curveBasisOpen,\n  curveBasis,\n  curveLinearClosed,\n  curveLinear,\n  curveMonotoneX,\n  curveMonotoneY,\n  curveNatural,\n  curveStep,\n  curveStepAfter,\n  curveStepBefore,\n};\n\nexport type CurveType =\n  | 'basis'\n  | 'basisClosed'\n  | 'basisOpen'\n  | 'linear'\n  | 'linearClosed'\n  | 'natural'\n  | 'monotoneX'\n  | 'monotoneY'\n  | 'monotone'\n  | 'step'\n  | 'stepBefore'\n  | 'stepAfter'\n  | CurveFactory;\n\nexport interface Point {\n  x: number;\n  y: number;\n}\n\nconst defined = (p: Point) => p.x === +p.x && p.y === +p.y;\nconst getX = (p: Point) => p.x;\nconst getY = (p: Point) => p.y;\n\nconst getCurveFactory = (type: CurveType, layout: LayoutType) => {\n  if (_.isFunction(type)) {\n    return type;\n  }\n\n  const name = `curve${_.upperFirst(type)}`;\n\n  if (name === 'curveMonotone' && layout) {\n    return CURVE_FACTORIES[`${name}${layout === 'vertical' ? 'Y' : 'X'}`];\n  }\n  return CURVE_FACTORIES[name] || curveLinear;\n};\n\ninterface CurveProps {\n  className?: string;\n  type?: CurveType;\n  layout?: LayoutType;\n  baseLine?: number | Array<Point>;\n  points?: Array<Point>;\n  connectNulls?: boolean;\n  path?: string;\n  pathRef?: (ref: SVGPathElement) => void;\n}\n\nexport type Props = Omit<PresentationAttributesWithProps<CurveProps, SVGPathElement>, 'type' | 'points'> & CurveProps;\n\nclass Curve extends PureComponent<Props> {\n  static defaultProps = {\n    type: 'linear',\n    points: [] as any[],\n    connectNulls: false,\n  };\n\n  /**\n   * Calculate the path of curve\n   * @return {String} path\n   */\n  getPath() {\n    const { type, points, baseLine, layout, connectNulls } = this.props;\n    const curveFactory = getCurveFactory(type, layout);\n    const formatPoints = connectNulls ? points.filter(entry => defined(entry)) : points;\n    let lineFunction;\n\n    if (_.isArray(baseLine)) {\n      const formatBaseLine = connectNulls ? baseLine.filter(base => defined(base)) : baseLine;\n      const areaPoints = formatPoints.map((entry, index) => ({ ...entry, base: formatBaseLine[index] }));\n      if (layout === 'vertical') {\n        lineFunction = shapeArea<Point & { base: Point }>()\n          .y(getY)\n          .x1(getX)\n          .x0(d => d.base.x);\n      } else {\n        lineFunction = shapeArea<Point & { base: Point }>()\n          .x(getX)\n          .y1(getY)\n          .y0(d => d.base.y);\n      }\n      lineFunction.defined(defined).curve(curveFactory);\n\n      return lineFunction(areaPoints);\n    }\n    if (layout === 'vertical' && isNumber(baseLine)) {\n      lineFunction = shapeArea<Point>()\n        .y(getY)\n        .x1(getX)\n        .x0(baseLine);\n    } else if (isNumber(baseLine)) {\n      lineFunction = shapeArea<Point>()\n        .x(getX)\n        .y1(getY)\n        .y0(baseLine);\n    } else {\n      lineFunction = shapeLine<Point>()\n        .x(getX)\n        .y(getY);\n    }\n\n    lineFunction.defined(defined).curve(curveFactory);\n\n    return lineFunction(formatPoints);\n  }\n\n  render() {\n    const { className, points, path, pathRef } = this.props;\n\n    if ((!points || !points.length) && !path) {\n      return null;\n    }\n\n    const realPath = points && points.length ? this.getPath() : path;\n\n    return (\n      <path\n        {...filterProps(this.props)}\n        {...adaptEventHandlers(this.props)}\n        className={classNames('recharts-curve', className)}\n        d={realPath}\n        ref={pathRef}\n      />\n    );\n  }\n}\n\nexport default Curve;\n","/**\n * @fileOverview Dot\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport { PresentationAttributesWithProps, adaptEventHandlers, filterProps } from '../util/types';\n\ninterface DotProps {\n  className?: string;\n  cx?: number;\n  cy?: number;\n  r?: number;\n}\n\nexport type Props = PresentationAttributesWithProps<DotProps, SVGCircleElement> & DotProps;\n\nclass Dot extends PureComponent<Props> {\n  render() {\n    const { cx, cy, r, className } = this.props;\n    const layerClass = classNames('recharts-dot', className);\n\n    if (cx === +cx && cy === +cy && r === +r) {\n      return (\n        <circle\n          {...filterProps(this.props)}\n          {...adaptEventHandlers(this.props)}\n          className={layerClass}\n          cx={cx}\n          cy={cy}\n          r={r}\n        />\n      );\n    }\n\n    return null;\n  }\n}\n\nexport default Dot;\n","/**\n * @fileOverview Polygon\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport { PresentationAttributes, filterProps, Coordinate } from '../util/types';\n\nconst getPolygonPoints = (points: Array<Coordinate>) =>\n  points\n    .reduce((result, entry) => {\n      if (entry.x === +entry.x && entry.y === +entry.y) {\n        result.push([entry.x, entry.y]);\n      }\n\n      return result;\n    }, [])\n    .join(' ');\n\ninterface PolygonProps {\n  className?: string;\n  points?: Array<Coordinate>;\n}\n\ntype Props = Omit<PresentationAttributes<SVGPolygonElement>, 'points'> & PolygonProps;\n\nclass Polygon extends PureComponent<Props> {\n  render() {\n    const { points, className } = this.props;\n\n    if (!points || !points.length) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-polygon', className);\n\n    return <polygon {...filterProps(this.props, true)} className={layerClass} points={getPolygonPoints(points)} />;\n  }\n}\n\nexport default Polygon;\n","/**\n * @fileOverview Rectangle\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport Animate from 'react-smooth';\nimport { PresentationAttributes, AnimationTiming, filterProps } from '../util/types';\n\ntype RectRadius = [number, number, number, number];\n\nconst getRectangePath = (x: number, y: number, width: number, height: number, radius: number | RectRadius) => {\n  const maxRadius = Math.min(Math.abs(width) / 2, Math.abs(height) / 2);\n  const ySign = height >= 0 ? 1 : -1;\n  const xSign = width >= 0 ? 1 : -1;\n  const clockWise = (height >= 0 && width >= 0) || (height < 0 && width < 0) ? 1 : 0;\n  let path;\n\n  if (maxRadius > 0 && radius instanceof Array) {\n    const newRadius: RectRadius = [0, 0, 0, 0];\n    for (let i = 0, len = 4; i < len; i++) {\n      newRadius[i] = radius[i] > maxRadius ? maxRadius : radius[i];\n    }\n\n    path = `M${x},${y + ySign * newRadius[0]}`;\n\n    if (newRadius[0] > 0) {\n      path += `A ${newRadius[0]},${newRadius[0]},0,0,${clockWise},${x + xSign * newRadius[0]},${y}`;\n    }\n\n    path += `L ${x + width - xSign * newRadius[1]},${y}`;\n\n    if (newRadius[1] > 0) {\n      path += `A ${newRadius[1]},${newRadius[1]},0,0,${clockWise},\n        ${x + width},${y + ySign * newRadius[1]}`;\n    }\n    path += `L ${x + width},${y + height - ySign * newRadius[2]}`;\n\n    if (newRadius[2] > 0) {\n      path += `A ${newRadius[2]},${newRadius[2]},0,0,${clockWise},\n        ${x + width - xSign * newRadius[2]},${y + height}`;\n    }\n    path += `L ${x + xSign * newRadius[3]},${y + height}`;\n\n    if (newRadius[3] > 0) {\n      path += `A ${newRadius[3]},${newRadius[3]},0,0,${clockWise},\n        ${x},${y + height - ySign * newRadius[3]}`;\n    }\n    path += 'Z';\n  } else if (maxRadius > 0 && radius === +radius && radius > 0) {\n    const newRadius = Math.min(maxRadius, radius);\n\n    path = `M ${x},${y + ySign * newRadius}\n            A ${newRadius},${newRadius},0,0,${clockWise},${x + xSign * newRadius},${y}\n            L ${x + width - xSign * newRadius},${y}\n            A ${newRadius},${newRadius},0,0,${clockWise},${x + width},${y + ySign * newRadius}\n            L ${x + width},${y + height - ySign * newRadius}\n            A ${newRadius},${newRadius},0,0,${clockWise},${x + width - xSign * newRadius},${y + height}\n            L ${x + xSign * newRadius},${y + height}\n            A ${newRadius},${newRadius},0,0,${clockWise},${x},${y + height - ySign * newRadius} Z`;\n  } else {\n    path = `M ${x},${y} h ${width} v ${height} h ${-width} Z`;\n  }\n\n  return path;\n};\n\ninterface RectangleProps {\n  className?: string;\n  x?: number;\n  y?: number;\n  width?: number;\n  height?: number;\n  radius?: number | RectRadius;\n  isAnimationActive?: boolean;\n  isUpdateAnimationActive?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n}\n\nexport type Props = PresentationAttributes<SVGPathElement> & RectangleProps;\n\nclass Rectangle extends PureComponent<Props> {\n  static defaultProps = {\n    x: 0,\n    y: 0,\n    width: 0,\n    height: 0,\n    // The radius of border\n    // The radius of four corners when radius is a number\n    // The radius of left-top, right-top, right-bottom, left-bottom when radius is an array\n    radius: 0,\n    isAnimationActive: false,\n    isUpdateAnimationActive: false,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n  };\n\n  state = {\n    totalLength: -1,\n  };\n\n  private node: SVGPathElement;\n\n  /* eslint-disable  react/no-did-mount-set-state */\n  componentDidMount() {\n    if (this.node && this.node.getTotalLength) {\n      try {\n        const totalLength = this.node.getTotalLength();\n\n        if (totalLength) {\n          this.setState({\n            totalLength,\n          });\n        }\n      } catch (err) {\n        // calculate total length error\n      }\n    }\n  }\n\n  render() {\n    const { x, y, width, height, radius, className } = this.props;\n    const { totalLength } = this.state;\n    const {\n      animationEasing,\n      animationDuration,\n      animationBegin,\n      isAnimationActive,\n      isUpdateAnimationActive,\n    } = this.props;\n\n    if (x !== +x || y !== +y || width !== +width || height !== +height || width === 0 || height === 0) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-rectangle', className);\n    if (!isUpdateAnimationActive) {\n      return (\n        <path\n          {...filterProps(this.props, true)}\n          className={layerClass}\n          d={getRectangePath(x, y, width, height, radius)}\n        />\n      );\n    }\n\n    return (\n      <Animate\n        canBegin={totalLength > 0}\n        from={{ width, height, x, y }}\n        to={{ width, height, x, y }}\n        duration={animationDuration}\n        animationEasing={animationEasing}\n        isActive={isUpdateAnimationActive}\n      >\n        {({ width: currWidth, height: currHeight, x: currX, y: currY }: any) => (\n          <Animate\n            canBegin={totalLength > 0}\n            from={`0px ${totalLength === -1 ? 1 : totalLength}px`}\n            to={`${totalLength}px 0px`}\n            attributeName=\"strokeDasharray\"\n            begin={animationBegin}\n            duration={animationDuration}\n            isActive={isAnimationActive}\n            easing={animationEasing}\n          >\n            <path\n              {...filterProps(this.props, true)}\n              className={layerClass}\n              d={getRectangePath(currX, currY, currWidth, currHeight, radius)}\n              ref={node => {\n                this.node = node;\n              }}\n            />\n          </Animate>\n        )}\n      </Animate>\n    );\n  }\n}\n\nexport default Rectangle;\n","/**\n * @fileOverview Sector\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport { PresentationAttributes, filterProps, GeometrySector } from '../util/types';\nimport { polarToCartesian, RADIAN } from '../util/PolarUtils';\nimport { getPercentValue, mathSign } from '../util/DataUtils';\n\nconst getDeltaAngle = (startAngle: number, endAngle: number) => {\n  const sign = mathSign(endAngle - startAngle);\n  const deltaAngle = Math.min(Math.abs(endAngle - startAngle), 359.999);\n\n  return sign * deltaAngle;\n};\n\ninterface TangentCircleDef {\n  cx?: number;\n  cy?: number;\n  radius?: number;\n  angle?: number;\n  sign?: number;\n  isExternal?: boolean;\n  cornerRadius?: number;\n  cornerIsExternal?: boolean;\n}\n\nconst getTangentCircle = ({\n  cx,\n  cy,\n  radius,\n  angle,\n  sign,\n  isExternal,\n  cornerRadius,\n  cornerIsExternal,\n}: TangentCircleDef) => {\n  const centerRadius = cornerRadius * (isExternal ? 1 : -1) + radius;\n  const theta = Math.asin(cornerRadius / centerRadius) / RADIAN;\n  const centerAngle = cornerIsExternal ? angle : angle + sign * theta;\n  const center = polarToCartesian(cx, cy, centerRadius, centerAngle);\n  // The coordinate of point which is tangent to the circle\n  const circleTangency = polarToCartesian(cx, cy, radius, centerAngle);\n  // The coordinate of point which is tangent to the radius line\n  const lineTangencyAngle = cornerIsExternal ? angle - sign * theta : angle;\n  const lineTangency = polarToCartesian(cx, cy, centerRadius * Math.cos(theta * RADIAN), lineTangencyAngle);\n  return { center, circleTangency, lineTangency, theta };\n};\n\nconst getSectorPath = ({ cx, cy, innerRadius, outerRadius, startAngle, endAngle }: GeometrySector) => {\n  const angle = getDeltaAngle(startAngle, endAngle);\n\n  // When the angle of sector equals to 360, star point and end point coincide\n  const tempEndAngle = startAngle + angle;\n  const outerStartPoint = polarToCartesian(cx, cy, outerRadius, startAngle);\n  const outerEndPoint = polarToCartesian(cx, cy, outerRadius, tempEndAngle);\n\n  let path = `M ${outerStartPoint.x},${outerStartPoint.y}\n    A ${outerRadius},${outerRadius},0,\n    ${+(Math.abs(angle) > 180)},${+(startAngle > tempEndAngle)},\n    ${outerEndPoint.x},${outerEndPoint.y}\n  `;\n\n  if (innerRadius > 0) {\n    const innerStartPoint = polarToCartesian(cx, cy, innerRadius, startAngle);\n    const innerEndPoint = polarToCartesian(cx, cy, innerRadius, tempEndAngle);\n    path += `L ${innerEndPoint.x},${innerEndPoint.y}\n            A ${innerRadius},${innerRadius},0,\n            ${+(Math.abs(angle) > 180)},${+(startAngle <= tempEndAngle)},\n            ${innerStartPoint.x},${innerStartPoint.y} Z`;\n  } else {\n    path += `L ${cx},${cy} Z`;\n  }\n\n  return path;\n};\n\nconst getSectorWithCorner = ({\n  cx,\n  cy,\n  innerRadius,\n  outerRadius,\n  cornerRadius,\n  forceCornerRadius,\n  cornerIsExternal,\n  startAngle,\n  endAngle,\n}: GeometrySector) => {\n  const sign = mathSign(endAngle - startAngle);\n  const { circleTangency: soct, lineTangency: solt, theta: sot } = getTangentCircle({\n    cx,\n    cy,\n    radius: outerRadius,\n    angle: startAngle,\n    sign,\n    cornerRadius,\n    cornerIsExternal,\n  });\n  const { circleTangency: eoct, lineTangency: eolt, theta: eot } = getTangentCircle({\n    cx,\n    cy,\n    radius: outerRadius,\n    angle: endAngle,\n    sign: -sign,\n    cornerRadius,\n    cornerIsExternal,\n  });\n  const outerArcAngle = cornerIsExternal\n    ? Math.abs(startAngle - endAngle)\n    : Math.abs(startAngle - endAngle) - sot - eot;\n\n  if (outerArcAngle < 0) {\n    if (forceCornerRadius) {\n      return `M ${solt.x},${solt.y}\n        a${cornerRadius},${cornerRadius},0,0,1,${cornerRadius * 2},0\n        a${cornerRadius},${cornerRadius},0,0,1,${-cornerRadius * 2},0\n      `;\n    }\n    return getSectorPath({\n      cx,\n      cy,\n      innerRadius,\n      outerRadius,\n      startAngle,\n      endAngle,\n    });\n  }\n\n  let path = `M ${solt.x},${solt.y}\n    A${cornerRadius},${cornerRadius},0,0,${+(sign < 0)},${soct.x},${soct.y}\n    A${outerRadius},${outerRadius},0,${+(outerArcAngle > 180)},${+(sign < 0)},${eoct.x},${eoct.y}\n    A${cornerRadius},${cornerRadius},0,0,${+(sign < 0)},${eolt.x},${eolt.y}\n  `;\n\n  if (innerRadius > 0) {\n    const { circleTangency: sict, lineTangency: silt, theta: sit } = getTangentCircle({\n      cx,\n      cy,\n      radius: innerRadius,\n      angle: startAngle,\n      sign,\n      isExternal: true,\n      cornerRadius,\n      cornerIsExternal,\n    });\n    const { circleTangency: eict, lineTangency: eilt, theta: eit } = getTangentCircle({\n      cx,\n      cy,\n      radius: innerRadius,\n      angle: endAngle,\n      sign: -sign,\n      isExternal: true,\n      cornerRadius,\n      cornerIsExternal,\n    });\n    const innerArcAngle = cornerIsExternal\n      ? Math.abs(startAngle - endAngle)\n      : Math.abs(startAngle - endAngle) - sit - eit;\n\n    if (innerArcAngle < 0) {\n      return `${path}L${cx},${cy}Z`;\n    }\n\n    path += `L${eilt.x},${eilt.y}\n      A${cornerRadius},${cornerRadius},0,0,${+(sign < 0)},${eict.x},${eict.y}\n      A${innerRadius},${innerRadius},0,${+(innerArcAngle > 180)},${+(sign > 0)},${sict.x},${sict.y}\n      A${cornerRadius},${cornerRadius},0,0,${+(sign < 0)},${silt.x},${silt.y}Z`;\n  } else {\n    path += `L${cx},${cy}Z`;\n  }\n\n  return path;\n};\n\ninterface SectorProps extends GeometrySector {\n  className?: string;\n}\n\nexport type Props = PresentationAttributes<SVGPathElement> & SectorProps;\n\nclass Sector extends PureComponent<Props> {\n  static defaultProps = {\n    cx: 0,\n    cy: 0,\n    innerRadius: 0,\n    outerRadius: 0,\n    startAngle: 0,\n    endAngle: 0,\n    cornerRadius: 0,\n    forceCornerRadius: false,\n    cornerIsExternal: false,\n  };\n\n  render() {\n    const {\n      cx,\n      cy,\n      innerRadius,\n      outerRadius,\n      cornerRadius,\n      forceCornerRadius,\n      cornerIsExternal,\n      startAngle,\n      endAngle,\n      className,\n    } = this.props;\n\n    if (outerRadius < innerRadius || startAngle === endAngle) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-sector', className);\n    const deltaRadius = outerRadius - innerRadius;\n    const cr = getPercentValue(cornerRadius, deltaRadius, 0, true);\n    let path;\n\n    if (cr > 0 && Math.abs(startAngle - endAngle) < 360) {\n      path = getSectorWithCorner({\n        cx,\n        cy,\n        innerRadius,\n        outerRadius,\n        cornerRadius: Math.min(cr, deltaRadius / 2),\n        forceCornerRadius,\n        cornerIsExternal,\n        startAngle,\n        endAngle,\n      });\n    } else {\n      path = getSectorPath({ cx, cy, innerRadius, outerRadius, startAngle, endAngle });\n    }\n\n    return <path {...filterProps(this.props, true)} className={layerClass} d={path} />;\n  }\n}\n\nexport default Sector;\n","/**\n * @fileOverview Curve\n */\nimport React, { PureComponent } from 'react';\nimport _ from 'lodash';\nimport {\n  symbol as shapeSymbol,\n  symbolCircle,\n  symbolCross,\n  symbolDiamond,\n  symbolSquare,\n  symbolStar,\n  symbolTriangle,\n  symbolWye,\n  SymbolType as D3SymbolType,\n} from 'd3-shape';\nimport classNames from 'classnames';\nimport { PresentationAttributes, SymbolType, filterProps } from '../util/types';\n\ntype SizeType = 'area' | 'diameter';\n\ninterface SymbolFactory {\n  [type: string]: D3SymbolType;\n}\n\nconst symbolFactories: SymbolFactory = {\n  symbolCircle,\n  symbolCross,\n  symbolDiamond,\n  symbolSquare,\n  symbolStar,\n  symbolTriangle,\n  symbolWye,\n};\nconst RADIAN = Math.PI / 180;\n\nconst getSymbolFactory = (type: SymbolType) => {\n  const name = `symbol${_.upperFirst(type)}`;\n\n  return symbolFactories[name] || symbolCircle;\n};\n\nconst calculateAreaSize = (size: number, sizeType: SizeType, type: SymbolType) => {\n  if (sizeType === 'area') {\n    return size;\n  }\n\n  switch (type) {\n    case 'cross':\n      return (5 * size * size) / 9;\n    case 'diamond':\n      return (0.5 * size * size) / Math.sqrt(3);\n    case 'square':\n      return size * size;\n    case 'star': {\n      const angle = 18 * RADIAN;\n\n      return 1.25 * size * size * (Math.tan(angle) - Math.tan(angle * 2) * Math.tan(angle) ** 2);\n    }\n    case 'triangle':\n      return (Math.sqrt(3) * size * size) / 4;\n    case 'wye':\n      return ((21 - 10 * Math.sqrt(3)) * size * size) / 8;\n    default:\n      return (Math.PI * size * size) / 4;\n  }\n};\n\ninterface SymbolsProp {\n  className?: string;\n  type: SymbolType;\n  cx?: number;\n  cy?: number;\n  size?: number;\n  sizeType?: SizeType;\n}\n\nexport type Props = PresentationAttributes<SVGPathElement> & SymbolsProp;\n\nclass Symbols extends PureComponent<Props> {\n  static defaultProps = {\n    type: 'circle',\n    size: 64,\n    sizeType: 'area',\n  };\n\n  static registerSymbol = (key: string, factory: D3SymbolType) => {\n    symbolFactories[`symbol${_.upperFirst(key)}`] = factory;\n  };\n\n  /**\n   * Calculate the path of curve\n   * @return {String} path\n   */\n  getPath() {\n    const { size, sizeType, type } = this.props;\n    const symbolFactory = getSymbolFactory(type);\n    const symbol = shapeSymbol()\n      .type(symbolFactory)\n      .size(calculateAreaSize(size, sizeType, type));\n\n    return symbol();\n  }\n\n  render() {\n    const { className, cx, cy, size } = this.props;\n\n    if (cx === +cx && cy === +cy && size === +size) {\n      return (\n        <path\n          {...filterProps(this.props, true)}\n          className={classNames('recharts-symbols', className)}\n          transform={`translate(${cx}, ${cy})`}\n          d={this.getPath()}\n        />\n      );\n    }\n\n    return null;\n  }\n}\n\nexport default Symbols;\n","/**\n * @fileOverview Rectangle\n */\nimport React, { PureComponent } from 'react';\nimport classNames from 'classnames';\nimport Animate from 'react-smooth';\nimport { PresentationAttributes, AnimationTiming, filterProps } from '../util/types';\n\nconst getTrapezoidPath = (x: number, y: number, upperWidth: number, lowerWidth: number, height: number) => {\n  const widthGap = upperWidth - lowerWidth;\n  let path;\n  path = `M ${x},${y}`;\n  path += `L ${x + upperWidth},${y}`;\n  path += `L ${x + upperWidth - widthGap / 2},${y + height}`;\n  path += `L ${x + upperWidth - widthGap / 2 - lowerWidth},${y + height}`;\n  path += `L ${x},${y} Z`;\n  return path;\n};\n\ninterface TrapezoidProps {\n  className?: string;\n  x?: number;\n  y?: number;\n  upperWidth?: number;\n  lowerWidth?: number;\n  height?: number;\n\n  isUpdateAnimationActive?: boolean;\n  animationBegin?: number;\n  animationDuration?: number;\n  animationEasing?: AnimationTiming;\n}\n\nexport type Props = PresentationAttributes<SVGPathElement> & TrapezoidProps;\n\nclass Trapezoid extends PureComponent<Props> {\n  static defaultProps = {\n    x: 0,\n    y: 0,\n    upperWidth: 0,\n    lowerWidth: 0,\n    height: 0,\n    isUpdateAnimationActive: false,\n    animationBegin: 0,\n    animationDuration: 1500,\n    animationEasing: 'ease',\n  };\n\n  state = {\n    totalLength: -1,\n  };\n\n  private node: SVGPathElement;\n\n  /* eslint-disable  react/no-did-mount-set-state */\n  componentDidMount() {\n    if (this.node && this.node.getTotalLength) {\n      try {\n        const totalLength = this.node.getTotalLength();\n\n        if (totalLength) {\n          this.setState({\n            totalLength,\n          });\n        }\n      } catch (err) {\n        // calculate total length error\n      }\n    }\n  }\n\n  render() {\n    const { x, y, upperWidth, lowerWidth, height, className } = this.props;\n    const { totalLength } = this.state;\n    const { animationEasing, animationDuration, animationBegin, isUpdateAnimationActive } = this.props;\n\n    if (\n      x !== +x ||\n      y !== +y ||\n      upperWidth !== +upperWidth ||\n      lowerWidth !== +lowerWidth ||\n      height !== +height ||\n      (upperWidth === 0 && lowerWidth === 0) ||\n      height === 0\n    ) {\n      return null;\n    }\n\n    const layerClass = classNames('recharts-trapezoid', className);\n\n    if (!isUpdateAnimationActive) {\n      return (\n        <g>\n          <path\n            {...filterProps(this.props, true)}\n            className={layerClass}\n            d={getTrapezoidPath(x, y, upperWidth, lowerWidth, height)}\n          />\n        </g>\n      );\n    }\n    return (\n      <Animate\n        canBegin={totalLength > 0}\n        from={{ upperWidth: 0, lowerWidth: 0, height, x, y }}\n        to={{ upperWidth, lowerWidth, height, x, y }}\n        duration={animationDuration}\n        animationEasing={animationEasing}\n        isActive={isUpdateAnimationActive}\n      >\n        {({\n          upperWidth: currUpperWidth,\n          lowerWidth: currLowerWidth,\n          height: currHeight,\n          x: currX,\n          y: currY,\n        }: {\n          upperWidth: number;\n          lowerWidth: number;\n          height: number;\n          x: number;\n          y: number;\n        }) => (\n          <Animate\n            canBegin={totalLength > 0}\n            from={`0px ${totalLength === -1 ? 1 : totalLength}px`}\n            to={`${totalLength}px 0px`}\n            attributeName=\"strokeDasharray\"\n            begin={animationBegin}\n            duration={animationDuration}\n            easing={animationEasing}\n          >\n            <path\n              {...filterProps(this.props, true)}\n              className={layerClass}\n              d={getTrapezoidPath(currX, currY, currUpperWidth, currLowerWidth, currHeight)}\n              ref={node => {\n                this.node = node;\n              }}\n            />\n          </Animate>\n        )}\n      </Animate>\n    );\n  }\n}\n\nexport default Trapezoid;\n","import _ from 'lodash';\nimport { getTicksOfScale, parseScale, checkDomainOfScale, getBandSizeOfAxis } from './ChartUtils';\nimport { Coordinate, AxisType } from './types';\n\n/**\n * Calculate the scale function, position, width, height of axes\n * @param  {Object} props     Latest props\n * @param  {Object} axisMap   The configuration of axes\n * @param  {Object} offset    The offset of main part in the svg element\n * @param  {String} axisType  The type of axes, x-axis or y-axis\n * @param  {String} chartName The name of chart\n * @return {Object} Configuration\n */\nexport const formatAxisMap = (props: any, axisMap: any, offset: any, axisType: AxisType, chartName: string) => {\n  const { width, height, layout } = props;\n  const ids = Object.keys(axisMap);\n  const steps: Record<string, any> = {\n    left: offset.left,\n    leftMirror: offset.left,\n    right: width - offset.right,\n    rightMirror: width - offset.right,\n    top: offset.top,\n    topMirror: offset.top,\n    bottom: height - offset.bottom,\n    bottomMirror: height - offset.bottom,\n  };\n\n  return ids.reduce((result, id) => {\n    const axis = axisMap[id];\n    const { orientation, domain, padding = {}, mirror, reversed } = axis;\n    const offsetKey = `${orientation}${mirror ? 'Mirror' : ''}`;\n\n    let range, x, y, needSpace;\n\n    if (axisType === 'xAxis') {\n      range = [offset.left + (padding.left || 0), offset.left + offset.width - (padding.right || 0)];\n    } else if (axisType === 'yAxis') {\n      range =\n        layout === 'horizontal'\n          ? [offset.top + offset.height - (padding.bottom || 0), offset.top + (padding.top || 0)]\n          : [offset.top + (padding.top || 0), offset.top + offset.height - (padding.bottom || 0)];\n    } else {\n      ({ range } = axis);\n    }\n\n    if (reversed) {\n      range = [range[1], range[0]];\n    }\n\n    const { scale, realScaleType } = parseScale(axis, chartName);\n    scale.domain(domain).range(range);\n    checkDomainOfScale(scale);\n    const ticks = getTicksOfScale(scale, { ...axis, realScaleType });\n\n    if (axisType === 'xAxis') {\n      needSpace = (orientation === 'top' && !mirror) || (orientation === 'bottom' && mirror);\n      x = offset.left;\n      y = steps[offsetKey] - needSpace * axis.height;\n    } else if (axisType === 'yAxis') {\n      needSpace = (orientation === 'left' && !mirror) || (orientation === 'right' && mirror);\n      x = steps[offsetKey] - needSpace * axis.width;\n      y = offset.top;\n    }\n\n    const finalAxis = {\n      ...axis,\n      ...ticks,\n      realScaleType,\n      x,\n      y,\n      scale,\n      width: axisType === 'xAxis' ? offset.width : axis.width,\n      height: axisType === 'yAxis' ? offset.height : axis.height,\n    };\n\n    finalAxis.bandSize = getBandSizeOfAxis(finalAxis, ticks as any);\n\n    if (!axis.hide && axisType === 'xAxis') {\n      steps[offsetKey] += (needSpace ? -1 : 1) * finalAxis.height;\n    } else if (!axis.hide) {\n      steps[offsetKey] += (needSpace ? -1 : 1) * finalAxis.width;\n    }\n\n    return { ...result, [id]: finalAxis };\n  }, {});\n};\n\nexport const rectWithPoints = ({ x: x1, y: y1 }: Coordinate, { x: x2, y: y2 }: Coordinate) => ({\n  x: Math.min(x1, x2),\n  y: Math.min(y1, y2),\n  width: Math.abs(x2 - x1),\n  height: Math.abs(y2 - y1),\n});\n\n/**\n * Compute the x, y, width, and height of a box from two reference points.\n * @param  {Object} coords     x1, x2, y1, and y2\n * @return {Object} object\n */\nexport const rectWithCoords = ({ x1, y1, x2, y2 }: { x1: number; y1: number; x2: number; y2: number }) =>\n  rectWithPoints({ x: x1, y: y1 }, { x: x2, y: y2 });\n\nexport class ScaleHelper {\n  static EPS = 1e-4;\n\n  private scale: any;\n\n  static create(obj: any) {\n    return new ScaleHelper(obj);\n  }\n\n  constructor(scale: any) {\n    this.scale = scale;\n  }\n\n  get domain() {\n    return this.scale.domain;\n  }\n\n  get range() {\n    return this.scale.range;\n  }\n\n  get rangeMin() {\n    return this.range()[0];\n  }\n\n  get rangeMax() {\n    return this.range()[1];\n  }\n\n  get bandwidth() {\n    return this.scale.bandwidth;\n  }\n\n  apply(value: any, { bandAware, position }: { bandAware?: boolean; position?: any } = {}) {\n    if (value === undefined) {\n      return undefined;\n    }\n    if (position) {\n      switch (position) {\n        case 'start': {\n          return this.scale(value);\n        }\n        case 'middle': {\n          const offset = this.bandwidth ? this.bandwidth() / 2 : 0;\n          return this.scale(value) + offset;\n        }\n        case 'end': {\n          const offset = this.bandwidth ? this.bandwidth() : 0;\n          return this.scale(value) + offset;\n        }\n        default: {\n          return this.scale(value);\n        }\n      }\n    }\n    if (bandAware) {\n      const offset = this.bandwidth ? this.bandwidth() / 2 : 0;\n      return this.scale(value) + offset;\n    }\n    return this.scale(value);\n  }\n\n  isInRange(value: number) {\n    const range = this.range();\n\n    const first = range[0];\n    const last = range[range.length - 1];\n\n    return first <= last ? value >= first && value <= last : value >= last && value <= first;\n  }\n}\n\ntype ScaleResult<T> = {\n  [P in keyof T]: number;\n};\ntype Scales<T> = {\n  [P in keyof T]: ScaleHelper;\n};\ntype ScalesApply<T> = (coord: { [P in keyof T]: any }, options: any) => ScaleResult<T>;\ntype ScalesIsInRange<T> = (coord: { [P in keyof T]: any }) => boolean;\ntype LabeledScales<T> = Scales<T> & { apply: ScalesApply<T> } & { isInRange: ScalesIsInRange<T> };\n\nexport const createLabeldScales = (options: Record<string, any>): LabeledScales<Record<string, any>> => {\n  const scales: Scales<Record<string, any>> = Object.keys(options).reduce(\n    (res, key: string) => ({\n      ...res,\n      [key]: ScaleHelper.create(options[key]),\n    }),\n    {},\n  );\n\n  return {\n    ...scales,\n    apply(coord: any, { bandAware }: any = {}) {\n      return _.mapValues(coord, (value, label) => scales[label].apply(value, { bandAware }));\n    },\n\n    isInRange(coord: any) {\n      return _.every(coord, (value, label) => scales[label].isInRange(value));\n    },\n  } as LabeledScales<Record<string, any>>;\n};\n","import _ from 'lodash';\nimport { getNiceTickValues, getTickValuesFixedDomain } from 'recharts-scale';\nimport * as d3Scales from 'd3-scale';\nimport {\n  stack as shapeStack,\n  stackOrderNone,\n  stackOffsetExpand,\n  stackOffsetNone,\n  stackOffsetSilhouette,\n  stackOffsetWiggle,\n} from 'd3-shape';\nimport { ReactElement, ReactNode } from 'react';\nimport { isNumOrStr, uniqueId, isNumber, getPercentValue, mathSign, findEntryInArray } from './DataUtils';\nimport Legend from '../component/Legend';\nimport { findAllByType, findChildByType, getDisplayName } from './ReactUtils';\n// TODO: Cause of circular dependency. Needs refactor.\n// import { RadiusAxisProps, AngleAxisProps } from '../polar/types';\nimport { LayoutType, PolarLayoutType, AxisType, TickItem, BaseAxisProps, DataKey } from './types';\n\nexport function getValueByDataKey<T>(obj: T, dataKey: DataKey<any>, defaultValue?: any) {\n  if (_.isNil(obj) || _.isNil(dataKey)) {\n    return defaultValue;\n  }\n\n  if (isNumOrStr(dataKey as string)) {\n    return _.get(obj, dataKey as string, defaultValue);\n  }\n\n  if (_.isFunction(dataKey)) {\n    return dataKey(obj);\n  }\n\n  return defaultValue;\n}\n/**\n * Get domain of data by key\n * @param  {Array}   data      The data displayed in the chart\n * @param  {String}  key       The unique key of a group of data\n * @param  {String}  type      The type of axis\n * @param  {Boolean} filterNil Whether or not filter nil values\n * @return {Array} Domain of data\n */\nexport function getDomainOfDataByKey<T>(data: Array<T>, key: string, type: string, filterNil?: boolean) {\n  const flattenData = _.flatMap(data, entry => getValueByDataKey(entry, key));\n\n  if (type === 'number') {\n    const domain = flattenData.filter(entry => isNumber(entry) || parseFloat(entry));\n\n    return domain.length ? [_.min(domain), _.max(domain)] : [Infinity, -Infinity];\n  }\n\n  const validateData = filterNil ? flattenData.filter(entry => !_.isNil(entry)) : flattenData;\n\n  // 支持Date类型的x轴\n  return validateData.map(entry => (isNumOrStr(entry) || entry instanceof Date ? entry : ''));\n}\n\nexport const calculateActiveTickIndex = (\n  coordinate: number,\n  ticks: Array<TickItem>,\n  unsortedTicks: Array<TickItem>,\n  axis: BaseAxisProps,\n) => {\n  let index = -1;\n  const len = ticks.length;\n\n  if (len > 1) {\n    if (axis && axis.axisType === 'angleAxis' && Math.abs(Math.abs(axis.range[1] - axis.range[0]) - 360) <= 1e-6) {\n      const { range } = axis;\n      // ticks are distributed in a circle\n      for (let i = 0; i < len; i++) {\n        const before = i > 0 ? unsortedTicks[i - 1].coordinate : unsortedTicks[len - 1].coordinate;\n        const cur = unsortedTicks[i].coordinate;\n        const after = i >= len - 1 ? unsortedTicks[0].coordinate : unsortedTicks[i + 1].coordinate;\n        let sameDirectionCoord;\n\n        if (mathSign(cur - before) !== mathSign(after - cur)) {\n          const diffInterval = [];\n          if (mathSign(after - cur) === mathSign(range[1] - range[0])) {\n            sameDirectionCoord = after;\n\n            const curInRange = cur + range[1] - range[0];\n            diffInterval[0] = Math.min(curInRange, (curInRange + before) / 2);\n            diffInterval[1] = Math.max(curInRange, (curInRange + before) / 2);\n          } else {\n            sameDirectionCoord = before;\n\n            const afterInRange = after + range[1] - range[0];\n            diffInterval[0] = Math.min(cur, (afterInRange + cur) / 2);\n            diffInterval[1] = Math.max(cur, (afterInRange + cur) / 2);\n          }\n          const sameInterval = [\n            Math.min(cur, (sameDirectionCoord + cur) / 2),\n            Math.max(cur, (sameDirectionCoord + cur) / 2),\n          ];\n\n          if (\n            (coordinate > sameInterval[0] && coordinate <= sameInterval[1]) ||\n            (coordinate >= diffInterval[0] && coordinate <= diffInterval[1])\n          ) {\n            ({ index } = unsortedTicks[i]);\n            break;\n          }\n        } else {\n          const min = Math.min(before, after);\n          const max = Math.max(before, after);\n\n          if (coordinate > (min + cur) / 2 && coordinate <= (max + cur) / 2) {\n            ({ index } = unsortedTicks[i]);\n            break;\n          }\n        }\n      }\n    } else {\n      // ticks are distributed in a single direction\n      for (let i = 0; i < len; i++) {\n        if (\n          (i === 0 && coordinate <= (ticks[i].coordinate + ticks[i + 1].coordinate) / 2) ||\n          (i > 0 &&\n            i < len - 1 &&\n            coordinate > (ticks[i].coordinate + ticks[i - 1].coordinate) / 2 &&\n            coordinate <= (ticks[i].coordinate + ticks[i + 1].coordinate) / 2) ||\n          (i === len - 1 && coordinate > (ticks[i].coordinate + ticks[i - 1].coordinate) / 2)\n        ) {\n          ({ index } = ticks[i]);\n          break;\n        }\n      }\n    }\n  } else {\n    index = 0;\n  }\n\n  return index;\n};\n\n/**\n * Get the main color of each graphic item\n * @param  {ReactElement} item A graphic item\n * @return {String}            Color\n */\nexport const getMainColorOfGraphicItem = (item: ReactElement) => {\n  const {\n    type: { displayName },\n  } = item as any; // TODO: check if displayName is valid.\n  const { stroke, fill } = item.props;\n  let result;\n\n  switch (displayName) {\n    case 'Line':\n      result = stroke;\n      break;\n    case 'Area':\n    case 'Radar':\n      result = stroke && stroke !== 'none' ? stroke : fill;\n      break;\n    default:\n      result = fill;\n      break;\n  }\n\n  return result;\n};\n\n// TODO: Formated -> Formatted.\ninterface FormatedGraphicalItem {\n  props: any;\n  childIndex: number;\n  item: any;\n}\n\nexport const getLegendProps = ({\n  children,\n  formatedGraphicalItems,\n  legendWidth,\n  legendContent,\n}: {\n  children: any;\n  formatedGraphicalItems?: Array<FormatedGraphicalItem>;\n  legendWidth: number;\n  legendContent?: any;\n}) => {\n  const legendItem = findChildByType(children, Legend.displayName);\n  if (!legendItem) {\n    return null;\n  }\n\n  let legendData;\n  if (legendItem.props && legendItem.props.payload) {\n    legendData = legendItem.props && legendItem.props.payload;\n  } else if (legendContent === 'children') {\n    legendData = (formatedGraphicalItems || []).reduce((result, { item, props }) => {\n      const data = props.sectors || props.data || [];\n\n      return result.concat(\n        data.map((entry: any) => ({\n          type: legendItem.props.iconType || item.props.legendType,\n          value: entry.name,\n          color: entry.fill,\n          payload: entry,\n        })),\n      );\n    }, []);\n  } else {\n    legendData = (formatedGraphicalItems || []).map(({ item }) => {\n      const { dataKey, name, legendType, hide } = item.props;\n\n      return {\n        inactive: hide,\n        dataKey,\n        type: legendItem.props.iconType || legendType || 'square',\n        color: getMainColorOfGraphicItem(item),\n        value: name || dataKey,\n        payload: item.props,\n      };\n    });\n  }\n\n  return {\n    ...legendItem.props,\n    ...Legend.getWithHeight(legendItem, legendWidth),\n    payload: legendData,\n    item: legendItem,\n  };\n};\n/**\n * Calculate the size of all groups for stacked bar graph\n * @param  {Object} stackGroups The items grouped by axisId and stackId\n * @return {Object} The size of all groups\n */\nexport const getBarSizeList = ({\n  barSize: globalSize,\n  stackGroups = {},\n}: {\n  barSize: number | string;\n  stackGroups: any;\n}) => {\n  if (!stackGroups) {\n    return {};\n  }\n\n  const result: Record<string, any> = {};\n  const numericAxisIds = Object.keys(stackGroups);\n\n  for (let i = 0, len = numericAxisIds.length; i < len; i++) {\n    const sgs = stackGroups[numericAxisIds[i]].stackGroups;\n    const stackIds = Object.keys(sgs);\n\n    for (let j = 0, sLen = stackIds.length; j < sLen; j++) {\n      const { items, cateAxisId } = sgs[stackIds[j]];\n\n      const barItems = items.filter((item: any) => getDisplayName(item.type).indexOf('Bar') >= 0);\n\n      if (barItems && barItems.length) {\n        const { barSize: selfSize } = barItems[0].props;\n        const cateId = barItems[0].props[cateAxisId];\n\n        if (!result[cateId]) {\n          result[cateId] = [];\n        }\n\n        result[cateId].push({\n          item: barItems[0],\n          stackList: barItems.slice(1),\n          barSize: _.isNil(selfSize) ? globalSize : selfSize,\n        });\n      }\n    }\n  }\n\n  return result;\n};\n\n/**\n * Calculate the size of each bar and the gap between two bars\n * @param  {Number} bandSize  The size of each category\n * @param  {sizeList} sizeList  The size of all groups\n * @param  {maxBarSize} maxBarSize The maximum size of bar\n * @return {Number} The size of each bar and the gap between two bars\n */\nexport const getBarPosition = ({\n  barGap,\n  barCategoryGap,\n  bandSize,\n  sizeList = [],\n  maxBarSize,\n}: {\n  barGap: string | number;\n  barCategoryGap: string | number;\n  bandSize: number;\n  sizeList: Array<any>;\n  maxBarSize: number;\n}) => {\n  const len = sizeList.length;\n  if (len < 1) return null;\n\n  let realBarGap = getPercentValue(barGap, bandSize, 0, true);\n  let result;\n\n  // whether or not is barSize setted by user\n  if (sizeList[0].barSize === +sizeList[0].barSize) {\n    let useFull = false;\n    let fullBarSize = bandSize / len;\n    let sum = sizeList.reduce((res, entry) => res + entry.barSize || 0, 0);\n    sum += (len - 1) * realBarGap;\n\n    if (sum >= bandSize) {\n      sum -= (len - 1) * realBarGap;\n      realBarGap = 0;\n    }\n    if (sum >= bandSize && fullBarSize > 0) {\n      useFull = true;\n      fullBarSize *= 0.9;\n      sum = len * fullBarSize;\n    }\n\n    const offset = ((bandSize - sum) / 2) >> 0;\n    let prev = { offset: offset - realBarGap, size: 0 };\n\n    result = sizeList.reduce((res, entry) => {\n      const newRes = [\n        ...res,\n        {\n          item: entry.item,\n          position: {\n            offset: prev.offset + prev.size + realBarGap,\n            size: useFull ? fullBarSize : entry.barSize,\n          },\n        },\n      ];\n\n      prev = newRes[newRes.length - 1].position;\n\n      if (entry.stackList && entry.stackList.length) {\n        entry.stackList.forEach((item: any) => {\n          newRes.push({ item, position: prev });\n        });\n      }\n      return newRes;\n    }, []);\n  } else {\n    const offset = getPercentValue(barCategoryGap, bandSize, 0, true);\n\n    if (bandSize - 2 * offset - (len - 1) * realBarGap <= 0) {\n      realBarGap = 0;\n    }\n\n    let originalSize = (bandSize - 2 * offset - (len - 1) * realBarGap) / len;\n    if (originalSize > 1) {\n      originalSize >>= 0;\n    }\n    const size = maxBarSize === +maxBarSize ? Math.min(originalSize, maxBarSize) : originalSize;\n\n    result = sizeList.reduce((res, entry, i) => {\n      const newRes = [\n        ...res,\n        {\n          item: entry.item,\n          position: {\n            offset: offset + (originalSize + realBarGap) * i + (originalSize - size) / 2,\n            size,\n          },\n        },\n      ];\n\n      if (entry.stackList && entry.stackList.length) {\n        entry.stackList.forEach((item: any) => {\n          newRes.push({ item, position: newRes[newRes.length - 1].position });\n        });\n      }\n      return newRes;\n    }, []);\n  }\n\n  return result;\n};\n\nexport const appendOffsetOfLegend = (offset: any, items: Array<FormatedGraphicalItem>, props: any, legendBox: any) => {\n  const { children, width, margin } = props;\n  const legendWidth = width - (margin.left || 0) - (margin.right || 0);\n  // const legendHeight = height - (margin.top || 0) - (margin.bottom || 0);\n  const legendProps = getLegendProps({ children, legendWidth });\n  let newOffset = offset;\n\n  if (legendProps) {\n    const box = legendBox || {};\n    const { align, verticalAlign, layout } = legendProps;\n\n    if ((layout === 'vertical' || (layout === 'horizontal' && verticalAlign === 'center')) && isNumber(offset[align])) {\n      newOffset = { ...offset, [align]: newOffset[align] + (box.width || 0) };\n    }\n\n    if ((layout === 'horizontal' || (layout === 'vertical' && align === 'center')) && isNumber(offset[verticalAlign])) {\n      newOffset = { ...offset, [verticalAlign]: newOffset[verticalAlign] + (box.height || 0) };\n    }\n  }\n\n  return newOffset;\n};\n\nexport const getDomainOfErrorBars = (data: any[], item: any, dataKey: any, axisType?: AxisType) => {\n  const { children } = item.props;\n  const errorBars = findAllByType(children, 'ErrorBar').filter((errorBarChild: any) => {\n    const { direction } = errorBarChild.props;\n\n    return _.isNil(direction) || _.isNil(axisType) ? true : axisType.indexOf(direction) >= 0;\n  });\n\n  if (errorBars && errorBars.length) {\n    const keys = errorBars.map((errorBarChild: any) => errorBarChild.props.dataKey);\n\n    return data.reduce(\n      (result, entry) => {\n        const entryValue = getValueByDataKey(entry, dataKey, 0);\n        const mainValue = _.isArray(entryValue) ? [_.min(entryValue), _.max(entryValue)] : [entryValue, entryValue];\n        const errorDomain = keys.reduce(\n          (prevErrorArr: [number, number], k: any) => {\n            const errorValue = getValueByDataKey(entry, k, 0);\n            const lowerValue = mainValue[0] - Math.abs(_.isArray(errorValue) ? errorValue[0] : errorValue);\n            const upperValue = mainValue[1] + Math.abs(_.isArray(errorValue) ? errorValue[1] : errorValue);\n\n            return [Math.min(lowerValue, prevErrorArr[0]), Math.max(upperValue, prevErrorArr[1])];\n          },\n          [Infinity, -Infinity],\n        );\n\n        return [Math.min(errorDomain[0], result[0]), Math.max(errorDomain[1], result[1])];\n      },\n      [Infinity, -Infinity],\n    );\n  }\n\n  return null;\n};\nexport const parseErrorBarsOfAxis = (data: any[], items: any[], dataKey: any, axisType: AxisType) => {\n  const domains = items\n    .map(item => getDomainOfErrorBars(data, item, dataKey, axisType))\n    .filter(entry => !_.isNil(entry));\n\n  if (domains && domains.length) {\n    return domains.reduce((result, entry) => [Math.min(result[0], entry[0]), Math.max(result[1], entry[1])], [\n      Infinity,\n      -Infinity,\n    ]);\n  }\n\n  return null;\n};\n/**\n * Get domain of data by the configuration of item element\n * @param  {Array}   data      The data displayed in the chart\n * @param  {Array}   items     The instances of item\n * @param  {String}  type      The type of axis, number - Number Axis, category - Category Axis\n * @param  {Boolean} filterNil Whether or not filter nil values\n * @return {Array}        Domain\n */\nexport const getDomainOfItemsWithSameAxis = (data: any[], items: any[], type: string, filterNil?: boolean) => {\n  const domains = items.map(item => {\n    const { dataKey } = item.props;\n\n    if (type === 'number' && dataKey) {\n      return getDomainOfErrorBars(data, item, dataKey) || getDomainOfDataByKey(data, dataKey, type, filterNil);\n    }\n    return getDomainOfDataByKey(data, dataKey, type, filterNil);\n  });\n\n  if (type === 'number') {\n    // Calculate the domain of number axis\n    return domains.reduce((result, entry) => [Math.min(result[0], entry[0]), Math.max(result[1], entry[1])], [\n      Infinity,\n      -Infinity,\n    ]);\n  }\n\n  const tag: Record<string, any> = {};\n  // Get the union set of category axis\n  return domains.reduce((result, entry) => {\n    for (let i = 0, len = entry.length; i < len; i++) {\n      if (!tag[entry[i]]) {\n        tag[entry[i]] = true;\n\n        result.push(entry[i]);\n      }\n    }\n    return result;\n  }, []);\n};\n\nexport const isCategoricalAxis = (layout: LayoutType | PolarLayoutType, axisType: AxisType) =>\n  (layout === 'horizontal' && axisType === 'xAxis') ||\n  (layout === 'vertical' && axisType === 'yAxis') ||\n  (layout === 'centric' && axisType === 'angleAxis') ||\n  (layout === 'radial' && axisType === 'radiusAxis');\n\n/**\n * Calculate the Coordinates of grid\n * @param  {Array} ticks The ticks in axis\n * @param {Number} min   The minimun value of axis\n * @param {Number} max   The maximun value of axis\n * @return {Array}       Coordinates\n */\nexport const getCoordinatesOfGrid = (ticks: Array<TickItem>, min: number, max: number) => {\n  let hasMin, hasMax;\n\n  const values = ticks.map(entry => {\n    if (entry.coordinate === min) {\n      hasMin = true;\n    }\n    if (entry.coordinate === max) {\n      hasMax = true;\n    }\n\n    return entry.coordinate;\n  });\n\n  if (!hasMin) {\n    values.push(min);\n  }\n  if (!hasMax) {\n    values.push(max);\n  }\n\n  return values;\n};\n\n/**\n * Get the ticks of an axis\n * @param  {Object}  axis The configuration of an axis\n * @param {Boolean} isGrid Whether or not are the ticks in grid\n * @param {Boolean} isAll Return the ticks of all the points or not\n * @return {Array}  Ticks\n */\nexport const getTicksOfAxis = (axis: any, isGrid?: boolean, isAll?: boolean): TickItem[] => {\n  if (!axis) return null;\n  const { scale } = axis;\n  const { duplicateDomain, type, range } = axis;\n  let offset = (isGrid || isAll) && type === 'category' && scale.bandwidth ? scale.bandwidth() / 2 : 0;\n  offset = axis.axisType === 'angleAxis' ? mathSign(range[0] - range[1]) * 2 * offset : offset;\n\n  // The ticks setted by user should only affect the ticks adjacent to axis line\n  if (isGrid && (axis.ticks || axis.niceTicks)) {\n    return (axis.ticks || axis.niceTicks).map((entry: TickItem) => {\n      const scaleContent = duplicateDomain ? duplicateDomain.indexOf(entry) : entry;\n\n      return {\n        coordinate: scale(scaleContent) + offset,\n        value: entry,\n        offset,\n      };\n    });\n  }\n\n  // When axis is a categorial axis, but the type of axis is number or the scale of axis is not \"auto\"\n  if (axis.isCategorical && axis.categoricalDomain) {\n    return axis.categoricalDomain.map((entry: any, index: number) => ({\n      coordinate: scale(entry) + offset,\n      value: entry,\n      index,\n      offset,\n    }));\n  }\n\n  if (scale.ticks && !isAll) {\n    return scale\n      .ticks(axis.tickCount)\n      .map((entry: any) => ({ coordinate: scale(entry) + offset, value: entry, offset }));\n  }\n\n  // When axis has duplicated text, serial numbers are used to generate scale\n  return scale.domain().map((entry: any, index: number) => ({\n    coordinate: scale(entry) + offset,\n    value: duplicateDomain ? duplicateDomain[entry] : entry,\n    index,\n    offset,\n  }));\n};\n\n/**\n * combine the handlers\n * @param  {Function} defaultHandler Internal private handler\n * @param  {Function} parentHandler  Handler function specified in parent component\n * @param  {Function} childHandler   Handler function specified in child component\n * @return {Function}                The combined handler\n */\nexport const combineEventHandlers = (defaultHandler: Function, parentHandler: Function, childHandler: Function) => {\n  let customizedHandler: Function;\n\n  if (_.isFunction(childHandler)) {\n    customizedHandler = childHandler;\n  } else if (_.isFunction(parentHandler)) {\n    customizedHandler = parentHandler;\n  }\n\n  if (_.isFunction(defaultHandler) || customizedHandler) {\n    return (arg1: any, arg2: any, arg3: any, arg4: any) => {\n      if (_.isFunction(defaultHandler)) {\n        defaultHandler(arg1, arg2, arg3, arg4);\n      }\n      if (_.isFunction(customizedHandler)) {\n        customizedHandler(arg1, arg2, arg3, arg4);\n      }\n    };\n  }\n\n  return null;\n};\n/**\n * Parse the scale function of axis\n * @param  {Object}   axis          The option of axis\n * @param  {String}   chartType     The displayName of chart\n * @return {Function}               The scale funcion\n */\nexport const parseScale = (axis: any, chartType: string) => {\n  const { scale, type, layout, axisType } = axis;\n  if (scale === 'auto') {\n    if (layout === 'radial' && axisType === 'radiusAxis') {\n      return { scale: d3Scales.scaleBand(), realScaleType: 'band' };\n    }\n    if (layout === 'radial' && axisType === 'angleAxis') {\n      return { scale: d3Scales.scaleLinear(), realScaleType: 'linear' };\n    }\n\n    if (\n      type === 'category' &&\n      chartType &&\n      (chartType.indexOf('LineChart') >= 0 ||\n        chartType.indexOf('AreaChart') >= 0 ||\n        chartType.indexOf('ComposedChart') >= 0)\n    ) {\n      return { scale: d3Scales.scalePoint(), realScaleType: 'point' };\n    }\n    if (type === 'category') {\n      return { scale: d3Scales.scaleBand(), realScaleType: 'band' };\n    }\n\n    return { scale: d3Scales.scaleLinear(), realScaleType: 'linear' };\n  }\n  if (_.isString(scale)) {\n    const name = `scale${_.upperFirst(scale)}`;\n\n    return {\n      scale: ((d3Scales as Record<string, any>)[name] || d3Scales.scalePoint)(),\n      realScaleType: (d3Scales as Record<string, any>)[name] ? name : 'point',\n    };\n  }\n\n  return _.isFunction(scale) ? { scale } : { scale: d3Scales.scalePoint(), realScaleType: 'point' };\n};\nconst EPS = 1e-4;\nexport const checkDomainOfScale = (scale: any) => {\n  const domain = scale.domain();\n\n  if (!domain || domain.length <= 2) {\n    return;\n  }\n\n  const len = domain.length;\n  const range = scale.range();\n  const min = Math.min(range[0], range[1]) - EPS;\n  const max = Math.max(range[0], range[1]) + EPS;\n  const first = scale(domain[0]);\n  const last = scale(domain[len - 1]);\n\n  if (first < min || first > max || last < min || last > max) {\n    scale.domain([domain[0], domain[len - 1]]);\n  }\n};\n\nexport const findPositionOfBar = (barPosition: any[], child: ReactNode) => {\n  if (!barPosition) {\n    return null;\n  }\n\n  for (let i = 0, len = barPosition.length; i < len; i++) {\n    if (barPosition[i].item === child) {\n      return barPosition[i].position;\n    }\n  }\n\n  return null;\n};\n\nexport const truncateByDomain = (value: any[], domain: any[]) => {\n  if (!domain || domain.length !== 2 || !isNumber(domain[0]) || !isNumber(domain[1])) {\n    return value;\n  }\n\n  const min = Math.min(domain[0], domain[1]);\n  const max = Math.max(domain[0], domain[1]);\n\n  const result = [value[0], value[1]];\n  if (!isNumber(value[0]) || value[0] < min) {\n    result[0] = min;\n  }\n\n  if (!isNumber(value[1]) || value[1] > max) {\n    result[1] = max;\n  }\n\n  if (result[0] > max) {\n    result[0] = max;\n  }\n\n  if (result[1] < min) {\n    result[1] = min;\n  }\n\n  return result;\n};\n\n/* eslint no-param-reassign: 0 */\nexport const offsetSign = (series: any) => {\n  const n = series.length;\n  if (n <= 0) {\n    return;\n  }\n\n  for (let j = 0, m = series[0].length; j < m; ++j) {\n    let positive = 0;\n    let negative = 0;\n\n    for (let i = 0; i < n; ++i) {\n      const value = _.isNaN(series[i][j][1]) ? series[i][j][0] : series[i][j][1];\n\n      /* eslint-disable prefer-destructuring */\n      if (value >= 0) {\n        series[i][j][0] = positive;\n        series[i][j][1] = positive + value;\n        positive = series[i][j][1];\n      } else {\n        series[i][j][0] = negative;\n        series[i][j][1] = negative + value;\n        negative = series[i][j][1];\n      }\n      /* eslint-enable prefer-destructuring */\n    }\n  }\n};\n\nconst STACK_OFFSET_MAP: Record<string, any> = {\n  sign: offsetSign,\n  expand: stackOffsetExpand,\n  none: stackOffsetNone,\n  silhouette: stackOffsetSilhouette,\n  wiggle: stackOffsetWiggle,\n};\n\nexport const getStackedData = (data: any, stackItems: any, offsetType: string) => {\n  const dataKeys = stackItems.map((item: any) => item.props.dataKey);\n  const stack = shapeStack()\n    .keys(dataKeys)\n    .value((d, key) => Math.max(+getValueByDataKey(d, key, 0), 0))\n    .order(stackOrderNone)\n    .offset(STACK_OFFSET_MAP[offsetType]);\n\n  return stack(data);\n};\n\nexport const getStackGroupsByAxisId = (\n  data: any,\n  _items: Array<any>,\n  numericAxisId: string,\n  cateAxisId: string,\n  offsetType: any,\n  reverseStackOrder: boolean,\n) => {\n  if (!data) {\n    return null;\n  }\n\n  // reversing items to affect render order (for layering)\n  const items = reverseStackOrder ? _items.reverse() : _items;\n\n  const stackGroups = items.reduce((result, item) => {\n    const { stackId, hide } = item.props;\n\n    if (hide) {\n      return result;\n    }\n\n    const axisId = item.props[numericAxisId];\n    const parentGroup = result[axisId] || { hasStack: false, stackGroups: {} };\n\n    if (isNumOrStr(stackId)) {\n      const childGroup = parentGroup.stackGroups[stackId] || {\n        numericAxisId,\n        cateAxisId,\n        items: [],\n      };\n\n      childGroup.items.push(item);\n\n      parentGroup.hasStack = true;\n\n      parentGroup.stackGroups[stackId] = childGroup;\n    } else {\n      parentGroup.stackGroups[uniqueId('_stackId_')] = {\n        numericAxisId,\n        cateAxisId,\n        items: [item],\n      };\n    }\n\n    return { ...result, [axisId]: parentGroup };\n  }, {});\n\n  return Object.keys(stackGroups).reduce((result, axisId) => {\n    const group = stackGroups[axisId];\n\n    if (group.hasStack) {\n      group.stackGroups = Object.keys(group.stackGroups).reduce((res, stackId) => {\n        const g = group.stackGroups[stackId];\n\n        return {\n          ...res,\n          [stackId]: {\n            numericAxisId,\n            cateAxisId,\n            items: g.items,\n            stackedData: getStackedData(data, g.items, offsetType),\n          },\n        };\n      }, {});\n    }\n\n    return { ...result, [axisId]: group };\n  }, {});\n};\n\n/**\n * get domain of ticks\n * @param  {Array} ticks Ticks of axis\n * @param  {String} type  The type of axis\n * @return {Array} domain\n */\nexport const calculateDomainOfTicks = (ticks: Array<TickItem>, type: string) => {\n  if (type === 'number') {\n    return [_.min(ticks), _.max(ticks)];\n  }\n\n  return ticks;\n};\n\n/**\n * Configure the scale function of axis\n * @param {Object} scale The scale function\n * @param {Object} opts  The configuration of axis\n * @return {Object}      null\n */\nexport const getTicksOfScale = (scale: any, opts: any) => {\n  const { realScaleType, type, tickCount, originalDomain, allowDecimals } = opts;\n  const scaleType = realScaleType || opts.scale;\n\n  if (scaleType !== 'auto' && scaleType !== 'linear') {\n    return null;\n  }\n\n  if (\n    tickCount &&\n    type === 'number' &&\n    originalDomain &&\n    (originalDomain[0] === 'auto' || originalDomain[1] === 'auto')\n  ) {\n    // Calculate the ticks by the number of grid when the axis is a number axis\n    const domain = scale.domain();\n    if (!domain.length) {\n      return null;\n    }\n    const tickValues = getNiceTickValues(domain, tickCount, allowDecimals);\n\n    scale.domain(calculateDomainOfTicks(tickValues, type));\n\n    return { niceTicks: tickValues };\n  }\n  if (tickCount && type === 'number') {\n    const domain = scale.domain();\n    const tickValues = getTickValuesFixedDomain(domain, tickCount, allowDecimals);\n\n    return { niceTicks: tickValues };\n  }\n\n  return null;\n};\n\nexport const getCateCoordinateOfLine = ({\n  axis,\n  ticks,\n  bandSize,\n  entry,\n  index,\n  dataKey,\n}: {\n  axis: any;\n  ticks: Array<TickItem>;\n  bandSize: number;\n  entry: any;\n  index: number;\n  dataKey?: string | number | ((obj: any) => any);\n}) => {\n  if (axis.type === 'category') {\n    // find coordinate of category axis by the value of category\n    if (!axis.allowDuplicatedCategory && axis.dataKey && !_.isNil(entry[axis.dataKey])) {\n      const matchedTick = findEntryInArray(ticks, 'value', entry[axis.dataKey]);\n\n      if (matchedTick) {\n        return matchedTick.coordinate + bandSize / 2;\n      }\n    }\n\n    return ticks[index] ? ticks[index].coordinate + bandSize / 2 : null;\n  }\n\n  const value = getValueByDataKey(entry, !_.isNil(dataKey) ? dataKey : axis.dataKey);\n\n  return !_.isNil(value) ? axis.scale(value) : null;\n};\n\nexport const getCateCoordinateOfBar = ({\n  axis,\n  ticks,\n  offset,\n  bandSize,\n  entry,\n  index,\n}: {\n  axis: any; // RadiusAxisProps & { dataKey?: any }; // TODO: should dataKey be included in RadiusAxisProps?\n  ticks: Array<TickItem>;\n  offset: any;\n  bandSize: number;\n  entry: any;\n  index: number;\n}) => {\n  if (axis.type === 'category') {\n    return ticks[index] ? ticks[index].coordinate + offset : null;\n  }\n  const value = getValueByDataKey(entry, axis.dataKey, axis.domain[index]);\n\n  return !_.isNil(value) ? axis.scale(value) - bandSize / 2 + offset : null;\n};\n\nexport const getBaseValueOfBar = ({\n  numericAxis,\n}: {\n  numericAxis: any; // AngleAxisProps | RadiusAxisProps\n}) => {\n  const domain = numericAxis.scale.domain();\n\n  if (numericAxis.type === 'number') {\n    const min = Math.min(domain[0], domain[1]);\n    const max = Math.max(domain[0], domain[1]);\n\n    if (min <= 0 && max >= 0) {\n      return 0;\n    }\n    if (max < 0) {\n      return max;\n    }\n\n    return min;\n  }\n\n  return domain[0];\n};\n\nexport const getStackedDataOfItem = (item: any, stackGroups: any) => {\n  const { stackId } = item.props;\n\n  if (isNumOrStr(stackId)) {\n    const group = stackGroups[stackId];\n\n    if (group && group.items.length) {\n      let itemIndex = -1;\n\n      for (let i = 0, len = group.items.length; i < len; i++) {\n        if (group.items[i] === item) {\n          itemIndex = i;\n          break;\n        }\n      }\n      return itemIndex >= 0 ? group.stackedData[itemIndex] : null;\n    }\n  }\n\n  return null;\n};\n\nconst getDomainOfSingle = (data: Array<any>) =>\n  data.reduce(\n    (result, entry) => [\n      _.min(entry.concat([result[0]]).filter(isNumber)),\n      _.max(entry.concat([result[1]]).filter(isNumber)),\n    ],\n    [Infinity, -Infinity],\n  );\n\nexport const getDomainOfStackGroups = (stackGroups: any, startIndex: number, endIndex: number) =>\n  Object.keys(stackGroups)\n    .reduce(\n      (result, stackId) => {\n        const group = stackGroups[stackId];\n        const { stackedData } = group;\n        const domain = stackedData.reduce(\n          (res: [number, number], entry: any) => {\n            const s = getDomainOfSingle(entry.slice(startIndex, endIndex + 1));\n\n            return [Math.min(res[0], s[0]), Math.max(res[1], s[1])];\n          },\n          [Infinity, -Infinity],\n        );\n\n        return [Math.min(domain[0], result[0]), Math.max(domain[1], result[1])];\n      },\n      [Infinity, -Infinity],\n    )\n    .map(result => (result === Infinity || result === -Infinity ? 0 : result));\n\nexport const MIN_VALUE_REG = /^dataMin[\\s]*-[\\s]*([0-9]+([.]{1}[0-9]+){0,1})$/;\nexport const MAX_VALUE_REG = /^dataMax[\\s]*\\+[\\s]*([0-9]+([.]{1}[0-9]+){0,1})$/;\n\nexport const parseSpecifiedDomain = (specifiedDomain: any, dataDomain: any, allowDataOverflow: boolean) => {\n  if (!_.isArray(specifiedDomain)) {\n    return dataDomain;\n  }\n\n  const domain = [];\n\n  /* eslint-disable prefer-destructuring */\n  if (isNumber(specifiedDomain[0])) {\n    domain[0] = allowDataOverflow ? specifiedDomain[0] : Math.min(specifiedDomain[0], dataDomain[0]);\n  } else if (MIN_VALUE_REG.test(specifiedDomain[0])) {\n    const value = +MIN_VALUE_REG.exec(specifiedDomain[0])[1];\n\n    domain[0] = dataDomain[0] - value;\n  } else if (_.isFunction(specifiedDomain[0])) {\n    domain[0] = specifiedDomain[0](dataDomain[0]);\n  } else {\n    domain[0] = dataDomain[0];\n  }\n\n  if (isNumber(specifiedDomain[1])) {\n    domain[1] = allowDataOverflow ? specifiedDomain[1] : Math.max(specifiedDomain[1], dataDomain[1]);\n  } else if (MAX_VALUE_REG.test(specifiedDomain[1])) {\n    const value = +MAX_VALUE_REG.exec(specifiedDomain[1])[1];\n\n    domain[1] = dataDomain[1] + value;\n  } else if (_.isFunction(specifiedDomain[1])) {\n    domain[1] = specifiedDomain[1](dataDomain[1]);\n  } else {\n    domain[1] = dataDomain[1];\n  }\n  /* eslint-enable prefer-destructuring */\n\n  return domain;\n};\n\n/**\n * Calculate the size between two category\n * @param  {Object} axis  The options of axis\n * @param  {Array}  ticks The ticks of axis\n * @param  {Boolean} isBar if items in axis are bars\n * @return {Number} Size\n */\nexport const getBandSizeOfAxis = (axis: any, ticks?: Array<TickItem>, isBar?: boolean) => {\n  if (axis && axis.scale && axis.scale.bandwidth) {\n    const bandWidth = axis.scale.bandwidth();\n\n    if (!isBar || bandWidth > 0) {\n      return bandWidth;\n    }\n  }\n\n  if (axis && ticks && ticks.length >= 2) {\n    const orderedTicks = _.sortBy(ticks, o => o.coordinate);\n    let bandSize = Infinity;\n\n    for (let i = 1, len = orderedTicks.length; i < len; i++) {\n      const cur = orderedTicks[i];\n      const prev = orderedTicks[i - 1];\n\n      bandSize = Math.min((cur.coordinate || 0) - (prev.coordinate || 0), bandSize);\n    }\n\n    return bandSize === Infinity ? 0 : bandSize;\n  }\n\n  return 0;\n};\n/**\n * parse the domain of a category axis when a domain is specified\n * @param   {Array}        specifiedDomain  The domain specified by users\n * @param   {Array}        calculatedDomain The domain calculated by dateKey\n * @param   {ReactElement} axisChild        The axis element\n * @returns {Array}        domains\n */\nexport const parseDomainOfCategoryAxis = (\n  specifiedDomain: Array<any>,\n  calculatedDomain: Array<any>,\n  axisChild: ReactElement,\n) => {\n  if (!specifiedDomain || !specifiedDomain.length) {\n    return calculatedDomain;\n  }\n\n  if (_.isEqual(specifiedDomain, _.get(axisChild, 'type.defaultProps.domain'))) {\n    return calculatedDomain;\n  }\n\n  return specifiedDomain;\n};\n","export const COLOR_PANEL = [\n  '#1890FF',\n  '#66B5FF',\n  '#41D9C7',\n  '#2FC25B',\n  '#6EDB8F',\n  '#9AE65C',\n  '#FACC14',\n  '#E6965C',\n  '#57AD71',\n  '#223273',\n  '#738AE6',\n  '#7564CC',\n  '#8543E0',\n  '#A877ED',\n  '#5C8EE6',\n  '#13C2C2',\n  '#70E0E0',\n  '#5CA3E6',\n  '#3436C7',\n  '#8082FF',\n  '#DD81E6',\n  '#F04864',\n  '#FA7D92',\n  '#D598D9',\n];\n","const PREFIX_LIST = ['Webkit', 'Moz', 'O', 'ms'];\n\nexport const generatePrefixStyle = (name: string, value: string) => {\n  if (!name) {\n    return null;\n  }\n\n  const camelName = name.replace(/(\\w)/, v => v.toUpperCase());\n  const result: Record<string, string> = PREFIX_LIST.reduce(\n    (res, entry) => ({\n      ...res,\n      [entry + camelName]: value,\n    }),\n    {},\n  );\n\n  result[name] = value;\n\n  return result;\n};\n","import { CSSProperties, MouseEvent } from 'react';\nimport Global from './Global';\n\ninterface StringCache {\n  widthCache: Record<string, any>;\n  cacheCount: number;\n}\n\nconst stringCache: StringCache = {\n  widthCache: {},\n  cacheCount: 0,\n};\nconst MAX_CACHE_NUM = 2000;\nconst SPAN_STYLE = {\n  position: 'absolute',\n  top: '-20000px',\n  left: 0,\n  padding: 0,\n  margin: 0,\n  border: 'none',\n  whiteSpace: 'pre',\n};\nconst STYLE_LIST = [\n  'minWidth',\n  'maxWidth',\n  'width',\n  'minHeight',\n  'maxHeight',\n  'height',\n  'top',\n  'left',\n  'fontSize',\n  'lineHeight',\n  'padding',\n  'margin',\n  'paddingLeft',\n  'paddingRight',\n  'paddingTop',\n  'paddingBottom',\n  'marginLeft',\n  'marginRight',\n  'marginTop',\n  'marginBottom',\n];\nconst MEASUREMENT_SPAN_ID = 'recharts_measurement_span';\n\nfunction autoCompleteStyle(name: string, value: number) {\n  if (STYLE_LIST.indexOf(name) >= 0 && value === +value) {\n    return `${value}px`;\n  }\n\n  return value;\n}\n\nfunction camelToMiddleLine(text: string) {\n  const strs = text.split('');\n\n  const formatStrs = strs.reduce((result, entry) => {\n    if (entry === entry.toUpperCase()) {\n      return [...result, '-', entry.toLowerCase()];\n    }\n\n    return [...result, entry];\n  }, []);\n\n  return formatStrs.join('');\n}\n\nexport const getStyleString = (style: CSSProperties) =>\n  Object.keys(style).reduce(\n    (result, s) => `${result}${camelToMiddleLine(s)}:${autoCompleteStyle(s, (style as Record<string, any>)[s])};`,\n    '',\n  );\n\nexport const getStringSize = (text: string | number, style: CSSProperties = {}) => {\n  if (text === undefined || text === null || Global.isSsr) {\n    return { width: 0, height: 0 };\n  }\n\n  const str = `${text}`;\n  const styleString = getStyleString(style);\n  const cacheKey = `${str}-${styleString}`;\n\n  if (stringCache.widthCache[cacheKey]) {\n    return stringCache.widthCache[cacheKey];\n  }\n\n  try {\n    let measurementSpan = document.getElementById(MEASUREMENT_SPAN_ID);\n    if (!measurementSpan) {\n      measurementSpan = document.createElement('span');\n      measurementSpan.setAttribute('id', MEASUREMENT_SPAN_ID);\n      document.body.appendChild(measurementSpan);\n    }\n    // Need to use CSS Object Model (CSSOM) to be able to comply with Content Security Policy (CSP)\n    // https://en.wikipedia.org/wiki/Content_Security_Policy\n    const measurementSpanStyle: Record<string, any> = { ...SPAN_STYLE, ...style };\n    Object.keys(measurementSpanStyle).map(styleKey => {\n      (measurementSpan.style as Record<string, any>)[styleKey] = measurementSpanStyle[styleKey];\n      return styleKey;\n    });\n\n    measurementSpan.textContent = str;\n\n    const rect = measurementSpan.getBoundingClientRect();\n    const result = { width: rect.width, height: rect.height };\n\n    stringCache.widthCache[cacheKey] = result;\n\n    if (++stringCache.cacheCount > MAX_CACHE_NUM) {\n      stringCache.cacheCount = 0;\n      stringCache.widthCache = {};\n    }\n\n    return result;\n  } catch (e) {\n    return { width: 0, height: 0 };\n  }\n};\n\ninterface ContainerOffset {\n  top: number;\n  left: number;\n}\n\nexport const getOffset = (el: HTMLElement): ContainerOffset => {\n  const html = el.ownerDocument.documentElement;\n  let box = { top: 0, left: 0 };\n\n  // If we don't have gBCR, just use 0,0 rather than error\n  // BlackBerry 5, iOS 3 (original iPhone)\n  if (typeof el.getBoundingClientRect !== 'undefined') {\n    box = el.getBoundingClientRect();\n  }\n\n  return {\n    top: box.top + window.pageYOffset - html.clientTop,\n    left: box.left + window.pageXOffset - html.clientLeft,\n  };\n};\n\n/**\n * Calculate coordinate of cursor in chart\n * @param  {Object} event  Event object\n * @param  {Object} offset The offset of main part in the svg element\n * @return {Object}        {chartX, chartY}\n */\nexport const calculateChartCoordinate = (event: MouseEvent, offset: ContainerOffset) => ({\n  chartX: Math.round(event.pageX - offset.left),\n  chartY: Math.round(event.pageY - offset.top),\n});\n","import _ from 'lodash';\n\nexport const mathSign = (value: number) => {\n  if (value === 0) {\n    return 0;\n  }\n  if (value > 0) {\n    return 1;\n  }\n\n  return -1;\n};\n\nexport const isPercent = (value: string | number) => _.isString(value) && value.indexOf('%') === value.length - 1;\n\nexport const isNumber = (value: any) => _.isNumber(value) && !_.isNaN(value);\n\nexport const isNumOrStr = (value: number | string) => isNumber(value as number) || _.isString(value);\n\nlet idCounter = 0;\nexport const uniqueId = (prefix?: string) => {\n  const id = ++idCounter;\n\n  return `${prefix || ''}${id}`;\n};\n/**\n * Get percent value of a total value\n * @param {Number|String} percent A percent\n * @param {Number} totalValue     Total value\n * @param {NUmber} defaultValue   The value returned when percent is undefined or invalid\n * @param {Boolean} validate      If set to be true, the result will be validated\n * @return {Number} value\n */\nexport const getPercentValue = (percent: number | string, totalValue: number, defaultValue = 0, validate = false) => {\n  if (!isNumber(percent as number) && !_.isString(percent)) {\n    return defaultValue;\n  }\n\n  let value;\n\n  if (isPercent(percent as string)) {\n    const index = (percent as string).indexOf('%');\n    value = (totalValue * parseFloat((percent as string).slice(0, index))) / 100;\n  } else {\n    value = +percent;\n  }\n\n  if (_.isNaN(value)) {\n    value = defaultValue;\n  }\n\n  if (validate && value > totalValue) {\n    value = totalValue;\n  }\n\n  return value;\n};\n\nexport const getAnyElementOfObject = (obj: any) => {\n  if (!obj) {\n    return null;\n  }\n\n  const keys = Object.keys(obj);\n\n  if (keys && keys.length) {\n    return obj[keys[0]];\n  }\n\n  return null;\n};\n\nexport const hasDuplicate = (ary: Array<any>) => {\n  if (!_.isArray(ary)) {\n    return false;\n  }\n\n  const len = ary.length;\n  const cache: Record<string, any> = {};\n\n  for (let i = 0; i < len; i++) {\n    if (!cache[ary[i]]) {\n      cache[ary[i]] = true;\n    } else {\n      return true;\n    }\n  }\n\n  return false;\n};\n\nexport const interpolateNumber = (numberA: number, numberB: number) => {\n  if (isNumber(numberA) && isNumber(numberB)) {\n    return (t: number) => numberA + t * (numberB - numberA);\n  }\n\n  return () => numberB;\n};\n\nexport function findEntryInArray<T>(\n  ary: Array<T>,\n  specifiedKey: number | string | ((entry: T) => unknown),\n  specifiedValue: any,\n) {\n  if (!ary || !ary.length) {\n    return null;\n  }\n\n  return ary.find(\n    entry =>\n      entry &&\n      (typeof specifiedKey === 'function' ? specifiedKey(entry) : _.get(entry, specifiedKey)) === specifiedValue,\n  );\n}\n\n/**\n * The least square linear regression\n * @param {Array} data The array of points\n * @returns {Object} The domain of x, and the parameter of linear function\n */\nexport const getLinearRegression = (data: Array<{ cx?: number; cy?: number }>) => {\n  if (!data || !data.length) {\n    return null;\n  }\n\n  const len = data.length;\n  let xsum = 0;\n  let ysum = 0;\n  let xysum = 0;\n  let xxsum = 0;\n  let xmin = Infinity;\n  let xmax = -Infinity;\n\n  for (let i = 0; i < len; i++) {\n    xsum += data[i].cx;\n    ysum += data[i].cy;\n    xysum += data[i].cx * data[i].cy;\n    xxsum += data[i].cx * data[i].cx;\n    xmin = Math.min(xmin, data[i].cx);\n    xmax = Math.max(xmax, data[i].cx);\n  }\n\n  const a = len * xxsum !== xsum * xsum ? (len * xysum - xsum * ysum) / (len * xxsum - xsum * xsum) : 0;\n\n  return {\n    xmin,\n    xmax,\n    a,\n    b: (ysum - a * xsum) / len,\n  };\n};\n","import { ReactNode } from 'react';\nimport ReferenceDot from '../cartesian/ReferenceDot';\nimport ReferenceLine from '../cartesian/ReferenceLine';\nimport ReferenceArea from '../cartesian/ReferenceArea';\nimport { ifOverflowMatches } from './IfOverflowMatches';\nimport { findAllByType } from './ReactUtils';\nimport { isNumber } from './DataUtils';\n\nexport const detectReferenceElementsDomain = (\n  children: ReactNode[],\n  domain: number[],\n  axisId: string,\n  axisType: string,\n  specifiedTicks?: any[],\n) => {\n  const lines = findAllByType(children, ReferenceLine.displayName);\n  const dots = findAllByType(children, ReferenceDot.displayName);\n  const elements = lines.concat(dots);\n  const areas = findAllByType(children, ReferenceArea.displayName);\n  const idKey = `${axisType}Id`;\n  const valueKey = axisType[0];\n  let finalDomain = domain;\n\n  if (elements.length) {\n    finalDomain = elements.reduce((result: number[], el: any) => {\n      if (el.props[idKey] === axisId && ifOverflowMatches(el.props, 'extendDomain') && isNumber(el.props[valueKey])) {\n        const value = el.props[valueKey];\n\n        return [Math.min(result[0], value), Math.max(result[1], value)];\n      }\n      return result;\n    }, finalDomain);\n  }\n\n  if (areas.length) {\n    const key1 = `${valueKey}1`;\n    const key2 = `${valueKey}2`;\n\n    finalDomain = areas.reduce((result: number[], el: any) => {\n      if (\n        el.props[idKey] === axisId &&\n        ifOverflowMatches(el.props, 'extendDomain') &&\n        isNumber(el.props[key1]) &&\n        isNumber(el.props[key2])\n      ) {\n        const value1 = el.props[key1];\n        const value2 = el.props[key2];\n\n        return [Math.min(result[0], value1, value2), Math.max(result[1], value1, value2)];\n      }\n      return result;\n    }, finalDomain);\n  }\n\n  if (specifiedTicks && specifiedTicks.length) {\n    finalDomain = specifiedTicks.reduce((result, tick) => {\n      if (isNumber(tick)) {\n        return [Math.min(result[0], tick), Math.max(result[1], tick)];\n      }\n\n      return result;\n    }, finalDomain);\n  }\n\n  return finalDomain;\n};\n","import EventEmitter from 'eventemitter3';\n\n\nconst eventCenter: any = new EventEmitter();\n\nif (eventCenter.setMaxListeners) {\n  eventCenter.setMaxListeners(10);\n}\n\nexport { eventCenter };\nexport const SYNC_EVENT = 'recharts.syncMouseEvents';\n","const parseIsSsrByDefault = (): boolean =>\n  !(typeof window !== 'undefined' && window.document && window.document.createElement && window.setTimeout);\n\nexport interface GlobalConfig {\n  isSsr?: boolean;\n}\n\nexport type GlobalConfigKeys = 'isSsr';\n\nconst Global = {\n  isSsr: parseIsSsrByDefault(),\n\n  get: (key: 'isSsr') => {\n    return Global[key];\n  },\n\n  set: (key: GlobalConfigKeys | GlobalConfig, value?: any) => {\n    if (typeof key === 'string') {\n      Global[key] = value;\n    } else {\n      const keys = Object.keys(key);\n\n      if (keys && keys.length) {\n        keys.forEach((k: GlobalConfigKeys) => {\n          Global[k] = key[k];\n        });\n      }\n    }\n  },\n};\n\nexport default Global;\n","export const ifOverflowMatches = (props: any, value: string) => {\n  const { alwaysShow } = props;\n  let { ifOverflow } = props;\n\n  if (alwaysShow) {\n    ifOverflow = 'extendDomain';\n  }\n\n  return ifOverflow === value;\n};\n","/* eslint no-console: 0 */\nconst isDev = process.env.NODE_ENV !== 'production';\n\nexport const warn = (condition: boolean, format: string, ...args: any[]) => {\n  if (isDev && typeof console !== 'undefined' && console.warn) {\n    if (format === undefined) {\n      console.warn('LogUtils requires an error message argument');\n    }\n\n    if (!condition) {\n      if (format === undefined) {\n        console.warn(\n          'Minified exception occurred; use the non-minified dev environment ' +\n            'for the full error message and additional helpful warnings.',\n        );\n      } else {\n        let argIndex = 0;\n\n        console.warn(format.replace(/%s/g, () => args[argIndex++]));\n      }\n    }\n  }\n};\n","import _ from 'lodash';\nimport { getPercentValue } from './DataUtils';\nimport { parseScale, checkDomainOfScale, getTicksOfScale } from './ChartUtils';\nimport { Coordinate, ChartOffset, GeometrySector } from './types';\n\nexport const RADIAN = Math.PI / 180;\n\nexport const degreeToRadian = (angle: number) => (angle * Math.PI) / 180;\n\nexport const radianToDegree = (angleInRadian: number) => (angleInRadian * 180) / Math.PI;\n\nexport const polarToCartesian = (cx: number, cy: number, radius: number, angle: number): Coordinate => ({\n  x: cx + Math.cos(-RADIAN * angle) * radius,\n  y: cy + Math.sin(-RADIAN * angle) * radius,\n});\n\nexport const getMaxRadius = (\n  width: number,\n  height: number,\n  offset: ChartOffset = {\n    top: 0,\n    right: 0,\n    bottom: 0,\n    left: 0,\n  },\n) =>\n  Math.min(\n    Math.abs(width - (offset.left || 0) - (offset.right || 0)),\n    Math.abs(height - (offset.top || 0) - (offset.bottom || 0)),\n  ) / 2;\n\n/**\n * Calculate the scale function, position, width, height of axes\n * @param  {Object} props     Latest props\n * @param  {Object} axisMap   The configuration of axes\n * @param  {Object} offset    The offset of main part in the svg element\n * @param  {Object} axisType  The type of axes, radius-axis or angle-axis\n * @param  {String} chartName The name of chart\n * @return {Object} Configuration\n */\nexport const formatAxisMap = (\n  props: any,\n  axisMap: any,\n  offset: ChartOffset,\n  axisType: 'angleAxis' | 'radiusAxis',\n  chartName: string,\n) => {\n  const { width, height } = props;\n  let { startAngle, endAngle } = props;\n  const cx = getPercentValue(props.cx, width, width / 2);\n  const cy = getPercentValue(props.cy, height, height / 2);\n  const maxRadius = getMaxRadius(width, height, offset);\n  const innerRadius = getPercentValue(props.innerRadius, maxRadius, 0);\n  const outerRadius = getPercentValue(props.outerRadius, maxRadius, maxRadius * 0.8);\n  const ids = Object.keys(axisMap);\n\n  return ids.reduce((result, id) => {\n    const axis = axisMap[id];\n    const { domain, reversed } = axis;\n    let range;\n\n    if (_.isNil(axis.range)) {\n      if (axisType === 'angleAxis') {\n        range = [startAngle, endAngle];\n      } else if (axisType === 'radiusAxis') {\n        range = [innerRadius, outerRadius];\n      }\n\n      if (reversed) {\n        range = [range[1], range[0]];\n      }\n    } else {\n      ({ range } = axis);\n      [startAngle, endAngle] = range;\n    }\n\n    const { realScaleType, scale } = parseScale(axis, chartName);\n    scale.domain(domain).range(range);\n    checkDomainOfScale(scale);\n    const ticks = getTicksOfScale(scale, { ...axis, realScaleType });\n\n    const finalAxis = {\n      ...axis,\n      ...ticks,\n      range,\n      radius: outerRadius,\n      realScaleType,\n      scale,\n      cx,\n      cy,\n      innerRadius,\n      outerRadius,\n      startAngle,\n      endAngle,\n    };\n\n    return { ...result, [id]: finalAxis };\n  }, {});\n};\n\nexport const distanceBetweenPoints = (point: Coordinate, anotherPoint: Coordinate) => {\n  const { x: x1, y: y1 } = point;\n  const { x: x2, y: y2 } = anotherPoint;\n\n  return Math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2);\n};\n\nexport const getAngleOfPoint = ({ x, y }: Coordinate, { cx, cy }: GeometrySector) => {\n  const radius = distanceBetweenPoints({ x, y }, { x: cx, y: cy });\n\n  if (radius <= 0) {\n    return { radius };\n  }\n\n  const cos = (x - cx) / radius;\n  let angleInRadian = Math.acos(cos);\n\n  if (y > cy) {\n    angleInRadian = 2 * Math.PI - angleInRadian;\n  }\n\n  return { radius, angle: radianToDegree(angleInRadian), angleInRadian };\n};\n\nexport const formatAngleOfSector = ({ startAngle, endAngle }: GeometrySector) => {\n  const startCnt = Math.floor(startAngle / 360);\n  const endCnt = Math.floor(endAngle / 360);\n  const min = Math.min(startCnt, endCnt);\n\n  return {\n    startAngle: startAngle - min * 360,\n    endAngle: endAngle - min * 360,\n  };\n};\n\nconst reverseFormatAngleOfSetor = (angle: number, { startAngle, endAngle }: GeometrySector) => {\n  const startCnt = Math.floor(startAngle / 360);\n  const endCnt = Math.floor(endAngle / 360);\n  const min = Math.min(startCnt, endCnt);\n\n  return angle + min * 360;\n};\n\nexport const inRangeOfSector = ({ x, y }: Coordinate, sector: GeometrySector) => {\n  const { radius, angle } = getAngleOfPoint({ x, y }, sector);\n  const { innerRadius, outerRadius } = sector;\n\n  if (radius < innerRadius || radius > outerRadius) {\n    return false;\n  }\n\n  if (radius === 0) {\n    return true;\n  }\n\n  const { startAngle, endAngle } = formatAngleOfSector(sector);\n  let formatAngle = angle;\n  let inRange;\n\n  if (startAngle <= endAngle) {\n    while (formatAngle > endAngle) {\n      formatAngle -= 360;\n    }\n    while (formatAngle < startAngle) {\n      formatAngle += 360;\n    }\n    inRange = formatAngle >= startAngle && formatAngle <= endAngle;\n  } else {\n    while (formatAngle > startAngle) {\n      formatAngle -= 360;\n    }\n    while (formatAngle < endAngle) {\n      formatAngle += 360;\n    }\n    inRange = formatAngle >= endAngle && formatAngle <= startAngle;\n  }\n\n  if (inRange) {\n    return { ...sector, radius, angle: reverseFormatAngleOfSetor(formatAngle, sector) };\n  }\n\n  return null;\n};\n","import React, { Children, ReactNode } from 'react';\nimport _ from 'lodash';\n\nimport { isNumber } from './DataUtils';\nimport { shallowEqual } from './ShallowEqual';\n\nconst REACT_BROWSER_EVENT_MAP: any = {\n  click: 'onClick',\n  mousedown: 'onMouseDown',\n  mouseup: 'onMouseUp',\n  mouseover: 'onMouseOver',\n  mousemove: 'onMouseMove',\n  mouseout: 'onMouseOut',\n  mouseenter: 'onMouseEnter',\n  mouseleave: 'onMouseLeave',\n  touchcancel: 'onTouchCancel',\n  touchend: 'onTouchEnd',\n  touchmove: 'onTouchMove',\n  touchstart: 'onTouchStart',\n};\n\ntype eventFunc = (data: any, index: number, e: any) => {};\n\nexport const SCALE_TYPES = [\n  'auto',\n  'linear',\n  'pow',\n  'sqrt',\n  'log',\n  'identity',\n  'time',\n  'band',\n  'point',\n  'ordinal',\n  'quantile',\n  'quantize',\n  'utc',\n  'sequential',\n  'threshold',\n];\n\nexport const LEGEND_TYPES = [\n  'plainline',\n  'line',\n  'square',\n  'rect',\n  'circle',\n  'cross',\n  'diamond',\n  'star',\n  'triangle',\n  'wye',\n  'none',\n];\n\nexport const TOOLTIP_TYPES = ['none'];\n\n/**\n * Get the display name of a component\n * @param  {Object} Comp Specified Component\n * @return {String}      Display name of Component\n */\nexport const getDisplayName = (Comp: any) => {\n  if (typeof Comp === 'string') {\n    return Comp;\n  }\n  if (!Comp) {\n    return '';\n  }\n  return Comp.displayName || Comp.name || 'Component';\n};\n\n/*\n * Find and return all matched children by type. `type` can be a React element class or\n * string\n */\nexport const findAllByType = (\n  children: ReactNode,\n  type: string | string[],\n): React.DetailedReactHTMLElement<any, HTMLElement>[] => {\n  const result: React.DetailedReactHTMLElement<any, HTMLElement>[] = [];\n  let types: string[] = [];\n\n  if (_.isArray(type)) {\n    types = type.map(t => getDisplayName(t));\n  } else {\n    types = [getDisplayName(type)];\n  }\n\n  React.Children.forEach(children, (child: React.DetailedReactHTMLElement<any, HTMLElement>) => {\n    const childType = _.get(child, 'type.displayName') || _.get(child, 'type.name');\n    if (types.indexOf(childType) !== -1) {\n      result.push(child);\n    }\n  });\n\n  return result;\n};\n/*\n * Return the first matched child by type, return null otherwise.\n * `type` can be a React element class or string.\n */\nexport const findChildByType = (\n  children: ReactNode[],\n  type: string,\n): React.DetailedReactHTMLElement<any, HTMLElement> => {\n  const result = findAllByType(children, type);\n\n  return result && result[0];\n};\n\n/*\n * Create a new array of children excluding the ones matched the type\n */\nexport const withoutType = (children: ReactNode, type: string) => {\n  const newChildren: ReactNode[] = [];\n  let types: string[];\n\n  if (_.isArray(type)) {\n    types = type.map(t => getDisplayName(t));\n  } else {\n    types = [getDisplayName(type)];\n  }\n\n  React.Children.forEach(children, child => {\n    const displayName = _.get(child, 'type.displayName');\n\n    if (displayName && types.indexOf(displayName) !== -1) {\n      return;\n    }\n    newChildren.push(child);\n  });\n\n  return newChildren;\n};\n\n/**\n * validate the width and height props of a chart element\n * @param  {Object} el A chart element\n * @return {Boolean}   true If the props width and height are number, and greater than 0\n */\nexport const validateWidthHeight = (el: any): boolean => {\n  if (!el || !el.props) {\n    return false;\n  }\n  const { width, height } = el.props;\n\n  if (!isNumber(width) || width <= 0 || !isNumber(height) || height <= 0) {\n    return false;\n  }\n\n  return true;\n};\n\nconst SVG_TAGS: string[] = [\n  'a',\n  'altGlyph',\n  'altGlyphDef',\n  'altGlyphItem',\n  'animate',\n  'animateColor',\n  'animateMotion',\n  'animateTransform',\n  'circle',\n  'clipPath',\n  'color-profile',\n  'cursor',\n  'defs',\n  'desc',\n  'ellipse',\n  'feBlend',\n  'feColormatrix',\n  'feComponentTransfer',\n  'feComposite',\n  'feConvolveMatrix',\n  'feDiffuseLighting',\n  'feDisplacementMap',\n  'feDistantLight',\n  'feFlood',\n  'feFuncA',\n  'feFuncB',\n  'feFuncG',\n  'feFuncR',\n  'feGaussianBlur',\n  'feImage',\n  'feMerge',\n  'feMergeNode',\n  'feMorphology',\n  'feOffset',\n  'fePointLight',\n  'feSpecularLighting',\n  'feSpotLight',\n  'feTile',\n  'feTurbulence',\n  'filter',\n  'font',\n  'font-face',\n  'font-face-format',\n  'font-face-name',\n  'font-face-url',\n  'foreignObject',\n  'g',\n  'glyph',\n  'glyphRef',\n  'hkern',\n  'image',\n  'line',\n  'lineGradient',\n  'marker',\n  'mask',\n  'metadata',\n  'missing-glyph',\n  'mpath',\n  'path',\n  'pattern',\n  'polygon',\n  'polyline',\n  'radialGradient',\n  'rect',\n  'script',\n  'set',\n  'stop',\n  'style',\n  'svg',\n  'switch',\n  'symbol',\n  'text',\n  'textPath',\n  'title',\n  'tref',\n  'tspan',\n  'use',\n  'view',\n  'vkern',\n];\n\nconst isSvgElement = (child: any) => child && child.type && _.isString(child.type) && SVG_TAGS.indexOf(child.type) >= 0;\n\n/**\n * Filter all the svg elements of children\n * @param  {Array} children The children of a react element\n * @return {Array}          All the svg elements\n */\nexport const filterSvgElements = (children: React.ReactElement[]): React.ReactElement[] => {\n  const svgElements = [] as React.ReactElement[];\n\n  React.Children.forEach(children, (entry: React.ReactElement) => {\n    if (entry && entry.type && _.isString(entry.type) && SVG_TAGS.indexOf(entry.type) >= 0) {\n      svgElements.push(entry);\n    }\n  });\n\n  return svgElements;\n};\n\n/**\n * Wether props of children changed\n * @param  {Object} nextChildren The latest children\n * @param  {Object} prevChildren The prev children\n * @return {Boolean}             equal or not\n */\nexport const isChildrenEqual = (nextChildren: React.ReactElement[], prevChildren: React.ReactElement[]): boolean => {\n  if (nextChildren === prevChildren) {\n    return true;\n  }\n\n  if (Children.count(nextChildren) !== Children.count(prevChildren)) {\n    return false;\n  }\n  const count = Children.count(nextChildren);\n\n  if (count === 0) {\n    return true;\n  }\n  if (count === 1) {\n    // eslint-disable-next-line no-use-before-define,@typescript-eslint/no-use-before-define\n    return isSingleChildEqual(\n      _.isArray(nextChildren) ? nextChildren[0] : nextChildren,\n      _.isArray(prevChildren) ? prevChildren[0] : prevChildren,\n    );\n  }\n\n  for (let i = 0; i < count; i++) {\n    const nextChild: any = nextChildren[i];\n    const prevChild: any = prevChildren[i];\n\n    if (_.isArray(nextChild) || _.isArray(prevChild)) {\n      if (!isChildrenEqual(nextChild, prevChild)) {\n        return false;\n      }\n      // eslint-disable-next-line no-use-before-define,@typescript-eslint/no-use-before-define\n    } else if (!isSingleChildEqual(nextChild, prevChild)) {\n      return false;\n    }\n  }\n\n  return true;\n};\n\nexport const isSingleChildEqual = (nextChild: React.ReactElement, prevChild: React.ReactElement): boolean => {\n  if (_.isNil(nextChild) && _.isNil(prevChild)) {\n    return true;\n  }\n  if (!_.isNil(nextChild) && !_.isNil(prevChild)) {\n    const { children: nextChildren, ...nextProps } = nextChild.props || {};\n    const { children: prevChildren, ...prevProps } = prevChild.props || {};\n\n    if (nextChildren && prevChildren) {\n      // eslint-disable-next-line no-use-before-define\n      return shallowEqual(nextProps, prevProps) && isChildrenEqual(nextChildren, prevChildren);\n    }\n    if (!nextChildren && !prevChildren) {\n      return shallowEqual(nextProps, prevProps);\n    }\n\n    return false;\n  }\n\n  return false;\n};\n\nexport const renderByOrder = (children: React.ReactElement[], renderMap: any) => {\n  let elements: React.ReactElement[] = [];\n  const record: any = {};\n\n  Children.forEach(children, (child, index) => {\n    if (child && isSvgElement(child)) {\n      elements.push(child);\n    } else if (child && renderMap[getDisplayName(child.type)]) {\n      const displayName = getDisplayName(child.type);\n      const { handler, once } = renderMap[displayName];\n\n      if ((once && !record[displayName]) || !once) {\n        const results = handler(child, displayName, index);\n\n        if (_.isArray(results)) {\n          elements = [elements, ...results];\n        } else {\n          elements.push(results);\n        }\n\n        record[displayName] = true;\n      }\n    }\n  });\n\n  return elements;\n};\n\nexport const getReactEventByType = (e: any) => {\n  const type = e && e.type;\n\n  if (type && REACT_BROWSER_EVENT_MAP[type]) {\n    return REACT_BROWSER_EVENT_MAP[type];\n  }\n\n  return null;\n};\n\nexport const parseChildIndex = (child: any, children: any[]) => {\n  let result = -1;\n  Children.forEach(children, (entry, index) => {\n    if (entry === child) {\n      result = index;\n    }\n  });\n\n  return result;\n};\n","export function shallowEqual(a: any, b: any) {\n  /* eslint-disable no-restricted-syntax */\n  for (const key in a) {\n    if ({}.hasOwnProperty.call(a, key) && (!{}.hasOwnProperty.call(b, key) || a[key] !== b[key])) {\n      return false;\n    }\n  }\n  for (const key in b) {\n    if ({}.hasOwnProperty.call(b, key) && !{}.hasOwnProperty.call(a, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n","import {\n  AriaAttributes,\n  DOMAttributes,\n  SVGProps,\n  SyntheticEvent,\n  ClipboardEvent,\n  CompositionEvent,\n  DragEvent,\n  FocusEvent,\n  FormEvent,\n  KeyboardEvent,\n  MouseEvent,\n  TouchEvent,\n  PointerEvent,\n  UIEvent,\n  WheelEvent,\n  AnimationEvent,\n  TransitionEvent,\n  ReactNode,\n  Component,\n  isValidElement,\n  FunctionComponent,\n  ReactElement,\n} from 'react';\nimport _ from 'lodash';\nimport { ScaleContinuousNumeric as D3ScaleContinuousNumeric } from 'd3-scale';\n\nexport type LayoutType = 'horizontal' | 'vertical' | 'centric' | 'radial';\nexport type PolarLayoutType = 'radial' | 'centric';\nexport type AxisType = 'xAxis' | 'yAxis' | 'angleAxis' | 'radiusAxis';\nexport type DataKey<T> = string | number | ((obj: T) => any);\nexport type PresentationAttributes<T> = AriaAttributes & DOMAttributes<T> & SVGProps<T>;\nexport type PresentationAttributesWithProps<P, T> = AriaAttributes & DOMAttributesWithProps<P, T> & SVGProps<T>;\n\nexport type SymbolType = 'circle' | 'cross' | 'diamond' | 'square' | 'star' | 'triangle' | 'wye';\nexport type LegendType =\n  | 'plainline'\n  | 'line'\n  | 'square'\n  | 'rect'\n  | 'circle'\n  | 'cross'\n  | 'diamond'\n  | 'star'\n  | 'triangle'\n  | 'wye'\n  | 'none';\nexport type TooltipType = 'none';\nexport interface Coordinate {\n  x: number;\n  y: number;\n}\n\nexport interface ChartCoordinate extends Coordinate {\n  xAxis?: any;\n  yAxis?: any;\n  width?: any;\n  height?: any;\n  offset?: ChartOffset;\n  angle?: number;\n  radius?: number;\n  cx?: number;\n  cy?: number;\n  startAngle?: number;\n  endAngle?: number;\n  innerRadius?: number;\n  outerRadius?: number;\n}\n\nexport type ScaleType =\n  | 'auto'\n  | 'linear'\n  | 'pow'\n  | 'sqrt'\n  | 'log'\n  | 'identity'\n  | 'time'\n  | 'band'\n  | 'point'\n  | 'ordinal'\n  | 'quantile'\n  | 'quantize'\n  | 'utc'\n  | 'sequential'\n  | 'threshold';\n\n//\n// Event Handler Types -- Copied from @types/react/index.d.ts and adapted for Props.\n//\n\ntype EventHandler<P, E extends SyntheticEvent<any>> = {\n  bivarianceHack(props: P, event: E): void;\n}['bivarianceHack'];\n\ntype ReactEventHandler<P, T = Element> = EventHandler<P, SyntheticEvent<T>>;\n\ntype ClipboardEventHandler<P, T = Element> = EventHandler<P, ClipboardEvent<T>>;\ntype CompositionEventHandler<P, T = Element> = EventHandler<P, CompositionEvent<T>>;\ntype DragEventHandler<P, T = Element> = EventHandler<P, DragEvent<T>>;\ntype FocusEventHandler<P, T = Element> = EventHandler<P, FocusEvent<T>>;\ntype FormEventHandler<P, T = Element> = EventHandler<P, FormEvent<T>>;\ntype KeyboardEventHandler<P, T = Element> = EventHandler<P, KeyboardEvent<T>>;\ntype MouseEventHandler<P, T = Element> = EventHandler<P, MouseEvent<T>>;\ntype TouchEventHandler<P, T = Element> = EventHandler<P, TouchEvent<T>>;\ntype PointerEventHandler<P, T = Element> = EventHandler<P, PointerEvent<T>>;\ntype UIEventHandler<P, T = Element> = EventHandler<P, UIEvent<T>>;\ntype WheelEventHandler<P, T = Element> = EventHandler<P, WheelEvent<T>>;\ntype AnimationEventHandler<P, T = Element> = EventHandler<P, AnimationEvent<T>>;\ntype TransitionEventHandler<P, T = Element> = EventHandler<P, TransitionEvent<T>>;\n\nexport interface DOMAttributesWithProps<P, T> {\n  children?: ReactNode;\n  dangerouslySetInnerHTML?: {\n    __html: string;\n  };\n\n  // Clipboard Events\n  onCopy?: ClipboardEventHandler<P, T>;\n  onCopyCapture?: ClipboardEventHandler<P, T>;\n  onCut?: ClipboardEventHandler<P, T>;\n  onCutCapture?: ClipboardEventHandler<P, T>;\n  onPaste?: ClipboardEventHandler<P, T>;\n  onPasteCapture?: ClipboardEventHandler<P, T>;\n\n  // Composition Events\n  onCompositionEnd?: CompositionEventHandler<P, T>;\n  onCompositionEndCapture?: CompositionEventHandler<P, T>;\n  onCompositionStart?: CompositionEventHandler<P, T>;\n  onCompositionStartCapture?: CompositionEventHandler<P, T>;\n  onCompositionUpdate?: CompositionEventHandler<P, T>;\n  onCompositionUpdateCapture?: CompositionEventHandler<P, T>;\n\n  // Focus Events\n  onFocus?: FocusEventHandler<P, T>;\n  onFocusCapture?: FocusEventHandler<P, T>;\n  onBlur?: FocusEventHandler<P, T>;\n  onBlurCapture?: FocusEventHandler<P, T>;\n\n  // Form Events\n  onChange?: FormEventHandler<P, T>;\n  onChangeCapture?: FormEventHandler<P, T>;\n  onBeforeInput?: FormEventHandler<P, T>;\n  onBeforeInputCapture?: FormEventHandler<P, T>;\n  onInput?: FormEventHandler<P, T>;\n  onInputCapture?: FormEventHandler<P, T>;\n  onReset?: FormEventHandler<P, T>;\n  onResetCapture?: FormEventHandler<P, T>;\n  onSubmit?: FormEventHandler<P, T>;\n  onSubmitCapture?: FormEventHandler<P, T>;\n  onInvalid?: FormEventHandler<P, T>;\n  onInvalidCapture?: FormEventHandler<P, T>;\n\n  // Image Events\n  onLoad?: ReactEventHandler<P, T>;\n  onLoadCapture?: ReactEventHandler<P, T>;\n  onError?: ReactEventHandler<P, T>; // also a Media Event\n  onErrorCapture?: ReactEventHandler<P, T>; // also a Media Event\n\n  // Keyboard Events\n  onKeyDown?: KeyboardEventHandler<P, T>;\n  onKeyDownCapture?: KeyboardEventHandler<P, T>;\n  onKeyPress?: KeyboardEventHandler<P, T>;\n  onKeyPressCapture?: KeyboardEventHandler<P, T>;\n  onKeyUp?: KeyboardEventHandler<P, T>;\n  onKeyUpCapture?: KeyboardEventHandler<P, T>;\n\n  // Media Events\n  onAbort?: ReactEventHandler<P, T>;\n  onAbortCapture?: ReactEventHandler<P, T>;\n  onCanPlay?: ReactEventHandler<P, T>;\n  onCanPlayCapture?: ReactEventHandler<P, T>;\n  onCanPlayThrough?: ReactEventHandler<P, T>;\n  onCanPlayThroughCapture?: ReactEventHandler<P, T>;\n  onDurationChange?: ReactEventHandler<P, T>;\n  onDurationChangeCapture?: ReactEventHandler<P, T>;\n  onEmptied?: ReactEventHandler<P, T>;\n  onEmptiedCapture?: ReactEventHandler<P, T>;\n  onEncrypted?: ReactEventHandler<P, T>;\n  onEncryptedCapture?: ReactEventHandler<P, T>;\n  onEnded?: ReactEventHandler<P, T>;\n  onEndedCapture?: ReactEventHandler<P, T>;\n  onLoadedData?: ReactEventHandler<P, T>;\n  onLoadedDataCapture?: ReactEventHandler<P, T>;\n  onLoadedMetadata?: ReactEventHandler<P, T>;\n  onLoadedMetadataCapture?: ReactEventHandler<P, T>;\n  onLoadStart?: ReactEventHandler<P, T>;\n  onLoadStartCapture?: ReactEventHandler<P, T>;\n  onPause?: ReactEventHandler<P, T>;\n  onPauseCapture?: ReactEventHandler<P, T>;\n  onPlay?: ReactEventHandler<P, T>;\n  onPlayCapture?: ReactEventHandler<P, T>;\n  onPlaying?: ReactEventHandler<P, T>;\n  onPlayingCapture?: ReactEventHandler<P, T>;\n  onProgress?: ReactEventHandler<P, T>;\n  onProgressCapture?: ReactEventHandler<P, T>;\n  onRateChange?: ReactEventHandler<P, T>;\n  onRateChangeCapture?: ReactEventHandler<P, T>;\n  onSeeked?: ReactEventHandler<P, T>;\n  onSeekedCapture?: ReactEventHandler<P, T>;\n  onSeeking?: ReactEventHandler<P, T>;\n  onSeekingCapture?: ReactEventHandler<P, T>;\n  onStalled?: ReactEventHandler<P, T>;\n  onStalledCapture?: ReactEventHandler<P, T>;\n  onSuspend?: ReactEventHandler<P, T>;\n  onSuspendCapture?: ReactEventHandler<P, T>;\n  onTimeUpdate?: ReactEventHandler<P, T>;\n  onTimeUpdateCapture?: ReactEventHandler<P, T>;\n  onVolumeChange?: ReactEventHandler<P, T>;\n  onVolumeChangeCapture?: ReactEventHandler<P, T>;\n  onWaiting?: ReactEventHandler<P, T>;\n  onWaitingCapture?: ReactEventHandler<P, T>;\n\n  // MouseEvents\n  onAuxClick?: MouseEventHandler<P, T>;\n  onAuxClickCapture?: MouseEventHandler<P, T>;\n  onClick?: MouseEventHandler<P, T>;\n  onClickCapture?: MouseEventHandler<P, T>;\n  onContextMenu?: MouseEventHandler<P, T>;\n  onContextMenuCapture?: MouseEventHandler<P, T>;\n  onDoubleClick?: MouseEventHandler<P, T>;\n  onDoubleClickCapture?: MouseEventHandler<P, T>;\n  onDrag?: DragEventHandler<P, T>;\n  onDragCapture?: DragEventHandler<P, T>;\n  onDragEnd?: DragEventHandler<P, T>;\n  onDragEndCapture?: DragEventHandler<P, T>;\n  onDragEnter?: DragEventHandler<P, T>;\n  onDragEnterCapture?: DragEventHandler<P, T>;\n  onDragExit?: DragEventHandler<P, T>;\n  onDragExitCapture?: DragEventHandler<P, T>;\n  onDragLeave?: DragEventHandler<P, T>;\n  onDragLeaveCapture?: DragEventHandler<P, T>;\n  onDragOver?: DragEventHandler<P, T>;\n  onDragOverCapture?: DragEventHandler<P, T>;\n  onDragStart?: DragEventHandler<P, T>;\n  onDragStartCapture?: DragEventHandler<P, T>;\n  onDrop?: DragEventHandler<P, T>;\n  onDropCapture?: DragEventHandler<P, T>;\n  onMouseDown?: MouseEventHandler<P, T>;\n  onMouseDownCapture?: MouseEventHandler<P, T>;\n  onMouseEnter?: MouseEventHandler<P, T>;\n  onMouseLeave?: MouseEventHandler<P, T>;\n  onMouseMove?: MouseEventHandler<P, T>;\n  onMouseMoveCapture?: MouseEventHandler<P, T>;\n  onMouseOut?: MouseEventHandler<P, T>;\n  onMouseOutCapture?: MouseEventHandler<P, T>;\n  onMouseOver?: MouseEventHandler<P, T>;\n  onMouseOverCapture?: MouseEventHandler<P, T>;\n  onMouseUp?: MouseEventHandler<P, T>;\n  onMouseUpCapture?: MouseEventHandler<P, T>;\n\n  // Selection Events\n  onSelect?: ReactEventHandler<P, T>;\n  onSelectCapture?: ReactEventHandler<P, T>;\n\n  // Touch Events\n  onTouchCancel?: TouchEventHandler<P, T>;\n  onTouchCancelCapture?: TouchEventHandler<P, T>;\n  onTouchEnd?: TouchEventHandler<P, T>;\n  onTouchEndCapture?: TouchEventHandler<P, T>;\n  onTouchMove?: TouchEventHandler<P, T>;\n  onTouchMoveCapture?: TouchEventHandler<P, T>;\n  onTouchStart?: TouchEventHandler<P, T>;\n  onTouchStartCapture?: TouchEventHandler<P, T>;\n\n  // Pointer Events\n  onPointerDown?: PointerEventHandler<P, T>;\n  onPointerDownCapture?: PointerEventHandler<P, T>;\n  onPointerMove?: PointerEventHandler<P, T>;\n  onPointerMoveCapture?: PointerEventHandler<P, T>;\n  onPointerUp?: PointerEventHandler<P, T>;\n  onPointerUpCapture?: PointerEventHandler<P, T>;\n  onPointerCancel?: PointerEventHandler<P, T>;\n  onPointerCancelCapture?: PointerEventHandler<P, T>;\n  onPointerEnter?: PointerEventHandler<P, T>;\n  onPointerEnterCapture?: PointerEventHandler<P, T>;\n  onPointerLeave?: PointerEventHandler<P, T>;\n  onPointerLeaveCapture?: PointerEventHandler<P, T>;\n  onPointerOver?: PointerEventHandler<P, T>;\n  onPointerOverCapture?: PointerEventHandler<P, T>;\n  onPointerOut?: PointerEventHandler<P, T>;\n  onPointerOutCapture?: PointerEventHandler<P, T>;\n  onGotPointerCapture?: PointerEventHandler<P, T>;\n  onGotPointerCaptureCapture?: PointerEventHandler<P, T>;\n  onLostPointerCapture?: PointerEventHandler<P, T>;\n  onLostPointerCaptureCapture?: PointerEventHandler<P, T>;\n\n  // UI Events\n  onScroll?: UIEventHandler<P, T>;\n  onScrollCapture?: UIEventHandler<P, T>;\n\n  // Wheel Events\n  onWheel?: WheelEventHandler<P, T>;\n  onWheelCapture?: WheelEventHandler<P, T>;\n\n  // Animation Events\n  onAnimationStart?: AnimationEventHandler<P, T>;\n  onAnimationStartCapture?: AnimationEventHandler<P, T>;\n  onAnimationEnd?: AnimationEventHandler<P, T>;\n  onAnimationEndCapture?: AnimationEventHandler<P, T>;\n  onAnimationIteration?: AnimationEventHandler<P, T>;\n  onAnimationIterationCapture?: AnimationEventHandler<P, T>;\n\n  // Transition Events\n  onTransitionEnd?: TransitionEventHandler<P, T>;\n  onTransitionEndCapture?: TransitionEventHandler<P, T>;\n}\nconst SVGContainerPropKeys = ['viewBox', 'children'];\nconst SVGElementPropKeys = [\n  'className',\n  'color',\n  'height',\n  'id',\n  'lang',\n  'max',\n  'media',\n  'method',\n  'min',\n  'name',\n  'style',\n  'target',\n  'type',\n  'width',\n  'role',\n  'tabIndex',\n  'accentHeight',\n  'accumulate',\n  'additive',\n  'alignmentBaseline',\n  'allowReorder',\n  'alphabetic',\n  'amplitude',\n  'arabicForm',\n  'ascent',\n  'attributeName',\n  'attributeType',\n  'autoReverse',\n  'azimuth',\n  'baseFrequency',\n  'baselineShift',\n  'baseProfile',\n  'bbox',\n  'begin',\n  'bias',\n  'by',\n  'calcMode',\n  'capHeight',\n  'clip',\n  'clipPath',\n  'clipPathUnits',\n  'clipRule',\n  'colorInterpolation',\n  'colorInterpolationFilters',\n  'colorProfile',\n  'colorRendering',\n  'contentScriptType',\n  'contentStyleType',\n  'cursor',\n  'cx',\n  'cy',\n  'd',\n  'decelerate',\n  'descent',\n  'diffuseConstant',\n  'direction',\n  'display',\n  'divisor',\n  'dominantBaseline',\n  'dur',\n  'dx',\n  'dy',\n  'edgeMode',\n  'elevation',\n  'enableBackground',\n  'end',\n  'exponent',\n  'externalResourcesRequired',\n  'fill',\n  'fillOpacity',\n  'fillRule',\n  'filter',\n  'filterRes',\n  'filterUnits',\n  'floodColor',\n  'floodOpacity',\n  'focusable',\n  'fontFamily',\n  'fontSize',\n  'fontSizeAdjust',\n  'fontStretch',\n  'fontStyle',\n  'fontVariant',\n  'fontWeight',\n  'format',\n  'from',\n  'fx',\n  'fy',\n  'g1',\n  'g2',\n  'glyphName',\n  'glyphOrientationHorizontal',\n  'glyphOrientationVertical',\n  'glyphRef',\n  'gradientTransform',\n  'gradientUnits',\n  'hanging',\n  'horizAdvX',\n  'horizOriginX',\n  'href',\n  'ideographic',\n  'imageRendering',\n  'in2',\n  'in',\n  'intercept',\n  'k1',\n  'k2',\n  'k3',\n  'k4',\n  'k',\n  'kernelMatrix',\n  'kernelUnitLength',\n  'kerning',\n  'keyPoints',\n  'keySplines',\n  'keyTimes',\n  'lengthAdjust',\n  'letterSpacing',\n  'lightingColor',\n  'limitingConeAngle',\n  'local',\n  'markerEnd',\n  'markerHeight',\n  'markerMid',\n  'markerStart',\n  'markerUnits',\n  'markerWidth',\n  'mask',\n  'maskContentUnits',\n  'maskUnits',\n  'mathematical',\n  'mode',\n  'numOctaves',\n  'offset',\n  'opacity',\n  'operator',\n  'order',\n  'orient',\n  'orientation',\n  'origin',\n  'overflow',\n  'overlinePosition',\n  'overlineThickness',\n  'paintOrder',\n  'panose1',\n  'pathLength',\n  'patternContentUnits',\n  'patternTransform',\n  'patternUnits',\n  'pointerEvents',\n  'points',\n  'pointsAtX',\n  'pointsAtY',\n  'pointsAtZ',\n  'preserveAlpha',\n  'preserveAspectRatio',\n  'primitiveUnits',\n  'r',\n  'radius',\n  'refX',\n  'refY',\n  'renderingIntent',\n  'repeatCount',\n  'repeatDur',\n  'requiredExtensions',\n  'requiredFeatures',\n  'restart',\n  'result',\n  'rotate',\n  'rx',\n  'ry',\n  'seed',\n  'shapeRendering',\n  'slope',\n  'spacing',\n  'specularConstant',\n  'specularExponent',\n  'speed',\n  'spreadMethod',\n  'startOffset',\n  'stdDeviation',\n  'stemh',\n  'stemv',\n  'stitchTiles',\n  'stopColor',\n  'stopOpacity',\n  'strikethroughPosition',\n  'strikethroughThickness',\n  'string',\n  'stroke',\n  'strokeDasharray',\n  'strokeDashoffset',\n  'strokeLinecap',\n  'strokeLinejoin',\n  'strokeMiterlimit',\n  'strokeOpacity',\n  'strokeWidth',\n  'surfaceScale',\n  'systemLanguage',\n  'tableValues',\n  'targetX',\n  'targetY',\n  'textAnchor',\n  'textDecoration',\n  'textLength',\n  'textRendering',\n  'to',\n  'transform',\n  'u1',\n  'u2',\n  'underlinePosition',\n  'underlineThickness',\n  'unicode',\n  'unicodeBidi',\n  'unicodeRange',\n  'unitsPerEm',\n  'vAlphabetic',\n  'values',\n  'vectorEffect',\n  'version',\n  'vertAdvY',\n  'vertOriginX',\n  'vertOriginY',\n  'vHanging',\n  'vIdeographic',\n  'viewTarget',\n  'visibility',\n  'vMathematical',\n  'widths',\n  'wordSpacing',\n  'writingMode',\n  'x1',\n  'x2',\n  'x',\n  'xChannelSelector',\n  'xHeight',\n  'xlinkActuate',\n  'xlinkArcrole',\n  'xlinkHref',\n  'xlinkRole',\n  'xlinkShow',\n  'xlinkTitle',\n  'xlinkType',\n  'xmlBase',\n  'xmlLang',\n  'xmlns',\n  'xmlnsXlink',\n  'xmlSpace',\n  'y1',\n  'y2',\n  'y',\n  'yChannelSelector',\n  'z',\n  'zoomAndPan',\n  'ref',\n  'key',\n  'angle',\n];\n\nconst EventKeys = [\n  'dangerouslySetInnerHTML',\n  'onCopy',\n  'onCopyCapture',\n  'onCut',\n  'onCutCapture',\n  'onPaste',\n  'onPasteCapture',\n  'onCompositionEnd',\n  'onCompositionEndCapture',\n  'onCompositionStart',\n  'onCompositionStartCapture',\n  'onCompositionUpdate',\n  'onCompositionUpdateCapture',\n  'onFocus',\n  'onFocusCapture',\n  'onBlur',\n  'onBlurCapture',\n  'onChange',\n  'onChangeCapture',\n  'onBeforeInput',\n  'onBeforeInputCapture',\n  'onInput',\n  'onInputCapture',\n  'onReset',\n  'onResetCapture',\n  'onSubmit',\n  'onSubmitCapture',\n  'onInvalid',\n  'onInvalidCapture',\n  'onLoad',\n  'onLoadCapture',\n  'onError',\n  'onErrorCapture',\n  'onKeyDown',\n  'onKeyDownCapture',\n  'onKeyPress',\n  'onKeyPressCapture',\n  'onKeyUp',\n  'onKeyUpCapture',\n  'onAbort',\n  'onAbortCapture',\n  'onCanPlay',\n  'onCanPlayCapture',\n  'onCanPlayThrough',\n  'onCanPlayThroughCapture',\n  'onDurationChange',\n  'onDurationChangeCapture',\n  'onEmptied',\n  'onEmptiedCapture',\n  'onEncrypted',\n  'onEncryptedCapture',\n  'onEnded',\n  'onEndedCapture',\n  'onLoadedData',\n  'onLoadedDataCapture',\n  'onLoadedMetadata',\n  'onLoadedMetadataCapture',\n  'onLoadStart',\n  'onLoadStartCapture',\n  'onPause',\n  'onPauseCapture',\n  'onPlay',\n  'onPlayCapture',\n  'onPlaying',\n  'onPlayingCapture',\n  'onProgress',\n  'onProgressCapture',\n  'onRateChange',\n  'onRateChangeCapture',\n  'onSeeked',\n  'onSeekedCapture',\n  'onSeeking',\n  'onSeekingCapture',\n  'onStalled',\n  'onStalledCapture',\n  'onSuspend',\n  'onSuspendCapture',\n  'onTimeUpdate',\n  'onTimeUpdateCapture',\n  'onVolumeChange',\n  'onVolumeChangeCapture',\n  'onWaiting',\n  'onWaitingCapture',\n  'onAuxClick',\n  'onAuxClickCapture',\n  'onClick',\n  'onClickCapture',\n  'onContextMenu',\n  'onContextMenuCapture',\n  'onDoubleClick',\n  'onDoubleClickCapture',\n  'onDrag',\n  'onDragCapture',\n  'onDragEnd',\n  'onDragEndCapture',\n  'onDragEnter',\n  'onDragEnterCapture',\n  'onDragExit',\n  'onDragExitCapture',\n  'onDragLeave',\n  'onDragLeaveCapture',\n  'onDragOver',\n  'onDragOverCapture',\n  'onDragStart',\n  'onDragStartCapture',\n  'onDrop',\n  'onDropCapture',\n  'onMouseDown',\n  'onMouseDownCapture',\n  'onMouseEnter',\n  'onMouseLeave',\n  'onMouseMove',\n  'onMouseMoveCapture',\n  'onMouseOut',\n  'onMouseOutCapture',\n  'onMouseOver',\n  'onMouseOverCapture',\n  'onMouseUp',\n  'onMouseUpCapture',\n  'onSelect',\n  'onSelectCapture',\n  'onTouchCancel',\n  'onTouchCancelCapture',\n  'onTouchEnd',\n  'onTouchEndCapture',\n  'onTouchMove',\n  'onTouchMoveCapture',\n  'onTouchStart',\n  'onTouchStartCapture',\n  'onPointerDown',\n  'onPointerDownCapture',\n  'onPointerMove',\n  'onPointerMoveCapture',\n  'onPointerUp',\n  'onPointerUpCapture',\n  'onPointerCancel',\n  'onPointerCancelCapture',\n  'onPointerEnter',\n  'onPointerEnterCapture',\n  'onPointerLeave',\n  'onPointerLeaveCapture',\n  'onPointerOver',\n  'onPointerOverCapture',\n  'onPointerOut',\n  'onPointerOutCapture',\n  'onGotPointerCapture',\n  'onGotPointerCaptureCapture',\n  'onLostPointerCapture',\n  'onLostPointerCaptureCapture',\n  'onScroll',\n  'onScrollCapture',\n  'onWheel',\n  'onWheelCapture',\n  'onAnimationStart',\n  'onAnimationStartCapture',\n  'onAnimationEnd',\n  'onAnimationEndCapture',\n  'onAnimationIteration',\n  'onAnimationIterationCapture',\n  'onTransitionEnd',\n  'onTransitionEndCapture',\n];\n\n// Animation Types => TODO: Should be moved when react-smooth is typescriptified.\nexport type AnimationTiming = 'ease' | 'ease-in' | 'ease-out' | 'ease-in-out' | 'linear';\n\n/** the offset of a chart, which define the blank space all around */\nexport interface ChartOffset {\n  top?: number;\n  bottom?: number;\n  left?: number;\n  right?: number;\n  width?: number;\n  height?: number;\n  brushBottom?: number;\n}\n\nexport interface Padding {\n  top?: number;\n  bottom?: number;\n  left?: number;\n  right?: number;\n}\n\nexport interface GeometrySector {\n  cx?: number;\n  cy?: number;\n  innerRadius?: number;\n  outerRadius?: number;\n  startAngle?: number;\n  endAngle?: number;\n  cornerRadius?: number;\n  forceCornerRadius?: boolean;\n  cornerIsExternal?: boolean;\n}\n\nexport interface ViewBox {\n  x?: number;\n  y?: number;\n  width?: number;\n  height?: number;\n}\n\nexport type D3Scale<T> = D3ScaleContinuousNumeric<T, number>;\n\nexport type AxisDomainItem = string | number | Function | 'auto' | 'dataMin' | 'dataMax';\n/** The domain of axis */\nexport type AxisDomain = [AxisDomainItem, AxisDomainItem];\n\n/** The props definition of base axis */\nexport interface BaseAxisProps {\n  /** The type of axis */\n  type?: 'number' | 'category';\n  /** The key of data displayed in the axis */\n  dataKey?: DataKey<any>;\n  /** Whether or not display the axis */\n  hide?: boolean;\n  /** The scale type or functor of scale */\n  scale?: ScaleType | Function;\n  /** The option for tick */\n  tick?: PresentationAttributes<SVGTextElement> | ReactElement<SVGElement> | ((props: any) => SVGElement) | boolean;\n  /** The count of ticks */\n  tickCount?: number;\n  /** The option for axisLine */\n  axisLine?: boolean | PresentationAttributes<SVGLineElement>;\n  /** The option for tickLine */\n  tickLine?: boolean | PresentationAttributes<SVGTextElement>;\n  /** The size of tick line */\n  tickSize?: number;\n  /** The formatter function of tick */\n  tickFormatter?: (value: any, index: number) => string;\n  /**\n   * When domain of the axis is specified and the type of the axis is 'number',\n   * if allowDataOverflow is set to be false,\n   * the domain will be adjusted when the minimum value of data is smaller than domain[0] or\n   * the maximum value of data is greater than domain[1] so that the axis displays all data values.\n   * If set to true, graphic elements (line, area, bars) will be clipped to conform to the specified domain.\n   */\n  allowDataOverflow?: boolean;\n  /**\n   * Allow the axis has duplicated categorys or not when the type of axis is \"category\".\n   */\n  allowDuplicatedCategory?: boolean;\n  /**\n   * Allow the ticks of axis to be decimals or not.\n   */\n  allowDecimals?: boolean;\n  /** The domain of scale in this axis */\n  domain?: AxisDomain;\n  /** The name of data displayed in the axis */\n  name?: string;\n  /** The unit of data displayed in the axis */\n  unit?: string | number;\n  /** The type of axis */\n  axisType?: AxisType;\n  range?: Array<number>;\n  /** axis react component */\n  AxisComp?: any;\n}\n\nexport type AxisInterval = number | 'preserveStart' | 'preserveEnd' | 'preserveStartEnd';\n\nexport interface TickItem {\n  value?: any;\n  coordinate: number;\n  index: number;\n}\n\nexport interface Margin {\n  top?: number;\n  right?: number;\n  bottom?: number;\n  left?: number;\n}\n\nexport const filterProps = (\n  props: Record<string, any> | Component | FunctionComponent | boolean,\n  includeEvents?: boolean,\n  isSvg?: boolean,\n) => {\n  if (!props || typeof props === 'function' || typeof props === 'boolean') {\n    return null;\n  }\n\n  let inputProps = props as Record<string, any>;\n\n  if (isValidElement(props)) {\n    inputProps = props.props as Record<string, any>;\n  }\n\n  if (!_.isObject(inputProps)) {\n    return null;\n  }\n\n  const out: Record<string, any> = {};\n\n  Object.keys(inputProps).forEach(key => {\n    // viewBox only exist in <svg />\n    if (\n      SVGElementPropKeys.includes(key) ||\n      (isSvg && SVGContainerPropKeys.includes(key)) ||\n      (includeEvents && EventKeys.includes(key))\n    ) {\n      out[key] = (inputProps as any)[key];\n    }\n  });\n\n  return out;\n};\n\nexport const adaptEventHandlers = (\n  props: Record<string, any> | Component | FunctionComponent | boolean,\n  newHandler?: (e?: Event) => any,\n): Record<string, (e?: Event) => any> => {\n  if (!props || typeof props === 'function' || typeof props === 'boolean') {\n    return null;\n  }\n\n  let inputProps = props as Record<string, any>;\n\n  if (isValidElement(props)) {\n    inputProps = props.props as Record<string, any>;\n  }\n\n  if (!_.isObject(inputProps)) {\n    return null;\n  }\n\n  const out: Record<string, (e: Event) => void> = {};\n\n  Object.keys(inputProps).forEach(key => {\n    if (EventKeys.includes(key)) {\n      out[key] = newHandler || ((e: Event) => inputProps[key](inputProps, e));\n    }\n  });\n\n  return out;\n};\n\nconst getEventHandlerOfChild = (originalHandler: Function, data: any, index: number) => (e: Event): void => {\n  originalHandler(data, index, e);\n\n  return null;\n};\n\nexport const adaptEventsOfChild = (\n  props: Record<string, any>,\n  data: any,\n  index: number,\n): Record<string, (e?: Event) => any> => {\n  if (!_.isObject(props) || typeof props !== 'object') {\n    return null;\n  }\n\n  let out: Record<string, (e: Event) => void> = null;\n\n  Object.keys(props).forEach((key: string) => {\n    const item = (props as any)[key];\n    if (EventKeys.includes(key) && typeof item === 'function') {\n      if (!out) out = {};\n      out[key] = getEventHandlerOfChild(item, data, index);\n    }\n  });\n  return out;\n};\n\nexport interface CategoricalChartOptions {\n  chartName?: string;\n  GraphicalChild?: any;\n  eventType?: string;\n  axisComponents?: BaseAxisProps[];\n  legendContent?: any;\n  formatAxisMap?: any;\n  defaultProps?: any;\n}\n\nexport interface TreemapNode {\n  x: number;\n  y: number;\n  width: number;\n  height: number;\n  depth: number;\n  index: number;\n  children?: any;\n  name: string;\n  value: number;\n  [k: string]: any;\n}\n\nexport interface SankeyNode {\n  x: number;\n  y: number;\n  dx: number;\n  dy: number;\n  depth: number;\n  value: number;\n}\nexport interface SankeyLink {\n  target: number;\n  source: number;\n  value: number;\n  sy: number;\n  dy: number;\n  ty: number;\n}\n","module.exports = __WEBPACK_EXTERNAL_MODULE_prop_types__;","module.exports = __WEBPACK_EXTERNAL_MODULE_react__;","module.exports = __WEBPACK_EXTERNAL_MODULE_react_dom__;"],"sourceRoot":""}