{"version":3,"sources":["node_modules/browser-pack/_prelude.js","node_modules/complex.js/complex.js","node_modules/decimal.js/decimal.js","node_modules/escape-latex/dist/index.js","node_modules/fraction.js/fraction.js","node_modules/idb/lib/idb.js","node_modules/javascript-natural-sort/naturalSort.js","node_modules/lodash/lodash.js","node_modules/loglevel/lib/loglevel.js","node_modules/mathjs/core.js","node_modules/mathjs/lib/core/core.js","node_modules/mathjs/lib/core/function/config.js","node_modules/mathjs/lib/core/function/import.js","node_modules/mathjs/lib/core/typed.js","node_modules/mathjs/lib/error/ArgumentsError.js","node_modules/mathjs/lib/error/DimensionError.js","node_modules/mathjs/lib/error/IndexError.js","node_modules/mathjs/lib/expression/Help.js","node_modules/mathjs/lib/expression/Parser.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/Infinity.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/LN10.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/LN2.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/LOG10E.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/LOG2E.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/NaN.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/SQRT1_2.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/SQRT2.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/e.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/false.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/i.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/null.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/phi.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/pi.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/tau.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/true.js","node_modules/mathjs/lib/expression/embeddedDocs/constants/version.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/bignumber.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/boolean.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/complex.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/createUnit.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/fraction.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/index.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/matrix.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/number.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/sparse.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/splitUnit.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/string.js","node_modules/mathjs/lib/expression/embeddedDocs/construction/unit.js","node_modules/mathjs/lib/expression/embeddedDocs/core/config.js","node_modules/mathjs/lib/expression/embeddedDocs/core/import.js","node_modules/mathjs/lib/expression/embeddedDocs/core/typed.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/derivative.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/lsolve.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/lup.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/lusolve.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/qr.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/rationalize.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/simplify.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/slu.js","node_modules/mathjs/lib/expression/embeddedDocs/function/algebra/usolve.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/abs.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/add.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/cbrt.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/ceil.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/cube.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/divide.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/dotDivide.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/dotMultiply.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/dotPow.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/exp.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/expm.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/expm1.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/fix.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/floor.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/gcd.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/hypot.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/lcm.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/log.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/log10.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/log1p.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/log2.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/mod.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/multiply.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/norm.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/nthRoot.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/nthRoots.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/pow.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/round.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/sign.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/sqrt.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/sqrtm.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/square.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/subtract.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/unaryMinus.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/unaryPlus.js","node_modules/mathjs/lib/expression/embeddedDocs/function/arithmetic/xgcd.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/bitAnd.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/bitNot.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/bitOr.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/bitXor.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/leftShift.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/rightArithShift.js","node_modules/mathjs/lib/expression/embeddedDocs/function/bitwise/rightLogShift.js","node_modules/mathjs/lib/expression/embeddedDocs/function/combinatorics/bellNumbers.js","node_modules/mathjs/lib/expression/embeddedDocs/function/combinatorics/catalan.js","node_modules/mathjs/lib/expression/embeddedDocs/function/combinatorics/composition.js","node_modules/mathjs/lib/expression/embeddedDocs/function/combinatorics/stirlingS2.js","node_modules/mathjs/lib/expression/embeddedDocs/function/complex/arg.js","node_modules/mathjs/lib/expression/embeddedDocs/function/complex/conj.js","node_modules/mathjs/lib/expression/embeddedDocs/function/complex/im.js","node_modules/mathjs/lib/expression/embeddedDocs/function/complex/re.js","node_modules/mathjs/lib/expression/embeddedDocs/function/expression/eval.js","node_modules/mathjs/lib/expression/embeddedDocs/function/expression/help.js","node_modules/mathjs/lib/expression/embeddedDocs/function/geometry/distance.js","node_modules/mathjs/lib/expression/embeddedDocs/function/geometry/intersect.js","node_modules/mathjs/lib/expression/embeddedDocs/function/logical/and.js","node_modules/mathjs/lib/expression/embeddedDocs/function/logical/not.js","node_modules/mathjs/lib/expression/embeddedDocs/function/logical/or.js","node_modules/mathjs/lib/expression/embeddedDocs/function/logical/xor.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/concat.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/cross.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/ctranspose.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/det.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/diag.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/dot.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/filter.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/flatten.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/forEach.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/getMatrixDataType.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/identity.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/inv.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/kron.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/map.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/ones.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/partitionSelect.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/range.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/reshape.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/resize.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/size.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/sort.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/squeeze.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/subset.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/trace.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/transpose.js","node_modules/mathjs/lib/expression/embeddedDocs/function/matrix/zeros.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/combinations.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/factorial.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/gamma.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/kldivergence.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/multinomial.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/permutations.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/pickRandom.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/random.js","node_modules/mathjs/lib/expression/embeddedDocs/function/probability/randomInt.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/compare.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/compareNatural.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/compareText.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/deepEqual.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/equal.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/equalText.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/larger.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/largerEq.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/smaller.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/smallerEq.js","node_modules/mathjs/lib/expression/embeddedDocs/function/relational/unequal.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setCartesian.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setDifference.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setDistinct.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setIntersect.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setIsSubset.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setMultiplicity.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setPowerset.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setSize.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setSymDifference.js","node_modules/mathjs/lib/expression/embeddedDocs/function/set/setUnion.js","node_modules/mathjs/lib/expression/embeddedDocs/function/special/erf.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/mad.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/max.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/mean.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/median.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/min.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/mode.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/prod.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/quantileSeq.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/std.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/sum.js","node_modules/mathjs/lib/expression/embeddedDocs/function/statistics/var.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/acos.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/acosh.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/acot.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/acoth.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/acsc.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/acsch.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/asec.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/asech.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/asin.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/asinh.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/atan.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/atan2.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/atanh.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/cos.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/cosh.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/cot.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/coth.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/csc.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/csch.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/sec.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/sech.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/sin.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/sinh.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/tan.js","node_modules/mathjs/lib/expression/embeddedDocs/function/trigonometry/tanh.js","node_modules/mathjs/lib/expression/embeddedDocs/function/units/to.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/clone.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/format.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/hasNumericValue.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isInteger.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isNaN.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isNegative.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isNumeric.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isPositive.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isPrime.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/isZero.js","node_modules/mathjs/lib/expression/embeddedDocs/function/utils/typeof.js","node_modules/mathjs/lib/expression/embeddedDocs/index.js","node_modules/mathjs/lib/expression/function/compile.js","node_modules/mathjs/lib/expression/function/eval.js","node_modules/mathjs/lib/expression/function/help.js","node_modules/mathjs/lib/expression/function/index.js","node_modules/mathjs/lib/expression/function/parse.js","node_modules/mathjs/lib/expression/function/parser.js","node_modules/mathjs/lib/expression/index.js","node_modules/mathjs/lib/expression/keywords.js","node_modules/mathjs/lib/expression/node/AccessorNode.js","node_modules/mathjs/lib/expression/node/ArrayNode.js","node_modules/mathjs/lib/expression/node/AssignmentNode.js","node_modules/mathjs/lib/expression/node/BlockNode.js","node_modules/mathjs/lib/expression/node/ConditionalNode.js","node_modules/mathjs/lib/expression/node/ConstantNode.js","node_modules/mathjs/lib/expression/node/FunctionAssignmentNode.js","node_modules/mathjs/lib/expression/node/FunctionNode.js","node_modules/mathjs/lib/expression/node/IndexNode.js","node_modules/mathjs/lib/expression/node/Node.js","node_modules/mathjs/lib/expression/node/ObjectNode.js","node_modules/mathjs/lib/expression/node/OperatorNode.js","node_modules/mathjs/lib/expression/node/ParenthesisNode.js","node_modules/mathjs/lib/expression/node/RangeNode.js","node_modules/mathjs/lib/expression/node/RelationalNode.js","node_modules/mathjs/lib/expression/node/SymbolNode.js","node_modules/mathjs/lib/expression/node/UpdateNode.js","node_modules/mathjs/lib/expression/node/index.js","node_modules/mathjs/lib/expression/node/utils/access.js","node_modules/mathjs/lib/expression/node/utils/assign.js","node_modules/mathjs/lib/expression/operators.js","node_modules/mathjs/lib/expression/parse.js","node_modules/mathjs/lib/expression/transform/apply.transform.js","node_modules/mathjs/lib/expression/transform/concat.transform.js","node_modules/mathjs/lib/expression/transform/error.transform.js","node_modules/mathjs/lib/expression/transform/filter.transform.js","node_modules/mathjs/lib/expression/transform/forEach.transform.js","node_modules/mathjs/lib/expression/transform/index.js","node_modules/mathjs/lib/expression/transform/index.transform.js","node_modules/mathjs/lib/expression/transform/map.transform.js","node_modules/mathjs/lib/expression/transform/max.transform.js","node_modules/mathjs/lib/expression/transform/mean.transform.js","node_modules/mathjs/lib/expression/transform/min.transform.js","node_modules/mathjs/lib/expression/transform/range.transform.js","node_modules/mathjs/lib/expression/transform/std.transform.js","node_modules/mathjs/lib/expression/transform/subset.transform.js","node_modules/mathjs/lib/expression/transform/sum.transform.js","node_modules/mathjs/lib/expression/transform/utils/compileInlineExpression.js","node_modules/mathjs/lib/expression/transform/var.transform.js","node_modules/mathjs/lib/function/algebra/decomposition/lup.js","node_modules/mathjs/lib/function/algebra/decomposition/qr.js","node_modules/mathjs/lib/function/algebra/decomposition/slu.js","node_modules/mathjs/lib/function/algebra/derivative.js","node_modules/mathjs/lib/function/algebra/index.js","node_modules/mathjs/lib/function/algebra/rationalize.js","node_modules/mathjs/lib/function/algebra/simplify.js","node_modules/mathjs/lib/function/algebra/simplify/resolve.js","node_modules/mathjs/lib/function/algebra/simplify/simplifyConstant.js","node_modules/mathjs/lib/function/algebra/simplify/simplifyCore.js","node_modules/mathjs/lib/function/algebra/simplify/util.js","node_modules/mathjs/lib/function/algebra/solver/lsolve.js","node_modules/mathjs/lib/function/algebra/solver/lusolve.js","node_modules/mathjs/lib/function/algebra/solver/usolve.js","node_modules/mathjs/lib/function/algebra/solver/utils/solveValidation.js","node_modules/mathjs/lib/function/algebra/sparse/csAmd.js","node_modules/mathjs/lib/function/algebra/sparse/csCounts.js","node_modules/mathjs/lib/function/algebra/sparse/csDfs.js","node_modules/mathjs/lib/function/algebra/sparse/csEtree.js","node_modules/mathjs/lib/function/algebra/sparse/csFkeep.js","node_modules/mathjs/lib/function/algebra/sparse/csFlip.js","node_modules/mathjs/lib/function/algebra/sparse/csIpvec.js","node_modules/mathjs/lib/function/algebra/sparse/csLeaf.js","node_modules/mathjs/lib/function/algebra/sparse/csLu.js","node_modules/mathjs/lib/function/algebra/sparse/csMark.js","node_modules/mathjs/lib/function/algebra/sparse/csMarked.js","node_modules/mathjs/lib/function/algebra/sparse/csPermute.js","node_modules/mathjs/lib/function/algebra/sparse/csPost.js","node_modules/mathjs/lib/function/algebra/sparse/csReach.js","node_modules/mathjs/lib/function/algebra/sparse/csSpsolve.js","node_modules/mathjs/lib/function/algebra/sparse/csSqr.js","node_modules/mathjs/lib/function/algebra/sparse/csTdfs.js","node_modules/mathjs/lib/function/algebra/sparse/csUnflip.js","node_modules/mathjs/lib/function/arithmetic/abs.js","node_modules/mathjs/lib/function/arithmetic/add.js","node_modules/mathjs/lib/function/arithmetic/addScalar.js","node_modules/mathjs/lib/function/arithmetic/cbrt.js","node_modules/mathjs/lib/function/arithmetic/ceil.js","node_modules/mathjs/lib/function/arithmetic/cube.js","node_modules/mathjs/lib/function/arithmetic/divide.js","node_modules/mathjs/lib/function/arithmetic/divideScalar.js","node_modules/mathjs/lib/function/arithmetic/dotDivide.js","node_modules/mathjs/lib/function/arithmetic/dotMultiply.js","node_modules/mathjs/lib/function/arithmetic/dotPow.js","node_modules/mathjs/lib/function/arithmetic/exp.js","node_modules/mathjs/lib/function/arithmetic/expm1.js","node_modules/mathjs/lib/function/arithmetic/fix.js","node_modules/mathjs/lib/function/arithmetic/floor.js","node_modules/mathjs/lib/function/arithmetic/gcd.js","node_modules/mathjs/lib/function/arithmetic/hypot.js","node_modules/mathjs/lib/function/arithmetic/index.js","node_modules/mathjs/lib/function/arithmetic/lcm.js","node_modules/mathjs/lib/function/arithmetic/log.js","node_modules/mathjs/lib/function/arithmetic/log10.js","node_modules/mathjs/lib/function/arithmetic/log1p.js","node_modules/mathjs/lib/function/arithmetic/log2.js","node_modules/mathjs/lib/function/arithmetic/mod.js","node_modules/mathjs/lib/function/arithmetic/multiply.js","node_modules/mathjs/lib/function/arithmetic/multiplyScalar.js","node_modules/mathjs/lib/function/arithmetic/norm.js","node_modules/mathjs/lib/function/arithmetic/nthRoot.js","node_modules/mathjs/lib/function/arithmetic/nthRoots.js","node_modules/mathjs/lib/function/arithmetic/pow.js","node_modules/mathjs/lib/function/arithmetic/round.js","node_modules/mathjs/lib/function/arithmetic/sign.js","node_modules/mathjs/lib/function/arithmetic/sqrt.js","node_modules/mathjs/lib/function/arithmetic/square.js","node_modules/mathjs/lib/function/arithmetic/subtract.js","node_modules/mathjs/lib/function/arithmetic/unaryMinus.js","node_modules/mathjs/lib/function/arithmetic/unaryPlus.js","node_modules/mathjs/lib/function/arithmetic/xgcd.js","node_modules/mathjs/lib/function/bitwise/bitAnd.js","node_modules/mathjs/lib/function/bitwise/bitNot.js","node_modules/mathjs/lib/function/bitwise/bitOr.js","node_modules/mathjs/lib/function/bitwise/bitXor.js","node_modules/mathjs/lib/function/bitwise/index.js","node_modules/mathjs/lib/function/bitwise/leftShift.js","node_modules/mathjs/lib/function/bitwise/rightArithShift.js","node_modules/mathjs/lib/function/bitwise/rightLogShift.js","node_modules/mathjs/lib/function/combinatorics/bellNumbers.js","node_modules/mathjs/lib/function/combinatorics/catalan.js","node_modules/mathjs/lib/function/combinatorics/composition.js","node_modules/mathjs/lib/function/combinatorics/index.js","node_modules/mathjs/lib/function/combinatorics/stirlingS2.js","node_modules/mathjs/lib/function/complex/arg.js","node_modules/mathjs/lib/function/complex/conj.js","node_modules/mathjs/lib/function/complex/im.js","node_modules/mathjs/lib/function/complex/index.js","node_modules/mathjs/lib/function/complex/re.js","node_modules/mathjs/lib/function/geometry/distance.js","node_modules/mathjs/lib/function/geometry/index.js","node_modules/mathjs/lib/function/geometry/intersect.js","node_modules/mathjs/lib/function/index.js","node_modules/mathjs/lib/function/logical/and.js","node_modules/mathjs/lib/function/logical/index.js","node_modules/mathjs/lib/function/logical/not.js","node_modules/mathjs/lib/function/logical/or.js","node_modules/mathjs/lib/function/logical/xor.js","node_modules/mathjs/lib/function/matrix/apply.js","node_modules/mathjs/lib/function/matrix/concat.js","node_modules/mathjs/lib/function/matrix/cross.js","node_modules/mathjs/lib/function/matrix/ctranspose.js","node_modules/mathjs/lib/function/matrix/det.js","node_modules/mathjs/lib/function/matrix/diag.js","node_modules/mathjs/lib/function/matrix/dot.js","node_modules/mathjs/lib/function/matrix/expm.js","node_modules/mathjs/lib/function/matrix/eye.js","node_modules/mathjs/lib/function/matrix/filter.js","node_modules/mathjs/lib/function/matrix/flatten.js","node_modules/mathjs/lib/function/matrix/forEach.js","node_modules/mathjs/lib/function/matrix/getMatrixDataType.js","node_modules/mathjs/lib/function/matrix/identity.js","node_modules/mathjs/lib/function/matrix/index.js","node_modules/mathjs/lib/function/matrix/inv.js","node_modules/mathjs/lib/function/matrix/kron.js","node_modules/mathjs/lib/function/matrix/map.js","node_modules/mathjs/lib/function/matrix/ones.js","node_modules/mathjs/lib/function/matrix/partitionSelect.js","node_modules/mathjs/lib/function/matrix/range.js","node_modules/mathjs/lib/function/matrix/reshape.js","node_modules/mathjs/lib/function/matrix/resize.js","node_modules/mathjs/lib/function/matrix/size.js","node_modules/mathjs/lib/function/matrix/sort.js","node_modules/mathjs/lib/function/matrix/sqrtm.js","node_modules/mathjs/lib/function/matrix/squeeze.js","node_modules/mathjs/lib/function/matrix/subset.js","node_modules/mathjs/lib/function/matrix/trace.js","node_modules/mathjs/lib/function/matrix/transpose.js","node_modules/mathjs/lib/function/matrix/zeros.js","node_modules/mathjs/lib/function/probability/combinations.js","node_modules/mathjs/lib/function/probability/distribution.js","node_modules/mathjs/lib/function/probability/factorial.js","node_modules/mathjs/lib/function/probability/gamma.js","node_modules/mathjs/lib/function/probability/index.js","node_modules/mathjs/lib/function/probability/kldivergence.js","node_modules/mathjs/lib/function/probability/multinomial.js","node_modules/mathjs/lib/function/probability/permutations.js","node_modules/mathjs/lib/function/probability/pickRandom.js","node_modules/mathjs/lib/function/probability/product.js","node_modules/mathjs/lib/function/probability/random.js","node_modules/mathjs/lib/function/probability/randomInt.js","node_modules/mathjs/lib/function/probability/seededRNG.js","node_modules/mathjs/lib/function/relational/compare.js","node_modules/mathjs/lib/function/relational/compareNatural.js","node_modules/mathjs/lib/function/relational/compareText.js","node_modules/mathjs/lib/function/relational/deepEqual.js","node_modules/mathjs/lib/function/relational/equal.js","node_modules/mathjs/lib/function/relational/equalScalar.js","node_modules/mathjs/lib/function/relational/equalText.js","node_modules/mathjs/lib/function/relational/index.js","node_modules/mathjs/lib/function/relational/larger.js","node_modules/mathjs/lib/function/relational/largerEq.js","node_modules/mathjs/lib/function/relational/smaller.js","node_modules/mathjs/lib/function/relational/smallerEq.js","node_modules/mathjs/lib/function/relational/unequal.js","node_modules/mathjs/lib/function/set/index.js","node_modules/mathjs/lib/function/set/setCartesian.js","node_modules/mathjs/lib/function/set/setDifference.js","node_modules/mathjs/lib/function/set/setDistinct.js","node_modules/mathjs/lib/function/set/setIntersect.js","node_modules/mathjs/lib/function/set/setIsSubset.js","node_modules/mathjs/lib/function/set/setMultiplicity.js","node_modules/mathjs/lib/function/set/setPowerset.js","node_modules/mathjs/lib/function/set/setSize.js","node_modules/mathjs/lib/function/set/setSymDifference.js","node_modules/mathjs/lib/function/set/setUnion.js","node_modules/mathjs/lib/function/special/erf.js","node_modules/mathjs/lib/function/special/index.js","node_modules/mathjs/lib/function/statistics/index.js","node_modules/mathjs/lib/function/statistics/mad.js","node_modules/mathjs/lib/function/statistics/max.js","node_modules/mathjs/lib/function/statistics/mean.js","node_modules/mathjs/lib/function/statistics/median.js","node_modules/mathjs/lib/function/statistics/min.js","node_modules/mathjs/lib/function/statistics/mode.js","node_modules/mathjs/lib/function/statistics/prod.js","node_modules/mathjs/lib/function/statistics/quantileSeq.js","node_modules/mathjs/lib/function/statistics/std.js","node_modules/mathjs/lib/function/statistics/sum.js","node_modules/mathjs/lib/function/statistics/utils/improveErrorMessage.js","node_modules/mathjs/lib/function/statistics/var.js","node_modules/mathjs/lib/function/string/format.js","node_modules/mathjs/lib/function/string/index.js","node_modules/mathjs/lib/function/string/print.js","node_modules/mathjs/lib/function/trigonometry/acos.js","node_modules/mathjs/lib/function/trigonometry/acosh.js","node_modules/mathjs/lib/function/trigonometry/acot.js","node_modules/mathjs/lib/function/trigonometry/acoth.js","node_modules/mathjs/lib/function/trigonometry/acsc.js","node_modules/mathjs/lib/function/trigonometry/acsch.js","node_modules/mathjs/lib/function/trigonometry/asec.js","node_modules/mathjs/lib/function/trigonometry/asech.js","node_modules/mathjs/lib/function/trigonometry/asin.js","node_modules/mathjs/lib/function/trigonometry/asinh.js","node_modules/mathjs/lib/function/trigonometry/atan.js","node_modules/mathjs/lib/function/trigonometry/atan2.js","node_modules/mathjs/lib/function/trigonometry/atanh.js","node_modules/mathjs/lib/function/trigonometry/cos.js","node_modules/mathjs/lib/function/trigonometry/cosh.js","node_modules/mathjs/lib/function/trigonometry/cot.js","node_modules/mathjs/lib/function/trigonometry/coth.js","node_modules/mathjs/lib/function/trigonometry/csc.js","node_modules/mathjs/lib/function/trigonometry/csch.js","node_modules/mathjs/lib/function/trigonometry/index.js","node_modules/mathjs/lib/function/trigonometry/sec.js","node_modules/mathjs/lib/function/trigonometry/sech.js","node_modules/mathjs/lib/function/trigonometry/sin.js","node_modules/mathjs/lib/function/trigonometry/sinh.js","node_modules/mathjs/lib/function/trigonometry/tan.js","node_modules/mathjs/lib/function/trigonometry/tanh.js","node_modules/mathjs/lib/function/unit/index.js","node_modules/mathjs/lib/function/unit/to.js","node_modules/mathjs/lib/function/utils/clone.js","node_modules/mathjs/lib/function/utils/hasNumericValue.js","node_modules/mathjs/lib/function/utils/index.js","node_modules/mathjs/lib/function/utils/isInteger.js","node_modules/mathjs/lib/function/utils/isNaN.js","node_modules/mathjs/lib/function/utils/isNegative.js","node_modules/mathjs/lib/function/utils/isNumeric.js","node_modules/mathjs/lib/function/utils/isPositive.js","node_modules/mathjs/lib/function/utils/isPrime.js","node_modules/mathjs/lib/function/utils/isZero.js","node_modules/mathjs/lib/function/utils/typeof.js","node_modules/mathjs/lib/json/index.js","node_modules/mathjs/lib/json/reviver.js","node_modules/mathjs/lib/type/bignumber/BigNumber.js","node_modules/mathjs/lib/type/bignumber/function/bignumber.js","node_modules/mathjs/lib/type/bignumber/index.js","node_modules/mathjs/lib/type/boolean.js","node_modules/mathjs/lib/type/chain/Chain.js","node_modules/mathjs/lib/type/chain/function/chain.js","node_modules/mathjs/lib/type/chain/index.js","node_modules/mathjs/lib/type/complex/Complex.js","node_modules/mathjs/lib/type/complex/function/complex.js","node_modules/mathjs/lib/type/complex/index.js","node_modules/mathjs/lib/type/fraction/Fraction.js","node_modules/mathjs/lib/type/fraction/function/fraction.js","node_modules/mathjs/lib/type/fraction/index.js","node_modules/mathjs/lib/type/index.js","node_modules/mathjs/lib/type/matrix/DenseMatrix.js","node_modules/mathjs/lib/type/matrix/FibonacciHeap.js","node_modules/mathjs/lib/type/matrix/ImmutableDenseMatrix.js","node_modules/mathjs/lib/type/matrix/Matrix.js","node_modules/mathjs/lib/type/matrix/MatrixIndex.js","node_modules/mathjs/lib/type/matrix/Range.js","node_modules/mathjs/lib/type/matrix/Spa.js","node_modules/mathjs/lib/type/matrix/SparseMatrix.js","node_modules/mathjs/lib/type/matrix/function/index.js","node_modules/mathjs/lib/type/matrix/function/matrix.js","node_modules/mathjs/lib/type/matrix/function/sparse.js","node_modules/mathjs/lib/type/matrix/index.js","node_modules/mathjs/lib/type/matrix/utils/algorithm01.js","node_modules/mathjs/lib/type/matrix/utils/algorithm02.js","node_modules/mathjs/lib/type/matrix/utils/algorithm03.js","node_modules/mathjs/lib/type/matrix/utils/algorithm04.js","node_modules/mathjs/lib/type/matrix/utils/algorithm05.js","node_modules/mathjs/lib/type/matrix/utils/algorithm06.js","node_modules/mathjs/lib/type/matrix/utils/algorithm07.js","node_modules/mathjs/lib/type/matrix/utils/algorithm08.js","node_modules/mathjs/lib/type/matrix/utils/algorithm09.js","node_modules/mathjs/lib/type/matrix/utils/algorithm10.js","node_modules/mathjs/lib/type/matrix/utils/algorithm11.js","node_modules/mathjs/lib/type/matrix/utils/algorithm12.js","node_modules/mathjs/lib/type/matrix/utils/algorithm13.js","node_modules/mathjs/lib/type/matrix/utils/algorithm14.js","node_modules/mathjs/lib/type/matrix/utils/getArrayDataType.js","node_modules/mathjs/lib/type/number.js","node_modules/mathjs/lib/type/numeric.js","node_modules/mathjs/lib/type/resultset/ResultSet.js","node_modules/mathjs/lib/type/resultset/index.js","node_modules/mathjs/lib/type/string.js","node_modules/mathjs/lib/type/unit/Unit.js","node_modules/mathjs/lib/type/unit/function/createUnit.js","node_modules/mathjs/lib/type/unit/function/splitUnit.js","node_modules/mathjs/lib/type/unit/function/unit.js","node_modules/mathjs/lib/type/unit/index.js","node_modules/mathjs/lib/type/unit/physicalConstants.js","node_modules/mathjs/lib/utils/array.js","node_modules/mathjs/lib/utils/bignumber/bitAnd.js","node_modules/mathjs/lib/utils/bignumber/bitNot.js","node_modules/mathjs/lib/utils/bignumber/bitOr.js","node_modules/mathjs/lib/utils/bignumber/bitXor.js","node_modules/mathjs/lib/utils/bignumber/bitwise.js","node_modules/mathjs/lib/utils/bignumber/constants.js","node_modules/mathjs/lib/utils/bignumber/formatter.js","node_modules/mathjs/lib/utils/bignumber/isBigNumber.js","node_modules/mathjs/lib/utils/bignumber/leftShift.js","node_modules/mathjs/lib/utils/bignumber/nearlyEqual.js","node_modules/mathjs/lib/utils/bignumber/rightArithShift.js","node_modules/mathjs/lib/utils/boolean.js","node_modules/mathjs/lib/utils/collection/containsCollections.js","node_modules/mathjs/lib/utils/collection/deepForEach.js","node_modules/mathjs/lib/utils/collection/deepMap.js","node_modules/mathjs/lib/utils/collection/isCollection.js","node_modules/mathjs/lib/utils/collection/isMatrix.js","node_modules/mathjs/lib/utils/collection/reduce.js","node_modules/mathjs/lib/utils/collection/scatter.js","node_modules/mathjs/lib/utils/customs.js","node_modules/mathjs/lib/utils/emitter.js","node_modules/mathjs/lib/utils/function.js","node_modules/mathjs/lib/utils/index.js","node_modules/mathjs/lib/utils/latex.js","node_modules/mathjs/lib/utils/number.js","node_modules/mathjs/lib/utils/object.js","node_modules/mathjs/lib/utils/polyfills.js","node_modules/mathjs/lib/utils/string.js","node_modules/sd-computations/src/computations-engine.js","node_modules/sd-computations/src/computations-manager.js","node_modules/sd-computations/src/computations-utils.js","node_modules/sd-computations/src/expressions-evaluator.js","node_modules/sd-computations/src/index.js","node_modules/sd-computations/src/jobs/configurations/league-table/league-table-job-parameters.js","node_modules/sd-computations/src/jobs/configurations/league-table/league-table-job.js","node_modules/sd-computations/src/jobs/configurations/league-table/steps/calculate-step.js","node_modules/sd-computations/src/jobs/configurations/recompute/recompute-job-parameters.js","node_modules/sd-computations/src/jobs/configurations/recompute/recompute-job.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/n-way/sensitivity-analysis-job-parameters.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/n-way/sensitivity-analysis-job.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/n-way/steps/calculate-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/n-way/steps/init-policies-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/n-way/steps/prepare-variables-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/probabilistic/probabilistic-sensitivity-analysis-job-parameters.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/probabilistic/probabilistic-sensitivity-analysis-job.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/probabilistic/steps/compute-policy-stats-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/probabilistic/steps/prob-calculate-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/spider-plot/spider-plot-job-parameters.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/spider-plot/spider-plot-job.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/spider-plot/steps/calculate-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/tornado-diagram/steps/calculate-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/tornado-diagram/steps/prepare-variables-step.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/tornado-diagram/tornado-diagram-job-parameters.js","node_modules/sd-computations/src/jobs/configurations/sensitivity-analysis/tornado-diagram/tornado-diagram-job.js","node_modules/sd-computations/src/jobs/engine/batch/batch-step.js","node_modules/sd-computations/src/jobs/engine/exceptions/extendable-error.js","node_modules/sd-computations/src/jobs/engine/exceptions/index.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-computation-exception.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-data-invalid-exception.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-execution-already-running-exception.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-instance-already-complete-exception.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-interrupted-exception.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-parameters-invalid-exception.js","node_modules/sd-computations/src/jobs/engine/exceptions/job-restart-exception.js","node_modules/sd-computations/src/jobs/engine/execution-context.js","node_modules/sd-computations/src/jobs/engine/index.js","node_modules/sd-computations/src/jobs/engine/job-execution-flag.js","node_modules/sd-computations/src/jobs/engine/job-execution-listener.js","node_modules/sd-computations/src/jobs/engine/job-execution.js","node_modules/sd-computations/src/jobs/engine/job-instance.js","node_modules/sd-computations/src/jobs/engine/job-key-generator.js","node_modules/sd-computations/src/jobs/engine/job-launcher.js","node_modules/sd-computations/src/jobs/engine/job-parameters.js","node_modules/sd-computations/src/jobs/engine/job-repository/idb-job-repository.js","node_modules/sd-computations/src/jobs/engine/job-repository/job-repository.js","node_modules/sd-computations/src/jobs/engine/job-repository/simple-job-repository.js","node_modules/sd-computations/src/jobs/engine/job-repository/timeout-job-repository.js","node_modules/sd-computations/src/jobs/engine/job-result.js","node_modules/sd-computations/src/jobs/engine/job-status.js","node_modules/sd-computations/src/jobs/engine/job.js","node_modules/sd-computations/src/jobs/engine/simple-job.js","node_modules/sd-computations/src/jobs/engine/step-execution-listener.js","node_modules/sd-computations/src/jobs/engine/step-execution.js","node_modules/sd-computations/src/jobs/engine/step.js","node_modules/sd-computations/src/jobs/index.js","node_modules/sd-computations/src/jobs/job-instance-manager.js","node_modules/sd-computations/src/jobs/job-worker.js","node_modules/sd-computations/src/jobs/jobs-manager.js","node_modules/sd-computations/src/objective/objective-rules-manager.js","node_modules/sd-computations/src/objective/rules/expected-value-maximization-rule.js","node_modules/sd-computations/src/objective/rules/expected-value-minimization-rule.js","node_modules/sd-computations/src/objective/rules/index.js","node_modules/sd-computations/src/objective/rules/max-max-rule.js","node_modules/sd-computations/src/objective/rules/max-min-rule.js","node_modules/sd-computations/src/objective/rules/maxi-max-rule.js","node_modules/sd-computations/src/objective/rules/maxi-min-rule.js","node_modules/sd-computations/src/objective/rules/min-max-rule.js","node_modules/sd-computations/src/objective/rules/min-min-rule.js","node_modules/sd-computations/src/objective/rules/mini-max-rule.js","node_modules/sd-computations/src/objective/rules/mini-min-rule.js","node_modules/sd-computations/src/objective/rules/multi-criteria-rule.js","node_modules/sd-computations/src/objective/rules/objective-rule.js","node_modules/sd-computations/src/operations/flip-subtree.js","node_modules/sd-computations/src/operations/operation.js","node_modules/sd-computations/src/operations/operations-manager.js","node_modules/sd-computations/src/policies/decision.js","node_modules/sd-computations/src/policies/policies-collector.js","node_modules/sd-computations/src/validation/payoff-value-validator.js","node_modules/sd-computations/src/validation/probability-value-validator.js","node_modules/sd-computations/src/validation/tree-validator.js","node_modules/sd-expression-engine/src/expression-engine.js","node_modules/sd-expression-engine/src/index.js","node_modules/sd-expression-engine/src/mathjs.js","node_modules/sd-model/src/data-model.js","node_modules/sd-model/src/domain/edge.js","node_modules/sd-model/src/domain/index.js","node_modules/sd-model/src/domain/node/chance-node.js","node_modules/sd-model/src/domain/node/decision-node.js","node_modules/sd-model/src/domain/node/node.js","node_modules/sd-model/src/domain/node/terminal-node.js","node_modules/sd-model/src/domain/object-with-computed-values.js","node_modules/sd-model/src/domain/object-with-id-and-editable-fields.js","node_modules/sd-model/src/domain/point.js","node_modules/sd-model/src/domain/text.js","node_modules/sd-model/src/index.js","node_modules/sd-model/src/validation-result.js","node_modules/sd-random/src/sd-random.js","node_modules/sd-utils/src/utils.js","node_modules/seed-random/index.js","node_modules/tiny-emitter/index.js","node_modules/typed-function/typed-function.js","sd-computations/src/jobs/engine/job-parameter-definition.js","sd-computations/src/policies/policy.js","sd-computations/src/validation/mcdm-weight-value-validator.js","index.js"],"names":["require","r","e","n","t","o","i","f","c","u","a","Error","code","p","exports","call","length","1","module","root","cosh","x","Math","exp","sinh","parser_exit","SyntaxError","logHypot","b","_a","abs","_b","log","cos","atan2","parse","z","re","im","undefined","Number","isFinite","Complex","sin","tokens","match","plus","minus","isNaN","parseFloat","this","prototype","sign","add","sub","mul","div","d","pow","arg","loh","sqrt","tmp","expm1","limit","PI","xx","cosm1","y","hypot","tan","cot","sec","csc","asin","t1","t2","acos","atan","Infinity","acot","asec","acsc","tanh","coth","csch","sech","asinh","res","acosh","atanh","noIM","oneMinus","onePlus","temp","acoth","acsch","asech","inverse","conjugate","neg","ceil","places","floor","round","equals","clone","toString","ret","toVector","valueOf","isZero","isInfinite","E","NaN","define","Object","defineProperty","value","globalScope","Decimal","inexact","noConflict","quadrant","EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","DEFAULTS","precision","rounding","modulo","toExpNeg","toExpPos","minE","maxE","crypto","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LOG_BASE","LN10_PRECISION","PI_PRECISION","P","name","digitsToString","k","ws","indexOfLastWord","str","w","getZeroString","checkInt32","min","max","checkRoundingDigits","rm","repeating","di","rd","convertBase","baseIn","baseOut","j","arrL","arr","strL","indexOf","charAt","reverse","absoluteValue","constructor","s","finalise","comparedTo","cmp","xdL","ydL","xd","yd","xs","ys","cosine","pr","Ctor","sd","len","taylorSeries","times","cos2x","toLessThanHalfPi","cubeRoot","cbrt","m","rep","t3","t3plusx","toExponential","slice","divide","eq","decimalPlaces","dp","dividedBy","dividedToIntegerBy","divToInt","greaterThan","gt","greaterThanOrEqualTo","gte","hyperbolicCosine","one","cosh2_x","d8","hyperbolicSine","sinh2_x","d5","d16","d20","hyperbolicTangent","inverseCosine","halfPi","isNeg","getPi","inverseHyperbolicCosine","lte","ln","inverseHyperbolicSine","inverseHyperbolicTangent","wpr","xsd","inverseSine","inverseTangent","px","x2","isInteger","isInt","isNegative","isPositive","isPos","lessThan","lt","lessThanOrEqualTo","logarithm","base","isBase10","denominator","inf","num","naturalLogarithm","getLn10","xe","xLTy","push","pop","shift","getBase10Exponent","mod","q","naturalExponential","negated","carry","unshift","getPrecision","sine","sin2_x","squareRoot","tangent","rL","toBinary","toStringBinary","toDecimalPlaces","toDP","finiteToString","toFixed","toFraction","maxD","d0","d1","d2","n0","n1","toHexadecimal","toHex","toNearest","toNumber","toOctal","toPower","yn","intPow","toPrecision","toSignificantDigits","toSD","truncated","trunc","toJSON","multiplyInteger","compare","aL","bL","subtract","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","isTruncated","digits","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","args","ltgt","guard","sum","c0","numerator","x1","String","parseDecimal","replace","search","substring","charCodeAt","isHyperbolic","pi","config","obj","v","useDefaults","defaults","ps","getRandomValues","randomBytes","arguments","isDecimalInstance","log2","log10","random","Uint32Array","copy","test","divisor","isFloat","toLowerCase","parseOther","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","set","hasOwnProperty","amd","Symbol","iterator","for","toStringTag","self","window","_extends","assign","target","source","key","defaultEscapes","{","}","\\","#","$","%","&","^","_","~","formatEscapes","–","—"," ","\t","\r\n","\n","defaultEscapeMapFn","_ref","_ref$preserveFormatti","preserveFormatting","_ref$escapeMapFn","escapeMapFn","runningStr","result","escapes","escapeKeys","keys","_loop","specialCharFound","forEach","index","createError","errorConstructor","apply","IntermediateInheritor","DivisionByZero","Fraction","InvalidParameter","parseInt","throwInvalidParam","p1","p2","M","A","B","C","D","gcd","lcm","simplify","eps","cont","rec","divisible","excludeWhole","whole","toLatex","toContinued","dec","g","N","cycLen","cycleLen","cycOff","rem1","rem2","modpow","cycleStart","promisifyRequest","request","Promise","resolve","reject","onsuccess","onerror","error","promisifyRequestCall","method","then","proxyProperties","ProxyClass","targetProp","properties","prop","get","val","proxyRequestMethods","Constructor","proxyMethods","proxyCursorRequestMethods","Cursor","promisifyCursorRequestCall","Index","_index","cursor","_cursor","_request","ObjectStore","store","_store","Transaction","idbTransaction","_tx","complete","oncomplete","onabort","UpgradeDB","db","oldVersion","transaction","_db","DB","IDBIndex","IDBCursor","methodName","createIndex","IDBObjectStore","objectStore","IDBTransaction","createObjectStore","IDBDatabase","funcName","Array","toArray","callback","nativeObject","getAll","query","count","instance","items","iterateCursor","continue","open","version","upgradeCallback","indexedDB","onupgradeneeded","event","delete","default","idb","naturalSort","oFxNcL","oFyNcL","sre","dre","hre","ore","insensitive","xN","split","yN","xD","Date","yD","cLoc","numS","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","WRAP_ARY_FLAG","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","RegExp","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrim","reTrimStart","reTrimEnd","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboRange","rsComboMarksRange","rsDingbatRange","rsLowerRange","rsUpperRange","rsVarRange","rsBreakRange","rsMathOpRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsSeq","join","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","'","\r","
","
","freeParseFloat","freeParseInt","freeGlobal","global","freeSelf","Function","freeExports","nodeType","freeModule","moduleExports","freeProcess","process","nodeUtil","types","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","func","thisArg","arrayAggregator","array","setter","iteratee","accumulator","arrayEach","arrayEachRight","arrayEvery","predicate","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","comparator","arrayMap","arrayPush","values","offset","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","collection","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","object","basePropertyOf","baseReduce","current","baseTimes","baseUnary","baseValues","props","cacheHas","cache","has","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","À","Á","Â","Ã","Ä","Å","à","á","â","ã","ä","å","Ç","ç","Ð","ð","È","É","Ê","Ë","è","é","ê","ë","Ì","Í","Î","Ï","ì","í","î","ï","Ñ","ñ","Ò","Ó","Ô","Õ","Ö","Ø","ò","ó","ô","õ","ö","ø","Ù","Ú","Û","Ü","ù","ú","û","ü","Ý","ý","ÿ","Æ","æ","Þ","þ","ß","Ā","Ă","Ą","ā","ă","ą","Ć","Ĉ","Ċ","Č","ć","ĉ","ċ","č","Ď","Đ","ď","đ","Ē","Ĕ","Ė","Ę","Ě","ē","ĕ","ė","ę","ě","Ĝ","Ğ","Ġ","Ģ","ĝ","ğ","ġ","ģ","Ĥ","Ħ","ĥ","ħ","Ĩ","Ī","Ĭ","Į","İ","ĩ","ī","ĭ","į","ı","Ĵ","ĵ","Ķ","ķ","ĸ","Ĺ","Ļ","Ľ","Ŀ","Ł","ĺ","ļ","ľ","ŀ","ł","Ń","Ņ","Ň","Ŋ","ń","ņ","ň","ŋ","Ō","Ŏ","Ő","ō","ŏ","ő","Ŕ","Ŗ","Ř","ŕ","ŗ","ř","Ś","Ŝ","Ş","Š","ś","ŝ","ş","š","Ţ","Ť","Ŧ","ţ","ť","ŧ","Ũ","Ū","Ŭ","Ů","Ű","Ų","ũ","ū","ŭ","ů","ű","ų","Ŵ","ŵ","Ŷ","ŷ","Ÿ","Ź","Ż","Ž","ź","ż","ž","IJ","ij","Œ","œ","ʼn","ſ","escapeHtmlChar","<",">","\"","escapeStringChar","chr","hasUnicode","string","mapToArray","map","size","overArg","transform","replaceHolders","placeholder","setToArray","stringSize","lastIndex","unicodeSize","stringToArray","unicodeToArray","asciiToArray","unescapeHtmlChar","&amp;","&lt;","&gt;","&quot;","&#39;","runInContext","context","uid","pick","TypeError","arrayProto","funcProto","objectProto","coreJsData","funcToString","idCounter","maskSrcKey","exec","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","create","propertyIsEnumerable","splice","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","getNative","ctxClearTimeout","clearTimeout","ctxNow","now","ctxSetTimeout","setTimeout","nativeCeil","nativeFloor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","nativeReverse","DataView","Map","Set","WeakMap","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","symbolToString","lodash","isObjectLike","isArray","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","isObject","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entries","clear","entry","ListCache","MapCache","SetCache","__data__","Stack","data","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","configurable","enumerable","writable","baseAt","paths","skip","number","lower","upper","baseClone","bitmask","customizer","stack","isDeep","isFlat","isFull","input","initCloneArray","tag","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","cloneSymbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","templateSettings","escape","evaluate","interpolate","variable","imports","hash","getMapData","pairs","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","path","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","objectToString","baseGt","other","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","seen","baseInvoke","parent","last","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","message","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","isMasked","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","safeGet","newValue","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","comparer","sort","baseSortBy","criteria","objCriteria","othCriteria","ordersLength","compareAscending","order","compareMultiple","basePickBy","baseSet","basePullAll","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","start","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","end","baseSome","baseSortedIndex","retHighest","low","high","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","actions","action","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","id","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","isIterateeCall","iterable","createCaseFirst","trailing","createCompounder","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","countHolders","newHolders","createRecurry","fn","arrLength","oldArray","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","wrapFunc","isCurry","newData","setData","setWrapToString","createRound","toInteger","pair","noop","createToPairs","setToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrValue","flatten","otherFunc","type","isKeyable","getValue","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","lastCalled","stamp","remaining","rand","memoize","quote","subString","difference","differenceBy","differenceWith","findIndex","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","find","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bind","bindKey","WRAP_BIND_FLAG","debounce","options","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","time","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","leadingEdge","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","isError","isNumber","isString","next","done","iteratorToArray","remainder","toLength","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","merge","omit","CLONE_DEEP_FLAG","basePick","pickBy","toPairs","toPairsIn","camelCase","word","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","toUpperCase","pattern","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","dividend","multiply","multiplier","multiplicand","minuend","subtrahend","after","castArray","chunk","compact","concat","cond","conforms","baseConforms","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","filter","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matches","matchesProperty","nthArg","omitBy","once","orderBy","propertyOf","pullAllBy","pullAllWith","remove","rest","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","update","updateWith","valuesIn","wrap","zipObject","zipObjectDeep","entriesIn","extend","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","endsWith","position","escapeRegExp","every","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","inRange","baseInRange","isBoolean","isElement","isEmpty","isEqual","isEqualWith","isMatch","isMatchWith","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","lastIndexOf","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","pad","strLength","padEnd","padStart","radix","floating","reduce","reduceRight","repeat","sample","some","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","startsWith","sumBy","template","settings","isEscaping","isEvaluating","importsKeys","importsValues","reDelimiters","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","omission","newEnd","unescape","uniqueId","prefix","each","eachRight","first","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","view","getView","iterLength","takeCount","iterIndex","commit","wrapped","definition","undefinedType","logMethods","bindMethod","replaceLoggingMethods","level","loggerName","methodFactory","debug","defaultMethodFactory","console","realMethod","Logger","defaultLevel","factory","currentLevel","storageKey","getPersistedLevel","storedLevel","localStorage","ignore","cookie","document","location","encodeURIComponent","levels","TRACE","DEBUG","INFO","WARN","ERROR","SILENT","getLevel","setLevel","persist","levelNum","levelName","persistLevelIfPossible","setDefaultLevel","enableAll","disableAll","initialLevel","defaultLogger","_loggersByName","getLogger","logger","_log","getLoggers","isFactory","typedFactory","emitter","importFactory","configFactory","factories","instances","math","expression","mathWithTransform","typed","_config","epsilon","matrix","predictable","randomSeed","load","validateOption","item","contains","warn","JSON","stringify","MATRIX","NUMBER","prev","deepExtend","curr","changes","emit","_typeof","lazy","traverse","ArgumentsError","_import","_wrap","isTypedFunction","override","signatures","_importTransform","silent","allowedInExpressions","_deleteTransform","_importFactory","existingTransform","namespace","existing","factoryAllowedInExpressions","unsafe","docs","json","mathImport","isUnit","isComplex","isBigNumber","isFraction","isMatrix","typedFunction","_createTyped","isDenseMatrix","isSparseMatrix","isRange","isResultSet","isHelp","isAccessorNode","isNode","isArrayNode","isAssignmentNode","isBlockNode","isConditionalNode","isConstantNode","isFunctionAssignmentNode","isFunctionNode","isIndexNode","isObjectNode","isOperatorNode","isParenthesisNode","isRangeNode","isSymbolNode","isChain","conversions","from","to","BigNumber","err","DenseMatrix","isArgumentsError","DimensionError","actual","expected","relation","RangeError","isDimensionError","IndexError","isIndexError","parser","Help","doc","desc","category","description","syntax","examples","expr","eval","format","seealso","mathjs","fromJSON","customs","_parse","Parser","scope","isParser","compile","getSafeProperty","setSafeProperty","construction","bignumber","complex","createUnit","fraction","sparse","splitUnit","unit","LN2","LOG2E","LOG10E","phi","SQRT1_2","SQRT2","tau","speedOfLight","gravitationConstant","planckConstant","reducedPlanckConstant","magneticConstant","electricConstant","vacuumImpedance","coulomb","elementaryCharge","bohrMagneton","conductanceQuantum","inverseConductanceQuantum","magneticFluxQuantum","nuclearMagneton","klitzing","bohrRadius","classicalElectronRadius","electronMass","fermiCoupling","fineStructure","hartreeEnergy","protonMass","deuteronMass","neutronMass","quantumOfCirculation","rydberg","thomsonCrossSection","weakMixingAngle","efimovFactor","atomicMass","avogadro","boltzmann","faraday","firstRadiation","loschmidt","gasConstant","molarPlanckConstant","molarVolume","sackurTetrode","secondRadiation","stefanBoltzmann","wienDisplacement","molarMass","molarMassC12","gravity","planckLength","planckMass","planckTime","planckCharge","planckTemperature","derivative","lsolve","lup","lusolve","rationalize","slu","usolve","qr","cube","dotDivide","dotMultiply","dotPow","expm","fix","log1p","norm","nthRoot","nthRoots","sqrtm","square","unaryMinus","unaryPlus","xgcd","bitAnd","bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift","bellNumbers","catalan","composition","stirlingS2","conj","help","distance","intersect","cross","ctranspose","det","diag","dot","getMatrixDataType","inv","kron","ones","partitionSelect","resize","reshape","squeeze","subset","trace","transpose","zeros","combinations","factorial","gamma","kldivergence","multinomial","permutations","pickRandom","randomInt","compareNatural","compareText","deepEqual","equalText","larger","largerEq","smaller","smallerEq","unequal","setCartesian","setDifference","setDistinct","setIntersect","setIsSubset","setMultiplicity","setPowerset","setSize","setSymDifference","setUnion","erf","mad","median","mode","quantileSeq","std","isNumeric","hasNumericValue","isPrime","deepMap","Array | Matrix","string, Object","Array | Matrix, Object","any","string | Array | Matrix","string | Array | Matrix, Object","","Node","access","AccessorNode","isObjectProperty","getObjectProperty","needParenthesis","node","_compile","argNames","evalObject","evalIndex","_ifNode","_toString","toHTML","_toTex","toTex","ArrayNode","deprecated","evalItems","evalItem","childNode","operators","AssignmentNode","parenthesis","precedence","getPrecedence","exprPrecedence","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","ResultSet","BlockNode","blocks","block","visible","evalBlocks","results","param","mathTypeOf","ConditionalNode","condition","trueExpr","falseExpr","evalCondition","evalTrueExpr","evalFalseExpr","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","escapeLatex","getType","ConstantNode","keywords","latex","FunctionAssignmentNode","params","childArgNames","evalExpr","signature","childArgs","toSymbol","validateSafeMethod","SymbolNode","FunctionNode","evalArgs","rawArgs","evalArg0","evalArg","_evalArg","evalArg1","_rawArgs","evalFn","_rawArgs2","nodeToString","expandTemplate","regex","inputPos","ReferenceError","customString","handler","nodeToTex","customTex","latexConverter","customToTex","defaultTemplate","getIdentifier","Range","IndexNode","dimensions","dotNotation","evalDimensions","needsEnd","evalStart","evalEnd","evalStep","_evalStart","_evalEnd","_evalStep","_childArgNames","evalRange","_evalRange","evalDimension","comment","_validateScope","_traverse","child","_transform","nodes","getContent","isSafeProperty","ObjectNode","evalEntries","stringifiedKey","parsedKey","_key","isSafeMethod","OperatorNode","op","implicit","calculateNecessaryParentheses","associativity","getAssociativity","operandPrecedence","operandIdentifier","rootIdentifier","latexLeftParens","latexParens","lhsParens","rhsParens","lhsPrecedence","assocWithLhs","isAssociativeWith","_rootIdentifier","lhsIdentifier","rhsIdentifier","rhsPrecedence","assocWithRhs","latexRightParens","argPrecedence","assocWithArg","argAssociativity","isUnary","parens","assoc","operand","opIsNamed","lhs","rhs","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","ParenthesisNode","content","RangeNode","startPrecedence","stepPrecedence","endPrecedence","RelationalNode","conditionals","isRelationalNode","compiled","evalLhs","evalRhs","condFn","_this","_this2","paramStrings","paramPrecedence","operatorMap","equal","isValuelessUnit","Unit","undef","errorTransform","OperatorNode:or","associativeWith","OperatorNode:xor","OperatorNode:and","OperatorNode:bitOr","OperatorNode:bitXor","OperatorNode:bitAnd","OperatorNode:equal","OperatorNode:unequal","OperatorNode:smaller","OperatorNode:larger","OperatorNode:smallerEq","OperatorNode:largerEq","OperatorNode:leftShift","OperatorNode:rightArithShift","OperatorNode:rightLogShift","OperatorNode:to","OperatorNode:add","OperatorNode:subtract","OperatorNode:multiply","OperatorNode:divide","OperatorNode:dotMultiply","OperatorNode:dotDivide","OperatorNode:mod","OperatorNode:unaryPlus","OperatorNode:unaryMinus","OperatorNode:bitNot","OperatorNode:not","OperatorNode:pow","OperatorNode:dotPow","OperatorNode:factorial","OperatorNode:transpose","_node","identifier","nodeA","nodeB","identifierA","identifierB","numeric","extraNodes","parseStart","Matrix","elem","TOKENTYPE","NULL","DELIMITER","SYMBOL","UNKNOWN","DELIMITERS",",","(",")","[","]",";","+","-","*",".*","/","./",".^","!","|","^|","=",":","?","==","!=","<=",">=","<<",">>",">>>","NAMED_DELIMITERS","in","and","or","not","CONSTANTS","true","false","null","NUMERIC_CONSTANTS","currentString","state","substr","currentCharacter","prevCharacter","nextCharacter","getToken","tokenType","token","isWhitespace","nestingLevel","c1","c2","c3","isDigitDot","isDigit","isDecimalMark","createSyntaxError","isAlpha","getTokenSkipNewline","openParams","closeParams","conditionalLevel","parseAssignment","parseBlock","valid","parseLogicalXor","parseLogicalOr","parseConditional","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","parseShift","parseConversion","parseRange","parseAddSubtract","parseMultiplyDivide","parseImplicitMultiplication","parseRule2","parseUnary","tokenStates","CustomNode","parseAccessors","rows","cols","numberStr","parseEnd","parseParentheses","parseNumber","parseDoubleQuotesStringToken","parseSingleQuotesStringToken","parseObject","row","parseRow","parseMatrix","parseSingleQuotesString","parseDoubleQuotesString","parseSymbol","parseCustomNodes","parseLeftHandOperators","parsePow","col","cPrev","cNext","isValidLatinOrGreek","isValidMathSymbol","...any","dim","filterRegExp","maxArgumentCount","_filter","compileInlineExpression","filterTransform","Array, function","Matrix, function","Array, RegExp","Matrix, RegExp","forEachTransform","_forEach","Array | Matrix, function","recurse","ii","_map","orig","argsCount","mapTransform","isCollection","subScope","variance","addScalar","divideScalar","multiplyScalar","equalScalar","SparseMatrix","Spa","_denseLUP","_size","columns","_data","ldata","lsize","udata","usize","pabsv","vjj","absv","_swapRows","vij","l","pv","L","U","_values","ptr","_ptr","lvalues","lindex","lptr","uvalues","uindex","uptr","pvCo","pvOc","spa","k0","k1","vkj","_forEachRow","vik","accumulate","swap","kx","ky","swapIndeces","_sparseLUP","_denseQR","Q","Qdata","R","Rdata","pivot","sgn","conjSgn","alphaSquared","alpha","u1","_sparseQR","csSqr","csLu","SparseMatrix, number, number","threshold","pinv","Node, SymbolNode, Object","constNodes","constTag","_derivative","Node, SymbolNode","string, SymbolNode","string, SymbolNode, Object","string, string","string, string, Object","Node, string","Node, string, Object","_simplify","deriv","_derivTex","Node, ConstantNode","Node, SymbolNode, ConstantNode","string, string, number","Object, ConstantNode, string","Object, SymbolNode, string","varName","Object, ParenthesisNode, string","Object, FunctionAssignmentNode, string","Object, FunctionNode | OperatorNode, string","isConst","ConstantNode, Object","createConstantNode","SymbolNode, Object","ParenthesisNode, Object","FunctionAssignmentNode, Object","FunctionNode, Object","funcArgsCheck","arg1","funcDerivative","arg0","negative","chainDerivative","OperatorNode, Object","constantTerms","nonConstantTerms","nonConstantNode","newArgs","argOuter","argInner","_arg","_arg2","powMinusOne","valueType","simplifyCore","simplifyConstant","string, boolean","detailed","string, Object, boolean","Node, boolean","Node, Object","Node, Object, boolean","setRules","oldRules","rulesFirst","rulesSucDiv","firstRules","distrDivRules","sucDivRules","firstRulesAgain","finalRules","rulesRationalize","polyRet","extended","rules","variables","exactFractions","oper","recPoly","tp","pos","retFunc","polynomial","nVars","sBefore","expandPower","indParent","internal","does","nEsqTopo","nDirTopo","eDistrDiv","redoInic","coefficients","retRationalize","polyToCanonical","cte","fire","maxExpo","varname","recurPol","noPai","noFil","_i","valor","_i2","no","n2","n3","util","isCommutative","isAssociative","unflattenr","unflattenl","createMakeNodeFunction","string, Object, Object","string, Array","string, Array, Object","string, Array, Object, Object","Node, Object, Object","Node, Array","Node, Array, Object","Node, Array, Object, Object","ruleSet","rule","newRule","ruleType","lr","removeParens","makeNode","expandsym","_lastsym","expanded","_buildRules","visited","applyRule","SUPPORTED_CONSTANTS","commutative","repl","_ruleMatch","placeholders","mergeMatch","match1","match2","_exactMatch","combineChildMatches","list1","list2","merged","i1","i2","isSplit","splits","right","rightArgs","getSplits","splitMatches","matchSet","childMatches","childMatch","sets","uniqueSets","unique","mergeChildMatches","_args","allChildren","_eval","fnname","_toNumber","_toNode","vn","unaryMinusNode","_exactFraction","Fraction, Object","BigNumber, Object","number, Object","Complex, Object","foldOp","ignoreandcontinue","foldFraction","operatorFunctions","ignoreandcontine","consts","vars","node0","node1","a0","a1","a00","a00a1","a01","associative","children","findChildren","curnode","solveValidation","_denseForwardSubstitution","bdata","bj","xj","SparseMatrix, Array | Matrix","jvalues","jindex","_sparseForwardSubstitution","DenseMatrix, Array | Matrix","Array, Array | Matrix","csIpvec","_lusolve","SparseMatrix, Array | Matrix, number, number","Object, Array | Matrix","_toMatrix","_denseBackwardSubstitution","_sparseBackwardSubstitution","msize","datatype","_datatype","asize","csFlip","csFkeep","csTdfs","_wclear","mark","lemax","W","_diag","dense","cm","tindex","tptr","_createTargetMatrix","k2","pj","nvi","pk","eln","pn","h","cindex","cptr","cnz","nv","elen","degree","hhead","_initializeQuotientGraph","nel","_initializeDegreeLists","mindeg","elenk","nvk","dk","pk1","pk2","wnvi","dext","p3","p4","nvj","jlast","ok","csLeaf","post","ata","J","p0","maxfirst","prevleaf","colcount","jleaf","csMarked","csMark","csUnflip","top","jnew","inext","aindex","aptr","avalues","nz","ancestor","sparent","jprev","csSpsolve","tol","lnz","unz","ipiv","xabs","adt","cvalues","t0","csDfs","gptr","gsize","bindex","bptr","csReach","lo","gvalues","gindex","bvalues","csAmd","csPermute","csEtree","csPost","csCounts","cp","leftmost","nque","m2","pa","_vcount","algorithm01","algorithm04","algorithm10","algorithm13","algorithm14","DenseMatrix, DenseMatrix","DenseMatrix, SparseMatrix","SparseMatrix, DenseMatrix","SparseMatrix, SparseMatrix","Array, Array","Array, Matrix","Matrix, Array","DenseMatrix, any","SparseMatrix, any","any, DenseMatrix","any, SparseMatrix","Array, any","any, Array","any, any","any, any, ...any","2","number, number","Complex, Complex","BigNumber, BigNumber","Fraction, Fraction","Unit, Unit","equalBase","fixPrefix","_cbrtNumber","_cbrtComplex","Complex, boolean","third","_result","allRoots","arg3","principal","all","nearlyEqual","bigNearlyEqual","algorithm11","Array | Matrix, Array | Matrix","any, Array | Matrix","getTypeOf","Unit, number | Fraction | BigNumber","_normalize","number | Fraction | BigNumber, Unit","algorithm02","algorithm03","algorithm07","algorithm12","algorithm09","_gcd","zero","SparseMatrix, number | BigNumber","DenseMatrix, number | BigNumber","number | BigNumber, SparseMatrix","number | BigNumber, DenseMatrix","Array, number | BigNumber","number | BigNumber, Array","Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber","... number | BigNumber","largest","_lcm","algorithm06","_log10","_log1pComplex","xRe1p","_log2Complex","newX","algorithm05","_validateMatrixDimensions","Matrix, Matrix","xsize","ysize","dt","adata","bdt","af","mf","_multiplyVectorVector","storage","bsize","alength","bcolumns","_multiplyVectorDenseMatrix","_multiplyVectorMatrix","_multiplyMatrixVector","_multiplyMatrixMatrix","size1","size2","arows","acolumns","brows","ib","vbi","ka0","ka1","ka","ia","ic","jb","kb0","kb1","cij","kb","vbij","number | Fraction | BigNumber | Complex, Unit","Unit, number | Fraction | BigNumber | Complex","boolean","_norm","number | Complex | BigNumber | boolean, number | BigNumber | string","Array, number | BigNumber | string","Matrix, number | BigNumber | string","sizeX","POSITIVE_INFINITY","pinf","ninf","NEGATIVE_INFINITY","maxc","cj","maxr","ri","fro","_nthRoot","complexErr","_bigNthRoot","Complex, number","density","Big","on","_calculateExactResult","_nthComplexRoots","aIsNumeric","roots","halfPiFactor","_pow","Array, number","_powArray","Array, BigNumber","Matrix, number","_powMatrix","Matrix, BigNumber","Unit, number | BigNumber","yFrac","yNum","ex","NO_INT","_round","decimals","Complex, BigNumber","_n","number, BigNumber","Fraction, number","number | Complex | BigNumber, SparseMatrix","number | Complex | BigNumber, DenseMatrix","number | Complex | BigNumber, Array","_sqrtNumber","checkEqualDimensions","boolean | string","lastx","lasty","bigBitAnd","bigBitNot","bigBitOr","bigBitXor","bigLeftShift","algorithm08","bigRightArithShift","number | BigNumber","number | BigNumber, number | BigNumber","kFactorial","negativeOne","kChooseI","iPower","_isNumber","_2d","_objectToArray","_3d","_parametricLine","_distancePointLine2D","den","_distancePointLine3D","x0","y0","z0","_distance2d","y1","y2","yDiff","xDiff","radicant","_distance3d","z1","z2","zDiff","Array, Array, Array","xCoeff","yCoeff","Object, Object, Object","lineTwoPtY","lineTwoPtX","lineOnePtY","lineOnePtX","pointX","pointY","Object, Object","xCoeffLine","yCoeffLine","pointZ","pointOneX","pointOneY","pointTwoX","pointTwoY","pointOneZ","pointTwoZ","_pairwise","_distancePairwise","plane","_4d","x1x","x2x","y1y","y2y","z1z","z2z","py","pz","_intersectLinePlane","Array, Array, Array, Array","p1a","p1b","p2a","p2b","o1","o2","d20o11","d21o10","d20o21","d21o20","_intersect2d","x3","y3","z3","x4","y4","z4","d1343","_intersect3dHelper","d4321","d1321","d4343","d2121","ta","tb","pax","pay","paz","pbx","pby","pbz","_intersect3d","Matrix, Matrix, Matrix","Matrix, Matrix, Matrix, Matrix","add1","add2","add3","arraySize","_apply","mat","tran","I","_switch","Array | Matrix, number | BigNumber, function","_concat","concatDim","...Array | Matrix | number | BigNumber","prevDim","asMatrix","matrices","...string","_cross","highestDimension","xSize","ySize","product","decomp","_det2","evenCycles","_det","Array, string","Array, number, string","Array, BigNumber, string","Matrix, string","Matrix, number, string","Matrix, BigNumber, string","kSuper","kSub","ms","diagonal","_createDiagonalMatrix","dm","vector","_getDiagonal","_dot","infNorm","errorEstimate","findParams","rowSum","infinityNorm","Apos","factor","AposToI","alternate","qfac","twoqfac","twoqp1fac","_filterCallback","_flatten","flat","getArrayDataType","getDataType","_identity","number | BigNumber, string","number | BigNumber, number | BigNumber, string","_identityVector","minimum","_inv","ABig","rBig","Ac","Bc","Ar","Br","_kron","_ones","...number | BigNumber | string","Array | Matrix, string","hasBigNumbers","_validate","asc","Array | Matrix, number","_partitionSelect","Array | Matrix, number, string","Array | Matrix, number, function","quickSelect","ZERO","ONE","_strRange","_out","_rangeEx","number, number, number","number, number, boolean","includeEnd","_rangeInc","number, number, number, boolean","_bigRangeEx","BigNumber, BigNumber, BigNumber","BigNumber, BigNumber, boolean","_bigRangeInc","BigNumber, BigNumber, BigNumber, boolean","nums","sizes","defaultChar","_resizeString","number | Complex | BigNumber | Unit | boolean | null","compareAsc","compareDesc","_arrayIsVector","_matrixIsVector","_comparator","iterations","Y","Z","Yk","_tolerance","_maxIterations","_denmanBeavers","validateIndex","_getObjectProperty","dimension","_setObjectProperty","replacement","updated","Array, Index","isScalar","Matrix, Index","Object, Index","string, Index","strLen","Array, Index, any","Array, Index, any, any","Matrix, Index, any","Matrix, Index, any, any","string, Index, string","_setSubstring","string, Index, string, string","Object, Index, any","_len","_denseTrace","transposedRow","transposed","_denseTranspose","_sparseTranspose","_zeros","isPositiveInteger","nMinusk","rng","distribution","distributions","_pickRandom","possibles","weights","single","totalWeights","randKey","_random","_randomInt","_randomDataForMatrix","randFunc","_length","arg2","number | Array","number | Array, number","Array, number, number","Array, number | Array","Array, number | Array, Array | number","uniform","normal","u2","picked","twoN","threeN","fourN","fiveN","real","twoPiSqrt","bigFactorial","_kldiv","plength","qlength","qnorm","pnorm","deepForEach","denom","ai","half","seedrandom","singletonRandom","setSeed","seed","boolean, boolean","compareBooleans","typeX","typeY","compareMatricesAndArrays","compareArrays","compareComplexNumbers","formatUnits","keysX","keysY","compareObjects","_compareText","_deepEqual","_unequal","MatrixIndex","a2","b1","b2","identify","generalize","inb2","number | BigNumber | Fraction | Complex, Array | Matrix","_subset","_sort","bitarray","Array | Matrix, boolean","MAX_NUM","ysq","xnum","xden","erf1","del","erfc2","erfc3","improveErrorMessage","_mad","...","med","containsCollections","_max","Array | Matrix, number | BigNumber","_largest","_mean","_median","left","middle2","middle","number | BigNumber | Complex | Unit","number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit","_min","_smallest","_mode","_prod","_quantileSeq","prob","sorted","_fracPart","validate","_left","_right","_integerPart","_value","integerPart","fracPart","integerPartNumber","_i3","number | BigNumber | Unit","probOrN","probArr","dataArr","nPlusOne","intN","_nPlusOne","currProb","_std","Array | Matrix, number | BigNumber, string","normalization","_sum","_sum2","fnName","DEFAULT_NORMALIZATION","_var","_varDim","diff","any, Object | function | number","_print","original","print","string, Object | Array","string, Object | Array, number | Object","_acosh","_atanh","hasBase","BASE_UNITS","ANGLE","_cosh","_coth","_csch","_sech","_sinh","_tanh","Unit, Unit | string","Matrix, any","any, Matrix","number | BigNumber | Fraction | boolean","Complex | Unit | string | null | undefined | Node","_typeof2","_decimal","__esModule","0","bool","lcase","Chain","createProxy","chainify","createLazyProxy","toPolar","strRe","strIm","fromPolar","EPSILON","symbols","preprocess","_resize","_fit","newSize","changed","_getSubmatrix","dims","_get","submatrix","sSize","iSize","unsqueeze","_setSubmatrix","dataIndex","subIndex","_set","indexI","me","swapRows","vi","_storage","oneOverLogPhi","FibonacciHeap","_minimum","_cut","isFibonacciHeap","insert","extractMinimum","numberOfChildren","tempRight","numRoots","_linkNodes","_findMinimumNode","_cascadingCut","_decreaseKey","ImmutableDenseMatrix","isImmutableDenseMatrix","skipZeros","ranges","_dimensions","_isScalar","_createImmutableMatrix","strings","hasStart","hasEnd","hasStep","_heap","isSpa","heap","nodei","nodej","_createFromArray","_createFromMatrix","_getValueIndex","bottom","_insert","ins","_toArray","idx","kk","mvalues","mindex","mptr","_getsubset","_setsubset","_remove","colIndex","rowIndex","r1","_j","minRow","maxRow","minColumn","maxColumn","_k","_i4","_i5","_k2","_i7","vx","vy","...number | string | BigNumber | Range | Array | Matrix","_create","Array | Matrix, string, string","denseMatrix","sparseMatrix","cf","cdata","xa","xb","wa","wb","wai","wbi","vc","scatter","_scatter","va","vb","csize","_iterate","av","bv","cv","_type","itemType","Unit, string | Unit","valuelessUnit","validInputTypes","validOutputTypes","outputType","inputType","constants","text","units","UNIT_NONE","PREFIXES","NONE","power","BASE_DIMENSIONS","skipAutomaticSimplification","skipWhitespace","revert","oldIndex","tentativeNumber","tentativeIndex","parseUnit","unitName","parseCharacter","toFind","_findUnit","UNITS","prefixes","_unit","prefixLen","prefixName","_prefix","getNumericIfUnitless","powerMultiplierCurrent","expectingUnit","valueStr","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","baseDim","UNIT_SYSTEMS","auto","allowNoUnits","_isDerived","unitValue","unitOffset","unitPower","unitPrefixValue","_getNumberConverter","_denormalize","prefixValue","inverted","valThis","valOther","toNumeric","matchingBase","matchingUnit","proposedUnitList","currentUnitSystem","missingBaseDim","toSI","strNum","strDen","nNum","nDen","simp","isImaginary","_bestPrefix","unitStr","absValue","absUnitValue","bestPrefix","bestDiff","scientific","SHORT","da","parts","xNumeric","xRounded","testSum","G","T","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","SQUARED","CUBIC","BINARY_SHORT_SI","BINARY_SHORT_IEC","Ki","Mi","Gi","Ti","Pi","Ei","Zi","Yi","BINARY_LONG_SI","BINARY_LONG_IEC","kibi","mebi","gibi","tebi","pebi","exi","zebi","yobi","BTU","MM","SHORTLONG","BINARY_SHORT","BINARY_LONG","MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","FORCE","SURFACE","VOLUME","ENERGY","POWER","PRESSURE","ELECTRIC_CHARGE","ELECTRIC_CAPACITANCE","ELECTRIC_POTENTIAL","ELECTRIC_RESISTANCE","ELECTRIC_INDUCTANCE","ELECTRIC_CONDUCTANCE","MAGNETIC_FLUX","MAGNETIC_FLUX_DENSITY","FREQUENCY","BIT","meter","inch","foot","yard","mile","link","rod","angstrom","ft","mi","li","ch","mil","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","acre","hectare","m3","litre","cuin","cuft","cuyd","teaspoon","tablespoon","gtt","minim","fluiddram","fluidounce","gill","cc","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","pt","qt","gal","bbl","obl","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","second","minute","hour","day","week","month","year","decade","century","millennium","hertz","reciprocal","Hz","rad","radian","deg","grad","gradian","cycle","arcsec","arcmin","ampere","K","degC","degF","degR","kelvin","celsius","fahrenheit","rankine","mol","mole","cd","candela","newton","dyn","dyne","lbf","poundforce","kip","joule","erg","Wh","eV","electronvolt","watt","hp","VAR","VA","Pa","psi","atm","bar","torr","mmHg","mmH2O","cmH2O","farad","F","volt","V","ohm","henry","H","siemens","S","weber","Wb","tesla","bits","bytes","ALIASES","meters","inches","feet","yards","miles","links","rods","chains","angstroms","litres","liter","liters","teaspoons","tablespoons","minims","fluiddrams","fluidounces","gills","cups","pints","quarts","gallons","beerbarrels","oilbarrels","hogsheads","gtts","grams","tons","tonnes","grains","drams","ounces","poundmasses","hundredweights","sticks","lb","lbs","kips","acres","hectares","sqfeet","sqyard","sqmile","sqmiles","mmhg","mmh2o","cmh2o","seconds","secs","minutes","mins","hours","hr","hrs","days","weeks","months","years","decades","centuries","millennia","radians","degrees","gradians","cycles","arcsecond","arcseconds","arcminute","arcminutes","BTUs","watts","joules","amperes","coulombs","volts","ohms","farads","webers","teslas","electronvolts","moles","calculateAngleValues","si","bit","cgs","us","_key2","setUnitSystem","getUnitSystem","typeConverters","_unit2","alias","_key3","_key4","deleteUnit","aliases","lastUnit","_key5","createUnitSingle","_c","isValidAlpha","assertUnitNameIsValid","defUnit","newUnit","anyMatch","_baseName","_newBaseUnit","baseName","newBaseUnit","_i6","_i8","aliasName","_alias","_key6","string, Unit | string | Object, Object","def","string, Unit | string | Object","Unit, Array","number | BigNumber | Fraction | Complex, string","setLazyConstant","fixedUnit","_DimensionError","dimNext","_number","_IndexError","_string","_defaultValue","oldLen","newLen","minLen","newArray","flatArray","totalSize","sizeIndex","tmpArray2","tmpArray","_reshape","_squeeze","_unsqueeze","_interopRequireDefault","bitwise","prevPrec","negOne","decCoefficientToBinaryString","xBits","yBits","minBits","maxBits","minSign","xSign","ySign","shortLen","longLen","expFuncVal","outVal","twoPower","two","hasher","objectUtils","notation","exponential","fixedOptions","lowerExp","upperExp","_reduce","safeNativeProperties","safeNativeMethods","toLocaleString","Emitter","off","callWithRightArgumentCount","argCount","Alpha","Beta","beta","Gamma","Delta","delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","theta","vartheta","Iota","iota","Kappa","kappa","varkappa","Lambda","lambda","Mu","mu","Nu","nu","Xi","Omicron","omicron","varpi","Rho","rho","varrho","Sigma","sigma","varsigma","Tau","Upsilon","upsilon","Phi","varphi","Chi","chi","Psi","Omega","omega","Inf","infinity","oo","lim","toEngineering","splitNumber","exponent","rounded","roundDigits","newExp","significandsDiff","expDiff","decimalIdx","decimalVal","splitValue","pp","DBL_EPSILON","canDefineProperty","_uninitialized","names","formatNumber","formatBigNumber","looksLikeFraction","formatArray","escaped","_sdUtils","_sdModel","_computationsManager","ComputationsEngineConfig","custom","_classCallCheck","_possibleConstructorReturn","_getPrototypeOf","logLevel","Utils","_assertThisInitialized","ComputationsManagerConfig","ComputationsEngine","getGlobalObject","isWorker","jobsManger","registerJobExecutionListener","beforeJob","jobExecution","reply","getDTO","afterJob","queryableFunctions","runJob","jobName","jobParametersValues","dataDTO","DataModel","executeJob","jobExecutionId","execute","catch","getErrorDTO","recompute","ruleName","evalCode","evalNumeric","objectiveRulesManager","setCurrentRuleByName","allRules","_checkValidityAndRecomputeObjective","onmessage","oEvent","queryMethod","queryArguments","defaultReply","ComputationsManager","setLogLevel","postMessage","queryMethodListener","queryMethodArguments","_sdExpressionEngine","_objectiveRulesManager","_treeValidator","_operationsManager","_jobsManager","_expressionsEvaluator","_jobInstanceManager","_policy","_mcdmWeightValueValidator","worker","delegateRecomputation","url","jobRepositoryType","clearRepository","setConfig","expressionEngine","ExpressionEngine","expressionsEvaluator","ExpressionsEvaluator","ObjectiveRulesManager","operationsManager","OperationsManager","JobsManager","workerUrl","repositoryType","treeValidator","TreeValidator","mcdmWeightValueValidator","McdmWeightValueValidator","checkValidityAndRecomputeObjective","getCurrentRule","updateFrom","updateDisplayValues","updateDefaultCriterion1Weight","defaultCriterion1Weight","validationResults","evalExpressions","weightValid","multiCriteria","getRoots","vr","getAllNodesInSubtree","isValid","recomputeTree","currentRule","getJobByName","operationsForObject","jobParamsValues","resolvePromiseAfterJobIsLaunched","run","jobInstanceManagerConfig","_this3","je","JobInstanceManager","getObjectiveRuleByName","isRuleName","reversePayoffs","weightLowerBound","weightUpperBound","flipRule","serialize","_this4","policyToDisplay","displayPolicy","updateNodeDisplayValues","edges","updateEdgeDisplayValues","_this5","$DISPLAY_VALUE_NAMES","displayValue","getNodeDisplayValue","_this6","getEdgeDisplayValue","_this7","clearDisplayValues","displayPolicyForNode","policy","_this8","domain","DecisionNode","decision","Policy","getDecision","childEdge","childEdges","decisionValue","ChanceNode","TerminalNode","ComputationsUtils","extent","toFloat","clearComputedValues","initScopes","evalGlobalCode","clearTree","evalExpressionsForNode","clearExpressionScope","$codeDirty","$codeError","expressionScope","edge","hasAssignmentExpression","payoff","parentNode","initScope","initScopeForNode","probabilitySum","hashEdges","invalidProb","rawPayoff","payoffIndex","isFieldValid","computedValue","evalPayoff","isHash","probability","$parent","parentScope","_computationsEngine","_jobParameters","_jobParameterDefinition","LeagueTableJobParameters","JobParameters","definitions","JobParameterDefinition","PARAMETER_TYPE","STRING","BOOLEAN","NUMBER_EXPRESSION","allVals","computeNumberExpression","guid","nameOfCriterion1","nameOfCriterion2","extendedPolicyDescription","defaultWeight","_simpleJob","_calculateStep","_leagueTableJobParameters","LeagueTableJob","jobRepository","initSteps","SimpleJob","calculateStep","CalculateStep","addStep","jobResult","jobParameters","withHeaders","headers","payoffNames","policies","rowCells","toPolicyString","payoffs","dominatedBy","extendedDominatedBy","incratio","optimal","optimalForDefaultWeight","_step","_jobStatus","_policiesCollector","Step","stepExecution","getJobParameters","treeRoot","PoliciesCollector","payoffCoeffs","previousValue","currentValue","_prev$policies","_toConsumableArray","bestCost","bestCostRow","prev2NotDominated","computeICER","lastLELower","lastLELowerDef","exitStatus","JOB_STATUS","COMPLETED","RecomputeJobParameters","_recomputeJobParameters","_job","RecomputeJob","isRestartable","Job","execution","SensitivityAnalysisJobParameters","INTEGER","isUnique","failOnInvalidTree","_sensitivityAnalysisJobParameters","_prepareVariablesStep","_initPoliciesStep","SensitivityAnalysisJob","batchSize","PrepareVariablesStep","InitPoliciesStep","chunkSize","variableNames","roundVariables","policyIndex","_variables","uniqueValues","uniqueValuesNo","notReadyVariablesIndexes","variableIndex","notReadyIndex","newReadyIndexes","uniqueVals","stepExecutions","total","steps","getProgress","_batchStep","_jobComputationException","BatchStep","getJobExecutionContext","variableValues","executionContext","put","startIndex","variableName","errorData","JobComputationException","_computationsUtils","sequence","cartesianProductOf","ProbabilisticSensitivityAnalysisJobParameters","_probabilisticSensitivityAnalysisJobParameters","_sensitivityAnalysisJob","_probCalculateStep","_computePolicyStatsStep","ProbabilisticSensitivityAnalysisJob","ProbCalculateStep","ComputePolicyStatsStep","numberOfRuns","ruleByName","payoffsPerPolicy","maximization","medians","standardDeviations","policyIsBestProbabilities","policyToHighestPayoffCount","policyToLowestPayoffCount","expectedValues","runIndex","singleRunVariableValues","errors","evaluated","formula","currentItemCount","updatePolicyStats","highestPayoff","lowestPayoff","bestPolicyIndexes","worstPolicyIndexes","zeroNum","SpiderPlotJobParameters","_spiderPlotJobParameters","SpiderPlotJob","percentageRangeValues","percentageChangeRange","policiesCollector","defaultValues","defVal","defaultPayoff","itemIndex","variableValue","_jobResult$data$rows","jobExecutionContext","variableExtents","extents","extentVariableValues","TornadoDiagramJobParameters","_tornadoDiagramJobParameters","TornadoDiagramJob","_jobInterruptedException","TOTAL_ITEM_COUNT_PROP","CURRENT_ITEM_COUNT_PROP","init","totalItemCount","setCurrentItemCount","getCurrentItemCount","setTotalItemCount","handleNextChunk","JobInterruptedException","postProcess","getTotalItemCount","checkJobExecutionFlags","terminateOnly","readNextChunk","processChunk","processedChunk","writeChunk","updateJobProgress","processItem","progress","jobInstance","updateJobExecutionProgress","checkExecutionFlags","ExtendableError","_extendableError","_jobDataInvalidException","_jobExecutionAlreadyRunningException","_jobInstanceAlreadyCompleteException","_jobParametersInvalidException","_jobRestartException","JobDataInvalidException","JobExecutionAlreadyRunningException","JobInstanceAlreadyCompleteException","JobParametersInvalidException","JobRestartException","ExecutionContext","dirty","prevValue","dto","exceptions","_interopRequireWildcard","_executionContext","_exportNames","_jobExecution","_jobExecutionFlag","_jobExecutionListener","_jobInstance","_jobKeyGenerator","_jobLauncher","_stepExecution","_stepExecutionListener","STOP","JobExecutionListener","JobExecution","status","STARTING","startTime","createTime","endTime","lastUpdated","failureExceptions","stepName","StepExecution","STOPPING","se","filteredProperties","deepClone","cloneMethod","JobInstance","JobKeyGenerator","identifying","JobLauncher","jobWorker","dataModelSerializer","jobOrName","job","createJobParameters","createJobExecution","executionPromise","_execute","getLastJobExecution","lastExecution","jobParametersValidator","jobDataValidator","jobExecutionOrId","getJobExecutionById","info","initDefinitions","initDefaultValues","defs","nestedParameters","getDefinition","_jobRepository","_idb","IdbJobRepository","expressionsReviver","dbName","deleteDB","initDB","JobRepository","dbPromise","upgradeDB","jobExecutionsOS","jobInstanceDao","ObjectStoreDao","jobExecutionDao","jobExecutionProgressDao","jobExecutionFlagDao","stepExecutionDao","jobResultDao","generateJobInstanceKey","findJobExecutions","jobExecutions","removeJobExecution","getJobResultByInstance","removeJobResult","findStepExecutions","removeStepExecution","jobResultId","getByIndex","reviveJobInstance","stepExecutionsDTOs","saveStepExecutionsDTOS","flag","savedExecutions","stepExecutionDTO","fetchJobExecutionRelations","jobExecutionDTO","_this9","revive","reviveJobExecution","jobExecutionDtoList","_this10","fetched","fetchJobExecutionsRelations","_this11","getAllByIndex","dtos","reviveStepExecution","_this12","fetchRelationsAndRevive","getTime","_this13","executions","latest","dataModel","loadFromDTO","_this14","reviveExecutionContext","stepDTO","_this15","indexName","_this16","_this17","_this18","tx","_this19","_this20","_this21","iterateKeyCursor","_jobResult","jobByName","saveJobInstance","getJobInstance","generateKey","isRunning","ABANDONED","createJobInstance","_setNewState","createStateSnapshot","instanceAndExecutionContext","saveJobExecution","getLastJobExecutionByInstance","saveStepExecution","JobResult","SimpleJobRepository","jobInstancesByKey","executionProgress","executionFlags","jobResults","ji","_simpleJobRepository","TimeoutJobRepository","valueToResolve","createTimeoutPromise","STARTED","STOPPED","FAILED","EXECUTING","executionListeners","getJobParametersValidator","getJobDataValidator","updateStatus","getResult","updateProgress","listener","doExecute","saveJobResult","getJobExecutionFlag","JOB_EXECUTION_FLAG","stop","handleNextStep","lastExecutedStepExecution","_execution$failureExc","prevStep","prevStepExecution","stepIndex","handleStep","isStopping","getLastStepExecution","lastStepExecution","stepExecutionPartOfExistingJobExecution","currentStepExecution","shouldStart","createStepExecution","isCompleted","isRestart","skipExecution","skipOnRestartIfCompleted","containsKey","addStepExecution","_currentStepExecution","stepStatus","completedSteps","StepExecutionListener","beforeStep","determineJobStatus","afterStep","close","engine","_jobWorker","JobInstanceManagerConfig","onJobStarted","onJobCompleted","onJobFailed","onJobStopped","onJobTerminated","onProgress","updateInterval","jobInstanceOrExecution","checkProgress","lastJobExecution","terminated","getProgressPercents","lastUpdateTime","callbacksThisArg","deregisterJobExecutionListener","getProgressFromExecution","forceUpdate","terminate","JobWorker","defaultListener","onError","listeners","Worker","deserializer","sendQuery","ruleNames","_idbJobRepository","_recomputeJob","_probabilisticSensitivityAnalysisJob","_timeoutJobRepository","_tornadoDiagramJob","_leagueTableJob","_spiderPlotJob","JobsManagerConfig","jobExecutionListeners","afterJobExecutionPromiseResolves","jobInstancesToTerminate","useWorker","initWorker","initRepository","registerJobs","jobLauncher","serializeData","getJsonReviver","getJsonReplacer","getJobExecutionProgress","saveJobExecutionFlag","removeJobInstance","_arguments","argsDeserializer","addListener","onJobFatalError","sensitivityAnalysisJob","probabilisticSensitivityAnalysisJob","setBatchSize","registerJob","registerExecutionListener","promiseResolve","_rules","model","_minMaxRule","_maxMinRule","_minMinRule","_maxMaxRule","currentRuleName","flipPair","addRule","ExpectedValueMaximizationRule","ExpectedValueMinimizationRule","MaxiMinRule","MaxiMaxRule","MiniMinRule","MiniMaxRule","minMax","MinMaxRule","maxMin","MaxMinRule","addFlipPair","minMin","MinMinRule","maxMax","MaxMaxRule","flipped","setDefaultCriterion1Weight","decisionPolicy","setPayoffIndex","setDecisionPolicy","computePayoff","computeOptimal","clearDecisionPolicy","computedBaseProbability","rule1","rule2","_objectiveRule","NAME","ObjectiveRule","probabilityToEnter","cValue","computedPayoff","basePayoff","_expectedValueMaximizationRule","_expectedValueMinimizationRule","_maxiMaxRule","_maxiMinRule","_miniMaxRule","_miniMinRule","_multiCriteriaRule","MultiCriteriaRule","bestChildPayoff","bestCount","worstChildPayoff","worstCount","optimalEdge","criterion1Weight","aggregatedPayoff","childrenPayoff","selectedIndexes","bestChild","basePayoffs","childCombinedPayoff","baseProbability","sumweight","ep","computeCombinedPayoff","combinedPayoff","decisionNode","childrenPayoffs","best","makeDecision","_makeDecision","worstChild","childPayoff","modifyChanceProbability","fieldPath","computedBasePayoff","_operation","FlipSubtree","$NAME","Operation","isApplicable","grandchildrenNumber","grandchildrenEdgeLabels","childrenEdgeLabelsSet","ge","rootClone","cloneSubtree","oldChildrenNumber","oldGrandChildrenNumber","childrenNumber","grandChildrenNumber","callbacksDisabled","childX","topY","stepY","removeNode","Point","addNode","grandChild","grandChildEdge","attachSubtree","divideGrandChildEdgeProbability","_normalizeProbabilitiesAfterFlip","_fireNodeAddedCallback","newProbabilitySum","_flipSubtree","operations","operationByName","registerOperation","operation","Decision","indent","toDecisionString","keyProperty","$id","childrenRes","_decision","optimalForRuleName","collect","decisions","nodeQueue","decisionNodes","PayoffValueValidator","maxSafeInteger","ProbabilityValueValidator","_probabilityValueValidator","_payoffValueValidator","probabilityValueValidator","payoffValueValidator","validationResult","ValidationResult","validateNode","addError","setValueValidity","sdRandom","functionNameList","importFn","import","asNumber","doEval","compileOnly","reviver","isExpressionObject","staticParser","prevScope","ev","parsed","randomMenuList","menuList","_expressionEngine","_validationResult","texts","$version","maxStackSize","undoStack","redoStack","undoRedoStateChangedCallback","nodeAddedCallback","nodeRemovedCallback","textAddedCallback","textRemovedCallback","filterLocation","filterComputed","replacer","filterPrivate","removeDistributions","trees","nodeData","createNodeFromData","textData","Text","serializedData","dataReviver","createFromDTO","byId","loadComputedValues","filterFunction","$TYPE","milestone","$fieldStatus","folded","edgeOrNode","ed","_addChild","Edge","_setEdgeInitialProbability","$l","_removeNode","parentEdge","removeEdge","_removeEdge","_fireNodeRemovedCallback","findSubtreeRoots","typeToConvertTo","newNode","createNodeByType","replaceNode","oldNode","nodeToCopy","cloneComputedValues","cloneNode","charts","childClone","nodeToAttach","nodeOrEdge","getAllDescendantEdges","findNodeById","findEdgeById","nodesToRemove","edgesToRemove","getAllDescendantNodes","descendants","revertConf","_pushToStack","_fireUndoRedoCallback","saveStateFromSnapshot","newState","_fireTextAddedCallback","removeText","_fireTextRemovedCallback","redo","nodeById","getObjectByIdMap","edgeById","onUndo","onRedo","_objectWithComputedValues","ObjectWithComputedValues","_decisionNode","_chanceNode","_terminalNode","_edge","_point","_text","withChildren","dx","dy","move","moveTo","_objectWithIdAndEditableFields","ObjectWithIdAndEditableFields","getFieldStatus","fieldStatus","_dataModel","warnings","objectIdToError","errorsByName","objE","getOwnPropertyNames","mult","Normal","Bernoulli","_u","_x","_u2","_u3","ainv","bbb","ccc","srcObj","output","isObjectNotArray","mergeDeep","_defineProperty","s4","objectList","mappingFn","idPropertyName","objectById","timers","ua","navigator","userAgent","msie","rv","prec","filteredPrefixes","v1","v2","v1parts","v2parts","validateParts","ver","versionRegexp","nextIndex","accesor","SQRT_2","pool","GLOBAL","startdenom","significance","overflow","oldRandom","ARC4","keylen","width","mixkey","smear","stringseed","tostring","fromCharCode","arc4","typ","entropy","plugins","screen","autoseed","resetGlobal","ctx","evtArr","evts","liveEvents","TinyEmitter","notOk","_types","anyType","_ignore","_conversions","findTypeByName","typeName","findInArray","hint","findTypeIndex","findTypeName","stringifyParams","typeNames","getTypeName","restParam","parseParam","notEmpty","notIgnore","matchingConversions","conversion","filterConversions","exactTypes","typeIndex","conversionIndex","convertibleTypes","hasRestParam","hasConversions","compileTest","test0","test1","tests","compileTests","varIndex","lastTest","testRestParam","getParamAtIndex","getExpectedTypeNames","excludeConversions","isExactType","mergeExpectedParams","getLowestTypeIndex","getLowestConversionIndex","compareSignatures","signature1","signature2","param1","param2","compileArgConversion","conversion0","conversion1","splitParams","ignoreConversionTypes","_splitParams","typeGroups","filteredTypes","typeGroup","createTypedFunction","signaturesMap","parsedSignatures","parsedParam","isInvalidParam","parseSignature","notNull","parsedSignature","conflictingSignature","hasOverlap","len1","len2","restParam1","restParam2","hasConflictingParams","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fns","fnConvert","compiledConversions","fnPreprocess","compileArgsPreprocessing","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","generic","_name","matchingSignatures","nextMatchingDefs","actualType","lengths","expectedLength","createSignaturesMap","array1","array2","getName","extractSignatures","validateUnique","_signature","_fn","...Function","string, ...Function","addType","beforeObjectTest","addConversion","DATE","COMPOSITE","typeOrNestedParametersDefinitions","minOccurs","maxOccurs","singleValueValidator","validator","required","allValues","validateSingleValue","nestedDef","ignoreId","prependId","additionalValidator","_src","_sdRandom","_loglevel","_utils"],"mappings":"AAAAA,QAAA,SAAAC,EAAAC,EAAAC,EAAAC,GAAA,SAAAC,EAAAC,EAAAC,GAAA,IAAAJ,EAAAG,GAAA,CAAA,IAAAJ,EAAAI,GAAA,CAAA,IAAAE,EAAA,mBAAAR,SAAAA,QAAA,IAAAO,GAAAC,EAAA,OAAAA,EAAAF,GAAA,GAAA,GAAAG,EAAA,OAAAA,EAAAH,GAAA,GAAA,IAAAI,EAAA,IAAAC,MAAA,uBAAAL,EAAA,KAAA,MAAAI,EAAAE,KAAA,mBAAAF,EAAA,IAAAG,EAAAV,EAAAG,GAAA,CAAAQ,QAAA,IAAAZ,EAAAI,GAAA,GAAAS,KAAAF,EAAAC,QAAA,SAAAb,GAAA,OAAAI,EAAAH,EAAAI,GAAA,GAAAL,IAAAA,IAAAY,EAAAA,EAAAC,QAAAb,EAAAC,EAAAC,EAAAC,GAAA,OAAAD,EAAAG,GAAAQ,QAAA,IAAA,IAAAL,EAAA,mBAAAT,SAAAA,QAAAM,EAAA,EAAAA,EAAAF,EAAAY,OAAAV,IAAAD,EAAAD,EAAAE,IAAA,OAAAD,EAAA,CAAA,CAAAY,EAAA,CAAA,SAAAjB,EAAAkB,EAAAJ,ICmCA,SAAAK,GAEA,aAEA,IAAAC,EAAA,SAAAC,GACA,MAAA,IAAAC,KAAAC,IAAAF,GAAAC,KAAAC,KAAAF,KAGAG,EAAA,SAAAH,GACA,MAAA,IAAAC,KAAAC,IAAAF,GAAAC,KAAAC,KAAAF,KAqDAI,EAAA,WACA,MAAAC,YAAA,kBAUA,SAAAC,EAAAjB,EAAAkB,GAEA,IAAAC,EAAAP,KAAAQ,IAAApB,GACAqB,EAAAT,KAAAQ,IAAAF,GAEA,OAAA,IAAAlB,EACAY,KAAAU,IAAAD,GAGA,IAAAH,EACAN,KAAAU,IAAAH,GAGAA,EAAA,KAAAE,EAAA,IACA,GAAAT,KAAAU,IAAAtB,EAAAA,EAAAkB,EAAAA,GAmCAN,KAAAU,IAAAtB,EAAAY,KAAAW,IAAAX,KAAAY,MAAAN,EAAAlB,KAGA,IAAAyB,EAAA,SAAAzB,EAAAkB,GAEA,IAAAQ,EAAA,CAAAC,GAAA,EAAAC,GAAA,GAEA,GAAA5B,MAAAA,EACA0B,EAAA,GACAA,EAAA,GAAA,OACA,QAAAG,IAAAX,EACAQ,EAAA,GAAA1B,EACA0B,EAAA,GAAAR,OAEA,cAAAlB,GAEA,IAAA,SAEA,GAAA,OAAAA,GAAA,OAAAA,EACA0B,EAAA,GAAA1B,EAAA,GACA0B,EAAA,GAAA1B,EAAA,QACA,GAAA,QAAAA,GAAA,QAAAA,EAAA,CACA,IAAA8B,OAAAC,SAAA/B,EAAA,MAAA8B,OAAAC,SAAA/B,EAAA,KACA,OAAAgC,EAAA,SAEAN,EAAA,GAAA1B,EAAA,IAAAY,KAAAW,IAAAvB,EAAA,KACA0B,EAAA,GAAA1B,EAAA,IAAAY,KAAAqB,IAAAjC,EAAA,UACA,GAAA,MAAAA,GAAA,QAAAA,EAAA,CACA,IAAA8B,OAAAC,SAAA/B,EAAA,IAAA8B,OAAAC,SAAA/B,EAAA,KACA,OAAAgC,EAAA,SAEAN,EAAA,GAAA1B,EAAA,EAAAY,KAAAW,IAAAvB,EAAA,KACA0B,EAAA,GAAA1B,EAAA,EAAAY,KAAAqB,IAAAjC,EAAA,UACA,IAAAA,EAAAM,QACAoB,EAAA,GAAA1B,EAAA,GACA0B,EAAA,GAAA1B,EAAA,IAEAe,IAEA,MAEA,IAAA,SAEAW,EAAA,GACAA,EAAA,GAAA,EAEA,IAAAQ,EAAAlC,EAAAmC,MAAA,yCACAC,EAAA,EACAC,EAAA,EAEA,OAAAH,GACAnB,IAGA,IAAA,IAAAnB,EAAA,EAAAA,EAAAsC,EAAA5B,OAAAV,IAAA,CAEA,IAAAE,EAAAoC,EAAAtC,GAEA,MAAAE,GAAA,OAAAA,GAAA,OAAAA,IAEA,MAAAA,EACAsC,IACA,MAAAtC,EACAuC,IAaAD,EAAAC,GAZA,MAAAvC,GAAA,MAAAA,GAEAsC,EAAAC,IAAA,GACAtB,IAGA,MAAAmB,EAAAtC,EAAA,IAAA0C,MAAAJ,EAAAtC,EAAA,IAIA8B,EAAA,IAAAa,YAAAF,EAAA,EAAA,IAAA,IAAA,MAHAX,EAAA,IAAAa,YAAAF,EAAA,EAAA,IAAA,IAAAH,EAAAtC,EAAA,IACAA,QAQAwC,EAAAC,IAAA,GAAAC,MAAAxC,KACAiB,IAGA,MAAAmB,EAAAtC,EAAA,IAAA,MAAAsC,EAAAtC,EAAA,IACA8B,EAAA,IAAAa,YAAAF,EAAA,EAAA,IAAA,IAAAvC,GACAF,KAEA8B,EAAA,IAAAa,YAAAF,EAAA,EAAA,IAAA,IAAAvC,IAZA,IAmBA,EAAAsC,EAAAC,GACAtB,IAEA,MAEA,IAAA,SACAW,EAAA,GAAA,EACAA,EAAA,GAAA1B,EACA,MAEA,QACAe,IAQA,OALAuB,MAAAZ,EAAA,KAAAY,MAAAZ,EAAA,IAKAA,GAOA,SAAAM,EAAAhC,EAAAkB,GAEA,KAAAsB,gBAAAR,GACA,OAAA,IAAAA,EAAAhC,EAAAkB,GAGA,IAAAQ,EAAAD,EAAAzB,EAAAkB,GAEAsB,KAAA,GAAAd,EAAA,GACAc,KAAA,GAAAd,EAAA,GAGAM,EAAAS,UAAA,CAEAd,GAAA,EACAC,GAAA,EAOAc,KAAA,WAEA,IAAAtB,EAAAoB,KAAA,MAEA,OAAA,IAAAR,EACAQ,KAAA,GAAApB,EACAoB,KAAA,GAAApB,IAQAuB,IAAA,SAAA3C,EAAAkB,GAEA,IAAAQ,EAAA,IAAAM,EAAAhC,EAAAkB,GAGA,OAAAsB,KAAA,cAAAd,EAAA,aACAM,EAAA,IAIAQ,KAAA,cAAAd,EAAA,aACAM,EAAA,SAGA,IAAAA,EACAQ,KAAA,GAAAd,EAAA,GACAc,KAAA,GAAAd,EAAA,KAQAkB,IAAA,SAAA5C,EAAAkB,GAEA,IAAAQ,EAAA,IAAAM,EAAAhC,EAAAkB,GAGA,OAAAsB,KAAA,cAAAd,EAAA,aACAM,EAAA,IAIAQ,KAAA,cAAAd,EAAA,aACAM,EAAA,SAGA,IAAAA,EACAQ,KAAA,GAAAd,EAAA,GACAc,KAAA,GAAAd,EAAA,KAQAmB,IAAA,SAAA7C,EAAAkB,GAEA,IAAAQ,EAAA,IAAAM,EAAAhC,EAAAkB,GAGA,OAAAsB,KAAA,cAAAd,EAAA,UAAAc,KAAA,UAAAd,EAAA,aACAM,EAAA,IAIAQ,KAAA,cAAAd,EAAA,aACAM,EAAA,SAIA,IAAAN,EAAA,IAAA,IAAAc,KAAA,GACA,IAAAR,EAAAQ,KAAA,GAAAd,EAAA,GAAA,GAGA,IAAAM,EACAQ,KAAA,GAAAd,EAAA,GAAAc,KAAA,GAAAd,EAAA,GACAc,KAAA,GAAAd,EAAA,GAAAc,KAAA,GAAAd,EAAA,KAQAoB,IAAA,SAAA9C,EAAAkB,GAEA,IAAAQ,EAAA,IAAAM,EAAAhC,EAAAkB,GAGA,GAAAsB,KAAA,UAAAd,EAAA,UAAAc,KAAA,cAAAd,EAAA,aACA,OAAAM,EAAA,IAIA,GAAAQ,KAAA,cAAAd,EAAA,SACA,OAAAM,EAAA,SAIA,GAAAQ,KAAA,UAAAd,EAAA,aACA,OAAAM,EAAA,KAGAhC,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,IAEA9C,EAAAiB,EAFAb,EAAA4B,EAAA,GACAqB,EAAArB,EAAA,GAGA,OAAA,IAAAqB,EAEA,IAAAf,EAAAhC,EAAAF,EAAAoB,EAAApB,GAGAc,KAAAQ,IAAAtB,GAAAc,KAAAQ,IAAA2B,GAKA,IAAAf,GACAhC,GAJAW,EAAAb,EAAAiD,GAIA7B,IAHAxB,EAAAI,EAAAa,EAAAoC,IAIA7B,EAAAP,EAAAX,GAAAN,GAOA,IAAAsC,GACAhC,EAAAkB,GAJAP,EAAAoC,EAAAjD,KACAJ,EAAAqD,EAAApC,EAAAb,IAIAoB,EAAAlB,EAAAW,GAAAjB,IASAsD,IAAA,SAAAhD,EAAAkB,GAEA,IAAAQ,EAAA,IAAAM,EAAAhC,EAAAkB,GAKA,GAHAlB,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEAd,EAAA,SACA,OAAAM,EAAA,IAIA,GAAA,IAAAN,EAAA,GAAA,CAEA,GAAA,IAAAR,GAAA,GAAAlB,EAEA,OAAA,IAAAgC,EAAApB,KAAAoC,IAAAhD,EAAA0B,EAAA,IAAA,GAEA,GAAA,IAAA1B,EAEA,QAAA0B,EAAA,GAAA,EAAA,GAAA,GACA,KAAA,EACA,OAAA,IAAAM,EAAApB,KAAAoC,IAAA9B,EAAAQ,EAAA,IAAA,GACA,KAAA,EACA,OAAA,IAAAM,EAAA,EAAApB,KAAAoC,IAAA9B,EAAAQ,EAAA,KACA,KAAA,EACA,OAAA,IAAAM,GAAApB,KAAAoC,IAAA9B,EAAAQ,EAAA,IAAA,GACA,KAAA,EACA,OAAA,IAAAM,EAAA,GAAApB,KAAAoC,IAAA9B,EAAAQ,EAAA,MAwBA,GAAA,IAAA1B,GAAA,IAAAkB,GAAA,EAAAQ,EAAA,IAAA,GAAAA,EAAA,GACA,OAAAM,EAAA,KAGA,IAAAiB,EAAArC,KAAAY,MAAAN,EAAAlB,GACAkD,EAAAjC,EAAAjB,EAAAkB,GAIA,OAFAlB,EAAAY,KAAAC,IAAAa,EAAA,GAAAwB,EAAAxB,EAAA,GAAAuB,GACA/B,EAAAQ,EAAA,GAAAwB,EAAAxB,EAAA,GAAAuB,EACA,IAAAjB,EACAhC,EAAAY,KAAAW,IAAAL,GACAlB,EAAAY,KAAAqB,IAAAf,KAQAiC,KAAA,WAEA,IAIAxB,EAAAC,EAJA5B,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GACAjD,EAAAiD,KAAA,MAIA,GAAA,GAAAxC,EAAA,CAEA,GAAA,IAAAkB,EACA,OAAA,IAAAc,EAAApB,KAAAuC,KAAAnD,GAAA,GAGA2B,EAAA,GAAAf,KAAAuC,KAAA,GAAA5D,EAAAS,SAEA2B,EAAAf,KAAAQ,IAAAF,GAAAN,KAAAuC,KAAA,GAAA5D,EAAAS,IASA,OALA4B,EADA5B,GAAA,EACA,GAAAY,KAAAuC,KAAA,GAAA5D,EAAAS,IAEAY,KAAAQ,IAAAF,GAAAN,KAAAuC,KAAA,GAAA5D,EAAAS,IAGA,IAAAgC,EAAAL,EAAAT,EAAA,GAAAU,EAAAA,IAQAf,IAAA,WAEA,IAAAuC,EAAAxC,KAAAC,IAAA2B,KAAA,IAKA,OAHAA,KAAA,GAGA,IAAAR,EACAoB,EAAAxC,KAAAW,IAAAiB,KAAA,IACAY,EAAAxC,KAAAqB,IAAAO,KAAA,MAWAa,MAAA,WAQA,IAAArD,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,OAAA,IAAAR,EACApB,KAAAyC,MAAArD,GAAAY,KAAAW,IAAAL,GAjhBA,SAAAP,GACA,IAAA2C,EAAA1C,KAAA2C,GAAA,EACA,GAAA5C,GAAA2C,GAAAA,EAAA3C,EACA,OAAAC,KAAAW,IAAAZ,GAAA,EAGA,IAAA6C,EAAA7C,EAAAA,EACA,OAAA6C,GACAA,GACA,EAAA,GAAAA,IACA,EAAA,IAAAA,GACA,EAAA,MAAAA,IACA,EAAA,QAAAA,GACA,EAAA,WAAAA,IACA,EAAA,YACA,EAAA,cADAA,QANA,IAygBAC,CAAAvC,GACAN,KAAAC,IAAAb,GAAAY,KAAAqB,IAAAf,KAQAI,IAAA,WAEA,IAAAtB,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAMA,OAAA,IAAAR,EACAf,EAAAjB,EAAAkB,GACAN,KAAAY,MAAAN,EAAAlB,KAQAoB,IAAA,WAEA,OAthBA,SAAAT,EAAA+C,GAEA,IAAA1D,EAAAY,KAAAQ,IAAAT,GACAO,EAAAN,KAAAQ,IAAAsC,GAEA,OAAA1D,EAAA,KAAAkB,EAAA,IACAN,KAAAuC,KAAAnD,EAAAA,EAAAkB,EAAAA,IAKAA,EAFAlB,EAAAkB,GACAlB,EAAAkB,EACAP,EAAA+C,GAEAA,EAAA/C,EAEAX,EAAAY,KAAAuC,KAAA,EAAAjC,EAAAA,IAugBAyC,CAAAnB,KAAA,GAAAA,KAAA,KAQAS,IAAA,WAEA,OAAArC,KAAAY,MAAAgB,KAAA,GAAAA,KAAA,KAQAP,IAAA,WAIA,IAAAjC,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,OAAA,IAAAR,EACApB,KAAAqB,IAAAjC,GAAAU,EAAAQ,GACAN,KAAAW,IAAAvB,GAAAc,EAAAI,KAQAK,IAAA,WAIA,IAAAvB,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,OAAA,IAAAR,EACApB,KAAAW,IAAAvB,GAAAU,EAAAQ,IACAN,KAAAqB,IAAAjC,GAAAc,EAAAI,KAQA0C,IAAA,WAIA,IAAA5D,EAAA,EAAAwC,KAAA,GACAtB,EAAA,EAAAsB,KAAA,GACAO,EAAAnC,KAAAW,IAAAvB,GAAAU,EAAAQ,GAEA,OAAA,IAAAc,EACApB,KAAAqB,IAAAjC,GAAA+C,EACAjC,EAAAI,GAAA6B,IAQAc,IAAA,WAIA,IAAA7D,EAAA,EAAAwC,KAAA,GACAtB,EAAA,EAAAsB,KAAA,GACAO,EAAAnC,KAAAW,IAAAvB,GAAAU,EAAAQ,GAEA,OAAA,IAAAc,GACApB,KAAAqB,IAAAjC,GAAA+C,EACAjC,EAAAI,GAAA6B,IAQAe,IAAA,WAIA,IAAA9D,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GACAO,EAAA,GAAArC,EAAA,EAAAQ,GAAA,GAAAN,KAAAW,IAAA,EAAAvB,GAEA,OAAA,IAAAgC,EACApB,KAAAW,IAAAvB,GAAAU,EAAAQ,GAAA6B,EACAnC,KAAAqB,IAAAjC,GAAAc,EAAAI,GAAA6B,IAQAgB,IAAA,WAIA,IAAA/D,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GACAO,EAAA,GAAArC,EAAA,EAAAQ,GAAA,GAAAN,KAAAW,IAAA,EAAAvB,GAEA,OAAA,IAAAgC,EACApB,KAAAqB,IAAAjC,GAAAU,EAAAQ,GAAA6B,GACAnC,KAAAW,IAAAvB,GAAAc,EAAAI,GAAA6B,IAQAiB,KAAA,WAIA,IAAAhE,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEAyB,EAAA,IAAAjC,EACAd,EAAAA,EAAAlB,EAAAA,EAAA,GACA,EAAAA,EAAAkB,GAAA,OAEAgD,EAAA,IAAAlC,EACAiC,EAAA,GAAA/C,EACA+C,EAAA,GAAAjE,GAAA,MAEA,OAAA,IAAAgC,EAAAkC,EAAA,IAAAA,EAAA,KAQAC,KAAA,WAIA,IAAAnE,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEAyB,EAAA,IAAAjC,EACAd,EAAAA,EAAAlB,EAAAA,EAAA,GACA,EAAAA,EAAAkB,GAAA,OAEAgD,EAAA,IAAAlC,EACAiC,EAAA,GAAA/C,EACA+C,EAAA,GAAAjE,GAAA,MAEA,OAAA,IAAAgC,EAAApB,KAAA2C,GAAA,EAAAW,EAAA,GAAAA,EAAA,KAQAE,KAAA,WAIA,IAAApE,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAA,IAAAxC,EAAA,CAEA,GAAA,IAAAkB,EACA,OAAA,IAAAc,EAAA,EAAAqC,EAAAA,GAGA,IAAA,IAAAnD,EACA,OAAA,IAAAc,EAAA,GAAAqC,EAAAA,GAIA,IAAAtB,EAAA/C,EAAAA,GAAA,EAAAkB,IAAA,EAAAA,GAEA+C,EAAA,IAAAjC,GACA,EAAAd,EAAAA,EAAAlB,EAAAA,GAAA+C,GACA,EAAA/C,EAAA+C,GAAAzB,MAEA,OAAA,IAAAU,GAAA,GAAAiC,EAAA,GAAA,GAAAA,EAAA,KAQAK,KAAA,WAIA,IAAAtE,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAA,IAAAtB,EACA,OAAA,IAAAc,EAAApB,KAAAY,MAAA,EAAAxB,GAAA,GAGA,IAAA+C,EAAA/C,EAAAA,EAAAkB,EAAAA,EACA,OAAA,GAAA6B,EACA,IAAAf,EACAhC,EAAA+C,GACA7B,EAAA6B,GAAAqB,OACA,IAAApC,EACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,GAAAA,EAAA,EAAA,GAAAkD,QAQAG,KAAA,WAIA,IAAAvE,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAA,IAAAxC,GAAA,IAAAkB,EACA,OAAA,IAAAc,EAAA,EAAAqC,EAAAA,GAGA,IAAAtB,EAAA/C,EAAAA,EAAAkB,EAAAA,EACA,OAAA,GAAA6B,EACA,IAAAf,EACAhC,EAAA+C,GACA7B,EAAA6B,GAAAoB,OACA,IAAAnC,EACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,GAAAA,EAAA,EAAA,GAAAiD,QAQAK,KAAA,WAIA,IAAAxE,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAA,IAAAxC,GAAA,IAAAkB,EACA,OAAA,IAAAc,EAAApB,KAAA2C,GAAA,EAAAc,EAAAA,GAGA,IAAAtB,EAAA/C,EAAAA,EAAAkB,EAAAA,EACA,OAAA,GAAA6B,EACA,IAAAf,EACAhC,EAAA+C,GACA7B,EAAA6B,GAAAiB,OACA,IAAAhC,EACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,GAAAA,EAAA,EAAA,GAAA8C,QAQAlD,KAAA,WAIA,IAAAd,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,OAAA,IAAAR,EACAlB,EAAAd,GAAAY,KAAAW,IAAAL,GACAR,EAAAV,GAAAY,KAAAqB,IAAAf,KAQAR,KAAA,WAIA,IAAAV,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,OAAA,IAAAR,EACAtB,EAAAV,GAAAY,KAAAW,IAAAL,GACAJ,EAAAd,GAAAY,KAAAqB,IAAAf,KAQAuD,KAAA,WAIA,IAAAzE,EAAA,EAAAwC,KAAA,GACAtB,EAAA,EAAAsB,KAAA,GACAO,EAAArC,EAAAV,GAAAY,KAAAW,IAAAL,GAEA,OAAA,IAAAc,EACAlB,EAAAd,GAAA+C,EACAnC,KAAAqB,IAAAf,GAAA6B,IAQA2B,KAAA,WAIA,IAAA1E,EAAA,EAAAwC,KAAA,GACAtB,EAAA,EAAAsB,KAAA,GACAO,EAAArC,EAAAV,GAAAY,KAAAW,IAAAL,GAEA,OAAA,IAAAc,EACAlB,EAAAd,GAAA+C,GACAnC,KAAAqB,IAAAf,GAAA6B,IAQA4B,KAAA,WAIA,IAAA3E,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GACAO,EAAAnC,KAAAW,IAAA,EAAAL,GAAAR,EAAA,EAAAV,GAEA,OAAA,IAAAgC,GACA,EAAAlB,EAAAd,GAAAY,KAAAW,IAAAL,GAAA6B,EACA,EAAArC,EAAAV,GAAAY,KAAAqB,IAAAf,GAAA6B,IAQA6B,KAAA,WAIA,IAAA5E,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GACAO,EAAAnC,KAAAW,IAAA,EAAAL,GAAAR,EAAA,EAAAV,GAEA,OAAA,IAAAgC,EACA,EAAAtB,EAAAV,GAAAY,KAAAW,IAAAL,GAAA6B,GACA,EAAAjC,EAAAd,GAAAY,KAAAqB,IAAAf,GAAA6B,IAQA8B,MAAA,WAIA,IAAAzB,EAAAZ,KAAA,GACAA,KAAA,IAAAA,KAAA,GACAA,KAAA,GAAAY,EACA,IAAA0B,EAAAtC,KAAA,OAQA,OANAA,KAAA,IAAAA,KAAA,GACAA,KAAA,GAAAY,EACAA,EAAA0B,EAAA,GAEAA,EAAA,IAAAA,EAAA,GACAA,EAAA,GAAA1B,EACA0B,GAQAC,MAAA,WAIA,IAAAD,EAAAtC,KAAA,OACA,GAAAsC,EAAA,IAAA,EAAA,CACA,IAAA1B,EAAA0B,EAAA,GACAA,EAAA,IAAAA,EAAA,GACAA,EAAA,GAAA1B,MACA,CACAA,EAAA0B,EAAA,GACAA,EAAA,IAAAA,EAAA,GACAA,EAAA,GAAA1B,EAEA,OAAA0B,GAQAE,MAAA,WAIA,IAAAhF,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEAyC,EAAA,EAAAjF,GAAA,IAAAkB,EACAgE,EAAA,EAAAlF,EACAmF,EAAA,EAAAnF,EACA+C,EAAAmC,EAAAA,EAAAhE,EAAAA,EAEAP,EAAA,GAAAoC,EACA,IAAAf,GACAmD,EAAAD,EAAAhE,EAAAA,GAAA6B,GACA7B,EAAAgE,EAAAC,EAAAjE,GAAA6B,GACA,IAAAf,GACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,EAAAA,EAAA,EAAA,GAEAkE,EAAAzE,EAAA,GAMA,OALAA,EAAA,GAAAM,EAAAN,EAAA,GAAAA,EAAA,IAAA,EACAA,EAAA,GAAAC,KAAAY,MAAAb,EAAA,GAAAyE,GAAA,EACAH,IACAtE,EAAA,IAAAA,EAAA,IAEAA,GAQA0E,MAAA,WAIA,IAAArF,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAA,IAAAxC,GAAA,IAAAkB,EACA,OAAA,IAAAc,EAAA,EAAApB,KAAA2C,GAAA,GAGA,IAAAR,EAAA/C,EAAAA,EAAAkB,EAAAA,EACA,OAAA,GAAA6B,EACA,IAAAf,EACAhC,EAAA+C,GACA7B,EAAA6B,GAAAiC,QACA,IAAAhD,EACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,GAAAA,EAAA,EAAA,GAAA8D,SAQAM,MAAA,WAIA,IAAAtF,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAA,IAAAtB,EAEA,OAAA,IAAAc,EACA,IAAAhC,EACAY,KAAAU,IAAAtB,EAAAY,KAAAuC,KAAAnD,EAAAA,EAAA,IACAqE,EAAAA,EAAA,GAGA,IAAAtB,EAAA/C,EAAAA,EAAAkB,EAAAA,EACA,OAAA,GAAA6B,EACA,IAAAf,EACAhC,EAAA+C,GACA7B,EAAA6B,GAAA8B,QACA,IAAA7C,EACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,GAAAA,EAAA,EAAA,GAAA2D,SAQAU,MAAA,WAIA,IAAAvF,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEA,GAAAA,KAAA,SACA,OAAAR,EAAA,SAGA,IAAAe,EAAA/C,EAAAA,EAAAkB,EAAAA,EACA,OAAA,GAAA6B,EACA,IAAAf,EACAhC,EAAA+C,GACA7B,EAAA6B,GAAAgC,QACA,IAAA/C,EACA,IAAAhC,EAAAA,EAAA,EAAA,EACA,IAAAkB,GAAAA,EAAA,EAAA,GAAA6D,SAQAS,QAAA,WAGA,GAAAhD,KAAA,SACA,OAAAR,EAAA,SAGA,GAAAQ,KAAA,aACA,OAAAR,EAAA,KAGA,IAAAhC,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GAEAO,EAAA/C,EAAAA,EAAAkB,EAAAA,EAEA,OAAA,IAAAc,EAAAhC,EAAA+C,GAAA7B,EAAA6B,IAQA0C,UAAA,WAEA,OAAA,IAAAzD,EAAAQ,KAAA,IAAAA,KAAA,KAQAkD,IAAA,WAEA,OAAA,IAAA1D,GAAAQ,KAAA,IAAAA,KAAA,KAQAmD,KAAA,SAAAC,GAIA,OAFAA,EAAAhF,KAAAoC,IAAA,GAAA4C,GAAA,GAEA,IAAA5D,EACApB,KAAA+E,KAAAnD,KAAA,GAAAoD,GAAAA,EACAhF,KAAA+E,KAAAnD,KAAA,GAAAoD,GAAAA,IAQAC,MAAA,SAAAD,GAIA,OAFAA,EAAAhF,KAAAoC,IAAA,GAAA4C,GAAA,GAEA,IAAA5D,EACApB,KAAAiF,MAAArD,KAAA,GAAAoD,GAAAA,EACAhF,KAAAiF,MAAArD,KAAA,GAAAoD,GAAAA,IAQAE,MAAA,SAAAF,GAIA,OAFAA,EAAAhF,KAAAoC,IAAA,GAAA4C,GAAA,GAEA,IAAA5D,EACApB,KAAAkF,MAAAtD,KAAA,GAAAoD,GAAAA,EACAhF,KAAAkF,MAAAtD,KAAA,GAAAoD,GAAAA,IAUAG,OAAA,SAAA/F,EAAAkB,GAEA,IAAAQ,EAAA,IAAAM,EAAAhC,EAAAkB,GAEA,OAAAN,KAAAQ,IAAAM,EAAA,GAAAc,KAAA,KAAAR,EAAA,SACApB,KAAAQ,IAAAM,EAAA,GAAAc,KAAA,KAAAR,EAAA,SAQAgE,MAAA,WAEA,OAAA,IAAAhE,EAAAQ,KAAA,GAAAA,KAAA,KAQAyD,SAAA,WAEA,IAAAjG,EAAAwC,KAAA,GACAtB,EAAAsB,KAAA,GACA0D,EAAA,GAEA,OAAA1D,KAAA,QACA,MAGAA,KAAA,SACA,IAGAA,KAAA,aACA,YAGA,IAAAxC,IACAkG,GAAAlG,GAGA,IAAAkB,IAEA,IAAAlB,EACAkG,GAAAhF,EAAA,EAAA,MAAA,MACAA,EAAA,IACAgF,GAAA,KAKA,KAFAhF,EAAAN,KAAAQ,IAAAF,MAGAgF,GAAAhF,GAEAgF,GAAA,KAGAA,GACA,MAUAC,SAAA,WAEA,MAAA,CAAA3D,KAAA,GAAAA,KAAA,KAQA4D,QAAA,WAEA,OAAA,IAAA5D,KAAA,GACAA,KAAA,GAEA,MAQAF,MAAA,WACA,OAAAA,MAAAE,KAAA,KAAAF,MAAAE,KAAA,KASA6D,OAAA,WACA,QACA,IAAA7D,KAAA,KAAA,IAAAA,KAAA,IACA,IAAAA,KAAA,KAAA,IAAAA,KAAA,KAUAT,SAAA,WACA,OAAAA,SAAAS,KAAA,KAAAT,SAAAS,KAAA,KASA8D,WAAA,WACA,QAAA9D,KAAA,SAAAA,KAAA,cAIAR,EAAA,KAAA,IAAAA,EAAA,EAAA,GACAA,EAAA,IAAA,IAAAA,EAAA,EAAA,GACAA,EAAA,EAAA,IAAAA,EAAA,EAAA,GACAA,EAAA,GAAA,IAAAA,EAAApB,KAAA2C,GAAA,GACAvB,EAAA,EAAA,IAAAA,EAAApB,KAAA2F,EAAA,GACAvE,EAAA,SAAA,IAAAA,EAAAqC,EAAAA,EAAAA,EAAAA,GACArC,EAAA,IAAA,IAAAA,EAAAwE,IAAAA,KACAxE,EAAA,QAAA,MAEA,mBAAAyE,QAAAA,OAAA,IACAA,OAAA,GAAA,WACA,OAAAzE,IAEA,iBAAA5B,GACAsG,OAAAC,eAAAvG,EAAA,aAAA,CAAAwG,OAAA,KACA5E,EAAA,QAAAA,GACA,QAAAA,EACAxB,EAAA,QAAAwB,GAEAvB,EAAA,QAAAuB,EAr1CA,CAw1CAQ,gCC33CA,SAAAqE,GACA,aAiBA,IAkFAC,EAAAC,EAAAC,EAAAC,EAlFAC,EAAA,KAIAC,EAAA,IAGAC,EAAA,mBAGAC,EAAA,qgCAGA9D,EAAA,qgCAIA+D,EAAA,CAOAC,UAAA,GAiBAC,SAAA,EAeAC,OAAA,EAIAC,UAAA,EAIAC,SAAA,GAIAC,MAAAV,EAIAW,KAAAX,EAGAY,QAAA,GAQAC,GAAA,EAEAC,EAAA,kBACAC,EAAAD,EAAA,qBACAE,EAAAF,EAAA,2BACAG,EAAAH,EAAA,qBAEAI,EAAAxH,KAAAiF,MACAwC,EAAAzH,KAAAoC,IAEAsF,EAAA,6CACAC,EAAA,yDACAC,EAAA,gDACAC,EAAA,qCAEAC,EAAA,IACAC,EAAA,EAGAC,EAAAvB,EAAA/G,OAAA,EACAuI,EAAAtF,EAAAjD,OAAA,EAGAwI,EAAA,CAAAC,KAAA,oBAi1EA,SAAAC,EAAAjG,GACA,IAAAnD,EAAAqJ,EAAAC,EACAC,EAAApG,EAAAzC,OAAA,EACA8I,EAAA,GACAC,EAAAtG,EAAA,GAEA,GAAA,EAAAoG,EAAA,CAEA,IADAC,GAAAC,EACAzJ,EAAA,EAAAA,EAAAuJ,EAAAvJ,IACAsJ,EAAAnG,EAAAnD,GAAA,IACAqJ,EAAAN,EAAAO,EAAA5I,UACA8I,GAAAE,EAAAL,IACAG,GAAAF,EAGAG,EAAAtG,EAAAnD,IAEAqJ,EAAAN,GADAO,EAAAG,EAAA,IACA/I,UACA8I,GAAAE,EAAAL,SACA,GAAA,IAAAI,EACA,MAAA,IAIA,KAAAA,EAAA,IAAA,GAAAA,GAAA,GAEA,OAAAD,EAAAC,EAIA,SAAAE,EAAA3J,EAAA4J,EAAAC,GACA,GAAA7J,MAAAA,GAAAA,EAAA4J,GAAAC,EAAA7J,EACA,MAAAK,MAAAgI,EAAArI,GAUA,SAAA8J,EAAA3G,EAAAnD,EAAA+J,EAAAC,GACA,IAAAC,EAAAZ,EAAAa,EAGA,IAAAb,EAAAlG,EAAA,GAAA,IAAAkG,EAAAA,GAAA,KAAArJ,EAwCA,QArCAA,EAAA,GACAA,GAAA+I,EACAkB,EAAA,IAEAA,EAAAjJ,KAAA+E,MAAA/F,EAAA,GAAA+I,GACA/I,GAAA+I,GAMAM,EAAAZ,EAAA,GAAAM,EAAA/I,GACAkK,EAAA/G,EAAA8G,GAAAZ,EAAA,EAEA,MAAAW,EACAhK,EAAA,GACA,GAAAA,EAAAkK,EAAAA,EAAA,IAAA,EACA,GAAAlK,IAAAkK,EAAAA,EAAA,GAAA,GACAH,EAAA,GAAA,OAAAG,GAAA,EAAAH,GAAA,OAAAG,GAAA,KAAAA,GAAA,GAAAA,IAEAH,EAAA,GAAAG,EAAA,GAAAb,GAAA,EAAAU,GAAAG,EAAA,GAAAb,EAAA,KACAlG,EAAA8G,EAAA,GAAAZ,EAAA,IAAA,IAAAZ,EAAA,GAAAzI,EAAA,GAAA,IACAkK,GAAAb,EAAA,GAAA,GAAAa,IAAA,IAAA/G,EAAA8G,EAAA,GAAAZ,EAAA,IAAA,GAGArJ,EAAA,GACA,GAAAA,EAAAkK,EAAAA,EAAA,IAAA,EACA,GAAAlK,EAAAkK,EAAAA,EAAA,IAAA,EACA,GAAAlK,IAAAkK,EAAAA,EAAA,GAAA,IACAF,GAAAD,EAAA,IAAA,MAAAG,IAAAF,GAAA,EAAAD,GAAA,MAAAG,KAEAF,GAAAD,EAAA,IAAAG,EAAA,GAAAb,IACAW,GAAA,EAAAD,GAAAG,EAAA,GAAAb,EAAA,KACAlG,EAAA8G,EAAA,GAAAZ,EAAA,IAAA,IAAAZ,EAAA,GAAAzI,EAAA,GAAA,EAWA,SAAAmK,EAAAX,EAAAY,EAAAC,GAOA,IANA,IAAAC,EAEAC,EADAC,EAAA,CAAA,GAEAxK,EAAA,EACAyK,EAAAjB,EAAA9I,OAEAV,EAAAyK,GAAA,CACA,IAAAF,EAAAC,EAAA9J,OAAA6J,KAAAC,EAAAD,IAAAH,EAEA,IADAI,EAAA,IAAAhD,EAAAkD,QAAAlB,EAAAmB,OAAA3K,MACAsK,EAAA,EAAAA,EAAAE,EAAA9J,OAAA4J,IACAE,EAAAF,GAAAD,EAAA,SACA,IAAAG,EAAAF,EAAA,KAAAE,EAAAF,EAAA,GAAA,GACAE,EAAAF,EAAA,IAAAE,EAAAF,GAAAD,EAAA,EACAG,EAAAF,IAAAD,GAKA,OAAAG,EAAAI,UAx3EA1B,EAAA2B,cAAA3B,EAAA1H,IAAA,WACA,IAAAT,EAAA,IAAA6B,KAAAkI,YAAAlI,MAEA,OADA7B,EAAAgK,EAAA,IAAAhK,EAAAgK,EAAA,GACAC,EAAAjK,IASAmI,EAAAnD,KAAA,WACA,OAAAiF,EAAA,IAAApI,KAAAkI,YAAAlI,MAAAA,KAAAhD,EAAA,EAAA,IAYAsJ,EAAA+B,WAAA/B,EAAAgC,IAAA,SAAApH,GACA,IAAA9D,EAAAsK,EAAAa,EAAAC,EACArK,EAAA6B,KACAyI,EAAAtK,EAAAoC,EACAmI,GAAAxH,EAAA,IAAA/C,EAAA+J,YAAAhH,IAAAX,EACAoI,EAAAxK,EAAAgK,EACAS,EAAA1H,EAAAiH,EAGA,IAAAM,IAAAC,EACA,OAAAC,GAAAC,EAAAD,IAAAC,EAAAD,EAAAF,IAAAC,EAAA,GAAAD,EAAAE,EAAA,EAAA,GAAA,EAAA3E,IAIA,IAAAyE,EAAA,KAAAC,EAAA,GAAA,OAAAD,EAAA,GAAAE,EAAAD,EAAA,IAAAE,EAAA,EAGA,GAAAD,IAAAC,EAAA,OAAAD,EAGA,GAAAxK,EAAAnB,IAAAkE,EAAAlE,EAAA,OAAAmB,EAAAnB,EAAAkE,EAAAlE,EAAA2L,EAAA,EAAA,GAAA,EAMA,IAAAvL,EAAA,EAAAsK,GAJAa,EAAAE,EAAA3K,SACA0K,EAAAE,EAAA5K,QAGAyK,EAAAC,EAAApL,EAAAsK,IAAAtK,EACA,GAAAqL,EAAArL,KAAAsL,EAAAtL,GAAA,OAAAqL,EAAArL,GAAAsL,EAAAtL,GAAAuL,EAAA,EAAA,GAAA,EAIA,OAAAJ,IAAAC,EAAA,EAAAA,EAAAD,EAAAI,EAAA,EAAA,GAAA,GAiBArC,EAAAuC,OAAAvC,EAAAvH,IAAA,WACA,IAAA+J,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAoC,EAGApC,EAAAoC,EAAA,IAEAuI,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA1K,KAAA6I,IAAA9I,EAAAnB,EAAAmB,EAAA6K,MAAA7C,EACA4C,EAAA/D,SAAA,EAEA7G,EAyyEA,SAAA4K,EAAA5K,GACA,IAAAsI,EAAAvF,EACA+H,EAAA9K,EAAAoC,EAAAzC,OAQAoD,EAFA+H,EAAA,IACAxC,EAAArI,KAAA+E,KAAA8F,EAAA,GACA7K,KAAAoC,IAAA,GAAAiG,GAAAhD,aAEAgD,EAAA,GACA,gCAGAsC,EAAAhE,WAAA0B,EAEAtI,EAAA+K,EAAAH,EAAA,EAAA5K,EAAAgL,MAAAjI,GAAA,IAAA6H,EAAA,IAGA,IAAA,IAAA3L,EAAAqJ,EAAArJ,KAAA,CACA,IAAAgM,EAAAjL,EAAAgL,MAAAhL,GACAA,EAAAiL,EAAAD,MAAAC,GAAAvJ,MAAAuJ,GAAAD,MAAA,GAAAvJ,KAAA,GAKA,OAFAmJ,EAAAhE,WAAA0B,EAEAtI,EAr0EA0K,CAAAE,EAAAM,EAAAN,EAAA5K,IAEA4K,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAiB,EAAA,GAAA3D,GAAA,GAAAA,EAAAtG,EAAA+E,MAAA/E,EAAA2K,EAAA3B,GAAA,IAZA,IAAA4B,EAAA,GAHA,IAAAA,EAAA/E,MAmCAsC,EAAAgD,SAAAhD,EAAAiD,KAAA,WACA,IAAAvM,EAAAwM,EAAAvM,EAAAF,EAAA0M,EAAAtB,EAAAa,EAAA9L,EAAAwM,EAAAC,EACAxL,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,IAAA/J,EAAAoB,YAAApB,EAAA0F,SAAA,OAAA,IAAAkF,EAAA5K,GAoCA,IAnCAoH,GAAA,GAGA4C,EAAAhK,EAAAgK,EAAA/J,KAAAoC,IAAArC,EAAAgK,EAAAhK,EAAA,EAAA,KAIAC,KAAAQ,IAAAuJ,IAAA,EAAA,EAqBApL,EAAA,IAAAgM,EAAAZ,EAAA1E,aApBAxG,EAAAuJ,EAAArI,EAAAoC,IAIA4H,IAHAnL,EAAAmB,EAAAnB,GAGAC,EAAAa,OAAA,GAAA,KAAAb,GAAA,GAAAkL,IAAA,GAAAA,EAAA,IAAA,MACAA,EAAA/J,KAAAoC,IAAAvD,EAAA,EAAA,GAGAD,EAAA4I,GAAA5I,EAAA,GAAA,IAAAA,EAAA,IAAAA,EAAA,GAAA,EAAA,KASAD,EAAA,IAAAgM,EANA9L,EADAkL,GAAA,EAAA,EACA,KAAAnL,GAEAC,EAAAkL,EAAAyB,iBACAC,MAAA,EAAA5M,EAAA6K,QAAA,KAAA,GAAA9K,IAIAmL,EAAAhK,EAAAgK,GAKAa,GAAAhM,EAAA+L,EAAAhE,WAAA,IAWA,GAJA4E,GADAD,GADAxM,EAAAH,GACAoM,MAAAjM,GAAAiM,MAAAjM,IACA0C,KAAAzB,GACApB,EAAA+M,EAAAH,EAAA/J,KAAAzB,GAAAgL,MAAAjM,GAAAyM,EAAA/J,KAAA8J,GAAAV,EAAA,EAAA,GAGAxC,EAAAtJ,EAAAqD,GAAAsJ,MAAA,EAAAb,MAAA/L,EAAAuJ,EAAAzJ,EAAAwD,IAAAsJ,MAAA,EAAAb,GAAA,CAKA,GAAA,SAJA/L,EAAAA,EAAA4M,MAAAb,EAAA,EAAAA,EAAA,MAIAS,GAAA,QAAAxM,GAeA,EAIAA,KAAAA,EAAA4M,MAAA,IAAA,KAAA5M,EAAA8K,OAAA,MAGAK,EAAArL,EAAAC,EAAA,EAAA,GACAwM,GAAAzM,EAAAoM,MAAApM,GAAAoM,MAAApM,GAAAgN,GAAA5L,IAGA,MAtBA,IAAAsL,IACArB,EAAAlL,EAAAF,EAAA,EAAA,GAEAE,EAAAiM,MAAAjM,GAAAiM,MAAAjM,GAAA6M,GAAA5L,IAAA,CACApB,EAAAG,EACA,MAIA8L,GAAA,EACAS,EAAA,EAmBA,OAFAlE,GAAA,EAEA6C,EAAArL,EAAAC,EAAA+L,EAAA/D,SAAAwE,IAQAlD,EAAA0D,cAAA1D,EAAA2D,GAAA,WACA,IAAApD,EACAtG,EAAAP,KAAAO,EACAtD,EAAA+G,IAEA,GAAAzD,EAAA,CAMA,GAJAtD,IADA4J,EAAAtG,EAAAzC,OAAA,GACA8H,EAAA5F,KAAAhD,EAAAmJ,IAAAA,EAGAU,EAAAtG,EAAAsG,GACA,KAAAA,EAAA,IAAA,EAAAA,GAAA,GAAA5J,IACAA,EAAA,IAAAA,EAAA,GAGA,OAAAA,GAyBAqJ,EAAA4D,UAAA5D,EAAAhG,IAAA,SAAAY,GACA,OAAA4I,EAAA9J,KAAA,IAAAA,KAAAkI,YAAAhH,KASAoF,EAAA6D,mBAAA7D,EAAA8D,SAAA,SAAAlJ,GACA,IACA6H,EADA/I,KACAkI,YACA,OAAAE,EAAA0B,EAFA9J,KAEA,IAAA+I,EAAA7H,GAAA,EAAA,EAAA,GAAA6H,EAAAhE,UAAAgE,EAAA/D,WAQAsB,EAAA/C,OAAA+C,EAAAyD,GAAA,SAAA7I,GACA,OAAA,IAAAlB,KAAAsI,IAAApH,IASAoF,EAAAjD,MAAA,WACA,OAAA+E,EAAA,IAAApI,KAAAkI,YAAAlI,MAAAA,KAAAhD,EAAA,EAAA,IASAsJ,EAAA+D,YAAA/D,EAAAgE,GAAA,SAAApJ,GACA,OAAA,EAAAlB,KAAAsI,IAAApH,IASAoF,EAAAiE,qBAAAjE,EAAAkE,IAAA,SAAAtJ,GACA,IAAAuF,EAAAzG,KAAAsI,IAAApH,GACA,OAAA,GAAAuF,GAAA,IAAAA,GA6BAH,EAAAmE,iBAAAnE,EAAApI,KAAA,WACA,IAAAuI,EAAAxJ,EAAA6L,EAAA3B,EAAA8B,EACA9K,EAAA6B,KACA+I,EAAA5K,EAAA+J,YACAwC,EAAA,IAAA3B,EAAA,GAEA,IAAA5K,EAAAoB,WAAA,OAAA,IAAAwJ,EAAA5K,EAAAgK,EAAA,EAAA,EAAAnE,KACA,GAAA7F,EAAA0F,SAAA,OAAA6G,EAEA5B,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA1K,KAAA6I,IAAA9I,EAAAnB,EAAAmB,EAAA6K,MAAA,EACAD,EAAA/D,SAAA,EAUA/H,GATAgM,EAAA9K,EAAAoC,EAAAzC,QAOA,IACA2I,EAAArI,KAAA+E,KAAA8F,EAAA,GACA7K,KAAAoC,IAAA,GAAAiG,GAAAhD,aAEAgD,EAAA,GACA,gCAGAtI,EAAA+K,EAAAH,EAAA,EAAA5K,EAAAgL,MAAAlM,GAAA,IAAA8L,EAAA,IAAA,GAMA,IAHA,IAAA4B,EACAvN,EAAAqJ,EACAmE,EAAA,IAAA7B,EAAA,GACA3L,KACAuN,EAAAxM,EAAAgL,MAAAhL,GACAA,EAAAuM,EAAA7K,MAAA8K,EAAAxB,MAAAyB,EAAA/K,MAAA8K,EAAAxB,MAAAyB,MAGA,OAAAxC,EAAAjK,EAAA4K,EAAAhE,UAAA+D,EAAAC,EAAA/D,SAAAmC,GAAA,IAkCAb,EAAAuE,eAAAvE,EAAAhI,KAAA,WACA,IAAAmI,EAAAqC,EAAA3B,EAAA8B,EACA9K,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,IAAA/J,EAAAoB,YAAApB,EAAA0F,SAAA,OAAA,IAAAkF,EAAA5K,GAQA,GANA2K,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA1K,KAAA6I,IAAA9I,EAAAnB,EAAAmB,EAAA6K,MAAA,EACAD,EAAA/D,SAAA,GACAiE,EAAA9K,EAAAoC,EAAAzC,QAEA,EACAK,EAAA+K,EAAAH,EAAA,EAAA5K,EAAAA,GAAA,OACA,CAYAsI,EAAA,IADAA,EAAA,IAAArI,KAAAuC,KAAAsI,IACA,GAAA,EAAAxC,EAIAtI,EAAA+K,EAAAH,EAAA,EAFA5K,EAAAA,EAAAgL,MAAA/K,KAAAoC,IAAA,GAAAiG,IAEAtI,GAAA,GAOA,IAJA,IAAA2M,EACAC,EAAA,IAAAhC,EAAA,GACAiC,EAAA,IAAAjC,EAAA,IACAkC,EAAA,IAAAlC,EAAA,IACAtC,KACAqE,EAAA3M,EAAAgL,MAAAhL,GACAA,EAAAA,EAAAgL,MAAA4B,EAAAnL,KAAAkL,EAAA3B,MAAA6B,EAAA7B,MAAA2B,GAAAlL,KAAAqL,MAOA,OAAA7C,EAAAjK,EAHA4K,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,GAEA,IAoBAb,EAAA4E,kBAAA5E,EAAArE,KAAA,WACA,IAAA6G,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAoB,WACApB,EAAA0F,SAAA,IAAAkF,EAAA5K,IAEA2K,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA,EACAC,EAAA/D,SAAA,EAEA8E,EAAA3L,EAAAG,OAAAH,EAAAD,OAAA6K,EAAAhE,UAAA+D,EAAAC,EAAA/D,SAAAmC,IARA,IAAA4B,EAAA5K,EAAAgK,IA+BA7B,EAAA6E,cAAA7E,EAAA3E,KAAA,WACA,IAAAyJ,EACAjN,EAAA6B,KACA+I,EAAA5K,EAAA+J,YACAzB,EAAAtI,EAAAS,MAAA0J,IAAA,GACAQ,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SAEA,OAAA,IAAAyB,EACA,IAAAA,EAEAtI,EAAAkN,QAAAC,EAAAvC,EAAAD,EAAA3B,GAAA,IAAA4B,EAAA,GAEA,IAAAA,EAAA/E,KAGA7F,EAAA0F,SAAAyH,EAAAvC,EAAAD,EAAA,EAAA3B,GAAAgC,MAAA,KAIAJ,EAAAhE,UAAA+D,EAAA,EACAC,EAAA/D,SAAA,EAEA7G,EAAAA,EAAAqD,OACA4J,EAAAE,EAAAvC,EAAAD,EAAA,EAAA3B,GAAAgC,MAAA,IAEAJ,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAiE,EAAAvL,MAAA1B,KAuBAmI,EAAAiF,wBAAAjF,EAAA/D,MAAA,WACA,IAAAuG,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAqN,IAAA,GAAA,IAAAzC,EAAA5K,EAAA4L,GAAA,GAAA,EAAA/F,KACA7F,EAAAoB,YAEAuJ,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA1K,KAAA6I,IAAA7I,KAAAQ,IAAAT,EAAAnB,GAAAmB,EAAA6K,MAAA,EACAD,EAAA/D,SAAA,EACAO,GAAA,EAEApH,EAAAA,EAAAgL,MAAAhL,GAAA0B,MAAA,GAAAc,OAAAf,KAAAzB,GAEAoH,GAAA,EACAwD,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAhJ,EAAAsN,MAdA,IAAA1C,EAAA5K,IAkCAmI,EAAAoF,sBAAApF,EAAAjE,MAAA,WACA,IAAAyG,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAoB,YAAApB,EAAA0F,SAAA,IAAAkF,EAAA5K,IAEA2K,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA,EAAA1K,KAAA6I,IAAA7I,KAAAQ,IAAAT,EAAAnB,GAAAmB,EAAA6K,MAAA,EACAD,EAAA/D,SAAA,EACAO,GAAA,EAEApH,EAAAA,EAAAgL,MAAAhL,GAAAyB,KAAA,GAAAe,OAAAf,KAAAzB,GAEAoH,GAAA,EACAwD,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAhJ,EAAAsN,OAuBAnF,EAAAqF,yBAAArF,EAAA9D,MAAA,WACA,IAAAsG,EAAA3B,EAAAyE,EAAAC,EACA1N,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAoB,WACA,GAAApB,EAAAnB,EAAA,IAAA+L,EAAA5K,EAAAS,MAAAmL,GAAA,GAAA5L,EAAAgK,EAAA,EAAAhK,EAAA0F,SAAA1F,EAAA6F,MAEA8E,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA6G,EAAA1N,EAAA6K,KAEA5K,KAAA6I,IAAA4E,EAAA/C,GAAA,GAAA3K,EAAAnB,EAAA,EAAAoL,EAAA,IAAAW,EAAA5K,GAAA2K,EAAA3B,GAAA,IAEA4B,EAAAhE,UAAA6G,EAAAC,EAAA1N,EAAAnB,EAEAmB,EAAA2L,EAAA3L,EAAAyB,KAAA,GAAA,IAAAmJ,EAAA,GAAAlJ,MAAA1B,GAAAyN,EAAA9C,EAAA,GAEAC,EAAAhE,UAAA+D,EAAA,EACAC,EAAA/D,SAAA,EAEA7G,EAAAA,EAAAsN,KAEA1C,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAhJ,EAAAgL,MAAA,MArBA,IAAAJ,EAAA/E,MA8CAsC,EAAAwF,YAAAxF,EAAA9E,KAAA,WACA,IAAA4J,EAAA3E,EACAqC,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAA0F,SAAA,IAAAkF,EAAA5K,IAEAsI,EAAAtI,EAAAS,MAAA0J,IAAA,GACAQ,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,UAEA,IAAAyB,EAGA,IAAAA,IACA2E,EAAAE,EAAAvC,EAAAD,EAAA,EAAA3B,GAAAgC,MAAA,KACAhB,EAAAhK,EAAAgK,EACAiD,GAIA,IAAArC,EAAA/E,MAKA+E,EAAAhE,UAAA+D,EAAA,EACAC,EAAA/D,SAAA,EAEA7G,EAAAA,EAAAmC,IAAA,IAAAyI,EAAA,GAAAlJ,MAAA1B,EAAAgL,MAAAhL,IAAAwC,OAAAf,KAAA,IAAAgC,OAEAmH,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAhJ,EAAAgL,MAAA,MAsBA7C,EAAAyF,eAAAzF,EAAA1E,KAAA,WACA,IAAAxE,EAAAsK,EAAAjB,EAAAxJ,EAAA+O,EAAA9O,EAAAH,EAAA6O,EAAAK,EACA9N,EAAA6B,KACA+I,EAAA5K,EAAA+J,YACAY,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SAEA,GAAA7G,EAAAoB,WAOA,CAAA,GAAApB,EAAA0F,SACA,OAAA,IAAAkF,EAAA5K,GACA,GAAAA,EAAAS,MAAAmL,GAAA,IAAAjB,EAAA,GAAAzC,EAGA,OAFAtJ,EAAAuO,EAAAvC,EAAAD,EAAA,EAAA3B,GAAAgC,MAAA,MACAhB,EAAAhK,EAAAgK,EACApL,MAZA,CACA,IAAAoB,EAAAgK,EAAA,OAAA,IAAAY,EAAA/E,KACA,GAAA8E,EAAA,GAAAzC,EAGA,OAFAtJ,EAAAuO,EAAAvC,EAAAD,EAAA,EAAA3B,GAAAgC,MAAA,KACAhB,EAAAhK,EAAAgK,EACApL,EAqBA,IAXAgM,EAAAhE,UAAA6G,EAAA9C,EAAA,GACAC,EAAA/D,SAAA,EAUA5H,EAFAqJ,EAAArI,KAAA4I,IAAA,GAAA4E,EAAAzF,EAAA,EAAA,GAEA/I,IAAAA,EAAAe,EAAAA,EAAAmC,IAAAnC,EAAAgL,MAAAhL,GAAAyB,KAAA,GAAAe,OAAAf,KAAA,IAWA,IATA2F,GAAA,EAEAmC,EAAAtJ,KAAA+E,KAAAyI,EAAAzF,GACAlJ,EAAA,EACAgP,EAAA9N,EAAAgL,MAAAhL,GACApB,EAAA,IAAAgM,EAAA5K,GACA6N,EAAA7N,GAGA,IAAAf,GAOA,GANA4O,EAAAA,EAAA7C,MAAA8C,GACA/O,EAAAH,EAAA8C,MAAAmM,EAAA1L,IAAArD,GAAA,IAEA+O,EAAAA,EAAA7C,MAAA8C,QAGA,KAFAlP,EAAAG,EAAA0C,KAAAoM,EAAA1L,IAAArD,GAAA,KAEAsD,EAAAmH,GAAA,IAAAtK,EAAAsK,EAAA3K,EAAAwD,EAAAnD,KAAAF,EAAAqD,EAAAnD,IAAAA,MAOA,OAJAqJ,IAAA1J,EAAAA,EAAAoM,MAAA,GAAA1C,EAAA,IAEAlB,GAAA,EAEA6C,EAAArL,EAAAgM,EAAAhE,UAAA+D,EAAAC,EAAA/D,SAAAmC,GAAA,IAQAb,EAAA/G,SAAA,WACA,QAAAS,KAAAO,GAQA+F,EAAA4F,UAAA5F,EAAA6F,MAAA,WACA,QAAAnM,KAAAO,GAAAqF,EAAA5F,KAAAhD,EAAAmJ,GAAAnG,KAAAO,EAAAzC,OAAA,GAQAwI,EAAAxG,MAAA,WACA,OAAAE,KAAAmI,GAQA7B,EAAA8F,WAAA9F,EAAA+E,MAAA,WACA,OAAArL,KAAAmI,EAAA,GAQA7B,EAAA+F,WAAA/F,EAAAgG,MAAA,WACA,OAAA,EAAAtM,KAAAmI,GAQA7B,EAAAzC,OAAA,WACA,QAAA7D,KAAAO,GAAA,IAAAP,KAAAO,EAAA,IAQA+F,EAAAiG,SAAAjG,EAAAkG,GAAA,SAAAtL,GACA,OAAAlB,KAAAsI,IAAApH,GAAA,GAQAoF,EAAAmG,kBAAAnG,EAAAkF,IAAA,SAAAtK,GACA,OAAAlB,KAAAsI,IAAApH,GAAA,GAkCAoF,EAAAoG,UAAApG,EAAAxH,IAAA,SAAA6N,GACA,IAAAC,EAAArM,EAAAsM,EAAApG,EAAAqG,EAAAC,EAAA/D,EAAAjM,EACA0D,EAAAT,KACA+I,EAAAtI,EAAAyH,YACAY,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SAIA,GAAA,MAAA2H,EACAA,EAAA,IAAA5D,EAAA,IACA6D,GAAA,MACA,CAKA,GAHArM,GADAoM,EAAA,IAAA5D,EAAA4D,IACApM,EAGAoM,EAAAxE,EAAA,IAAA5H,IAAAA,EAAA,IAAAoM,EAAA5C,GAAA,GAAA,OAAA,IAAAhB,EAAA/E,KAEA4I,EAAAD,EAAA5C,GAAA,IAMA,GAHAxJ,EAAAE,EAAAF,EAGAE,EAAA0H,EAAA,IAAA5H,IAAAA,EAAA,IAAAE,EAAAsJ,GAAA,GACA,OAAA,IAAAhB,EAAAxI,IAAAA,EAAA,IAAA,EAAA,EAAA,GAAAE,EAAA0H,EAAAnE,IAAAzD,EAAA,EAAA,EAAA,GAKA,GAAAqM,EACA,GAAA,EAAArM,EAAAzC,OACAgP,GAAA,MACA,CACA,IAAArG,EAAAlG,EAAA,GAAAkG,EAAA,IAAA,GAAAA,GAAA,GACAqG,EAAA,IAAArG,EA0BA,GAtBAlB,GAAA,EAEAwH,EAAAC,EAAAvM,EADAuI,EAAAF,EAnCA,GAqCA+D,EAAAD,EAAAK,EAAAlE,EAAAC,EAAA,IAAAgE,EAAAL,EAAA3D,GAmBA9B,GAhBAnK,EAAA+M,EAAAiD,EAAAF,EAAA7D,EAAA,IAgBAzI,EAAAkG,EAAAqC,EAAA3B,GAEA,GAMA,GAJA4F,EAAAC,EAAAvM,EADAuI,GAAA,IAEA6D,EAAAD,EAAAK,EAAAlE,EAAAC,EAAA,IAAAgE,EAAAL,EAAA3D,GACAjM,EAAA+M,EAAAiD,EAAAF,EAAA7D,EAAA,IAEA8D,EAAA,EAGAtG,EAAAzJ,EAAAwD,GAAAsJ,MAAApD,EAAA,EAAAA,EAAA,IAAA,GAAA,OACA1J,EAAAqL,EAAArL,EAAA+L,EAAA,EAAA,IAGA,aAEA5B,EAAAnK,EAAAwD,EAAAkG,GAAA,GAAAU,IAKA,OAFA5B,GAAA,EAEA6C,EAAArL,EAAA+L,EAAA3B,IAiDAb,EAAAzG,MAAAyG,EAAAlG,IAAA,SAAAc,GACA,IAAAX,EAAAvD,EAAAI,EAAAsK,EAAAjB,EAAAwC,EAAAH,EAAA3B,EAAAsB,EAAAyE,EAAAC,EAAAzE,EACAvK,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAKA,GAHAhH,EAAA,IAAA6H,EAAA7H,IAGA/C,EAAAoC,IAAAW,EAAAX,EAaA,OAVApC,EAAAgK,GAAAjH,EAAAiH,EAGAhK,EAAAoC,EAAAW,EAAAiH,GAAAjH,EAAAiH,EAKAjH,EAAA,IAAA6H,EAAA7H,EAAAX,GAAApC,EAAAgK,IAAAjH,EAAAiH,EAAAhK,EAAA6F,KARA9C,EAAA,IAAA6H,EAAA/E,KAUA9C,EAIA,GAAA/C,EAAAgK,GAAAjH,EAAAiH,EAEA,OADAjH,EAAAiH,GAAAjH,EAAAiH,EACAhK,EAAAyB,KAAAsB,GASA,GANAuH,EAAAtK,EAAAoC,EACAmI,EAAAxH,EAAAX,EACAuI,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,UAGAyD,EAAA,KAAAC,EAAA,GAAA,CAGA,GAAAA,EAAA,GAAAxH,EAAAiH,GAAAjH,EAAAiH,MAGA,CAAA,IAAAM,EAAA,GAIA,OAAA,IAAAM,EAAA,IAAA5B,GAAA,EAAA,GAJAjG,EAAA,IAAA6H,EAAA5K,GAMA,OAAAoH,EAAA6C,EAAAlH,EAAA4H,EAAA3B,GAAAjG,EAaA,GAPAlE,EAAA4I,EAAA1E,EAAAlE,EAAAmJ,GACA+G,EAAAtH,EAAAzH,EAAAnB,EAAAmJ,GAEAsC,EAAAA,EAAAoB,QACApD,EAAAyG,EAAAlQ,EAGA,CAyBA,IAnBAiM,GALAkE,EAAA1G,EAAA,IAGAlG,EAAAkI,EACAhC,GAAAA,EACAiC,EAAA5K,SAEAyC,EAAAmI,EACA1L,EAAAkQ,EACAzE,EAAA3K,SAMAV,EAAAgB,KAAA6I,IAAA7I,KAAA+E,KAAA2F,EAAA3C,GAAA8C,GAAA,GAEAxC,IACAA,EAAArJ,EACAmD,EAAAzC,OAAA,GAIAyC,EAAAyH,UACA5K,EAAAqJ,EAAArJ,KAAAmD,EAAA6M,KAAA,GACA7M,EAAAyH,cAGA,CASA,KAHAmF,GAFA/P,EAAAqL,EAAA3K,SACAmL,EAAAP,EAAA5K,WAEAmL,EAAA7L,GAEAA,EAAA,EAAAA,EAAA6L,EAAA7L,IACA,GAAAqL,EAAArL,IAAAsL,EAAAtL,GAAA,CACA+P,EAAA1E,EAAArL,GAAAsL,EAAAtL,GACA,MAIAqJ,EAAA,EAcA,IAXA0G,IACA5M,EAAAkI,EACAA,EAAAC,EACAA,EAAAnI,EACAW,EAAAiH,GAAAjH,EAAAiH,GAGAc,EAAAR,EAAA3K,OAIAV,EAAAsL,EAAA5K,OAAAmL,EAAA,EAAA7L,IAAAA,EAAAqL,EAAAQ,KAAA,EAGA,IAAA7L,EAAAsL,EAAA5K,OAAA2I,EAAArJ,GAAA,CAEA,GAAAqL,IAAArL,GAAAsL,EAAAtL,GAAA,CACA,IAAAsK,EAAAtK,EAAAsK,GAAA,IAAAe,IAAAf,IAAAe,EAAAf,GAAAxB,EAAA,IACAuC,EAAAf,GACAe,EAAArL,IAAA8I,EAGAuC,EAAArL,IAAAsL,EAAAtL,GAIA,KAAA,IAAAqL,IAAAQ,IAAAR,EAAA4E,MAGA,KAAA,IAAA5E,EAAA,GAAAA,EAAA6E,UAAAtQ,EAGA,OAAAyL,EAAA,IAEAvH,EAAAX,EAAAkI,EACAvH,EAAAlE,EAAAuQ,EAAA9E,EAAAzL,GAEAuI,EAAA6C,EAAAlH,EAAA4H,EAAA3B,GAAAjG,GALA,IAAA6H,EAAA,IAAA5B,GAAA,EAAA,IAiCAb,EAAArB,OAAAqB,EAAAkH,IAAA,SAAAtM,GACA,IAAAuM,EACAtP,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAKA,OAHAhH,EAAA,IAAA6H,EAAA7H,IAGA/C,EAAAoC,IAAAW,EAAAiH,GAAAjH,EAAAX,IAAAW,EAAAX,EAAA,GAAA,IAAAwI,EAAA/E,MAGA9C,EAAAX,GAAApC,EAAAoC,IAAApC,EAAAoC,EAAA,GACA6H,EAAA,IAAAW,EAAA5K,GAAA4K,EAAAhE,UAAAgE,EAAA/D,WAIAO,GAAA,EAEA,GAAAwD,EAAA9D,QAIAwI,EAAA3D,EAAA3L,EAAA+C,EAAAtC,MAAA,EAAA,EAAA,IACAuJ,GAAAjH,EAAAiH,EAEAsF,EAAA3D,EAAA3L,EAAA+C,EAAA,EAAA6H,EAAA9D,OAAA,GAGAwI,EAAAA,EAAAtE,MAAAjI,GAEAqE,GAAA,EAEApH,EAAA0B,MAAA4N,KAUAnH,EAAAoH,mBAAApH,EAAAjI,IAAA,WACA,OAAAqP,EAAA1N,OASAsG,EAAA0G,iBAAA1G,EAAAmF,GAAA,WACA,OAAAuB,EAAAhN,OASAsG,EAAAqH,QAAArH,EAAApD,IAAA,WACA,IAAA/E,EAAA,IAAA6B,KAAAkI,YAAAlI,MAEA,OADA7B,EAAAgK,GAAAhK,EAAAgK,EACAC,EAAAjK,IAyBAmI,EAAA1G,KAAA0G,EAAAnG,IAAA,SAAAe,GACA,IAAA0M,EAAArN,EAAAvD,EAAAI,EAAAqJ,EAAAwC,EAAAH,EAAA3B,EAAAsB,EAAAC,EACAvK,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAKA,GAHAhH,EAAA,IAAA6H,EAAA7H,IAGA/C,EAAAoC,IAAAW,EAAAX,EAWA,OARApC,EAAAgK,GAAAjH,EAAAiH,EAMAhK,EAAAoC,IAAAW,EAAA,IAAA6H,EAAA7H,EAAAX,GAAApC,EAAAgK,IAAAjH,EAAAiH,EAAAhK,EAAA6F,MANA9C,EAAA,IAAA6H,EAAA/E,KAQA9C,EAIA,GAAA/C,EAAAgK,GAAAjH,EAAAiH,EAEA,OADAjH,EAAAiH,GAAAjH,EAAAiH,EACAhK,EAAA0B,MAAAqB,GASA,GANAuH,EAAAtK,EAAAoC,EACAmI,EAAAxH,EAAAX,EACAuI,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,UAGAyD,EAAA,KAAAC,EAAA,GAMA,OAFAA,EAAA,KAAAxH,EAAA,IAAA6H,EAAA5K,IAEAoH,EAAA6C,EAAAlH,EAAA4H,EAAA3B,GAAAjG,EAaA,GAPAuF,EAAAb,EAAAzH,EAAAnB,EAAAmJ,GACAnJ,EAAA4I,EAAA1E,EAAAlE,EAAAmJ,GAEAsC,EAAAA,EAAAoB,QACAzM,EAAAqJ,EAAAzJ,EAGA,CAuBA,KATAiM,GATAA,EAHA7L,EAAA,GACAmD,EAAAkI,EACArL,GAAAA,EACAsL,EAAA5K,SAEAyC,EAAAmI,EACA1L,EAAAyJ,EACAgC,EAAA3K,UAIA2I,EAAArI,KAAA+E,KAAA2F,EAAA3C,IACAM,EAAA,EAAAwC,EAAA,GAEA7L,IACAA,EAAA6L,EACA1I,EAAAzC,OAAA,GAIAyC,EAAAyH,UACA5K,KAAAmD,EAAA6M,KAAA,GACA7M,EAAAyH,UAeA,KAZAiB,EAAAR,EAAA3K,SACAV,EAAAsL,EAAA5K,QAGA,IACAV,EAAA6L,EACA1I,EAAAmI,EACAA,EAAAD,EACAA,EAAAlI,GAIAqN,EAAA,EAAAxQ,GACAwQ,GAAAnF,IAAArL,GAAAqL,EAAArL,GAAAsL,EAAAtL,GAAAwQ,GAAA1H,EAAA,EACAuC,EAAArL,IAAA8I,EAUA,IAPA0H,IACAnF,EAAAoF,QAAAD,KACA5Q,GAKAiM,EAAAR,EAAA3K,OAAA,GAAA2K,IAAAQ,IAAAR,EAAA4E,MAKA,OAHAnM,EAAAX,EAAAkI,EACAvH,EAAAlE,EAAAuQ,EAAA9E,EAAAzL,GAEAuI,EAAA6C,EAAAlH,EAAA4H,EAAA3B,GAAAjG,GAUAoF,EAAAvB,UAAAuB,EAAA0C,GAAA,SAAA9J,GACA,IAAAuH,EAGA,QAAA,IAAAvH,GAAAA,MAAAA,GAAA,IAAAA,GAAA,IAAAA,EAAA,MAAAzB,MAAAgI,EAAAvG,GASA,OAXAc,KAIAO,GACAkG,EAAAqH,EALA9N,KAKAO,GACArB,GANAc,KAMAhD,EAAA,EAAAyJ,IAAAA,EANAzG,KAMAhD,EAAA,IAEAyJ,EAAAzC,IAGAyC,GASAH,EAAAhD,MAAA,WACA,IACAyF,EADA/I,KACAkI,YAEA,OAAAE,EAAA,IAAAW,EAHA/I,MAAAA,KAGAhD,EAAA,EAAA+L,EAAA/D,WAmBAsB,EAAAyH,KAAAzH,EAAA7G,IAAA,WACA,IAAAqJ,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAoB,WACApB,EAAA0F,SAAA,IAAAkF,EAAA5K,IAEA2K,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA1K,KAAA6I,IAAA9I,EAAAnB,EAAAmB,EAAA6K,MAAA7C,EACA4C,EAAA/D,SAAA,EAEA7G,EA67DA,SAAA4K,EAAA5K,GACA,IAAAsI,EACAwC,EAAA9K,EAAAoC,EAAAzC,OAEA,GAAAmL,EAAA,EAAA,OAAAC,EAAAH,EAAA,EAAA5K,EAAAA,GAQAsI,EAAA,IADAA,EAAA,IAAArI,KAAAuC,KAAAsI,IACA,GAAA,EAAAxC,EAGAtI,EAAAA,EAAAgL,MAAA/K,KAAAoC,IAAA,GAAAiG,IACAtI,EAAA+K,EAAAH,EAAA,EAAA5K,EAAAA,GAOA,IAJA,IAAA6P,EACAjD,EAAA,IAAAhC,EAAA,GACAiC,EAAA,IAAAjC,EAAA,IACAkC,EAAA,IAAAlC,EAAA,IACAtC,KACAuH,EAAA7P,EAAAgL,MAAAhL,GACAA,EAAAA,EAAAgL,MAAA4B,EAAAnL,KAAAoO,EAAA7E,MAAA6B,EAAA7B,MAAA6E,GAAAnO,MAAAoL,MAGA,OAAA9M,EAz9DA4P,CAAAhF,EAAAM,EAAAN,EAAA5K,IAEA4K,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAiB,EAAA,EAAA3D,EAAAtG,EAAA+E,MAAA/E,EAAA2K,EAAA3B,GAAA,IAbA,IAAA4B,EAAA/E,MA6BAsC,EAAA2H,WAAA3H,EAAA3F,KAAA,WACA,IAAA6I,EAAAvM,EAAA+L,EAAAjM,EAAA0M,EAAAvM,EACAiB,EAAA6B,KACAO,EAAApC,EAAAoC,EACAvD,EAAAmB,EAAAnB,EACAmL,EAAAhK,EAAAgK,EACAY,EAAA5K,EAAA+J,YAGA,GAAA,IAAAC,IAAA5H,IAAAA,EAAA,GACA,OAAA,IAAAwI,GAAAZ,GAAAA,EAAA,KAAA5H,GAAAA,EAAA,IAAAyD,IAAAzD,EAAApC,EAAA,EAAA,GAgCA,IA7BAoH,GAAA,EAqBAxI,EAdA,IAJAoL,EAAA/J,KAAAuC,MAAAxC,KAIAgK,GAAA,EAAA,KACAlL,EAAAuJ,EAAAjG,IAEAzC,OAAAd,GAAA,GAAA,IAAAC,GAAA,KACAkL,EAAA/J,KAAAuC,KAAA1D,GACAD,EAAA4I,GAAA5I,EAAA,GAAA,IAAAA,EAAA,GAAAA,EAAA,GASA,IAAA+L,EANA9L,EADAkL,GAAA,EAAA,EACA,KAAAnL,GAEAC,EAAAkL,EAAAyB,iBACAC,MAAA,EAAA5M,EAAA6K,QAAA,KAAA,GAAA9K,IAKA,IAAA+L,EAAAZ,EAAA1E,YAGAuF,GAAAhM,EAAA+L,EAAAhE,WAAA,IAQA,GAHAhI,GADAG,EAAAH,GACA6C,KAAAkK,EAAA3L,EAAAjB,EAAA8L,EAAA,EAAA,IAAAG,MAAA,IAGA3C,EAAAtJ,EAAAqD,GAAAsJ,MAAA,EAAAb,MAAA/L,EAAAuJ,EAAAzJ,EAAAwD,IAAAsJ,MAAA,EAAAb,GAAA,CAKA,GAAA,SAJA/L,EAAAA,EAAA4M,MAAAb,EAAA,EAAAA,EAAA,MAIAS,GAAA,QAAAxM,GAeA,EAIAA,KAAAA,EAAA4M,MAAA,IAAA,KAAA5M,EAAA8K,OAAA,MAGAK,EAAArL,EAAAC,EAAA,EAAA,GACAwM,GAAAzM,EAAAoM,MAAApM,GAAAgN,GAAA5L,IAGA,MAtBA,IAAAsL,IACArB,EAAAlL,EAAAF,EAAA,EAAA,GAEAE,EAAAiM,MAAAjM,GAAA6M,GAAA5L,IAAA,CACApB,EAAAG,EACA,MAIA8L,GAAA,EACAS,EAAA,EAmBA,OAFAlE,GAAA,EAEA6C,EAAArL,EAAAC,EAAA+L,EAAA/D,SAAAwE,IAiBAlD,EAAA4H,QAAA5H,EAAAlF,IAAA,WACA,IAAA0H,EAAA3B,EACAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAEA,OAAA/J,EAAAoB,WACApB,EAAA0F,SAAA,IAAAkF,EAAA5K,IAEA2K,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SACA+D,EAAAhE,UAAA+D,EAAA,GACAC,EAAA/D,SAAA,GAEA7G,EAAAA,EAAAsB,OACA0I,EAAA,EACAhK,EAAA2L,EAAA3L,EAAA,IAAA4K,EAAA,GAAAlJ,MAAA1B,EAAAgL,MAAAhL,IAAAwC,OAAAmI,EAAA,GAAA,GAEAC,EAAAhE,UAAA+D,EACAC,EAAA/D,SAAAmC,EAEAiB,EAAA,GAAA3D,GAAA,GAAAA,EAAAtG,EAAA+E,MAAA/E,EAAA2K,EAAA3B,GAAA,IAfA,IAAA4B,EAAA/E,MAwCAsC,EAAA6C,MAAA7C,EAAAjG,IAAA,SAAAa,GACA,IAAA0M,EAAA5Q,EAAAI,EAAAqJ,EAAA1J,EAAAoR,EAAAjR,EAAAqL,EAAAC,EAEAO,EADA/I,KACAkI,YACAO,EAFAzI,KAEAO,EACAmI,GAAAxH,EAAA,IAAA6H,EAAA7H,IAAAX,EAKA,GAHAW,EAAAiH,GALAnI,KAKAmI,IAGAM,GAAAA,EAAA,IAAAC,GAAAA,EAAA,IAEA,OAAA,IAAAK,GAAA7H,EAAAiH,GAAAM,IAAAA,EAAA,KAAAC,GAAAA,IAAAA,EAAA,KAAAD,EAIAzE,IAIAyE,GAAAC,EAAA,EAAAxH,EAAAiH,EAAAjH,EAAAiH,EAAA,GAoBA,IAjBAnL,EAAA4I,EArBA5F,KAqBAhD,EAAAmJ,GAAAP,EAAA1E,EAAAlE,EAAAmJ,IACAoC,EAAAE,EAAA3K,SACA0K,EAAAE,EAAA5K,UAIAf,EAAA0L,EACAA,EAAAC,EACAA,EAAA3L,EACAoR,EAAA5F,EACAA,EAAAC,EACAA,EAAA2F,GAIApR,EAAA,GAEAK,EADA+Q,EAAA5F,EAAAC,EACApL,KAAAL,EAAAqQ,KAAA,GAGA,IAAAhQ,EAAAoL,EAAA,KAAApL,GAAA,CAEA,IADAwQ,EAAA,EACAnH,EAAA8B,EAAAnL,EAAAA,EAAAqJ,GACAvJ,EAAAH,EAAA0J,GAAAiC,EAAAtL,GAAAqL,EAAAhC,EAAArJ,EAAA,GAAAwQ,EACA7Q,EAAA0J,KAAAvJ,EAAAgJ,EAAA,EACA0H,EAAA1Q,EAAAgJ,EAAA,EAGAnJ,EAAA0J,IAAA1J,EAAA0J,GAAAmH,GAAA1H,EAAA,EAIA,MAAAnJ,IAAAoR,IAAApR,EAAAsQ,MAQA,OANAO,IAAA5Q,EACAD,EAAAuQ,QAEApM,EAAAX,EAAAxD,EACAmE,EAAAlE,EAAAuQ,EAAAxQ,EAAAC,GAEAuI,EAAA6C,EAAAlH,EAAA6H,EAAAhE,UAAAgE,EAAA/D,UAAA9D,GAcAoF,EAAA8H,SAAA,SAAApF,EAAA7B,GACA,OAAAkH,EAAArO,KAAA,EAAAgJ,EAAA7B,IAcAb,EAAAgI,gBAAAhI,EAAAiI,KAAA,SAAAtE,EAAA9C,GACA,IAAAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAGA,OADA/J,EAAA,IAAA4K,EAAA5K,QACA,IAAA8L,EAAA9L,GAEA4I,EAAAkD,EAAA,EAAAtF,QAEA,IAAAwC,EAAAA,EAAA4B,EAAA/D,SACA+B,EAAAI,EAAA,EAAA,GAEAiB,EAAAjK,EAAA8L,EAAA9L,EAAAnB,EAAA,EAAAmK,KAYAb,EAAAsD,cAAA,SAAAK,EAAA9C,GACA,IAAAP,EACAzI,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAcA,OAXAtB,OADA,IAAAqD,EACAuE,EAAArQ,GAAA,IAEA4I,EAAAkD,EAAA,EAAAtF,QAEA,IAAAwC,EAAAA,EAAA4B,EAAA/D,SACA+B,EAAAI,EAAA,EAAA,GAGAqH,EADArQ,EAAAiK,EAAA,IAAAW,EAAA5K,GAAA8L,EAAA,EAAA9C,IACA,EAAA8C,EAAA,IAGA9L,EAAAkN,UAAAlN,EAAA0F,SAAA,IAAA+C,EAAAA,GAoBAN,EAAAmI,QAAA,SAAAxE,EAAA9C,GACA,IAAAP,EAAA1F,EACA/C,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAgBA,OAbAtB,OADA,IAAAqD,EACAuE,EAAArQ,IAEA4I,EAAAkD,EAAA,EAAAtF,QAEA,IAAAwC,EAAAA,EAAA4B,EAAA/D,SACA+B,EAAAI,EAAA,EAAA,GAGAqH,EADAtN,EAAAkH,EAAA,IAAAW,EAAA5K,GAAA8L,EAAA9L,EAAAnB,EAAA,EAAAmK,IACA,EAAA8C,EAAA/I,EAAAlE,EAAA,IAKAmB,EAAAkN,UAAAlN,EAAA0F,SAAA,IAAA+C,EAAAA,GAeAN,EAAAoI,WAAA,SAAAC,GACA,IAAApO,EAAAqO,EAAAC,EAAAC,EAAA9R,EAAAyJ,EAAAxJ,EAAA8R,EAAAC,EAAAlG,EAAA2E,EAAA1Q,EACAoB,EAAA6B,KACAyI,EAAAtK,EAAAoC,EACAwI,EAAA5K,EAAA+J,YAEA,IAAAO,EAAA,OAAA,IAAAM,EAAA5K,GAUA,GARA6Q,EAAAJ,EAAA,IAAA7F,EAAA,GAKAtC,GADAzJ,GADAuD,EAAA,IAAAwI,EAFA8F,EAAAE,EAAA,IAAAhG,EAAA,KAGA/L,EAAA8Q,EAAArF,GAAAtK,EAAAnB,EAAA,GACAmJ,EACA5F,EAAAA,EAAA,GAAAsF,EAAA,GAAAY,EAAA,EAAAN,EAAAM,EAAAA,GAEA,MAAAkI,EAGAA,EAAA,EAAA3R,EAAAuD,EAAAyO,MACA,CAEA,KADA/R,EAAA,IAAA8L,EAAA4F,IACAxC,SAAAlP,EAAAuP,GAAAwC,GAAA,MAAAvR,MAAAgI,EAAAxI,GACA0R,EAAA1R,EAAAqN,GAAA/J,GAAA,EAAAvD,EAAAuD,EAAAyO,EAAA/R,EAQA,IALAsI,GAAA,EACAtI,EAAA,IAAA8L,EAAAvC,EAAAiC,IACAK,EAAAC,EAAAhE,UACAgE,EAAAhE,UAAA/H,EAAAyL,EAAA3K,OAAAqI,EAAA,EAGAsH,EAAA3D,EAAA7M,EAAAsD,EAAA,EAAA,EAAA,GAEA,IADAuO,EAAAF,EAAAhP,KAAA6N,EAAAtE,MAAA0F,KACAvG,IAAAqG,IACAC,EAAAC,EACAA,EAAAC,EACAA,EAAAE,EACAA,EAAAD,EAAAnP,KAAA6N,EAAAtE,MAAA2F,IACAC,EAAAD,EACAA,EAAAvO,EACAA,EAAAtD,EAAA4C,MAAA4N,EAAAtE,MAAA2F,IACA7R,EAAA6R,EAeA,OAZAA,EAAAhF,EAAA6E,EAAA9O,MAAA+O,GAAAC,EAAA,EAAA,EAAA,GACAE,EAAAA,EAAAnP,KAAAkP,EAAA3F,MAAA6F,IACAJ,EAAAA,EAAAhP,KAAAkP,EAAA3F,MAAA0F,IACAE,EAAA5G,EAAA6G,EAAA7G,EAAAhK,EAAAgK,EAGApL,EAAA+M,EAAAkF,EAAAH,EAAA7R,EAAA,GAAA6C,MAAA1B,GAAAS,MAAA0J,IAAAwB,EAAAiF,EAAAH,EAAA5R,EAAA,GAAA6C,MAAA1B,GAAAS,OAAA,EACA,CAAAoQ,EAAAH,GAAA,CAAAE,EAAAH,GAEA7F,EAAAhE,UAAA+D,EACAvD,GAAA,EAEAxI,GAcAuJ,EAAA2I,cAAA3I,EAAA4I,MAAA,SAAAlG,EAAA7B,GACA,OAAAkH,EAAArO,KAAA,GAAAgJ,EAAA7B,IAoBAb,EAAA6I,UAAA,SAAAjO,EAAAiG,GACA,IAAAhJ,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAIA,GAFA/J,EAAA,IAAA4K,EAAA5K,GAEA,MAAA+C,EAAA,CAGA,IAAA/C,EAAAoC,EAAA,OAAApC,EAEA+C,EAAA,IAAA6H,EAAA,GACA5B,EAAA4B,EAAA/D,aACA,CASA,GARA9D,EAAA,IAAA6H,EAAA7H,QACA,IAAAiG,EACAA,EAAA4B,EAAA/D,SAEA+B,EAAAI,EAAA,EAAA,IAIAhJ,EAAAoC,EAAA,OAAAW,EAAAiH,EAAAhK,EAAA+C,EAGA,IAAAA,EAAAX,EAEA,OADAW,EAAAiH,IAAAjH,EAAAiH,EAAAhK,EAAAgK,GACAjH,EAiBA,OAZAA,EAAAX,EAAA,IACAgF,GAAA,EACApH,EAAA2L,EAAA3L,EAAA+C,EAAA,EAAAiG,EAAA,GAAAgC,MAAAjI,GACAqE,GAAA,EACA6C,EAAAjK,KAIA+C,EAAAiH,EAAAhK,EAAAgK,EACAhK,EAAA+C,GAGA/C,GASAmI,EAAA8I,SAAA,WACA,OAAApP,MAcAsG,EAAA+I,QAAA,SAAArG,EAAA7B,GACA,OAAAkH,EAAArO,KAAA,EAAAgJ,EAAA7B,IA+CAb,EAAAgJ,QAAAhJ,EAAA9F,IAAA,SAAAU,GACA,IAAAlE,EAAAyJ,EAAAqC,EAAA/L,EAAAoK,EAAAgB,EACAhK,EAAA6B,KACA+I,EAAA5K,EAAA+J,YACAqH,IAAArO,EAAA,IAAA6H,EAAA7H,IAGA,KAAA/C,EAAAoC,GAAAW,EAAAX,GAAApC,EAAAoC,EAAA,IAAAW,EAAAX,EAAA,IAAA,OAAA,IAAAwI,EAAAlD,GAAA1H,EAAAoR,IAIA,IAFApR,EAAA,IAAA4K,EAAA5K,IAEA4L,GAAA,GAAA,OAAA5L,EAKA,GAHA2K,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,SAEA9D,EAAA6I,GAAA,GAAA,OAAA3B,EAAAjK,EAAA2K,EAAA3B,GAMA,IAHAnK,EAAA4I,EAAA1E,EAAAlE,EAAAmJ,KAGAjF,EAAAX,EAAAzC,OAAA,IAAA2I,EAAA8I,EAAA,GAAAA,EAAAA,IArmEA,iBAumEA,OADAxS,EAAAyS,EAAAzG,EAAA5K,EAAAsI,EAAAqC,GACA5H,EAAAiH,EAAA,EAAA,IAAAY,EAAA,GAAAzI,IAAAvD,GAAAqL,EAAArL,EAAA+L,EAAA3B,GAMA,IAHAgB,EAAAhK,EAAAgK,GAGA,EAAA,CAGA,GAAAnL,EAAAkE,EAAAX,EAAAzC,OAAA,EAAA,OAAA,IAAAiL,EAAA/E,KAMA,GAHA,IAAA,EAAA9C,EAAAX,EAAAvD,MAAAmL,EAAA,GAGA,GAAAhK,EAAAnB,GAAA,GAAAmB,EAAAoC,EAAA,IAAA,GAAApC,EAAAoC,EAAAzC,OAEA,OADAK,EAAAgK,EAAAA,EACAhK,EAgBA,OAPAnB,EAAA,IADAyJ,EAAAZ,GAAA1H,EAAAoR,KACAhQ,SAAAkH,GAEA,IAAAsC,EAAAtC,EAAA,IAAAzJ,EADA4I,EAAA2J,GAAAnR,KAAAU,IAAA,KAAA0H,EAAArI,EAAAoC,IAAAnC,KAAAyG,KAAA1G,EAAAnB,EAAA,KAMA+L,EAAA1D,KAAA,GAAArI,EAAA+L,EAAA3D,KAAA,EAAA,IAAA2D,EAAA,EAAA/L,EAAAmL,EAAA,EAAA,IAEA5C,GAAA,EACAwD,EAAA/D,SAAA7G,EAAAgK,EAAA,EAMA1B,EAAArI,KAAA4I,IAAA,IAAAhK,EAAA,IAAAc,SAGAf,EAAA2Q,EAAAxM,EAAAiI,MAAA6D,EAAA7O,EAAA2K,EAAArC,IAAAqC,IAGAvI,GAOA2G,GAJAnK,EAAAqL,EAAArL,EAAA+L,EAAA,EAAA,IAIAvI,EAAAuI,EAAA3B,KACAnK,EAAA8L,EAAA,IAMAtC,GAHAzJ,EAAAqL,EAAAsF,EAAAxM,EAAAiI,MAAA6D,EAAA7O,EAAAnB,EAAAyJ,IAAAzJ,GAAAA,EAAA,EAAA,IAGAuD,GAAAsJ,MAAAf,EAAA,EAAAA,EAAA,IAAA,GAAA,OACA/L,EAAAqL,EAAArL,EAAA+L,EAAA,EAAA,KAKA/L,EAAAoL,EAAAA,EACA5C,GAAA,EAGA6C,EAAArL,EAAA+L,EAFAC,EAAA/D,SAAAmC,KAiBAb,EAAAmJ,YAAA,SAAAzG,EAAA7B,GACA,IAAAP,EACAzI,EAAA6B,KACA+I,EAAA5K,EAAA+J,YAcA,OAXAtB,OADA,IAAAoC,EACAwF,EAAArQ,EAAAA,EAAAnB,GAAA+L,EAAA7D,UAAA/G,EAAAnB,GAAA+L,EAAA5D,WAEA4B,EAAAiC,EAAA,EAAArE,QAEA,IAAAwC,EAAAA,EAAA4B,EAAA/D,SACA+B,EAAAI,EAAA,EAAA,GAGAqH,EADArQ,EAAAiK,EAAA,IAAAW,EAAA5K,GAAA6K,EAAA7B,GACA6B,GAAA7K,EAAAnB,GAAAmB,EAAAnB,GAAA+L,EAAA7D,SAAA8D,IAGA7K,EAAAkN,UAAAlN,EAAA0F,SAAA,IAAA+C,EAAAA,GAkBAN,EAAAoJ,oBAAApJ,EAAAqJ,KAAA,SAAA3G,EAAA7B,GACA,IACA4B,EADA/I,KACAkI,YAYA,YAVA,IAAAc,GACAA,EAAAD,EAAAhE,UACAoC,EAAA4B,EAAA/D,WAEA+B,EAAAiC,EAAA,EAAArE,QAEA,IAAAwC,EAAAA,EAAA4B,EAAA/D,SACA+B,EAAAI,EAAA,EAAA,IAGAiB,EAAA,IAAAW,EAbA/I,MAaAgJ,EAAA7B,IAWAb,EAAA7C,SAAA,WACA,IAAAtF,EAAA6B,KACA+I,EAAA5K,EAAA+J,YACAtB,EAAA4H,EAAArQ,EAAAA,EAAAnB,GAAA+L,EAAA7D,UAAA/G,EAAAnB,GAAA+L,EAAA5D,UAEA,OAAAhH,EAAAkN,UAAAlN,EAAA0F,SAAA,IAAA+C,EAAAA,GAQAN,EAAAsJ,UAAAtJ,EAAAuJ,MAAA,WACA,OAAAzH,EAAA,IAAApI,KAAAkI,YAAAlI,MAAAA,KAAAhD,EAAA,EAAA,IASAsJ,EAAA1C,QAAA0C,EAAAwJ,OAAA,WACA,IAAA3R,EAAA6B,KACA+I,EAAA5K,EAAA+J,YACAtB,EAAA4H,EAAArQ,EAAAA,EAAAnB,GAAA+L,EAAA7D,UAAA/G,EAAAnB,GAAA+L,EAAA5D,UAEA,OAAAhH,EAAAkN,QAAA,IAAAzE,EAAAA,GA6NA,IAAAkD,EAAA,WAGA,SAAAiG,EAAA5R,EAAAsI,EAAAkG,GACA,IAAA/J,EACAgL,EAAA,EACAxQ,EAAAe,EAAAL,OAEA,IAAAK,EAAAA,EAAA0L,QAAAzM,KACAwF,EAAAzE,EAAAf,GAAAqJ,EAAAmH,EACAzP,EAAAf,GAAAwF,EAAA+J,EAAA,EACAiB,EAAAhL,EAAA+J,EAAA,EAKA,OAFAiB,GAAAzP,EAAA0P,QAAAD,GAEAzP,EAGA,SAAA6R,EAAAxS,EAAAkB,EAAAuR,EAAAC,GACA,IAAA9S,EAAAL,EAEA,GAAAkT,GAAAC,EACAnT,EAAAmT,EAAAD,EAAA,GAAA,OAEA,IAAA7S,EAAAL,EAAA,EAAAK,EAAA6S,EAAA7S,IACA,GAAAI,EAAAJ,IAAAsB,EAAAtB,GAAA,CACAL,EAAAS,EAAAJ,GAAAsB,EAAAtB,GAAA,GAAA,EACA,MAKA,OAAAL,EAGA,SAAAoT,EAAA3S,EAAAkB,EAAAuR,EAAAtD,GAIA,IAHA,IAAAvP,EAAA,EAGA6S,KACAzS,EAAAyS,IAAA7S,EACAA,EAAAI,EAAAyS,GAAAvR,EAAAuR,GAAA,EAAA,EACAzS,EAAAyS,GAAA7S,EAAAuP,EAAAnP,EAAAyS,GAAAvR,EAAAuR,GAIA,MAAAzS,EAAA,IAAA,EAAAA,EAAAM,QAAAN,EAAA8P,QAGA,OAAA,SAAAnP,EAAA+C,EAAA4H,EAAA3B,EAAA8C,EAAA0C,GACA,IAAArE,EAAAtL,EAAAI,EAAAqJ,EAAA2J,EAAAC,EAAAC,EAAAC,EAAA9C,EAAA+C,EAAAC,EAAAC,EAAAC,EAAA3H,EAAA9L,EAAA0T,EAAAC,EAAAC,EACAC,EAAAC,EACAjI,EAAA5K,EAAA+J,YACAhI,EAAA/B,EAAAgK,GAAAjH,EAAAiH,EAAA,GAAA,EACAM,EAAAtK,EAAAoC,EACAmI,EAAAxH,EAAAX,EAGA,KAAAkI,GAAAA,EAAA,IAAAC,GAAAA,EAAA,IAEA,OAAA,IAAAK,EACA5K,EAAAgK,GAAAjH,EAAAiH,IAAAM,GAAAC,GAAAD,EAAA,IAAAC,EAAA,GAAAA,GAGAD,GAAA,GAAAA,EAAA,KAAAC,EAAA,EAAAxI,EAAAA,EAAA,EAHA8D,KAsBA,IAdAhH,EAFA2P,GACAyD,EAAA,EACAjS,EAAAnB,EAAAkE,EAAAlE,IAEA2P,EAAAzG,EACAkK,EAAAjK,EACAP,EAAAzH,EAAAnB,EAAAoT,GAAAxK,EAAA1E,EAAAlE,EAAAoT,IAGAW,EAAArI,EAAA5K,OACA+S,EAAApI,EAAA3K,OAEA0S,GADA/C,EAAA,IAAA1E,EAAA7I,IACAK,EAAA,GAIAnD,EAAA,EAAAsL,EAAAtL,KAAAqL,EAAArL,IAAA,GAAAA,KAaA,GAXAsL,EAAAtL,IAAAqL,EAAArL,IAAA,IAAAJ,IAEA,MAAA8L,GACAE,EAAAF,EAAAC,EAAAhE,UACAoC,EAAA4B,EAAA/D,UAEAgE,EADAiB,EACAnB,GAAA3K,EAAAnB,EAAAkE,EAAAlE,GAAA,EAEA8L,EAGAE,EAAA,EACAwH,EAAApD,KAAA,GACAiD,GAAA,MACA,CAOA,GAJArH,EAAAA,EAAAoH,EAAA,EAAA,EACAhT,EAAA,EAGA,GAAA2T,EAAA,CAMA,IAJArI,EAAAA,EADAjC,EAAA,GAEAuC,KAGA5L,EAAAyT,GAAApK,IAAAuC,IAAA5L,IACAF,EAAAuJ,EAAAkG,GAAAlE,EAAArL,IAAA,GACAoT,EAAApT,GAAAF,EAAAwL,EAAA,EACAjC,EAAAvJ,EAAAwL,EAAA,EAGA2H,EAAA5J,GAAArJ,EAAAyT,MAGA,CAiBA,IAZA,GAFApK,EAAAkG,GAAAjE,EAAA,GAAA,GAAA,KAGAA,EAAAqH,EAAArH,EAAAjC,EAAAkG,GACAlE,EAAAsH,EAAAtH,EAAAhC,EAAAkG,GACAoE,EAAArI,EAAA5K,OACA+S,EAAApI,EAAA3K,QAGA8S,EAAAG,EAEAL,GADAD,EAAAhI,EAAAoB,MAAA,EAAAkH,IACAjT,OAGA4S,EAAAK,GAAAN,EAAAC,KAAA,EAQA,KANAM,EAAAtI,EAAAmB,SACAgE,QAAA,GACAiD,EAAApI,EAAA,GAEAA,EAAA,IAAAiE,EAAA,KAAAmE,EAGArK,EAAA,GAGA6B,EAAA0H,EAAAtH,EAAA+H,EAAAM,EAAAL,IAGA,GAGAC,EAAAF,EAAA,GACAM,GAAAL,IAAAC,EAAAA,EAAAhE,GAAA8D,EAAA,IAAA,IAaA,GAVAhK,EAAAkK,EAAAG,EAAA,IAWAnE,GAAAlG,IAAAA,EAAAkG,EAAA,GAWA,IAHArE,EAAA0H,EALAM,EAAAP,EAAArH,EAAAjC,EAAAkG,GAKA8D,EAJAF,EAAAD,EAAAxS,OACA4S,EAAAD,EAAA3S,WAOA2I,IAGA0J,EAAAG,EAAAS,EAAAR,EAAAS,EAAAtI,EAAA6H,EAAA5D,MAOA,GAAAlG,IAAA6B,EAAA7B,EAAA,GACA6J,EAAA5H,EAAAmB,UAGA0G,EAAAD,EAAAxS,QACA4S,GAAAJ,EAAAzC,QAAA,GAGAsC,EAAAM,EAAAH,EAAAI,EAAA/D,IAGA,GAAArE,IAIAA,EAAA0H,EAAAtH,EAAA+H,EAAAM,EAHAL,EAAAD,EAAA3S,SAMA,IACA2I,IAGA0J,EAAAM,EAAAM,EAAAL,EAAAM,EAAAtI,EAAAgI,EAAA/D,IAIA+D,EAAAD,EAAA3S,QACA,IAAAwK,IACA7B,IACAgK,EAAA,CAAA,IAIAD,EAAApT,KAAAqJ,EAGA6B,GAAAmI,EAAA,GACAA,EAAAC,KAAAjI,EAAAmI,IAAA,GAEAH,EAAA,CAAAhI,EAAAmI,IACAF,EAAA,IAGAE,IAAAC,QAAA,IAAAJ,EAAA,KAAAzH,MAEAqH,OAAA,IAAAI,EAAA,GAIAD,EAAA,IAAAA,EAAAlD,QAIA,GAAA,GAAA8C,EACA3C,EAAAzQ,EAAAA,EACAuH,EAAA8L,MACA,CAGA,IAAAjT,EAAA,EAAAqJ,EAAA+J,EAAA,GAAA,IAAA/J,EAAAA,GAAA,GAAArJ,IACAqQ,EAAAzQ,EAAAI,EAAAJ,EAAAoT,EAAA,EAEAhI,EAAAqF,EAAAxD,EAAAnB,EAAA2E,EAAAzQ,EAAA,EAAA8L,EAAA3B,EAAAkJ,GAGA,OAAA5C,GAnQA,GA4QA,SAAArF,EAAAjK,EAAA6K,EAAA7B,EAAA8J,GACA,IAAAC,EAAA9T,EAAAsK,EAAAjB,EAAAa,EAAA6J,EAAAtK,EAAA4B,EAAA2I,EACArI,EAAA5K,EAAA+J,YAGAmJ,EAAA,GAAA,MAAArI,EAAA,CAIA,KAHAP,EAAAtK,EAAAoC,GAGA,OAAApC,EAWA,IAAA+S,EAAA,EAAAzK,EAAAgC,EAAA,GAAA,IAAAhC,EAAAA,GAAA,GAAAyK,IAIA,IAHA9T,EAAA4L,EAAAkI,GAGA,EACA9T,GAAA+I,EACAuB,EAAAsB,EAIA1B,GAHAT,EAAA4B,EAAA2I,EAAA,IAGAvL,EAAA,GAAAqL,EAAAxJ,EAAA,GAAA,GAAA,OAIA,GAFA0J,EAAAhT,KAAA+E,MAAA/F,EAAA,GAAA+I,IACAM,EAAAgC,EAAA3K,SACAsT,EAAA,CACA,IAAAH,EASA,MAAAI,EANA,KAAA5K,KAAA2K,GAAA3I,EAAA2E,KAAA,GACAvG,EAAAS,EAAA,EAGAI,GADAtK,GAAA+I,GACAA,GAFA+K,EAAA,OAMA,CAIA,IAHArK,EAAAJ,EAAAgC,EAAA2I,GAGAF,EAAA,EAAA,IAAAzK,EAAAA,GAAA,GAAAyK,IAUA5J,GAHAI,GAJAtK,GAAA+I,GAIAA,EAAA+K,GAGA,EAAA,EAAArK,EAAAhB,EAAA,GAAAqL,EAAAxJ,EAAA,GAAA,GAAA,EAoBA,GAfAuJ,EAAAA,GAAAjI,EAAA,QACA,IAAAP,EAAA2I,EAAA,KAAA1J,EAAA,EAAAb,EAAAA,EAAAhB,EAAA,GAAAqL,EAAAxJ,EAAA,IAMAyJ,EAAAhK,EAAA,GACAG,GAAA2J,KAAA,GAAA9J,GAAAA,IAAAhJ,EAAAgK,EAAA,EAAA,EAAA,IACA,EAAAb,GAAA,GAAAA,IAAA,GAAAH,GAAA8J,GAAA,GAAA9J,IAGA,EAAA/J,EAAA,EAAAsK,EAAAb,EAAAhB,EAAA,GAAAqL,EAAAxJ,GAAA,EAAAe,EAAA2I,EAAA,IAAA,GAAA,GACAjK,IAAAhJ,EAAAgK,EAAA,EAAA,EAAA,IAEAa,EAAA,IAAAP,EAAA,GAgBA,OAfAA,EAAA3K,OAAA,EACAqT,GAGAnI,GAAA7K,EAAAnB,EAAA,EAGAyL,EAAA,GAAA5C,EAAA,IAAAM,EAAA6C,EAAA7C,GAAAA,GACAhI,EAAAnB,GAAAgM,GAAA,GAIAP,EAAA,GAAAtK,EAAAnB,EAAA,EAGAmB,EAiBA,GAbA,GAAAf,GACAqL,EAAA3K,OAAAsT,EACA3K,EAAA,EACA2K,MAEA3I,EAAA3K,OAAAsT,EAAA,EACA3K,EAAAZ,EAAA,GAAAM,EAAA/I,GAIAqL,EAAA2I,GAAA,EAAA1J,GAAAb,EAAAhB,EAAA,GAAAqL,EAAAxJ,GAAA7B,EAAA,GAAA6B,GAAA,GAAAjB,EAAA,GAGA0K,EACA,OAAA,CAGA,GAAA,GAAAC,EAAA,CAGA,IAAAhU,EAAA,EAAAsK,EAAAe,EAAA,GAAA,IAAAf,EAAAA,GAAA,GAAAtK,IAEA,IADAsK,EAAAe,EAAA,IAAAhC,EACAA,EAAA,EAAA,IAAAiB,EAAAA,GAAA,GAAAjB,IAGArJ,GAAAqJ,IACAtI,EAAAnB,IACAyL,EAAA,IAAAvC,IAAAuC,EAAA,GAAA,IAGA,MAGA,GADAA,EAAA2I,IAAA3K,EACAgC,EAAA2I,IAAAlL,EAAA,MACAuC,EAAA2I,KAAA,EACA3K,EAAA,EAMA,IAAArJ,EAAAqL,EAAA3K,OAAA,IAAA2K,IAAArL,IAAAqL,EAAA4E,MAsBA,OAnBA9H,IAGApH,EAAAnB,EAAA+L,EAAA1D,MAGAlH,EAAAoC,EAAA,KACApC,EAAAnB,EAAAgH,KAGA7F,EAAAnB,EAAA+L,EAAA3D,OAGAjH,EAAAnB,EAAA,EACAmB,EAAAoC,EAAA,CAAA,KAKApC,EAIA,SAAAqQ,EAAArQ,EAAAmT,EAAAtI,GACA,IAAA7K,EAAAoB,WAAA,OAAAgS,EAAApT,GACA,IAAAsI,EACAzJ,EAAAmB,EAAAnB,EACA4J,EAAAJ,EAAArI,EAAAoC,GACA0I,EAAArC,EAAA9I,OAwBA,OAtBAwT,GACAtI,GAAA,GAAAvC,EAAAuC,EAAAC,GACArC,EAAAA,EAAAmB,OAAA,GAAA,IAAAnB,EAAAiD,MAAA,GAAA/C,EAAAL,GACA,EAAAwC,IACArC,EAAAA,EAAAmB,OAAA,GAAA,IAAAnB,EAAAiD,MAAA,IAGAjD,EAAAA,GAAAzI,EAAAnB,EAAA,EAAA,IAAA,MAAAmB,EAAAnB,GACAA,EAAA,GACA4J,EAAA,KAAAE,GAAA9J,EAAA,GAAA4J,EACAoC,GAAA,GAAAvC,EAAAuC,EAAAC,KAAArC,GAAAE,EAAAL,KACAwC,GAAAjM,GACA4J,GAAAE,EAAA9J,EAAA,EAAAiM,GACAD,GAAA,GAAAvC,EAAAuC,EAAAhM,EAAA,KAAA4J,EAAAA,EAAA,IAAAE,EAAAL,OAEAA,EAAAzJ,EAAA,GAAAiM,IAAArC,EAAAA,EAAAiD,MAAA,EAAApD,GAAA,IAAAG,EAAAiD,MAAApD,IACAuC,GAAA,GAAAvC,EAAAuC,EAAAC,KACAjM,EAAA,IAAAiM,IAAArC,GAAA,KACAA,GAAAE,EAAAL,KAIAG,EAKA,SAAA2G,EAAA2D,EAAAlU,GACA,IAAA6J,EAAAqK,EAAA,GAGA,IAAAlU,GAAAmJ,EAAA,IAAAU,EAAAA,GAAA,GAAA7J,IACA,OAAAA,EAIA,SAAAiQ,EAAAlE,EAAAC,EAAAF,GACA,GAAA1C,EAAA4C,EAKA,MAFAzD,GAAA,EACAuD,IAAAC,EAAAhE,UAAA+D,GACArL,MAAAiI,GAEA,OAAA0C,EAAA,IAAAW,EAAAlE,GAAAmE,EAAA,GAAA,GAIA,SAAAsC,EAAAvC,EAAAC,EAAA7B,GACA,GAAAd,EAAA2C,EAAA,MAAAvL,MAAAiI,GACA,OAAA0C,EAAA,IAAAW,EAAAhI,GAAAiI,EAAA7B,GAAA,GAIA,SAAA2G,EAAAoD,GACA,IAAArK,EAAAqK,EAAApT,OAAA,EACAmL,EAAApC,EAAAV,EAAA,EAKA,GAHAU,EAAAqK,EAAArK,GAGA,CAGA,KAAAA,EAAA,IAAA,EAAAA,GAAA,GAAAoC,IAGA,IAAApC,EAAAqK,EAAA,GAAA,IAAArK,EAAAA,GAAA,GAAAoC,IAGA,OAAAA,EAIA,SAAAnC,EAAAL,GAEA,IADA,IAAA+K,EAAA,GACA/K,KAAA+K,GAAA,IACA,OAAAA,EAWA,SAAAhC,EAAAzG,EAAA5K,EAAAlB,EAAA6L,GACA,IAAAmI,EACAlU,EAAA,IAAAgM,EAAA,GAIAtC,EAAArI,KAAA+E,KAAA2F,EAAA3C,EAAA,GAIA,IAFAZ,GAAA,IAEA,CAOA,GANAtI,EAAA,GAEAwU,GADA1U,EAAAA,EAAAoM,MAAAhL,IACAoC,EAAAkG,KAAAwK,GAAA,GAIA,KADAhU,EAAA2I,EAAA3I,EAAA,IACA,CAGAA,EAAAF,EAAAwD,EAAAzC,OAAA,EACAmT,GAAA,IAAAlU,EAAAwD,EAAAtD,MAAAF,EAAAwD,EAAAtD,GACA,MAIAwU,GADAtT,EAAAA,EAAAgL,MAAAhL,IACAoC,EAAAkG,GAKA,OAFAlB,GAAA,EAEAxI,EAIA,SAAA2U,EAAAzU,GACA,OAAA,EAAAA,EAAAsD,EAAAtD,EAAAsD,EAAAzC,OAAA,GAOA,SAAA6T,EAAA5I,EAAA6I,EAAAC,GAKA,IAJA,IAAA3Q,EACA/C,EAAA,IAAA4K,EAAA6I,EAAA,IACAxU,EAAA,IAEAA,EAAAwU,EAAA9T,QAAA,CAEA,KADAoD,EAAA,IAAA6H,EAAA6I,EAAAxU,KACA+K,EAAA,CACAhK,EAAA+C,EACA,MACA/C,EAAA0T,GAAA3Q,KACA/C,EAAA+C,GAIA,OAAA/C,EAmCA,SAAAuP,EAAAvP,EAAA6K,GACA,IAAA6D,EAAAiF,EAAApK,EAAAlH,EAAAuR,EAAA7U,EAAA0O,EACAnC,EAAA,EACArM,EAAA,EACAqJ,EAAA,EACAsC,EAAA5K,EAAA+J,YACAf,EAAA4B,EAAA/D,SACA8D,EAAAC,EAAAhE,UAGA,IAAA5G,EAAAoC,IAAApC,EAAAoC,EAAA,IAAA,GAAApC,EAAAnB,EAEA,OAAA,IAAA+L,EAAA5K,EAAAoC,EACApC,EAAAoC,EAAA,GAAApC,EAAAgK,EAAA,EAAA,EAAA,EAAA,EAAA,EACAhK,EAAAgK,EAAAhK,EAAAgK,EAAA,EAAA,EAAAhK,EAAA,KAaA,IARAyN,EAFA,MAAA5C,GACAzD,GAAA,EACAuD,GAEAE,EAGA9L,EAAA,IAAA6L,EAAA,SAGA,EAAA5K,EAAAnB,GAGAmB,EAAAA,EAAAgL,MAAAjM,GACAuJ,GAAA,EAUA,IAJAmF,GADAkG,EAAA1T,KAAAU,IAAA+G,EAAA,EAAAY,IAAArI,KAAAyG,KAAA,EAAA,EAAA,EAEAgI,EAAArM,EAAAuR,EAAA,IAAAhJ,EAAA,GACAA,EAAAhE,UAAA6G,IAEA,CAKA,GAJApL,EAAA4H,EAAA5H,EAAA2I,MAAAhL,GAAAyN,EAAA,GACAiB,EAAAA,EAAA1D,QAAA/L,GAGAoJ,GAFAtJ,EAAA6U,EAAAnS,KAAAkK,EAAAtJ,EAAAqM,EAAAjB,EAAA,KAEArL,GAAAsJ,MAAA,EAAA+B,KAAApF,EAAAuL,EAAAxR,GAAAsJ,MAAA,EAAA+B,GAAA,CAEA,IADAlE,EAAAjB,EACAiB,KAAAqK,EAAA3J,EAAA2J,EAAA5I,MAAA4I,GAAAnG,EAAA,GAOA,GAAA,MAAA5C,EAYA,OADAD,EAAAhE,UAAA+D,EACAiJ,EAVA,KAAAtI,EAAA,GAAAvC,EAAA6K,EAAAxR,EAAAqL,EAAAkG,EAAA3K,EAAAsC,IAMA,OAAArB,EAAA2J,EAAAhJ,EAAAhE,UAAA+D,EAAA3B,EAAA5B,GAAA,GALAwD,EAAAhE,UAAA6G,GAAA,GACAiB,EAAArM,EAAAtD,EAAA,IAAA6L,EAAA,GACA3L,EAAA,EACAqM,IAUAsI,EAAA7U,GAoBA,SAAA8P,EAAA9L,EAAA8H,GACA,IAAA1L,EAAA0U,EAAAnF,EAAA7P,EAAAiV,EAAAxI,EAAAsI,EAAA7U,EAAA0O,EAAAsG,EAAAjG,EACAhP,EAAA,EAEAkB,EAAA+C,EACAuH,EAAAtK,EAAAoC,EACAwI,EAAA5K,EAAA+J,YACAf,EAAA4B,EAAA/D,SACA8D,EAAAC,EAAAhE,UAGA,GAAA5G,EAAAgK,EAAA,IAAAM,IAAAA,EAAA,KAAAtK,EAAAnB,GAAA,GAAAyL,EAAA,IAAA,GAAAA,EAAA3K,OACA,OAAA,IAAAiL,EAAAN,IAAAA,EAAA,IAAA,EAAA,EAAA,GAAAtK,EAAAgK,EAAAnE,IAAAyE,EAAA,EAAAtK,GAcA,GATAyN,EAFA,MAAA5C,GACAzD,GAAA,EACAuD,GAEAE,EAGAD,EAAAhE,UAAA6G,GAnBA,GAqBAoG,GADA1U,EAAAkJ,EAAAiC,IACAV,OAAA,KAEA3J,KAAAQ,IAAA5B,EAAAmB,EAAAnB,GAAA,OAqCA,OAJAE,EAAA+P,EAAAlE,EAAA6C,EAAA,EAAA9C,GAAAK,MAAAnM,EAAA,IACAmB,EAAA6O,EAAA,IAAAjE,EAAAiJ,EAAA,IAAA1U,EAAAuM,MAAA,IAAA+B,EAzDA,IAyDAhM,KAAA1C,GACA6L,EAAAhE,UAAA+D,EAEA,MAAAE,EAAAZ,EAAAjK,EAAA2K,EAAA3B,EAAA5B,GAAA,GAAApH,EAxBA,KAAA6T,EAAA,GAAA,GAAAA,GAAA,GAAAA,GAAA,EAAA1U,EAAAyK,OAAA,IAGAiK,GADA1U,EAAAkJ,GADArI,EAAAA,EAAAgL,MAAAjI,IACAX,IACAwH,OAAA,GACA9K,IAiCA,IA9BAD,EAAAmB,EAAAnB,EAEA,EAAAgV,GACA7T,EAAA,IAAA4K,EAAA,KAAAzL,GACAN,KAEAmB,EAAA,IAAA4K,EAAAiJ,EAAA,IAAA1U,EAAAuM,MAAA,IAoBAkI,EAAAE,EAAA9T,EAAA2L,GALAoI,EAAA/T,GAKA0B,MAAA,GAAA1B,EAAAyB,KAAA,GAAAgM,EAAA,GACAK,EAAA7D,EAAAjK,EAAAgL,MAAAhL,GAAAyN,EAAA,GACAiB,EAAA,IAEA,CAIA,GAHAoF,EAAA7J,EAAA6J,EAAA9I,MAAA8C,GAAAL,EAAA,GAGApF,GAFAtJ,EAAA6U,EAAAnS,KAAAkK,EAAAmI,EAAA,IAAAlJ,EAAA8D,GAAAjB,EAAA,KAEArL,GAAAsJ,MAAA,EAAA+B,KAAApF,EAAAuL,EAAAxR,GAAAsJ,MAAA,EAAA+B,GAAA,CAcA,GAbAmG,EAAAA,EAAA5I,MAAA,GAIA,IAAAnM,IAAA+U,EAAAA,EAAAnS,KAAAqN,EAAAlE,EAAA6C,EAAA,EAAA9C,GAAAK,MAAAnM,EAAA,MACA+U,EAAAjI,EAAAiI,EAAA,IAAAhJ,EAAA9L,GAAA2O,EAAA,GAQA,MAAA5C,EAWA,OADAD,EAAAhE,UAAA+D,EACAiJ,EAVA,IAAA7K,EAAA6K,EAAAxR,EAAAqL,EA5FA,GA4FAzE,EAAAsC,GAMA,OAAArB,EAAA2J,EAAAhJ,EAAAhE,UAAA+D,EAAA3B,EAAA5B,GAAA,GALAwD,EAAAhE,UAAA6G,GA7FA,GA8FA1O,EAAA+U,EAAA9T,EAAA2L,EAAAoI,EAAArS,MAAA,GAAAqS,EAAAtS,KAAA,GAAAgM,EAAA,GACAK,EAAA7D,EAAAjK,EAAAgL,MAAAhL,GAAAyN,EAAA,GACAiB,EAAApD,EAAA,EAUAsI,EAAA7U,EACA2P,GAAA,GAMA,SAAA0E,EAAApT,GAEA,OAAAgU,OAAAhU,EAAAgK,EAAAhK,EAAAgK,EAAA,GAOA,SAAAiK,EAAAjU,EAAAyI,GACA,IAAA5J,EAAAI,EAAA6L,EAmBA,KAhBA,GAAAjM,EAAA4J,EAAAkB,QAAA,QAAAlB,EAAAA,EAAAyL,QAAA,IAAA,KAGA,GAAAjV,EAAAwJ,EAAA0L,OAAA,QAGAtV,EAAA,IAAAA,EAAAI,GACAJ,IAAA4J,EAAAiD,MAAAzM,EAAA,GACAwJ,EAAAA,EAAA2L,UAAA,EAAAnV,IACAJ,EAAA,IAGAA,EAAA4J,EAAA9I,QAIAV,EAAA,EAAA,KAAAwJ,EAAA4L,WAAApV,GAAAA,KAGA,IAAA6L,EAAArC,EAAA9I,OAAA,KAAA8I,EAAA4L,WAAAvJ,EAAA,KAAAA,GAGA,GAFArC,EAAAA,EAAAiD,MAAAzM,EAAA6L,GAEA,CAYA,GAXAA,GAAA7L,EACAe,EAAAnB,EAAAA,EAAAA,EAAAI,EAAA,EACAe,EAAAoC,EAAA,GAMAnD,GAAAJ,EAAA,GAAAmJ,EACAnJ,EAAA,IAAAI,GAAA+I,GAEA/I,EAAA6L,EAAA,CAEA,IADA7L,GAAAe,EAAAoC,EAAA6M,MAAAxG,EAAAiD,MAAA,EAAAzM,IACA6L,GAAA9C,EAAA/I,EAAA6L,GAAA9K,EAAAoC,EAAA6M,MAAAxG,EAAAiD,MAAAzM,EAAAA,GAAA+I,IACAS,EAAAA,EAAAiD,MAAAzM,GACAA,EAAA+I,EAAAS,EAAA9I,YAEAV,GAAA6L,EAGA,KAAA7L,KAAAwJ,GAAA,IACAzI,EAAAoC,EAAA6M,MAAAxG,GAEArB,IAGApH,EAAAnB,EAAAmB,EAAA+J,YAAA7C,MAGAlH,EAAAoC,EAAA,KACApC,EAAAnB,EAAAgH,KAGA7F,EAAAnB,EAAAmB,EAAA+J,YAAA9C,OAGAjH,EAAAnB,EAAA,EACAmB,EAAAoC,EAAA,CAAA,UAOApC,EAAAnB,EAAA,EACAmB,EAAAoC,EAAA,CAAA,GAGA,OAAApC,EAqHA,SAAA+K,EAAAH,EAAA9L,EAAAkB,EAAA+C,EAAAuR,GACA,IAAA/K,EAAAxK,EAAAK,EAAA0O,EAEAnD,EAAAC,EAAAhE,UACA0B,EAAArI,KAAA+E,KAAA2F,EAAA3C,GAMA,IAJAZ,GAAA,EACA0G,EAAA9N,EAAAgL,MAAAhL,GACAZ,EAAA,IAAAwL,EAAA7H,KAEA,CAMA,GALAhE,EAAA4M,EAAAvM,EAAA4L,MAAA8C,GAAA,IAAAlD,EAAA9L,IAAAA,KAAA6L,EAAA,GACAvL,EAAAkV,EAAAvR,EAAAtB,KAAA1C,GAAAgE,EAAArB,MAAA3C,GACAgE,EAAA4I,EAAA5M,EAAAiM,MAAA8C,GAAA,IAAAlD,EAAA9L,IAAAA,KAAA6L,EAAA,QAGA,KAFA5L,EAAAK,EAAAqC,KAAAsB,IAEAX,EAAAkG,GAAA,CACA,IAAAiB,EAAAjB,EAAAvJ,EAAAqD,EAAAmH,KAAAnK,EAAAgD,EAAAmH,IAAAA,MACA,IAAA,GAAAA,EAAA,MAGAA,EAAAnK,EACAA,EAAA2D,EACAA,EAAAhE,EACAA,EAAAwK,EACAtK,EAMA,OAHAmI,GAAA,EACArI,EAAAqD,EAAAzC,OAAA2I,EAAA,EAEAvJ,EAKA,SAAAmM,EAAAN,EAAA5K,GACA,IAAAjB,EACAmO,EAAAlN,EAAAgK,EAAA,EACAuK,EAAApH,EAAAvC,EAAAA,EAAAhE,UAAA,GACAqG,EAAAsH,EAAAvJ,MAAA,IAIA,IAFAhL,EAAAA,EAAAS,OAEA4M,IAAAJ,GAEA,OADA3G,EAAA4G,EAAA,EAAA,EACAlN,EAKA,IAFAjB,EAAAiB,EAAAiM,SAAAsI,IAEA7O,SACAY,EAAA4G,EAAA,EAAA,MACA,CAIA,IAHAlN,EAAAA,EAAA0B,MAAA3C,EAAAiM,MAAAuJ,KAGAlH,IAAAJ,GAEA,OADA3G,EAAAiN,EAAAxU,GAAAmO,EAAA,EAAA,EAAAA,EAAA,EAAA,EACAlN,EAGAsG,EAAAiN,EAAAxU,GAAAmO,EAAA,EAAA,EAAAA,EAAA,EAAA,EAGA,OAAAlN,EAAA0B,MAAA6S,GAAA9T,MASA,SAAAyP,EAAAlQ,EAAAsJ,EAAAuB,EAAA7B,GACA,IAAAwF,EAAA3P,EAAAI,EAAAqJ,EAAAwC,EAAAkI,EAAAvK,EAAA6B,EAAAvH,EACA6H,EAAA5K,EAAA+J,YACAoJ,OAAA,IAAAtI,EAWA,GATAsI,GACAvK,EAAAiC,EAAA,EAAArE,QACA,IAAAwC,EAAAA,EAAA4B,EAAA/D,SACA+B,EAAAI,EAAA,EAAA,KAEA6B,EAAAD,EAAAhE,UACAoC,EAAA4B,EAAA/D,UAGA7G,EAAAoB,WAEA,CAoCA,IA3BA+R,GACA3E,EAAA,EACA,IAAAlF,EACAuB,EAAA,EAAAA,EAAA,EACA,GAAAvB,IACAuB,EAAA,EAAAA,EAAA,IAGA2D,EAAAlF,EAOA,IAtBArK,GADAwJ,EAAA4H,EAAArQ,IACA2J,QAAA,QAuBAlB,EAAAA,EAAAyL,QAAA,IAAA,KACAnR,EAAA,IAAA6H,EAAA,IACA/L,EAAA4J,EAAA9I,OAAAV,EACA8D,EAAAX,EAAAgH,EAAAiH,EAAAtN,GAAA,GAAAyL,GACAzL,EAAAlE,EAAAkE,EAAAX,EAAAzC,QAIAd,EAAAiM,GADAR,EAAAlB,EAAAX,EAAA,GAAA+F,IACA7O,OAGA,GAAA2K,IAAAQ,IAAAR,EAAA4E,MAEA,GAAA5E,EAAA,GAEA,CAyBA,GAxBArL,EAAA,EACAJ,MAEAmB,EAAA,IAAA4K,EAAA5K,IACAoC,EAAAkI,EACAtK,EAAAnB,EAAAA,EAEAyL,GADAtK,EAAA2L,EAAA3L,EAAA+C,EAAA8H,EAAA7B,EAAA,EAAAwF,IACApM,EACAvD,EAAAmB,EAAAnB,EACAmU,EAAA5M,GAIAnH,EAAAqL,EAAAO,GACAvC,EAAAkG,EAAA,EACAwE,EAAAA,QAAA,IAAA1I,EAAAO,EAAA,GAEAmI,EAAAhK,EAAA,QACA,IAAA/J,GAAA+T,KAAA,IAAAhK,GAAAA,KAAAhJ,EAAAgK,EAAA,EAAA,EAAA,IACA1B,EAAArJ,GAAAA,IAAAqJ,IAAA,IAAAU,GAAAgK,GAAA,IAAAhK,GAAA,EAAAsB,EAAAO,EAAA,IACA7B,KAAAhJ,EAAAgK,EAAA,EAAA,EAAA,IAEAM,EAAA3K,OAAAkL,EAEAmI,EAGA,OAAA1I,IAAAO,GAAA2D,EAAA,GACAlE,EAAAO,GAAA,EACAA,MACAhM,EACAyL,EAAAoF,QAAA,IAMA,IAAA5E,EAAAR,EAAA3K,QAAA2K,EAAAQ,EAAA,KAAAA,GAGA,IAAA7L,EAAA,EAAAwJ,EAAA,GAAAxJ,EAAA6L,EAAA7L,IAAAwJ,GAAAhC,EAAAmD,OAAAU,EAAArL,IAGA,GAAAkU,EAAA,CACA,GAAA,EAAArI,EACA,GAAA,IAAAxB,GAAA,GAAAA,EAAA,CAEA,IADArK,EAAA,IAAAqK,EAAA,EAAA,IACAwB,EAAAA,EAAA7L,EAAA6L,IAAArC,GAAA,IAEA,IAAAqC,GADAR,EAAAlB,EAAAX,EAAA+F,EAAAlF,IACA3J,QAAA2K,EAAAQ,EAAA,KAAAA,GAGA,IAAA7L,EAAA,EAAAwJ,EAAA,KAAAxJ,EAAA6L,EAAA7L,IAAAwJ,GAAAhC,EAAAmD,OAAAU,EAAArL,SAEAwJ,EAAAA,EAAAmB,OAAA,GAAA,IAAAnB,EAAAiD,MAAA,GAIAjD,EAAAA,GAAA5J,EAAA,EAAA,IAAA,MAAAA,OACA,GAAAA,EAAA,EAAA,CACA,OAAAA,GAAA4J,EAAA,IAAAA,EACAA,EAAA,KAAAA,OAEA,KAAA5J,EAAAiM,EAAA,IAAAjM,GAAAiM,EAAAjM,KAAA4J,GAAA,SACA5J,EAAAiM,IAAArC,EAAAA,EAAAiD,MAAA,EAAA7M,GAAA,IAAA4J,EAAAiD,MAAA7M,SAlEA4J,EAAA0K,EAAA,OAAA,IAsEA1K,GAAA,IAAAa,EAAA,KAAA,GAAAA,EAAA,KAAA,GAAAA,EAAA,KAAA,IAAAb,OA9GAA,EAAA2K,EAAApT,GAiHA,OAAAA,EAAAgK,EAAA,EAAA,IAAAvB,EAAAA,EAKA,SAAA6K,EAAA7J,EAAAqB,GACA,GAAArB,EAAA9J,OAAAmL,EAEA,OADArB,EAAA9J,OAAAmL,GACA,EAyDA,SAAArK,EAAAT,GACA,OAAA,IAAA6B,KAAA7B,GAAAS,MAUA,SAAA+C,EAAAxD,GACA,OAAA,IAAA6B,KAAA7B,GAAAwD,OAWA,SAAAY,EAAApE,GACA,OAAA,IAAA6B,KAAA7B,GAAAoE,QAYA,SAAApC,EAAAhC,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAyB,KAAAsB,GAWA,SAAAM,GAAArD,GACA,OAAA,IAAA6B,KAAA7B,GAAAqD,OAWA,SAAAa,GAAAlE,GACA,OAAA,IAAA6B,KAAA7B,GAAAkE,QAWA,SAAAT,GAAAzD,GACA,OAAA,IAAA6B,KAAA7B,GAAAyD,OAWA,SAAAY,GAAArE,GACA,OAAA,IAAA6B,KAAA7B,GAAAqE,QA6BA,SAAAxD,GAAAkC,EAAA/C,GACA+C,EAAA,IAAAlB,KAAAkB,GACA/C,EAAA,IAAA6B,KAAA7B,GACA,IAAApB,EACA+L,EAAA9I,KAAA+E,UACAoC,EAAAnH,KAAAgF,SACA4G,EAAA9C,EAAA,EAkCA,OA/BA5H,EAAAiH,GAAAhK,EAAAgK,EAIAjH,EAAAX,GAAApC,EAAAoC,GAKApC,EAAAoC,GAAAW,EAAA2C,UACA9G,EAAAoB,EAAAgK,EAAA,EAAAmD,EAAAtL,KAAA8I,EAAA3B,GAAA,IAAAnH,KAAA,IACAmI,EAAAjH,EAAAiH,GAGAjH,EAAAX,GAAApC,EAAA0F,UACA9G,EAAAuO,EAAAtL,KAAA4L,EAAA,GAAAzC,MAAA,KACAhB,EAAAjH,EAAAiH,EAUApL,EAPAoB,EAAAgK,EAAA,GACAnI,KAAA+E,UAAA6G,EACA5L,KAAAgF,SAAA,EACAjI,EAAAiD,KAAA4B,KAAAkI,EAAA5I,EAAA/C,EAAAyN,EAAA,IACAzN,EAAAmN,EAAAtL,KAAA4L,EAAA,GACA5L,KAAA+E,UAAA+D,EACA9I,KAAAgF,SAAAmC,EACAjG,EAAAiH,EAAA,EAAApL,EAAA8C,MAAA1B,GAAApB,EAAA6C,KAAAzB,IAEA6B,KAAA4B,KAAAkI,EAAA5I,EAAA/C,EAAAyN,EAAA,KAvBA7O,EAAAuO,EAAAtL,KAAA4L,EAAA,GAAAzC,MAAA,EAAAhL,EAAAgK,EAAA,IAAA,MACAA,EAAAjH,EAAAiH,EALApL,EAAA,IAAAiD,KAAAgE,KA8BAjH,EAWA,SAAAwM,GAAApL,GACA,OAAA,IAAA6B,KAAA7B,GAAAoL,OAUA,SAAApG,GAAAhF,GACA,OAAAiK,EAAAjK,EAAA,IAAA6B,KAAA7B,GAAAA,EAAAnB,EAAA,EAAA,GAsBA,SAAA2V,GAAAC,GACA,IAAAA,GAAA,iBAAAA,EAAA,MAAAnV,MAAA+H,EAAA,mBACA,IAAApI,EAAAO,EAAAkV,EACAC,GAAA,IAAAF,EAAAG,SACAC,EAAA,CACA,YAAA,EAAArO,EACA,WAAA,EAAA,EACA,YAAAD,EAAA,EACA,WAAA,EAAAA,EACA,OAAA,EAAAA,EACA,QAAAA,EAAA,EACA,SAAA,EAAA,GAGA,IAAAtH,EAAA,EAAAA,EAAA4V,EAAAlV,OAAAV,GAAA,EAEA,GADAO,EAAAqV,EAAA5V,GAAA0V,IAAA9S,KAAArC,GAAAmH,EAAAnH,SACA,KAAAkV,EAAAD,EAAAjV,IAAA,CACA,KAAAiI,EAAAiN,KAAAA,GAAAG,EAAA5V,EAAA,IAAAyV,GAAAA,GAAAG,EAAA5V,EAAA,IACA,MAAAK,MAAAgI,EAAA9H,EAAA,KAAAkV,GADA7S,KAAArC,GAAAkV,EAMA,GADAlV,EAAA,SAAAmV,IAAA9S,KAAArC,GAAAmH,EAAAnH,SACA,KAAAkV,EAAAD,EAAAjV,IAAA,CACA,IAAA,IAAAkV,IAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,EAYA,MAAApV,MAAAgI,EAAA9H,EAAA,KAAAkV,GAXA,GAAAA,EAAA,CACA,GAAA,oBAAAvN,SAAAA,SACAA,OAAA2N,kBAAA3N,OAAA4N,YAGA,MAAAzV,MAAAkI,GAFA3F,KAAArC,IAAA,OAKAqC,KAAArC,IAAA,EAOA,OAAAqC,KAWA,SAAAjB,GAAAZ,GACA,OAAA,IAAA6B,KAAA7B,GAAAY,MAWA,SAAAb,GAAAC,GACA,OAAA,IAAA6B,KAAA7B,GAAAD,OAqMA,SAAAoC,GAAAnC,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAmC,IAAAY,GAWA,SAAA7C,GAAAF,GACA,OAAA,IAAA6B,KAAA7B,GAAAE,MAUA,SAAAgF,GAAAlF,GACA,OAAAiK,EAAAjK,EAAA,IAAA6B,KAAA7B,GAAAA,EAAAnB,EAAA,EAAA,GAWA,SAAAmE,KACA,IAAA/D,EAAAH,EACAC,EAAA,IAAA8C,KAAA,GAIA,IAFAuF,GAAA,EAEAnI,EAAA,EAAAA,EAAA+V,UAAArV,QAEA,IADAb,EAAA,IAAA+C,KAAAmT,UAAA/V,OACAmD,EAMArD,EAAAqD,IACArD,EAAAA,EAAA0C,KAAA3C,EAAAkM,MAAAlM,SAPA,CACA,GAAAA,EAAAkL,EAEA,OADA5C,GAAA,EACA,IAAAvF,KAAA,EAAA,GAEA9C,EAAAD,EAQA,OAFAsI,GAAA,EAEArI,EAAAyD,OASA,SAAAyS,GAAAR,GACA,OAAAA,aAAAtO,GAAAsO,GAAA,qBAAAA,EAAArM,OAAA,EAWA,SAAAkF,GAAAtN,GACA,OAAA,IAAA6B,KAAA7B,GAAAsN,KAcA,SAAA3M,GAAAX,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAW,IAAAoC,GAWA,SAAAmS,GAAAlV,GACA,OAAA,IAAA6B,KAAA7B,GAAAW,IAAA,GAWA,SAAAwU,GAAAnV,GACA,OAAA,IAAA6B,KAAA7B,GAAAW,IAAA,IAUA,SAAAmI,KACA,OAAA0K,EAAA3R,KAAAmT,UAAA,MAUA,SAAAnM,KACA,OAAA2K,EAAA3R,KAAAmT,UAAA,MAYA,SAAA3F,GAAArP,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAqP,IAAAtM,GAYA,SAAAb,GAAAlC,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAkC,IAAAa,GAYA,SAAAV,GAAArC,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAqC,IAAAU,GAYA,SAAAqS,GAAAvK,GACA,IAAAzI,EAAAvD,EAAAyJ,EAAAxJ,EACAG,EAAA,EACAL,EAAA,IAAAiD,KAAA,GACAsH,EAAA,GAOA,QALA,IAAA0B,EAAAA,EAAAhJ,KAAA+E,UACAgC,EAAAiC,EAAA,EAAArE,GAEA8B,EAAArI,KAAA+E,KAAA6F,EAAA7C,GAEAnG,KAAAsF,OAIA,GAAAA,OAAA2N,gBAGA,IAFA1S,EAAA+E,OAAA2N,gBAAA,IAAAO,YAAA/M,IAEArJ,EAAAqJ,GAKA,QAJAxJ,EAAAsD,EAAAnD,IAKAmD,EAAAnD,GAAAkI,OAAA2N,gBAAA,IAAAO,YAAA,IAAA,GAKAlM,EAAAlK,KAAAH,EAAA,QAKA,CAAA,IAAAqI,OAAA4N,YAwBA,MAAAzV,MAAAkI,GAnBA,IAFApF,EAAA+E,OAAA4N,YAAAzM,GAAA,GAEArJ,EAAAqJ,GAMA,QAHAxJ,EAAAsD,EAAAnD,IAAAmD,EAAAnD,EAAA,IAAA,IAAAmD,EAAAnD,EAAA,IAAA,MAAA,IAAAmD,EAAAnD,EAAA,KAAA,KAIAkI,OAAA4N,YAAA,GAAAO,KAAAlT,EAAAnD,IAKAkK,EAAA8F,KAAAnQ,EAAA,KACAG,GAAA,GAIAA,EAAAqJ,EAAA,OA5CA,KAAArJ,EAAAqJ,GAAAa,EAAAlK,KAAA,IAAAgB,KAAAmV,SAAA,EA2DA,IAVA9M,EAAAa,IAAAlK,GACA4L,GAAA7C,EAGAM,GAAAuC,IACA/L,EAAA4I,EAAA,GAAAM,EAAA6C,GACA1B,EAAAlK,IAAAqJ,EAAAxJ,EAAA,GAAAA,GAIA,IAAAqK,EAAAlK,GAAAA,IAAAkK,EAAA+F,MAGA,GAAAjQ,EAAA,EAEAkK,EAAA,CADAtK,EAAA,OAEA,CAIA,IAHAA,GAAA,EAGA,IAAAsK,EAAA,GAAAtK,GAAAmJ,EAAAmB,EAAAgG,QAGA,IAAA7G,EAAA,EAAAxJ,EAAAqK,EAAA,GAAA,IAAArK,EAAAA,GAAA,GAAAwJ,IAGAA,EAAAN,IAAAnJ,GAAAmJ,EAAAM,GAMA,OAHA1J,EAAAC,EAAAA,EACAD,EAAAwD,EAAA+G,EAEAvK,EAYA,SAAAuG,GAAAnF,GACA,OAAAiK,EAAAjK,EAAA,IAAA6B,KAAA7B,GAAAA,EAAAnB,EAAA,EAAAgD,KAAAgF,UAaA,SAAA9E,GAAA/B,GAEA,OADAA,EAAA,IAAA6B,KAAA7B,IACAoC,EAAApC,EAAAoC,EAAA,GAAApC,EAAAgK,EAAA,EAAAhK,EAAAgK,EAAAhK,EAAAgK,GAAAnE,IAWA,SAAAvE,GAAAtB,GACA,OAAA,IAAA6B,KAAA7B,GAAAsB,MAWA,SAAAnB,GAAAH,GACA,OAAA,IAAA6B,KAAA7B,GAAAG,OAWA,SAAAqC,GAAAxC,GACA,OAAA,IAAA6B,KAAA7B,GAAAwC,OAYA,SAAAP,GAAAjC,EAAA+C,GACA,OAAA,IAAAlB,KAAA7B,GAAAiC,IAAAc,GAWA,SAAAE,GAAAjD,GACA,OAAA,IAAA6B,KAAA7B,GAAAiD,MAWA,SAAAa,GAAA9D,GACA,OAAA,IAAA6B,KAAA7B,GAAA8D,OAUA,SAAA4N,GAAA1R,GACA,OAAAiK,EAAAjK,EAAA,IAAA6B,KAAA7B,GAAAA,EAAAnB,EAAA,EAAA,IAKAsH,EA5kBA,SAAAd,EAAAoP,GACA,IAAAxV,EAAAO,EAAAqV,EASA,SAAA1O,EAAAuO,GACA,IAAA7V,EAAAI,EAAAF,EACAiB,EAAA6B,KAGA,KAAA7B,aAAAmG,GAAA,OAAA,IAAAA,EAAAuO,GAOA,GAAAA,aAHA1U,EAAA+J,YAAA5D,GA0BA,OAtBAnG,EAAAgK,EAAA0K,EAAA1K,OAEA5C,GACAsN,EAAAtS,GAAAsS,EAAA7V,EAAAsH,EAAAe,MAGAlH,EAAAnB,EAAAgH,IACA7F,EAAAoC,EAAA,MACAsS,EAAA7V,EAAAsH,EAAAc,MAGAjH,EAAAnB,EAAA,EACAmB,EAAAoC,EAAA,CAAA,KAEApC,EAAAnB,EAAA6V,EAAA7V,EACAmB,EAAAoC,EAAAsS,EAAAtS,EAAAsJ,UAGA1L,EAAAnB,EAAA6V,EAAA7V,EACAmB,EAAAoC,EAAAsS,EAAAtS,EAAAsS,EAAAtS,EAAAsJ,QAAAgJ,EAAAtS,IAQA,GAAA,WAFArD,SAAA2V,GAEA,CACA,GAAA,IAAAA,EAIA,OAHA1U,EAAAgK,EAAA,EAAA0K,EAAA,GAAA,EAAA,EACA1U,EAAAnB,EAAA,OACAmB,EAAAoC,EAAA,CAAA,IAYA,GANApC,EAAAgK,EAFA0K,EAAA,GACAA,GAAAA,GACA,GAEA,EAIAA,MAAAA,GAAAA,EAAA,IAAA,CACA,IAAA7V,EAAA,EAAAI,EAAAyV,EAAA,IAAAzV,EAAAA,GAAA,GAAAJ,IAkBA,YAhBAuI,EACAjB,EAAAe,KAAArI,GACAmB,EAAAnB,EAAAgH,IACA7F,EAAAoC,EAAA,MACAvD,EAAAsH,EAAAc,MACAjH,EAAAnB,EAAA,EACAmB,EAAAoC,EAAA,CAAA,KAEApC,EAAAnB,EAAAA,EACAmB,EAAAoC,EAAA,CAAAsS,KAGA1U,EAAAnB,EAAAA,EACAmB,EAAAoC,EAAA,CAAAsS,KAMA,OAAA,EAAAA,GAAA,GACAA,IAAA1U,EAAAgK,EAAAnE,KACA7F,EAAAnB,EAAAgH,SACA7F,EAAAoC,EAAA,OAIA6R,EAAAjU,EAAA0U,EAAApP,YAEA,GAAA,UAAAvG,EACA,MAAAO,MAAAgI,EAAAoN,GAWA,OAPA,KAAAA,EAAAL,WAAA,IACAK,EAAAA,EAAAhJ,MAAA,GACA1L,EAAAgK,GAAA,GAEAhK,EAAAgK,EAAA,EAGAlC,EAAAyN,KAAAb,GAAAT,EAAAjU,EAAA0U,GAtvBA,SAAA1U,EAAAyI,GACA,IAAA+F,EAAA5D,EAAA4K,EAAAvW,EAAAwW,EAAA3K,EAAAtL,EAAA8K,EAAAyE,EAEA,GAAA,aAAAtG,GAAA,QAAAA,EAIA,OAHAA,IAAAzI,EAAAgK,EAAAnE,KACA7F,EAAAnB,EAAAgH,IACA7F,EAAAoC,EAAA,KACApC,EAGA,GAAA4H,EAAA2N,KAAA9M,GACA+F,EAAA,GACA/F,EAAAA,EAAAiN,mBACA,GAAA/N,EAAA4N,KAAA9M,GACA+F,EAAA,MACA,CAAA,IAAA3G,EAAA0N,KAAA9M,GAGA,MAAAnJ,MAAAgI,EAAAmB,GAFA+F,EAAA,EAkCA,IAhBAiH,EAAA,IADAxW,GAPAwJ,EAFA,GAFAxJ,EAAAwJ,EAAA0L,OAAA,QAGA3U,GAAAiJ,EAAAiD,MAAAzM,EAAA,GACAwJ,EAAA2L,UAAA,EAAAnV,IAEAwJ,EAAAiD,MAAA,IAKA/B,QAAA,MAEAiB,EAAA5K,EAAA+J,YAEA0L,IAGAxW,GADA6L,GADArC,EAAAA,EAAAyL,QAAA,IAAA,KACAvU,QACAV,EAGAuW,EAAAnE,EAAAzG,EAAA,IAAAA,EAAA4D,GAAAvP,EAAA,EAAAA,IAOAA,EAHA8P,GADAzE,EAAAlB,EAAAX,EAAA+F,EAAAzG,IACApI,OAAA,EAGA,IAAA2K,EAAArL,KAAAA,EAAAqL,EAAA4E,MACA,OAAAjQ,EAAA,EAAA,IAAA2L,EAAA,EAAA5K,EAAAgK,IACAhK,EAAAnB,EAAAuQ,EAAA9E,EAAAyE,GACA/O,EAAAoC,EAAAkI,EACAlD,GAAA,EAQAqO,IAAAzV,EAAA2L,EAAA3L,EAAAwV,EAAA,EAAA1K,IAGAtL,IAAAQ,EAAAA,EAAAgL,MAAA/K,KAAAQ,IAAAjB,GAAA,GAAAS,KAAAoC,IAAA,EAAA7C,GAAA2G,EAAA9D,IAAA,EAAA7C,KACA4H,GAAA,EAEApH,GAkrBA2V,CAAA3V,EAAA0U,GA0DA,GAvDAvO,EAAArE,UAAAqG,EAEAhC,EAAAyP,SAAA,EACAzP,EAAA0P,WAAA,EACA1P,EAAA2P,WAAA,EACA3P,EAAA4P,YAAA,EACA5P,EAAA6P,cAAA,EACA7P,EAAA8P,gBAAA,EACA9P,EAAA+P,gBAAA,EACA/P,EAAAgQ,gBAAA,EACAhQ,EAAAiQ,iBAAA,EACAjQ,EAAAkQ,OAAA,EAEAlQ,EAAAqO,OAAArO,EAAAmQ,IAAA9B,GACArO,EAAAd,MAAAA,EACAc,EAAA2B,UAAAmN,GAEA9O,EAAA1F,IAAAA,EACA0F,EAAA3C,KAAAA,EACA2C,EAAA/B,MAAAA,EACA+B,EAAAnE,IAAAA,EACAmE,EAAA9C,KAAAA,GACA8C,EAAAjC,MAAAA,GACAiC,EAAA1C,KAAAA,GACA0C,EAAA9B,MAAAA,GACA8B,EAAAtF,MAAAA,GACAsF,EAAAiF,KAAAA,GACAjF,EAAAnB,KAAAA,GACAmB,EAAAvF,IAAAA,GACAuF,EAAApG,KAAAA,GACAoG,EAAAhE,IAAAA,GACAgE,EAAAjG,IAAAA,GACAiG,EAAAjB,MAAAA,GACAiB,EAAAnD,MAAAA,GACAmD,EAAAmH,GAAAA,GACAnH,EAAAxF,IAAAA,GACAwF,EAAAgP,MAAAA,GACAhP,EAAA+O,KAAAA,GACA/O,EAAA2C,IAAAA,GACA3C,EAAA0C,IAAAA,GACA1C,EAAAkJ,IAAAA,GACAlJ,EAAAjE,IAAAA,GACAiE,EAAA9D,IAAAA,GACA8D,EAAAiP,OAAAA,GACAjP,EAAAhB,MAAAA,GACAgB,EAAApE,KAAAA,GACAoE,EAAA7E,IAAAA,GACA6E,EAAAhG,KAAAA,GACAgG,EAAA3D,KAAAA,GACA2D,EAAAlE,IAAAA,GACAkE,EAAAlD,IAAAA,GACAkD,EAAArC,KAAAA,GACAqC,EAAAuL,MAAAA,QAEA,IAAA+C,IAAAA,EAAA,IACAA,IACA,IAAAA,EAAAG,SAEA,IADAC,EAAA,CAAA,YAAA,WAAA,WAAA,WAAA,OAAA,OAAA,SAAA,UACA5V,EAAA,EAAAA,EAAA4V,EAAAlV,QAAA8U,EAAA8B,eAAA/W,EAAAqV,EAAA5V,QAAAwV,EAAAjV,GAAAqC,KAAArC,IAMA,OAFA2G,EAAAqO,OAAAC,GAEAtO,EA4ZAd,CAAAsB,IAEA,QAAAR,EAAAA,QAAAA,EAGAO,EAAA,IAAAP,EAAAO,GACA9D,EAAA,IAAAuD,EAAAvD,GAOA,mBAAAkD,QAAAA,OAAA0Q,IACA1Q,OAAA,WACA,OAAAK,SAIA,IAAAtG,IAAAA,GAAAJ,SACA,mBAAAgX,QAAA,iBAAAA,OAAAC,WACAvO,EAAAsO,OAAAE,IAAA,+BAAAxO,EAAA7C,SACA6C,EAAAsO,OAAAG,aAAA,WAGA/W,GAAAJ,QAAA0G,IAIAD,IACAA,EAAA,oBAAA2Q,MAAAA,MAAAA,KAAAA,MAAAA,KAAAA,KAAAC,QAGAzQ,EAAAH,EAAAC,QACAA,EAAAE,WAAA,WAEA,OADAH,EAAAC,QAAAE,EACAF,GAGAD,EAAAC,QAAAA,GA9vJA,CAgwJAtE,8BChwJA,aAKA,IAAAkV,EAAAhR,OAAAiR,QAAA,SAAAC,GAAA,IAAA,IAAAhY,EAAA,EAAAA,EAAA+V,UAAArV,OAAAV,IAAA,CAAA,IAAAiY,EAAAlC,UAAA/V,GAAA,IAAA,IAAAkY,KAAAD,EAAAnR,OAAAjE,UAAAyU,eAAA7W,KAAAwX,EAAAC,KAAAF,EAAAE,GAAAD,EAAAC,IAAA,OAAAF,GAEAG,EAAA,CACAC,IAAA,MACAC,IAAA,MACAC,KAAA,oBACAC,IAAA,MACAC,EAAA,MACAC,IAAA,MACAC,IAAA,MACAC,IAAA,sBACAC,EAAA,MACAC,IAAA,sBAEAC,EAAA,CACAC,IAAA,OACAC,IAAA,QACAC,IAAA,IACAC,KAAA,YACAC,OAAA,cACAC,KAAA,eAGAC,EAAA,SAAAlB,EAAAW,GACA,OAAAhB,EAAA,GAAAK,EAAAW,IAWAlY,EAAAJ,QAAA,SAAAgJ,GAmCA,IAlCA,IAAA8P,EAAA,EAAAvD,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAA,GACAwD,EAAAD,EAAAE,mBACAA,OAAAvX,IAAAsX,GAAAA,EACAE,EAAAH,EAAAI,YACAA,OAAAzX,IAAAwX,EAAAJ,EAAAI,EAEAE,EAAA5E,OAAAvL,GACAoQ,EAAA,GAEAC,EAAAH,EAAA5B,EAAA,GAAAK,GAAAqB,EAAA1B,EAAA,GAAAgB,GAAA,IACAgB,EAAAhT,OAAAiT,KAAAF,GAMAG,EAAA,WACA,IAAAC,GAAA,EACAH,EAAAI,QAAA,SAAAhC,EAAAiC,GACAF,GAGAN,EAAAjZ,QAAAwX,EAAAxX,QAAAiZ,EAAAlN,MAAA,EAAAyL,EAAAxX,UAAAwX,IACA0B,GAAAC,EAAAC,EAAAK,IACAR,EAAAA,EAAAlN,MAAAyL,EAAAxX,OAAAiZ,EAAAjZ,QACAuZ,GAAA,KAGAA,IACAL,GAAAD,EAAAlN,MAAA,EAAA,GACAkN,EAAAA,EAAAlN,MAAA,EAAAkN,EAAAjZ,UAIAiZ,GACAK,IAEA,OAAAJ,4BCvCA,SAAA/Y,GAEA,aAKA,IAGAqI,EAAA,CACA6B,EAAA,EACAlL,EAAA,EACAsD,EAAA,GAGA,SAAAiX,EAAAjR,GAEA,SAAAkR,IACA,IAAA7U,EAAAnF,MAAAia,MAAA1X,KAAAmT,WACAvQ,EAAA,KAAA5C,KAAA,KAAAuG,EACAvG,KAAA,MAAA4C,EAAA,MACA5C,KAAA,QAAA4C,EAAA,QAQA,SAAA+U,KAIA,OAHAA,EAAA1X,UAAAxC,MAAAwC,UACAwX,EAAAxX,UAAA,IAAA0X,EAEAF,EAGA,IAAAG,EAAAC,EAAA,eAAAL,EAAA,kBACAM,EAAAD,EAAA,iBAAAL,EAAA,oBAEA,SAAArC,EAAAlY,EAAAkL,GAKA,OAHArI,MAAA7C,EAAA8a,SAAA9a,EAAA,MACA+a,IAEA/a,EAAAkL,EAGA,SAAA6P,IACA,MAAA,IAAAF,EAGA,IAAA7Y,EAAA,SAAAgZ,EAAAC,GAEA,IAOAC,EAPAlb,EAAA,EAAAsD,EAAA,EAAA4H,EAAA,EACA0K,EAAA,EAAAhM,EAAA,EAAA1I,EAAA,EAAA+C,EAAA,EAAAhC,EAAA,EAEAkZ,EAAA,EAAAC,EAAA,EACAC,EAAA,EAAAC,EAAA,EAKA,GAAAN,MAAAA,QAEA,QAAA5Y,IAAA6Y,EAGA/P,GAFAlL,EAAAgb,IACA1X,EAAA2X,QAGA,cAAAD,GAEA,IAAA,SAEA,MAAAA,GAAA,MAAAA,GACAhb,EAAAgb,EAAA,EACA1X,EAAA0X,EAAA,EACA,MAAAA,IACAhb,GAAAgb,EAAA,IACA,KAAAA,GACAhb,EAAAgb,EAAA,GACA,KAAAA,IACA1X,EAAA0X,EAAA,KAEAD,IAEA7P,EAAAlL,EAAAsD,EACA,MAEA,IAAA,SAOA,GALA0X,EAAA,IAEAA,IADA9P,EAAA8P,IAIAA,EAAA,GAAA,EACAhb,EAAAgb,OACA,GAAA,EAAAA,EAAA,CAUA,IARA,GAAAA,IAEAA,GADA/Y,EAAAd,KAAAoC,IAAA,GAAApC,KAAAiF,MAAA,EAAAjF,KAAAU,IAAAmZ,GAAA7Z,KAAAyG,QAOAwT,GAhDA,KAgDAE,GAhDA,KAgDA,CAGA,GAAAN,KAFAE,GAAAC,EAAAE,IAAAD,EAAAE,IAEA,CAGAhY,EAFA8X,EAAAE,GApDA,KAqDAtb,EAAAmb,EAAAE,EACAD,EAAAE,GACAF,EAAAE,GACAtb,EAAAqb,EACAC,IAEAtb,EAAAmb,EACAC,GAEA,MAIAF,EAAAF,GACAG,GAAAE,EACAD,GAAAE,IAEAD,GAAAF,EACAG,GAAAF,GAKA9X,EA5EA,IA0EA8X,GACApb,EAAAqb,EACAC,IAEAtb,EAAAmb,EACAC,GAIApb,GAAAiC,OACAY,MAAAmY,IAAAnY,MAAAoY,MACA3X,EAAAtD,EAAA+G,KAEA,MAEA,IAAA,SAgDA,GA5CA,QAFAqU,EAAAJ,EAAAtY,MAAA,YAGAqY,IAEA,MAAAK,EAAAD,IACAjQ,GAAA,EACAiQ,KACA,MAAAC,EAAAD,IACAA,IAGAC,EAAAva,SAAAsa,EAAA,EACAvR,EAAAsO,EAAAkD,EAAAD,KAAAjQ,GACA,MAAAkQ,EAAAD,EAAA,IAAA,MAAAC,EAAAD,IAEA,MAAAC,EAAAD,KACAvF,EAAAsC,EAAAkD,EAAAD,KAAAjQ,OAEAiQ,EAGA,IAAAC,EAAAva,QAAA,MAAAua,EAAAD,EAAA,IAAA,MAAAC,EAAAD,EAAA,IAAA,MAAAC,EAAAD,EAAA,IAAA,MAAAC,EAAAD,EAAA,MACAvR,EAAAsO,EAAAkD,EAAAD,GAAAjQ,GACAjH,EAAA9C,KAAAoC,IAAA,GAAA6X,EAAAD,GAAAta,QACAsa,MAIA,MAAAC,EAAAD,IAAA,MAAAC,EAAAD,EAAA,IAAA,MAAAC,EAAAD,IAAA,MAAAC,EAAAD,EAAA,MACAja,EAAAgX,EAAAkD,EAAAD,EAAA,GAAAjQ,GACAjJ,EAAAd,KAAAoC,IAAA,GAAA6X,EAAAD,EAAA,GAAAta,QAAA,EACAsa,GAAA,IAGA,MAAAC,EAAAD,EAAA,IAAA,MAAAC,EAAAD,EAAA,IACAvR,EAAAsO,EAAAkD,EAAAD,GAAAjQ,GACAjH,EAAAiU,EAAAkD,EAAAD,EAAA,GAAA,GACAA,GAAA,GACA,MAAAC,EAAAD,EAAA,IAAA,MAAAC,EAAAD,EAAA,KACAvF,EAAAsC,EAAAkD,EAAAD,GAAAjQ,GACAtB,EAAAsO,EAAAkD,EAAAD,EAAA,GAAAjQ,GACAjH,EAAAiU,EAAAkD,EAAAD,EAAA,GAAA,GACAA,GAAA,GAGAC,EAAAva,QAAAsa,EAAA,CAEAjQ,EACAlL,EAAAkB,GAFAoC,EAAAW,EAAAhC,GAEA2T,EAAA3T,EAAA2H,EACA,MAKA,QACAmR,IAGA,GAAA,IAAAzX,EACA,MAAA,IAAAqX,EAGAtR,EAAA,EAAA6B,EAAA,GAAA,EAAA,EACA7B,EAAA,EAAAlI,KAAAQ,IAAA3B,GACAqJ,EAAA,EAAAlI,KAAAQ,IAAA2B,IAgEA,SAAAiY,EAAAhb,EAAAkB,GAEA,IAAAlB,EACA,OAAAkB,EACA,IAAAA,EACA,OAAAlB,EAEA,OAAA,CAEA,KADAA,GAAAkB,GAEA,OAAAA,EAEA,KADAA,GAAAlB,GAEA,OAAAA,GAWA,SAAAqa,EAAAra,EAAAkB,GAEA,KAAAsB,gBAAA6X,GACA,OAAA,IAAAA,EAAAra,EAAAkB,GAGAO,EAAAzB,EAAAkB,GAGAlB,EADAqa,EAAA,OACAW,EAAAlS,EAAA,EAAAA,EAAA,GAEA,EAGAtG,KAAA,EAAAsG,EAAA,EACAtG,KAAA,EAAAsG,EAAA,EAAA9I,EACAwC,KAAA,EAAAsG,EAAA,EAAA9I,EAOAqa,EAAA,OAAA,EAEAA,EAAA5X,UAAA,CAEAkI,EAAA,EACAlL,EAAA,EACAsD,EAAA,EAOA3B,IAAA,WAEA,OAAA,IAAAiZ,EAAA7X,KAAA,EAAAA,KAAA,IAQAkD,IAAA,WAEA,OAAA,IAAA2U,GAAA7X,KAAA,EAAAA,KAAA,EAAAA,KAAA,IAQAG,IAAA,SAAA3C,EAAAkB,GAGA,OADAO,EAAAzB,EAAAkB,GACA,IAAAmZ,EACA7X,KAAA,EAAAA,KAAA,EAAAsG,EAAA,EAAAA,EAAA,EAAAtG,KAAA,EAAAsG,EAAA,EACAtG,KAAA,EAAAsG,EAAA,IASAlG,IAAA,SAAA5C,EAAAkB,GAGA,OADAO,EAAAzB,EAAAkB,GACA,IAAAmZ,EACA7X,KAAA,EAAAA,KAAA,EAAAsG,EAAA,EAAAA,EAAA,EAAAtG,KAAA,EAAAsG,EAAA,EACAtG,KAAA,EAAAsG,EAAA,IASAjG,IAAA,SAAA7C,EAAAkB,GAGA,OADAO,EAAAzB,EAAAkB,GACA,IAAAmZ,EACA7X,KAAA,EAAAsG,EAAA,EAAAtG,KAAA,EAAAsG,EAAA,EACAtG,KAAA,EAAAsG,EAAA,IASAhG,IAAA,SAAA9C,EAAAkB,GAGA,OADAO,EAAAzB,EAAAkB,GACA,IAAAmZ,EACA7X,KAAA,EAAAsG,EAAA,EAAAtG,KAAA,EAAAsG,EAAA,EACAtG,KAAA,EAAAsG,EAAA,IASA9C,MAAA,WACA,OAAA,IAAAqU,EAAA7X,OAQAwN,IAAA,SAAAhQ,EAAAkB,GAEA,OAAAoB,MAAAE,KAAA,IAAAF,MAAAE,KAAA,GACA,IAAA6X,EAAA7T,UAGA3E,IAAA7B,EACA,IAAAqa,EAAA7X,KAAA,EAAAA,KAAA,EAAAA,KAAA,EAAA,IAGAf,EAAAzB,EAAAkB,GACA,IAAA4H,EAAA,GAAA,IAAAtG,KAAA,GACA6X,EAAA,EAAA,GAiBA,IAAAA,EACA7X,KAAA,GAAAsG,EAAA,EAAAtG,KAAA,IAAAsG,EAAA,EAAAtG,KAAA,GACAsG,EAAA,EAAAtG,KAAA,KASAwY,IAAA,SAAAhb,EAAAkB,GAMA,OAJAO,EAAAzB,EAAAkB,GAIA,IAAAmZ,EAAAW,EAAAlS,EAAA,EAAAtG,KAAA,GAAAwY,EAAAlS,EAAA,EAAAtG,KAAA,GAAAsG,EAAA,EAAAtG,KAAA,IAQAyY,IAAA,SAAAjb,EAAAkB,GAMA,OAJAO,EAAAzB,EAAAkB,GAIA,IAAA4H,EAAA,GAAA,IAAAtG,KAAA,EACA,IAAA6X,EAEA,IAAAA,EAAAvR,EAAA,EAAAtG,KAAA,EAAAwY,EAAAlS,EAAA,EAAAtG,KAAA,GAAAwY,EAAAlS,EAAA,EAAAtG,KAAA,KAQAmD,KAAA,SAAAC,GAIA,OAFAA,EAAAhF,KAAAoC,IAAA,GAAA4C,GAAA,GAEAtD,MAAAE,KAAA,IAAAF,MAAAE,KAAA,GACA,IAAA6X,EAAA7T,KAEA,IAAA6T,EAAAzZ,KAAA+E,KAAAC,EAAApD,KAAA,EAAAA,KAAA,EAAAA,KAAA,GAAAoD,IAQAC,MAAA,SAAAD,GAIA,OAFAA,EAAAhF,KAAAoC,IAAA,GAAA4C,GAAA,GAEAtD,MAAAE,KAAA,IAAAF,MAAAE,KAAA,GACA,IAAA6X,EAAA7T,KAEA,IAAA6T,EAAAzZ,KAAAiF,MAAAD,EAAApD,KAAA,EAAAA,KAAA,EAAAA,KAAA,GAAAoD,IAQAE,MAAA,SAAAF,GAIA,OAFAA,EAAAhF,KAAAoC,IAAA,GAAA4C,GAAA,GAEAtD,MAAAE,KAAA,IAAAF,MAAAE,KAAA,GACA,IAAA6X,EAAA7T,KAEA,IAAA6T,EAAAzZ,KAAAkF,MAAAF,EAAApD,KAAA,EAAAA,KAAA,EAAAA,KAAA,GAAAoD,IAQAJ,QAAA,WAEA,OAAA,IAAA6U,EAAA7X,KAAA,EAAAA,KAAA,EAAAA,KAAA,IAQAQ,IAAA,SAAAgJ,GAEA,OAAAA,EAAA,EACA,IAAAqO,EAAAzZ,KAAAoC,IAAAR,KAAA,EAAAA,KAAA,GAAAwJ,GAAApL,KAAAoC,IAAAR,KAAA,GAAAwJ,IAEA,IAAAqO,EAAAzZ,KAAAoC,IAAAR,KAAA,EAAAA,KAAA,EAAAwJ,GAAApL,KAAAoC,IAAAR,KAAA,EAAAwJ,KASAjG,OAAA,SAAA/F,EAAAkB,GAGA,OADAO,EAAAzB,EAAAkB,GACAsB,KAAA,EAAAA,KAAA,EAAAsG,EAAA,GAAAA,EAAA,EAAAA,EAAA,EAAAtG,KAAA,GAQAgQ,QAAA,SAAAxS,EAAAkB,GAEAO,EAAAzB,EAAAkB,GACA,IAAAxB,EAAA8C,KAAA,EAAAA,KAAA,EAAAsG,EAAA,EAAAA,EAAA,EAAAA,EAAA,EAAAtG,KAAA,EACA,OAAA,EAAA9C,IAAAA,EAAA,IAGAwb,SAAA,SAAAC,GAIA,GAAA7Y,MAAAE,KAAA,IAAAF,MAAAE,KAAA,GACA,OAAAA,KAGA,IAAA4Y,EAAA5Y,KAAA,MAAA,cAIA,SAAA6Y,EAAArb,GACA,OAAA,IAAAA,EAAAM,OACA,IAAA+Z,EAAAra,EAAA,IACAqb,EAAArb,EAAAqM,MAAA,IAAA,UAAA,IAAArM,EAAA,IALAmb,EAAAA,GAAA,KAQA,IAAA,IAAAvb,EAAA,EAAAA,EAAAwb,EAAA9a,OAAAV,IAAA,CACA,IAAAwD,EAAAiY,EAAAD,EAAA/O,MAAA,EAAAzM,EAAA,IACA,GAAAwD,EAAA,IAAAZ,KAAA,OAAA,MAAA4D,UAAA+U,EACA,OAAA/X,EAAA,IAAAZ,KAAA,GAGA,OAAAA,MAQA8Y,UAAA,SAAAtb,EAAAkB,GAGA,OADAO,EAAAzB,EAAAkB,OACA4H,EAAA,EAAAtG,KAAA,IAAAA,KAAA,EAAAsG,EAAA,GAAAA,EAAA,EAAAtG,KAAA,KAQA4D,QAAA,WAEA,OAAA5D,KAAA,EAAAA,KAAA,EAAAA,KAAA,GAQA0O,WAAA,SAAAqK,GAEA,IAAAC,EAAApS,EAAA,GACA3J,EAAA+C,KAAA,EACAO,EAAAP,KAAA,EAmBA,OAlBAA,KAAA,EAAA,IACA4G,GAAA,KAGA,IAAArG,EACAqG,GAAA3J,GAGA8b,GAAA,GAAAC,EAAA5a,KAAAiF,MAAApG,EAAAsD,MACAqG,GAAAoS,EACApS,GAAA,IACA3J,GAAAsD,GAGAqG,GAAA3J,EACA2J,GAAA,IACAA,GAAArG,GAEAqG,GAQAqS,QAAA,SAAAF,GAEA,IAAAC,EAAApS,EAAA,GACA3J,EAAA+C,KAAA,EACAO,EAAAP,KAAA,EAoBA,OAnBAA,KAAA,EAAA,IACA4G,GAAA,KAGA,IAAArG,EACAqG,GAAA3J,GAGA8b,GAAA,GAAAC,EAAA5a,KAAAiF,MAAApG,EAAAsD,MACAqG,GAAAoS,EACA/b,GAAAsD,GAGAqG,GAAA,UACAA,GAAA3J,EACA2J,GAAA,KACAA,GAAArG,EACAqG,GAAA,KAEAA,GAQAsS,YAAA,WAEA,IAAAhc,EACAM,EAAAwC,KAAA,EACAtB,EAAAsB,KAAA,EACAsC,EAAA,GAEA,GAAAxC,MAAAE,KAAA,IAAAF,MAAAE,KAAA,GACA,OAAAsC,EAGA,KACAA,EAAA8K,KAAAhP,KAAAiF,MAAA7F,EAAAkB,IACAxB,EAAAM,EAAAkB,EACAlB,EAAAkB,EACAA,EAAAxB,EACA,IAAAM,IAEA,OAAA8E,GAQAmB,SAAA,SAAA0V,GAEA,IAAAC,EACAC,EAAArZ,KAAA,EACAuY,EAAAvY,KAAA,EAEA,GAAAF,MAAAuZ,IAAAvZ,MAAAyY,GACA,MAAA,MAGAV,EAAA,SAEAwB,GADAD,EAAAZ,EAAAa,EAAAd,GAEAA,GAAAa,GAGAD,EAAAA,GAAA,GAEA,IAAAG,EA/fA,SAAArc,EAAAsD,GAEA,KAAAA,EAAA,GAAA,EACAA,GAAA,GAGA,KAAAA,EAAA,GAAA,EACAA,GAAA,GAGA,GAAA,IAAAA,EACA,OAAA,EAUA,IAHA,IAAAkQ,EAAA,GAAAlQ,EACArD,EAAA,EAEA,IAAAuT,EAAAvT,IAGA,GAFAuT,EAAA,GAAAA,EAAAlQ,EAvPA,IAyPArD,EACA,OAAA,EAEA,OAAAA,EAoeAqc,CAAAF,EAAAd,GACAiB,EAjeA,SAAAvc,EAAAsD,EAAA0I,GAKA,IAHA,IAAAwQ,EAAA,EACAC,EA/CA,SAAAhb,EAAA1B,EAAAwM,GAGA,IADA,IAAAzM,EAAA,EACA,EAAAC,EAAA0B,EAAAA,EAAAA,EAAA8K,EAAAxM,IAAA,EAEA,EAAAA,IACAD,EAAAA,EAAA2B,EAAA8K,GAGA,OAAAzM,EAsCA4c,CAAA,GAAA1Q,EAAA1I,GAEArD,EAAA,EAAAA,EAAA,IAAAA,IAAA,CAGA,GAAAuc,IAAAC,EACA,OAAAxc,EAEAuc,EAAA,GAAAA,EAAAlZ,EACAmZ,EAAA,GAAAA,EAAAnZ,EAEA,OAAA,EAmdAqZ,CAAAP,EAAAd,EAAAe,GAEA1S,GAAA,IAAA5G,KAAA,EAAA,IAAA,GAUA,GARA4G,GAAAyS,EAAAd,EAAA,EAEAc,GAAAd,GACAc,GAAA,MAGAzS,GAAA,KAEA0S,EAAA,CAEA,IAAA,IAAAlc,EAAAoc,EAAApc,KACAwJ,GAAAyS,EAAAd,EAAA,EACAc,GAAAd,EACAc,GAAA,GAEAzS,GAAA,IACA,IAAAxJ,EAAAkc,EAAAlc,KACAwJ,GAAAyS,EAAAd,EAAA,EACAc,GAAAd,EACAc,GAAA,GAEAzS,GAAA,SAEA,IAAAxJ,EAAA+b,EAAAE,GAAAjc,KACAwJ,GAAAyS,EAAAd,EAAA,EACAc,GAAAd,EACAc,GAAA,GAGA,OAAAzS,IAIA,mBAAA3C,QAAAA,OAAA,IACAA,OAAA,GAAA,WACA,OAAA4T,IAEA,iBAAAja,GACAsG,OAAAC,eAAAvG,EAAA,aAAA,CAAAwG,OAAA,KACAyT,EAAA,QAAAA,GACA,SAAAA,EACA7Z,EAAA,QAAA6Z,GAEA5Z,EAAA,SAAA4Z,EAvxBA,CA0xBA7X,8BCj0BA,cAEA,WAKA,SAAA6Z,EAAAC,GACA,OAAA,IAAAC,QAAA,SAAAC,EAAAC,GACAH,EAAAI,UAAA,WACAF,EAAAF,EAAA9C,SAGA8C,EAAAK,QAAA,WACAF,EAAAH,EAAAM,UAKA,SAAAC,EAAAzH,EAAA0H,EAAA1I,GACA,IAAAkI,EACAnc,EAAA,IAAAoc,QAAA,SAAAC,EAAAC,GAEAJ,EADAC,EAAAlH,EAAA0H,GAAA5C,MAAA9E,EAAAhB,IACA2I,KAAAP,EAAAC,KAIA,OADAtc,EAAAmc,QAAAA,EACAnc,EAWA,SAAA6c,EAAAC,EAAAC,EAAAC,GACAA,EAAArD,QAAA,SAAAsD,GACA1W,OAAAC,eAAAsW,EAAAxa,UAAA2a,EAAA,CACAC,IAAA,WACA,OAAA7a,KAAA0a,GAAAE,IAEAnG,IAAA,SAAAqG,GACA9a,KAAA0a,GAAAE,GAAAE,OAMA,SAAAC,EAAAN,EAAAC,EAAAM,EAAAL,GACAA,EAAArD,QAAA,SAAAsD,GACAA,KAAAI,EAAA/a,YACAwa,EAAAxa,UAAA2a,GAAA,WACA,OAAAP,EAAAra,KAAA0a,GAAAE,EAAAzH,eAKA,SAAA8H,EAAAR,EAAAC,EAAAM,EAAAL,GACAA,EAAArD,QAAA,SAAAsD,GACAA,KAAAI,EAAA/a,YACAwa,EAAAxa,UAAA2a,GAAA,WACA,OAAA5a,KAAA0a,GAAAE,GAAAlD,MAAA1X,KAAA0a,GAAAvH,eAKA,SAAA+H,EAAAT,EAAAC,EAAAM,EAAAL,GACAA,EAAArD,QAAA,SAAAsD,GACAA,KAAAI,EAAA/a,YACAwa,EAAAxa,UAAA2a,GAAA,WACA,OA3CA,SAAAhI,EAAA0H,EAAA1I,GACA,IAAAjU,EAAA0c,EAAAzH,EAAA0H,EAAA1I,GACA,OAAAjU,EAAA4c,KAAA,SAAAnW,GACA,GAAAA,EACA,OAAA,IAAA+W,EAAA/W,EAAAzG,EAAAmc,WAuCAsB,CAAApb,KAAA0a,GAAAE,EAAAzH,eAKA,SAAAkI,EAAA9D,GACAvX,KAAAsb,OAAA/D,EAuBA,SAAA4D,EAAAI,EAAAzB,GACA9Z,KAAAwb,QAAAD,EACAvb,KAAAyb,SAAA3B,EA+BA,SAAA4B,EAAAC,GACA3b,KAAA4b,OAAAD,EAuCA,SAAAE,EAAAC,GACA9b,KAAA+b,IAAAD,EACA9b,KAAAgc,SAAA,IAAAjC,QAAA,SAAAC,EAAAC,GACA6B,EAAAG,WAAA,WACAjC,KAEA8B,EAAA3B,QAAA,WACAF,EAAA6B,EAAA1B,QAEA0B,EAAAI,QAAA,WACAjC,EAAA6B,EAAA1B,UAkBA,SAAA+B,EAAAC,EAAAC,EAAAC,GACAtc,KAAAuc,IAAAH,EACApc,KAAAqc,WAAAA,EACArc,KAAAsc,YAAA,IAAAT,EAAAS,GAkBA,SAAAE,EAAAJ,GACApc,KAAAuc,IAAAH,EA/IA5B,EAAAa,EAAA,SAAA,CACA,OACA,UACA,aACA,WAGAN,EAAAM,EAAA,SAAAoB,SAAA,CACA,MACA,SACA,SACA,aACA,UAGAvB,EAAAG,EAAA,SAAAoB,SAAA,CACA,aACA,kBAQAjC,EAAAW,EAAA,UAAA,CACA,YACA,MACA,aACA,UAGAJ,EAAAI,EAAA,UAAAuB,UAAA,CACA,SACA,WAIA,CAAA,UAAA,WAAA,sBAAApF,QAAA,SAAAqF,GACAA,KAAAD,UAAAzc,YACAkb,EAAAlb,UAAA0c,GAAA,WACA,IAAApB,EAAAvb,KACA4R,EAAAuB,UACA,OAAA4G,QAAAC,UAAAO,KAAA,WAEA,OADAgB,EAAAC,QAAAmB,GAAAjF,MAAA6D,EAAAC,QAAA5J,GACAiI,EAAA0B,EAAAE,UAAAlB,KAAA,SAAAnW,GACA,GAAAA,EACA,OAAA,IAAA+W,EAAA/W,EAAAmX,EAAAE,kBAUAC,EAAAzb,UAAA2c,YAAA,WACA,OAAA,IAAAvB,EAAArb,KAAA4b,OAAAgB,YAAAlF,MAAA1X,KAAA4b,OAAAzI,aAGAuI,EAAAzb,UAAAsX,MAAA,WACA,OAAA,IAAA8D,EAAArb,KAAA4b,OAAArE,MAAAG,MAAA1X,KAAA4b,OAAAzI,aAGAqH,EAAAkB,EAAA,SAAA,CACA,OACA,UACA,aACA,kBAGAX,EAAAW,EAAA,SAAAmB,eAAA,CACA,MACA,MACA,SACA,QACA,MACA,SACA,SACA,aACA,UAGA3B,EAAAQ,EAAA,SAAAmB,eAAA,CACA,aACA,kBAGA5B,EAAAS,EAAA,SAAAmB,eAAA,CACA,gBAkBAhB,EAAA5b,UAAA6c,YAAA,WACA,OAAA,IAAApB,EAAA1b,KAAA+b,IAAAe,YAAApF,MAAA1X,KAAA+b,IAAA5I,aAGAqH,EAAAqB,EAAA,MAAA,CACA,mBACA,SAGAZ,EAAAY,EAAA,MAAAkB,eAAA,CACA,UASAZ,EAAAlc,UAAA+c,kBAAA,WACA,OAAA,IAAAtB,EAAA1b,KAAAuc,IAAAS,kBAAAtF,MAAA1X,KAAAuc,IAAApJ,aAGAqH,EAAA2B,EAAA,MAAA,CACA,OACA,UACA,qBAGAlB,EAAAkB,EAAA,MAAAc,YAAA,CACA,oBACA,UAOAT,EAAAvc,UAAAqc,YAAA,WACA,OAAA,IAAAT,EAAA7b,KAAAuc,IAAAD,YAAA5E,MAAA1X,KAAAuc,IAAApJ,aAGAqH,EAAAgC,EAAA,MAAA,CACA,OACA,UACA,qBAGAvB,EAAAuB,EAAA,MAAAS,YAAA,CACA,UAKA,CAAA,aAAA,iBAAA3F,QAAA,SAAA4F,GACA,CAAAxB,EAAAL,GAAA/D,QAAA,SAAA0D,GAEAkC,KAAAlC,EAAA/a,YAEA+a,EAAA/a,UAAAid,EAAA7K,QAAA,OAAA,YAAA,WACA,IAAAT,EAvPA,SAAAhK,GACA,OAAAuV,MAAAld,UAAA4J,MAAAhM,KAAA+J,GAsPAwV,CAAAjK,WACAkK,EAAAzL,EAAAA,EAAA9T,OAAA,GACAwf,EAAAtd,KAAA4b,QAAA5b,KAAAsb,OACAxB,EAAAwD,EAAAJ,GAAAxF,MAAA4F,EAAA1L,EAAA/H,MAAA,GAAA,IACAiQ,EAAAI,UAAA,WACAmD,EAAAvD,EAAA9C,eAOA,CAAAqE,EAAAK,GAAApE,QAAA,SAAA0D,GACAA,EAAA/a,UAAAsd,SACAvC,EAAA/a,UAAAsd,OAAA,SAAAC,EAAAC,GACA,IAAAC,EAAA1d,KACA2d,EAAA,GAEA,OAAA,IAAA5D,QAAA,SAAAC,GACA0D,EAAAE,cAAAJ,EAAA,SAAAjC,GACAA,GAIAoC,EAAAvQ,KAAAmO,EAAAnX,YAEA/E,IAAAoe,GAAAE,EAAA7f,QAAA2f,EAIAlC,EAAAsC,WAHA7D,EAAA2D,IANA3D,EAAA2D,WAeA,IAAAtf,EAAA,CACAyf,KAAA,SAAAvX,EAAAwX,EAAAC,GACA,IAAArgB,EAAA0c,EAAA4D,UAAA,OAAA,CAAA1X,EAAAwX,IACAjE,EAAAnc,EAAAmc,QAUA,OARAA,IACAA,EAAAoE,gBAAA,SAAAC,GACAH,GACAA,EAAA,IAAA7B,EAAArC,EAAA9C,OAAAmH,EAAA9B,WAAAvC,EAAAwC,gBAKA3e,EAAA4c,KAAA,SAAA6B,GACA,OAAA,IAAAI,EAAAJ,MAGAgC,OAAA,SAAA7X,GACA,OAAA8T,EAAA4D,UAAA,iBAAA,CAAA1X,WAIA,IAAAvI,GACAA,EAAAJ,QAAAS,EACAL,EAAAJ,QAAAygB,QAAArgB,EAAAJ,SAGAoX,KAAAsJ,IAAAjgB,EAvTA,2BCGAL,EAAAJ,QAAA,SAAA2gB,EAAA/gB,EAAAkB,GACA,aACA,IAeA8f,EAAAC,EAfAtf,EAAA,8EACAuf,EAAA,iBACAC,EAAA,iHACAC,EAAA,iBACAC,EAAA,KACAzhB,EAAA,SAAA+K,GAAA,OAAAoW,EAAAO,cAAA,GAAA3W,GAAA0L,eAAA,GAAA1L,GAEAhK,EAAAf,EAAAI,GAAA6U,QAAAqM,EAAA,KAAA,GACAxd,EAAA9D,EAAAsB,GAAA2T,QAAAqM,EAAA,KAAA,GAEAK,EAAA5gB,EAAAkU,QAAAlT,EAAA,UAAAkT,QAAA,MAAA,IAAAA,QAAA,MAAA,IAAA2M,MAAA,MACAC,EAAA/d,EAAAmR,QAAAlT,EAAA,UAAAkT,QAAA,MAAA,IAAAA,QAAA,MAAA,IAAA2M,MAAA,MAEAE,EAAAnH,SAAA5Z,EAAAwB,MAAAif,GAAA,KAAA,IAAAG,EAAAjhB,QAAAK,EAAAwB,MAAAgf,IAAAQ,KAAAlgB,MAAAd,GACAihB,EAAArH,SAAA7W,EAAAvB,MAAAif,GAAA,KAAAM,GAAAhe,EAAAvB,MAAAgf,IAAAQ,KAAAlgB,MAAAiC,IAAA,KAGA,GAAAke,EAAA,CACA,GAAAF,EAAAE,EAAA,OAAA,EACA,GAAAA,EAAAF,EAAA,OAAA,EAGA,IAAA,IAAAG,EAAA,EAAAC,EAAAlhB,KAAA6I,IAAA8X,EAAAjhB,OAAAmhB,EAAAnhB,QAAAuhB,EAAAC,EAAAD,IAAA,CAKA,GAHAb,IAAAO,EAAAM,IAAA,IAAA1f,MAAAkf,IAAA9e,WAAAgf,EAAAM,KAAAN,EAAAM,IAAA,EACAZ,IAAAQ,EAAAI,IAAA,IAAA1f,MAAAkf,IAAA9e,WAAAkf,EAAAI,KAAAJ,EAAAI,IAAA,EAEAvf,MAAA0e,KAAA1e,MAAA2e,GAAA,OAAA3e,MAAA0e,GAAA,GAAA,EAMA,UAJAA,UAAAC,IACAD,GAAA,GACAC,GAAA,IAEAD,EAAAC,EAAA,OAAA,EACA,GAAAA,EAAAD,EAAA,OAAA,EAEA,OAAA,yCCnCA,WAGA,IAAAnf,GAUAkgB,GAAA,sBAGAC,GAAA,4BAMAC,GAAA,yBAmBAC,GAAA,IAmBAC,GAAA,iBAEAC,GAAA,IAGAC,GAAA,WAKAC,GAAA,CACA,CAAA,MAAAJ,IACA,CAAA,OAtCA,GAuCA,CAAA,UAtCA,GAuCA,CAAA,QArCA,GAsCA,CAAA,aArCA,IAsCA,CAAA,OAjCA,KAkCA,CAAA,UAtCA,IAuCA,CAAA,eAtCA,IAuCA,CAAA,QArCA,MAyCAK,GAAA,qBACAC,GAAA,iBAEAC,GAAA,mBACAC,GAAA,gBAEAC,GAAA,iBACAC,GAAA,oBACAC,GAAA,6BACAC,GAAA,eACAC,GAAA,kBAEAC,GAAA,kBACAC,GAAA,mBAEAC,GAAA,kBACAC,GAAA,eACAC,GAAA,kBACAC,GAAA,kBAEAC,GAAA,mBAGAC,GAAA,uBACAC,GAAA,oBACAC,GAAA,wBACAC,GAAA,wBACAC,GAAA,qBACAC,GAAA,sBACAC,GAAA,sBACAC,GAAA,sBACAC,GAAA,6BACAC,GAAA,uBACAC,GAAA,uBAGAC,GAAA,iBACAC,GAAA,qBACAC,GAAA,gCAGAC,GAAA,4BACAC,GAAA,WACAC,GAAAC,OAAAH,GAAAxM,QACA4M,GAAAD,OAAAF,GAAAzM,QAGA6M,GAAA,mBACAC,GAAA,kBACAC,GAAA,mBAGAC,GAAA,mDACAC,GAAA,QACAC,GAAA,mGAMAC,GAAA,sBACAC,GAAAT,OAAAQ,GAAAnN,QAGAqN,GAAA,aACAC,GAAA,OACAC,GAAA,OAGAC,GAAA,4CACAC,GAAA,oCACAC,GAAA,QAGAC,GAAA,4CAGAC,GAAA,WAMAC,GAAA,kCAGAC,GAAA,OAGAC,GAAA,qBAGAC,GAAA,aAGAC,GAAA,8BAGAC,GAAA,cAGAC,GAAA,mBAGAC,GAAA,8CAGAC,GAAA,OAGAC,GAAA,yBAGAC,EAAA,kBAIAC,EAAAC,gDACAC,EAAA,kBACAC,EAAA,4BAKAC,EAAA,4BACAC,EAAA,iBACAC,EAAAC,8OAGAC,EAAA,OACAC,EAAA,IAAAV,EAAA,IACAW,EAAA,IAAAJ,EAAA,IACAK,EAAA,IAAAX,EAAA,IACAY,EAAA,OACAC,EAAA,IAAAX,EAAA,IACAY,EAAA,IAAAX,EAAA,IACAY,EAAA,KAAAhB,EAAAO,EAAAM,EAAAV,EAAAC,EAAAC,EAAA,IACAY,EAAA,2BAEAC,EAAA,KAAAlB,EAAA,IACAmB,EAAA,kCACAC,EAAA,qCACAC,EAAA,IAAAhB,EAAA,IACAiB,EAAA,UAGAC,EAAA,MAAAR,EAAA,IAAAC,EAAA,IACAQ,EAAA,MAAAH,EAAA,IAAAL,EAAA,IACAS,EAAA,gCACAC,EAAA,gCACAC,EAZA,MAAAf,EAAA,IAAAK,EAAA,IAYA,IACAW,EAAA,IAAAtB,EAAA,KAIAuB,EAAAD,EAAAD,GAHA,MAAAL,EAAA,MAAA,CAAAJ,EAAAC,EAAAC,GAAAU,KAAA,KAAA,IAAAF,EAAAD,EAAA,MAIAI,EAAA,MAAA,CAAAjB,EAAAK,EAAAC,GAAAU,KAAA,KAAA,IAAAD,EACAG,EAAA,MAAA,CAAAd,EAAAN,EAAA,IAAAA,EAAAO,EAAAC,EAAAV,GAAAoB,KAAA,KAAA,IAGAG,GAAA7D,OAAAqC,EAAA,KAMAyB,GAAA9D,OAAAwC,EAAA,KAGAuB,EAAA/D,OAAA6C,EAAA,MAAAA,EAAA,KAAAe,EAAAH,EAAA,KAGAO,GAAAhE,OAAA,CACAiD,EAAA,IAAAN,EAAA,IAAAU,EAAA,MAAA,CAAAd,EAAAU,EAAA,KAAAS,KAAA,KAAA,IACAN,EAAA,IAAAE,EAAA,MAAA,CAAAf,EAAAU,EAAAE,EAAA,KAAAO,KAAA,KAAA,IACAT,EAAA,IAAAE,EAAA,IAAAE,EACAJ,EAAA,IAAAK,EAtBA,mDADA,mDA0BAb,EACAkB,GACAD,KAAA,KAAA,KAGAO,EAAAjE,OAAA,IAAAkD,EAAAtB,EAAAC,EAAAK,EAAA,KAGAgC,GAAA,qEAGAC,GAAA,CACA,QAAA,SAAA,WAAA,OAAA,QAAA,eAAA,eACA,WAAA,YAAA,aAAA,aAAA,MAAA,OAAA,SACA,UAAA,SAAA,MAAA,SAAA,SAAA,YAAA,aACA,oBAAA,cAAA,cAAA,UACA,IAAA,eAAA,WAAA,WAAA,cAIAC,IAAA,EAGAC,GAAA,GACAA,GAAApF,IAAAoF,GAAAnF,IACAmF,GAAAlF,IAAAkF,GAAAjF,IACAiF,GAAAhF,IAAAgF,GAAA/E,IACA+E,GAAA9E,IAAA8E,GAAA7E,IACA6E,GAAA5E,KAAA,EACA4E,GAAAtG,IAAAsG,GAAArG,IACAqG,GAAAtF,IAAAsF,GAAApG,IACAoG,GAAArF,IAAAqF,GAAAnG,IACAmG,GAAAlG,IAAAkG,GAAAjG,IACAiG,GAAA/F,IAAA+F,GAAA9F,IACA8F,GAAA7F,IAAA6F,GAAA3F,IACA2F,GAAA1F,IAAA0F,GAAAzF,IACAyF,GAAAvF,KAAA,EAGA,IAAAwF,GAAA,GACAA,GAAAvG,IAAAuG,GAAAtG,IACAsG,GAAAvF,IAAAuF,GAAAtF,IACAsF,GAAArG,IAAAqG,GAAApG,IACAoG,GAAArF,IAAAqF,GAAApF,IACAoF,GAAAnF,IAAAmF,GAAAlF,IACAkF,GAAAjF,IAAAiF,GAAAhG,IACAgG,GAAA/F,IAAA+F,GAAA9F,IACA8F,GAAA5F,IAAA4F,GAAA3F,IACA2F,GAAA1F,IAAA0F,GAAAzF,IACAyF,GAAAhF,IAAAgF,GAAA/E,IACA+E,GAAA9E,IAAA8E,GAAA7E,KAAA,EACA6E,GAAAnG,IAAAmG,GAAAlG,IACAkG,GAAAxF,KAAA,EAGA,IA4EAyF,EAAA,CACA7Q,KAAA,KACA8Q,IAAA,IACAhQ,KAAA,IACAiQ,KAAA,IACAC,SAAA,QACAC,SAAA,SAIAC,GAAA7mB,WACA8mB,GAAA9O,SAGA+O,EAAA,iBAAAC,GAAAA,GAAAA,EAAA7iB,SAAAA,QAAA6iB,EAGAC,EAAA,iBAAAhS,MAAAA,MAAAA,KAAA9Q,SAAAA,QAAA8Q,KAGA/W,GAAA6oB,GAAAE,GAAAC,SAAA,cAAAA,GAGAC,EAAA,iBAAAtpB,GAAAA,IAAAA,EAAAupB,UAAAvpB,EAGAwpB,EAAAF,GAAA,iBAAAlpB,GAAAA,IAAAA,EAAAmpB,UAAAnpB,EAGAqpB,GAAAD,GAAAA,EAAAxpB,UAAAspB,EAGAI,EAAAD,IAAAP,EAAAS,QAGAC,EAAA,WACA,IAEA,IAAAC,EAAAL,GAAAA,EAAAtqB,SAAAsqB,EAAAtqB,QAAA,QAAA2qB,MAEA,OAAAA,GAKAH,GAAAA,EAAAI,SAAAJ,EAAAI,QAAA,QACA,MAAA1qB,KAXA,GAeA2qB,GAAAH,GAAAA,EAAAI,cACAC,GAAAL,GAAAA,EAAAM,OACAC,GAAAP,GAAAA,EAAAQ,MACAC,GAAAT,GAAAA,EAAAU,SACAC,GAAAX,GAAAA,EAAAY,MACAC,GAAAb,GAAAA,EAAAc,aAcA,SAAA5Q,GAAA6Q,EAAAC,EAAA5W,GACA,OAAAA,EAAA9T,QACA,KAAA,EAAA,OAAAyqB,EAAA1qB,KAAA2qB,GACA,KAAA,EAAA,OAAAD,EAAA1qB,KAAA2qB,EAAA5W,EAAA,IACA,KAAA,EAAA,OAAA2W,EAAA1qB,KAAA2qB,EAAA5W,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAA2W,EAAA1qB,KAAA2qB,EAAA5W,EAAA,GAAAA,EAAA,GAAAA,EAAA,IAEA,OAAA2W,EAAA7Q,MAAA8Q,EAAA5W,GAaA,SAAA6W,GAAAC,EAAAC,EAAAC,EAAAC,GAIA,IAHA,IAAAtR,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,SAEAyZ,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAoR,EAAAE,EAAAzkB,EAAAwkB,EAAAxkB,GAAAskB,GAEA,OAAAG,EAYA,SAAAC,GAAAJ,EAAAE,GAIA,IAHA,IAAArR,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,SAEAyZ,EAAAzZ,IACA,IAAA8qB,EAAAF,EAAAnR,GAAAA,EAAAmR,KAIA,OAAAA,EAYA,SAAAK,GAAAL,EAAAE,GAGA,IAFA,IAAA9qB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OAEAA,MACA,IAAA8qB,EAAAF,EAAA5qB,GAAAA,EAAA4qB,KAIA,OAAAA,EAaA,SAAAM,GAAAN,EAAAO,GAIA,IAHA,IAAA1R,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,SAEAyZ,EAAAzZ,GACA,IAAAmrB,EAAAP,EAAAnR,GAAAA,EAAAmR,GACA,OAAA,EAGA,OAAA,EAYA,SAAAQ,GAAAR,EAAAO,GAMA,IALA,IAAA1R,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACAqrB,EAAA,EACAnS,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACA0R,EAAA7kB,EAAAmT,EAAAmR,KACA1R,EAAAmS,KAAA/kB,GAGA,OAAA4S,EAYA,SAAAoS,GAAAV,EAAAtkB,GAEA,SADA,MAAAskB,EAAA,EAAAA,EAAA5qB,UACA,EAAAurB,GAAAX,EAAAtkB,EAAA,GAYA,SAAAklB,GAAAZ,EAAAtkB,EAAAmlB,GAIA,IAHA,IAAAhS,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,SAEAyZ,EAAAzZ,GACA,GAAAyrB,EAAAnlB,EAAAskB,EAAAnR,IACA,OAAA,EAGA,OAAA,EAYA,SAAAiS,GAAAd,EAAAE,GAKA,IAJA,IAAArR,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACAkZ,EAAAmG,MAAArf,KAEAyZ,EAAAzZ,GACAkZ,EAAAO,GAAAqR,EAAAF,EAAAnR,GAAAA,EAAAmR,GAEA,OAAA1R,EAWA,SAAAyS,GAAAf,EAAAgB,GAKA,IAJA,IAAAnS,GAAA,EACAzZ,EAAA4rB,EAAA5rB,OACA6rB,EAAAjB,EAAA5qB,SAEAyZ,EAAAzZ,GACA4qB,EAAAiB,EAAApS,GAAAmS,EAAAnS,GAEA,OAAAmR,EAeA,SAAAkB,GAAAlB,EAAAE,EAAAC,EAAAgB,GACA,IAAAtS,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OAKA,IAHA+rB,GAAA/rB,IACA+qB,EAAAH,IAAAnR,MAEAA,EAAAzZ,GACA+qB,EAAAD,EAAAC,EAAAH,EAAAnR,GAAAA,EAAAmR,GAEA,OAAAG,EAeA,SAAAiB,GAAApB,EAAAE,EAAAC,EAAAgB,GACA,IAAA/rB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OAIA,IAHA+rB,GAAA/rB,IACA+qB,EAAAH,IAAA5qB,IAEAA,KACA+qB,EAAAD,EAAAC,EAAAH,EAAA5qB,GAAAA,EAAA4qB,GAEA,OAAAG,EAaA,SAAAkB,GAAArB,EAAAO,GAIA,IAHA,IAAA1R,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,SAEAyZ,EAAAzZ,GACA,GAAAmrB,EAAAP,EAAAnR,GAAAA,EAAAmR,GACA,OAAA,EAGA,OAAA,EAUA,IAAAsB,EAAAC,GAAA,UAmCA,SAAAC,GAAAC,EAAAlB,EAAAmB,GACA,IAAApT,EAOA,OANAoT,EAAAD,EAAA,SAAA/lB,EAAAkR,EAAA6U,GACA,GAAAlB,EAAA7kB,EAAAkR,EAAA6U,GAEA,OADAnT,EAAA1B,GACA,IAGA0B,EAcA,SAAAqT,GAAA3B,EAAAO,EAAAqB,EAAAC,GAIA,IAHA,IAAAzsB,EAAA4qB,EAAA5qB,OACAyZ,EAAA+S,GAAAC,EAAA,GAAA,GAEAA,EAAAhT,MAAAA,EAAAzZ,GACA,GAAAmrB,EAAAP,EAAAnR,GAAAA,EAAAmR,GACA,OAAAnR,EAGA,OAAA,EAYA,SAAA8R,GAAAX,EAAAtkB,EAAAkmB,GACA,OAAAlmB,GAAAA,EAocA,SAAAskB,EAAAtkB,EAAAkmB,GACA,IAAA/S,EAAA+S,EAAA,EACAxsB,EAAA4qB,EAAA5qB,OAEA,OAAAyZ,EAAAzZ,GACA,GAAA4qB,EAAAnR,KAAAnT,EACA,OAAAmT,EAGA,OAAA,EA5cAiT,CAAA9B,EAAAtkB,EAAAkmB,GACAD,GAAA3B,EAAA+B,GAAAH,GAaA,SAAAI,GAAAhC,EAAAtkB,EAAAkmB,EAAAf,GAIA,IAHA,IAAAhS,EAAA+S,EAAA,EACAxsB,EAAA4qB,EAAA5qB,SAEAyZ,EAAAzZ,GACA,GAAAyrB,EAAAb,EAAAnR,GAAAnT,GACA,OAAAmT,EAGA,OAAA,EAUA,SAAAkT,GAAArmB,GACA,OAAAA,GAAAA,EAYA,SAAAumB,GAAAjC,EAAAE,GACA,IAAA9qB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,EAAA8sB,GAAAlC,EAAAE,GAAA9qB,EAAA8hB,GAUA,SAAAqK,GAAA3U,GACA,OAAA,SAAAuV,GACA,OAAA,MAAAA,EAAAxrB,GAAAwrB,EAAAvV,IAWA,SAAAwV,EAAAD,GACA,OAAA,SAAAvV,GACA,OAAA,MAAAuV,EAAAxrB,GAAAwrB,EAAAvV,IAiBA,SAAAyV,GAAAZ,EAAAvB,EAAAC,EAAAgB,EAAAO,GAMA,OALAA,EAAAD,EAAA,SAAA/lB,EAAAmT,EAAA4S,GACAtB,EAAAgB,GACAA,GAAA,EAAAzlB,GACAwkB,EAAAC,EAAAzkB,EAAAmT,EAAA4S,KAEAtB,EAgCA,SAAA+B,GAAAlC,EAAAE,GAKA,IAJA,IAAA5R,EACAO,GAAA,EACAzZ,EAAA4qB,EAAA5qB,SAEAyZ,EAAAzZ,GAAA,CACA,IAAAktB,EAAApC,EAAAF,EAAAnR,IACAyT,IAAA3rB,KACA2X,EAAAA,IAAA3X,GAAA2rB,EAAAhU,EAAAgU,GAGA,OAAAhU,EAYA,SAAAiU,GAAAhuB,EAAA2rB,GAIA,IAHA,IAAArR,GAAA,EACAP,EAAAmG,MAAAlgB,KAEAsa,EAAAta,GACA+Z,EAAAO,GAAAqR,EAAArR,GAEA,OAAAP,EAyBA,SAAAkU,GAAA3C,GACA,OAAA,SAAAnkB,GACA,OAAAmkB,EAAAnkB,IAcA,SAAA+mB,GAAAN,EAAAO,GACA,OAAA5B,GAAA4B,EAAA,SAAA9V,GACA,OAAAuV,EAAAvV,KAYA,SAAA+V,GAAAC,EAAAhW,GACA,OAAAgW,EAAAC,IAAAjW,GAYA,SAAAkW,GAAAC,EAAAC,GAIA,IAHA,IAAAnU,GAAA,EACAzZ,EAAA2tB,EAAA3tB,SAEAyZ,EAAAzZ,IAAA,EAAAurB,GAAAqC,EAAAD,EAAAlU,GAAA,KACA,OAAAA,EAYA,SAAAoU,GAAAF,EAAAC,GAGA,IAFA,IAAAnU,EAAAkU,EAAA3tB,OAEAyZ,MAAA,EAAA8R,GAAAqC,EAAAD,EAAAlU,GAAA,KACA,OAAAA,EA+BA,IAAAqU,GAAAd,EApwBA,CAEAe,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,KAAAC,IAAA,KACAC,IAAA,KAAAC,IAAA,KACAC,IAAA,KAEAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,IAAAC,IAAA,IAAAC,IAAA,IACAC,IAAA,KAAAC,IAAA,KACAC,IAAA,KAAAC,IAAA,KACAC,IAAA,KAAAC,IAAA,MAutBAC,GAAA7M,EAntBA,CACAhV,IAAA,QACA8hB,IAAA,OACAC,IAAA,OACAC,IAAA,SACAtR,IAAA,UAutBA,SAAAuR,GAAAC,GACA,MAAA,KAAAzR,EAAAyR,GAsBA,SAAAC,GAAAC,GACA,OAAAjS,EAAAvS,KAAAwkB,GAsCA,SAAAC,GAAAC,GACA,IAAA7gB,GAAA,EACAP,EAAAmG,MAAAib,EAAAC,MAKA,OAHAD,EAAA9gB,QAAA,SAAAlT,EAAAkR,GACA0B,IAAAO,GAAA,CAAAjC,EAAAlR,KAEA4S,EAWA,SAAAshB,GAAA/P,EAAAgQ,GACA,OAAA,SAAA93B,GACA,OAAA8nB,EAAAgQ,EAAA93B,KAaA,SAAA+3B,GAAA9P,EAAA+P,GAMA,IALA,IAAAlhB,GAAA,EACAzZ,EAAA4qB,EAAA5qB,OACAqrB,EAAA,EACAnS,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAnT,IAAAq0B,GAAAr0B,IAAAqb,KACAiJ,EAAAnR,GAAAkI,GACAzI,EAAAmS,KAAA5R,GAGA,OAAAP,EAUA,SAAA0hB,GAAAjkB,GACA,IAAA8C,GAAA,EACAP,EAAAmG,MAAA1I,EAAA4jB,MAKA,OAHA5jB,EAAA6C,QAAA,SAAAlT,GACA4S,IAAAO,GAAAnT,IAEA4S,EAqEA,SAAA2hB,GAAAT,GACA,OAAAD,GAAAC,GAkCA,SAAAA,GACA,IAAAlhB,EAAA+O,EAAA6S,UAAA,EACA,KAAA7S,EAAArS,KAAAwkB,MACAlhB,EAEA,OAAAA,EAtCA6hB,CAAAX,GACAlO,EAAAkO,GAUA,SAAAY,GAAAZ,GACA,OAAAD,GAAAC,GAoCA,SAAAA,GACA,OAAAA,EAAAv4B,MAAAomB,IAAA,GApCAgT,CAAAb,GAhkBA,SAAAA,GACA,OAAAA,EAAAlZ,MAAA,IAgkBAga,CAAAd,GAUA,IAAAe,GAAAnO,EA/6BA,CACAoO,QAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,QAAA,MAg/BA,IA0zeAtjB,GA1zeA,SAAAujB,EAAAC,GAIA,IA6BAC,EA7BAtc,GAHAqc,EAAA,MAAAA,EAAAv7B,GAAA+X,GAAAjD,SAAA9U,GAAAiG,SAAAs1B,EAAAxjB,GAAA0jB,KAAAz7B,GAAAkoB,MAGAhJ,MACAgC,EAAAqa,EAAAra,KACA1hB,EAAA+7B,EAAA/7B,MACAwpB,EAAAuS,EAAAvS,SACA7oB,EAAAo7B,EAAAp7B,KACA8F,EAAAs1B,EAAAt1B,OACA8d,EAAAwX,EAAAxX,OACA7P,EAAAqnB,EAAArnB,OACAwnB,EAAAH,EAAAG,UAGAC,EAAAzc,EAAAld,UACA45B,EAAA5S,EAAAhnB,UACA65B,EAAA51B,EAAAjE,UAGA85B,EAAAP,EAAA,sBAGAQ,EAAAH,EAAAp2B,SAGAiR,EAAAolB,EAAAplB,eAGAulB,EAAA,EAGAC,GACAT,EAAA,SAAAU,KAAAJ,GAAAA,EAAA5iB,MAAA4iB,EAAA5iB,KAAAijB,UAAA,KACA,iBAAAX,EAAA,GAQAY,EAAAP,EAAAr2B,SAGA62B,EAAAN,EAAAn8B,KAAAqG,GAGAq2B,EAAAt8B,GAAA+X,EAGAwkB,EAAAxY,EAAA,IACAgY,EAAAn8B,KAAA6W,GAAArC,QAAAmQ,GAAA,QACAnQ,QAAA,yDAAA,SAAA,KAIAooB,EAAApT,GAAAmS,EAAAiB,OAAAp7B,GACAuV,EAAA4kB,EAAA5kB,OACA8lB,EAAAlB,EAAAkB,WACAC,EAAAF,EAAAA,EAAAE,YAAAt7B,GACAu7B,EAAAtC,GAAAp0B,EAAA22B,eAAA32B,GACA42B,EAAA52B,EAAA62B,OACAC,EAAAlB,EAAAkB,qBACAC,EAAArB,EAAAqB,OACAC,EAAAtmB,EAAAA,EAAAumB,mBAAA97B,GACA+7B,EAAAxmB,EAAAA,EAAAC,SAAAxV,GACAg8B,EAAAzmB,EAAAA,EAAAG,YAAA1V,GAEA8E,EAAA,WACA,IACA,IAAAokB,EAAA+S,GAAAp3B,EAAA,kBAEA,OADAqkB,EAAA,GAAA,GAAA,IACAA,EACA,MAAAvrB,KALA,GASAu+B,EAAA/B,EAAAgC,eAAAv9B,GAAAu9B,cAAAhC,EAAAgC,aACAC,EAAAtc,GAAAA,EAAAuc,MAAAz9B,GAAAkhB,KAAAuc,KAAAvc,EAAAuc,IACAC,EAAAnC,EAAAoC,aAAA39B,GAAA29B,YAAApC,EAAAoC,WAGAC,EAAAz9B,EAAA+E,KACA24B,EAAA19B,EAAAiF,MACA04B,EAAA73B,EAAA83B,sBACAC,EAAAxB,EAAAA,EAAAyB,SAAA78B,GACA88B,EAAA3C,EAAAj6B,SACA68B,EAAAxC,EAAAlU,KACA2W,EAAA/D,GAAAp0B,EAAAiT,KAAAjT,GACAo4B,EAAAl+B,EAAA6I,IACAs1B,EAAAn+B,EAAA4I,IACAw1B,EAAArd,EAAAuc,IACAe,EAAAjD,EAAAzhB,SACA2kB,EAAAt+B,EAAAmV,OACAopB,EAAA/C,EAAA5xB,QAGA40B,EAAAtB,GAAA9B,EAAA,YACAqD,EAAAvB,GAAA9B,EAAA,OACAzf,GAAAuhB,GAAA9B,EAAA,WACAsD,GAAAxB,GAAA9B,EAAA,OACAuD,GAAAzB,GAAA9B,EAAA,WACAwD,GAAA1B,GAAAp3B,EAAA,UAGA+4B,GAAAF,IAAA,IAAAA,GAGAG,GAAA,GAGAC,GAAAC,GAAAR,GACAS,GAAAD,GAAAP,GACAS,GAAAF,GAAArjB,IACAwjB,GAAAH,GAAAN,IACAU,GAAAJ,GAAAL,IAGAU,GAAA7oB,EAAAA,EAAA3U,UAAAZ,GACAq+B,GAAAD,GAAAA,GAAA75B,QAAAvE,GACAs+B,GAAAF,GAAAA,GAAAh6B,SAAApE,GAyHA,SAAAu+B,GAAAx5B,GACA,GAAAy5B,GAAAz5B,KAAA05B,GAAA15B,MAAAA,aAAA25B,IAAA,CACA,GAAA35B,aAAA45B,GACA,OAAA55B,EAEA,GAAAsQ,EAAA7W,KAAAuG,EAAA,eACA,OAAA65B,GAAA75B,GAGA,OAAA,IAAA45B,GAAA55B,GAWA,IAAA85B,GAAA,WACA,SAAArT,KACA,OAAA,SAAAsT,GACA,IAAAC,GAAAD,GACA,MAAA,GAEA,GAAArD,EACA,OAAAA,EAAAqD,GAEAtT,EAAA5qB,UAAAk+B,EACA,IAAAnnB,EAAA,IAAA6T,EAEA,OADAA,EAAA5qB,UAAAZ,GACA2X,GAZA,GAqBA,SAAAqnB,MAWA,SAAAL,GAAA55B,EAAAk6B,GACAt+B,KAAAu+B,YAAAn6B,EACApE,KAAAw+B,YAAA,GACAx+B,KAAAy+B,YAAAH,EACAt+B,KAAA0+B,UAAA,EACA1+B,KAAA2+B,WAAAt/B,GAgFA,SAAA0+B,GAAA35B,GACApE,KAAAu+B,YAAAn6B,EACApE,KAAAw+B,YAAA,GACAx+B,KAAA4+B,QAAA,EACA5+B,KAAA6+B,cAAA,EACA7+B,KAAA8+B,cAAA,GACA9+B,KAAA++B,cAAAlf,GACA7f,KAAAg/B,UAAA,GAgHA,SAAAC,GAAAC,GACA,IAAA3nB,GAAA,EACAzZ,EAAA,MAAAohC,EAAA,EAAAA,EAAAphC,OAGA,IADAkC,KAAAm/B,UACA5nB,EAAAzZ,GAAA,CACA,IAAAshC,EAAAF,EAAA3nB,GACAvX,KAAAyU,IAAA2qB,EAAA,GAAAA,EAAA,KAiGA,SAAAC,GAAAH,GACA,IAAA3nB,GAAA,EACAzZ,EAAA,MAAAohC,EAAA,EAAAA,EAAAphC,OAGA,IADAkC,KAAAm/B,UACA5nB,EAAAzZ,GAAA,CACA,IAAAshC,EAAAF,EAAA3nB,GACAvX,KAAAyU,IAAA2qB,EAAA,GAAAA,EAAA,KA8GA,SAAAE,GAAAJ,GACA,IAAA3nB,GAAA,EACAzZ,EAAA,MAAAohC,EAAA,EAAAA,EAAAphC,OAGA,IADAkC,KAAAm/B,UACA5nB,EAAAzZ,GAAA,CACA,IAAAshC,EAAAF,EAAA3nB,GACAvX,KAAAyU,IAAA2qB,EAAA,GAAAA,EAAA,KAiGA,SAAAG,GAAA7V,GACA,IAAAnS,GAAA,EACAzZ,EAAA,MAAA4rB,EAAA,EAAAA,EAAA5rB,OAGA,IADAkC,KAAAw/B,SAAA,IAAAF,KACA/nB,EAAAzZ,GACAkC,KAAAG,IAAAupB,EAAAnS,IA6CA,SAAAkoB,GAAAP,GACA,IAAAQ,EAAA1/B,KAAAw/B,SAAA,IAAAH,GAAAH,GACAl/B,KAAAq4B,KAAAqH,EAAArH,KAqGA,SAAAsH,GAAAv7B,EAAAw7B,GACA,IAAAC,EAAA/B,GAAA15B,GACA07B,GAAAD,GAAAE,GAAA37B,GACA47B,GAAAH,IAAAC,GAAA5D,GAAA93B,GACA67B,GAAAJ,IAAAC,IAAAE,GAAA1X,GAAAlkB,GACA87B,EAAAL,GAAAC,GAAAE,GAAAC,EACAjpB,EAAAkpB,EAAAjV,GAAA7mB,EAAAtG,OAAAqU,GAAA,GACArU,EAAAkZ,EAAAlZ,OAEA,IAAA,IAAAwX,KAAAlR,GACAw7B,IAAAlrB,EAAA7W,KAAAuG,EAAAkR,IACA4qB,IAEA,UAAA5qB,GAEA0qB,IAAA,UAAA1qB,GAAA,UAAAA,IAEA2qB,IAAA,UAAA3qB,GAAA,cAAAA,GAAA,cAAAA,IAEA6qB,GAAA7qB,EAAAxX,KAEAkZ,EAAA5J,KAAAkI,GAGA,OAAA0B,EAUA,SAAAopB,GAAA1X,GACA,IAAA5qB,EAAA4qB,EAAA5qB,OACA,OAAAA,EAAA4qB,EAAA2X,GAAA,EAAAviC,EAAA,IAAAuB,GAWA,SAAAihC,GAAA5X,EAAAzrB,GACA,OAAAsjC,GAAAC,GAAA9X,GAAA+X,GAAAxjC,EAAA,EAAAyrB,EAAA5qB,SAUA,SAAA4iC,GAAAhY,GACA,OAAA6X,GAAAC,GAAA9X,IAYA,SAAAiY,GAAA9V,EAAAvV,EAAAlR,IACAA,IAAA/E,IAAA0K,GAAA8gB,EAAAvV,GAAAlR,MACAA,IAAA/E,IAAAiW,KAAAuV,IACA+V,GAAA/V,EAAAvV,EAAAlR,GAcA,SAAAy8B,GAAAhW,EAAAvV,EAAAlR,GACA,IAAA08B,EAAAjW,EAAAvV,GACAZ,EAAA7W,KAAAgtB,EAAAvV,IAAAvL,GAAA+2B,EAAA18B,KACAA,IAAA/E,IAAAiW,KAAAuV,IACA+V,GAAA/V,EAAAvV,EAAAlR,GAYA,SAAA28B,GAAArY,EAAApT,GAEA,IADA,IAAAxX,EAAA4qB,EAAA5qB,OACAA,KACA,GAAAiM,GAAA2e,EAAA5qB,GAAA,GAAAwX,GACA,OAAAxX,EAGA,OAAA,EAcA,SAAAkjC,GAAA7W,EAAAxB,EAAAC,EAAAC,GAIA,OAHAoY,GAAA9W,EAAA,SAAA/lB,EAAAkR,EAAA6U,GACAxB,EAAAE,EAAAzkB,EAAAwkB,EAAAxkB,GAAA+lB,KAEAtB,EAYA,SAAAqY,GAAArW,EAAAxV,GACA,OAAAwV,GAAAsW,GAAA9rB,EAAA8B,GAAA9B,GAAAwV,GAyBA,SAAA+V,GAAA/V,EAAAvV,EAAAlR,GACA,aAAAkR,GAAAnR,EACAA,EAAA0mB,EAAAvV,EAAA,CACA8rB,cAAA,EACAC,YAAA,EACAj9B,MAAAA,EACAk9B,UAAA,IAGAzW,EAAAvV,GAAAlR,EAYA,SAAAm9B,GAAA1W,EAAA2W,GAMA,IALA,IAAAjqB,GAAA,EACAzZ,EAAA0jC,EAAA1jC,OACAkZ,EAAAmG,EAAArf,GACA2jC,EAAA,MAAA5W,IAEAtT,EAAAzZ,GACAkZ,EAAAO,GAAAkqB,EAAApiC,GAAAwb,GAAAgQ,EAAA2W,EAAAjqB,IAEA,OAAAP,EAYA,SAAAypB,GAAAiB,EAAAC,EAAAC,GASA,OARAF,GAAAA,IACAE,IAAAviC,KACAqiC,EAAAA,GAAAE,EAAAF,EAAAE,GAEAD,IAAAtiC,KACAqiC,EAAAC,GAAAD,EAAAA,EAAAC,IAGAD,EAmBA,SAAAG,GAAAz9B,EAAA09B,EAAAC,EAAAzsB,EAAAuV,EAAAmX,GACA,IAAAhrB,EACAirB,EA5hFA,EA4hFAH,EACAI,EA5hFA,EA4hFAJ,EACAK,EA5hFA,EA4hFAL,EAKA,GAHAC,IACA/qB,EAAA6T,EAAAkX,EAAA39B,EAAAkR,EAAAuV,EAAAmX,GAAAD,EAAA39B,IAEA4S,IAAA3X,GACA,OAAA2X,EAEA,IAAAonB,GAAAh6B,GACA,OAAAA,EAEA,IAAAy7B,EAAA/B,GAAA15B,GACA,GAAAy7B,GAEA,GADA7oB,EA67GA,SAAA0R,GACA,IAAA5qB,EAAA4qB,EAAA5qB,OACAkZ,EAAA,IAAA0R,EAAAxgB,YAAApK,GAOA,OAJAA,GAAA,iBAAA4qB,EAAA,IAAAhU,EAAA7W,KAAA6qB,EAAA,WACA1R,EAAAO,MAAAmR,EAAAnR,MACAP,EAAAorB,MAAA1Z,EAAA0Z,OAEAprB,EAt8GAqrB,CAAAj+B,IACA69B,EACA,OAAAzB,GAAAp8B,EAAA4S,OAEA,CACA,IAAAsrB,EAAAC,GAAAn+B,GACAo+B,EAAAF,GAAAliB,IAAAkiB,GAAAjiB,GAEA,GAAA6b,GAAA93B,GACA,OAAAq+B,GAAAr+B,EAAA69B,GAEA,GAAAK,GAAA9hB,IAAA8hB,GAAAviB,IAAAyiB,IAAA3X,GAEA,GADA7T,EAAAkrB,GAAAM,EAAA,GAAAE,GAAAt+B,IACA69B,EACA,OAAAC,EAinEA,SAAA7sB,EAAAwV,GACA,OAAAsW,GAAA9rB,EAAAstB,GAAAttB,GAAAwV,GAjnEA+X,CAAAx+B,EAnHA,SAAAymB,EAAAxV,GACA,OAAAwV,GAAAsW,GAAA9rB,EAAAwtB,GAAAxtB,GAAAwV,GAkHAiY,CAAA9rB,EAAA5S,IAomEA,SAAAiR,EAAAwV,GACA,OAAAsW,GAAA9rB,EAAA0tB,GAAA1tB,GAAAwV,GApmEAmY,CAAA5+B,EAAA88B,GAAAlqB,EAAA5S,QAEA,CACA,IAAAkiB,GAAAgc,GACA,OAAAzX,EAAAzmB,EAAA,GAEA4S,EA48GA,SAAA6T,EAAAyX,EAAAL,GACA,IAAAl5B,EAAA8hB,EAAA3iB,YACA,OAAAo6B,GACA,KAAAvhB,GACA,OAAAkiB,GAAApY,GAEA,KAAA5K,GACA,KAAAC,GACA,OAAA,IAAAnX,GAAA8hB,GAEA,KAAA7J,GACA,OA1nDA,SAAAkiB,EAAAjB,GACA,IAAAkB,EAAAlB,EAAAgB,GAAAC,EAAAC,QAAAD,EAAAC,OACA,OAAA,IAAAD,EAAAh7B,YAAAi7B,EAAAD,EAAAE,WAAAF,EAAAG,YAwnDAC,CAAAzY,EAAAoX,GAEA,KAAAhhB,GAAA,KAAAC,GACA,KAAAC,GAAA,KAAAC,GAAA,KAAAC,GACA,KAAAC,GAAA,KAAAC,GAAA,KAAAC,GAAA,KAAAC,GACA,OAAA8hB,GAAA1Y,EAAAoX,GAEA,KAAA3hB,GACA,OAAA,IAAAvX,EAEA,KAAAwX,GACA,KAAAK,GACA,OAAA,IAAA7X,EAAA8hB,GAEA,KAAAnK,GACA,OA7nDA,SAAA8iB,GACA,IAAAxsB,EAAA,IAAAwsB,EAAAt7B,YAAAs7B,EAAAnuB,OAAA8N,GAAAgX,KAAAqJ,IAEA,OADAxsB,EAAA4hB,UAAA4K,EAAA5K,UACA5hB,EA0nDAysB,CAAA5Y,GAEA,KAAAlK,GACA,OAAA,IAAA5X,EAEA,KAAA8X,GACA,OAtnDA,SAAA6iB,GACA,OAAAhG,GAAAx5B,EAAAw5B,GAAA7/B,KAAA6lC,IAAA,GAqnDAC,CAAA9Y,IA5+GA+Y,CAAAx/B,EAAAk+B,EAAAL,IAIAD,IAAAA,EAAA,IAAAvC,IACA,IAAAoE,EAAA7B,EAAAnnB,IAAAzW,GACA,GAAAy/B,EACA,OAAAA,EAIA,GAFA7B,EAAAvtB,IAAArQ,EAAA4S,GAEAoR,GAAAhkB,GAKA,OAJAA,EAAAkT,QAAA,SAAAwsB,GACA9sB,EAAA7W,IAAA0hC,GAAAiC,EAAAhC,EAAAC,EAAA+B,EAAA1/B,EAAA49B,MAGAhrB,EAGA,GAAAgR,GAAA5jB,GAKA,OAJAA,EAAAkT,QAAA,SAAAwsB,EAAAxuB,GACA0B,EAAAvC,IAAAa,EAAAusB,GAAAiC,EAAAhC,EAAAC,EAAAzsB,EAAAlR,EAAA49B,MAGAhrB,EAGA,IAIAoU,EAAAyU,EAAAxgC,IAJA8iC,EACAD,EAAA6B,GAAAC,GACA9B,EAAAW,GAAA1rB,IAEA/S,GASA,OARA0kB,GAAAsC,GAAAhnB,EAAA,SAAA0/B,EAAAxuB,GACA8V,IAEA0Y,EAAA1/B,EADAkR,EAAAwuB,IAIAjD,GAAA7pB,EAAA1B,EAAAusB,GAAAiC,EAAAhC,EAAAC,EAAAzsB,EAAAlR,EAAA49B,MAEAhrB,EAyBA,SAAAitB,GAAApZ,EAAAxV,EAAA+V,GACA,IAAAttB,EAAAstB,EAAAttB,OACA,GAAA,MAAA+sB,EACA,OAAA/sB,EAGA,IADA+sB,EAAA3mB,EAAA2mB,GACA/sB,KAAA,CACA,IAAAwX,EAAA8V,EAAAttB,GACAmrB,EAAA5T,EAAAC,GACAlR,EAAAymB,EAAAvV,GAEA,GAAAlR,IAAA/E,MAAAiW,KAAAuV,KAAA5B,EAAA7kB,GACA,OAAA,EAGA,OAAA,EAaA,SAAA8/B,GAAA3b,EAAA4b,EAAAvyB,GACA,GAAA,mBAAA2W,EACA,MAAA,IAAAoR,EAAApa,IAEA,OAAAqc,GAAA,WAAArT,EAAA7Q,MAAArY,GAAAuS,IAAAuyB,GAcA,SAAAC,GAAA1b,EAAAgB,EAAAd,EAAAW,GACA,IAAAhS,GAAA,EACA8sB,EAAAjb,GACAkb,GAAA,EACAxmC,EAAA4qB,EAAA5qB,OACAkZ,EAAA,GACAutB,EAAA7a,EAAA5rB,OAEA,IAAAA,EACA,OAAAkZ,EAEA4R,IACAc,EAAAF,GAAAE,EAAAwB,GAAAtC,KAEAW,GACA8a,EAAA/a,GACAgb,GAAA,GAhtFA,KAktFA5a,EAAA5rB,SACAumC,EAAAhZ,GACAiZ,GAAA,EACA5a,EAAA,IAAA6V,GAAA7V,IAEA8a,EACA,OAAAjtB,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAktB,EAAA,MAAA7b,EAAAxkB,EAAAwkB,EAAAxkB,GAGA,GADAA,EAAAmlB,GAAA,IAAAnlB,EAAAA,EAAA,EACAkgC,GAAAG,GAAAA,EAAA,CAEA,IADA,IAAAC,EAAAH,EACAG,KACA,GAAAhb,EAAAgb,KAAAD,EACA,SAAAD,EAGAxtB,EAAA5J,KAAAhJ,QAEAigC,EAAA3a,EAAA+a,EAAAlb,IACAvS,EAAA5J,KAAAhJ,GAGA,OAAA4S,EAvkCA4mB,GAAA+G,iBAAA,CAQAC,OAAA1iB,GAQA2iB,SAAA1iB,GAQA2iB,YAAA1iB,GAQA2iB,SAAA,GAQAC,QAAA,CAQAhvB,EAAA4nB,MAKAA,GAAA39B,UAAAo+B,GAAAp+B,WACAiI,YAAA01B,IAEAI,GAAA/9B,UAAAi+B,GAAAG,GAAAp+B,YACAiI,YAAA81B,IAsHAD,GAAA99B,UAAAi+B,GAAAG,GAAAp+B,YACAiI,YAAA61B,GAoGAkB,GAAAh/B,UAAAk/B,MAvEA,WACAn/B,KAAAw/B,SAAAxC,GAAAA,GAAA,MAAA,GACAh9B,KAAAq4B,KAAA,GAsEA4G,GAAAh/B,UAAA,OAzDA,SAAAqV,GACA,IAAA0B,EAAAhX,KAAAurB,IAAAjW,WAAAtV,KAAAw/B,SAAAlqB,GAEA,OADAtV,KAAAq4B,MAAArhB,EAAA,EAAA,EACAA,GAuDAioB,GAAAh/B,UAAA4a,IA3CA,SAAAvF,GACA,IAAAoqB,EAAA1/B,KAAAw/B,SACA,GAAAxC,GAAA,CACA,IAAAhmB,EAAA0oB,EAAApqB,GACA,OAAA0B,IAAAwI,GAAAngB,GAAA2X,EAEA,OAAAtC,EAAA7W,KAAA6hC,EAAApqB,GAAAoqB,EAAApqB,GAAAjW,IAsCA4/B,GAAAh/B,UAAAsrB,IA1BA,SAAAjW,GACA,IAAAoqB,EAAA1/B,KAAAw/B,SACA,OAAAxC,GAAA0C,EAAApqB,KAAAjW,GAAAqV,EAAA7W,KAAA6hC,EAAApqB,IAyBA2pB,GAAAh/B,UAAAwU,IAZA,SAAAa,EAAAlR,GACA,IAAAs7B,EAAA1/B,KAAAw/B,SAGA,OAFAx/B,KAAAq4B,MAAAr4B,KAAAurB,IAAAjW,GAAA,EAAA,EACAoqB,EAAApqB,GAAA0nB,IAAA54B,IAAA/E,GAAAmgB,GAAApb,EACApE,MAyHAq/B,GAAAp/B,UAAAk/B,MApFA,WACAn/B,KAAAw/B,SAAA,GACAx/B,KAAAq4B,KAAA,GAmFAgH,GAAAp/B,UAAA,OAvEA,SAAAqV,GACA,IAAAoqB,EAAA1/B,KAAAw/B,SACAjoB,EAAAwpB,GAAArB,EAAApqB,GAEA,QAAAiC,EAAA,IAIAA,GADAmoB,EAAA5hC,OAAA,EAEA4hC,EAAAryB,MAEA4tB,EAAAp9B,KAAA6hC,EAAAnoB,EAAA,KAEAvX,KAAAq4B,KACA,KA0DAgH,GAAAp/B,UAAA4a,IA9CA,SAAAvF,GACA,IAAAoqB,EAAA1/B,KAAAw/B,SACAjoB,EAAAwpB,GAAArB,EAAApqB,GAEA,OAAAiC,EAAA,EAAAlY,GAAAqgC,EAAAnoB,GAAA,IA2CA8nB,GAAAp/B,UAAAsrB,IA/BA,SAAAjW,GACA,OAAA,EAAAyrB,GAAA/gC,KAAAw/B,SAAAlqB,IA+BA+pB,GAAAp/B,UAAAwU,IAlBA,SAAAa,EAAAlR,GACA,IAAAs7B,EAAA1/B,KAAAw/B,SACAjoB,EAAAwpB,GAAArB,EAAApqB,GAQA,OANAiC,EAAA,KACAvX,KAAAq4B,KACAqH,EAAAtyB,KAAA,CAAAkI,EAAAlR,KAEAs7B,EAAAnoB,GAAA,GAAAnT,EAEApE,MA2GAs/B,GAAAr/B,UAAAk/B,MAtEA,WACAn/B,KAAAq4B,KAAA,EACAr4B,KAAAw/B,SAAA,CACAyF,KAAA,IAAAhG,GACA7G,IAAA,IAAAyE,GAAAwC,IACAnH,OAAA,IAAA+G,KAkEAK,GAAAr/B,UAAA,OArDA,SAAAqV,GACA,IAAA0B,EAAAkuB,GAAAllC,KAAAsV,GAAA,OAAAA,GAEA,OADAtV,KAAAq4B,MAAArhB,EAAA,EAAA,EACAA,GAmDAsoB,GAAAr/B,UAAA4a,IAvCA,SAAAvF,GACA,OAAA4vB,GAAAllC,KAAAsV,GAAAuF,IAAAvF,IAuCAgqB,GAAAr/B,UAAAsrB,IA3BA,SAAAjW,GACA,OAAA4vB,GAAAllC,KAAAsV,GAAAiW,IAAAjW,IA2BAgqB,GAAAr/B,UAAAwU,IAdA,SAAAa,EAAAlR,GACA,IAAAs7B,EAAAwF,GAAAllC,KAAAsV,GACA+iB,EAAAqH,EAAArH,KAIA,OAFAqH,EAAAjrB,IAAAa,EAAAlR,GACApE,KAAAq4B,MAAAqH,EAAArH,MAAAA,EAAA,EAAA,EACAr4B,MA2DAu/B,GAAAt/B,UAAAE,IAAAo/B,GAAAt/B,UAAAmN,KAnBA,SAAAhJ,GAEA,OADApE,KAAAw/B,SAAA/qB,IAAArQ,EAAAob,IACAxf,MAkBAu/B,GAAAt/B,UAAAsrB,IANA,SAAAnnB,GACA,OAAApE,KAAAw/B,SAAAjU,IAAAnnB,IAuGAq7B,GAAAx/B,UAAAk/B,MA3EA,WACAn/B,KAAAw/B,SAAA,IAAAH,GACAr/B,KAAAq4B,KAAA,GA0EAoH,GAAAx/B,UAAA,OA9DA,SAAAqV,GACA,IAAAoqB,EAAA1/B,KAAAw/B,SACAxoB,EAAA0oB,EAAA,OAAApqB,GAGA,OADAtV,KAAAq4B,KAAAqH,EAAArH,KACArhB,GA0DAyoB,GAAAx/B,UAAA4a,IA9CA,SAAAvF,GACA,OAAAtV,KAAAw/B,SAAA3kB,IAAAvF,IA8CAmqB,GAAAx/B,UAAAsrB,IAlCA,SAAAjW,GACA,OAAAtV,KAAAw/B,SAAAjU,IAAAjW,IAkCAmqB,GAAAx/B,UAAAwU,IArBA,SAAAa,EAAAlR,GACA,IAAAs7B,EAAA1/B,KAAAw/B,SACA,GAAAE,aAAAL,GAAA,CACA,IAAA8F,EAAAzF,EAAAF,SACA,IAAA3C,GAAAsI,EAAArnC,OAAAsnC,IAGA,OAFAD,EAAA/3B,KAAA,CAAAkI,EAAAlR,IACApE,KAAAq4B,OAAAqH,EAAArH,KACAr4B,KAEA0/B,EAAA1/B,KAAAw/B,SAAA,IAAAF,GAAA6F,GAIA,OAFAzF,EAAAjrB,IAAAa,EAAAlR,GACApE,KAAAq4B,KAAAqH,EAAArH,KACAr4B,MA4cA,IAAAihC,GAAAoE,GAAAC,IAUAC,GAAAF,GAAAG,IAAA,GAWA,SAAAC,GAAAtb,EAAAlB,GACA,IAAAjS,GAAA,EAKA,OAJAiqB,GAAA9W,EAAA,SAAA/lB,EAAAmT,EAAA4S,GAEA,OADAnT,IAAAiS,EAAA7kB,EAAAmT,EAAA4S,KAGAnT,EAaA,SAAA0uB,GAAAhd,EAAAE,EAAAW,GAIA,IAHA,IAAAhS,GAAA,EACAzZ,EAAA4qB,EAAA5qB,SAEAyZ,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAyT,EAAApC,EAAAxkB,GAEA,GAAA,MAAA4mB,IAAAyZ,IAAAplC,GACA2rB,GAAAA,IAAA2a,GAAA3a,GACAzB,EAAAyB,EAAAyZ,IAEA,IAAAA,EAAAzZ,EACAhU,EAAA5S,EAGA,OAAA4S,EAuCA,SAAA4uB,GAAAzb,EAAAlB,GACA,IAAAjS,EAAA,GAMA,OALAiqB,GAAA9W,EAAA,SAAA/lB,EAAAmT,EAAA4S,GACAlB,EAAA7kB,EAAAmT,EAAA4S,IACAnT,EAAA5J,KAAAhJ,KAGA4S,EAcA,SAAA6uB,GAAAnd,EAAAod,EAAA7c,EAAA8c,EAAA/uB,GACA,IAAAO,GAAA,EACAzZ,EAAA4qB,EAAA5qB,OAKA,IAHAmrB,IAAAA,EAAA+c,IACAhvB,IAAAA,EAAA,MAEAO,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACA,EAAAuuB,GAAA7c,EAAA7kB,GACA,EAAA0hC,EAEAD,GAAAzhC,EAAA0hC,EAAA,EAAA7c,EAAA8c,EAAA/uB,GAEAyS,GAAAzS,EAAA5S,GAEA2hC,IACA/uB,EAAAA,EAAAlZ,QAAAsG,GAGA,OAAA4S,EAcA,IAAAivB,GAAAC,KAYAC,GAAAD,IAAA,GAUA,SAAAZ,GAAAza,EAAAjC,GACA,OAAAiC,GAAAob,GAAApb,EAAAjC,EAAAzR,IAWA,SAAAquB,GAAA3a,EAAAjC,GACA,OAAAiC,GAAAsb,GAAAtb,EAAAjC,EAAAzR,IAYA,SAAAivB,GAAAvb,EAAAO,GACA,OAAAlC,GAAAkC,EAAA,SAAA9V,GACA,OAAA+wB,GAAAxb,EAAAvV,MAYA,SAAAgxB,GAAAzb,EAAA0b,GAMA,IAHA,IAAAhvB,EAAA,EACAzZ,GAHAyoC,EAAAC,GAAAD,EAAA1b,IAGA/sB,OAEA,MAAA+sB,GAAAtT,EAAAzZ,GACA+sB,EAAAA,EAAA4b,GAAAF,EAAAhvB,OAEA,OAAAA,GAAAA,GAAAzZ,EAAA+sB,EAAAxrB,GAcA,SAAAqnC,GAAA7b,EAAA8b,EAAAC,GACA,IAAA5vB,EAAA2vB,EAAA9b,GACA,OAAAiT,GAAAjT,GAAA7T,EAAAyS,GAAAzS,EAAA4vB,EAAA/b,IAUA,SAAAgc,GAAAziC,GACA,OAAA,MAAAA,EACAA,IAAA/E,GAh5FA,qBARA,gBA05FAg8B,GAAAA,KAAAn3B,EAAAE,GAq2FA,SAAAA,GACA,IAAA0iC,EAAApyB,EAAA7W,KAAAuG,EAAAi3B,GACAiH,EAAAl+B,EAAAi3B,GAEA,IACAj3B,EAAAi3B,GAAAh8B,GACA,IAAA0nC,GAAA,EACA,MAAA/pC,IAEA,IAAAga,EAAAqjB,EAAAx8B,KAAAuG,GAQA,OAPA2iC,IACAD,EACA1iC,EAAAi3B,GAAAiH,SAEAl+B,EAAAi3B,IAGArkB,EAr3FAgwB,CAAA5iC,GAy4GA,SAAAA,GACA,OAAAi2B,EAAAx8B,KAAAuG,GAz4GA6iC,CAAA7iC,GAYA,SAAA8iC,GAAA9iC,EAAA+iC,GACA,OAAAA,EAAA/iC,EAWA,SAAAgjC,GAAAvc,EAAAvV,GACA,OAAA,MAAAuV,GAAAnW,EAAA7W,KAAAgtB,EAAAvV,GAWA,SAAA+xB,GAAAxc,EAAAvV,GACA,OAAA,MAAAuV,GAAAvV,KAAApR,EAAA2mB,GA0BA,SAAAyc,GAAAC,EAAA3e,EAAAW,GASA,IARA,IAAA8a,EAAA9a,EAAAD,GAAAF,GACAtrB,EAAAypC,EAAA,GAAAzpC,OACA0pC,EAAAD,EAAAzpC,OACA2pC,EAAAD,EACAE,EAAAvqB,EAAAqqB,GACAG,EAAA9lC,EAAAA,EACAmV,EAAA,GAEAywB,KAAA,CACA,IAAA/e,EAAA6e,EAAAE,GACAA,GAAA7e,IACAF,EAAAc,GAAAd,EAAAwC,GAAAtC,KAEA+e,EAAApL,EAAA7T,EAAA5qB,OAAA6pC,GACAD,EAAAD,IAAAle,IAAAX,GAAA,KAAA9qB,GAAA,KAAA4qB,EAAA5qB,QACA,IAAAyhC,GAAAkI,GAAA/e,GACArpB,GAEAqpB,EAAA6e,EAAA,GAEA,IAAAhwB,GAAA,EACAqwB,EAAAF,EAAA,GAEAlD,EACA,OAAAjtB,EAAAzZ,GAAAkZ,EAAAlZ,OAAA6pC,GAAA,CACA,IAAAvjC,EAAAskB,EAAAnR,GACAktB,EAAA7b,EAAAA,EAAAxkB,GAAAA,EAGA,GADAA,EAAAmlB,GAAA,IAAAnlB,EAAAA,EAAA,IACAwjC,EACAvc,GAAAuc,EAAAnD,GACAJ,EAAArtB,EAAAytB,EAAAlb,IACA,CAEA,IADAke,EAAAD,IACAC,GAAA,CACA,IAAAnc,EAAAoc,EAAAD,GACA,KAAAnc,EACAD,GAAAC,EAAAmZ,GACAJ,EAAAkD,EAAAE,GAAAhD,EAAAlb,IAEA,SAAAib,EAGAoD,GACAA,EAAAx6B,KAAAq3B,GAEAztB,EAAA5J,KAAAhJ,IAGA,OAAA4S,EA+BA,SAAA6wB,GAAAhd,EAAA0b,EAAA30B,GAGA,IAAA2W,EAAA,OADAsC,EAAAid,GAAAjd,EADA0b,EAAAC,GAAAD,EAAA1b,KAEAA,EAAAA,EAAA4b,GAAAsB,GAAAxB,KACA,OAAA,MAAAhe,EAAAlpB,GAAAqY,GAAA6Q,EAAAsC,EAAAjZ,GAUA,SAAAo2B,GAAA5jC,GACA,OAAAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAA2b,GAuCA,SAAAkoB,GAAA7jC,EAAA+iC,EAAArF,EAAAC,EAAAC,GACA,OAAA59B,IAAA+iC,IAGA,MAAA/iC,GAAA,MAAA+iC,IAAAtJ,GAAAz5B,KAAAy5B,GAAAsJ,GACA/iC,GAAAA,GAAA+iC,GAAAA,EAmBA,SAAAtc,EAAAsc,EAAArF,EAAAC,EAAAmG,EAAAlG,GACA,IAAAmG,EAAArK,GAAAjT,GACAud,EAAAtK,GAAAqJ,GACAkB,EAAAF,EAAAnoB,GAAAuiB,GAAA1X,GACAyd,EAAAF,EAAApoB,GAAAuiB,GAAA4E,GAKAoB,GAHAF,EAAAA,GAAAtoB,GAAAS,GAAA6nB,IAGA7nB,GACAgoB,GAHAF,EAAAA,GAAAvoB,GAAAS,GAAA8nB,IAGA9nB,GACAioB,EAAAJ,GAAAC,EAEA,GAAAG,GAAAvM,GAAArR,GAAA,CACA,IAAAqR,GAAAiL,GACA,OAAA,EAGAoB,IADAJ,GAAA,GAGA,GAAAM,IAAAF,EAEA,OADAvG,IAAAA,EAAA,IAAAvC,IACA0I,GAAA7f,GAAAuC,GACA6d,GAAA7d,EAAAsc,EAAArF,EAAAC,EAAAmG,EAAAlG,GAy0EA,SAAAnX,EAAAsc,EAAA7E,EAAAR,EAAAC,EAAAmG,EAAAlG,GACA,OAAAM,GACA,KAAAthB,GACA,GAAA6J,EAAAwY,YAAA8D,EAAA9D,YACAxY,EAAAuY,YAAA+D,EAAA/D,WACA,OAAA,EAEAvY,EAAAA,EAAAsY,OACAgE,EAAAA,EAAAhE,OAEA,KAAApiB,GACA,QAAA8J,EAAAwY,YAAA8D,EAAA9D,aACA6E,EAAA,IAAAxN,EAAA7P,GAAA,IAAA6P,EAAAyM,KAKA,KAAAlnB,GACA,KAAAC,GACA,KAAAK,GAGA,OAAAxW,IAAA8gB,GAAAsc,GAEA,KAAAhnB,GACA,OAAA0K,EAAAtkB,MAAA4gC,EAAA5gC,MAAAskB,EAAA8d,SAAAxB,EAAAwB,QAEA,KAAAjoB,GACA,KAAAE,GAIA,OAAAiK,GAAAsc,EAAA,GAEA,KAAA7mB,GACA,IAAAsoB,EAAAzQ,GAEA,KAAAxX,GACA,IAAAkoB,EAhkLA,EAgkLA/G,EAGA,GAFA8G,IAAAA,EAAAlQ,IAEA7N,EAAAwN,MAAA8O,EAAA9O,OAAAwQ,EACA,OAAA,EAGA,IAAAhF,EAAA7B,EAAAnnB,IAAAgQ,GACA,GAAAgZ,EACA,OAAAA,GAAAsD,EAEArF,GA1kLA,EA6kLAE,EAAAvtB,IAAAoW,EAAAsc,GACA,IAAAnwB,EAAA0xB,GAAAE,EAAA/d,GAAA+d,EAAAzB,GAAArF,EAAAC,EAAAmG,EAAAlG,GAEA,OADAA,EAAA,OAAAnX,GACA7T,EAEA,KAAA6J,GACA,GAAA6c,GACA,OAAAA,GAAA7/B,KAAAgtB,IAAA6S,GAAA7/B,KAAAspC,GAGA,OAAA,EAt4EA2B,CAAAje,EAAAsc,EAAAkB,EAAAvG,EAAAC,EAAAmG,EAAAlG,GAEA,KAptGA,EAotGAF,GAAA,CACA,IAAAiH,EAAAR,GAAA7zB,EAAA7W,KAAAgtB,EAAA,eACAme,EAAAR,GAAA9zB,EAAA7W,KAAAspC,EAAA,eAEA,GAAA4B,GAAAC,EAAA,CACA,IAAAC,EAAAF,EAAAle,EAAAzmB,QAAAymB,EACAqe,EAAAF,EAAA7B,EAAA/iC,QAAA+iC,EAGA,OADAnF,IAAAA,EAAA,IAAAvC,IACAyI,EAAAe,EAAAC,EAAApH,EAAAC,EAAAC,IAGA,OAAAyG,IAGAzG,IAAAA,EAAA,IAAAvC,IAq4EA,SAAA5U,EAAAsc,EAAArF,EAAAC,EAAAmG,EAAAlG,GACA,IAAA6G,EAzmLA,EAymLA/G,EACAqH,EAAAnF,GAAAnZ,GACAue,EAAAD,EAAArrC,OAEA0pC,EADAxD,GAAAmD,GACArpC,OAEA,GAAAsrC,GAAA5B,IAAAqB,EACA,OAAA,EAGA,IADA,IAAAtxB,EAAA6xB,EACA7xB,KAAA,CACA,IAAAjC,EAAA6zB,EAAA5xB,GACA,KAAAsxB,EAAAvzB,KAAA6xB,EAAAzyB,EAAA7W,KAAAspC,EAAA7xB,IACA,OAAA,EAIA,IAAAuuB,EAAA7B,EAAAnnB,IAAAgQ,GACA,GAAAgZ,GAAA7B,EAAAnnB,IAAAssB,GACA,OAAAtD,GAAAsD,EAEA,IAAAnwB,GAAA,EACAgrB,EAAAvtB,IAAAoW,EAAAsc,GACAnF,EAAAvtB,IAAA0yB,EAAAtc,GAGA,IADA,IAAAwe,EAAAR,IACAtxB,EAAA6xB,GAAA,CACA9zB,EAAA6zB,EAAA5xB,GACA,IAAAupB,EAAAjW,EAAAvV,GACAg0B,EAAAnC,EAAA7xB,GAEA,GAAAysB,EACA,IAAAwH,EAAAV,EACA9G,EAAAuH,EAAAxI,EAAAxrB,EAAA6xB,EAAAtc,EAAAmX,GACAD,EAAAjB,EAAAwI,EAAAh0B,EAAAuV,EAAAsc,EAAAnF,GAGA,KAAAuH,IAAAlqC,GACAyhC,IAAAwI,GAAApB,EAAApH,EAAAwI,EAAAxH,EAAAC,EAAAC,GACAuH,GACA,CACAvyB,GAAA,EACA,MAEAqyB,IAAAA,EAAA,eAAA/zB,GAEA,GAAA0B,IAAAqyB,EAAA,CACA,IAAAG,EAAA3e,EAAA3iB,YACAuhC,EAAAtC,EAAAj/B,YAGAshC,GAAAC,GACA,gBAAA5e,GAAA,gBAAAsc,KACA,mBAAAqC,GAAAA,aAAAA,GACA,mBAAAC,GAAAA,aAAAA,KACAzyB,GAAA,GAKA,OAFAgrB,EAAA,OAAAnX,GACAmX,EAAA,OAAAmF,GACAnwB,EAj8EA0yB,CAAA7e,EAAAsc,EAAArF,EAAAC,EAAAmG,EAAAlG,IA3DA2H,CAAAvlC,EAAA+iC,EAAArF,EAAAC,EAAAkG,GAAAjG,IAmFA,SAAA4H,GAAA/e,EAAAxV,EAAAw0B,EAAA9H,GACA,IAAAxqB,EAAAsyB,EAAA/rC,OACAA,EAAAyZ,EACAuyB,GAAA/H,EAEA,GAAA,MAAAlX,EACA,OAAA/sB,EAGA,IADA+sB,EAAA3mB,EAAA2mB,GACAtT,KAAA,CACA,IAAAmoB,EAAAmK,EAAAtyB,GACA,GAAAuyB,GAAApK,EAAA,GACAA,EAAA,KAAA7U,EAAA6U,EAAA,MACAA,EAAA,KAAA7U,GAEA,OAAA,EAGA,OAAAtT,EAAAzZ,GAAA,CAEA,IAAAwX,GADAoqB,EAAAmK,EAAAtyB,IACA,GACAupB,EAAAjW,EAAAvV,GACAy0B,EAAArK,EAAA,GAEA,GAAAoK,GAAApK,EAAA,IACA,GAAAoB,IAAAzhC,MAAAiW,KAAAuV,GACA,OAAA,MAEA,CACA,IAAAmX,EAAA,IAAAvC,GACA,GAAAsC,EACA,IAAA/qB,EAAA+qB,EAAAjB,EAAAiJ,EAAAz0B,EAAAuV,EAAAxV,EAAA2sB,GAEA,KAAAhrB,IAAA3X,GACA4oC,GAAA8B,EAAAjJ,EAAAkJ,EAAAjI,EAAAC,GACAhrB,GAEA,OAAA,GAIA,OAAA,EAWA,SAAAizB,GAAA7lC,GACA,SAAAg6B,GAAAh6B,IAo4FA,SAAAmkB,GACA,QAAA2R,GAAAA,KAAA3R,EAr4FA2hB,CAAA9lC,MAGAiiC,GAAAjiC,GAAAo2B,EAAAlX,IACA5P,KAAA0pB,GAAAh5B,IA4CA,SAAA+lC,GAAA/lC,GAGA,MAAA,mBAAAA,EACAA,EAEA,MAAAA,EACAgmC,GAEA,iBAAAhmC,EACA05B,GAAA15B,GACAimC,GAAAjmC,EAAA,GAAAA,EAAA,IACAkmC,GAAAlmC,GAEAmmC,GAAAnmC,GAUA,SAAAomC,GAAA3f,GACA,IAAA4f,GAAA5f,GACA,OAAAwR,EAAAxR,GAEA,IAAA7T,EAAA,GACA,IAAA,IAAA1B,KAAApR,EAAA2mB,GACAnW,EAAA7W,KAAAgtB,EAAAvV,IAAA,eAAAA,GACA0B,EAAA5J,KAAAkI,GAGA,OAAA0B,EAUA,SAAA0zB,GAAA7f,GACA,IAAAuT,GAAAvT,GACA,OAo8FA,SAAAA,GACA,IAAA7T,EAAA,GACA,GAAA,MAAA6T,EACA,IAAA,IAAAvV,KAAApR,EAAA2mB,GACA7T,EAAA5J,KAAAkI,GAGA,OAAA0B,EA38FA2zB,CAAA9f,GAEA,IAAA+f,EAAAH,GAAA5f,GACA7T,EAAA,GAEA,IAAA,IAAA1B,KAAAuV,GACA,eAAAvV,IAAAs1B,GAAAl2B,EAAA7W,KAAAgtB,EAAAvV,KACA0B,EAAA5J,KAAAkI,GAGA,OAAA0B,EAYA,SAAA6zB,GAAAzmC,EAAA+iC,GACA,OAAA/iC,EAAA+iC,EAWA,SAAA2D,GAAA3gB,EAAAvB,GACA,IAAArR,GAAA,EACAP,EAAA+zB,GAAA5gB,GAAAhN,EAAAgN,EAAArsB,QAAA,GAKA,OAHAmjC,GAAA9W,EAAA,SAAA/lB,EAAAkR,EAAA6U,GACAnT,IAAAO,GAAAqR,EAAAxkB,EAAAkR,EAAA6U,KAEAnT,EAUA,SAAAszB,GAAAj1B,GACA,IAAAw0B,EAAAmB,GAAA31B,GACA,OAAA,GAAAw0B,EAAA/rC,QAAA+rC,EAAA,GAAA,GACAoB,GAAApB,EAAA,GAAA,GAAAA,EAAA,GAAA,IAEA,SAAAhf,GACA,OAAAA,IAAAxV,GAAAu0B,GAAA/e,EAAAxV,EAAAw0B,IAYA,SAAAQ,GAAA9D,EAAAwD,GACA,OAAAmB,GAAA3E,IAAA4E,GAAApB,GACAkB,GAAAxE,GAAAF,GAAAwD,GAEA,SAAAlf,GACA,IAAAiW,EAAAjmB,GAAAgQ,EAAA0b,GACA,OAAAzF,IAAAzhC,IAAAyhC,IAAAiJ,EACAqB,GAAAvgB,EAAA0b,GACA0B,GAAA8B,EAAAjJ,EAAAkJ,IAeA,SAAAqB,GAAAxgB,EAAAxV,EAAAi2B,EAAAvJ,EAAAC,GACAnX,IAAAxV,GAGA4wB,GAAA5wB,EAAA,SAAA00B,EAAAz0B,GACA,GAAA8oB,GAAA2L,GACA/H,IAAAA,EAAA,IAAAvC,IA+BA,SAAA5U,EAAAxV,EAAAC,EAAAg2B,EAAAC,EAAAxJ,EAAAC,GACA,IAAAlB,EAAA0K,GAAA3gB,EAAAvV,GACAy0B,EAAAyB,GAAAn2B,EAAAC,GACAuuB,EAAA7B,EAAAnnB,IAAAkvB,GAEA,GAAAlG,EAEA,OADAlD,GAAA9V,EAAAvV,EAAAuuB,GAGA,IAAA4H,EAAA1J,EACAA,EAAAjB,EAAAiJ,EAAAz0B,EAAA,GAAAuV,EAAAxV,EAAA2sB,GACA3iC,GAEAilC,EAAAmH,IAAApsC,GAEA,GAAAilC,EAAA,CACA,IAAAzE,EAAA/B,GAAAiM,GACA/J,GAAAH,GAAA3D,GAAA6N,GACA2B,GAAA7L,IAAAG,GAAA1X,GAAAyhB,GAEA0B,EAAA1B,EACAlK,GAAAG,GAAA0L,EAEAD,EADA3N,GAAAgD,GACAA,EAEA6K,GAAA7K,GACAN,GAAAM,GAEAd,EAEAyC,GAAAsH,IADAzF,GAAA,IAGAoH,EAEAnI,GAAAwG,IADAzF,GAAA,IAIA,GAGAsH,GAAA7B,IAAAhK,GAAAgK,GAEAhK,GADA0L,EAAA3K,GAEA2K,EAAAI,GAAA/K,GAEA1C,GAAA0C,KAAAuF,GAAAvF,KACA2K,EAAA/I,GAAAqH,IAIAzF,GAAA,EAGAA,IAEAtC,EAAAvtB,IAAAs1B,EAAA0B,GACAF,EAAAE,EAAA1B,EAAAuB,EAAAvJ,EAAAC,GACAA,EAAA,OAAA+H,IAEApJ,GAAA9V,EAAAvV,EAAAm2B,GAzFAK,CAAAjhB,EAAAxV,EAAAC,EAAAg2B,EAAAD,GAAAtJ,EAAAC,OAEA,CACA,IAAAyJ,EAAA1J,EACAA,EAAAyJ,GAAA3gB,EAAAvV,GAAAy0B,EAAAz0B,EAAA,GAAAuV,EAAAxV,EAAA2sB,GACA3iC,GAEAosC,IAAApsC,KACAosC,EAAA1B,GAEApJ,GAAA9V,EAAAvV,EAAAm2B,KAEA5I,IAwFA,SAAAkJ,GAAArjB,EAAAzrB,GACA,IAAAa,EAAA4qB,EAAA5qB,OACA,GAAAA,EAIA,OAAAqiC,GADAljC,GAAAA,EAAA,EAAAa,EAAA,EACAA,GAAA4qB,EAAAzrB,GAAAoC,GAYA,SAAA2sC,GAAA7hB,EAAA8hB,EAAAC,GACA,IAAA30B,GAAA,EAUA,OATA00B,EAAAziB,GAAAyiB,EAAAnuC,OAAAmuC,EAAA,CAAA7B,IAAAlf,GAAAihB,OAhvFA,SAAAzjB,EAAA0jB,GACA,IAAAtuC,EAAA4qB,EAAA5qB,OAGA,IADA4qB,EAAA2jB,KAAAD,GACAtuC,KACA4qB,EAAA5qB,GAAA4qB,EAAA5qB,GAAAsG,MAEA,OAAAskB,EAkvFA4jB,CAPAxB,GAAA3gB,EAAA,SAAA/lB,EAAAkR,EAAA6U,GAIA,MAAA,CAAAoiB,SAHA/iB,GAAAyiB,EAAA,SAAArjB,GACA,OAAAA,EAAAxkB,KAEAmT,QAAAA,EAAAnT,MAAAA,KAGA,SAAAymB,EAAAsc,GACA,OAm4BA,SAAAtc,EAAAsc,EAAA+E,GAOA,IANA,IAAA30B,GAAA,EACAi1B,EAAA3hB,EAAA0hB,SACAE,EAAAtF,EAAAoF,SACAzuC,EAAA0uC,EAAA1uC,OACA4uC,EAAAR,EAAApuC,SAEAyZ,EAAAzZ,GAAA,CACA,IAAAkZ,EAAA21B,GAAAH,EAAAj1B,GAAAk1B,EAAAl1B,IACA,GAAAP,EAAA,CACA,GAAA01B,GAAAn1B,EACA,OAAAP,EAEA,IAAA41B,EAAAV,EAAA30B,GACA,OAAAP,GAAA,QAAA41B,GAAA,EAAA,IAUA,OAAA/hB,EAAAtT,MAAA4vB,EAAA5vB,MA35BAs1B,CAAAhiB,EAAAsc,EAAA+E,KA4BA,SAAAY,GAAAjiB,EAAA2W,EAAAvY,GAKA,IAJA,IAAA1R,GAAA,EACAzZ,EAAA0jC,EAAA1jC,OACAkZ,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAyoC,EAAA/E,EAAAjqB,GACAnT,EAAAkiC,GAAAzb,EAAA0b,GAEAtd,EAAA7kB,EAAAmiC,IACAwG,GAAA/1B,EAAAwvB,GAAAD,EAAA1b,GAAAzmB,GAGA,OAAA4S,EA2BA,SAAAg2B,GAAAtkB,EAAAgB,EAAAd,EAAAW,GACA,IAAAzhB,EAAAyhB,EAAAmB,GAAArB,GACA9R,GAAA,EACAzZ,EAAA4rB,EAAA5rB,OACA8pC,EAAAlf,EAQA,IANAA,IAAAgB,IACAA,EAAA8W,GAAA9W,IAEAd,IACAgf,EAAApe,GAAAd,EAAAwC,GAAAtC,OAEArR,EAAAzZ,GAKA,IAJA,IAAAwsB,EAAA,EACAlmB,EAAAslB,EAAAnS,GACAktB,EAAA7b,EAAAA,EAAAxkB,GAAAA,GAEA,GAAAkmB,EAAAxiB,EAAA8/B,EAAAnD,EAAAna,EAAAf,KACAqe,IAAAlf,GACAuS,EAAAp9B,KAAA+pC,EAAAtd,EAAA,GAEA2Q,EAAAp9B,KAAA6qB,EAAA4B,EAAA,GAGA,OAAA5B,EAYA,SAAAukB,GAAAvkB,EAAAwkB,GAIA,IAHA,IAAApvC,EAAA4qB,EAAAwkB,EAAApvC,OAAA,EACA86B,EAAA96B,EAAA,EAEAA,KAAA,CACA,IAAAyZ,EAAA21B,EAAApvC,GACA,GAAAA,GAAA86B,GAAArhB,IAAA41B,EAAA,CACA,IAAAA,EAAA51B,EACA4oB,GAAA5oB,GACA0jB,EAAAp9B,KAAA6qB,EAAAnR,EAAA,GAEA61B,GAAA1kB,EAAAnR,IAIA,OAAAmR,EAYA,SAAA2X,GAAAsB,EAAAC,GACA,OAAAD,EAAA7F,EAAAY,KAAAkF,EAAAD,EAAA,IAkCA,SAAA0L,GAAAnV,EAAAj7B,GACA,IAAA+Z,EAAA,GACA,IAAAkhB,GAAAj7B,EAAA,GAAA0iB,GAAA1iB,EACA,OAAA+Z,EAIA,KACA/Z,EAAA,IACA+Z,GAAAkhB,IAEAj7B,EAAA6+B,EAAA7+B,EAAA,MAEAi7B,GAAAA,GAEAj7B,IAEA,OAAA+Z,EAWA,SAAAs2B,GAAA/kB,EAAAglB,GACA,OAAAC,GAAAC,GAAAllB,EAAAglB,EAAAnD,IAAA7hB,EAAA,IAUA,SAAAmlB,GAAAvjB,GACA,OAAAiW,GAAA1W,GAAAS,IAWA,SAAAwjB,GAAAxjB,EAAAltB,GACA,IAAAyrB,EAAAgB,GAAAS,GACA,OAAAoW,GAAA7X,EAAA+X,GAAAxjC,EAAA,EAAAyrB,EAAA5qB,SAaA,SAAAivC,GAAAliB,EAAA0b,EAAAniC,EAAA29B,GACA,IAAA3D,GAAAvT,GACA,OAAAA,EASA,IALA,IAAAtT,GAAA,EACAzZ,GAHAyoC,EAAAC,GAAAD,EAAA1b,IAGA/sB,OACA86B,EAAA96B,EAAA,EACA8vC,EAAA/iB,EAEA,MAAA+iB,KAAAr2B,EAAAzZ,GAAA,CACA,IAAAwX,EAAAmxB,GAAAF,EAAAhvB,IACAk0B,EAAArnC,EAEA,GAAAmT,GAAAqhB,EAAA,CACA,IAAAkI,EAAA8M,EAAAt4B,IACAm2B,EAAA1J,EAAAA,EAAAjB,EAAAxrB,EAAAs4B,GAAAvuC,MACAA,KACAosC,EAAArN,GAAA0C,GACAA,EACAX,GAAAoG,EAAAhvB,EAAA,IAAA,GAAA,IAGAspB,GAAA+M,EAAAt4B,EAAAm2B,GACAmC,EAAAA,EAAAt4B,GAEA,OAAAuV,EAWA,IAAAgjB,GAAA5Q,GAAA,SAAA1U,EAAAmX,GAEA,OADAzC,GAAAxoB,IAAA8T,EAAAmX,GACAnX,GAFA6hB,GAaA0D,GAAA3pC,EAAA,SAAAokB,EAAA2P,GACA,OAAA/zB,EAAAokB,EAAA,WAAA,CACA6Y,cAAA,EACAC,YAAA,EACAj9B,MAAA2pC,GAAA7V,GACAoJ,UAAA,KALA8I,GAgBA,SAAA4D,GAAA7jB,GACA,OAAAoW,GAAA7W,GAAAS,IAYA,SAAA8jB,GAAAvlB,EAAA6kB,EAAAW,GACA,IAAA32B,GAAA,EACAzZ,EAAA4qB,EAAA5qB,OAEAyvC,EAAA,IACAA,EAAAzvC,GAAAyvC,EAAA,EAAAzvC,EAAAyvC,IAEAW,EAAApwC,EAAAowC,EAAApwC,EAAAowC,GACA,IACAA,GAAApwC,GAEAA,EAAAowC,EAAAX,EAAA,EAAAW,EAAAX,IAAA,EACAA,KAAA,EAGA,IADA,IAAAv2B,EAAAmG,EAAArf,KACAyZ,EAAAzZ,GACAkZ,EAAAO,GAAAmR,EAAAnR,EAAAg2B,GAEA,OAAAv2B,EAYA,SAAAm3B,GAAAhkB,EAAAlB,GACA,IAAAjS,EAMA,OAJAiqB,GAAA9W,EAAA,SAAA/lB,EAAAmT,EAAA4S,GAEA,QADAnT,EAAAiS,EAAA7kB,EAAAmT,EAAA4S,QAGAnT,EAeA,SAAAo3B,GAAA1lB,EAAAtkB,EAAAiqC,GACA,IAAAC,EAAA,EACAC,EAAA,MAAA7lB,EAAA4lB,EAAA5lB,EAAA5qB,OAEA,GAAA,iBAAAsG,GAAAA,GAAAA,GAAAmqC,GA/7HA1uB,WA+7HA,CACA,KAAAyuB,EAAAC,GAAA,CACA,IAAAC,EAAAF,EAAAC,IAAA,EACA9J,EAAA/b,EAAA8lB,GAEA,OAAA/J,IAAAkB,GAAAlB,KACA4J,EAAA5J,GAAArgC,EAAAqgC,EAAArgC,GACAkqC,EAAA,EAAAE,EAEAD,EAAAC,EAGA,OAAAD,EAEA,OAAAE,GAAA/lB,EAAAtkB,EAAAgmC,GAAAiE,GAgBA,SAAAI,GAAA/lB,EAAAtkB,EAAAwkB,EAAAylB,GACAjqC,EAAAwkB,EAAAxkB,GASA,IAPA,IAAAkqC,EAAA,EACAC,EAAA,MAAA7lB,EAAA,EAAAA,EAAA5qB,OACA4wC,EAAAtqC,GAAAA,EACAuqC,EAAA,OAAAvqC,EACAwqC,EAAAjJ,GAAAvhC,GACAyqC,EAAAzqC,IAAA/E,GAEAivC,EAAAC,GAAA,CACA,IAAAC,EAAA1S,GAAAwS,EAAAC,GAAA,GACA9J,EAAA7b,EAAAF,EAAA8lB,IACAM,EAAArK,IAAAplC,GACA0vC,EAAA,OAAAtK,EACAuK,EAAAvK,GAAAA,EACAwK,EAAAtJ,GAAAlB,GAEA,GAAAiK,EACA,IAAAQ,EAAAb,GAAAW,OAEAE,EADAL,EACAG,IAAAX,GAAAS,GACAH,EACAK,GAAAF,IAAAT,IAAAU,GACAH,EACAI,GAAAF,IAAAC,IAAAV,IAAAY,IACAF,IAAAE,IAGAZ,EAAA5J,GAAArgC,EAAAqgC,EAAArgC,GAEA8qC,EACAZ,EAAAE,EAAA,EAEAD,EAAAC,EAGA,OAAAjS,EAAAgS,EAngIA1uB,YA+gIA,SAAAsvB,GAAAzmB,EAAAE,GAMA,IALA,IAAArR,GAAA,EACAzZ,EAAA4qB,EAAA5qB,OACAqrB,EAAA,EACAnS,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAktB,EAAA7b,EAAAA,EAAAxkB,GAAAA,EAEA,IAAAmT,IAAAxN,GAAA06B,EAAAmD,GAAA,CACA,IAAAA,EAAAnD,EACAztB,EAAAmS,KAAA,IAAA/kB,EAAA,EAAAA,GAGA,OAAA4S,EAWA,SAAAo4B,GAAAhrC,GACA,MAAA,iBAAAA,EACAA,EAEAuhC,GAAAvhC,GACAwb,IAEAxb,EAWA,SAAAirC,GAAAjrC,GAEA,GAAA,iBAAAA,EACA,OAAAA,EAEA,GAAA05B,GAAA15B,GAEA,OAAAolB,GAAAplB,EAAAirC,IAAA,GAEA,GAAA1J,GAAAvhC,GACA,OAAAu5B,GAAAA,GAAA9/B,KAAAuG,GAAA,GAEA,IAAA4S,EAAA5S,EAAA,GACA,MAAA,KAAA4S,GAAA,EAAA5S,IAAA,EAAA,EAAA,KAAA4S,EAYA,SAAAs4B,GAAA5mB,EAAAE,EAAAW,GACA,IAAAhS,GAAA,EACA8sB,EAAAjb,GACAtrB,EAAA4qB,EAAA5qB,OACAwmC,GAAA,EACAttB,EAAA,GACA4wB,EAAA5wB,EAEA,GAAAuS,EACA+a,GAAA,EACAD,EAAA/a,QAEA,GAzpIA,KAypIAxrB,EAAA,CACA,IAAA2W,EAAAmU,EAAA,KAAA2mB,GAAA7mB,GACA,GAAAjU,EACA,OAAAikB,GAAAjkB,GAEA6vB,GAAA,EACAD,EAAAhZ,GACAuc,EAAA,IAAArI,QAGAqI,EAAAhf,EAAA,GAAA5R,EAEAwtB,EACA,OAAAjtB,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAktB,EAAA7b,EAAAA,EAAAxkB,GAAAA,EAGA,GADAA,EAAAmlB,GAAA,IAAAnlB,EAAAA,EAAA,EACAkgC,GAAAG,GAAAA,EAAA,CAEA,IADA,IAAA+K,EAAA5H,EAAA9pC,OACA0xC,KACA,GAAA5H,EAAA4H,KAAA/K,EACA,SAAAD,EAGA5b,GACAgf,EAAAx6B,KAAAq3B,GAEAztB,EAAA5J,KAAAhJ,QAEAigC,EAAAuD,EAAAnD,EAAAlb,KACAqe,IAAA5wB,GACA4wB,EAAAx6B,KAAAq3B,GAEAztB,EAAA5J,KAAAhJ,IAGA,OAAA4S,EAWA,SAAAo2B,GAAAviB,EAAA0b,GAGA,OAAA,OADA1b,EAAAid,GAAAjd,EADA0b,EAAAC,GAAAD,EAAA1b,aAEAA,EAAA4b,GAAAsB,GAAAxB,KAaA,SAAAkJ,GAAA5kB,EAAA0b,EAAAmJ,EAAA3N,GACA,OAAAgL,GAAAliB,EAAA0b,EAAAmJ,EAAApJ,GAAAzb,EAAA0b,IAAAxE,GAcA,SAAA4N,GAAAjnB,EAAAO,EAAA2mB,EAAArlB,GAIA,IAHA,IAAAzsB,EAAA4qB,EAAA5qB,OACAyZ,EAAAgT,EAAAzsB,GAAA,GAEAysB,EAAAhT,MAAAA,EAAAzZ,IACAmrB,EAAAP,EAAAnR,GAAAA,EAAAmR,KAEA,OAAAknB,EACA3B,GAAAvlB,EAAA6B,EAAA,EAAAhT,EAAAgT,EAAAhT,EAAA,EAAAzZ,GACAmwC,GAAAvlB,EAAA6B,EAAAhT,EAAA,EAAA,EAAAgT,EAAAzsB,EAAAyZ,GAaA,SAAAs4B,GAAAzrC,EAAA0rC,GACA,IAAA94B,EAAA5S,EAIA,OAHA4S,aAAA+mB,KACA/mB,EAAAA,EAAA5S,SAEAwlB,GAAAkmB,EAAA,SAAA94B,EAAA+4B,GACA,OAAAA,EAAAxnB,KAAA7Q,MAAAq4B,EAAAvnB,QAAAiB,GAAA,CAAAzS,GAAA+4B,EAAAn+B,QACAoF,GAaA,SAAAg5B,GAAAzI,EAAA3e,EAAAW,GACA,IAAAzrB,EAAAypC,EAAAzpC,OACA,GAAAA,EAAA,EACA,OAAAA,EAAAwxC,GAAA/H,EAAA,IAAA,GAKA,IAHA,IAAAhwB,GAAA,EACAP,EAAAmG,EAAArf,KAEAyZ,EAAAzZ,GAIA,IAHA,IAAA4qB,EAAA6e,EAAAhwB,GACAkwB,GAAA,IAEAA,EAAA3pC,GACA2pC,GAAAlwB,IACAP,EAAAO,GAAA6sB,GAAAptB,EAAAO,IAAAmR,EAAA6e,EAAAE,GAAA7e,EAAAW,IAIA,OAAA+lB,GAAAzJ,GAAA7uB,EAAA,GAAA4R,EAAAW,GAYA,SAAA0mB,GAAA7kB,EAAA1B,EAAAwmB,GAMA,IALA,IAAA34B,GAAA,EACAzZ,EAAAstB,EAAAttB,OACAqyC,EAAAzmB,EAAA5rB,OACAkZ,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAsG,EAAAmT,EAAA44B,EAAAzmB,EAAAnS,GAAAlY,GACA6wC,EAAAl5B,EAAAoU,EAAA7T,GAAAnT,GAEA,OAAA4S,EAUA,SAAAo5B,GAAAhsC,GACA,OAAAunC,GAAAvnC,GAAAA,EAAA,GAUA,SAAAisC,GAAAjsC,GACA,MAAA,mBAAAA,EAAAA,EAAAgmC,GAWA,SAAA5D,GAAApiC,EAAAymB,GACA,OAAAiT,GAAA15B,GACAA,EAEA8mC,GAAA9mC,EAAAymB,GAAA,CAAAzmB,GAAAksC,GAAA7sC,GAAAW,IAYA,IAAAmsC,GAAAjD,GAWA,SAAAkD,GAAA9nB,EAAA6kB,EAAAW,GACA,IAAApwC,EAAA4qB,EAAA5qB,OAEA,OADAowC,EAAAA,IAAA7uC,GAAAvB,EAAAowC,GACAX,GAAAzvC,GAAAowC,EAAAxlB,EAAAulB,GAAAvlB,EAAA6kB,EAAAW,GASA,IAAA1S,GAAAD,GAAA,SAAAkV,GACA,OAAAxyC,GAAAu9B,aAAAiV,IAWA,SAAAhO,GAAAU,EAAAlB,GACA,GAAAA,EACA,OAAAkB,EAAAt5B,QAEA,IAAA/L,EAAAqlC,EAAArlC,OACAkZ,EAAA2jB,EAAAA,EAAA78B,GAAA,IAAAqlC,EAAAj7B,YAAApK,GAGA,OADAqlC,EAAA1vB,KAAAuD,GACAA,EAUA,SAAAisB,GAAAyN,GACA,IAAA15B,EAAA,IAAA05B,EAAAxoC,YAAAwoC,EAAArN,YAEA,OADA,IAAA3I,EAAA1jB,GAAAvC,IAAA,IAAAimB,EAAAgW,IACA15B,EAgDA,SAAAusB,GAAAoN,EAAA1O,GACA,IAAAkB,EAAAlB,EAAAgB,GAAA0N,EAAAxN,QAAAwN,EAAAxN,OACA,OAAA,IAAAwN,EAAAzoC,YAAAi7B,EAAAwN,EAAAvN,WAAAuN,EAAA7yC,QAWA,SAAA6uC,GAAAvoC,EAAA+iC,GACA,GAAA/iC,IAAA+iC,EAAA,CACA,IAAAyJ,EAAAxsC,IAAA/E,GACAsvC,EAAA,OAAAvqC,EACAysC,EAAAzsC,GAAAA,EACAwqC,EAAAjJ,GAAAvhC,GAEA0qC,EAAA3H,IAAA9nC,GACA0vC,EAAA,OAAA5H,EACA6H,EAAA7H,GAAAA,EACA8H,EAAAtJ,GAAAwB,GAEA,IAAA4H,IAAAE,IAAAL,GAAAzH,EAAA/iC,GACAwqC,GAAAE,GAAAE,IAAAD,IAAAE,GACAN,GAAAG,GAAAE,IACA4B,GAAA5B,IACA6B,EACA,OAAA,EAEA,IAAAlC,IAAAC,IAAAK,GAAA7qC,EAAA+iC,GACA8H,GAAA2B,GAAAC,IAAAlC,IAAAC,GACAG,GAAA6B,GAAAC,IACA/B,GAAA+B,IACA7B,EACA,OAAA,EAGA,OAAA,EAuDA,SAAA8B,GAAAl/B,EAAAm/B,EAAAC,EAAAC,GAUA,IATA,IAAAC,GAAA,EACAC,EAAAv/B,EAAA9T,OACAszC,EAAAJ,EAAAlzC,OACAuzC,GAAA,EACAC,EAAAP,EAAAjzC,OACAyzC,EAAAjV,EAAA6U,EAAAC,EAAA,GACAp6B,EAAAmG,EAAAm0B,EAAAC,GACAC,GAAAP,IAEAI,EAAAC,GACAt6B,EAAAq6B,GAAAN,EAAAM,GAEA,OAAAH,EAAAE,IACAI,GAAAN,EAAAC,KACAn6B,EAAAg6B,EAAAE,IAAAt/B,EAAAs/B,IAGA,KAAAK,KACAv6B,EAAAq6B,KAAAz/B,EAAAs/B,KAEA,OAAAl6B,EAcA,SAAAy6B,GAAA7/B,EAAAm/B,EAAAC,EAAAC,GAWA,IAVA,IAAAC,GAAA,EACAC,EAAAv/B,EAAA9T,OACA4zC,GAAA,EACAN,EAAAJ,EAAAlzC,OACA6zC,GAAA,EACAC,EAAAb,EAAAjzC,OACAyzC,EAAAjV,EAAA6U,EAAAC,EAAA,GACAp6B,EAAAmG,EAAAo0B,EAAAK,GACAJ,GAAAP,IAEAC,EAAAK,GACAv6B,EAAAk6B,GAAAt/B,EAAAs/B,GAGA,IADA,IAAAvnB,EAAAunB,IACAS,EAAAC,GACA56B,EAAA2S,EAAAgoB,GAAAZ,EAAAY,GAEA,OAAAD,EAAAN,IACAI,GAAAN,EAAAC,KACAn6B,EAAA2S,EAAAqnB,EAAAU,IAAA9/B,EAAAs/B,MAGA,OAAAl6B,EAWA,SAAAwpB,GAAAnrB,EAAAqT,GACA,IAAAnR,GAAA,EACAzZ,EAAAuX,EAAAvX,OAGA,IADA4qB,IAAAA,EAAAvL,EAAArf,MACAyZ,EAAAzZ,GACA4qB,EAAAnR,GAAAlC,EAAAkC,GAEA,OAAAmR,EAaA,SAAAyY,GAAA9rB,EAAA+V,EAAAP,EAAAkX,GACA,IAAA8P,GAAAhnB,EACAA,IAAAA,EAAA,IAKA,IAHA,IAAAtT,GAAA,EACAzZ,EAAAstB,EAAAttB,SAEAyZ,EAAAzZ,GAAA,CACA,IAAAwX,EAAA8V,EAAA7T,GAEAk0B,EAAA1J,EACAA,EAAAlX,EAAAvV,GAAAD,EAAAC,GAAAA,EAAAuV,EAAAxV,GACAhW,GAEAosC,IAAApsC,KACAosC,EAAAp2B,EAAAC,IAEAu8B,EACAjR,GAAA/V,EAAAvV,EAAAm2B,GAEA5K,GAAAhW,EAAAvV,EAAAm2B,GAGA,OAAA5gB,EAmCA,SAAAinB,GAAAnpB,EAAAopB,GACA,OAAA,SAAA5nB,EAAAvB,GACA,IAAAL,EAAAuV,GAAA3T,GAAA1B,GAAAuY,GACAnY,EAAAkpB,EAAAA,IAAA,GAEA,OAAAxpB,EAAA4B,EAAAxB,EAAAwjB,GAAAvjB,EAAA,GAAAC,IAWA,SAAAmpB,GAAAC,GACA,OAAA3E,GAAA,SAAAziB,EAAAqnB,GACA,IAAA36B,GAAA,EACAzZ,EAAAo0C,EAAAp0C,OACAikC,EAAA,EAAAjkC,EAAAo0C,EAAAp0C,EAAA,GAAAuB,GACAyS,EAAA,EAAAhU,EAAAo0C,EAAA,GAAA7yC,GAWA,IATA0iC,EAAA,EAAAkQ,EAAAn0C,QAAA,mBAAAikC,GACAjkC,IAAAikC,GACA1iC,GAEAyS,GAAAqgC,GAAAD,EAAA,GAAAA,EAAA,GAAApgC,KACAiwB,EAAAjkC,EAAA,EAAAuB,GAAA0iC,EACAjkC,EAAA,GAEA+sB,EAAA3mB,EAAA2mB,KACAtT,EAAAzZ,GAAA,CACA,IAAAuX,EAAA68B,EAAA36B,GACAlC,GACA48B,EAAApnB,EAAAxV,EAAAkC,EAAAwqB,GAGA,OAAAlX,IAYA,SAAAwa,GAAAjb,EAAAG,GACA,OAAA,SAAAJ,EAAAvB,GACA,GAAA,MAAAuB,EACA,OAAAA,EAEA,IAAA4gB,GAAA5gB,GACA,OAAAC,EAAAD,EAAAvB,GAMA,IAJA,IAAA9qB,EAAAqsB,EAAArsB,OACAyZ,EAAAgT,EAAAzsB,GAAA,EACAs0C,EAAAluC,EAAAimB,IAEAI,EAAAhT,MAAAA,EAAAzZ,KACA,IAAA8qB,EAAAwpB,EAAA76B,GAAAA,EAAA66B,KAIA,OAAAjoB,GAWA,SAAA+b,GAAA3b,GACA,OAAA,SAAAM,EAAAjC,EAAA+d,GAMA,IALA,IAAApvB,GAAA,EACA66B,EAAAluC,EAAA2mB,GACAO,EAAAub,EAAA9b,GACA/sB,EAAAstB,EAAAttB,OAEAA,KAAA,CACA,IAAAwX,EAAA8V,EAAAb,EAAAzsB,IAAAyZ,GACA,IAAA,IAAAqR,EAAAwpB,EAAA98B,GAAAA,EAAA88B,GACA,MAGA,OAAAvnB,GAgCA,SAAAwnB,GAAA11B,GACA,OAAA,SAAAub,GAGA,IAAAzM,EAAAwM,GAFAC,EAAAz0B,GAAAy0B,IAGAY,GAAAZ,GACA74B,GAEA24B,EAAAvM,EACAA,EAAA,GACAyM,EAAAnwB,OAAA,GAEAuqC,EAAA7mB,EACA+kB,GAAA/kB,EAAA,GAAA/F,KAAA,IACAwS,EAAAruB,MAAA,GAEA,OAAAmuB,EAAArb,KAAA21B,GAWA,SAAAC,GAAAl1B,GACA,OAAA,SAAA6a,GACA,OAAAtO,GAAA4oB,GAAAC,GAAAva,GAAA7lB,QAAAwT,GAAA,KAAAxI,EAAA,KAYA,SAAAq1B,GAAA3pC,GACA,OAAA,WAIA,IAAA6I,EAAAuB,UACA,OAAAvB,EAAA9T,QACA,KAAA,EAAA,OAAA,IAAAiL,EACA,KAAA,EAAA,OAAA,IAAAA,EAAA6I,EAAA,IACA,KAAA,EAAA,OAAA,IAAA7I,EAAA6I,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAA,IAAA7I,EAAA6I,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAA,IAAA7I,EAAA6I,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAA,IAAA7I,EAAA6I,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAA,IAAA7I,EAAA6I,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAA,IAAA7I,EAAA6I,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IAEA,IAAA+gC,EAAAzU,GAAAn1B,EAAA9I,WACA+W,EAAAjO,EAAA2O,MAAAi7B,EAAA/gC,GAIA,OAAAwsB,GAAApnB,GAAAA,EAAA27B,GAgDA,SAAAC,GAAAC,GACA,OAAA,SAAA1oB,EAAAlB,EAAAqB,GACA,IAAA8nB,EAAAluC,EAAAimB,GACA,IAAA4gB,GAAA5gB,GAAA,CACA,IAAAvB,EAAAujB,GAAAljB,EAAA,GACAkB,EAAAhT,GAAAgT,GACAlB,EAAA,SAAA3T,GAAA,OAAAsT,EAAAwpB,EAAA98B,GAAAA,EAAA88B,IAEA,IAAA76B,EAAAs7B,EAAA1oB,EAAAlB,EAAAqB,GACA,OAAA,EAAA/S,EAAA66B,EAAAxpB,EAAAuB,EAAA5S,GAAAA,GAAAlY,IAWA,SAAAyzC,GAAAvoB,GACA,OAAAwoB,GAAA,SAAAC,GACA,IAAAl1C,EAAAk1C,EAAAl1C,OACAyZ,EAAAzZ,EACAm1C,EAAAjV,GAAA/9B,UAAAizC,KAKA,IAHA3oB,GACAyoB,EAAAhrC,UAEAuP,KAAA,CACA,IAAAgR,EAAAyqB,EAAAz7B,GACA,GAAA,mBAAAgR,EACA,MAAA,IAAAoR,EAAApa,IAEA,GAAA0zB,IAAAE,GAAA,WAAAC,GAAA7qB,GACA,IAAA4qB,EAAA,IAAAnV,GAAA,IAAA,GAIA,IADAzmB,EAAA47B,EAAA57B,EAAAzZ,IACAyZ,EAAAzZ,GAAA,CAGA,IAAAof,EAAAk2B,GAFA7qB,EAAAyqB,EAAAz7B,IAGAmoB,EAAA,WAAAxiB,EAAAm2B,GAAA9qB,GAAAlpB,GAMA8zC,EAJAzT,GAAA4T,GAAA5T,EAAA,KACA,KAAAA,EAAA,KACAA,EAAA,GAAA5hC,QAAA,GAAA4hC,EAAA,GAEAyT,EAAAC,GAAA1T,EAAA,KAAAhoB,MAAAy7B,EAAAzT,EAAA,IAEA,GAAAnX,EAAAzqB,QAAAw1C,GAAA/qB,GACA4qB,EAAAj2B,KACAi2B,EAAAD,KAAA3qB,GAGA,OAAA,WACA,IAAA3W,EAAAuB,UACA/O,EAAAwN,EAAA,GAEA,GAAAuhC,GAAA,GAAAvhC,EAAA9T,QAAAggC,GAAA15B,GACA,OAAA+uC,EAAAI,MAAAnvC,GAAAA,QAKA,IAHA,IAAAmT,EAAA,EACAP,EAAAlZ,EAAAk1C,EAAAz7B,GAAAG,MAAA1X,KAAA4R,GAAAxN,IAEAmT,EAAAzZ,GACAkZ,EAAAg8B,EAAAz7B,GAAA1Z,KAAAmC,KAAAgX,GAEA,OAAAA,KAwBA,SAAAw8B,GAAAjrB,EAAAuZ,EAAAtZ,EAAAuoB,EAAAC,EAAAyC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,IAAAC,EAAAhS,EAAApiB,GACAq0B,EAr/JA,EAq/JAjS,EACAkS,EAr/JA,EAq/JAlS,EACAmP,EAAA,GAAAnP,EACAmS,EA/+JA,IA++JAnS,EACA/4B,EAAAirC,EAAA30C,GAAAqzC,GAAAnqB,GA6CA,OA3CA,SAAA4qB,IAKA,IAJA,IAAAr1C,EAAAqV,UAAArV,OACA8T,EAAAuL,EAAArf,GACAyZ,EAAAzZ,EAEAyZ,KACA3F,EAAA2F,GAAApE,UAAAoE,GAEA,GAAA05B,EACA,IAAAxY,EAAAyb,GAAAf,GACAgB,EA1/HA,SAAAzrB,EAAA+P,GAIA,IAHA,IAAA36B,EAAA4qB,EAAA5qB,OACAkZ,EAAA,EAEAlZ,KACA4qB,EAAA5qB,KAAA26B,KACAzhB,EAGA,OAAAA,EAi/HAo9B,CAAAxiC,EAAA6mB,GASA,GAPAsY,IACAn/B,EAAAk/B,GAAAl/B,EAAAm/B,EAAAC,EAAAC,IAEAwC,IACA7hC,EAAA6/B,GAAA7/B,EAAA6hC,EAAAC,EAAAzC,IAEAnzC,GAAAq2C,EACAlD,GAAAnzC,EAAA+1C,EAAA,CACA,IAAAQ,EAAA7b,GAAA5mB,EAAA6mB,GACA,OAAA6b,GACA/rB,EAAAuZ,EAAA0R,GAAAL,EAAA1a,YAAAjQ,EACA5W,EAAAyiC,EAAAV,EAAAC,EAAAC,EAAA/1C,GAGA,IAAA60C,EAAAoB,EAAAvrB,EAAAxoB,KACAu0C,EAAAP,EAAArB,EAAApqB,GAAAA,EAcA,OAZAzqB,EAAA8T,EAAA9T,OACA61C,EACA/hC,EA83CA,SAAA8W,EAAAwkB,GAKA,IAJA,IAAAsH,EAAA9rB,EAAA5qB,OACAA,EAAAy+B,EAAA2Q,EAAApvC,OAAA02C,GACAC,EAAAjU,GAAA9X,GAEA5qB,KAAA,CACA,IAAAyZ,EAAA21B,EAAApvC,GACA4qB,EAAA5qB,GAAAqiC,GAAA5oB,EAAAi9B,GAAAC,EAAAl9B,GAAAlY,GAEA,OAAAqpB,EAv4CAgsB,CAAA9iC,EAAA+hC,GACAM,GAAA,EAAAn2C,GACA8T,EAAA5J,UAEA8rC,GAAAF,EAAA91C,IACA8T,EAAA9T,OAAA81C,GAEA5zC,MAAAA,OAAA/B,IAAA+B,gBAAAmzC,IACAoB,EAAAxrC,GAAA2pC,GAAA6B,IAEAA,EAAA78B,MAAAi7B,EAAA/gC,IAaA,SAAA+iC,GAAAhsB,EAAAisB,GACA,OAAA,SAAA/pB,EAAAjC,GACA,OA59DA,SAAAiC,EAAAlC,EAAAC,EAAAC,GAIA,OAHAyc,GAAAza,EAAA,SAAAzmB,EAAAkR,EAAAuV,GACAlC,EAAAE,EAAAD,EAAAxkB,GAAAkR,EAAAuV,KAEAhC,EAw9DAgsB,CAAAhqB,EAAAlC,EAAAisB,EAAAhsB,GAAA,KAYA,SAAAksB,GAAAC,EAAAC,GACA,OAAA,SAAA5wC,EAAA+iC,GACA,IAAAnwB,EACA,GAAA5S,IAAA/E,IAAA8nC,IAAA9nC,GACA,OAAA21C,EAKA,GAHA5wC,IAAA/E,KACA2X,EAAA5S,GAEA+iC,IAAA9nC,GAAA,CACA,GAAA2X,IAAA3X,GACA,OAAA8nC,EAIAA,EAFA,iBAAA/iC,GAAA,iBAAA+iC,GACA/iC,EAAAirC,GAAAjrC,GACAirC,GAAAlI,KAEA/iC,EAAAgrC,GAAAhrC,GACAgrC,GAAAjI,IAEAnwB,EAAA+9B,EAAA3wC,EAAA+iC,GAEA,OAAAnwB,GAWA,SAAAi+B,GAAAC,GACA,OAAAnC,GAAA,SAAA9G,GAEA,OADAA,EAAAziB,GAAAyiB,EAAA/gB,GAAAihB,OACAmB,GAAA,SAAA17B,GACA,IAAA4W,EAAAxoB,KACA,OAAAk1C,EAAAjJ,EAAA,SAAArjB,GACA,OAAAlR,GAAAkR,EAAAJ,EAAA5W,SAeA,SAAAujC,GAAAr3C,EAAAs3C,GAGA,IAAAC,GAFAD,EAAAA,IAAA/1C,GAAA,IAAAgwC,GAAA+F,IAEAt3C,OACA,GAAAu3C,EAAA,EACA,OAAAA,EAAAhI,GAAA+H,EAAAt3C,GAAAs3C,EAEA,IAAAp+B,EAAAq2B,GAAA+H,EAAAvZ,EAAA/9B,EAAA66B,GAAAyc,KACA,OAAAnd,GAAAmd,GACA5E,GAAA1X,GAAA9hB,GAAA,EAAAlZ,GAAA4nB,KAAA,IACA1O,EAAAnN,MAAA,EAAA/L,GA6CA,SAAAw3C,GAAA/qB,GACA,OAAA,SAAAgjB,EAAAW,EAAAqH,GAaA,OAZAA,GAAA,iBAAAA,GAAApD,GAAA5E,EAAAW,EAAAqH,KACArH,EAAAqH,EAAAl2C,IAGAkuC,EAAAiI,GAAAjI,GACAW,IAAA7uC,IACA6uC,EAAAX,EACAA,EAAA,GAEAW,EAAAsH,GAAAtH,GAr7CA,SAAAX,EAAAW,EAAAqH,EAAAhrB,GAKA,IAJA,IAAAhT,GAAA,EACAzZ,EAAAw+B,EAAAT,GAAAqS,EAAAX,IAAAgI,GAAA,IAAA,GACAv+B,EAAAmG,EAAArf,GAEAA,KACAkZ,EAAAuT,EAAAzsB,IAAAyZ,GAAAg2B,EACAA,GAAAgI,EAEA,OAAAv+B,EA+6CAy+B,CAAAlI,EAAAW,EADAqH,EAAAA,IAAAl2C,GAAAkuC,EAAAW,EAAA,GAAA,EAAAsH,GAAAD,GACAhrB,IAWA,SAAAmrB,GAAAX,GACA,OAAA,SAAA3wC,EAAA+iC,GAKA,MAJA,iBAAA/iC,GAAA,iBAAA+iC,IACA/iC,EAAAgL,GAAAhL,GACA+iC,EAAA/3B,GAAA+3B,IAEA4N,EAAA3wC,EAAA+iC,IAqBA,SAAAmN,GAAA/rB,EAAAuZ,EAAA6T,EAAAld,EAAAjQ,EAAAuoB,EAAAC,EAAA2C,EAAAC,EAAAC,GACA,IAAA+B,EA9tKA,EA8tKA9T,EAMAA,GAAA8T,EAluKA,GACA,GAJA,GAsuKA9T,KAAA8T,EAluKA,GADA,OAsuKA9T,IAAA,GAEA,IAAA+T,EAAA,CACAttB,EAAAuZ,EAAAtZ,EAVAotB,EAAA7E,EAAA1xC,GAFAu2C,EAAA5E,EAAA3xC,GAGAu2C,EAAAv2C,GAAA0xC,EAFA6E,EAAAv2C,GAAA2xC,EAYA2C,EAAAC,EAAAC,GAGA78B,EAAA2+B,EAAAj+B,MAAArY,GAAAw2C,GAKA,OAJAvC,GAAA/qB,IACAutB,GAAA9+B,EAAA6+B,GAEA7+B,EAAAyhB,YAAAA,EACAsd,GAAA/+B,EAAAuR,EAAAuZ,GAUA,SAAAkU,GAAAr5B,GACA,IAAA4L,EAAAnqB,EAAAue,GACA,OAAA,SAAA+kB,EAAA38B,GAGA,GAFA28B,EAAAtyB,GAAAsyB,GACA38B,EAAA,MAAAA,EAAA,EAAAw3B,EAAA0Z,GAAAlxC,GAAA,KACA,CAGA,IAAAmxC,GAAAzyC,GAAAi+B,GAAA,KAAA1iB,MAAA,KAIA,SADAk3B,GAAAzyC,GAFA8kB,EAAA2tB,EAAA,GAAA,MAAAA,EAAA,GAAAnxC,KAEA,KAAAia,MAAA,MACA,GAAA,MAAAk3B,EAAA,GAAAnxC,IAEA,OAAAwjB,EAAAmZ,IAWA,IAAA6N,GAAAzS,IAAA,EAAApE,GAAA,IAAAoE,GAAA,CAAA,EAAA,KAAA,IAjwKA,EAAA,EAiwKA,SAAApT,GACA,OAAA,IAAAoT,GAAApT,IADAysB,GAWA,SAAAC,GAAAzP,GACA,OAAA,SAAA9b,GACA,IAAAyX,EAAAC,GAAA1X,GACA,OAAAyX,GAAAhiB,GACA6X,GAAAtN,GAEAyX,GAAA3hB,GAnnIA,SAAAlM,GACA,IAAA8C,GAAA,EACAP,EAAAmG,MAAA1I,EAAA4jB,MAKA,OAHA5jB,EAAA6C,QAAA,SAAAlT,GACA4S,IAAAO,GAAA,CAAAnT,EAAAA,KAEA4S,EA6mIAq/B,CAAAxrB,GAz3IA,SAAAA,EAAAO,GACA,OAAA5B,GAAA4B,EAAA,SAAA9V,GACA,MAAA,CAAAA,EAAAuV,EAAAvV,MAy3IAghC,CAAAzrB,EAAA8b,EAAA9b,KA6BA,SAAA0rB,GAAAhuB,EAAAuZ,EAAAtZ,EAAAuoB,EAAAC,EAAA2C,EAAAC,EAAAC,GACA,IAAAG,EA30KA,EA20KAlS,EACA,IAAAkS,GAAA,mBAAAzrB,EACA,MAAA,IAAAoR,EAAApa,IAEA,IAAAzhB,EAAAizC,EAAAA,EAAAjzC,OAAA,EASA,GARAA,IACAgkC,IAAA,GACAiP,EAAAC,EAAA3xC,IAEAu0C,EAAAA,IAAAv0C,GAAAu0C,EAAAtX,EAAA2Z,GAAArC,GAAA,GACAC,EAAAA,IAAAx0C,GAAAw0C,EAAAoC,GAAApC,GACA/1C,GAAAkzC,EAAAA,EAAAlzC,OAAA,EAj1KA,GAm1KAgkC,EAAA,CACA,IAAA2R,EAAA1C,EACA2C,EAAA1C,EAEAD,EAAAC,EAAA3xC,GAEA,IAAAqgC,EAAAsU,EAAA30C,GAAAg0C,GAAA9qB,GAEAstB,EAAA,CACAttB,EAAAuZ,EAAAtZ,EAAAuoB,EAAAC,EAAAyC,EAAAC,EACAC,EAAAC,EAAAC,GAkBA,GAfAnU,GAy6BA,SAAAA,EAAArqB,GACA,IAAAysB,EAAApC,EAAA,GACA8W,EAAAnhC,EAAA,GACAohC,EAAA3U,EAAA0U,EACAlS,EAAAmS,EAAA,IAEAC,EACAF,GAAA92B,IAnxMA,GAmxMAoiB,GACA0U,GAAA92B,IA/wMA,KA+wMAoiB,GAAApC,EAAA,GAAA5hC,QAAAuX,EAAA,IACA,KAAAmhC,GAAAnhC,EAAA,GAAAvX,QAAAuX,EAAA,IArxMA,GAqxMAysB,EAGA,GAAAwC,GAAAoS,EAAA,CA3xMA,EA+xMAF,IACA9W,EAAA,GAAArqB,EAAA,GAEAohC,GAlyMA,EAkyMA3U,EAAA,EAhyMA,GAmyMA,IAAA19B,EAAAiR,EAAA,GACA,GAAAjR,EAAA,CACA,IAAA2sC,EAAArR,EAAA,GACAA,EAAA,GAAAqR,EAAAD,GAAAC,EAAA3sC,EAAAiR,EAAA,IAAAjR,EACAs7B,EAAA,GAAAqR,EAAAvY,GAAAkH,EAAA,GAAAjgB,IAAApK,EAAA,IAGAjR,EAAAiR,EAAA,MAEA07B,EAAArR,EAAA,GACAA,EAAA,GAAAqR,EAAAU,GAAAV,EAAA3sC,EAAAiR,EAAA,IAAAjR,EACAs7B,EAAA,GAAAqR,EAAAvY,GAAAkH,EAAA,GAAAjgB,IAAApK,EAAA,KAGAjR,EAAAiR,EAAA,MAEAqqB,EAAA,GAAAt7B,GAGAoyC,EAAA92B,KACAggB,EAAA,GAAA,MAAAA,EAAA,GAAArqB,EAAA,GAAAknB,EAAAmD,EAAA,GAAArqB,EAAA,KAGA,MAAAqqB,EAAA,KACAA,EAAA,GAAArqB,EAAA,IAGAqqB,EAAA,GAAArqB,EAAA,GACAqqB,EAAA,GAAA+W,GA19BAE,CAAAd,EAAAnW,GAEAnX,EAAAstB,EAAA,GACA/T,EAAA+T,EAAA,GACArtB,EAAAqtB,EAAA,GACA9E,EAAA8E,EAAA,GACA7E,EAAA6E,EAAA,KACAhC,EAAAgC,EAAA,GAAAA,EAAA,KAAAx2C,GACA20C,EAAA,EAAAzrB,EAAAzqB,OACAw+B,EAAAuZ,EAAA,GAAA/3C,EAAA,KAEA,GAAAgkC,IACAA,IAAA,IAEAA,GAr3KA,GAq3KAA,EAGA9qB,EAr3KA,GAo3KA8qB,GAn3KA,IAm3KAA,EApgBA,SAAAvZ,EAAAuZ,EAAA+R,GACA,IAAA9qC,EAAA2pC,GAAAnqB,GAwBA,OAtBA,SAAA4qB,IAMA,IALA,IAAAr1C,EAAAqV,UAAArV,OACA8T,EAAAuL,EAAArf,GACAyZ,EAAAzZ,EACA26B,EAAAyb,GAAAf,GAEA57B,KACA3F,EAAA2F,GAAApE,UAAAoE,GAEA,IAAAy5B,EAAAlzC,EAAA,GAAA8T,EAAA,KAAA6mB,GAAA7mB,EAAA9T,EAAA,KAAA26B,EACA,GACAD,GAAA5mB,EAAA6mB,GAGA,OADA36B,GAAAkzC,EAAAlzC,QACA+1C,EACAS,GACA/rB,EAAAuZ,EAAA0R,GAAAL,EAAA1a,YAAAp5B,GACAuS,EAAAo/B,EAAA3xC,GAAAA,GAAAw0C,EAAA/1C,GAGA4Z,GADA1X,MAAAA,OAAA/B,IAAA+B,gBAAAmzC,EAAApqC,EAAAwf,EACAvoB,KAAA4R,IA8eAglC,CAAAruB,EAAAuZ,EAAA+R,GAn3KA,IAo3KA/R,GAAA,IAAAA,GAAAkP,EAAAlzC,OAGA01C,GAAA97B,MAAArY,GAAAw2C,GA9OA,SAAAttB,EAAAuZ,EAAAtZ,EAAAuoB,GACA,IAAAgD,EA/oKA,EA+oKAjS,EACA/4B,EAAA2pC,GAAAnqB,GAkBA,OAhBA,SAAA4qB,IAQA,IAPA,IAAAjC,GAAA,EACAC,EAAAh+B,UAAArV,OACAuzC,GAAA,EACAC,EAAAP,EAAAjzC,OACA8T,EAAAuL,EAAAm0B,EAAAH,GACAoD,EAAAv0C,MAAAA,OAAA/B,IAAA+B,gBAAAmzC,EAAApqC,EAAAwf,IAEA8oB,EAAAC,GACA1/B,EAAAy/B,GAAAN,EAAAM,GAEA,KAAAF,KACAv/B,EAAAy/B,KAAAl+B,YAAA+9B,GAEA,OAAAx5B,GAAA68B,EAAAR,EAAAvrB,EAAAxoB,KAAA4R,IA0NAilC,CAAAtuB,EAAAuZ,EAAAtZ,EAAAuoB,QAJA,IAAA/5B,EAhmBA,SAAAuR,EAAAuZ,EAAAtZ,GACA,IAAAurB,EAvxJA,EAuxJAjS,EACA/4B,EAAA2pC,GAAAnqB,GAMA,OAJA,SAAA4qB,IAEA,OADAnzC,MAAAA,OAAA/B,IAAA+B,gBAAAmzC,EAAApqC,EAAAwf,GACA7Q,MAAAq8B,EAAAvrB,EAAAxoB,KAAAmT,YA0lBA2jC,CAAAvuB,EAAAuZ,EAAAtZ,GASA,OAAAutB,IADArW,EAAAmO,GAAAiI,IACA9+B,EAAA6+B,GAAAttB,EAAAuZ,GAeA,SAAAiV,GAAAjW,EAAAiJ,EAAAz0B,EAAAuV,GACA,OAAAiW,IAAAzhC,IACA0K,GAAA+2B,EAAAhH,EAAAxkB,MAAAZ,EAAA7W,KAAAgtB,EAAAvV,GACAy0B,EAEAjJ,EAiBA,SAAAkW,GAAAlW,EAAAiJ,EAAAz0B,EAAAuV,EAAAxV,EAAA2sB,GAOA,OANA5D,GAAA0C,IAAA1C,GAAA2L,KAEA/H,EAAAvtB,IAAAs1B,EAAAjJ,GACAuK,GAAAvK,EAAAiJ,EAAA1qC,GAAA23C,GAAAhV,GACAA,EAAA,OAAA+H,IAEAjJ,EAYA,SAAAmW,GAAA7yC,GACA,OAAAwnC,GAAAxnC,GAAA/E,GAAA+E,EAgBA,SAAAskC,GAAAhgB,EAAAye,EAAArF,EAAAC,EAAAmG,EAAAlG,GACA,IAAA6G,EA78KA,EA68KA/G,EACA0S,EAAA9rB,EAAA5qB,OACA0pC,EAAAL,EAAArpC,OAEA,GAAA02C,GAAAhN,KAAAqB,GAAA2L,EAAAhN,GACA,OAAA,EAGA,IAAA3D,EAAA7B,EAAAnnB,IAAA6N,GACA,GAAAmb,GAAA7B,EAAAnnB,IAAAssB,GACA,OAAAtD,GAAAsD,EAEA,IAAA5vB,GAAA,EACAP,GAAA,EACA4wB,EA19KA,EA09KA9F,EAAA,IAAAvC,GAAAlgC,GAMA,IAJA2iC,EAAAvtB,IAAAiU,EAAAye,GACAnF,EAAAvtB,IAAA0yB,EAAAze,KAGAnR,EAAAi9B,GAAA,CACA,IAAA0C,EAAAxuB,EAAAnR,GACA+xB,EAAAnC,EAAA5vB,GAEA,GAAAwqB,EACA,IAAAwH,EAAAV,EACA9G,EAAAuH,EAAA4N,EAAA3/B,EAAA4vB,EAAAze,EAAAsZ,GACAD,EAAAmV,EAAA5N,EAAA/xB,EAAAmR,EAAAye,EAAAnF,GAEA,GAAAuH,IAAAlqC,GAAA,CACA,GAAAkqC,EACA,SAEAvyB,GAAA,EACA,MAGA,GAAA4wB,GACA,IAAA7d,GAAAod,EAAA,SAAAmC,EAAA7B,GACA,IAAApc,GAAAuc,EAAAH,KACAyP,IAAA5N,GAAApB,EAAAgP,EAAA5N,EAAAxH,EAAAC,EAAAC,IACA,OAAA4F,EAAAx6B,KAAAq6B,KAEA,CACAzwB,GAAA,EACA,YAEA,GACAkgC,IAAA5N,IACApB,EAAAgP,EAAA5N,EAAAxH,EAAAC,EAAAC,GACA,CACAhrB,GAAA,EACA,OAKA,OAFAgrB,EAAA,OAAAtZ,GACAsZ,EAAA,OAAAmF,GACAnwB,EAyKA,SAAA+7B,GAAAxqB,GACA,OAAAilB,GAAAC,GAAAllB,EAAAlpB,GAAA83C,IAAA5uB,EAAA,IAUA,SAAAyb,GAAAnZ,GACA,OAAA6b,GAAA7b,EAAA1T,GAAA4rB,IAWA,SAAAgB,GAAAlZ,GACA,OAAA6b,GAAA7b,EAAAgY,GAAAF,IAUA,IAAA0Q,GAAApW,GAAA,SAAA1U,GACA,OAAA0U,GAAApiB,IAAA0N,IADA4tB,GAWA,SAAA/C,GAAA7qB,GAKA,IAJA,IAAAvR,EAAAuR,EAAAhiB,KAAA,GACAmiB,EAAAwU,GAAAlmB,GACAlZ,EAAA4W,EAAA7W,KAAAq/B,GAAAlmB,GAAA0R,EAAA5qB,OAAA,EAEAA,KAAA,CACA,IAAA4hC,EAAAhX,EAAA5qB,GACAs5C,EAAA1X,EAAAnX,KACA,GAAA,MAAA6uB,GAAAA,GAAA7uB,EACA,OAAAmX,EAAAn5B,KAGA,OAAAyQ,EAUA,SAAAk9B,GAAA3rB,GAEA,OADA7T,EAAA7W,KAAA+/B,GAAA,eAAAA,GAAArV,GACAkQ,YAcA,SAAA0T,KACA,IAAAn1B,EAAA4mB,GAAAhV,UAAAA,GAEA,OADA5R,EAAAA,IAAA4R,GAAAuhB,GAAAnzB,EACA7D,UAAArV,OAAAkZ,EAAA7D,UAAA,GAAAA,UAAA,IAAA6D,EAWA,SAAAkuB,GAAA9M,EAAA9iB,GACA,IAAAoqB,EAAAtH,EAAAoH,SACA,OA+XA,SAAAp7B,GACA,IAAAizC,SAAAjzC,EACA,MAAA,UAAAizC,GAAA,UAAAA,GAAA,UAAAA,GAAA,WAAAA,EACA,cAAAjzC,EACA,OAAAA,EAnYAkzC,CAAAhiC,GACAoqB,EAAA,iBAAApqB,EAAA,SAAA,QACAoqB,EAAAtH,IAUA,SAAA4S,GAAAngB,GAIA,IAHA,IAAA7T,EAAAG,GAAA0T,GACA/sB,EAAAkZ,EAAAlZ,OAEAA,KAAA,CACA,IAAAwX,EAAA0B,EAAAlZ,GACAsG,EAAAymB,EAAAvV,GAEA0B,EAAAlZ,GAAA,CAAAwX,EAAAlR,EAAA+mC,GAAA/mC,IAEA,OAAA4S,EAWA,SAAAskB,GAAAzQ,EAAAvV,GACA,IAAAlR,EAnvJA,SAAAymB,EAAAvV,GACA,OAAA,MAAAuV,EAAAxrB,GAAAwrB,EAAAvV,GAkvJAiiC,CAAA1sB,EAAAvV,GACA,OAAA20B,GAAA7lC,GAAAA,EAAA/E,GAqCA,IAAA0jC,GAAAhH,EAAA,SAAAlR,GACA,OAAA,MAAAA,EACA,IAEAA,EAAA3mB,EAAA2mB,GACA3B,GAAA6S,EAAAlR,GAAA,SAAA6Y,GACA,OAAA1I,EAAAn9B,KAAAgtB,EAAA6Y,OANA8T,GAiBA7U,GAAA5G,EAAA,SAAAlR,GAEA,IADA,IAAA7T,EAAA,GACA6T,GACApB,GAAAzS,EAAA+rB,GAAAlY,IACAA,EAAA+P,EAAA/P,GAEA,OAAA7T,GANAwgC,GAgBAjV,GAAAsE,GA2EA,SAAA4Q,GAAA5sB,EAAA0b,EAAAmR,GAOA,IAJA,IAAAngC,GAAA,EACAzZ,GAHAyoC,EAAAC,GAAAD,EAAA1b,IAGA/sB,OACAkZ,GAAA,IAEAO,EAAAzZ,GAAA,CACA,IAAAwX,EAAAmxB,GAAAF,EAAAhvB,IACA,KAAAP,EAAA,MAAA6T,GAAA6sB,EAAA7sB,EAAAvV,IACA,MAEAuV,EAAAA,EAAAvV,GAEA,OAAA0B,KAAAO,GAAAzZ,EACAkZ,KAEAlZ,EAAA,MAAA+sB,EAAA,EAAAA,EAAA/sB,SACA65C,GAAA75C,IAAAqiC,GAAA7qB,EAAAxX,KACAggC,GAAAjT,IAAAkV,GAAAlV,IA6BA,SAAA6X,GAAA7X,GACA,MAAA,mBAAAA,EAAA3iB,aAAAuiC,GAAA5f,GAEA,GADAqT,GAAAtD,EAAA/P,IA8EA,SAAAmb,GAAA5hC,GACA,OAAA05B,GAAA15B,IAAA27B,GAAA37B,OACA82B,GAAA92B,GAAAA,EAAA82B,IAWA,SAAAiF,GAAA/7B,EAAAtG,GACA,IAAAu5C,SAAAjzC,EAGA,SAFAtG,EAAA,MAAAA,EAAA6hB,GAAA7hB,KAGA,UAAAu5C,GACA,UAAAA,GAAA7zB,GAAA9P,KAAAtP,MACA,EAAAA,GAAAA,EAAA,GAAA,GAAAA,EAAAtG,EAaA,SAAAq0C,GAAA/tC,EAAAmT,EAAAsT,GACA,IAAAuT,GAAAvT,GACA,OAAA,EAEA,IAAAwsB,SAAA9/B,EACA,SAAA,UAAA8/B,EACAtM,GAAAlgB,IAAAsV,GAAA5oB,EAAAsT,EAAA/sB,QACA,UAAAu5C,GAAA9/B,KAAAsT,IAEA9gB,GAAA8gB,EAAAtT,GAAAnT,GAaA,SAAA8mC,GAAA9mC,EAAAymB,GACA,GAAAiT,GAAA15B,GACA,OAAA,EAEA,IAAAizC,SAAAjzC,EACA,QAAA,UAAAizC,GAAA,UAAAA,GAAA,WAAAA,GACA,MAAAjzC,IAAAuhC,GAAAvhC,KAGAke,GAAA5O,KAAAtP,KAAAie,GAAA3O,KAAAtP,IACA,MAAAymB,GAAAzmB,KAAAF,EAAA2mB,GAyBA,SAAAyoB,GAAA/qB,GACA,IAAArL,EAAAk2B,GAAA7qB,GACA4e,EAAAvJ,GAAA1gB,GAEA,GAAA,mBAAAiqB,KAAAjqB,KAAA6gB,GAAA99B,WACA,OAAA,EAEA,GAAAsoB,IAAA4e,EACA,OAAA,EAEA,IAAAzH,EAAA2T,GAAAlM,GACA,QAAAzH,GAAAnX,IAAAmX,EAAA,IA7SA9C,GAAA2F,GAAA,IAAA3F,EAAA,IAAAgb,YAAA,MAAA52B,IACA6b,GAAA0F,GAAA,IAAA1F,IAAAvc,IACAvG,IAAAwoB,GAAAxoB,GAAAC,YAAAyG,IACAqc,IAAAyF,GAAA,IAAAzF,KAAAnc,IACAoc,IAAAwF,GAAA,IAAAxF,KAAAjc,MACAyhB,GAAA,SAAAn+B,GACA,IAAA4S,EAAA6vB,GAAAziC,GACA2E,EAAAiO,GAAAwJ,GAAApc,EAAA8D,YAAA7I,GACAw4C,EAAA9uC,EAAAq0B,GAAAr0B,GAAA,GAEA,GAAA8uC,EACA,OAAAA,GACA,KAAA1a,GAAA,OAAAnc,GACA,KAAAqc,GAAA,OAAA/c,GACA,KAAAgd,GAAA,OAAA7c,GACA,KAAA8c,GAAA,OAAA5c,GACA,KAAA6c,GAAA,OAAA1c,GAGA,OAAA9J,IA+SA,IAAA8gC,GAAA/d,EAAAsM,GAAA0R,GASA,SAAAtN,GAAArmC,GACA,IAAA2E,EAAA3E,GAAAA,EAAA8D,YAGA,OAAA9D,KAFA,mBAAA2E,GAAAA,EAAA9I,WAAA65B,GAaA,SAAAqR,GAAA/mC,GACA,OAAAA,GAAAA,IAAAg6B,GAAAh6B,GAYA,SAAA6mC,GAAA31B,EAAAy0B,GACA,OAAA,SAAAlf,GACA,OAAA,MAAAA,GAGAA,EAAAvV,KAAAy0B,IACAA,IAAA1qC,IAAAiW,KAAApR,EAAA2mB,KAsIA,SAAA4iB,GAAAllB,EAAAglB,EAAAhV,GAEA,OADAgV,EAAAjR,EAAAiR,IAAAluC,GAAAkpB,EAAAzqB,OAAA,EAAAyvC,EAAA,GACA,WAMA,IALA,IAAA37B,EAAAuB,UACAoE,GAAA,EACAzZ,EAAAw+B,EAAA1qB,EAAA9T,OAAAyvC,EAAA,GACA7kB,EAAAvL,EAAArf,KAEAyZ,EAAAzZ,GACA4qB,EAAAnR,GAAA3F,EAAA27B,EAAAh2B,GAEAA,GAAA,EAEA,IADA,IAAAygC,EAAA76B,EAAAowB,EAAA,KACAh2B,EAAAg2B,GACAyK,EAAAzgC,GAAA3F,EAAA2F,GAGA,OADAygC,EAAAzK,GAAAhV,EAAA7P,GACAhR,GAAA6Q,EAAAvoB,KAAAg4C,IAYA,SAAAlQ,GAAAjd,EAAA0b,GACA,OAAAA,EAAAzoC,OAAA,EAAA+sB,EAAAyb,GAAAzb,EAAAojB,GAAA1H,EAAA,GAAA,IAiCA,SAAAiF,GAAA3gB,EAAAvV,GACA,GAAA,aAAAA,EAIA,OAAAuV,EAAAvV,GAiBA,IAAAwgC,GAAAmC,GAAApK,IAUAjS,GAAAD,GAAA,SAAApT,EAAA4b,GACA,OAAAlmC,GAAA29B,WAAArT,EAAA4b,IAWAqJ,GAAAyK,GAAAnK,IAYA,SAAAiI,GAAA5C,EAAA+E,EAAApW,GACA,IAAAzsB,EAAA6iC,EAAA,GACA,OAAA1K,GAAA2F,EAtbA,SAAA99B,EAAA8iC,GACA,IAAAr6C,EAAAq6C,EAAAr6C,OACA,IAAAA,EACA,OAAAuX,EAEA,IAAAujB,EAAA96B,EAAA,EAGA,OAFAq6C,EAAAvf,IAAA,EAAA96B,EAAA,KAAA,IAAAq6C,EAAAvf,GACAuf,EAAAA,EAAAzyB,KAAA,EAAA5nB,EAAA,KAAA,KACAuX,EAAAhD,QAAAwQ,GAAA,uBAAAs1B,EAAA,UA8aAC,CAAA/iC,EAqHA,SAAA8iC,EAAArW,GAOA,OANAhZ,GAAAhJ,GAAA,SAAAo2B,GACA,IAAA9xC,EAAA,KAAA8xC,EAAA,GACApU,EAAAoU,EAAA,KAAA9sB,GAAA+uB,EAAA/zC,IACA+zC,EAAA/qC,KAAAhJ,KAGA+zC,EAAA9L,OA5HAgM,CAljBA,SAAAhjC,GACA,IAAA1V,EAAA0V,EAAA1V,MAAAmjB,IACA,OAAAnjB,EAAAA,EAAA,GAAAqf,MAAA+D,IAAA,GAgjBAu1B,CAAAjjC,GAAAysB,KAYA,SAAAmW,GAAA1vB,GACA,IAAA9K,EAAA,EACA86B,EAAA,EAEA,OAAA,WACA,IAAAC,EAAAhc,IACAic,EAv+MA,IAu+MAD,EAAAD,GAGA,GADAA,EAAAC,EACA,EAAAC,GACA,GA5+MA,OA4+MAh7B,EACA,OAAAtK,UAAA,QAGAsK,EAAA,EAEA,OAAA8K,EAAA7Q,MAAArY,GAAA8T,YAYA,SAAAotB,GAAA7X,EAAA2P,GACA,IAAA9gB,GAAA,EACAzZ,EAAA4qB,EAAA5qB,OACA86B,EAAA96B,EAAA,EAGA,IADAu6B,EAAAA,IAAAh5B,GAAAvB,EAAAu6B,IACA9gB,EAAA8gB,GAAA,CACA,IAAAqgB,EAAArY,GAAA9oB,EAAAqhB,GACAx0B,EAAAskB,EAAAgwB,GAEAhwB,EAAAgwB,GAAAhwB,EAAAnR,GACAmR,EAAAnR,GAAAnT,EAGA,OADAskB,EAAA5qB,OAAAu6B,EACA3P,EAUA,IAlTA1R,GAOAsU,GA2SAglB,IA3SAhlB,IAPAtU,GAAA2hC,GAkTA,SAAAzgB,GACA,IAAAlhB,EAAA,GAOA,OANA,KAAAkhB,EAAA1lB,WAAA,IACAwE,EAAA5J,KAAA,IAEA8qB,EAAA7lB,QAAAkQ,GAAA,SAAA5iB,EAAA+hC,EAAAkX,EAAAC,GACA7hC,EAAA5J,KAAAwrC,EAAAC,EAAAxmC,QAAA4Q,GAAA,MAAAye,GAAA/hC,KAEAqX,GA1TA,SAAA1B,GAIA,OAvwMA,MAowMAgW,GAAA+M,MACA/M,GAAA6T,QAEA7pB,KAGAgW,MACAtU,IA4TA,SAAAyvB,GAAAriC,GACA,GAAA,iBAAAA,GAAAuhC,GAAAvhC,GACA,OAAAA,EAEA,IAAA4S,EAAA5S,EAAA,GACA,MAAA,KAAA4S,GAAA,EAAA5S,IAAA,EAAA,EAAA,KAAA4S,EAUA,SAAAomB,GAAA7U,GACA,GAAA,MAAAA,EAAA,CACA,IACA,OAAAyR,EAAAn8B,KAAA0qB,GACA,MAAAvrB,IACA,IACA,OAAAurB,EAAA,GACA,MAAAvrB,KAEA,MAAA,GA4BA,SAAAihC,GAAAkV,GACA,GAAAA,aAAApV,GACA,OAAAoV,EAAA3vC,QAEA,IAAAwT,EAAA,IAAAgnB,GAAAmV,EAAA5U,YAAA4U,EAAA1U,WAIA,OAHAznB,EAAAwnB,YAAAgC,GAAA2S,EAAA3U,aACAxnB,EAAA0nB,UAAAyU,EAAAzU,UACA1nB,EAAA2nB,WAAAwU,EAAAxU,WACA3nB,EAsIA,IAAA8hC,GAAAxL,GAAA,SAAA5kB,EAAAgB,GACA,OAAAiiB,GAAAjjB,GACA0b,GAAA1b,EAAAmd,GAAAnc,EAAA,EAAAiiB,IAAA,IACA,KA6BAoN,GAAAzL,GAAA,SAAA5kB,EAAAgB,GACA,IAAAd,EAAAmf,GAAAre,GAIA,OAHAiiB,GAAA/iB,KACAA,EAAAvpB,IAEAssC,GAAAjjB,GACA0b,GAAA1b,EAAAmd,GAAAnc,EAAA,EAAAiiB,IAAA,GAAAQ,GAAAvjB,EAAA,IACA,KA0BAowB,GAAA1L,GAAA,SAAA5kB,EAAAgB,GACA,IAAAH,EAAAwe,GAAAre,GAIA,OAHAiiB,GAAApiB,KACAA,EAAAlqB,IAEAssC,GAAAjjB,GACA0b,GAAA1b,EAAAmd,GAAAnc,EAAA,EAAAiiB,IAAA,GAAAtsC,GAAAkqB,GACA,KAsOA,SAAA0vB,GAAAvwB,EAAAO,EAAAqB,GACA,IAAAxsB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,IAAAA,EACA,OAAA,EAEA,IAAAyZ,EAAA,MAAA+S,EAAA,EAAA2rB,GAAA3rB,GAIA,OAHA/S,EAAA,IACAA,EAAA+kB,EAAAx+B,EAAAyZ,EAAA,IAEA8S,GAAA3B,EAAAyjB,GAAAljB,EAAA,GAAA1R,GAsCA,SAAA2hC,GAAAxwB,EAAAO,EAAAqB,GACA,IAAAxsB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,IAAAA,EACA,OAAA,EAEA,IAAAyZ,EAAAzZ,EAAA,EAOA,OANAwsB,IAAAjrB,KACAkY,EAAA0+B,GAAA3rB,GACA/S,EAAA+S,EAAA,EACAgS,EAAAx+B,EAAAyZ,EAAA,GACAglB,EAAAhlB,EAAAzZ,EAAA,IAEAusB,GAAA3B,EAAAyjB,GAAAljB,EAAA,GAAA1R,GAAA,GAiBA,SAAA4/B,GAAAzuB,GAEA,OADA,MAAAA,GAAAA,EAAA5qB,OACA+nC,GAAAnd,EAAA,GAAA,GAgGA,SAAAywB,GAAAzwB,GACA,OAAAA,GAAAA,EAAA5qB,OAAA4qB,EAAA,GAAArpB,GA0EA,IAAA+5C,GAAA9L,GAAA,SAAA/F,GACA,IAAA8R,EAAA7vB,GAAA+d,EAAA6I,IACA,OAAAiJ,EAAAv7C,QAAAu7C,EAAA,KAAA9R,EAAA,GACAD,GAAA+R,GACA,KA0BAC,GAAAhM,GAAA,SAAA/F,GACA,IAAA3e,EAAAmf,GAAAR,GACA8R,EAAA7vB,GAAA+d,EAAA6I,IAOA,OALAxnB,IAAAmf,GAAAsR,GACAzwB,EAAAvpB,GAEAg6C,EAAAhsC,MAEAgsC,EAAAv7C,QAAAu7C,EAAA,KAAA9R,EAAA,GACAD,GAAA+R,EAAAlN,GAAAvjB,EAAA,IACA,KAwBA2wB,GAAAjM,GAAA,SAAA/F,GACA,IAAAhe,EAAAwe,GAAAR,GACA8R,EAAA7vB,GAAA+d,EAAA6I,IAMA,OAJA7mB,EAAA,mBAAAA,EAAAA,EAAAlqB,KAEAg6C,EAAAhsC,MAEAgsC,EAAAv7C,QAAAu7C,EAAA,KAAA9R,EAAA,GACAD,GAAA+R,EAAAh6C,GAAAkqB,GACA,KAoCA,SAAAwe,GAAArf,GACA,IAAA5qB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,EAAA4qB,EAAA5qB,EAAA,GAAAuB,GAuFA,IAAAm6C,GAAAlM,GAAAmM,IAsBA,SAAAA,GAAA/wB,EAAAgB,GACA,OAAAhB,GAAAA,EAAA5qB,QAAA4rB,GAAAA,EAAA5rB,OACAkvC,GAAAtkB,EAAAgB,GACAhB,EAqFA,IAAAgxB,GAAA3G,GAAA,SAAArqB,EAAAwkB,GACA,IAAApvC,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACAkZ,EAAAuqB,GAAA7Y,EAAAwkB,GAMA,OAJAD,GAAAvkB,EAAAc,GAAA0jB,EAAA,SAAA31B,GACA,OAAA4oB,GAAA5oB,EAAAzZ,IAAAyZ,EAAAA,IACA80B,KAAAM,KAEA31B,IA2EA,SAAAhP,GAAA0gB,GACA,OAAA,MAAAA,EAAAA,EAAAiU,EAAA9+B,KAAA6qB,GAkaA,IAAAixB,GAAArM,GAAA,SAAA/F,GACA,OAAA+H,GAAAzJ,GAAA0B,EAAA,EAAAoE,IAAA,MA0BAiO,GAAAtM,GAAA,SAAA/F,GACA,IAAA3e,EAAAmf,GAAAR,GAIA,OAHAoE,GAAA/iB,KACAA,EAAAvpB,IAEAiwC,GAAAzJ,GAAA0B,EAAA,EAAAoE,IAAA,GAAAQ,GAAAvjB,EAAA,MAwBAixB,GAAAvM,GAAA,SAAA/F,GACA,IAAAhe,EAAAwe,GAAAR,GAEA,OADAhe,EAAA,mBAAAA,EAAAA,EAAAlqB,GACAiwC,GAAAzJ,GAAA0B,EAAA,EAAAoE,IAAA,GAAAtsC,GAAAkqB,KAgGA,SAAAuwB,GAAApxB,GACA,IAAAA,IAAAA,EAAA5qB,OACA,MAAA,GAEA,IAAAA,EAAA,EAOA,OANA4qB,EAAAQ,GAAAR,EAAA,SAAAqxB,GACA,GAAApO,GAAAoO,GAEA,OADAj8C,EAAAw+B,EAAAyd,EAAAj8C,OAAAA,IACA,IAGAmtB,GAAAntB,EAAA,SAAAyZ,GACA,OAAAiS,GAAAd,EAAAuB,GAAA1S,MAyBA,SAAAyiC,GAAAtxB,EAAAE,GACA,IAAAF,IAAAA,EAAA5qB,OACA,MAAA,GAEA,IAAAkZ,EAAA8iC,GAAApxB,GACA,OAAA,MAAAE,EACA5R,EAEAwS,GAAAxS,EAAA,SAAA+iC,GACA,OAAAriC,GAAAkR,EAAAvpB,GAAA06C,KAwBA,IAAAE,GAAA3M,GAAA,SAAA5kB,EAAAgB,GACA,OAAAiiB,GAAAjjB,GACA0b,GAAA1b,EAAAgB,GACA,KAqBAwwB,GAAA5M,GAAA,SAAA/F,GACA,OAAAyI,GAAA9mB,GAAAqe,EAAAoE,OA0BAwO,GAAA7M,GAAA,SAAA/F,GACA,IAAA3e,EAAAmf,GAAAR,GAIA,OAHAoE,GAAA/iB,KACAA,EAAAvpB,IAEA2wC,GAAA9mB,GAAAqe,EAAAoE,IAAAQ,GAAAvjB,EAAA,MAwBAwxB,GAAA9M,GAAA,SAAA/F,GACA,IAAAhe,EAAAwe,GAAAR,GAEA,OADAhe,EAAA,mBAAAA,EAAAA,EAAAlqB,GACA2wC,GAAA9mB,GAAAqe,EAAAoE,IAAAtsC,GAAAkqB,KAmBA8wB,GAAA/M,GAAAwM,IA6DA,IAAAQ,GAAAhN,GAAA,SAAA/F,GACA,IAAAzpC,EAAAypC,EAAAzpC,OACA8qB,EAAA,EAAA9qB,EAAAypC,EAAAzpC,EAAA,GAAAuB,GAGA,OADAupB,EAAA,mBAAAA,GAAA2e,EAAAl6B,MAAAub,GAAAvpB,GACA26C,GAAAzS,EAAA3e,KAkCA,SAAA2xB,GAAAn2C,GACA,IAAA4S,EAAA4mB,GAAAx5B,GAEA,OADA4S,EAAAynB,WAAA,EACAznB,EAsDA,SAAAk8B,GAAA9uC,EAAAo2C,GACA,OAAAA,EAAAp2C,GAmBA,IAAAq2C,GAAA1H,GAAA,SAAAvR,GACA,IAAA1jC,EAAA0jC,EAAA1jC,OACAyvC,EAAAzvC,EAAA0jC,EAAA,GAAA,EACAp9B,EAAApE,KAAAu+B,YACAic,EAAA,SAAA3vB,GAAA,OAAA0W,GAAA1W,EAAA2W,IAEA,QAAA,EAAA1jC,GAAAkC,KAAAw+B,YAAA1gC,SACAsG,aAAA25B,IAAAoC,GAAAoN,KAGAnpC,EAAAA,EAAAyF,MAAA0jC,GAAAA,GAAAzvC,EAAA,EAAA,KACA0gC,YAAApxB,KAAA,CACAmb,KAAA2qB,GACAthC,KAAA,CAAA4oC,GACAhyB,QAAAnpB,KAEA,IAAA2+B,GAAA55B,EAAApE,KAAAy+B,WAAAyU,KAAA,SAAAxqB,GAIA,OAHA5qB,IAAA4qB,EAAA5qB,QACA4qB,EAAAtb,KAAA/N,IAEAqpB,KAZA1oB,KAAAkzC,KAAAsH,KA+PA,IAAAE,GAAA5I,GAAA,SAAA96B,EAAA5S,EAAAkR,GACAZ,EAAA7W,KAAAmZ,EAAA1B,KACA0B,EAAA1B,GAEAsrB,GAAA5pB,EAAA1B,EAAA,KAmIA,IAAAqlC,GAAA/H,GAAAqG,IAqBA2B,GAAAhI,GAAAsG,IA2GA,SAAA5hC,GAAA6S,EAAAvB,GAEA,OADAkV,GAAA3T,GAAArB,GAAAmY,IACA9W,EAAAgiB,GAAAvjB,EAAA,IAuBA,SAAAiyB,GAAA1wB,EAAAvB,GAEA,OADAkV,GAAA3T,GAAApB,GAAAwc,IACApb,EAAAgiB,GAAAvjB,EAAA,IA0BA,IAAAkyB,GAAAhJ,GAAA,SAAA96B,EAAA5S,EAAAkR,GACAZ,EAAA7W,KAAAmZ,EAAA1B,GACA0B,EAAA1B,GAAAlI,KAAAhJ,GAEAw8B,GAAA5pB,EAAA1B,EAAA,CAAAlR,MAsEA,IAAA22C,GAAAzN,GAAA,SAAAnjB,EAAAoc,EAAA30B,GACA,IAAA2F,GAAA,EACAirB,EAAA,mBAAA+D,EACAvvB,EAAA+zB,GAAA5gB,GAAAhN,EAAAgN,EAAArsB,QAAA,GAKA,OAHAmjC,GAAA9W,EAAA,SAAA/lB,GACA4S,IAAAO,GAAAirB,EAAA9qB,GAAA6uB,EAAAniC,EAAAwN,GAAAi2B,GAAAzjC,EAAAmiC,EAAA30B,KAEAoF,IA+BAgkC,GAAAlJ,GAAA,SAAA96B,EAAA5S,EAAAkR,GACAsrB,GAAA5pB,EAAA1B,EAAAlR,KA6CA,SAAAg0B,GAAAjO,EAAAvB,GAEA,OADAkV,GAAA3T,GAAAX,GAAAshB,IACA3gB,EAAAgiB,GAAAvjB,EAAA,IAkFA,IAAAqyB,GAAAnJ,GAAA,SAAA96B,EAAA5S,EAAAkR,GACA0B,EAAA1B,EAAA,EAAA,GAAAlI,KAAAhJ,IACA,WAAA,MAAA,CAAA,GAAA,MAmSA,IAAA82C,GAAA5N,GAAA,SAAAnjB,EAAA8hB,GACA,GAAA,MAAA9hB,EACA,MAAA,GAEA,IAAArsB,EAAAmuC,EAAAnuC,OAMA,OALA,EAAAA,GAAAq0C,GAAAhoB,EAAA8hB,EAAA,GAAAA,EAAA,IACAA,EAAA,GACA,EAAAnuC,GAAAq0C,GAAAlG,EAAA,GAAAA,EAAA,GAAAA,EAAA,MACAA,EAAA,CAAAA,EAAA,KAEAD,GAAA7hB,EAAA0b,GAAAoG,EAAA,GAAA,MAqBAvQ,GAAAD,GAAA,WACA,OAAAx9B,GAAAkhB,KAAAuc,OA0DA,SAAAkY,GAAArrB,EAAAtrB,EAAA6U,GAGA,OAFA7U,EAAA6U,EAAAzS,GAAApC,EACAA,EAAAsrB,GAAA,MAAAtrB,EAAAsrB,EAAAzqB,OAAAb,EACAs5C,GAAAhuB,EAAA7I,GAAArgB,GAAAA,GAAAA,GAAAA,GAAApC,GAoBA,SAAAk+C,GAAAl+C,EAAAsrB,GACA,IAAAvR,EACA,GAAA,mBAAAuR,EACA,MAAA,IAAAoR,EAAApa,IAGA,OADAtiB,EAAAg5C,GAAAh5C,GACA,WAOA,OANA,IAAAA,IACA+Z,EAAAuR,EAAA7Q,MAAA1X,KAAAmT,YAEAlW,GAAA,IACAsrB,EAAAlpB,IAEA2X,GAuCA,IAAAokC,GAAA9N,GAAA,SAAA/kB,EAAAC,EAAAuoB,GACA,IAAAjP,EAt0TA,EAu0TA,GAAAiP,EAAAjzC,OAAA,CACA,IAAAkzC,EAAAxY,GAAAuY,EAAAmD,GAAAkH,KACAtZ,GAp0TA,GAs0TA,OAAAyU,GAAAhuB,EAAAuZ,EAAAtZ,EAAAuoB,EAAAC,KAgDAqK,GAAA/N,GAAA,SAAAziB,EAAAvV,EAAAy7B,GACA,IAAAjP,EAAAwZ,EACA,GAAAvK,EAAAjzC,OAAA,CACA,IAAAkzC,EAAAxY,GAAAuY,EAAAmD,GAAAmH,KACAvZ,GA13TA,GA43TA,OAAAyU,GAAAjhC,EAAAwsB,EAAAjX,EAAAkmB,EAAAC,KAsJA,SAAAuK,GAAAhzB,EAAA4b,EAAAqX,GACA,IAAAC,EACAC,EACAC,EACA3kC,EACA4kC,EACAC,EACAC,EAAA,EACAC,GAAA,EACAC,GAAA,EACA1J,GAAA,EAEA,GAAA,mBAAA/pB,EACA,MAAA,IAAAoR,EAAApa,IAUA,SAAA08B,EAAAC,GACA,IAAAtqC,EAAA6pC,EACAjzB,EAAAkzB,EAKA,OAHAD,EAAAC,EAAAr8C,GACAy8C,EAAAI,EACAllC,EAAAuR,EAAA7Q,MAAA8Q,EAAA5W,GAuBA,SAAAuqC,EAAAD,GACA,IAAAE,EAAAF,EAAAL,EAMA,OAAAA,IAAAx8C,IAAA8kC,GAAAiY,GACAA,EAAA,GAAAJ,GAAAL,GANAO,EAAAJ,EASA,SAAAO,IACA,IAAAH,EAAAxgB,KACA,GAAAygB,EAAAD,GACA,OAAAI,EAAAJ,GAGAN,EAAAhgB,GAAAygB,EA3BA,SAAAH,GACA,IAEAK,EAAApY,GAFA+X,EAAAL,GAIA,OAAAG,EACAzf,EAAAggB,EAAAZ,GAJAO,EAAAJ,IAKAS,EAoBAC,CAAAN,IAGA,SAAAI,EAAAJ,GAKA,OAJAN,EAAAv8C,GAIAizC,GAAAmJ,EACAQ,EAAAC,IAEAT,EAAAC,EAAAr8C,GACA2X,GAeA,SAAAylC,IACA,IAAAP,EAAAxgB,KACAghB,EAAAP,EAAAD,GAMA,GAJAT,EAAAtoC,UACAuoC,EAAA17C,KACA67C,EAAAK,EAEAQ,EAAA,CACA,GAAAd,IAAAv8C,GACA,OAzEA,SAAA68C,GAMA,OAJAJ,EAAAI,EAEAN,EAAAhgB,GAAAygB,EAAAlY,GAEA4X,EAAAE,EAAAC,GAAAllC,EAmEA2lC,CAAAd,GAEA,GAAAG,EAGA,OADAJ,EAAAhgB,GAAAygB,EAAAlY,GACA8X,EAAAJ,GAMA,OAHAD,IAAAv8C,KACAu8C,EAAAhgB,GAAAygB,EAAAlY,IAEAntB,EAIA,OA1GAmtB,EAAA/0B,GAAA+0B,IAAA,EACA/F,GAAAod,KACAO,IAAAP,EAAAO,QAEAJ,GADAK,EAAA,YAAAR,GACAlf,EAAAltB,GAAAosC,EAAAG,UAAA,EAAAxX,GAAAwX,EACArJ,EAAA,aAAAkJ,IAAAA,EAAAlJ,SAAAA,GAmGAmK,EAAAG,OAnCA,WACAhB,IAAAv8C,IACAm8B,GAAAogB,GAEAE,EAAA,EACAL,EAAAI,EAAAH,EAAAE,EAAAv8C,IA+BAo9C,EAAAI,MA5BA,WACA,OAAAjB,IAAAv8C,GAAA2X,EAAAslC,EAAA5gB,OA4BA+gB,EAqBA,IAAAK,GAAAxP,GAAA,SAAA/kB,EAAA3W,GACA,OAAAsyB,GAAA3b,EAAA,EAAA3W,KAsBAmrC,GAAAzP,GAAA,SAAA/kB,EAAA4b,EAAAvyB,GACA,OAAAsyB,GAAA3b,EAAAnZ,GAAA+0B,IAAA,EAAAvyB,KAqEA,SAAA+mC,GAAApwB,EAAAy0B,GACA,GAAA,mBAAAz0B,GAAA,MAAAy0B,GAAA,mBAAAA,EACA,MAAA,IAAArjB,EAAApa,IAEA,IAAA09B,EAAA,WACA,IAAArrC,EAAAuB,UACAmC,EAAA0nC,EAAAA,EAAAtlC,MAAA1X,KAAA4R,GAAAA,EAAA,GACA0Z,EAAA2xB,EAAA3xB,MAEA,GAAAA,EAAAC,IAAAjW,GACA,OAAAgW,EAAAzQ,IAAAvF,GAEA,IAAA0B,EAAAuR,EAAA7Q,MAAA1X,KAAA4R,GAEA,OADAqrC,EAAA3xB,MAAAA,EAAA7W,IAAAa,EAAA0B,IAAAsU,EACAtU,GAGA,OADAimC,EAAA3xB,MAAA,IAAAqtB,GAAAuE,OAAA5d,IACA2d,EA0BA,SAAAE,GAAAl0B,GACA,GAAA,mBAAAA,EACA,MAAA,IAAA0Q,EAAApa,IAEA,OAAA,WACA,IAAA3N,EAAAuB,UACA,OAAAvB,EAAA9T,QACA,KAAA,EAAA,OAAAmrB,EAAAprB,KAAAmC,MACA,KAAA,EAAA,OAAAipB,EAAAprB,KAAAmC,KAAA4R,EAAA,IACA,KAAA,EAAA,OAAAqX,EAAAprB,KAAAmC,KAAA4R,EAAA,GAAAA,EAAA,IACA,KAAA,EAAA,OAAAqX,EAAAprB,KAAAmC,KAAA4R,EAAA,GAAAA,EAAA,GAAAA,EAAA,IAEA,OAAAqX,EAAAvR,MAAA1X,KAAA4R,IAlCA+mC,GAAAuE,MAAA5d,GA2FA,IAAA8d,GAAA7M,GAAA,SAAAhoB,EAAA80B,GAKA,IAAAC,GAJAD,EAAA,GAAAA,EAAAv/C,QAAAggC,GAAAuf,EAAA,IACA7zB,GAAA6zB,EAAA,GAAAnyB,GAAAihB,OACA3iB,GAAAqc,GAAAwX,EAAA,GAAAnyB,GAAAihB,QAEAruC,OACA,OAAAwvC,GAAA,SAAA17B,GAIA,IAHA,IAAA2F,GAAA,EACAzZ,EAAAy+B,EAAA3qB,EAAA9T,OAAAw/C,KAEA/lC,EAAAzZ,GACA8T,EAAA2F,GAAA8lC,EAAA9lC,GAAA1Z,KAAAmC,KAAA4R,EAAA2F,IAEA,OAAAG,GAAA6Q,EAAAvoB,KAAA4R,OAqCA2rC,GAAAjQ,GAAA,SAAA/kB,EAAAwoB,GACA,IAAAC,EAAAxY,GAAAuY,EAAAmD,GAAAqJ,KACA,OAAAhH,GAAAhuB,EAj6UA,GAi6UAlpB,GAAA0xC,EAAAC,KAmCAwM,GAAAlQ,GAAA,SAAA/kB,EAAAwoB,GACA,IAAAC,EAAAxY,GAAAuY,EAAAmD,GAAAsJ,KACA,OAAAjH,GAAAhuB,EAr8UA,GAq8UAlpB,GAAA0xC,EAAAC,KAyBAyM,GAAA1K,GAAA,SAAAxqB,EAAA2kB,GACA,OAAAqJ,GAAAhuB,EA79UA,IA69UAlpB,GAAAA,GAAAA,GAAA6tC,KAiaA,SAAAnjC,GAAA3F,EAAA+iC,GACA,OAAA/iC,IAAA+iC,GAAA/iC,GAAAA,GAAA+iC,GAAAA,EA0BA,IAAA78B,GAAAorC,GAAAxO,IAyBA18B,GAAAkrC,GAAA,SAAAtxC,EAAA+iC,GACA,OAAAA,GAAA/iC,IAqBA27B,GAAAiI,GAAA,WAAA,OAAA70B,UAAA,IAAA60B,GAAA,SAAA5jC,GACA,OAAAy5B,GAAAz5B,IAAAsQ,EAAA7W,KAAAuG,EAAA,YACA42B,EAAAn9B,KAAAuG,EAAA,WA0BA05B,GAAA3gB,EAAA2gB,QAmBAlW,GAAAD,GAAAuD,GAAAvD,IA93PA,SAAAvjB,GACA,OAAAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAA2c,IAw5PA,SAAAgqB,GAAA3mC,GACA,OAAA,MAAAA,GAAAuzC,GAAAvzC,EAAAtG,UAAAuoC,GAAAjiC,GA4BA,SAAAunC,GAAAvnC,GACA,OAAAy5B,GAAAz5B,IAAA2mC,GAAA3mC,GA0CA,IAAA83B,GAAAD,GAAA8b,GAmBAjwB,GAAAD,GAAAqD,GAAArD,IAz+PA,SAAAzjB,GACA,OAAAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAA8b,IAgpQA,SAAAw9B,GAAAt5C,GACA,IAAAy5B,GAAAz5B,GACA,OAAA,EAEA,IAAAk+B,EAAAuE,GAAAziC,GACA,OAAAk+B,GAAAniB,IA5uWA,yBA4uWAmiB,GACA,iBAAAl+B,EAAAukC,SAAA,iBAAAvkC,EAAAmC,OAAAqlC,GAAAxnC,GAkDA,SAAAiiC,GAAAjiC,GACA,IAAAg6B,GAAAh6B,GACA,OAAA,EAIA,IAAAk+B,EAAAuE,GAAAziC,GACA,OAAAk+B,GAAAliB,IAAAkiB,GAAAjiB,IAzyWA,0BAyyWAiiB,GA7xWA,kBA6xWAA,EA6BA,SAAAp2B,GAAA9H,GACA,MAAA,iBAAAA,GAAAA,GAAA6xC,GAAA7xC,GA6BA,SAAAuzC,GAAAvzC,GACA,MAAA,iBAAAA,IACA,EAAAA,GAAAA,EAAA,GAAA,GAAAA,GAAAub,GA4BA,SAAAye,GAAAh6B,GACA,IAAAizC,SAAAjzC,EACA,OAAA,MAAAA,IAAA,UAAAizC,GAAA,YAAAA,GA2BA,SAAAxZ,GAAAz5B,GACA,OAAA,MAAAA,GAAA,iBAAAA,EAoBA,IAAA4jB,GAAAD,GAAAmD,GAAAnD,IA7vQA,SAAA3jB,GACA,OAAAy5B,GAAAz5B,IAAAm+B,GAAAn+B,IAAAkc,IA88QA,SAAAq9B,GAAAv5C,GACA,MAAA,iBAAAA,GACAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAAmc,GA+BA,SAAAqrB,GAAAxnC,GACA,IAAAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAAoc,GACA,OAAA,EAEA,IAAA2d,EAAAvD,EAAAx2B,GACA,GAAA,OAAA+5B,EACA,OAAA,EAEA,IAAAp1B,EAAA2L,EAAA7W,KAAAsgC,EAAA,gBAAAA,EAAAj2B,YACA,MAAA,mBAAAa,GAAAA,aAAAA,GACAixB,EAAAn8B,KAAAkL,IAAAuxB,EAoBA,IAAApS,GAAAD,GAAAiD,GAAAjD,IA77QA,SAAA7jB,GACA,OAAAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAAsc,IA8+QA,IAAA0H,GAAAD,GAAA+C,GAAA/C,IAp+QA,SAAA/jB,GACA,OAAAy5B,GAAAz5B,IAAAm+B,GAAAn+B,IAAAuc,IAs/QA,SAAAi9B,GAAAx5C,GACA,MAAA,iBAAAA,IACA05B,GAAA15B,IAAAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAAwc,GAoBA,SAAA+kB,GAAAvhC,GACA,MAAA,iBAAAA,GACAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAAyc,GAoBA,IAAAyH,GAAAD,GAAA6C,GAAA7C,IAxhRA,SAAAjkB,GACA,OAAAy5B,GAAAz5B,IACAuzC,GAAAvzC,EAAAtG,WAAAuoB,GAAAwgB,GAAAziC,KA8mRA,IAAAoI,GAAAkpC,GAAA7K,IAyBAr/B,GAAAkqC,GAAA,SAAAtxC,EAAA+iC,GACA,OAAA/iC,GAAA+iC,IA0BA,SAAA/pB,GAAAhZ,GACA,IAAAA,EACA,MAAA,GAEA,GAAA2mC,GAAA3mC,GACA,OAAAw5C,GAAAx5C,GAAA00B,GAAA10B,GAAAo8B,GAAAp8B,GAEA,GAAAg3B,GAAAh3B,EAAAg3B,GACA,OA/5VA,SAAAvmB,GAIA,IAHA,IAAA6qB,EACA1oB,EAAA,KAEA0oB,EAAA7qB,EAAAgpC,QAAAC,MACA9mC,EAAA5J,KAAAsyB,EAAAt7B,OAEA,OAAA4S,EAw5VA+mC,CAAA35C,EAAAg3B,MAEA,IAAAkH,EAAAC,GAAAn+B,GAGA,OAFAk+B,GAAAhiB,GAAA6X,GAAAmK,GAAA3hB,GAAA+X,GAAAhP,IAEAtlB,GA0BA,SAAAoxC,GAAApxC,GACA,OAAAA,GAGAA,EAAAgL,GAAAhL,MAvgYA,EAAA,GAwgYAA,KAAA,EAAA,EAIAA,GAAAA,EAAAA,EAAA,EA1gYA,uBAugYAA,EAAA,GAAA,EAAA,GAJA,IAAAA,EAAAA,EAAA,EAoCA,SAAA6xC,GAAA7xC,GACA,IAAA4S,EAAAw+B,GAAApxC,GACA45C,EAAAhnC,EAAA,EAEA,OAAAA,GAAAA,EAAAgnC,EAAAhnC,EAAAgnC,EAAAhnC,EAAA,EA8BA,SAAAinC,GAAA75C,GACA,OAAAA,EAAAq8B,GAAAwV,GAAA7xC,GAAA,EAAAyb,IAAA,EA0BA,SAAAzQ,GAAAhL,GACA,GAAA,iBAAAA,EACA,OAAAA,EAEA,GAAAuhC,GAAAvhC,GACA,OAAAwb,GAEA,GAAAwe,GAAAh6B,GAAA,CACA,IAAA+iC,EAAA,mBAAA/iC,EAAAR,QAAAQ,EAAAR,UAAAQ,EACAA,EAAAg6B,GAAA+I,GAAAA,EAAA,GAAAA,EAEA,GAAA,iBAAA/iC,EACA,OAAA,IAAAA,EAAAA,GAAAA,EAEAA,EAAAA,EAAAiO,QAAAqQ,GAAA,IACA,IAAA5c,EAAAud,GAAA3P,KAAAtP,GACA,OAAA0B,GAAAyd,GAAA7P,KAAAtP,GACAyiB,GAAAziB,EAAAyF,MAAA,GAAA/D,EAAA,EAAA,GACAsd,GAAA1P,KAAAtP,GAAAwb,IAAAxb,EA2BA,SAAAynC,GAAAznC,GACA,OAAA+8B,GAAA/8B,EAAAy+B,GAAAz+B,IAsDA,SAAAX,GAAAW,GACA,OAAA,MAAAA,EAAA,GAAAirC,GAAAjrC,GAqCA,IAAA+Q,GAAA68B,GAAA,SAAAnnB,EAAAxV,GACA,GAAAo1B,GAAAp1B,IAAA01B,GAAA11B,GACA8rB,GAAA9rB,EAAA8B,GAAA9B,GAAAwV,QAGA,IAAA,IAAAvV,KAAAD,EACAX,EAAA7W,KAAAwX,EAAAC,IACAurB,GAAAhW,EAAAvV,EAAAD,EAAAC,MAoCA4oC,GAAAlM,GAAA,SAAAnnB,EAAAxV,GACA8rB,GAAA9rB,EAAAwtB,GAAAxtB,GAAAwV,KAgCAszB,GAAAnM,GAAA,SAAAnnB,EAAAxV,EAAAi2B,EAAAvJ,GACAZ,GAAA9rB,EAAAwtB,GAAAxtB,GAAAwV,EAAAkX,KA+BAqc,GAAApM,GAAA,SAAAnnB,EAAAxV,EAAAi2B,EAAAvJ,GACAZ,GAAA9rB,EAAA8B,GAAA9B,GAAAwV,EAAAkX,KAoBAsc,GAAAtL,GAAAxR,IA8DA,IAAAxuB,GAAAu6B,GAAA,SAAAziB,EAAAqnB,GACArnB,EAAA3mB,EAAA2mB,GAEA,IAAAtT,GAAA,EACAzZ,EAAAo0C,EAAAp0C,OACAgU,EAAA,EAAAhU,EAAAo0C,EAAA,GAAA7yC,GAMA,IAJAyS,GAAAqgC,GAAAD,EAAA,GAAAA,EAAA,GAAApgC,KACAhU,EAAA,KAGAyZ,EAAAzZ,GAMA,IALA,IAAAuX,EAAA68B,EAAA36B,GACA6T,EAAAyX,GAAAxtB,GACAipC,GAAA,EACAC,EAAAnzB,EAAAttB,SAEAwgD,EAAAC,GAAA,CACA,IAAAjpC,EAAA8V,EAAAkzB,GACAl6C,EAAAymB,EAAAvV,IAEAlR,IAAA/E,IACA0K,GAAA3F,EAAA01B,EAAAxkB,MAAAZ,EAAA7W,KAAAgtB,EAAAvV,MACAuV,EAAAvV,GAAAD,EAAAC,IAKA,OAAAuV,IAsBA2zB,GAAAlR,GAAA,SAAA17B,GAEA,OADAA,EAAAxE,KAAA/N,GAAA23C,IACAt/B,GAAA+mC,GAAAp/C,GAAAuS,KAgSA,SAAAiJ,GAAAgQ,EAAA0b,EAAAyO,GACA,IAAAh+B,EAAA,MAAA6T,EAAAxrB,GAAAinC,GAAAzb,EAAA0b,GACA,OAAAvvB,IAAA3X,GAAA21C,EAAAh+B,EA4DA,SAAAo0B,GAAAvgB,EAAA0b,GACA,OAAA,MAAA1b,GAAA4sB,GAAA5sB,EAAA0b,EAAAc,IAqBA,IAAAqX,GAAA/J,GAAA,SAAA39B,EAAA5S,EAAAkR,GACA,MAAAlR,GACA,mBAAAA,EAAAX,WACAW,EAAAi2B,EAAAx8B,KAAAuG,IAGA4S,EAAA5S,GAAAkR,GACAy4B,GAAA3D,KA4BAuU,GAAAhK,GAAA,SAAA39B,EAAA5S,EAAAkR,GACA,MAAAlR,GACA,mBAAAA,EAAAX,WACAW,EAAAi2B,EAAAx8B,KAAAuG,IAGAsQ,EAAA7W,KAAAmZ,EAAA5S,GACA4S,EAAA5S,GAAAgJ,KAAAkI,GAEA0B,EAAA5S,GAAA,CAAAkR,IAEA62B,IAoBAyS,GAAAtR,GAAAzF,IA8BA,SAAA1wB,GAAA0T,GACA,OAAAkgB,GAAAlgB,GAAA8U,GAAA9U,GAAA2f,GAAA3f,GA0BA,SAAAgY,GAAAhY,GACA,OAAAkgB,GAAAlgB,GAAA8U,GAAA9U,GAAA,GAAA6f,GAAA7f,GAuGA,IAAAg0B,GAAA7M,GAAA,SAAAnnB,EAAAxV,EAAAi2B,GACAD,GAAAxgB,EAAAxV,EAAAi2B,KAkCAmT,GAAAzM,GAAA,SAAAnnB,EAAAxV,EAAAi2B,EAAAvJ,GACAsJ,GAAAxgB,EAAAxV,EAAAi2B,EAAAvJ,KAuBA+c,GAAA/L,GAAA,SAAAloB,EAAA2W,GACA,IAAAxqB,EAAA,GACA,GAAA,MAAA6T,EACA,OAAA7T,EAEA,IAAAirB,GAAA,EACAT,EAAAhY,GAAAgY,EAAA,SAAA+E,GAGA,OAFAA,EAAAC,GAAAD,EAAA1b,GACAoX,IAAAA,EAAA,EAAAsE,EAAAzoC,QACAyoC,IAEApF,GAAAtW,EAAAkZ,GAAAlZ,GAAA7T,GACAirB,IACAjrB,EAAA6qB,GAAA7qB,EAAA+nC,EAAA9H,KAGA,IADA,IAAAn5C,EAAA0jC,EAAA1jC,OACAA,KACAsvC,GAAAp2B,EAAAwqB,EAAA1jC,IAEA,OAAAkZ,IA4CA,IAAA0iB,GAAAqZ,GAAA,SAAAloB,EAAA2W,GACA,OAAA,MAAA3W,EAAA,GAjlTA,SAAAA,EAAA2W,GACA,OAAAsL,GAAAjiB,EAAA2W,EAAA,SAAAp9B,EAAAmiC,GACA,OAAA6E,GAAAvgB,EAAA0b,KA+kTAyY,CAAAn0B,EAAA2W,KAqBA,SAAAyd,GAAAp0B,EAAA5B,GACA,GAAA,MAAA4B,EACA,MAAA,GAEA,IAAAO,EAAA5B,GAAAua,GAAAlZ,GAAA,SAAAjQ,GACA,MAAA,CAAAA,KAGA,OADAqO,EAAAkjB,GAAAljB,GACA6jB,GAAAjiB,EAAAO,EAAA,SAAAhnB,EAAAmiC,GACA,OAAAtd,EAAA7kB,EAAAmiC,EAAA,MA4IA,IAAA2Y,GAAA9I,GAAAj/B,IA0BAgoC,GAAA/I,GAAAvT,IA4KA,SAAAnZ,GAAAmB,GACA,OAAA,MAAAA,EAAA,GAAAM,GAAAN,EAAA1T,GAAA0T,IAkNA,IAAAu0B,GAAA7M,GAAA,SAAAv7B,EAAAqoC,EAAA9nC,GAEA,OADA8nC,EAAAA,EAAAxrC,cACAmD,GAAAO,EAAA+nC,GAAAD,GAAAA,KAkBA,SAAAC,GAAApnB,GACA,OAAAqnB,GAAA97C,GAAAy0B,GAAArkB,eAqBA,SAAA4+B,GAAAva,GAEA,OADAA,EAAAz0B,GAAAy0B,KACAA,EAAA7lB,QAAAoR,GAAAmI,IAAAvZ,QAAAyT,GAAA,IAsHA,IAAA05B,GAAAjN,GAAA,SAAAv7B,EAAAqoC,EAAA9nC,GACA,OAAAP,GAAAO,EAAA,IAAA,IAAA8nC,EAAAxrC,gBAuBA4rC,GAAAlN,GAAA,SAAAv7B,EAAAqoC,EAAA9nC,GACA,OAAAP,GAAAO,EAAA,IAAA,IAAA8nC,EAAAxrC,gBAoBA6rC,GAAArN,GAAA,eA0NA,IAAAsN,GAAApN,GAAA,SAAAv7B,EAAAqoC,EAAA9nC,GACA,OAAAP,GAAAO,EAAA,IAAA,IAAA8nC,EAAAxrC,gBAgEA,IAAA+rC,GAAArN,GAAA,SAAAv7B,EAAAqoC,EAAA9nC,GACA,OAAAP,GAAAO,EAAA,IAAA,IAAAgoC,GAAAF,KA6hBA,IAAAQ,GAAAtN,GAAA,SAAAv7B,EAAAqoC,EAAA9nC,GACA,OAAAP,GAAAO,EAAA,IAAA,IAAA8nC,EAAAS,gBAoBAP,GAAAlN,GAAA,eAqBA,SAAAG,GAAAta,EAAA6nB,EAAAjuC,GAIA,OAHAomB,EAAAz0B,GAAAy0B,IACA6nB,EAAAjuC,EAAAzS,GAAA0gD,KAEA1gD,GApvbA,SAAA64B,GACA,OAAAhS,GAAAxS,KAAAwkB,GAovbA8nB,CAAA9nB,GAxhbA,SAAAA,GACA,OAAAA,EAAAv4B,MAAAqmB,KAAA,GAuhbAi6B,CAAA/nB,GA3ncA,SAAAA,GACA,OAAAA,EAAAv4B,MAAAqjB,KAAA,GA0ncAk9B,CAAAhoB,GAEAA,EAAAv4B,MAAAogD,IAAA,GA2BA,IAAAI,GAAA7S,GAAA,SAAA/kB,EAAA3W,GACA,IACA,OAAA8F,GAAA6Q,EAAAlpB,GAAAuS,GACA,MAAA5U,GACA,OAAA0gD,GAAA1gD,GAAAA,EAAA,IAAAS,EAAAT,MA8BAojD,GAAArN,GAAA,SAAAloB,EAAAw1B,GAKA,OAJAv3B,GAAAu3B,EAAA,SAAA/qC,GACAA,EAAAmxB,GAAAnxB,GACAsrB,GAAA/V,EAAAvV,EAAA8lC,GAAAvwB,EAAAvV,GAAAuV,MAEAA,IAqGA,SAAAkjB,GAAA3pC,GACA,OAAA,WACA,OAAAA,GAkDA,IAAAk8C,GAAAxN,KAuBAyN,GAAAzN,IAAA,GAkBA,SAAA1I,GAAAhmC,GACA,OAAAA,EA6CA,SAAAwkB,GAAAL,GACA,OAAA4hB,GAAA,mBAAA5hB,EAAAA,EAAAsZ,GAAAtZ,EAtoeA,IA+teA,IAAAjO,GAAAgzB,GAAA,SAAA/G,EAAA30B,GACA,OAAA,SAAAiZ,GACA,OAAAgd,GAAAhd,EAAA0b,EAAA30B,MA2BA4uC,GAAAlT,GAAA,SAAAziB,EAAAjZ,GACA,OAAA,SAAA20B,GACA,OAAAsB,GAAAhd,EAAA0b,EAAA30B,MAwCA,SAAA6uC,GAAA51B,EAAAxV,EAAAmmC,GACA,IAAApwB,EAAAjU,GAAA9B,GACAgrC,EAAAja,GAAA/wB,EAAA+V,GAEA,MAAAowB,GACApd,GAAA/oB,KAAAgrC,EAAAviD,SAAAstB,EAAAttB,UACA09C,EAAAnmC,EACAA,EAAAwV,EACAA,EAAA7qB,KACAqgD,EAAAja,GAAA/wB,EAAA8B,GAAA9B,KAEA,IAAAklC,IAAAnc,GAAAod,IAAA,UAAAA,IAAAA,EAAAjB,OACA/X,EAAA6D,GAAAxb,GAqBA,OAnBA/B,GAAAu3B,EAAA,SAAA1jC,GACA,IAAA4L,EAAAlT,EAAAsH,GACAkO,EAAAlO,GAAA4L,EACAia,IACA3X,EAAA5qB,UAAA0c,GAAA,WACA,IAAA2hB,EAAAt+B,KAAAy+B,UACA,GAAA8b,GAAAjc,EAAA,CACA,IAAAtnB,EAAA6T,EAAA7qB,KAAAu+B,aAKA,OAJAvnB,EAAAwnB,YAAAgC,GAAAxgC,KAAAw+B,cAEApxB,KAAA,CAAAmb,KAAAA,EAAA3W,KAAAuB,UAAAqV,QAAAqC,IACA7T,EAAAynB,UAAAH,EACAtnB,EAEA,OAAAuR,EAAA7Q,MAAAmT,EAAApB,GAAA,CAAAzpB,KAAAoE,SAAA+O,gBAKA0X,EAmCA,SAAAsrB,MAiDA,IAAAuK,GAAAzL,GAAAzrB,IA0BAm3B,GAAA1L,GAAAjsB,IA0BA43B,GAAA3L,GAAAlrB,IAwBA,SAAAwgB,GAAAhE,GACA,OAAA2E,GAAA3E,GAAAtc,GAAAwc,GAAAF,IA5zXA,SAAAA,GACA,OAAA,SAAA1b,GACA,OAAAyb,GAAAzb,EAAA0b,IA0zXAsa,CAAAta,GAuEA,IAAAua,GAAAxL,KAsCAyL,GAAAzL,IAAA,GAoBA,SAAAkC,KACA,MAAA,GAgBA,SAAAO,KACA,OAAA,EA+JA,IAAA53C,GAAA20C,GAAA,SAAAkM,EAAAC,GACA,OAAAD,EAAAC,GACA,GAuBA99C,GAAA6yC,GAAA,QAiBAlsC,GAAAgrC,GAAA,SAAAoM,EAAAvtC,GACA,OAAAutC,EAAAvtC,GACA,GAuBAtQ,GAAA2yC,GAAA,SAwKA,IAgaA3gC,GAhaA8rC,GAAArM,GAAA,SAAAsM,EAAAC,GACA,OAAAD,EAAAC,GACA,GAuBA/9C,GAAA0yC,GAAA,SAiBA7lC,GAAA2kC,GAAA,SAAAwM,EAAAC,GACA,OAAAD,EAAAC,GACA,GA+lBA,OAziBA3jB,GAAA4jB,MAj4MA,SAAAvkD,EAAAsrB,GACA,GAAA,mBAAAA,EACA,MAAA,IAAAoR,EAAApa,IAGA,OADAtiB,EAAAg5C,GAAAh5C,GACA,WACA,KAAAA,EAAA,EACA,OAAAsrB,EAAA7Q,MAAA1X,KAAAmT,aA23MAyqB,GAAAgW,IAAAA,GACAhW,GAAAzoB,OAAAA,GACAyoB,GAAAsgB,SAAAA,GACAtgB,GAAAugB,aAAAA,GACAvgB,GAAAwgB,WAAAA,GACAxgB,GAAAygB,GAAAA,GACAzgB,GAAAud,OAAAA,GACAvd,GAAAwd,KAAAA,GACAxd,GAAAwiB,QAAAA,GACAxiB,GAAAyd,QAAAA,GACAzd,GAAA6jB,UAh6KA,WACA,IAAAtuC,UAAArV,OACA,MAAA,GAEA,IAAAsG,EAAA+O,UAAA,GACA,OAAA2qB,GAAA15B,GAAAA,EAAA,CAAAA,IA45KAw5B,GAAA2c,MAAAA,GACA3c,GAAA8jB,MA79SA,SAAAh5B,EAAA2P,EAAAvmB,GAEAumB,GADAvmB,EAAAqgC,GAAAzpB,EAAA2P,EAAAvmB,GAAAumB,IAAAh5B,IACA,EAEAi9B,EAAA2Z,GAAA5d,GAAA,GAEA,IAAAv6B,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,IAAAA,GAAAu6B,EAAA,EACA,MAAA,GAMA,IAJA,IAAA9gB,EAAA,EACA4R,EAAA,EACAnS,EAAAmG,EAAA0e,EAAA/9B,EAAAu6B,IAEA9gB,EAAAzZ,GACAkZ,EAAAmS,KAAA8kB,GAAAvlB,EAAAnR,EAAAA,GAAA8gB,GAEA,OAAArhB,GA68SA4mB,GAAA+jB,QA37SA,SAAAj5B,GAMA,IALA,IAAAnR,GAAA,EACAzZ,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACAqrB,EAAA,EACAnS,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACAnT,IACA4S,EAAAmS,KAAA/kB,GAGA,OAAA4S,GAg7SA4mB,GAAAgkB,OAv5SA,WACA,IAAA9jD,EAAAqV,UAAArV,OACA,IAAAA,EACA,MAAA,GAMA,IAJA,IAAA8T,EAAAuL,EAAArf,EAAA,GACA4qB,EAAAvV,UAAA,GACAoE,EAAAzZ,EAEAyZ,KACA3F,EAAA2F,EAAA,GAAApE,UAAAoE,GAEA,OAAAkS,GAAAqU,GAAApV,GAAA8X,GAAA9X,GAAA,CAAAA,GAAAmd,GAAAj0B,EAAA,KA44SAgsB,GAAAikB,KAlsCA,SAAA1c,GACA,IAAArnC,EAAA,MAAAqnC,EAAA,EAAAA,EAAArnC,OACA82C,EAAAzI,KASA,OAPAhH,EAAArnC,EAAA0rB,GAAA2b,EAAA,SAAA+Q,GACA,GAAA,mBAAAA,EAAA,GACA,MAAA,IAAAvc,EAAApa,IAEA,MAAA,CAAAq1B,EAAAsB,EAAA,IAAAA,EAAA,MAJA,GAOA5I,GAAA,SAAA17B,GAEA,IADA,IAAA2F,GAAA,IACAA,EAAAzZ,GAAA,CACA,IAAAo4C,EAAA/Q,EAAA5tB,GACA,GAAAG,GAAAw+B,EAAA,GAAAl2C,KAAA4R,GACA,OAAA8F,GAAAw+B,EAAA,GAAAl2C,KAAA4R,OAmrCAgsB,GAAAkkB,SArpCA,SAAAzsC,GACA,OAj3YA,SAAAA,GACA,IAAA+V,EAAAjU,GAAA9B,GACA,OAAA,SAAAwV,GACA,OAAAoZ,GAAApZ,EAAAxV,EAAA+V,IA82YA22B,CAAAlgB,GAAAxsB,EAp+dA,KAyngBAuoB,GAAAmQ,SAAAA,GACAnQ,GAAA8c,QAAAA,GACA9c,GAAA7C,OApsHA,SAAA96B,EAAA0a,GACA,IAAA3D,EAAAknB,GAAAj+B,GACA,OAAA,MAAA0a,EAAA3D,EAAAkqB,GAAAlqB,EAAA2D,IAmsHAijB,GAAAokB,MAtsMA,SAAAA,EAAAz5B,EAAAsrB,EAAA/hC,GAEA,IAAAkF,EAAAu/B,GAAAhuB,EA56TA,EA46TAlpB,GAAAA,GAAAA,GAAAA,GAAAA,GADAw0C,EAAA/hC,EAAAzS,GAAAw0C,GAGA,OADA78B,EAAAyhB,YAAAupB,EAAAvpB,YACAzhB,GAmsMA4mB,GAAAqkB,WA1pMA,SAAAA,EAAA15B,EAAAsrB,EAAA/hC,GAEA,IAAAkF,EAAAu/B,GAAAhuB,EAx9TA,GAw9TAlpB,GAAAA,GAAAA,GAAAA,GAAAA,GADAw0C,EAAA/hC,EAAAzS,GAAAw0C,GAGA,OADA78B,EAAAyhB,YAAAwpB,EAAAxpB,YACAzhB,GAupMA4mB,GAAA2d,SAAAA,GACA3d,GAAA7qB,SAAAA,GACA6qB,GAAA4gB,aAAAA,GACA5gB,GAAAkf,MAAAA,GACAlf,GAAAmf,MAAAA,GACAnf,GAAAkb,WAAAA,GACAlb,GAAAmb,aAAAA,GACAnb,GAAAob,eAAAA,GACApb,GAAAskB,KA/xSA,SAAAx5B,EAAAzrB,EAAA6U,GACA,IAAAhU,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,EAIAmwC,GAAAvlB,GADAzrB,EAAA6U,GAAA7U,IAAAoC,GAAA,EAAA42C,GAAAh5C,IACA,EAAA,EAAAA,EAAAa,GAHA,IA6xSA8/B,GAAAukB,UA9vSA,SAAAz5B,EAAAzrB,EAAA6U,GACA,IAAAhU,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,EAKAmwC,GAAAvlB,EAAA,GADAzrB,EAAAa,GADAb,EAAA6U,GAAA7U,IAAAoC,GAAA,EAAA42C,GAAAh5C,KAEA,EAAA,EAAAA,GAJA,IA4vSA2gC,GAAAwkB,eAltSA,SAAA15B,EAAAO,GACA,OAAAP,GAAAA,EAAA5qB,OACA6xC,GAAAjnB,EAAAyjB,GAAAljB,EAAA,IAAA,GAAA,GACA,IAgtSA2U,GAAAykB,UA1qSA,SAAA35B,EAAAO,GACA,OAAAP,GAAAA,EAAA5qB,OACA6xC,GAAAjnB,EAAAyjB,GAAAljB,EAAA,IAAA,GACA,IAwqSA2U,GAAA0kB,KAxoSA,SAAA55B,EAAAtkB,EAAAmpC,EAAAW,GACA,IAAApwC,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,GAGAyvC,GAAA,iBAAAA,GAAA4E,GAAAzpB,EAAAtkB,EAAAmpC,KACAA,EAAA,EACAW,EAAApwC,GA/tIA,SAAA4qB,EAAAtkB,EAAAmpC,EAAAW,GACA,IAAApwC,EAAA4qB,EAAA5qB,OAWA,KATAyvC,EAAA0I,GAAA1I,IACA,IACAA,EAAAzvC,GAAAyvC,EAAA,EAAAzvC,EAAAyvC,IAEAW,EAAAA,IAAA7uC,IAAAvB,EAAAowC,EAAApwC,EAAAm4C,GAAA/H,IACA,IACAA,GAAApwC,GAEAowC,EAAAA,EAAAX,EAAA,EAAA0Q,GAAA/P,GACAX,EAAAW,GACAxlB,EAAA6kB,KAAAnpC,EAEA,OAAAskB,EAktIA65B,CAAA75B,EAAAtkB,EAAAmpC,EAAAW,IANA,IAsoSAtQ,GAAA4kB,OAxtOA,SAAAr4B,EAAAlB,GAEA,OADA6U,GAAA3T,GAAAjB,GAAA0c,IACAzb,EAAAgiB,GAAAljB,EAAA,KAutOA2U,GAAA6kB,QApoOA,SAAAt4B,EAAAvB,GACA,OAAAid,GAAAzN,GAAAjO,EAAAvB,GAAA,IAooOAgV,GAAA8kB,YA7mOA,SAAAv4B,EAAAvB,GACA,OAAAid,GAAAzN,GAAAjO,EAAAvB,GA//RA,EAAA,IA4mgBAgV,GAAA+kB,aArlOA,SAAAx4B,EAAAvB,EAAAkd,GAEA,OADAA,EAAAA,IAAAzmC,GAAA,EAAA42C,GAAAnQ,GACAD,GAAAzN,GAAAjO,EAAAvB,GAAAkd,IAolOAlI,GAAAuZ,QAAAA,GACAvZ,GAAAglB,YAhgSA,SAAAl6B,GAEA,OADA,MAAAA,GAAAA,EAAA5qB,OACA+nC,GAAAnd,EAhnOA,EAAA,GAgnOA,IA+/RAkV,GAAAilB,aAx+RA,SAAAn6B,EAAAod,GAEA,OADA,MAAApd,GAAAA,EAAA5qB,OAKA+nC,GAAAnd,EADAod,EAAAA,IAAAzmC,GAAA,EAAA42C,GAAAnQ,IAFA,IAs+RAlI,GAAAklB,KAv7LA,SAAAv6B,GACA,OAAAguB,GAAAhuB,EA1sUA,MAiogBAqV,GAAA0iB,KAAAA,GACA1iB,GAAA2iB,UAAAA,GACA3iB,GAAAmlB,UAp9RA,SAAA5d,GAKA,IAJA,IAAA5tB,GAAA,EACAzZ,EAAA,MAAAqnC,EAAA,EAAAA,EAAArnC,OACAkZ,EAAA,KAEAO,EAAAzZ,GAAA,CACA,IAAAo4C,EAAA/Q,EAAA5tB,GACAP,EAAAk/B,EAAA,IAAAA,EAAA,GAEA,OAAAl/B,GA48RA4mB,GAAAolB,UAz6GA,SAAAn4B,GACA,OAAA,MAAAA,EAAA,GAAAub,GAAAvb,EAAA1T,GAAA0T,KAy6GA+S,GAAAqlB,YA/4GA,SAAAp4B,GACA,OAAA,MAAAA,EAAA,GAAAub,GAAAvb,EAAAgY,GAAAhY,KA+4GA+S,GAAAkd,QAAAA,GACAld,GAAAslB,QAr4RA,SAAAx6B,GAEA,OADA,MAAAA,GAAAA,EAAA5qB,OACAmwC,GAAAvlB,EAAA,GAAA,GAAA,IAo4RAkV,GAAAwb,aAAAA,GACAxb,GAAA0b,eAAAA,GACA1b,GAAA2b,iBAAAA,GACA3b,GAAA8gB,OAAAA,GACA9gB,GAAA+gB,SAAAA,GACA/gB,GAAAmd,UAAAA,GACAnd,GAAAhV,SAAAA,GACAgV,GAAAod,MAAAA,GACApd,GAAAzmB,KAAAA,GACAymB,GAAAiF,OAAAA,GACAjF,GAAAxF,IAAAA,GACAwF,GAAAulB,QAxpGA,SAAAt4B,EAAAjC,GACA,IAAA5R,EAAA,GAMA,OALA4R,EAAAujB,GAAAvjB,EAAA,GAEA0c,GAAAza,EAAA,SAAAzmB,EAAAkR,EAAAuV,GACA+V,GAAA5pB,EAAA4R,EAAAxkB,EAAAkR,EAAAuV,GAAAzmB,KAEA4S,GAkpGA4mB,GAAAwlB,UAnnGA,SAAAv4B,EAAAjC,GACA,IAAA5R,EAAA,GAMA,OALA4R,EAAAujB,GAAAvjB,EAAA,GAEA0c,GAAAza,EAAA,SAAAzmB,EAAAkR,EAAAuV,GACA+V,GAAA5pB,EAAA1B,EAAAsT,EAAAxkB,EAAAkR,EAAAuV,MAEA7T,GA6mGA4mB,GAAAylB,QAlgCA,SAAAhuC,GACA,OAAAi1B,GAAAzI,GAAAxsB,EAtqeA,KAwqgBAuoB,GAAA0lB,gBAr+BA,SAAA/c,EAAAwD,GACA,OAAAM,GAAA9D,EAAA1E,GAAAkI,EApseA,KAyqgBAnM,GAAA+a,QAAAA,GACA/a,GAAAihB,MAAAA,GACAjhB,GAAA6gB,UAAAA,GACA7gB,GAAAtjB,OAAAA,GACAsjB,GAAA4iB,SAAAA,GACA5iB,GAAA6iB,MAAAA,GACA7iB,GAAAuf,OAAAA,GACAvf,GAAA2lB,OA9yBA,SAAAtmD,GAEA,OADAA,EAAAg5C,GAAAh5C,GACAqwC,GAAA,SAAA17B,GACA,OAAAm6B,GAAAn6B,EAAA3U,MA4yBA2gC,GAAAkhB,KAAAA,GACAlhB,GAAA4lB,OAj/FA,SAAA34B,EAAA5B,GACA,OAAAg2B,GAAAp0B,EAAAsyB,GAAAhR,GAAAljB,MAi/FA2U,GAAA6lB,KA31LA,SAAAl7B,GACA,OAAA4yB,GAAA,EAAA5yB,IA21LAqV,GAAA8lB,QAl2NA,SAAAv5B,EAAA8hB,EAAAC,EAAAp6B,GACA,OAAA,MAAAqY,EACA,IAEA2T,GAAAmO,KACAA,EAAA,MAAAA,EAAA,GAAA,CAAAA,IAGAnO,GADAoO,EAAAp6B,EAAAzS,GAAA6sC,KAEAA,EAAA,MAAAA,EAAA,GAAA,CAAAA,IAEAF,GAAA7hB,EAAA8hB,EAAAC,KAw1NAtO,GAAA8iB,KAAAA,GACA9iB,GAAAwf,SAAAA,GACAxf,GAAA+iB,UAAAA,GACA/iB,GAAAgjB,SAAAA,GACAhjB,GAAA2f,QAAAA,GACA3f,GAAA4f,aAAAA,GACA5f,GAAAqd,UAAAA,GACArd,GAAAlE,KAAAA,GACAkE,GAAAqhB,OAAAA,GACArhB,GAAA2M,SAAAA,GACA3M,GAAA+lB,WA/rBA,SAAA94B,GACA,OAAA,SAAA0b,GACA,OAAA,MAAA1b,EAAAxrB,GAAAinC,GAAAzb,EAAA0b,KA8rBA3I,GAAA4b,KAAAA,GACA5b,GAAA6b,QAAAA,GACA7b,GAAAgmB,UA7pRA,SAAAl7B,EAAAgB,EAAAd,GACA,OAAAF,GAAAA,EAAA5qB,QAAA4rB,GAAAA,EAAA5rB,OACAkvC,GAAAtkB,EAAAgB,EAAAyiB,GAAAvjB,EAAA,IACAF,GA2pRAkV,GAAAimB,YAjoRA,SAAAn7B,EAAAgB,EAAAH,GACA,OAAAb,GAAAA,EAAA5qB,QAAA4rB,GAAAA,EAAA5rB,OACAkvC,GAAAtkB,EAAAgB,EAAArqB,GAAAkqB,GACAb,GA+nRAkV,GAAA8b,OAAAA,GACA9b,GAAAkjB,MAAAA,GACAljB,GAAAmjB,WAAAA,GACAnjB,GAAA6f,MAAAA,GACA7f,GAAA3jB,OArtNA,SAAAkQ,EAAAlB,GAEA,OADA6U,GAAA3T,GAAAjB,GAAA0c,IACAzb,EAAAgzB,GAAAhR,GAAAljB,EAAA,MAotNA2U,GAAAkmB,OAlkRA,SAAAp7B,EAAAO,GACA,IAAAjS,EAAA,GACA,IAAA0R,IAAAA,EAAA5qB,OACA,OAAAkZ,EAEA,IAAAO,GAAA,EACA21B,EAAA,GACApvC,EAAA4qB,EAAA5qB,OAGA,IADAmrB,EAAAkjB,GAAAljB,EAAA,KACA1R,EAAAzZ,GAAA,CACA,IAAAsG,EAAAskB,EAAAnR,GACA0R,EAAA7kB,EAAAmT,EAAAmR,KACA1R,EAAA5J,KAAAhJ,GACA8oC,EAAA9/B,KAAAmK,IAIA,OADA01B,GAAAvkB,EAAAwkB,GACAl2B,GAijRA4mB,GAAAmmB,KAhsLA,SAAAx7B,EAAAglB,GACA,GAAA,mBAAAhlB,EACA,MAAA,IAAAoR,EAAApa,IAGA,OAAA+tB,GAAA/kB,EADAglB,EAAAA,IAAAluC,GAAAkuC,EAAA0I,GAAA1I,KA6rLA3P,GAAA51B,QAAAA,GACA41B,GAAAomB,WA7qNA,SAAA75B,EAAAltB,EAAA6U,GAOA,OALA7U,GADA6U,EAAAqgC,GAAAhoB,EAAAltB,EAAA6U,GAAA7U,IAAAoC,IACA,EAEA42C,GAAAh5C,IAEA6gC,GAAA3T,GAAAmW,GAAAqN,IACAxjB,EAAAltB,IAuqNA2gC,GAAAnpB,IAr4FA,SAAAoW,EAAA0b,EAAAniC,GACA,OAAA,MAAAymB,EAAAA,EAAAkiB,GAAAliB,EAAA0b,EAAAniC,IAq4FAw5B,GAAAqmB,QA12FA,SAAAp5B,EAAA0b,EAAAniC,EAAA29B,GAEA,OADAA,EAAA,mBAAAA,EAAAA,EAAA1iC,GACA,MAAAwrB,EAAAA,EAAAkiB,GAAAliB,EAAA0b,EAAAniC,EAAA29B,IAy2FAnE,GAAAsmB,QAvpNA,SAAA/5B,GAEA,OADA2T,GAAA3T,GAAAuW,GAAAsN,IACA7jB,IAspNAyT,GAAA/zB,MAzgRA,SAAA6e,EAAA6kB,EAAAW,GACA,IAAApwC,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,GAKAowC,EAFAA,GAAA,iBAAAA,GAAAiE,GAAAzpB,EAAA6kB,EAAAW,IACAX,EAAA,EACAzvC,IAGAyvC,EAAA,MAAAA,EAAA,EAAA0I,GAAA1I,GACAW,IAAA7uC,GAAAvB,EAAAm4C,GAAA/H,IAEAD,GAAAvlB,EAAA6kB,EAAAW,IAVA,IAugRAtQ,GAAAsd,OAAAA,GACAtd,GAAAumB,WAj1QA,SAAAz7B,GACA,OAAAA,GAAAA,EAAA5qB,OACAqxC,GAAAzmB,GACA,IA+0QAkV,GAAAwmB,aA5zQA,SAAA17B,EAAAE,GACA,OAAAF,GAAAA,EAAA5qB,OACAqxC,GAAAzmB,EAAAyjB,GAAAvjB,EAAA,IACA,IA0zQAgV,GAAA5e,MA1/DA,SAAAkZ,EAAAmsB,EAAAvjD,GAKA,OAJAA,GAAA,iBAAAA,GAAAqxC,GAAAja,EAAAmsB,EAAAvjD,KACAujD,EAAAvjD,EAAAzB,KAEAyB,EAAAA,IAAAzB,GAAAwgB,GAAA/e,IAAA,IAIAo3B,EAAAz0B,GAAAy0B,MAEA,iBAAAmsB,GACA,MAAAA,IAAAn8B,GAAAm8B,OAEAA,EAAAhV,GAAAgV,KACApsB,GAAAC,GACAsY,GAAA1X,GAAAZ,GAAA,EAAAp3B,GAGAo3B,EAAAlZ,MAAAqlC,EAAAvjD,GAZA,IAq/DA88B,GAAA0mB,OAjqLA,SAAA/7B,EAAAglB,GACA,GAAA,mBAAAhlB,EACA,MAAA,IAAAoR,EAAApa,IAGA,OADAguB,EAAA,MAAAA,EAAA,EAAAjR,EAAA2Z,GAAA1I,GAAA,GACAD,GAAA,SAAA17B,GACA,IAAA8W,EAAA9W,EAAA27B,GACAyK,EAAAxH,GAAA5+B,EAAA,EAAA27B,GAKA,OAHA7kB,GACAe,GAAAuuB,EAAAtvB,GAEAhR,GAAA6Q,EAAAvoB,KAAAg4C,MAspLApa,GAAA2mB,KA3yQA,SAAA77B,GACA,IAAA5qB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,EAAAmwC,GAAAvlB,EAAA,EAAA5qB,GAAA,IA0yQA8/B,GAAA4mB,KA9wQA,SAAA97B,EAAAzrB,EAAA6U,GACA,OAAA4W,GAAAA,EAAA5qB,OAIAmwC,GAAAvlB,EAAA,GADAzrB,EAAA6U,GAAA7U,IAAAoC,GAAA,EAAA42C,GAAAh5C,IACA,EAAA,EAAAA,GAHA,IA6wQA2gC,GAAA6mB,UA9uQA,SAAA/7B,EAAAzrB,EAAA6U,GACA,IAAAhU,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,OAAAA,EAKAmwC,GAAAvlB,GADAzrB,EAAAa,GADAb,EAAA6U,GAAA7U,IAAAoC,GAAA,EAAA42C,GAAAh5C,KAEA,EAAA,EAAAA,EAAAa,GAJA,IA4uQA8/B,GAAA8mB,eAlsQA,SAAAh8B,EAAAO,GACA,OAAAP,GAAAA,EAAA5qB,OACA6xC,GAAAjnB,EAAAyjB,GAAAljB,EAAA,IAAA,GAAA,GACA,IAgsQA2U,GAAA+mB,UA1pQA,SAAAj8B,EAAAO,GACA,OAAAP,GAAAA,EAAA5qB,OACA6xC,GAAAjnB,EAAAyjB,GAAAljB,EAAA,IACA,IAwpQA2U,GAAAgnB,IA7rPA,SAAAxgD,EAAAo2C,GAEA,OADAA,EAAAp2C,GACAA,GA4rPAw5B,GAAAinB,SA5mLA,SAAAt8B,EAAA4b,EAAAqX,GACA,IAAAO,GAAA,EACAzJ,GAAA,EAEA,GAAA,mBAAA/pB,EACA,MAAA,IAAAoR,EAAApa,IAMA,OAJA6e,GAAAod,KACAO,EAAA,YAAAP,IAAAA,EAAAO,QAAAA,EACAzJ,EAAA,aAAAkJ,IAAAA,EAAAlJ,SAAAA,GAEAiJ,GAAAhzB,EAAA4b,EAAA,CACA4X,QAAAA,EACAJ,QAAAxX,EACAmO,SAAAA,KA+lLA1U,GAAAsV,KAAAA,GACAtV,GAAAxgB,QAAAA,GACAwgB,GAAAshB,QAAAA,GACAthB,GAAAuhB,UAAAA,GACAvhB,GAAAknB,OArfA,SAAA1gD,GACA,OAAA05B,GAAA15B,GACAolB,GAAAplB,EAAAqiC,IAEAd,GAAAvhC,GAAA,CAAAA,GAAAo8B,GAAA8P,GAAA7sC,GAAAW,MAkfAw5B,GAAAiO,cAAAA,GACAjO,GAAArF,UAxyFA,SAAA1N,EAAAjC,EAAAC,GACA,IAAAgX,EAAA/B,GAAAjT,GACAk6B,EAAAllB,GAAA3D,GAAArR,IAAAvC,GAAAuC,GAGA,GADAjC,EAAAujB,GAAAvjB,EAAA,GACA,MAAAC,EAAA,CACA,IAAA9f,EAAA8hB,GAAAA,EAAA3iB,YAEA2gB,EADAk8B,EACAllB,EAAA,IAAA92B,EAAA,GAEAq1B,GAAAvT,IACAwb,GAAAt9B,GAAAm1B,GAAAtD,EAAA/P,IAGA,GAMA,OAHAk6B,EAAAj8B,GAAAwc,IAAAza,EAAA,SAAAzmB,EAAAmT,EAAAsT,GACA,OAAAjC,EAAAC,EAAAzkB,EAAAmT,EAAAsT,KAEAhC,GAqxFA+U,GAAAonB,MAnlLA,SAAAz8B,GACA,OAAAqrB,GAAArrB,EAAA,IAmlLAqV,GAAA+b,MAAAA,GACA/b,GAAAgc,QAAAA,GACAhc,GAAAic,UAAAA,GACAjc,GAAAqnB,KAlkQA,SAAAv8B,GACA,OAAAA,GAAAA,EAAA5qB,OAAAwxC,GAAA5mB,GAAA,IAkkQAkV,GAAAsnB,OAxiQA,SAAAx8B,EAAAE,GACA,OAAAF,GAAAA,EAAA5qB,OAAAwxC,GAAA5mB,EAAAyjB,GAAAvjB,EAAA,IAAA,IAwiQAgV,GAAAunB,SAjhQA,SAAAz8B,EAAAa,GAEA,OADAA,EAAA,mBAAAA,EAAAA,EAAAlqB,GACAqpB,GAAAA,EAAA5qB,OAAAwxC,GAAA5mB,EAAArpB,GAAAkqB,GAAA,IAghQAqU,GAAAwnB,MA9vFA,SAAAv6B,EAAA0b,GACA,OAAA,MAAA1b,GAAAuiB,GAAAviB,EAAA0b,IA8vFA3I,GAAAkc,MAAAA,GACAlc,GAAAoc,UAAAA,GACApc,GAAAynB,OAluFA,SAAAx6B,EAAA0b,EAAAmJ,GACA,OAAA,MAAA7kB,EAAAA,EAAA4kB,GAAA5kB,EAAA0b,EAAA8J,GAAAX,KAkuFA9R,GAAA0nB,WAvsFA,SAAAz6B,EAAA0b,EAAAmJ,EAAA3N,GAEA,OADAA,EAAA,mBAAAA,EAAAA,EAAA1iC,GACA,MAAAwrB,EAAAA,EAAA4kB,GAAA5kB,EAAA0b,EAAA8J,GAAAX,GAAA3N,IAssFAnE,GAAAlU,OAAAA,GACAkU,GAAA2nB,SA9oFA,SAAA16B,GACA,OAAA,MAAAA,EAAA,GAAAM,GAAAN,EAAAgY,GAAAhY,KA8oFA+S,GAAAqc,QAAAA,GACArc,GAAA4U,MAAAA,GACA5U,GAAA4nB,KAzkLA,SAAAphD,EAAA+uC,GACA,OAAAoK,GAAAlN,GAAA8C,GAAA/uC,IAykLAw5B,GAAAsc,IAAAA,GACAtc,GAAAuc,MAAAA,GACAvc,GAAAwc,QAAAA,GACAxc,GAAAyc,IAAAA,GACAzc,GAAA6nB,UA10PA,SAAAr6B,EAAA1B,GACA,OAAAumB,GAAA7kB,GAAA,GAAA1B,GAAA,GAAAmX,KA00PAjD,GAAA8nB,cAxzPA,SAAAt6B,EAAA1B,GACA,OAAAumB,GAAA7kB,GAAA,GAAA1B,GAAA,GAAAqjB,KAwzPAnP,GAAA0c,QAAAA,GAGA1c,GAAAsB,QAAAggB,GACAthB,GAAA+nB,UAAAxG,GACAvhB,GAAAgoB,OAAA1H,GACAtgB,GAAAioB,WAAA1H,GAGAsC,GAAA7iB,GAAAA,IAKAA,GAAAz9B,IAAAA,GACAy9B,GAAAuiB,QAAAA,GACAviB,GAAAwhB,UAAAA,GACAxhB,GAAA0hB,WAAAA,GACA1hB,GAAAz6B,KAAAA,GACAy6B,GAAAkoB,MAlpFA,SAAApkB,EAAAC,EAAAC,GAaA,OAZAA,IAAAviC,KACAuiC,EAAAD,EACAA,EAAAtiC,IAEAuiC,IAAAviC,KAEAuiC,GADAA,EAAAxyB,GAAAwyB,KACAA,EAAAA,EAAA,GAEAD,IAAAtiC,KAEAsiC,GADAA,EAAAvyB,GAAAuyB,KACAA,EAAAA,EAAA,GAEAlB,GAAArxB,GAAAsyB,GAAAC,EAAAC,IAsoFAhE,GAAAp6B,MA3hLA,SAAAY,GACA,OAAAy9B,GAAAz9B,EAnvVA,IA8wgBAw5B,GAAAmoB,UAl+KA,SAAA3hD,GACA,OAAAy9B,GAAAz9B,EAAA26C,IAk+KAnhB,GAAAooB,cAn8KA,SAAA5hD,EAAA29B,GAEA,OAAAF,GAAAz9B,EAAA26C,EADAhd,EAAA,mBAAAA,EAAAA,EAAA1iC,KAm8KAu+B,GAAAqoB,UA3/KA,SAAA7hD,EAAA29B,GAEA,OAAAF,GAAAz9B,EAvxVA,EAsxVA29B,EAAA,mBAAAA,EAAAA,EAAA1iC,KA2/KAu+B,GAAAsoB,WAx6KA,SAAAr7B,EAAAxV,GACA,OAAA,MAAAA,GAAA4uB,GAAApZ,EAAAxV,EAAA8B,GAAA9B,KAw6KAuoB,GAAA6U,OAAAA,GACA7U,GAAAuoB,UAjwCA,SAAA/hD,EAAA4wC,GACA,OAAA,MAAA5wC,GAAAA,GAAAA,EAAA4wC,EAAA5wC,GAiwCAw5B,GAAA9zB,OAAAA,GACA8zB,GAAAwoB,SAv7EA,SAAAluB,EAAA9iB,EAAAixC,GACAnuB,EAAAz0B,GAAAy0B,GACA9iB,EAAAi6B,GAAAj6B,GAEA,IAAAtX,EAAAo6B,EAAAp6B,OAKAowC,EAJAmY,EAAAA,IAAAhnD,GACAvB,EACA2iC,GAAAwV,GAAAoQ,GAAA,EAAAvoD,GAIA,OAAA,IADAuoD,GAAAjxC,EAAAtX,SACAo6B,EAAAruB,MAAAw8C,EAAAnY,IAAA94B,GA66EAwoB,GAAA7zB,GAAAA,GACA6zB,GAAAgH,OA/4EA,SAAA1M,GAEA,OADAA,EAAAz0B,GAAAy0B,KACAjW,GAAAvO,KAAAwkB,GACAA,EAAA7lB,QAAAyP,GAAA6V,IACAO,GA44EA0F,GAAA0oB,aA13EA,SAAApuB,GAEA,OADAA,EAAAz0B,GAAAy0B,KACAzV,GAAA/O,KAAAwkB,GACAA,EAAA7lB,QAAAmQ,GAAA,QACA0V,GAu3EA0F,GAAA2oB,MAr5OA,SAAAp8B,EAAAlB,EAAAnX,GACA,IAAAyW,EAAAuV,GAAA3T,GAAAnB,GAAAyc,GAIA,OAHA3zB,GAAAqgC,GAAAhoB,EAAAlB,EAAAnX,KACAmX,EAAA5pB,IAEAkpB,EAAA4B,EAAAgiB,GAAAljB,EAAA,KAi5OA2U,GAAA+c,KAAAA,GACA/c,GAAAqb,UAAAA,GACArb,GAAA4oB,QAnvHA,SAAA37B,EAAA5B,GACA,OAAAiB,GAAAW,EAAAshB,GAAAljB,EAAA,GAAAqc,KAmvHA1H,GAAAgd,SAAAA,GACAhd,GAAAsb,cAAAA,GACAtb,GAAA6oB,YA/sHA,SAAA57B,EAAA5B,GACA,OAAAiB,GAAAW,EAAAshB,GAAAljB,EAAA,GAAAuc,KA+sHA5H,GAAAv6B,MAAAA,GACAu6B,GAAAtmB,QAAAA,GACAsmB,GAAAid,aAAAA,GACAjd,GAAA8oB,MAnrHA,SAAA77B,EAAAjC,GACA,OAAA,MAAAiC,EACAA,EACAob,GAAApb,EAAAshB,GAAAvjB,EAAA,GAAAia,KAirHAjF,GAAA+oB,WAppHA,SAAA97B,EAAAjC,GACA,OAAA,MAAAiC,EACAA,EACAsb,GAAAtb,EAAAshB,GAAAvjB,EAAA,GAAAia,KAkpHAjF,GAAAgpB,OAnnHA,SAAA/7B,EAAAjC,GACA,OAAAiC,GAAAya,GAAAza,EAAAshB,GAAAvjB,EAAA,KAmnHAgV,GAAAipB,YAtlHA,SAAAh8B,EAAAjC,GACA,OAAAiC,GAAA2a,GAAA3a,EAAAshB,GAAAvjB,EAAA,KAslHAgV,GAAA/iB,IAAAA,GACA+iB,GAAAtzB,GAAAA,GACAszB,GAAApzB,IAAAA,GACAozB,GAAArS,IAv+GA,SAAAV,EAAA0b,GACA,OAAA,MAAA1b,GAAA4sB,GAAA5sB,EAAA0b,EAAAa,KAu+GAxJ,GAAAwN,MAAAA,GACAxN,GAAAub,KAAAA,GACAvb,GAAAwM,SAAAA,GACAxM,GAAAyG,SAznOA,SAAAla,EAAA/lB,EAAAkmB,EAAAxY,GACAqY,EAAA4gB,GAAA5gB,GAAAA,EAAAT,GAAAS,GACAG,EAAAA,IAAAxY,EAAAmkC,GAAA3rB,GAAA,EAEA,IAAAxsB,EAAAqsB,EAAArsB,OAIA,OAHAwsB,EAAA,IACAA,EAAAgS,EAAAx+B,EAAAwsB,EAAA,IAEAszB,GAAAzzB,GACAG,GAAAxsB,IAAA,EAAAqsB,EAAAriB,QAAA1D,EAAAkmB,KACAxsB,IAAA,EAAAurB,GAAAc,EAAA/lB,EAAAkmB,IAgnOAsT,GAAA91B,QAvjSA,SAAA4gB,EAAAtkB,EAAAkmB,GACA,IAAAxsB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,IAAAA,EACA,OAAA,EAEA,IAAAyZ,EAAA,MAAA+S,EAAA,EAAA2rB,GAAA3rB,GAIA,OAHA/S,EAAA,IACAA,EAAA+kB,EAAAx+B,EAAAyZ,EAAA,IAEA8R,GAAAX,EAAAtkB,EAAAmT,IA+iSAqmB,GAAAkpB,QAhoFA,SAAAplB,EAAA6L,EAAAW,GASA,OARAX,EAAAiI,GAAAjI,GACAW,IAAA7uC,IACA6uC,EAAAX,EACAA,EAAA,GAEAW,EAAAsH,GAAAtH,GAtqVA,SAAAxM,EAAA6L,EAAAW,GACA,OAAAxM,GAAAnF,EAAAgR,EAAAW,IAAAxM,EAAApF,EAAAiR,EAAAW,GAwqVA6Y,CADArlB,EAAAtyB,GAAAsyB,GACA6L,EAAAW,IAwnFAtQ,GAAAghB,OAAAA,GACAhhB,GAAAmC,YAAAA,GACAnC,GAAAE,QAAAA,GACAF,GAAAhW,cAAAA,GACAgW,GAAAmN,YAAAA,GACAnN,GAAA+N,kBAAAA,GACA/N,GAAAopB,UApuKA,SAAA5iD,GACA,OAAA,IAAAA,IAAA,IAAAA,GACAy5B,GAAAz5B,IAAAyiC,GAAAziC,IAAA6b,IAmuKA2d,GAAA1B,SAAAA,GACA0B,GAAA9V,OAAAA,GACA8V,GAAAqpB,UA3qKA,SAAA7iD,GACA,OAAAy5B,GAAAz5B,IAAA,IAAAA,EAAA+iB,WAAAykB,GAAAxnC,IA2qKAw5B,GAAAspB,QAvoKA,SAAA9iD,GACA,GAAA,MAAAA,EACA,OAAA,EAEA,GAAA2mC,GAAA3mC,KACA05B,GAAA15B,IAAA,iBAAAA,GAAA,mBAAAA,EAAA62B,QACAiB,GAAA93B,IAAAkkB,GAAAlkB,IAAA27B,GAAA37B,IACA,OAAAA,EAAAtG,OAEA,IAAAwkC,EAAAC,GAAAn+B,GACA,GAAAk+B,GAAAhiB,IAAAgiB,GAAA3hB,GACA,OAAAvc,EAAAi0B,KAEA,GAAAoS,GAAArmC,GACA,OAAAomC,GAAApmC,GAAAtG,OAEA,IAAA,IAAAwX,KAAAlR,EACA,GAAAsQ,EAAA7W,KAAAuG,EAAAkR,GACA,OAAA,EAGA,OAAA,GAmnKAsoB,GAAAupB,QAplKA,SAAA/iD,EAAA+iC,GACA,OAAAc,GAAA7jC,EAAA+iC,IAolKAvJ,GAAAwpB,YAjjKA,SAAAhjD,EAAA+iC,EAAApF,GAEA,IAAA/qB,GADA+qB,EAAA,mBAAAA,EAAAA,EAAA1iC,IACA0iC,EAAA39B,EAAA+iC,GAAA9nC,GACA,OAAA2X,IAAA3X,GAAA4oC,GAAA7jC,EAAA+iC,EAAA9nC,GAAA0iC,KAAA/qB,GA+iKA4mB,GAAA8f,QAAAA,GACA9f,GAAAr+B,SAx/JA,SAAA6E,GACA,MAAA,iBAAAA,GAAA+3B,EAAA/3B,IAw/JAw5B,GAAAyI,WAAAA,GACAzI,GAAA1xB,UAAAA,GACA0xB,GAAA+Z,SAAAA,GACA/Z,GAAA5V,MAAAA,GACA4V,GAAAypB,QAxzJA,SAAAx8B,EAAAxV,GACA,OAAAwV,IAAAxV,GAAAu0B,GAAA/e,EAAAxV,EAAA21B,GAAA31B,KAwzJAuoB,GAAA0pB,YArxJA,SAAAz8B,EAAAxV,EAAA0sB,GAEA,OADAA,EAAA,mBAAAA,EAAAA,EAAA1iC,GACAuqC,GAAA/e,EAAAxV,EAAA21B,GAAA31B,GAAA0sB,IAoxJAnE,GAAA99B,MArvJA,SAAAsE,GAIA,OAAAu5C,GAAAv5C,IAAAA,IAAAA,GAkvJAw5B,GAAA2pB,SArtJA,SAAAnjD,GACA,GAAA0zC,GAAA1zC,GACA,MAAA,IAAA3G,EAnoXA,mEAqoXA,OAAAwsC,GAAA7lC,IAktJAw5B,GAAA4pB,MAtqJA,SAAApjD,GACA,OAAA,MAAAA,GAsqJAw5B,GAAA6pB,OA/rJA,SAAArjD,GACA,OAAA,OAAAA,GA+rJAw5B,GAAA+f,SAAAA,GACA/f,GAAAQ,SAAAA,GACAR,GAAAC,aAAAA,GACAD,GAAAgO,cAAAA,GACAhO,GAAA1V,SAAAA,GACA0V,GAAA8pB,cAnjJA,SAAAtjD,GACA,OAAA8H,GAAA9H,KAAAub,IAAAvb,GAAAA,GAAAub,IAmjJAie,GAAAxV,MAAAA,GACAwV,GAAAggB,SAAAA,GACAhgB,GAAA+H,SAAAA,GACA/H,GAAAtV,aAAAA,GACAsV,GAAA+pB,YAj9IA,SAAAvjD,GACA,OAAAA,IAAA/E,IAi9IAu+B,GAAAgqB,UA77IA,SAAAxjD,GACA,OAAAy5B,GAAAz5B,IAAAm+B,GAAAn+B,IAAA0c,IA67IA8c,GAAAiqB,UAz6IA,SAAAzjD,GACA,OAAAy5B,GAAAz5B,IAj2XA,oBAi2XAyiC,GAAAziC,IAy6IAw5B,GAAAlY,KAl9RA,SAAAgD,EAAA27B,GACA,OAAA,MAAA37B,EAAA,GAAA0T,EAAAv+B,KAAA6qB,EAAA27B,IAk9RAzmB,GAAA4hB,UAAAA,GACA5hB,GAAAmK,KAAAA,GACAnK,GAAAkqB,YAz6RA,SAAAp/B,EAAAtkB,EAAAkmB,GACA,IAAAxsB,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,IAAAA,EACA,OAAA,EAEA,IAAAyZ,EAAAzZ,EAKA,OAJAwsB,IAAAjrB,KAEAkY,GADAA,EAAA0+B,GAAA3rB,IACA,EAAAgS,EAAAx+B,EAAAyZ,EAAA,GAAAglB,EAAAhlB,EAAAzZ,EAAA,IAEAsG,GAAAA,EAltMA,SAAAskB,EAAAtkB,EAAAkmB,GAEA,IADA,IAAA/S,EAAA+S,EAAA,EACA/S,KACA,GAAAmR,EAAAnR,KAAAnT,EACA,OAAAmT,EAGA,OAAAA,EA4sMAwwC,CAAAr/B,EAAAtkB,EAAAmT,GACA8S,GAAA3B,EAAA+B,GAAAlT,GAAA,IA85RAqmB,GAAA6hB,UAAAA,GACA7hB,GAAA8hB,WAAAA,GACA9hB,GAAApxB,GAAAA,GACAoxB,GAAApyB,IAAAA,GACAoyB,GAAA32B,IAhfA,SAAAyhB,GACA,OAAAA,GAAAA,EAAA5qB,OACA4nC,GAAAhd,EAAA0hB,GAAAlD,IACA7nC,IA8eAu+B,GAAAoqB,MApdA,SAAAt/B,EAAAE,GACA,OAAAF,GAAAA,EAAA5qB,OACA4nC,GAAAhd,EAAAyjB,GAAAvjB,EAAA,GAAAse,IACA7nC,IAkdAu+B,GAAAqqB,KAjcA,SAAAv/B,GACA,OAAAiC,GAAAjC,EAAA0hB,KAicAxM,GAAAsqB,OAvaA,SAAAx/B,EAAAE,GACA,OAAA+B,GAAAjC,EAAAyjB,GAAAvjB,EAAA,KAuaAgV,GAAA52B,IAlZA,SAAA0hB,GACA,OAAAA,GAAAA,EAAA5qB,OACA4nC,GAAAhd,EAAA0hB,GAAAS,IACAxrC,IAgZAu+B,GAAAuqB,MAtXA,SAAAz/B,EAAAE,GACA,OAAAF,GAAAA,EAAA5qB,OACA4nC,GAAAhd,EAAAyjB,GAAAvjB,EAAA,GAAAiiB,IACAxrC,IAoXAu+B,GAAA4Z,UAAAA,GACA5Z,GAAAma,UAAAA,GACAna,GAAAwqB,WAztBA,WACA,MAAA,IAytBAxqB,GAAAyqB,WAzsBA,WACA,MAAA,IAysBAzqB,GAAA0qB,SAzrBA,WACA,OAAA,GAyrBA1qB,GAAAujB,SAAAA,GACAvjB,GAAA2qB,IAt5RA,SAAA7/B,EAAAzrB,GACA,OAAAyrB,GAAAA,EAAA5qB,OAAAiuC,GAAArjB,EAAAutB,GAAAh5C,IAAAoC,IAs5RAu+B,GAAAp5B,WAvhCA,WAIA,OAHAvG,GAAA+X,IAAAhW,OACA/B,GAAA+X,EAAAukB,GAEAv6B,MAohCA49B,GAAAuY,KAAAA,GACAvY,GAAAlC,IAAAA,GACAkC,GAAA4qB,IA/2EA,SAAAtwB,EAAAp6B,EAAAs3C,GACAld,EAAAz0B,GAAAy0B,GAGA,IAAAuwB,GAFA3qD,EAAAm4C,GAAAn4C,IAEA66B,GAAAT,GAAA,EACA,IAAAp6B,GAAAA,GAAA2qD,EACA,OAAAvwB,EAEA,IAAAsW,GAAA1wC,EAAA2qD,GAAA,EACA,OACAtT,GAAArZ,EAAA0S,GAAA4G,GACAld,EACAid,GAAAtZ,EAAA2S,GAAA4G,IAo2EAxX,GAAA8qB,OAz0EA,SAAAxwB,EAAAp6B,EAAAs3C,GACAld,EAAAz0B,GAAAy0B,GAGA,IAAAuwB,GAFA3qD,EAAAm4C,GAAAn4C,IAEA66B,GAAAT,GAAA,EACA,OAAAp6B,GAAA2qD,EAAA3qD,EACAo6B,EAAAid,GAAAr3C,EAAA2qD,EAAArT,GACAld,GAm0EA0F,GAAA+qB,SAzyEA,SAAAzwB,EAAAp6B,EAAAs3C,GACAld,EAAAz0B,GAAAy0B,GAGA,IAAAuwB,GAFA3qD,EAAAm4C,GAAAn4C,IAEA66B,GAAAT,GAAA,EACA,OAAAp6B,GAAA2qD,EAAA3qD,EACAq3C,GAAAr3C,EAAA2qD,EAAArT,GAAAld,EACAA,GAmyEA0F,GAAA7lB,SAxwEA,SAAAmgB,EAAA0wB,EAAA92C,GAMA,OALAA,GAAA,MAAA82C,EACAA,EAAA,EACAA,IACAA,GAAAA,GAEAnsB,EAAAh5B,GAAAy0B,GAAA7lB,QAAAsQ,GAAA,IAAAimC,GAAA,IAmwEAhrB,GAAArqB,OAxpFA,SAAAouB,EAAAC,EAAAinB,GA2BA,GA1BAA,GAAA,kBAAAA,GAAA1W,GAAAxQ,EAAAC,EAAAinB,KACAjnB,EAAAinB,EAAAxpD,IAEAwpD,IAAAxpD,KACA,kBAAAuiC,GACAinB,EAAAjnB,EACAA,EAAAviC,IAEA,kBAAAsiC,IACAknB,EAAAlnB,EACAA,EAAAtiC,KAGAsiC,IAAAtiC,IAAAuiC,IAAAviC,IACAsiC,EAAA,EACAC,EAAA,IAGAD,EAAA6T,GAAA7T,GACAC,IAAAviC,IACAuiC,EAAAD,EACAA,EAAA,GAEAC,EAAA4T,GAAA5T,IAGAA,EAAAD,EAAA,CACA,IAAA/+B,EAAA++B,EACAA,EAAAC,EACAA,EAAAh/B,EAEA,GAAAimD,GAAAlnB,EAAA,GAAAC,EAAA,EAAA,CACA,IAAA8W,EAAAhc,IACA,OAAAH,EAAAoF,EAAA+W,GAAA9W,EAAAD,EAAA/a,GAAA,QAAA8xB,EAAA,IAAA56C,OAAA,KAAA8jC,GAEA,OAAAvB,GAAAsB,EAAAC,IAqnFAhE,GAAAkrB,OAz8NA,SAAA3+B,EAAAvB,EAAAC,GACA,IAAAN,EAAAuV,GAAA3T,GAAAP,GAAAmB,GACAlB,EAAA1W,UAAArV,OAAA,EAEA,OAAAyqB,EAAA4B,EAAAgiB,GAAAvjB,EAAA,GAAAC,EAAAgB,EAAAoX,KAs8NArD,GAAAmrB,YA76NA,SAAA5+B,EAAAvB,EAAAC,GACA,IAAAN,EAAAuV,GAAA3T,GAAAL,GAAAiB,GACAlB,EAAA1W,UAAArV,OAAA,EAEA,OAAAyqB,EAAA4B,EAAAgiB,GAAAvjB,EAAA,GAAAC,EAAAgB,EAAA0b,KA06NA3H,GAAAorB,OA7uEA,SAAA9wB,EAAAj7B,EAAA6U,GAMA,OAJA7U,GADA6U,EAAAqgC,GAAAja,EAAAj7B,EAAA6U,GAAA7U,IAAAoC,IACA,EAEA42C,GAAAh5C,GAEAowC,GAAA5pC,GAAAy0B,GAAAj7B,IAwuEA2gC,GAAAvrB,QAltEA,WACA,IAAAT,EAAAuB,UACA+kB,EAAAz0B,GAAAmO,EAAA,IAEA,OAAAA,EAAA9T,OAAA,EAAAo6B,EAAAA,EAAA7lB,QAAAT,EAAA,GAAAA,EAAA,KA+sEAgsB,GAAA5mB,OApmGA,SAAA6T,EAAA0b,EAAAyO,GAGA,IAAAz9B,GAAA,EACAzZ,GAHAyoC,EAAAC,GAAAD,EAAA1b,IAGA/sB,OAOA,IAJAA,IACAA,EAAA,EACA+sB,EAAAxrB,MAEAkY,EAAAzZ,GAAA,CACA,IAAAsG,EAAA,MAAAymB,EAAAxrB,GAAAwrB,EAAA4b,GAAAF,EAAAhvB,KACAnT,IAAA/E,KACAkY,EAAAzZ,EACAsG,EAAA4wC,GAEAnqB,EAAAwb,GAAAjiC,GAAAA,EAAAvG,KAAAgtB,GAAAzmB,EAEA,OAAAymB,GAklGA+S,GAAAt6B,MAAAA,GACAs6B,GAAArE,aAAAA,EACAqE,GAAAqrB,OAv3NA,SAAA9+B,GAEA,OADA2T,GAAA3T,GAAAiW,GAAAsN,IACAvjB,IAs3NAyT,GAAAvF,KA5yNA,SAAAlO,GACA,GAAA,MAAAA,EACA,OAAA,EAEA,GAAA4gB,GAAA5gB,GACA,OAAAyzB,GAAAzzB,GAAAwO,GAAAxO,GAAAA,EAAArsB,OAEA,IAAAwkC,EAAAC,GAAApY,GACA,OAAAmY,GAAAhiB,IAAAgiB,GAAA3hB,GACAwJ,EAAAkO,KAEAmS,GAAArgB,GAAArsB,QAkyNA8/B,GAAA+hB,UAAAA,GACA/hB,GAAAsrB,KA5vNA,SAAA/+B,EAAAlB,EAAAnX,GACA,IAAAyW,EAAAuV,GAAA3T,GAAAJ,GAAAokB,GAIA,OAHAr8B,GAAAqgC,GAAAhoB,EAAAlB,EAAAnX,KACAmX,EAAA5pB,IAEAkpB,EAAA4B,EAAAgiB,GAAAljB,EAAA,KAwvNA2U,GAAAurB,YAzpRA,SAAAzgC,EAAAtkB,GACA,OAAAgqC,GAAA1lB,EAAAtkB,IAypRAw5B,GAAAwrB,cA7nRA,SAAA1gC,EAAAtkB,EAAAwkB,GACA,OAAA6lB,GAAA/lB,EAAAtkB,EAAA+nC,GAAAvjB,EAAA,KA6nRAgV,GAAAyrB,cA1mRA,SAAA3gC,EAAAtkB,GACA,IAAAtG,EAAA,MAAA4qB,EAAA,EAAAA,EAAA5qB,OACA,GAAAA,EAAA,CACA,IAAAyZ,EAAA62B,GAAA1lB,EAAAtkB,GACA,GAAAmT,EAAAzZ,GAAAiM,GAAA2e,EAAAnR,GAAAnT,GACA,OAAAmT,EAGA,OAAA,GAmmRAqmB,GAAA0rB,gBA9kRA,SAAA5gC,EAAAtkB,GACA,OAAAgqC,GAAA1lB,EAAAtkB,GAAA,IA8kRAw5B,GAAA2rB,kBAljRA,SAAA7gC,EAAAtkB,EAAAwkB,GACA,OAAA6lB,GAAA/lB,EAAAtkB,EAAA+nC,GAAAvjB,EAAA,IAAA,IAkjRAgV,GAAA4rB,kBA/hRA,SAAA9gC,EAAAtkB,GAEA,GADA,MAAAskB,GAAAA,EAAA5qB,OACA,CACA,IAAAyZ,EAAA62B,GAAA1lB,EAAAtkB,GAAA,GAAA,EACA,GAAA2F,GAAA2e,EAAAnR,GAAAnT,GACA,OAAAmT,EAGA,OAAA,GAwhRAqmB,GAAAgiB,UAAAA,GACAhiB,GAAA6rB,WAzmEA,SAAAvxB,EAAA9iB,EAAAixC,GAOA,OANAnuB,EAAAz0B,GAAAy0B,GACAmuB,EAAA,MAAAA,EACA,EACA5lB,GAAAwV,GAAAoQ,GAAA,EAAAnuB,EAAAp6B,QAEAsX,EAAAi6B,GAAAj6B,GACA8iB,EAAAruB,MAAAw8C,EAAAA,EAAAjxC,EAAAtX,SAAAsX,GAmmEAwoB,GAAAztB,SAAAA,GACAytB,GAAA7rB,IAzUA,SAAA2W,GACA,OAAAA,GAAAA,EAAA5qB,OACA8sB,GAAAlC,EAAA0hB,IACA,GAuUAxM,GAAA8rB,MA7SA,SAAAhhC,EAAAE,GACA,OAAAF,GAAAA,EAAA5qB,OACA8sB,GAAAlC,EAAAyjB,GAAAvjB,EAAA,IACA,GA2SAgV,GAAA+rB,SA3/DA,SAAAzxB,EAAAsjB,EAAA1pC,GAIA,IAAA83C,EAAAhsB,GAAA+G,iBAEA7yB,GAAAqgC,GAAAja,EAAAsjB,EAAA1pC,KACA0pC,EAAAn8C,IAEA64B,EAAAz0B,GAAAy0B,GACAsjB,EAAA2C,GAAA,GAAA3C,EAAAoO,EAAA7S,IAEA,IAIA8S,EACAC,EALA9kB,EAAAmZ,GAAA,GAAA3C,EAAAxW,QAAA4kB,EAAA5kB,QAAA+R,IACAgT,EAAA5yC,GAAA6tB,GACAglB,EAAA7+B,GAAA6Z,EAAA+kB,GAIAxyC,EAAA,EACAutB,EAAA0W,EAAA1W,aAAAphB,GACArO,EAAA,WAGA40C,EAAAjoC,GACAw5B,EAAA5W,QAAAlhB,IAAArO,OAAA,IACAyvB,EAAAzvB,OAAA,KACAyvB,IAAA1iB,GAAAc,GAAAQ,IAAArO,OAAA,KACAmmC,EAAA3W,UAAAnhB,IAAArO,OAAA,KACA,KAGA60C,EAAA,kBACA,cAAA1O,EACAA,EAAA0O,UACA,6BAAA9jC,GAAA,KACA,KAEA8R,EAAA7lB,QAAA43C,EAAA,SAAAtqD,EAAAwqD,EAAAC,EAAAC,EAAAC,EAAA3gC,GAsBA,OArBAygC,IAAAA,EAAAC,GAGAh1C,GAAA6iB,EAAAruB,MAAA0N,EAAAoS,GAAAtX,QAAAsR,GAAAoU,IAGAoyB,IACAN,GAAA,EACAx0C,GAAA,YAAA80C,EAAA,UAEAG,IACAR,GAAA,EACAz0C,GAAA,OAAAi1C,EAAA,eAEAF,IACA/0C,GAAA,iBAAA+0C,EAAA,+BAEA7yC,EAAAoS,EAAAhqB,EAAA7B,OAIA6B,IAGA0V,GAAA,OAIA,IAAA0vB,EAAAyW,EAAAzW,SACAA,IACA1vB,EAAA,iBAAAA,EAAA,SAGAA,GAAAy0C,EAAAz0C,EAAAhD,QAAAqP,GAAA,IAAArM,GACAhD,QAAAsP,GAAA,MACAtP,QAAAuP,GAAA,OAGAvM,EAAA,aAAA0vB,GAAA,OAAA,SACAA,EACA,GACA,wBAEA,qBACA8kB,EACA,mBACA,KAEAC,EACA,uFAEA,OAEAz0C,EACA,gBAEA,IAAA2B,EAAAmpC,GAAA,WACA,OAAAl5B,EAAA8iC,EAAAG,EAAA,UAAA70C,GACAqC,MAAArY,GAAA2qD,KAMA,GADAhzC,EAAA3B,OAAAA,EACAqoC,GAAA1mC,GACA,MAAAA,EAEA,OAAAA,GAm5DA4mB,GAAAz0B,MApsBA,SAAAlM,EAAA2rB,GAEA,IADA3rB,EAAAg5C,GAAAh5C,IACA,GAAA0iB,GAAA1iB,EACA,MAAA,GAEA,IAAAsa,EAAAsI,GACA/hB,EAAAy+B,EAAAt/B,EAAA4iB,IAEA+I,EAAAujB,GAAAvjB,GACA3rB,GAAA4iB,GAGA,IADA,IAAA7I,EAAAiU,GAAAntB,EAAA8qB,KACArR,EAAAta,GACA2rB,EAAArR,GAEA,OAAAP,GAsrBA4mB,GAAA4X,SAAAA,GACA5X,GAAAqY,UAAAA,GACArY,GAAAqgB,SAAAA,GACArgB,GAAA2sB,QA/3DA,SAAAnmD,GACA,OAAAX,GAAAW,GAAAyP,eA+3DA+pB,GAAAxuB,SAAAA,GACAwuB,GAAA4sB,cAlsIA,SAAApmD,GACA,OAAAA,EACAq8B,GAAAwV,GAAA7xC,IAAAub,GAAAA,IACA,IAAAvb,EAAAA,EAAA,GAgsIAw5B,GAAAn6B,SAAAA,GACAm6B,GAAA6sB,QA12DA,SAAArmD,GACA,OAAAX,GAAAW,GAAA07C,eA02DAliB,GAAA8sB,KAj1DA,SAAAxyB,EAAAkd,EAAAtjC,GAEA,IADAomB,EAAAz0B,GAAAy0B,MACApmB,GAAAsjC,IAAA/1C,IACA,OAAA64B,EAAA7lB,QAAAqQ,GAAA,IAEA,IAAAwV,KAAAkd,EAAA/F,GAAA+F,IACA,OAAAld,EAEA,IAAAzM,EAAAqN,GAAAZ,GACAxM,EAAAoN,GAAAsc,GAIA,OAAA5E,GAAA/kB,EAHAD,GAAAC,EAAAC,GACAC,GAAAF,EAAAC,GAAA,GAEAhG,KAAA,KAq0DAkY,GAAA+sB,QA/yDA,SAAAzyB,EAAAkd,EAAAtjC,GAEA,IADAomB,EAAAz0B,GAAAy0B,MACApmB,GAAAsjC,IAAA/1C,IACA,OAAA64B,EAAA7lB,QAAAuQ,GAAA,IAEA,IAAAsV,KAAAkd,EAAA/F,GAAA+F,IACA,OAAAld,EAEA,IAAAzM,EAAAqN,GAAAZ,GAGA,OAAAsY,GAAA/kB,EAAA,EAFAE,GAAAF,EAAAqN,GAAAsc,IAAA,GAEA1vB,KAAA,KAqyDAkY,GAAAgtB,UA/wDA,SAAA1yB,EAAAkd,EAAAtjC,GAEA,IADAomB,EAAAz0B,GAAAy0B,MACApmB,GAAAsjC,IAAA/1C,IACA,OAAA64B,EAAA7lB,QAAAsQ,GAAA,IAEA,IAAAuV,KAAAkd,EAAA/F,GAAA+F,IACA,OAAAld,EAEA,IAAAzM,EAAAqN,GAAAZ,GAGA,OAAAsY,GAAA/kB,EAFAD,GAAAC,EAAAqN,GAAAsc,KAEA1vB,KAAA,KAqwDAkY,GAAAnsB,SA7tDA,SAAAymB,EAAAsjB,GACA,IAAA19C,EAxqdA,GAyqdA+sD,EAxqdA,MA0qdA,GAAAzsB,GAAAod,GAAA,CACA,IAAA6I,EAAA,cAAA7I,EAAAA,EAAA6I,UAAAA,EACAvmD,EAAA,WAAA09C,EAAAvF,GAAAuF,EAAA19C,QAAAA,EACA+sD,EAAA,aAAArP,EAAAnM,GAAAmM,EAAAqP,UAAAA,EAIA,IAAApC,GAFAvwB,EAAAz0B,GAAAy0B,IAEAp6B,OACA,GAAAm6B,GAAAC,GAAA,CACA,IAAAzM,EAAAqN,GAAAZ,GACAuwB,EAAAh9B,EAAA3tB,OAEA,GAAA2qD,GAAA3qD,EACA,OAAAo6B,EAEA,IAAAgW,EAAApwC,EAAA66B,GAAAkyB,GACA,GAAA3c,EAAA,EACA,OAAA2c,EAEA,IAAA7zC,EAAAyU,EACA+kB,GAAA/kB,EAAA,EAAAyiB,GAAAxoB,KAAA,IACAwS,EAAAruB,MAAA,EAAAqkC,GAEA,GAAAmW,IAAAhlD,GACA,OAAA2X,EAAA6zC,EAKA,GAHAp/B,IACAyiB,GAAAl3B,EAAAlZ,OAAAowC,GAEAhmB,GAAAm8B,IACA,GAAAnsB,EAAAruB,MAAAqkC,GAAA57B,OAAA+xC,GAAA,CACA,IAAA1kD,EACA4S,EAAAyE,EAMA,IAJAqtC,EAAAt9B,SACAs9B,EAAAriC,EAAAqiC,EAAAhvC,OAAA5R,GAAA0f,GAAAgX,KAAAkqB,IAAA,MAEAA,EAAAzrB,UAAA,EACAj5B,EAAA0kD,EAAAlqB,KAAA5nB,IACA,IAAAu4C,EAAAnrD,EAAA4X,MAEAP,EAAAA,EAAAnN,MAAA,EAAAihD,IAAAzrD,GAAA6uC,EAAA4c,SAEA,GAAA5yB,EAAApwB,QAAAunC,GAAAgV,GAAAnW,IAAAA,EAAA,CACA,IAAA32B,EAAAP,EAAA8wC,YAAAzD,IACA,EAAA9sC,IACAP,EAAAA,EAAAnN,MAAA,EAAA0N,IAGA,OAAAP,EAAA6zC,GAyqDAjtB,GAAAmtB,SAnpDA,SAAA7yB,GAEA,OADAA,EAAAz0B,GAAAy0B,KACAnW,GAAArO,KAAAwkB,GACAA,EAAA7lB,QAAAwP,GAAAoX,IACAf,GAgpDA0F,GAAAotB,SAvpBA,SAAAC,GACA,IAAAxa,IAAAxW,EACA,OAAAx2B,GAAAwnD,GAAAxa,GAspBA7S,GAAAiiB,UAAAA,GACAjiB,GAAA2hB,WAAAA,GAGA3hB,GAAAstB,KAAA5zC,GACAsmB,GAAAutB,UAAAtQ,GACAjd,GAAAwtB,MAAAjS,GAEAsH,GAAA7iB,IACAvoB,GAAA,GACAiwB,GAAA1H,GAAA,SAAArV,EAAA5L,GACAjI,EAAA7W,KAAA+/B,GAAA39B,UAAA0c,KACAtH,GAAAsH,GAAA4L,KAGAlT,IACA,CAAAklC,OAAA,IAWA3c,GAAAytB,QA18gBA,UA68gBAviC,GAAA,CAAA,OAAA,UAAA,QAAA,aAAA,UAAA,gBAAA,SAAAnM,GACAihB,GAAAjhB,GAAA8b,YAAAmF,KAIA9U,GAAA,CAAA,OAAA,QAAA,SAAAnM,EAAApF,GACAwmB,GAAA99B,UAAA0c,GAAA,SAAA1f,GACAA,EAAAA,IAAAoC,GAAA,EAAAi9B,EAAA2Z,GAAAh5C,GAAA,GAEA,IAAA+Z,EAAAhX,KAAA6+B,eAAAtnB,EACA,IAAAwmB,GAAA/9B,MACAA,KAAAwD,QAUA,OARAwT,EAAA6nB,aACA7nB,EAAA+nB,cAAAxC,EAAAt/B,EAAA+Z,EAAA+nB,eAEA/nB,EAAAgoB,UAAA5xB,KAAA,CACAirB,KAAAkE,EAAAt/B,EAAA4iB,IACAw3B,KAAA16B,GAAA3F,EAAA4nB,QAAA,EAAA,QAAA,MAGA5nB,GAGA+mB,GAAA99B,UAAA0c,EAAA,SAAA,SAAA1f,GACA,OAAA+C,KAAAgI,UAAA2U,GAAA1f,GAAA+K,aAKA8gB,GAAA,CAAA,SAAA,MAAA,aAAA,SAAAnM,EAAApF,GACA,IAAA8/B,EAAA9/B,EAAA,EACA+zC,EA77gBA,GA67gBAjU,GA37gBA,GA27gBAA,EAEAtZ,GAAA99B,UAAA0c,GAAA,SAAAiM,GACA,IAAA5R,EAAAhX,KAAAwD,QAMA,OALAwT,EAAA8nB,cAAA1xB,KAAA,CACAwb,SAAAujB,GAAAvjB,EAAA,GACAyuB,KAAAA,IAEArgC,EAAA6nB,aAAA7nB,EAAA6nB,cAAAysB,EACAt0C,KAKA8R,GAAA,CAAA,OAAA,QAAA,SAAAnM,EAAApF,GACA,IAAAg0C,EAAA,QAAAh0C,EAAA,QAAA,IAEAwmB,GAAA99B,UAAA0c,GAAA,WACA,OAAA3c,KAAAurD,GAAA,GAAAnnD,QAAA,MAKA0kB,GAAA,CAAA,UAAA,QAAA,SAAAnM,EAAApF,GACA,IAAAi0C,EAAA,QAAAj0C,EAAA,GAAA,SAEAwmB,GAAA99B,UAAA0c,GAAA,WACA,OAAA3c,KAAA6+B,aAAA,IAAAd,GAAA/9B,MAAAA,KAAAwrD,GAAA,MAIAztB,GAAA99B,UAAA0hD,QAAA,WACA,OAAA3hD,KAAAwiD,OAAApY,KAGArM,GAAA99B,UAAA06C,KAAA,SAAA1xB,GACA,OAAAjpB,KAAAwiD,OAAAv5B,GAAAkwB,QAGApb,GAAA99B,UAAA26C,SAAA,SAAA3xB,GACA,OAAAjpB,KAAAgI,UAAA2yC,KAAA1xB,IAGA8U,GAAA99B,UAAA86C,UAAAzN,GAAA,SAAA/G,EAAA30B,GACA,MAAA,mBAAA20B,EACA,IAAAxI,GAAA/9B,MAEAA,KAAAo4B,IAAA,SAAAh0B,GACA,OAAAyjC,GAAAzjC,EAAAmiC,EAAA30B,OAIAmsB,GAAA99B,UAAAga,OAAA,SAAAgP,GACA,OAAAjpB,KAAAwiD,OAAArF,GAAAhR,GAAAljB,MAGA8U,GAAA99B,UAAA4J,MAAA,SAAA0jC,EAAAW,GACAX,EAAA0I,GAAA1I,GAEA,IAAAv2B,EAAAhX,KACA,OAAAgX,EAAA6nB,eAAA,EAAA0O,GAAAW,EAAA,GACA,IAAAnQ,GAAA/mB,IAEAu2B,EAAA,EACAv2B,EAAAA,EAAAytC,WAAAlX,GACAA,IACAv2B,EAAAA,EAAAkrC,KAAA3U,IAEAW,IAAA7uC,KAEA2X,GADAk3B,EAAA+H,GAAA/H,IACA,EAAAl3B,EAAAmrC,WAAAjU,GAAAl3B,EAAAwtC,KAAAtW,EAAAX,IAEAv2B,IAGA+mB,GAAA99B,UAAAykD,eAAA,SAAAz7B,GACA,OAAAjpB,KAAAgI,UAAA28C,UAAA17B,GAAAjhB,WAGA+1B,GAAA99B,UAAAmd,QAAA,WACA,OAAApd,KAAAwkD,KAAA3kC,KAIAylB,GAAAvH,GAAA99B,UAAA,SAAAsoB,EAAA5L,GACA,IAAA8uC,EAAA,qCAAA/3C,KAAAiJ,GACA+uC,EAAA,kBAAAh4C,KAAAiJ,GACAgvC,EAAA/tB,GAAA8tB,EAAA,QAAA,QAAA/uC,EAAA,QAAA,IAAAA,GACAivC,EAAAF,GAAA,QAAAh4C,KAAAiJ,GAEAgvC,IAGA/tB,GAAA39B,UAAA0c,GAAA,WACA,IAAAvY,EAAApE,KAAAu+B,YACA3sB,EAAA85C,EAAA,CAAA,GAAAv4C,UACA04C,EAAAznD,aAAA25B,GACAnV,EAAAhX,EAAA,GACAk6C,EAAAD,GAAA/tB,GAAA15B,GAEAo2C,EAAA,SAAAp2C,GACA,IAAA4S,EAAA20C,EAAAj0C,MAAAkmB,GAAAnU,GAAA,CAAArlB,GAAAwN,IACA,OAAA85C,GAAAptB,EAAAtnB,EAAA,GAAAA,GAGA80C,GAAAL,GAAA,mBAAA7iC,GAAA,GAAAA,EAAA9qB,SAEA+tD,EAAAC,GAAA,GAEA,IAAAxtB,EAAAt+B,KAAAy+B,UACAstB,IAAA/rD,KAAAw+B,YAAA1gC,OACAkuD,EAAAJ,IAAAttB,EACA2tB,EAAAJ,IAAAE,EAEA,GAAAH,IAAAE,EAMA,OAAAE,GAAAC,EACA1jC,EAAA7Q,MAAA1X,KAAA4R,IAEAoF,EAAAhX,KAAAkzC,KAAAsH,GACAwR,EAAAN,EAAA10C,EAAA5S,QAAA,GAAA4S,EAAA5S,QAAA4S,GATA5S,EAAA6nD,EAAA7nD,EAAA,IAAA25B,GAAA/9B,MACA,IAAAgX,EAAAuR,EAAA7Q,MAAAtT,EAAAwN,GAEA,OADAoF,EAAAwnB,YAAApxB,KAAA,CAAAmb,KAAA2qB,GAAAthC,KAAA,CAAA4oC,GAAAhyB,QAAAnpB,KACA,IAAA2+B,GAAAhnB,EAAAsnB,OAWAxV,GAAA,CAAA,MAAA,OAAA,QAAA,OAAA,SAAA,WAAA,SAAAnM,GACA,IAAA4L,EAAAqR,EAAAjd,GACAuvC,EAAA,0BAAAx4C,KAAAiJ,GAAA,MAAA,OACAivC,EAAA,kBAAAl4C,KAAAiJ,GAEAihB,GAAA39B,UAAA0c,GAAA,WACA,IAAA/K,EAAAuB,UACA,IAAAy4C,GAAA5rD,KAAAy+B,UAIA,OAAAz+B,KAAAksD,GAAA,SAAA9nD,GACA,OAAAmkB,EAAA7Q,MAAAomB,GAAA15B,GAAAA,EAAA,GAAAwN,KAJA,IAAAxN,EAAApE,KAAAoE,QACA,OAAAmkB,EAAA7Q,MAAAomB,GAAA15B,GAAAA,EAAA,GAAAwN,MASA0zB,GAAAvH,GAAA99B,UAAA,SAAAsoB,EAAA5L,GACA,IAAAgvC,EAAA/tB,GAAAjhB,GACA,GAAAgvC,EAAA,CACA,IAAAr2C,EAAAq2C,EAAAplD,KAAA,IACA22B,GAAA5nB,KAAA4nB,GAAA5nB,GAAA,KAEAlI,KAAA,CAAA7G,KAAAoW,EAAA4L,KAAAojC,OAIAzuB,GAAAsW,GAAAn0C,GA7mhBA,GA6mhBAkH,MAAA,CAAA,CACAA,KAAA,UACAgiB,KAAAlpB,KAIA0+B,GAAA99B,UAAAuD,MAp5dA,WACA,IAAAwT,EAAA,IAAA+mB,GAAA/9B,KAAAu+B,aAOA,OANAvnB,EAAAwnB,YAAAgC,GAAAxgC,KAAAw+B,aACAxnB,EAAA4nB,QAAA5+B,KAAA4+B,QACA5nB,EAAA6nB,aAAA7+B,KAAA6+B,aACA7nB,EAAA8nB,cAAA0B,GAAAxgC,KAAA8+B,eACA9nB,EAAA+nB,cAAA/+B,KAAA++B,cACA/nB,EAAAgoB,UAAAwB,GAAAxgC,KAAAg/B,WACAhoB,GA64dA+mB,GAAA99B,UAAA+H,QAl4dA,WACA,GAAAhI,KAAA6+B,aAAA,CACA,IAAA7nB,EAAA,IAAA+mB,GAAA/9B,MACAgX,EAAA4nB,SAAA,EACA5nB,EAAA6nB,cAAA,OAEA7nB,EAAAhX,KAAAwD,SACAo7B,UAAA,EAEA,OAAA5nB,GA03dA+mB,GAAA99B,UAAAmE,MA/2dA,WACA,IAAAskB,EAAA1oB,KAAAu+B,YAAAn6B,QACA+nD,EAAAnsD,KAAA4+B,QACAiB,EAAA/B,GAAApV,GACA0jC,EAAAD,EAAA,EACA3X,EAAA3U,EAAAnX,EAAA5qB,OAAA,EACAuuD,EA8oIA,SAAA9e,EAAAW,EAAAmP,GAIA,IAHA,IAAA9lC,GAAA,EACAzZ,EAAAu/C,EAAAv/C,SAEAyZ,EAAAzZ,GAAA,CACA,IAAA4hC,EAAA2d,EAAA9lC,GACA8gB,EAAAqH,EAAArH,KAEA,OAAAqH,EAAA2X,MACA,IAAA,OAAA9J,GAAAlV,EAAA,MACA,IAAA,YAAA6V,GAAA7V,EAAA,MACA,IAAA,OAAA6V,EAAA3R,EAAA2R,EAAAX,EAAAlV,GAAA,MACA,IAAA,YAAAkV,EAAAjR,EAAAiR,EAAAW,EAAA7V,IAGA,MAAA,CAAAkV,MAAAA,EAAAW,IAAAA,GA7pIAoe,CAAA,EAAA9X,EAAAx0C,KAAAg/B,WACAuO,EAAA8e,EAAA9e,MACAW,EAAAme,EAAAne,IACApwC,EAAAowC,EAAAX,EACAh2B,EAAA60C,EAAAle,EAAAX,EAAA,EACAtB,EAAAjsC,KAAA8+B,cACAytB,EAAAtgB,EAAAnuC,OACAqrB,EAAA,EACAqjC,EAAAjwB,EAAAz+B,EAAAkC,KAAA++B,eAEA,IAAAc,IAAAusB,GAAA5X,GAAA12C,GAAA0uD,GAAA1uD,EACA,OAAA+xC,GAAAnnB,EAAA1oB,KAAAw+B,aAEA,IAAAxnB,EAAA,GAEAwtB,EACA,KAAA1mC,KAAAqrB,EAAAqjC,GAAA,CAMA,IAHA,IAAAC,GAAA,EACAroD,EAAAskB,EAHAnR,GAAA40C,KAKAM,EAAAF,GAAA,CACA,IAAA7sB,EAAAuM,EAAAwgB,GACA7jC,EAAA8W,EAAA9W,SACAyuB,EAAA3X,EAAA2X,KACA5S,EAAA7b,EAAAxkB,GAEA,GApxDA,GAoxDAizC,EACAjzC,EAAAqgC,OACA,IAAAA,EAAA,CACA,GAxxDA,GAwxDA4S,EACA,SAAA7S,EAEA,MAAAA,GAIAxtB,EAAAmS,KAAA/kB,EAEA,OAAA4S,GAo0dA4mB,GAAA39B,UAAAo+C,GAAA5D,GACA7c,GAAA39B,UAAAs6C,MAlgQA,WACA,OAAAA,GAAAv6C,OAkgQA49B,GAAA39B,UAAAysD,OAr+PA,WACA,OAAA,IAAA1uB,GAAAh+B,KAAAoE,QAAApE,KAAAy+B,YAq+PAb,GAAA39B,UAAA49C,KA58PA,WACA79C,KAAA2+B,aAAAt/B,KACAW,KAAA2+B,WAAAvhB,GAAApd,KAAAoE,UAEA,IAAA05C,EAAA99C,KAAA0+B,WAAA1+B,KAAA2+B,WAAA7gC,OAGA,MAAA,CAAAggD,KAAAA,EAAA15C,MAFA05C,EAAAz+C,GAAAW,KAAA2+B,WAAA3+B,KAAA0+B,eAw8PAd,GAAA39B,UAAAszC,MAr5PA,SAAAnvC,GAIA,IAHA,IAAA4S,EACA8wB,EAAA9nC,KAEA8nC,aAAAzJ,IAAA,CACA,IAAA76B,EAAAy6B,GAAA6J,GACAtkC,EAAAk7B,UAAA,EACAl7B,EAAAm7B,WAAAt/B,GACA2X,EACAm2B,EAAA5O,YAAA/6B,EAEAwT,EAAAxT,EAEA,IAAA2pC,EAAA3pC,EACAskC,EAAAA,EAAAvJ,YAGA,OADA4O,EAAA5O,YAAAn6B,EACA4S,GAq4PA4mB,GAAA39B,UAAA+H,QA92PA,WACA,IAAA5D,EAAApE,KAAAu+B,YACA,GAAAn6B,aAAA25B,GAAA,CACA,IAAA4uB,EAAAvoD,EAUA,OATApE,KAAAw+B,YAAA1gC,SACA6uD,EAAA,IAAA5uB,GAAA/9B,QAEA2sD,EAAAA,EAAA3kD,WACAw2B,YAAApxB,KAAA,CACAmb,KAAA2qB,GACAthC,KAAA,CAAA5J,IACAwgB,QAAAnpB,KAEA,IAAA2+B,GAAA2uB,EAAA3sD,KAAAy+B,WAEA,OAAAz+B,KAAAkzC,KAAAlrC,KAg2PA41B,GAAA39B,UAAA6P,OAAA8tB,GAAA39B,UAAA2D,QAAAg6B,GAAA39B,UAAAmE,MA/0PA,WACA,OAAAyrC,GAAA7vC,KAAAu+B,YAAAv+B,KAAAw+B,cAi1PAZ,GAAA39B,UAAAmrD,MAAAxtB,GAAA39B,UAAAk5C,KAEA/d,IACAwC,GAAA39B,UAAAm7B,GAz7PA,WACA,OAAAp7B,OA07PA49B,GAMArE,GAGA,mBAAAt1B,QAAA,iBAAAA,OAAA0Q,KAAA1Q,OAAA0Q,KAKA1W,GAAA+X,EAAAA,GAIA/R,OAAA,WACA,OAAA+R,MAIAoR,IAEAA,EAAAxpB,QAAAoY,IAAAA,EAAAA,GAEAkR,EAAAlR,EAAAA,IAIA/X,GAAA+X,EAAAA,KAEAnY,KAAAmC,iJC5shBA,SAAA/B,EAAA2uD,GACA,aACA,mBAAA3oD,QAAAA,OAAA0Q,IACA1Q,OAAA2oD,GACA,iBAAA5uD,GAAAA,EAAAJ,QACAI,EAAAJ,QAAAgvD,IAEA3uD,EAAAa,IAAA8tD,IAPA,CASA5sD,KAAA,WACA,aAGA,IAAAm2C,EAAA,aACA0W,EAAA,YAEAC,EAAA,CACA,QACA,QACA,OACA,OACA,SAIA,SAAAC,EAAAn6C,EAAA+J,GACA,IAAArC,EAAA1H,EAAA+J,GACA,GAAA,mBAAArC,EAAA8gC,KACA,OAAA9gC,EAAA8gC,KAAAxoC,GAEA,IACA,OAAAqU,SAAAhnB,UAAAm7C,KAAAv9C,KAAAyc,EAAA1H,GACA,MAAA5V,GAEA,OAAA,WACA,OAAAiqB,SAAAhnB,UAAAyX,MAAAA,MAAA4C,EAAA,CAAA1H,EAAAO,cA0BA,SAAA65C,EAAAC,EAAAC,GAEA,IAAA,IAAA9vD,EAAA,EAAAA,EAAA0vD,EAAAhvD,OAAAV,IAAA,CACA,IAAAuf,EAAAmwC,EAAA1vD,GACA4C,KAAA2c,GAAAvf,EAAA6vD,EACA9W,EACAn2C,KAAAmtD,cAAAxwC,EAAAswC,EAAAC,GAIAltD,KAAAlB,IAAAkB,KAAAotD,MAgBA,SAAAC,EAAA1wC,EAAAswC,EAAAC,GAEA,OA9CA,SAAAvwC,GAKA,MAJA,UAAAA,IACAA,EAAA,cAGA2wC,UAAAT,SAEAxtD,IAAAiuD,QAAA3wC,GACAowC,EAAAO,QAAA3wC,QACAtd,IAAAiuD,QAAAxuD,IACAiuD,EAAAO,QAAA,OAEAnX,GAkCAoX,CAAA5wC,IAbA,SAAAA,EAAAswC,EAAAC,GACA,OAAA,kBACAI,UAAAT,IACAG,EAAAnvD,KAAAmC,KAAAitD,EAAAC,GACAltD,KAAA2c,GAAAjF,MAAA1X,KAAAmT,cAUAuE,MAAA1X,KAAAmT,WAGA,SAAAq6C,EAAAjnD,EAAAknD,EAAAC,GACA,IACAC,EADA34C,EAAAhV,KAEA4tD,EAAA,WAuBA,SAAAC,IACA,IAAAC,EAEA,UAAA74C,SAAA43C,EAAA,CAEA,IACAiB,EAAA74C,OAAA84C,aAAAH,GACA,MAAAI,IAGA,UAAAF,IAAAjB,EACA,IACA,IAAAoB,EAAAh5C,OAAAi5C,SAAAD,OACAE,EAAAF,EAAAnmD,QACAsmD,mBAAAR,GAAA,MACA,IAAAO,IACAL,EAAA,WAAA3zB,KAAA8zB,EAAApkD,MAAAskD,IAAA,IAEA,MAAAH,IAQA,YAJA3uD,IAAA2V,EAAAq5C,OAAAP,KACAA,OAAAzuD,GAGAyuD,GAhDAvnD,IACAqnD,GAAA,IAAArnD,GAwDAyO,EAAAzO,KAAAA,EAEAyO,EAAAq5C,OAAA,CAAAC,MAAA,EAAAC,MAAA,EAAAC,KAAA,EAAAC,KAAA,EACAC,MAAA,EAAAC,OAAA,GAEA35C,EAAAm4C,cAAAO,GAAAL,EAEAr4C,EAAA45C,SAAA,WACA,OAAAjB,GAGA34C,EAAA65C,SAAA,SAAA5B,EAAA6B,GAIA,GAHA,iBAAA7B,QAAA5tD,IAAA2V,EAAAq5C,OAAApB,EAAAnN,iBACAmN,EAAAj4C,EAAAq5C,OAAApB,EAAAnN,kBAEA,iBAAAmN,GAAA,GAAAA,GAAAA,GAAAj4C,EAAAq5C,OAAAM,QAUA,KAAA,6CAAA1B,EAJA,GALAU,EAAAV,GACA,IAAA6B,GAtEA,SAAAC,GACA,IAAAC,GAAAlC,EAAAiC,IAAA,UAAAjP,cAEA,UAAA7qC,SAAA43C,EAAA,CAGA,IAEA,OADA53C,OAAA84C,aAAAH,GAAAoB,EAEA,MAAAhB,IAGA,IACA/4C,OAAAi5C,SAAAD,OACAG,mBAAAR,GAAA,IAAAoB,EAAA,IACA,MAAAhB,MAwDAiB,CAAAhC,GAEAD,EAAAnvD,KAAAmX,EAAAi4C,EAAA1mD,UACA+mD,UAAAT,GAAAI,EAAAj4C,EAAAq5C,OAAAM,OACA,MAAA,oCAOA35C,EAAAk6C,gBAAA,SAAAjC,GACAY,KACA74C,EAAA65C,SAAA5B,GAAA,IAIAj4C,EAAAm6C,UAAA,SAAAL,GACA95C,EAAA65C,SAAA75C,EAAAq5C,OAAAC,MAAAQ,IAGA95C,EAAAo6C,WAAA,SAAAN,GACA95C,EAAA65C,SAAA75C,EAAAq5C,OAAAM,OAAAG,IAIA,IAAAO,EAAAxB,IACA,MAAAwB,IACAA,EAAA,MAAA5B,EAAA,OAAAA,GAEAz4C,EAAA65C,SAAAQ,GAAA,GASA,IAAAC,EAAA,IAAA9B,EAEA+B,EAAA,GACAD,EAAAE,UAAA,SAAAjpD,GACA,GAAA,iBAAAA,GAAA,KAAAA,EACA,MAAA,IAAAozB,UAAA,kDAGA,IAAA81B,EAAAF,EAAAhpD,GAKA,OAJAkpD,IACAA,EAAAF,EAAAhpD,GAAA,IAAAinD,EACAjnD,EAAA+oD,EAAAV,WAAAU,EAAAnC,gBAEAsC,GAIA,IAAAC,SAAAz6C,SAAA43C,EAAA53C,OAAAnW,SAAAO,EAcA,OAbAiwD,EAAA9qD,WAAA,WAMA,cALAyQ,SAAA43C,GACA53C,OAAAnW,MAAAwwD,IACAr6C,OAAAnW,IAAA4wD,GAGAJ,GAGAA,EAAAK,WAAA,WACA,OAAAJ,GAGAD,4BCxPAtxD,EAAAJ,QAAAd,EAAA,gECAA,aAEAA,EAAA,wBAEA,IAAA8yD,EAAA9yD,EAAA,qBAAA8yD,UAEAC,EAAA/yD,EAAA,WAEAgzD,EAAAhzD,EAAA,sBAEAizD,EAAAjzD,EAAA,qBAEAkzD,EAAAlzD,EAAA,qBAgCAc,EAAAm9B,OAAA,SAAAygB,GAEA,GAAA,mBAAAt3C,OAAA62B,OACA,MAAA,IAAAt9B,MAAA,iHAIA,IAAAwyD,EAAA,GACAC,EAAA,GAEAC,EAAAL,EAAArP,MAAA,IACA0P,EAAA9Y,KAAA,GACA8Y,EAAAC,WAAA,CACA73B,UAAA,GACA83B,kBAAA,IAGAF,EAAAG,MAAAT,EAAA90B,OAAAo1B,EAAA9Y,MAEA,IAAAkZ,EAAA,CAGAC,QAAA,MAEAC,OAAA,SAEA/uB,OAAA,SAEA38B,UAAA,GAKA2rD,aAAA,EAGAC,WAAA,MAWA,SAAAC,EAAAlD,GACA,IAAAkC,EAAAlC,GACA,MAAA,IAAAjwD,MAAA,yEAGA,IACAigB,EADAnG,EAAA04C,EAAAnoD,QAAA4lD,GAoBA,OAjBA,IAAAn2C,GAIAmG,GAFA,IAAAgwC,EAAAyC,KAEAzC,EAAAA,QAAAyC,EAAA9Y,KAAAkZ,EAAAK,EAAAT,EAAAG,MAAAH,GAEAzC,EAAAA,QAAAyC,EAAA9Y,KAAAkZ,EAAAK,EAAAT,EAAAG,OAIAL,EAAA7iD,KAAAsgD,GACAwC,EAAA9iD,KAAAsQ,IAGAA,EAAAwyC,EAAA34C,GAGAmG,EAYA,OARAyyC,EAAA,OAAAS,EAAAb,GACAI,EAAA,OAAAS,EAAAZ,GACAG,EAAAC,WAAAC,kBAAA,OAAAF,EAAA,OAEA3U,GACA2U,EAAAx9C,OAAA6oC,GAGA2U,kKChIA,aAEA,IAAAtlC,EAAA/tB,EAAA,sBAiGA,SAAA+zD,EAAArV,EAAAj1C,EAAAmjB,GACA,QAAArqB,IAAAm8C,EAAAj1C,KAzBA,SAAAmiB,EAAAooC,GACA,OAAA,IAAApoC,EAAA5gB,QAAAgpD,GAwBAC,CAAArnC,EAAA8xB,EAAAj1C,IAAA,CACA,IAAAgR,EAfA,SAAAmR,EAAAooC,GACA,OAAApoC,EAAA0P,IAAA,SAAAh7B,GACA,OAAAA,EAAAyW,gBACA/L,QAAAgpD,EAAAj9C,eAYAolC,CAAAvvB,EAAA8xB,EAAAj1C,KAEA,IAAAgR,GAGA+1C,QAAA0D,KAAA,mDAAAzqD,EAAA,iBAAAmjB,EAAAnS,GAAA,iBAAAikC,EAAAj1C,GAAA,MACAi1C,EAAAj1C,GAAAmjB,EAAAnS,IAGA+1C,QAAA0D,KAAA,2BAAAxV,EAAAj1C,GAAA,+BAAAA,EAAA,yBAAAmjB,EAAA0O,IAAA64B,KAAAC,WAAAxrC,KAAA,MAAA,MAKA9nB,EAAA2I,KAAA,SACA3I,EAAAuyD,MAAA,EAEAvyD,EAAA8vD,QAlHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAgB,EAAA,CAAA,SAAA,SAEAC,EAAA,CAAA,SAAA,YAAA,YAqCA,SAAAb,EAAA/U,GACA,GAAAA,EAAA,CACA,IAAA6V,EAAAxmC,EAAAuN,IAAAzlB,EAAAkY,EAAArnB,OAEAqtD,EAAArV,EAAA,SAAA2V,GACAN,EAAArV,EAAA,SAAA4V,GAEAvmC,EAAAymC,WAAA3+C,EAAA6oC,GACA,IAAA+V,EAAA1mC,EAAAuN,IAAAzlB,EAAAkY,EAAArnB,OACAguD,EAAA3mC,EAAAuN,IAAAojB,EAAA3wB,EAAArnB,OAGA,OADA2sD,EAAAsB,KAAA,SAAAF,EAAAF,EAAAG,GACAD,EAEA,OAAA1mC,EAAAuN,IAAAzlB,EAAAkY,EAAArnB,OAOA,OAFA+sD,EAAAY,OAAAA,EACAZ,EAAAa,OAAAA,EACAb,oDCjEA,aAEA,SAAAmB,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAA++C,EAAA70D,EAAA,sBAAA60D,KAEA/B,EAAA9yD,EAAA,sBAAA8yD,UAEAgC,EAAA90D,EAAA,sBAAA80D,SAEAC,EAAA/0D,EAAA,8BAkTAc,EAAAuyD,MAAA,EAEAvyD,EAAA2I,KAAA,SACA3I,EAAA8vD,QAnTA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GAgGA,SAAA2B,EAAAvrD,EAAAnC,EAAAo3C,GAOA,GALAA,EAAAgK,MAAA,mBAAAphD,IAEAA,EAyEA,SAAAmwC,GACA,IAAApB,EAAA,WAGA,IAFA,IAAAvhC,EAAA,GAEAxU,EAAA,EAAA6L,EAAAkK,UAAArV,OAAAV,EAAA6L,EAAA7L,IAAA,CACA,IAAAqD,EAAA0S,UAAA/V,GACAwU,EAAAxU,GAAAqD,GAAAA,EAAAmD,UAGA,OAAA2wC,EAAA78B,MAAAy4C,EAAAv+C,IAOA,OAJA2iC,EAAAhc,YACA4a,EAAA5a,UAAAgc,EAAAhc,WAGA4a,EAzFA4e,CAAA3tD,IAGA4tD,EAAA7B,EAAA5pD,KAAAyrD,EAAA5tD,GAgBA,OAbAA,EAFAo3C,EAAAyW,SAEA3B,EAAA/pD,EAAAnC,EAAA8tD,YAGA5B,EAAAH,EAAA5pD,GAAAnC,GAKA+tD,EAAA5rD,EAFA4pD,EAAA5pD,GAAAnC,QAIA+rD,EAAAsB,KAAA,SAAAlrD,EAAA,WACA,OAAAnC,IAKA,QAAA/E,IAAA8wD,EAAA5pD,IAAAi1C,EAAAyW,SAQA,OALAE,EAAA5rD,EAFA4pD,EAAA5pD,GAAAnC,QAIA+rD,EAAAsB,KAAA,SAAAlrD,EAAA,WACA,OAAAnC,IAKA,IAAAo3C,EAAA4W,OACA,MAAA,IAAA30D,MAAA,kBAAA8I,EAAA,qBAIA,SAAA4rD,EAAA5rD,EAAAnC,GACAA,GAAA,mBAAAA,EAAAm0B,WACA43B,EAAAC,WAAA73B,UAAAhyB,GAAAnC,EAAAm0B,UAEA85B,EAAA9rD,KACA4pD,EAAAC,WAAAC,kBAAA9pD,GAAAnC,EAAAm0B,oBAIA43B,EAAAC,WAAA73B,UAAAhyB,GAEA8rD,EAAA9rD,KACA4pD,EAAAC,WAAAC,kBAAA9pD,GAAAnC,IAKA,SAAAkuD,EAAA/rD,UACA4pD,EAAAC,WAAA73B,UAAAhyB,GAEA8rD,EAAA9rD,GACA4pD,EAAAC,WAAAC,kBAAA9pD,GAAA4pD,EAAA5pD,UAEA4pD,EAAAC,WAAAC,kBAAA9pD,GAsCA,SAAAgsD,EAAA7E,EAAAlS,GACA,GAAA,iBAAAkS,EAAAnnD,KAAA,CACA,IAAAA,EAAAmnD,EAAAnnD,KACAisD,EAAAjsD,KAAA4pD,EAAAC,WAAA73B,UACAk6B,EAAA/E,EAAAnnB,KAAAqrB,EAAAzB,EAAAzC,EAAAnnB,MAAA4pB,EACAuC,EAAAD,EAAA/9C,eAAAnO,GAAAksD,EAAAlsD,QAAAlH,EAEA29C,EAAA,WACA,IAAAt/B,EAAAkzC,EAAAlD,GAEA,GAAAhwC,GAAA,mBAAAA,EAAA6a,UACA,MAAA,IAAA96B,MAAA,yIAGA,GAAAu0D,EAAAU,IAAAV,EAAAt0C,GAOA,OANA89B,EAAAyW,WAGAv0C,EAAA4yC,EAAAoC,EAAAh1C,IAGAA,EAGA,QAAAre,IAAAqzD,GAAAlX,EAAAyW,SACA,OAAAv0C,EAGA,IAAA89B,EAAA4W,OACA,MAAA,IAAA30D,MAAA,kBAAA8I,EAAA,uBAIA,IAAAmnD,EAAAiE,MACAA,EAAAc,EAAAlsD,EAAAy2C,GAEAwV,EACAF,EAAA/rD,IAEA,yBAAAmnD,EAAAnnB,MAAAosB,EAAAjF,KACAiE,EAAAxB,EAAAC,WAAAC,kBAAA9pD,EAAAy2C,KAIAyV,EAAAlsD,GAAAy2C,IAEAwV,EACAF,EAAA/rD,IAEA,yBAAAmnD,EAAAnnB,MAAAosB,EAAAjF,MACAyC,EAAAC,WAAAC,kBAAA9pD,GAAAy2C,MAKAmT,EAAAsB,KAAA,SAAAlrD,EAAAy2C,EAAA0Q,EAAAnnB,WAIAqqB,EAAAlD,GAqBA,SAAAsE,EAAAzd,GACA,MAAA,mBAAAA,GAAA,WAAAmd,EAAAnd,EAAA2d,YAGA,SAAAG,EAAA9rD,GACA,OAAAqsD,EAAAl+C,eAAAnO,GAGA,SAAAosD,EAAAjF,GACA,YAAAruD,IAAAquD,EAAAnnB,OAAAqsB,EAAAl+C,eAAAg5C,EAAAnnD,MAIA,IAAAqsD,EAAA,CACAxC,YAAA,EACA/Y,MAAA,EACAwb,MAAA,EACAz4C,OAAA,EACA04C,MAAA,EACAvY,OAAA,GAGA,OA7PA,SAAAwY,EAAAloC,EAAA2wB,GACA,IA4NA3wB,EA5NA9d,EAAAoG,UAAArV,OAEA,GAAA,IAAAiP,GAAA,IAAAA,EACA,MAAA,IAAA8kD,EAAA,SAAA9kD,EAAA,EAAA,GAQA,GALAyuC,IACAA,EAAA,IAIAoU,EAAA/kC,GACA0nC,EAAA1nC,EAAA2wB,QACA,GAAAr+B,MAAA2gB,QAAAjT,GACAA,EAAAvT,QAAA,SAAA8nB,GACA2zB,EAAA3zB,EAAAoc,UAEA,GAAA,WAAAkW,EAAA7mC,IAEA,IAAA,IAAAtkB,KAAAskB,EACA,GAAAA,EAAAnW,eAAAnO,GAAA,CACA,IAAAnC,EAAAymB,EAAAtkB,GAwMA,mBADAskB,EArMAzmB,IAsMA,iBAAAymB,GAAA,iBAAAA,GAAA,kBAAAA,GAAA,OAAAA,GAAAA,GAAAwsB,EAAA2b,OAAAnoC,IAAAA,GAAAwsB,EAAA4b,UAAApoC,IAAAA,GAAAwsB,EAAA6b,YAAAroC,IAAAA,GAAAwsB,EAAA8b,WAAAtoC,IAAAA,GAAAwsB,EAAA+b,SAAAvoC,IAAAA,GAAA1N,MAAA2gB,QAAAjT,GArMAinC,EAAAvrD,EAAAnC,EAAAo3C,GACAoU,EAAA/kC,GACA0nC,EAAA1nC,EAAA2wB,GAEAuX,EAAA3uD,EAAAo3C,SAKA,IAAAA,EAAA4W,OACA,MAAA,IAAAz4B,UAAA,wCAiOA/7B,EAAA+zD,MAAA,mFChUA,aAEA,SAAAD,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAAygD,EAAAv2D,EAAA,kBAEAoU,EAAApU,EAAA,qBAAAoU,OAEAgiD,EAAAp2D,EAAA,oCAEAs2D,EAAAt2D,EAAA,kCAGAw2D,EAAA,WAIA,OADAA,EAAAD,EAAAt4B,OACAs4B,GASAz1D,EAAAm9B,OAAA,SAAAsc,GAeAA,EAAAsG,SAAA,SAAAx/C,GACA,MAAA,iBAAAA,GAGAk5C,EAAA4b,UAAA,SAAA90D,GACA,OAAAk5C,EAAA73C,SAAArB,aAAAk5C,EAAA73C,UAAA,GAGA63C,EAAA6b,YAAAA,EAEA7b,EAAA8b,WAAA,SAAAh1D,GACA,OAAAk5C,EAAAx/B,UAAA1Z,aAAAk5C,EAAAx/B,WAAA,GAGAw/B,EAAA2b,OAAA,SAAA70D,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAA+yD,SAAA,GAGA3b,EAAAuG,SAAA,SAAAz/C,GACA,MAAA,iBAAAA,GAGAk5C,EAAAvZ,QAAA3gB,MAAA2gB,QACAuZ,EAAA+b,SAAAA,EAEA/b,EAAAkc,cAAA,SAAAp1D,GACA,OAAAA,GAAAA,EAAAo1D,eAAAp1D,EAAA+J,YAAAjI,UAAAmzD,WAAA,GAGA/b,EAAAmc,eAAA,SAAAr1D,GACA,OAAAA,GAAAA,EAAAq1D,gBAAAr1D,EAAA+J,YAAAjI,UAAAmzD,WAAA,GAGA/b,EAAAoc,QAAA,SAAAt1D,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAAwzD,UAAA,GAGApc,EAAAlX,QAAA,SAAAhiC,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAAkgC,UAAA,GAGAkX,EAAA2P,UAAA,SAAA7oD,GACA,MAAA,kBAAAA,GAGAk5C,EAAAqc,YAAA,SAAAv1D,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAAyzD,cAAA,GAGArc,EAAAsc,OAAA,SAAAx1D,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAA0zD,SAAA,GAGAtc,EAAAhR,WAAA,SAAAloC,GACA,MAAA,mBAAAA,GAGAk5C,EAAAvvB,OAAA,SAAA3pB,GACA,OAAAA,aAAAghB,MAGAk4B,EAAAnvB,SAAA,SAAA/pB,GACA,OAAAA,aAAA6jB,QAGAq1B,EAAAjZ,SAAA,SAAAjgC,GACA,MAAA,WAAAuzD,EAAAvzD,IAAAA,EAAA+J,cAAAhE,SAAAmzC,EAAA4b,UAAA90D,KAAAk5C,EAAA8b,WAAAh1D,IAGAk5C,EAAAoQ,OAAA,SAAAtpD,GACA,OAAA,OAAAA,GAGAk5C,EAAAsQ,YAAA,SAAAxpD,GACA,YAAAkB,IAAAlB,GAGAk5C,EAAAuc,eAAA,SAAAz1D,GACA,OAAAA,GAAAA,EAAAy1D,gBAAAz1D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAyc,YAAA,SAAA31D,GACA,OAAAA,GAAAA,EAAA21D,aAAA31D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAA0c,iBAAA,SAAA51D,GACA,OAAAA,GAAAA,EAAA41D,kBAAA51D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAA2c,YAAA,SAAA71D,GACA,OAAAA,GAAAA,EAAA61D,aAAA71D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAA4c,kBAAA,SAAA91D,GACA,OAAAA,GAAAA,EAAA81D,mBAAA91D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAA6c,eAAA,SAAA/1D,GACA,OAAAA,GAAAA,EAAA+1D,gBAAA/1D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAA8c,yBAAA,SAAAh2D,GACA,OAAAA,GAAAA,EAAAg2D,0BAAAh2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAA+c,eAAA,SAAAj2D,GACA,OAAAA,GAAAA,EAAAi2D,gBAAAj2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAgd,YAAA,SAAAl2D,GACA,OAAAA,GAAAA,EAAAk2D,aAAAl2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAwc,OAAA,SAAA11D,GACA,OAAAA,GAAAA,EAAA01D,QAAA11D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAid,aAAA,SAAAn2D,GACA,OAAAA,GAAAA,EAAAm2D,cAAAn2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAkd,eAAA,SAAAp2D,GACA,OAAAA,GAAAA,EAAAo2D,gBAAAp2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAmd,kBAAA,SAAAr2D,GACA,OAAAA,GAAAA,EAAAq2D,mBAAAr2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAod,YAAA,SAAAt2D,GACA,OAAAA,GAAAA,EAAAs2D,aAAAt2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAqd,aAAA,SAAAv2D,GACA,OAAAA,GAAAA,EAAAu2D,cAAAv2D,EAAA+J,YAAAjI,UAAA4zD,SAAA,GAGAxc,EAAAsd,QAAA,SAAAx2D,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAA00D,UAAA,GAIA,IAAArE,EAAAgD,IAyPA,OApPAhD,EAAA7oC,MAAA,CAAA,CACAlhB,KAAA,SACAmN,KAAA2jC,EAAAsG,UACA,CACAp3C,KAAA,UACAmN,KAAA2jC,EAAA4b,WACA,CACA1sD,KAAA,YACAmN,KAAA2jC,EAAA6b,aACA,CACA3sD,KAAA,WACAmN,KAAA2jC,EAAA8b,YACA,CACA5sD,KAAA,OACAmN,KAAA2jC,EAAA2b,QACA,CACAzsD,KAAA,SACAmN,KAAA2jC,EAAAuG,UACA,CACAr3C,KAAA,QACAmN,KAAA2jC,EAAAvZ,SACA,CACAv3B,KAAA,SACAmN,KAAA2jC,EAAA+b,UACA,CACA7sD,KAAA,cACAmN,KAAA2jC,EAAAkc,eACA,CACAhtD,KAAA,eACAmN,KAAA2jC,EAAAmc,gBACA,CACAjtD,KAAA,QACAmN,KAAA2jC,EAAAoc,SACA,CACAltD,KAAA,QACAmN,KAAA2jC,EAAAlX,SACA,CACA55B,KAAA,UACAmN,KAAA2jC,EAAA2P,WACA,CACAzgD,KAAA,YACAmN,KAAA2jC,EAAAqc,aACA,CACAntD,KAAA,OACAmN,KAAA2jC,EAAAsc,QACA,CACAptD,KAAA,WACAmN,KAAA2jC,EAAAhR,YACA,CACA9/B,KAAA,OACAmN,KAAA2jC,EAAAvvB,QACA,CACAvhB,KAAA,SACAmN,KAAA2jC,EAAAnvB,UACA,CACA3hB,KAAA,OACAmN,KAAA2jC,EAAAoQ,QACA,CACAlhD,KAAA,YACAmN,KAAA2jC,EAAAsQ,aACA,CACAphD,KAAA,eACAmN,KAAA2jC,EAAAkd,gBACA,CACAhuD,KAAA,eACAmN,KAAA2jC,EAAA6c,gBACA,CACA3tD,KAAA,aACAmN,KAAA2jC,EAAAqd,cACA,CACAnuD,KAAA,kBACAmN,KAAA2jC,EAAAmd,mBACA,CACAjuD,KAAA,eACAmN,KAAA2jC,EAAA+c,gBACA,CACA7tD,KAAA,yBACAmN,KAAA2jC,EAAA8c,0BACA,CACA5tD,KAAA,YACAmN,KAAA2jC,EAAAyc,aACA,CACAvtD,KAAA,iBACAmN,KAAA2jC,EAAA0c,kBACA,CACAxtD,KAAA,YACAmN,KAAA2jC,EAAA2c,aACA,CACAztD,KAAA,kBACAmN,KAAA2jC,EAAA4c,mBACA,CACA1tD,KAAA,YACAmN,KAAA2jC,EAAAgd,aACA,CACA9tD,KAAA,YACAmN,KAAA2jC,EAAAod,aACA,CACAluD,KAAA,OACAmN,KAAA2jC,EAAAwc,QACA,CACAttD,KAAA,SACAmN,KAAA2jC,EAAAjZ,WAIAkyB,EAAAsE,YAAA,CAAA,CACAC,KAAA,SACAC,GAAA,YACAlsB,QAAA,SAAAzqC,GAEA,GAAA,GAAA+S,EAAA/S,GACA,MAAA,IAAAw7B,UAAA,uFAAAx7B,EAAA,yDAGA,OAAA,IAAAk5C,EAAA0d,UAAA52D,KAEA,CACA02D,KAAA,SACAC,GAAA,UACAlsB,QAAA,SAAAzqC,GACA,OAAA,IAAAk5C,EAAA73C,QAAArB,EAAA,KAEA,CACA02D,KAAA,SACAC,GAAA,SACAlsB,QAAA,SAAAzqC,GACA,OAAAA,EAAA,KAEA,CACA02D,KAAA,YACAC,GAAA,UACAlsB,QAAA,SAAAzqC,GACA,OAAA,IAAAk5C,EAAA73C,QAAArB,EAAAiR,WAAA,KAEA,CACAylD,KAAA,WACAC,GAAA,YACAlsB,QAAA,SAAAzqC,GACA,MAAA,IAAAw7B,UAAA,+JAEA,CACAk7B,KAAA,WACAC,GAAA,UACAlsB,QAAA,SAAAzqC,GACA,OAAA,IAAAk5C,EAAA73C,QAAArB,EAAAyF,UAAA,KAEA,CACAixD,KAAA,SACAC,GAAA,WACAlsB,QAAA,SAAAzqC,GAGA,GAFA,IAAAk5C,EAAAx/B,SAAA1Z,GAEAyF,YAAAzF,EACA,MAAA,IAAAw7B,UAAA,mGAAAx7B,EAAA,uDAGA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,KAEA,CAQA02D,KAAA,SACAC,GAAA,SACAlsB,QAAA,SAAAzqC,GACA,IAAAlB,EAAAqC,OAAAnB,GAEA,GAAA2B,MAAA7C,GACA,MAAA,IAAAQ,MAAA,mBAAAU,EAAA,iBAGA,OAAAlB,IAEA,CACA43D,KAAA,SACAC,GAAA,YACAlsB,QAAA,SAAAzqC,GACA,IACA,OAAA,IAAAk5C,EAAA0d,UAAA52D,GACA,MAAA62D,GACA,MAAA,IAAAv3D,MAAA,mBAAAU,EAAA,qBAGA,CACA02D,KAAA,SACAC,GAAA,WACAlsB,QAAA,SAAAzqC,GACA,IACA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,GACA,MAAA62D,GACA,MAAA,IAAAv3D,MAAA,mBAAAU,EAAA,oBAGA,CACA02D,KAAA,SACAC,GAAA,UACAlsB,QAAA,SAAAzqC,GACA,IACA,OAAA,IAAAk5C,EAAA73C,QAAArB,GACA,MAAA62D,GACA,MAAA,IAAAv3D,MAAA,mBAAAU,EAAA,mBAGA,CACA02D,KAAA,UACAC,GAAA,SACAlsB,QAAA,SAAAzqC,GACA,OAAAA,IAEA,CACA02D,KAAA,UACAC,GAAA,YACAlsB,QAAA,SAAAzqC,GACA,OAAA,IAAAk5C,EAAA0d,WAAA52D,KAEA,CACA02D,KAAA,UACAC,GAAA,WACAlsB,QAAA,SAAAzqC,GACA,OAAA,IAAAk5C,EAAAx/B,UAAA1Z,KAEA,CACA02D,KAAA,UACAC,GAAA,SACAlsB,QAAA,SAAAzqC,GACA,OAAAA,IAEA,CACA02D,KAAA,QACAC,GAAA,SACAlsB,QAAA,SAAAlgB,GACA,OAAA,IAAA2uB,EAAA4d,YAAAvsC,KAEA,CACAmsC,KAAA,SACAC,GAAA,QACAlsB,QAAA,SAAA6nB,GACA,OAAAA,EAAA7sD,aAGA0sD,oJChbA,aAWA,SAAAuB,EAAAtd,EAAA92B,EAAAzW,EAAAC,GACA,KAAAjH,gBAAA6xD,GACA,MAAA,IAAArzD,YAAA,oDAGAwB,KAAAu0C,GAAAA,EACAv0C,KAAAyd,MAAAA,EACAzd,KAAAgH,IAAAA,EACAhH,KAAAiH,IAAAA,EACAjH,KAAA2oC,QAAA,yCAAA4L,EAAA,KAAA92B,EAAA,cAAAzW,GAAAC,MAAAA,EAAA,IAAAA,EAAA,IAAA,aACAjH,KAAAgiC,OAAA,IAAAvkC,OAAAukC,OAGA6vB,EAAA5xD,UAAA,IAAAxC,OACAyK,YAAAzK,MACAo0D,EAAA5xD,UAAAsG,KAAA,iBACAsrD,EAAA5xD,UAAAi1D,kBAAA,EACAl3D,EAAAJ,QAAAi0D,2BC5BA,aAWA,SAAAsD,EAAAC,EAAAC,EAAAC,GACA,KAAAt1D,gBAAAm1D,GACA,MAAA,IAAA32D,YAAA,oDAGAwB,KAAAo1D,OAAAA,EACAp1D,KAAAq1D,SAAAA,EACAr1D,KAAAs1D,SAAAA,EACAt1D,KAAA2oC,QAAA,wBAAAxrB,MAAA2gB,QAAAs3B,GAAA,IAAAA,EAAA1vC,KAAA,MAAA,IAAA0vC,GAAA,KAAAp1D,KAAAs1D,UAAA,MAAA,KAAAn4C,MAAA2gB,QAAAu3B,GAAA,IAAAA,EAAA3vC,KAAA,MAAA,IAAA2vC,GAAA,IACAr1D,KAAAgiC,OAAA,IAAAvkC,OAAAukC,OAGAmzB,EAAAl1D,UAAA,IAAAs1D,YACArtD,YAAAqtD,WACAJ,EAAAl1D,UAAAsG,KAAA,iBACA4uD,EAAAl1D,UAAAu1D,kBAAA,EACAx3D,EAAAJ,QAAAu3D,2BC3BA,aAYA,SAAAM,EAAAl+C,EAAAvQ,EAAAC,GACA,KAAAjH,gBAAAy1D,GACA,MAAA,IAAAj3D,YAAA,oDAGAwB,KAAAuX,MAAAA,EAEApE,UAAArV,OAAA,GACAkC,KAAAgH,IAAA,EACAhH,KAAAiH,IAAAD,IAEAhH,KAAAgH,IAAAA,EACAhH,KAAAiH,IAAAA,QAGA5H,IAAAW,KAAAgH,KAAAhH,KAAAuX,MAAAvX,KAAAgH,IACAhH,KAAA2oC,QAAA,uBAAA3oC,KAAAuX,MAAA,MAAAvX,KAAAgH,IAAA,SACA3H,IAAAW,KAAAiH,KAAAjH,KAAAuX,OAAAvX,KAAAiH,IACAjH,KAAA2oC,QAAA,uBAAA3oC,KAAAuX,MAAA,OAAAvX,KAAAiH,IAAA,GAAA,IAEAjH,KAAA2oC,QAAA,uBAAA3oC,KAAAuX,MAAA,IAGAvX,KAAAgiC,OAAA,IAAAvkC,OAAAukC,OAGAyzB,EAAAx1D,UAAA,IAAAs1D,YACArtD,YAAAqtD,WACAE,EAAAx1D,UAAAsG,KAAA,aACAkvD,EAAAx1D,UAAAy1D,cAAA,EACA13D,EAAAJ,QAAA63D,2BC1CA,aAEA,IAAA5qC,EAAA/tB,EAAA,mBAEAo7B,EAAAp7B,EAAA,mBA8HAc,EAAA2I,KAAA,OACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QA9HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqF,EAAA/E,EAAA9zD,EAAA,qBAAA8zD,GAaA,SAAAgF,EAAAC,GACA,KAAA71D,gBAAA41D,GACA,MAAA,IAAAp3D,YAAA,oDAGA,IAAAq3D,EAAA,MAAA,IAAAp4D,MAAA,0BACAuC,KAAA61D,IAAAA,EAqGA,OA9FAD,EAAA31D,UAAAo3C,KAAA,OACAue,EAAA31D,UAAA0zD,QAAA,EAOAiC,EAAA31D,UAAAwD,SAAA,WACA,IAAAoyD,EAAA71D,KAAA61D,KAAA,GACAC,EAAA,KAkBA,GAhBAD,EAAAtvD,OACAuvD,GAAA,SAAAD,EAAAtvD,KAAA,QAGAsvD,EAAAE,WACAD,GAAA,aAAAD,EAAAE,SAAA,QAGAF,EAAAG,cACAF,GAAA,qBAAAD,EAAAG,YAAA,QAGAH,EAAAI,SACAH,GAAA,gBAAAD,EAAAI,OAAAvwC,KAAA,UAAA,QAGAmwC,EAAAK,SAAA,CACAJ,GAAA,cAEA,IAAA,IAAA14D,EAAA,EAAAA,EAAAy4D,EAAAK,SAAAp4D,OAAAV,IAAA,CACA,IAAA+4D,EAAAN,EAAAK,SAAA94D,GACA04D,GAAA,OAAAK,EAAA,KACA,IAAA7zD,OAAA,EAEA,IAEAA,EAAAqzD,EAAAS,KAAAD,GACA,MAAAn5D,GACAsF,EAAAtF,OAGAqC,IAAAiD,GAAA+0C,EAAAsc,OAAArxD,KACAwzD,GAAA,WAAA59B,EAAAm+B,OAAA/zD,EAAA,CACAyC,UAAA,KACA,MAIA+wD,GAAA,KAOA,OAJAD,EAAAS,SAAAT,EAAAS,QAAAx4D,SACAg4D,GAAA,aAAAD,EAAAS,QAAA5wC,KAAA,MAAA,MAGAowC,GAOAF,EAAA31D,UAAA6P,OAAA,WACA,IAAA8C,EAAAiY,EAAArnB,MAAAxD,KAAA61D,KAEA,OADAjjD,EAAA2jD,OAAA,OACA3jD,GASAgjD,EAAAY,SAAA,SAAA1D,GACA,IAAA+C,EAAA,GAEA,IAAA,IAAAj7C,KAAAk4C,EACA,WAAAl4C,IAEAi7C,EAAAj7C,GAAAk4C,EAAAl4C,IAIA,OAAA,IAAAg7C,EAAAC,IAOAD,EAAA31D,UAAA2D,QAAAgyD,EAAA31D,UAAAwD,SACAmyD,+FC/HA,aAEA,IAAAhQ,EAAA9oD,EAAA,mBAAA8oD,OAEA6Q,EAAA35D,EAAA,oBAkKAc,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,aACA3oC,EAAA8vD,QAlKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAuG,EAAA9F,EAAA9zD,EAAA,YAmDA,SAAA65D,IACA,KAAA32D,gBAAA22D,GACA,MAAA,IAAAn4D,YAAA,oDAGAwB,KAAA42D,MAAA,GAoGA,OA7FAD,EAAA12D,UAAAo3C,KAAA,SACAsf,EAAA12D,UAAA42D,UAAA,EAUAF,EAAA12D,UAAAhB,MAAA,SAAAk3D,GACA,MAAA,IAAA14D,MAAA,wDAWAk5D,EAAA12D,UAAA62D,QAAA,SAAAX,GACA,MAAA,IAAA14D,MAAA,4DAUAk5D,EAAA12D,UAAAm2D,KAAA,SAAAD,GAEA,OAAAO,EAAAP,GAAAW,UAAAV,KAAAp2D,KAAA42D,QAUAD,EAAA12D,UAAA4a,IAAA,SAAAtU,GAEA,OAAAA,KAAAvG,KAAA42D,MAAAH,EAAAM,gBAAA/2D,KAAA42D,MAAArwD,QAAAlH,GAQAs3D,EAAA12D,UAAAsd,OAAA,WACA,OAAAqoC,EAAA,GAAA5lD,KAAA42D,QASAD,EAAA12D,UAAAwU,IAAA,SAAAlO,EAAAnC,GAEA,OAAAqyD,EAAAO,gBAAAh3D,KAAA42D,MAAArwD,EAAAnC,IAQAuyD,EAAA12D,UAAA6jD,OAAA,SAAAv9C,UAEAvG,KAAA42D,MAAArwD,IAOAowD,EAAA12D,UAAAk/B,MAAA,WACA,IAAA,IAAA54B,KAAAvG,KAAA42D,MACA52D,KAAA42D,MAAAliD,eAAAnO,WACAvG,KAAA42D,MAAArwD,IAKAowD,GAMA/4D,EAAAuyD,MAAA,qFCzKA,aAEAnyD,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,YACAE,OAAA,CAAA,YACAD,YAAA,6GACAE,SAAA,CAAA,WAAA,SACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,YACAE,OAAA,CAAA,QACAD,YAAA,oEACAE,SAAA,CAAA,OAAA,WACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,OACAD,YAAA,mEACAE,SAAA,CAAA,MAAA,UACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,YACAE,OAAA,CAAA,UACAD,YAAA,mEACAE,SAAA,CAAA,SAAA,cACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,YACAE,OAAA,CAAA,SACAD,YAAA,kEACAE,SAAA,CAAA,QAAA,aACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,OACAD,YAAA,eACAE,SAAA,CAAA,MAAA,SACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,YACAE,OAAA,CAAA,WACAD,YAAA,+DACAE,SAAA,CAAA,UAAA,aACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,YACAE,OAAA,CAAA,SACAD,YAAA,6DACAE,SAAA,CAAA,QAAA,WACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,IACAwvD,SAAA,YACAE,OAAA,CAAA,KACAD,YAAA,oFACAE,SAAA,CAAA,IAAA,QAAA,SAAA,UACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,YACAE,OAAA,CAAA,SACAD,YAAA,sBACAE,SAAA,CAAA,SACAI,QAAA,CAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,IACAwvD,SAAA,YACAE,OAAA,CAAA,KACAD,YAAA,sIACAE,SAAA,CAAA,IAAA,QAAA,YACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,YACAE,OAAA,CAAA,QACAD,YAAA,aACAE,SAAA,CAAA,QACAI,QAAA,CAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,OACAD,YAAA,mOACAE,SAAA,CAAA,OACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,KACAwvD,SAAA,YACAE,OAAA,CAAA,MACAD,YAAA,gJACAE,SAAA,CAAA,KAAA,aACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,OACAD,YAAA,0GACAE,SAAA,CAAA,MAAA,UACAI,QAAA,CAAA,gCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,YACAE,OAAA,CAAA,QACAD,YAAA,qBACAE,SAAA,CAAA,QACAI,QAAA,CAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,YACAE,OAAA,CAAA,WACAD,YAAA,8CACAE,SAAA,CAAA,WACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,eACAE,OAAA,CAAA,gBACAD,YAAA,+CACAE,SAAA,CAAA,YAAA,kCAAA,mBAAA,uBAAA,8BACAI,QAAA,CAAA,UAAA,UAAA,WAAA,QAAA,SAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,eACAE,OAAA,CAAA,IAAA,cACAD,YAAA,6CACAE,SAAA,CAAA,aAAA,aAAA,aAAA,kBAAA,mBAAA,yBACAI,QAAA,CAAA,YAAA,UAAA,QAAA,SAAA,SAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,eACAE,OAAA,CAAA,YAAA,kBAAA,mBACAD,YAAA,2BACAE,SAAA,CAAA,YAAA,gBAAA,qBACAI,QAAA,CAAA,YAAA,UAAA,QAAA,SAAA,SAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,eACAE,OAAA,CAAA,0BAAA,gCACAD,YAAA,iEACAE,SAAA,CAAA,oBAAA,uFAAA,oCACAI,QAAA,CAAA,OAAA,uCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,eACAE,OAAA,CAAA,gBAAA,qBACAD,YAAA,uEACAE,SAAA,CAAA,kBAAA,mCACAI,QAAA,CAAA,YAAA,UAAA,UAAA,QAAA,SAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,UAAA,cAAA,mBAAA,yBAAA,kCAAA,+CACAD,YAAA,yDACAE,SAAA,CAAA,KAAA,YAAA,yBAAA,UAAA,eAAA,4BACAI,QAAA,CAAA,YAAA,UAAA,UAAA,UAAA,SAAA,QAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,eACAE,OAAA,CAAA,KAAA,6BAAA,WAAA,kBAAA,iBACAD,YAAA,mBACAE,SAAA,CAAA,KAAA,YAAA,qBAAA,WAAA,iBAAA,iCAAA,4CACAI,QAAA,CAAA,YAAA,UAAA,UAAA,QAAA,SAAA,SAAA,OAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,eACAE,OAAA,CAAA,IAAA,YAAA,+BACAD,YAAA,gEACAE,SAAA,CAAA,IAAA,MAAA,OAAA,YAAA,gBAAA,eAAA,oCAAA,6BACAI,QAAA,CAAA,YAAA,UAAA,UAAA,WAAA,QAAA,SAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,eACAE,OAAA,CAAA,WAAA,qCAAA,gDACAD,YAAA,0BACAE,SAAA,CAAA,WAAA,uBAAA,kCACAI,QAAA,CAAA,YAAA,UAAA,UAAA,QAAA,SAAA,SAAA,OAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,eACAE,OAAA,CAAA,wCACAD,YAAA,6EACAE,SAAA,CAAA,oCACAI,QAAA,CAAA,OAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,eACAE,OAAA,CAAA,SAAA,aACAD,YAAA,iDACAE,SAAA,CAAA,iBAAA,cAAA,kBACAI,QAAA,CAAA,YAAA,UAAA,UAAA,QAAA,SAAA,SAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,aAAA,oBAAA,gBACAD,YAAA,iBACAE,SAAA,CAAA,SAAA,SAAA,wBAAA,kBACAI,QAAA,CAAA,YAAA,UAAA,UAAA,QAAA,SAAA,SAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,OACAE,OAAA,CAAA,WAAA,mBACAD,YAAA,6CACAE,SAAA,CAAA,WAAA,YAAA,+BAAA,aACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,OACAE,OAAA,CAAA,oBAAA,8BACAD,YAAA,gDACAE,SAAA,CAAA,4CAAA,UAAA,cACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,OACAE,OAAA,CAAA,oBAAA,2BACAD,YAAA,2BACAE,SAAA,CAAA,iDAAA,YAAA,mBACAI,QAAA,6BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,UACAE,OAAA,CAAA,6BAAA,mDACAD,YAAA,4OACAE,SAAA,CAAA,0BAAA,6CAAA,mCAAA,6BAAA,uBAAA,iBAAA,wBAAA,mBACAI,QAAA,CAAA,WAAA,QAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,UACAE,OAAA,CAAA,kBACAD,YAAA,iHACAE,SAAA,CAAA,oBAAA,cAAA,oBACAI,QAAA,CAAA,MAAA,UAAA,SAAA,SAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,UACAD,YAAA,sIACAE,SAAA,CAAA,wBAAA,gCAAA,iCACAI,QAAA,CAAA,UAAA,SAAA,SAAA,SAAA,SAAA,MAAA,gCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,UACAE,OAAA,CAAA,kBAAA,oBACAD,YAAA,gGACAE,SAAA,CAAA,oBAAA,cAAA,qBACAI,QAAA,CAAA,MAAA,MAAA,SAAA,SAAA,SAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,KACAwvD,SAAA,UACAE,OAAA,CAAA,SACAD,YAAA,uKACAE,SAAA,CAAA,4DACAI,QAAA,CAAA,MAAA,MAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,UACAE,OAAA,CAAA,oBAAA,2BAAA,sCACAD,YAAA,mPACAE,SAAA,CAAA,gCAAA,uCACAI,QAAA,CAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,UACAE,OAAA,CAAA,iBAAA,yBACAD,YAAA,+BACAE,SAAA,CAAA,wBAAA,qBAAA,+BAAA,2BAAA,2BACAI,QAAA,CAAA,aAAA,QAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,4BACAD,YAAA,wKACAE,SAAA,CAAA,2FACAI,QAAA,CAAA,UAAA,SAAA,SAAA,SAAA,SAAA,MAAA,gCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,UACAE,OAAA,CAAA,kBACAD,YAAA,iHACAE,SAAA,CAAA,oFACAI,QAAA,CAAA,MAAA,UAAA,SAAA,SAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,UACAD,YAAA,8BACAE,SAAA,CAAA,WAAA,aACAI,QAAA,CAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,QAAA,aACAD,YAAA,kBACAE,SAAA,CAAA,gBAAA,UAAA,SAAA,gBAAA,eACAI,QAAA,CAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,UAAA,qBACAD,YAAA,iQACAE,SAAA,CAAA,WAAA,UAAA,WAAA,eAAA,WAAA,iBAAA,gBACAI,QAAA,CAAA,SAAA,OAAA,OAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,WACAD,YAAA,wHACAE,SAAA,CAAA,YAAA,YAAA,cACAI,QAAA,CAAA,QAAA,MAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,WACAD,YAAA,2DACAE,SAAA,CAAA,UAAA,MAAA,aACAI,QAAA,CAAA,WAAA,SAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,YACAE,OAAA,CAAA,QAAA,gBACAD,YAAA,qBACAE,SAAA,CAAA,YAAA,QAAA,UAAA,YAAA,cAAA,eACAI,QAAA,CAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,YACAE,OAAA,CAAA,SAAA,mBACAD,YAAA,kCACAE,SAAA,CAAA,yBAAA,yBAAA,UACAI,QAAA,CAAA,WAAA,cAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,YACAE,OAAA,CAAA,SAAA,qBACAD,YAAA,oCACAE,SAAA,CAAA,yBAAA,yBAAA,UACAI,QAAA,CAAA,WAAA,SAAA,uCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,YACAE,OAAA,CAAA,SAAA,gBACAD,YAAA,+CACAE,SAAA,CAAA,yBAAA,UACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,UACAD,YAAA,qCACAE,SAAA,CAAA,WAAA,UAAA,gBAAA,UAAA,uDACAI,QAAA,CAAA,OAAA,QAAA,MAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,UACAD,YAAA,wJACAE,SAAA,CAAA,uBACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,YACAD,YAAA,mEACAE,SAAA,CAAA,WAAA,gBAAA,qBACAI,QAAA,CAAA,MAAA,MAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,UACAD,YAAA,sGACAE,SAAA,CAAA,WAAA,WAAA,YAAA,aACAI,QAAA,CAAA,OAAA,QAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,YACAD,YAAA,yHACAE,SAAA,CAAA,aAAA,aAAA,eACAI,QAAA,CAAA,OAAA,MAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,YAAA,qBACAD,YAAA,uCACAE,SAAA,CAAA,aAAA,aAAA,oBACAI,QAAA,CAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,sBAAA,yBACAD,YAAA,mDACAE,SAAA,CAAA,cAAA,kBAAA,YAAA,oBACAI,QAAA,CAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,aACAD,YAAA,qCACAE,SAAA,CAAA,YAAA,aAAA,iBACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,SAAA,gBACAD,YAAA,8NACAE,SAAA,CAAA,WAAA,eAAA,SAAA,SAAA,iBAAA,uBAAA,mBAAA,SACAI,QAAA,CAAA,MAAA,QAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,YACAD,YAAA,4CACAE,SAAA,CAAA,iBAAA,eAAA,SAAA,uBAAA,kBACAI,QAAA,CAAA,MAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,WAAA,kBACAD,YAAA,yCACAE,SAAA,CAAA,aAAA,kBAAA,aAAA,kBAAA,yBACAI,QAAA,CAAA,MAAA,MAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,WACAD,YAAA,gFACAE,SAAA,CAAA,gBAAA,WAAA,qBAAA,aACAI,QAAA,CAAA,MAAA,QAAA,MAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,QAAA,UAAA,aACAD,YAAA,gEACAE,SAAA,CAAA,QAAA,SAAA,WAAA,mBAAA,WAAA,YACAI,QAAA,CAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,YACAE,OAAA,CAAA,QAAA,kBACAD,YAAA,uBACAE,SAAA,CAAA,gBAAA,UAAA,YAAA,cAAA,cACAI,QAAA,CAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,UAAA,cACAD,YAAA,oDACAE,SAAA,CAAA,YAAA,aAAA,eAAA,6BAAA,8BAAA,kBAAA,4BAAA,gCAAA,2DCPA,aAEAl4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,aACAE,OAAA,CAAA,aAAA,oBACAD,YAAA,qJACAE,SAAA,CAAA,QAAA,iBAAA,gBAAA,WACAI,QAAA,CAAA,WAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,aACAE,OAAA,CAAA,cAAA,qBACAD,YAAA,2LACAE,SAAA,CAAA,cAAA,kBACAI,QAAA,CAAA,OAAA,MAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,YACAE,OAAA,CAAA,QAAA,aACAD,YAAA,uCACAE,SAAA,CAAA,MAAA,QAAA,oBACAI,QAAA,CAAA,WAAA,UAAA,WAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,WAAA,eACAD,YAAA,4LACAE,SAAA,CAAA,aAAA,aAAA,cAAA,cAAA,eAAA,uBACAI,QAAA,CAAA,OAAA,QAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,WACAD,YAAA,iGACAE,SAAA,CAAA,YAAA,aAAA,WACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,WACAD,YAAA,+EACAE,SAAA,CAAA,WAAA,QAAA,YACAI,QAAA,CAAA,SAAA,QAAA,WAAA,UAAA,WAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,YACAD,YAAA,+IACAE,SAAA,CAAA,2BACAI,QAAA,CAAA,OAAA,MAAA,SAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,aACAE,OAAA,CAAA,aACAD,YAAA,2DACAE,SAAA,CAAA,YAAA,UAAA,MAAA,SACAI,QAAA,CAAA,WAAA,MAAA,OAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,YACAE,OAAA,CAAA,QAAA,kBACAD,YAAA,uBACAE,SAAA,CAAA,cAAA,QAAA,YAAA,YAAA,iBACAI,QAAA,CAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,YACAE,OAAA,CAAA,KAAA,iBACAD,YAAA,yEACAE,SAAA,CAAA,OAAA,UAAA,SACAI,QAAA,CAAA,MAAA,WAAA,uCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,YACAE,OAAA,CAAA,KAAA,gBACAD,YAAA,4CACAE,SAAA,CAAA,QAAA,QACAI,QAAA,CAAA,MAAA,WAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,cACAD,YAAA,iLACAE,SAAA,CAAA,cAAA,aAAA,sBACAI,QAAA,CAAA,MAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,UACAE,OAAA,CAAA,QAAA,gBACAD,YAAA,6QACAE,SAAA,CAAA,QAAA,kBAAA,oBACAI,QAAA,CAAA,SAAA,QAAA,SAAA,YAAA,kBAAA,2CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,UACAE,OAAA,CAAA,KAAA,aACAD,YAAA,8IACAE,SAAA,CAAA,KAAA,KAAA,sBACAI,QAAA,CAAA,SAAA,QAAA,SAAA,YAAA,kBAAA,2CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,UACAE,OAAA,CAAA,QAAA,eACAD,YAAA,8PACAE,SAAA,CAAA,QAAA,uBACAI,QAAA,CAAA,SAAA,SAAA,SAAA,YAAA,kBAAA,2CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,UACAE,OAAA,CAAA,gBACAD,YAAA,mRACAE,SAAA,CAAA,cAAA,wBACAI,QAAA,CAAA,SAAA,SAAA,QAAA,YAAA,kBAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,UACAE,OAAA,CAAA,SAAA,mBACAD,YAAA,+DACAE,SAAA,CAAA,SAAA,UACAI,QAAA,CAAA,SAAA,SAAA,QAAA,SAAA,kBAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,kBACAwvD,SAAA,UACAE,OAAA,CAAA,SAAA,yBACAD,YAAA,mEACAE,SAAA,CAAA,SAAA,SAAA,YACAI,QAAA,CAAA,SAAA,SAAA,QAAA,SAAA,YAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,gBACAwvD,SAAA,UACAE,OAAA,CAAA,UAAA,uBACAD,YAAA,gEACAE,SAAA,CAAA,UAAA,SAAA,aACAI,QAAA,CAAA,SAAA,SAAA,QAAA,SAAA,YAAA,8CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,gBACAE,OAAA,CAAA,kBACAD,YAAA,2NACAE,SAAA,CAAA,iBAAA,kBACAI,QAAA,CAAA,yCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,gBACAE,OAAA,CAAA,cACAD,YAAA,0KACAE,SAAA,CAAA,aAAA,cACAI,QAAA,CAAA,0CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,gBACAE,OAAA,CAAA,qBACAD,YAAA,wIACAE,SAAA,CAAA,qBACAI,QAAA,CAAA,2CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,gBACAE,OAAA,CAAA,oBACAD,YAAA,kRACAE,SAAA,CAAA,oBACAI,QAAA,CAAA,0CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,UACAD,YAAA,iGACAE,SAAA,CAAA,cAAA,cAAA,eACAI,QAAA,CAAA,KAAA,KAAA,OAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,UACAE,OAAA,CAAA,WACAD,YAAA,gGACAE,SAAA,CAAA,eAAA,eAAA,eACAI,QAAA,CAAA,KAAA,KAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,KACAwvD,SAAA,UACAE,OAAA,CAAA,SACAD,YAAA,8CACAE,SAAA,CAAA,aAAA,aAAA,YAAA,WACAI,QAAA,CAAA,KAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,KACAwvD,SAAA,UACAE,OAAA,CAAA,SACAD,YAAA,yCACAE,SAAA,CAAA,aAAA,aAAA,YAAA,WACAI,QAAA,CAAA,KAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,mBAAA,oCACAD,YAAA,uDACAE,SAAA,CAAA,gBAAA,2BACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,eAAA,gBACAD,YAAA,oDACAE,SAAA,CAAA,aAAA,mBACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,WACAE,OAAA,CAAA,+BAAA,iCACAD,YAAA,wDACAE,SAAA,CAAA,yBAAA,4BACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,WACAE,OAAA,CAAA,wCAAA,kCACAD,YAAA,0DACAE,SAAA,CAAA,gDAAA,mDACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,UAAA,aACAD,YAAA,uFACAE,SAAA,CAAA,iBAAA,gBAAA,WACAI,QAAA,CAAA,MAAA,KAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,QAAA,UACAD,YAAA,0DACAE,SAAA,CAAA,WAAA,YAAA,QAAA,SACAI,QAAA,CAAA,MAAA,KAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,KACAwvD,SAAA,UACAE,OAAA,CAAA,SAAA,YACAD,YAAA,mFACAE,SAAA,CAAA,gBAAA,iBAAA,UACAI,QAAA,CAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,UAAA,aACAD,YAAA,2GACAE,SAAA,CAAA,iBAAA,kBAAA,gBAAA,WACAI,QAAA,CAAA,MAAA,MAAA,iCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,SACAE,OAAA,CAAA,uBAAA,6BACAD,YAAA,iKACAE,SAAA,CAAA,mBAAA,mBAAA,eAAA,kBAAA,mBACAI,QAAA,CAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,SACAE,OAAA,CAAA,eACAD,YAAA,0EACAE,SAAA,CAAA,+BAAA,+BAAA,gCACAI,QAAA,CAAA,WAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,SACAE,OAAA,CAAA,KAAA,iBACAD,YAAA,2CACAE,SAAA,CAAA,yBAAA,KAAA,iBACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,SACAE,OAAA,CAAA,UACAD,YAAA,wCACAE,SAAA,CAAA,oBAAA,uCACAI,QAAA,CAAA,SAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,SACAE,OAAA,CAAA,UAAA,cACAD,YAAA,4aACAE,SAAA,CAAA,YAAA,eAAA,kCAAA,WACAI,QAAA,CAAA,SAAA,MAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,SACAE,OAAA,CAAA,YAAA,SACAD,YAAA,6LACAE,SAAA,CAAA,4BAAA,yBACAI,QAAA,CAAA,WAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,SACAE,OAAA,CAAA,mBACAD,YAAA,4BACAE,SAAA,CAAA,wBAAA,wCAAA,oCACAI,QAAA,CAAA,OAAA,MAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,SACAE,OAAA,CAAA,cACAD,YAAA,uEACAE,SAAA,CAAA,yBAAA,UAAA,iBAAA,WACAI,QAAA,CAAA,SAAA,SAAA,OAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,SACAE,OAAA,CAAA,wBACAD,YAAA,0FACAE,SAAA,CAAA,0DACAI,QAAA,CAAA,MAAA,OAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,oBACAwvD,SAAA,SACAE,OAAA,CAAA,wBACAD,YAAA,iOACAE,SAAA,CAAA,+BAAA,wCAAA,iCAAA,wCACAI,QAAA,CAAA,SAAA,SAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,SACAE,OAAA,CAAA,cAAA,iBAAA,oBACAD,YAAA,yGACAE,SAAA,CAAA,cAAA,iBAAA,yBAAA,qBACAI,QAAA,CAAA,SAAA,MAAA,OAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,SACAE,OAAA,CAAA,UACAD,YAAA,oCACAE,SAAA,CAAA,oBAAA,SAAA,SACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,SACAE,OAAA,CAAA,cACAD,YAAA,6DACAE,SAAA,CAAA,2CAAA,wBACAI,QAAA,CAAA,WAAA,MAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,SACAE,OAAA,CAAA,oBACAD,YAAA,qHACAE,SAAA,CAAA,0BACAI,QAAA,CAAA,SAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,SACAE,OAAA,CAAA,UAAA,aAAA,qBAAA,YAAA,eAAA,wBACAD,YAAA,mCACAE,SAAA,CAAA,UAAA,aAAA,oBAAA,yBAAA,iBACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,QAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,kBACAwvD,SAAA,SACAE,OAAA,CAAA,wBAAA,kCACAD,YAAA,uIACAE,SAAA,CAAA,iCAAA,4CACAI,QAAA,CAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,OACAE,OAAA,CAAA,YAAA,iBAAA,oBAAA,0BAAA,iBACAD,YAAA,iFACAE,SAAA,CAAA,MAAA,UAAA,cAAA,kBAAA,gBAAA,+BAAA,eACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,OAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,SACAE,OAAA,CAAA,qBACAD,YAAA,qEACAE,SAAA,CAAA,sCAAA,oCAAA,kCACAI,QAAA,CAAA,OAAA,UAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,SACAE,OAAA,CAAA,kBAAA,iCACAD,YAAA,mBACAE,SAAA,CAAA,2BAAA,uBAAA,2BAAA,oBAAA,6BACAI,QAAA,CAAA,OAAA,SAAA,UAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,SACAE,OAAA,CAAA,WACAD,YAAA,kCACAE,SAAA,CAAA,YAAA,sBAAA,yBAAA,UAAA,aACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,UAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,SACAE,OAAA,CAAA,UAAA,oBACAD,YAAA,2GACAE,SAAA,CAAA,mBAAA,6BAAA,+CAAA,iDAAA,qCACAI,QAAA,CAAA,MAAA,SAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,SACAE,OAAA,CAAA,cACAD,YAAA,6DACAE,SAAA,CAAA,mBAAA,mBAAA,mBAAA,oBACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,SAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,SACAE,OAAA,CAAA,eAAA,6BAAA,yBAAA,uCACAD,YAAA,8HACAE,SAAA,CAAA,mBAAA,SAAA,qBAAA,mBAAA,YAAA,UAAA,WACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,QAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,SACAE,OAAA,CAAA,YACAD,YAAA,oGACAE,SAAA,CAAA,mCAAA,YACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,YAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,SACAE,OAAA,CAAA,KAAA,gBACAD,YAAA,qBACAE,SAAA,CAAA,yBAAA,KAAA,gBACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,SACAE,OAAA,CAAA,WAAA,cAAA,sBAAA,aAAA,gBAAA,yBACAD,YAAA,oCACAE,SAAA,CAAA,WAAA,cAAA,yBAAA,kBACAI,QAAA,CAAA,SAAA,MAAA,OAAA,WAAA,MAAA,OAAA,QAAA,OAAA,UAAA,SAAA,QAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,eACAwvD,SAAA,cACAE,OAAA,CAAA,sBACAD,YAAA,kEACAE,SAAA,CAAA,sBACAI,QAAA,CAAA,eAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,cACAE,OAAA,CAAA,KAAA,gBACAD,YAAA,mCACAE,SAAA,CAAA,KAAA,oBAAA,MACAI,QAAA,CAAA,eAAA,eAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,cACAE,OAAA,CAAA,YACAD,YAAA,6IACAE,SAAA,CAAA,WAAA,KAAA,aAAA,YACAI,QAAA,CAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,eACAwvD,SAAA,cACAE,OAAA,CAAA,sBACAD,YAAA,6EACAE,SAAA,CAAA,8CACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,cACAE,OAAA,CAAA,kBACAD,YAAA,4OACAE,SAAA,CAAA,0BACAI,QAAA,CAAA,eAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,eACAwvD,SAAA,cACAE,OAAA,CAAA,kBAAA,sBACAD,YAAA,kEACAE,SAAA,CAAA,kBAAA,sBACAI,QAAA,CAAA,eAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,cACAE,OAAA,CAAA,oBAAA,4BAAA,6BAAA,qCAAA,sCACAD,YAAA,0CACAE,SAAA,CAAA,mBAAA,2BAAA,8BAAA,yCAAA,4CAAA,6CACAI,QAAA,CAAA,SAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,cACAE,OAAA,CAAA,WAAA,cAAA,mBAAA,eAAA,oBAAA,0BACAD,YAAA,0BACAE,SAAA,CAAA,WAAA,iBAAA,kBACAI,QAAA,CAAA,aAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,cACAE,OAAA,CAAA,iBAAA,sBAAA,kBAAA,uBAAA,6BACAD,YAAA,iCACAE,SAAA,CAAA,oBAAA,yBACAI,QAAA,CAAA,aAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,aACAE,OAAA,CAAA,iBACAD,YAAA,8EACAE,SAAA,CAAA,gBAAA,gBAAA,gBAAA,qBAAA,yBACAI,QAAA,CAAA,QAAA,UAAA,UAAA,YAAA,WAAA,iBAAA,0CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,iBACAwvD,SAAA,aACAE,OAAA,CAAA,wBACAD,YAAA,0HACAE,SAAA,CAAA,uBAAA,uBAAA,uBAAA,4BAAA,4BAAA,iCAAA,uCAAA,oCAAA,iCAAA,kCACAI,QAAA,CAAA,QAAA,UAAA,UAAA,YAAA,WAAA,UAAA,0CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,aACAE,OAAA,CAAA,qBACAD,YAAA,uHACAE,SAAA,CAAA,wBAAA,wBAAA,wBAAA,yBAAA,qBAAA,iBAAA,4BAAA,qCACAI,QAAA,CAAA,UAAA,6CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,aACAE,OAAA,CAAA,mBACAD,YAAA,+IACAE,SAAA,CAAA,8BAAA,6BACAI,QAAA,CAAA,QAAA,UAAA,UAAA,SAAA,YAAA,WAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,aACAE,OAAA,CAAA,SAAA,eACAD,YAAA,wFACAE,SAAA,CAAA,WAAA,WAAA,UAAA,YAAA,SAAA,gBACAI,QAAA,CAAA,UAAA,UAAA,SAAA,YAAA,WAAA,UAAA,YAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,aACAE,OAAA,CAAA,mBACAD,YAAA,uHACAE,SAAA,CAAA,8BAAA,sBAAA,uBAAA,2BAAA,mCACAI,QAAA,CAAA,UAAA,iBAAA,cAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,aACAE,OAAA,CAAA,QAAA,gBACAD,YAAA,2FACAE,SAAA,CAAA,QAAA,UAAA,UAAA,YAAA,UAAA,UAAA,iBACAI,QAAA,CAAA,QAAA,UAAA,UAAA,YAAA,WAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,aACAE,OAAA,CAAA,SAAA,kBACAD,YAAA,yGACAE,SAAA,CAAA,WAAA,UAAA,UAAA,YAAA,YACAI,QAAA,CAAA,QAAA,UAAA,YAAA,UAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,aACAE,OAAA,CAAA,QAAA,iBACAD,YAAA,mGACAE,SAAA,CAAA,QAAA,UAAA,UAAA,YAAA,UAAA,iBACAI,QAAA,CAAA,QAAA,UAAA,SAAA,YAAA,WAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,aACAE,OAAA,CAAA,SAAA,mBACAD,YAAA,0GACAE,SAAA,CAAA,WAAA,UAAA,UAAA,YAAA,YACAI,QAAA,CAAA,QAAA,UAAA,SAAA,UAAA,WAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,aACAE,OAAA,CAAA,SAAA,iBACAD,YAAA,uGACAE,SAAA,CAAA,WAAA,WAAA,UAAA,YAAA,SAAA,eAAA,kBACAI,QAAA,CAAA,QAAA,UAAA,SAAA,YAAA,WAAA,UAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,eACAwvD,SAAA,MACAE,OAAA,CAAA,4BACAD,YAAA,6IACAE,SAAA,CAAA,gCACAI,QAAA,CAAA,WAAA,eAAA,gBAAA,0CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,gBACAwvD,SAAA,MACAE,OAAA,CAAA,6BACAD,YAAA,8LACAE,SAAA,CAAA,4CAAA,qDACAI,QAAA,CAAA,WAAA,eAAA,+CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,MACAE,OAAA,CAAA,oBACAD,YAAA,2IACAE,SAAA,CAAA,mCACAI,QAAA,CAAA,8CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,eACAwvD,SAAA,MACAE,OAAA,CAAA,4BACAD,YAAA,wIACAE,SAAA,CAAA,2CAAA,oDACAI,QAAA,CAAA,WAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,MACAE,OAAA,CAAA,2BACAD,YAAA,wMACAE,SAAA,CAAA,oCAAA,qCACAI,QAAA,CAAA,WAAA,eAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,kBACAwvD,SAAA,MACAE,OAAA,CAAA,iCACAD,YAAA,kJACAE,SAAA,CAAA,mCAAA,oCACAI,QAAA,CAAA,cAAA,sCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,MACAE,OAAA,CAAA,oBACAD,YAAA,gMACAE,SAAA,CAAA,0BACAI,QAAA,CAAA,2CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,MACAE,OAAA,CAAA,eAAA,wBACAD,YAAA,sNACAE,SAAA,CAAA,wBAAA,+BACAI,QAAA,CAAA,WAAA,eAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,mBACAwvD,SAAA,MACAE,OAAA,CAAA,gCACAD,YAAA,gJACAE,SAAA,CAAA,+CAAA,wDACAI,QAAA,CAAA,WAAA,eAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,WACAwvD,SAAA,MACAE,OAAA,CAAA,wBACAD,YAAA,iIACAE,SAAA,CAAA,uCAAA,gDACAI,QAAA,CAAA,eAAA,4CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,UACAE,OAAA,CAAA,UACAD,YAAA,6GACAE,SAAA,CAAA,WAAA,YAAA,UACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,oBAAA,UACAD,YAAA,8KACAE,SAAA,CAAA,kBAAA,kBACAI,QAAA,CAAA,OAAA,SAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,oBAAA,SAAA,eACAD,YAAA,iDACAE,SAAA,CAAA,kBAAA,oBAAA,oBAAA,uBAAA,uBAAA,gCAAA,iCACAI,QAAA,CAAA,OAAA,SAAA,MAAA,OAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,qBAAA,UAAA,gBACAD,YAAA,mDACAE,SAAA,CAAA,mBAAA,qBAAA,qBAAA,wBAAA,wBAAA,8BACAI,QAAA,CAAA,MAAA,SAAA,MAAA,OAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,aACAE,OAAA,CAAA,uBAAA,aACAD,YAAA,mLACAE,SAAA,CAAA,kBAAA,yBACAI,QAAA,CAAA,MAAA,OAAA,MAAA,OAAA,MAAA,MAAA,MAAA,0CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,oBAAA,SAAA,eACAD,YAAA,iDACAE,SAAA,CAAA,kBAAA,oBAAA,oBAAA,uBAAA,uBAAA,gCAAA,iCACAI,QAAA,CAAA,MAAA,OAAA,SAAA,OAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,qBAAA,UAAA,4BACAD,YAAA,2HACAE,SAAA,CAAA,sBAAA,8BAAA,uBACAI,QAAA,CAAA,MAAA,OAAA,MAAA,SAAA,OAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,aACAE,OAAA,CAAA,qBAAA,WACAD,YAAA,qCACAE,SAAA,CAAA,gBAAA,kBAAA,sBACAI,QAAA,CAAA,MAAA,OAAA,MAAA,SAAA,MAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,cACAwvD,SAAA,aACAE,OAAA,CAAA,iCAAA,gDAAA,+BACAD,YAAA,sWACAE,SAAA,CAAA,kCAAA,yCAAA,gCAAA,yCACAI,QAAA,CAAA,OAAA,SAAA,MAAA,MAAA,OAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,oBAAA,SAAA,yBACAD,YAAA,4KACAE,SAAA,CAAA,eAAA,oBAAA,mCAAA,8BAAA,2BACAI,QAAA,CAAA,MAAA,OAAA,MAAA,SAAA,MAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,oBAAA,UACAD,YAAA,iCACAE,SAAA,CAAA,kBAAA,oBAAA,qBACAI,QAAA,CAAA,MAAA,OAAA,SAAA,MAAA,OAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,aACAE,OAAA,CAAA,oBAAA,SAAA,yBACAD,YAAA,gIACAE,SAAA,CAAA,eAAA,oBAAA,mCAAA,8BAAA,2BACAI,QAAA,CAAA,MAAA,OAAA,MAAA,SAAA,MAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,oDACAE,SAAA,CAAA,YAAA,kBACAI,QAAA,CAAA,MAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,YACAD,YAAA,6FACAE,SAAA,CAAA,cACAI,QAAA,CAAA,OAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,8CACAE,SAAA,CAAA,YAAA,iBAAA,WACAI,QAAA,CAAA,MAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,YACAD,YAAA,6GACAE,SAAA,CAAA,WAAA,cACAI,QAAA,CAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,8CACAE,SAAA,CAAA,UAAA,iBAAA,aACAI,QAAA,CAAA,MAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,YACAD,YAAA,sGACAE,SAAA,CAAA,cACAI,QAAA,CAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,2CACAE,SAAA,CAAA,YAAA,iBAAA,WACAI,QAAA,CAAA,OAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,YACAD,YAAA,2CACAE,SAAA,CAAA,cACAI,QAAA,CAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,kDACAE,SAAA,CAAA,YAAA,kBACAI,QAAA,CAAA,MAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,YACAD,YAAA,8FACAE,SAAA,CAAA,cACAI,QAAA,CAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,qDACAE,SAAA,CAAA,YAAA,kBACAI,QAAA,CAAA,MAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,eACAD,YAAA,qEACAE,SAAA,CAAA,mBAAA,wBAAA,iBAAA,iBAAA,eACAI,QAAA,CAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,eACAE,OAAA,CAAA,YACAD,YAAA,mGACAE,SAAA,CAAA,cACAI,QAAA,CAAA,QAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,eACAE,OAAA,CAAA,UACAD,YAAA,sCACAE,SAAA,CAAA,SAAA,kBAAA,eAAA,cAAA,2BACAI,QAAA,CAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,iDACAE,SAAA,CAAA,aACAI,QAAA,CAAA,OAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,eACAE,OAAA,CAAA,UACAD,YAAA,6DACAE,SAAA,CAAA,SAAA,cACAI,QAAA,CAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,oDACAE,SAAA,CAAA,UAAA,eACAI,QAAA,CAAA,OAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,eACAE,OAAA,CAAA,UACAD,YAAA,4DACAE,SAAA,CAAA,SAAA,cACAI,QAAA,CAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,wEACAE,SAAA,CAAA,UAAA,eACAI,QAAA,CAAA,OAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,eACAE,OAAA,CAAA,UACAD,YAAA,0DACAE,SAAA,CAAA,SAAA,cACAI,QAAA,CAAA,MAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,sEACAE,SAAA,CAAA,UAAA,eACAI,QAAA,CAAA,OAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,eACAE,OAAA,CAAA,UACAD,YAAA,oCACAE,SAAA,CAAA,SAAA,kBAAA,cAAA,cAAA,2BACAI,QAAA,CAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,+CACAE,SAAA,CAAA,aACAI,QAAA,CAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,MACAwvD,SAAA,eACAE,OAAA,CAAA,UACAD,YAAA,uCACAE,SAAA,CAAA,WAAA,sBAAA,cAAA,eACAI,QAAA,CAAA,OAAA,MAAA,kCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,OACAwvD,SAAA,eACAE,OAAA,CAAA,WACAD,YAAA,kDACAE,SAAA,CAAA,YAAA,yBACAI,QAAA,CAAA,OAAA,mCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,KACAwvD,SAAA,QACAE,OAAA,CAAA,YAAA,eACAD,YAAA,8BACAE,SAAA,CAAA,eAAA,aAAA,oBACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,QACAE,OAAA,CAAA,YACAD,YAAA,sFACAE,SAAA,CAAA,aAAA,gBAAA,gBAAA,sBAAA,wBACAI,QAAA,8BCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,QACAE,OAAA,CAAA,gBAAA,4BACAD,YAAA,wCACAE,SAAA,CAAA,cAAA,iBAAA,aAAA,iBACAI,QAAA,CAAA,oCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,kBACAwvD,SAAA,QACAE,OAAA,CAAA,sBACAD,YAAA,0HACAE,SAAA,CAAA,qBAAA,uBAAA,iBAAA,qBAAA,kCAAA,mCAAA,0BAAA,wCACAI,QAAA,CAAA,YAAA,SAAA,aAAA,aAAA,QAAA,wCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,QACAE,OAAA,CAAA,gBACAD,YAAA,6CACAE,SAAA,CAAA,eAAA,iBAAA,2BACAI,QAAA,CAAA,aAAA,YAAA,aAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,QACAwvD,SAAA,QACAE,OAAA,CAAA,YACAD,YAAA,6CACAE,SAAA,CAAA,WAAA,eAAA,aAAA,mBACAI,QAAA,CAAA,aAAA,YAAA,aAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,QACAE,OAAA,CAAA,iBACAD,YAAA,uDACAE,SAAA,CAAA,gBAAA,gBAAA,iBAAA,4BACAI,QAAA,CAAA,YAAA,YAAA,aAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,YACAwvD,SAAA,QACAE,OAAA,CAAA,gBACAD,YAAA,qHACAE,SAAA,CAAA,eAAA,iBAAA,uBAAA,eAAA,4BAAA,6BAAA,oBAAA,kCACAI,QAAA,CAAA,YAAA,SAAA,aAAA,aAAA,QAAA,8CCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,aACAwvD,SAAA,QACAE,OAAA,CAAA,iBACAD,YAAA,sDACAE,SAAA,CAAA,gBAAA,gBAAA,iBAAA,4BACAI,QAAA,CAAA,YAAA,YAAA,aAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,UACAwvD,SAAA,QACAE,OAAA,CAAA,cACAD,YAAA,4EACAE,SAAA,CAAA,aAAA,cAAA,yBACAI,QAAA,CAAA,YAAA,YAAA,aAAA,qCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,QACAE,OAAA,CAAA,aACAD,YAAA,gCACAE,SAAA,CAAA,YAAA,YAAA,aAAA,yBACAI,QAAA,CAAA,YAAA,YAAA,aAAA,yCCRA,aAEAt4D,EAAAJ,QAAA,CACA2I,KAAA,SACAwvD,SAAA,QACAE,OAAA,CAAA,aACAD,YAAA,8BACAE,SAAA,CAAA,cAAA,iBAAA,iBAAA,yBACAI,QAAA,CAAA,gDCRA,aAwbA14D,EAAA2I,KAAA,OACA3I,EAAA2oC,KAAA,aACA3oC,EAAA8vD,QAxbA,SAAAuJ,EAAAtkD,EAAAi+C,EAAAN,GACA,IAAAuC,EAAA,GAkbA,OAhbAA,EAAAqE,UAAAp6D,EAAA,4BACA+1D,EAAA,QAAA/1D,EAAA,0BACA+1D,EAAAsE,QAAAr6D,EAAA,0BACA+1D,EAAAuE,WAAAt6D,EAAA,6BACA+1D,EAAAwE,SAAAv6D,EAAA,2BACA+1D,EAAAt7C,MAAAza,EAAA,wBACA+1D,EAAApC,OAAA3zD,EAAA,yBACA+1D,EAAAnxB,OAAA5kC,EAAA,yBACA+1D,EAAAyE,OAAAx6D,EAAA,yBACA+1D,EAAA0E,UAAAz6D,EAAA,4BACA+1D,EAAA36B,OAAAp7B,EAAA,yBACA+1D,EAAA2E,KAAA16D,EAAA,uBAEA+1D,EAAA71D,EAAAF,EAAA,iBACA+1D,EAAA9uD,EAAAjH,EAAA,iBACA+1D,EAAA,MAAA/1D,EAAA,qBACA+1D,EAAAz1D,EAAAN,EAAA,iBACA+1D,EAAA,EAAA,GAAA/1D,EAAA,wBACA+1D,EAAA4E,IAAA36D,EAAA,mBACA+1D,EAAAhuD,KAAA/H,EAAA,oBACA+1D,EAAA6E,MAAA56D,EAAA,qBACA+1D,EAAA8E,OAAA76D,EAAA,sBACA+1D,EAAA7uD,IAAAlH,EAAA,mBACA+1D,EAAA,KAAA/1D,EAAA,oBACA+1D,EAAAngD,GAAA5V,EAAA,kBACA+1D,EAAA9xD,GAAAjE,EAAA,kBACA+1D,EAAA+E,IAAA96D,EAAA,mBACA+1D,EAAAgF,QAAA/6D,EAAA,uBACA+1D,EAAAiF,MAAAh7D,EAAA,qBACA+1D,EAAAkF,IAAAj7D,EAAA,mBACA+1D,EAAA,KAAA/1D,EAAA,oBACA+1D,EAAA90C,QAAAjhB,EAAA,uBAGA+1D,EAAAmF,aAAA,CACAhC,YAAA,2BACAE,SAAA,CAAA,iBAEArD,EAAAoF,oBAAA,CACAjC,YAAA,oCACAE,SAAA,CAAA,wBAEArD,EAAAqF,eAAA,CACAlC,YAAA,kBACAE,SAAA,CAAA,mBAEArD,EAAAsF,sBAAA,CACAnC,YAAA,0BACAE,SAAA,CAAA,0BAEArD,EAAAuF,iBAAA,CACApC,YAAA,0CACAE,SAAA,CAAA,qBAEArD,EAAAwF,iBAAA,CACArC,YAAA,0CACAE,SAAA,CAAA,qBAEArD,EAAAyF,gBAAA,CACAtC,YAAA,qCACAE,SAAA,CAAA,oBAEArD,EAAA0F,QAAA,CACAvC,YAAA,qBACAE,SAAA,CAAA,YAEArD,EAAA2F,iBAAA,CACAxC,YAAA,oBACAE,SAAA,CAAA,qBAEArD,EAAA4F,aAAA,CACAzC,YAAA,gBACAE,SAAA,CAAA,iBAEArD,EAAA6F,mBAAA,CACA1C,YAAA,sBACAE,SAAA,CAAA,uBAEArD,EAAA8F,0BAAA,CACA3C,YAAA,8BACAE,SAAA,CAAA,8BAGArD,EAAA+F,oBAAA,CACA5C,YAAA,wBACAE,SAAA,CAAA,wBAEArD,EAAAgG,gBAAA,CACA7C,YAAA,mBACAE,SAAA,CAAA,oBAEArD,EAAAiG,SAAA,CACA9C,YAAA,wBACAE,SAAA,CAAA,aAEArD,EAAAkG,WAAA,CACA/C,YAAA,cACAE,SAAA,CAAA,eAEArD,EAAAmG,wBAAA,CACAhD,YAAA,4BACAE,SAAA,CAAA,4BAEArD,EAAAoG,aAAA,CACAjD,YAAA,gBACAE,SAAA,CAAA,iBAEArD,EAAAqG,cAAA,CACAlD,YAAA,0BACAE,SAAA,CAAA,kBAEArD,EAAAsG,cAAA,CACAnD,YAAA,0BACAE,SAAA,CAAA,kBAEArD,EAAAuG,cAAA,CACApD,YAAA,iBACAE,SAAA,CAAA,kBAEArD,EAAAwG,WAAA,CACArD,YAAA,cACAE,SAAA,CAAA,eAEArD,EAAAyG,aAAA,CACAtD,YAAA,gBACAE,SAAA,CAAA,iBAEArD,EAAA0G,YAAA,CACAvD,YAAA,eACAE,SAAA,CAAA,gBAEArD,EAAA2G,qBAAA,CACAxD,YAAA,yBACAE,SAAA,CAAA,yBAEArD,EAAA4G,QAAA,CACAzD,YAAA,mBACAE,SAAA,CAAA,YAEArD,EAAA6G,oBAAA,CACA1D,YAAA,wBACAE,SAAA,CAAA,wBAEArD,EAAA8G,gBAAA,CACA3D,YAAA,oBACAE,SAAA,CAAA,oBAEArD,EAAA+G,aAAA,CACA5D,YAAA,gBACAE,SAAA,CAAA,iBAEArD,EAAAgH,WAAA,CACA7D,YAAA,uBACAE,SAAA,CAAA,eAEArD,EAAAiH,SAAA,CACA9D,YAAA,oBACAE,SAAA,CAAA,aAEArD,EAAAkH,UAAA,CACA/D,YAAA,qBACAE,SAAA,CAAA,cAEArD,EAAAmH,QAAA,CACAhE,YAAA,mBACAE,SAAA,CAAA,YAEArD,EAAAoH,eAAA,CACAjE,YAAA,2BACAE,SAAA,CAAA,mBAEArD,EAAAqH,UAAA,CACAlE,YAAA,qDACAE,SAAA,CAAA,cAEArD,EAAAsH,YAAA,CACAnE,YAAA,eACAE,SAAA,CAAA,gBAEArD,EAAAuH,oBAAA,CACApE,YAAA,wBACAE,SAAA,CAAA,wBAEArD,EAAAwH,YAAA,CACArE,YAAA,+DACAE,SAAA,CAAA,gBAEArD,EAAAyH,cAAA,CACAtE,YAAA,qDACAE,SAAA,CAAA,kBAEArD,EAAA0H,gBAAA,CACAvE,YAAA,4BACAE,SAAA,CAAA,oBAEArD,EAAA2H,gBAAA,CACAxE,YAAA,4BACAE,SAAA,CAAA,oBAEArD,EAAA4H,iBAAA,CACAzE,YAAA,iCACAE,SAAA,CAAA,qBAGArD,EAAA6H,UAAA,CACA1E,YAAA,sBACAE,SAAA,CAAA,cAEArD,EAAA8H,aAAA,CACA3E,YAAA,mCACAE,SAAA,CAAA,iBAEArD,EAAA+H,QAAA,CACA5E,YAAA,iFACAE,SAAA,CAAA,YAEArD,EAAAgI,aAAA,CACA7E,YAAA,gBACAE,SAAA,CAAA,iBAEArD,EAAAiI,WAAA,CACA9E,YAAA,cACAE,SAAA,CAAA,eAEArD,EAAAkI,WAAA,CACA/E,YAAA,cACAE,SAAA,CAAA,eAEArD,EAAAmI,aAAA,CACAhF,YAAA,gBACAE,SAAA,CAAA,iBAEArD,EAAAoI,kBAAA,CACAjF,YAAA,qBACAE,SAAA,CAAA,sBAGArD,EAAAqI,WAAAp+D,EAAA,iCACA+1D,EAAAsI,OAAAr+D,EAAA,6BACA+1D,EAAAuI,IAAAt+D,EAAA,0BACA+1D,EAAAwI,QAAAv+D,EAAA,8BACA+1D,EAAAn6C,SAAA5b,EAAA,+BACA+1D,EAAAyI,YAAAx+D,EAAA,kCACA+1D,EAAA0I,IAAAz+D,EAAA,0BACA+1D,EAAA2I,OAAA1+D,EAAA,6BACA+1D,EAAA4I,GAAA3+D,EAAA,yBAEA+1D,EAAAj0D,IAAA9B,EAAA,6BACA+1D,EAAA1yD,IAAArD,EAAA,6BACA+1D,EAAAtpD,KAAAzM,EAAA,8BACA+1D,EAAA1vD,KAAArG,EAAA,8BACA+1D,EAAA6I,KAAA5+D,EAAA,8BACA+1D,EAAA/oD,OAAAhN,EAAA,gCACA+1D,EAAA8I,UAAA7+D,EAAA,mCACA+1D,EAAA+I,YAAA9+D,EAAA,qCACA+1D,EAAAgJ,OAAA/+D,EAAA,gCACA+1D,EAAAx0D,IAAAvB,EAAA,6BACA+1D,EAAAiJ,KAAAh/D,EAAA,8BACA+1D,EAAAhyD,MAAA/D,EAAA,+BACA+1D,EAAAkJ,IAAAj/D,EAAA,6BACA+1D,EAAAxvD,MAAAvG,EAAA,+BACA+1D,EAAAr6C,IAAA1b,EAAA,6BACA+1D,EAAA1xD,MAAArE,EAAA,+BACA+1D,EAAAp6C,IAAA3b,EAAA,6BACA+1D,EAAA/zD,IAAAhC,EAAA,6BACA+1D,EAAAx/C,KAAAvW,EAAA,8BACA+1D,EAAAmJ,MAAAl/D,EAAA,+BACA+1D,EAAAv/C,MAAAxW,EAAA,+BACA+1D,EAAArlD,IAAA1Q,EAAA,6BACA+1D,EAAA1R,SAAArkD,EAAA,kCACA+1D,EAAAoJ,KAAAn/D,EAAA,8BACA+1D,EAAAqJ,QAAAp/D,EAAA,iCACA+1D,EAAAsJ,SAAAr/D,EAAA,kCACA+1D,EAAAryD,IAAA1D,EAAA,6BACA+1D,EAAAvvD,MAAAxG,EAAA,+BACA+1D,EAAA3yD,KAAApD,EAAA,8BACA+1D,EAAAlyD,KAAA7D,EAAA,8BACA+1D,EAAAuJ,MAAAt/D,EAAA,+BACA+1D,EAAAwJ,OAAAv/D,EAAA,gCACA+1D,EAAA1iD,SAAArT,EAAA,kCACA+1D,EAAAyJ,WAAAx/D,EAAA,oCACA+1D,EAAA0J,UAAAz/D,EAAA,mCACA+1D,EAAA2J,KAAA1/D,EAAA,8BAEA+1D,EAAA4J,OAAA3/D,EAAA,6BACA+1D,EAAA6J,OAAA5/D,EAAA,6BACA+1D,EAAA8J,MAAA7/D,EAAA,4BACA+1D,EAAA+J,OAAA9/D,EAAA,6BACA+1D,EAAAgK,UAAA//D,EAAA,gCACA+1D,EAAAiK,gBAAAhgE,EAAA,sCACA+1D,EAAAkK,cAAAjgE,EAAA,oCAEA+1D,EAAAmK,YAAAlgE,EAAA,wCACA+1D,EAAAoK,QAAAngE,EAAA,oCACA+1D,EAAAqK,YAAApgE,EAAA,wCACA+1D,EAAAsK,WAAArgE,EAAA,uCAEA+1D,EAAA,OAAA/1D,EAAA,iBACA+1D,EAAA,OAAA/1D,EAAA,iBACA+1D,EAAA,MAAA/1D,EAAA,gBAEA+1D,EAAApyD,IAAA3D,EAAA,0BACA+1D,EAAAuK,KAAAtgE,EAAA,2BACA+1D,EAAA1zD,GAAArC,EAAA,yBACA+1D,EAAAzzD,GAAAtC,EAAA,yBAEA+1D,EAAA,KAAA/1D,EAAA,8BACA+1D,EAAAwK,KAAAvgE,EAAA,8BAEA+1D,EAAAyK,SAAAxgE,EAAA,gCACA+1D,EAAA0K,UAAAzgE,EAAA,iCAEA+1D,EAAA,IAAA/1D,EAAA,0BACA+1D,EAAA,IAAA/1D,EAAA,0BACA+1D,EAAA,GAAA/1D,EAAA,yBACA+1D,EAAA,IAAA/1D,EAAA,0BAEA+1D,EAAA,OAAA/1D,EAAA,4BACA+1D,EAAA2K,MAAA1gE,EAAA,2BACA+1D,EAAA4K,WAAA3gE,EAAA,gCACA+1D,EAAA6K,IAAA5gE,EAAA,yBACA+1D,EAAA8K,KAAA7gE,EAAA,0BACA+1D,EAAA+K,IAAA9gE,EAAA,yBACA+1D,EAAAgL,kBAAA/gE,EAAA,uCACA+1D,EAAAzoB,SAAAttC,EAAA,8BACA+1D,EAAArQ,OAAA1lD,EAAA,4BACA+1D,EAAA1b,QAAAr6C,EAAA,6BACA+1D,EAAAv7C,QAAAxa,EAAA,6BACA+1D,EAAAiL,IAAAhhE,EAAA,yBACA+1D,EAAAkL,KAAAjhE,EAAA,0BACA+1D,EAAAz6B,IAAAt7B,EAAA,yBACA+1D,EAAAmL,KAAAlhE,EAAA,0BACA+1D,EAAAoL,gBAAAnhE,EAAA,qCACA+1D,EAAA/R,MAAAhkD,EAAA,2BACA+1D,EAAAqL,OAAAphE,EAAA,4BACA+1D,EAAAsL,QAAArhE,EAAA,6BACA+1D,EAAAx6B,KAAAv7B,EAAA,0BACA+1D,EAAAxmB,KAAAvvC,EAAA,0BACA+1D,EAAAuL,QAAAthE,EAAA,6BACA+1D,EAAAwL,OAAAvhE,EAAA,4BACA+1D,EAAAyL,MAAAxhE,EAAA,2BACA+1D,EAAA0L,UAAAzhE,EAAA,+BACA+1D,EAAA2L,MAAA1hE,EAAA,2BAEA+1D,EAAA4L,aAAA3hE,EAAA,uCAEA+1D,EAAA6L,UAAA5hE,EAAA,oCACA+1D,EAAA8L,MAAA7hE,EAAA,gCACA+1D,EAAA+L,aAAA9hE,EAAA,uCACA+1D,EAAAgM,YAAA/hE,EAAA,sCACA+1D,EAAAiM,aAAAhiE,EAAA,uCACA+1D,EAAAkM,WAAAjiE,EAAA,qCACA+1D,EAAAt/C,OAAAzW,EAAA,iCACA+1D,EAAAmM,UAAAliE,EAAA,oCAEA+1D,EAAA7iD,QAAAlT,EAAA,iCACA+1D,EAAAoM,eAAAniE,EAAA,wCACA+1D,EAAAqM,YAAApiE,EAAA,qCACA+1D,EAAAsM,UAAAriE,EAAA,mCACA+1D,EAAA,MAAA/1D,EAAA,+BACA+1D,EAAAuM,UAAAtiE,EAAA,mCACA+1D,EAAAwM,OAAAviE,EAAA,gCACA+1D,EAAAyM,SAAAxiE,EAAA,kCACA+1D,EAAA0M,QAAAziE,EAAA,iCACA+1D,EAAA2M,UAAA1iE,EAAA,mCACA+1D,EAAA4M,QAAA3iE,EAAA,iCAEA+1D,EAAA6M,aAAA5iE,EAAA,+BACA+1D,EAAA8M,cAAA7iE,EAAA,gCACA+1D,EAAA+M,YAAA9iE,EAAA,8BACA+1D,EAAAgN,aAAA/iE,EAAA,+BACA+1D,EAAAiN,YAAAhjE,EAAA,8BACA+1D,EAAAkN,gBAAAjjE,EAAA,kCACA+1D,EAAAmN,YAAAljE,EAAA,8BACA+1D,EAAAoN,QAAAnjE,EAAA,0BACA+1D,EAAAqN,iBAAApjE,EAAA,mCACA+1D,EAAAsN,SAAArjE,EAAA,2BAEA+1D,EAAAuN,IAAAtjE,EAAA,0BAEA+1D,EAAAwN,IAAAvjE,EAAA,6BACA+1D,EAAA5rD,IAAAnK,EAAA,6BACA+1D,EAAA5K,KAAAnrD,EAAA,8BACA+1D,EAAAyN,OAAAxjE,EAAA,gCACA+1D,EAAA7rD,IAAAlK,EAAA,6BACA+1D,EAAA0N,KAAAzjE,EAAA,8BACA+1D,EAAAviD,KAAAxT,EAAA,8BACA+1D,EAAA2N,YAAA1jE,EAAA,qCACA+1D,EAAA4N,IAAA3jE,EAAA,6BACA+1D,EAAA9gD,IAAAjV,EAAA,6BACA+1D,EAAA,IAAA/1D,EAAA,6BAEA+1D,EAAAlxD,KAAA7E,EAAA,gCACA+1D,EAAAtwD,MAAAzF,EAAA,iCACA+1D,EAAA/wD,KAAAhF,EAAA,gCACA+1D,EAAAhwD,MAAA/F,EAAA,iCACA+1D,EAAA7wD,KAAAlF,EAAA,gCACA+1D,EAAA/vD,MAAAhG,EAAA,iCACA+1D,EAAA9wD,KAAAjF,EAAA,gCACA+1D,EAAA9vD,MAAAjG,EAAA,iCACA+1D,EAAArxD,KAAA1E,EAAA,gCACA+1D,EAAAxwD,MAAAvF,EAAA,iCACA+1D,EAAAjxD,KAAA9E,EAAA,gCACA+1D,EAAArwD,MAAA1F,EAAA,iCACA+1D,EAAA7zD,MAAAlC,EAAA,iCACA+1D,EAAA9zD,IAAAjC,EAAA,+BACA+1D,EAAA30D,KAAApB,EAAA,gCACA+1D,EAAAxxD,IAAAvE,EAAA,+BACA+1D,EAAA3wD,KAAApF,EAAA,gCACA+1D,EAAAtxD,IAAAzE,EAAA,+BACA+1D,EAAA1wD,KAAArF,EAAA,gCACA+1D,EAAAvxD,IAAAxE,EAAA,+BACA+1D,EAAAzwD,KAAAtF,EAAA,gCACA+1D,EAAApzD,IAAA3C,EAAA,+BACA+1D,EAAAv0D,KAAAxB,EAAA,gCACA+1D,EAAAzxD,IAAAtE,EAAA,+BACA+1D,EAAA5wD,KAAAnF,EAAA,gCAEA+1D,EAAAiC,GAAAh4D,EAAA,uBAEA+1D,EAAArvD,MAAA1G,EAAA,0BACA+1D,EAAAwD,OAAAv5D,EAAA,2BACA+1D,EAAA/yD,MAAAhD,EAAA,0BACA+1D,EAAA3mD,UAAApP,EAAA,8BACA+1D,EAAAzmD,WAAAtP,EAAA,+BACA+1D,EAAA6N,UAAA5jE,EAAA,8BACA+1D,EAAA8N,gBAAA7jE,EAAA,oCACA+1D,EAAAxmD,WAAAvP,EAAA,+BACA+1D,EAAA+N,QAAA9jE,EAAA,4BACA+1D,EAAAhvD,OAAA/G,EAAA,2BAEA+1D,EAAA,OAAA/1D,EAAA,2BACA+1D,g9MCrbA,aAEA,IAAAgO,EAAA/jE,EAAA,kCAmDAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAArxD,EAAA2xD,EAAA9zD,EAAA,aAoCA,OAAAwzD,EAAA,UAAA,CACAp4B,OAAA,SAAAi+B,GACA,OAAAl3D,EAAAk3D,GAAAW,WAEAgK,iBAAA,SAAA3K,GACA,OAAA0K,EAAA1K,EAAA,SAAA/2B,GACA,OAAAngC,EAAAmgC,GAAA03B,6FC/CA,aAEA,IAAA+J,EAAA/jE,EAAA,kCA2DAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QA1DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAArxD,EAAA2xD,EAAA9zD,EAAA,aAkCA,OAAAwzD,EAAA,UAAA,CACAp4B,OAAA,SAAAi+B,GAEA,OAAAl3D,EAAAk3D,GAAAW,UAAAV,KADA,KAGA2K,iBAAA,SAAA5K,EAAAS,GACA,OAAA33D,EAAAk3D,GAAAW,UAAAV,KAAAQ,IAEAkK,iBAAA,SAAA3K,GACA,IAAAS,EAAA,GACA,OAAAiK,EAAA1K,EAAA,SAAA/2B,GACA,OAAAngC,EAAAmgC,GAAA03B,UAAAV,KAAAQ,MAGAoK,yBAAA,SAAA7K,EAAAS,GACA,OAAAiK,EAAA1K,EAAA,SAAA/2B,GACA,OAAAngC,EAAAmgC,GAAA03B,UAAAV,KAAAQ,sFCvDA,aAEA,IAAAG,EAAAj6D,EAAA,uBAAAi6D,gBA+DAn5D,EAAAuyD,MAAA,EAEAvyD,EAAA2I,KAAA,OACA3I,EAAA8vD,QAhEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAA0C,EAAAjC,EAAA9zD,EAAA,oBAoBA,OAAAwzD,EAAA,OAAA,CACA2Q,IAAA,SAAA3uD,GACA,IAAAsI,EACArU,EAAA+L,EAEA,GAAA,iBAAAA,EACA,IAAAsI,KAAAu1C,EAEA,GAAAA,EAAAz7C,eAAAkG,IAAAtI,IAAA69C,EAAAv1C,GAAA,CACArU,EAAAqU,EACA,MAmBA,IAAAi7C,EAAAkB,EAAAlE,EAAAtsD,GAEA,IAAAsvD,EACA,MAAA,IAAAp4D,MAAA,8BAAA8I,EAAA,KAGA,OAAA,IAAA8wC,EAAAue,KAAAC,gFC5DA,aAEA73D,EAAAJ,QAAA,CAAAd,EAAA,aAAAA,EAAA,UAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,6GCFA,aAkDAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAArxD,EAAA2xD,EAAA9zD,EAAA,aAyCA,OAAAwzD,EAAA,QAAA,CACA4Q,0BAAAjiE,EACAkiE,kCAAAliE,6CC9CA,aAuDArB,EAAA2I,KAAA,SACA3I,EAAA8vD,QAtDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAwG,EAAA/F,EAAA9zD,EAAA,cA6CA,OAAAwzD,EAAA,SAAA,CACA8Q,GAAA,WACA,OAAA,IAAAzK,EAAAxG,OAOAvyD,EAAAuyD,MAAA,0CCzDA,aAEAnyD,EAAAJ,QAAA,CAEAd,EAAA,kBAAAA,EAAA,cAAAA,EAAA,UAAAA,EAAA,eAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,mJCJA,aAEAkB,EAAAJ,QAAA,CACAswC,KAAA,6BCHA,aAEA,IAAA6oB,EAAAj6D,EAAA,uBAAAi6D,gBAsMAn5D,EAAA2I,KAAA,eACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QAtMA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WACAwkE,EAAA1Q,EAAA9zD,EAAA,mBAWA,SAAAykE,EAAA12C,EAAAtT,GACA,KAAAvX,gBAAAuhE,GACA,MAAA,IAAA/iE,YAAA,oDAGA,IAAA64C,EAAAwc,OAAAhpC,GACA,MAAA,IAAA8O,UAAA,wCAGA,IAAA0d,EAAAgd,YAAA98C,GACA,MAAA,IAAAoiB,UAAA,4CAGA35B,KAAA6qB,OAAAA,GAAA,KACA7qB,KAAAuX,MAAAA,EAEArT,OAAAC,eAAAnE,KAAA,OAAA,CACA6a,IAAA,WACA,OAAA7a,KAAAuX,MACAvX,KAAAuX,MAAAiqD,mBAAAxhE,KAAAuX,MAAAkqD,oBAAA,GAEAzhE,KAAA6qB,OAAAtkB,MAAA,IAEA60C,KAAAp7C,MACAyU,IAAA,WACA,MAAA,IAAAhX,MAAA,kDAsJA,SAAAikE,EAAAC,GAEA,QAAAtqB,EAAAuc,eAAA+N,IAAAtqB,EAAAyc,YAAA6N,IAAAtqB,EAAA6c,eAAAyN,IAAAtqB,EAAA+c,eAAAuN,IAAAtqB,EAAAid,aAAAqN,IAAAtqB,EAAAmd,kBAAAmN,IAAAtqB,EAAAqd,aAAAiN,IAGA,OAtJAJ,EAAAthE,UAAA,IAAAohE,GACAhqB,KAAA,eACAkqB,EAAAthE,UAAA2zD,gBAAA,EAeA2N,EAAAthE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAC,EAAA9hE,KAAA6qB,OAAA+2C,SAAAzR,EAAA0R,GAEAE,EAAA/hE,KAAAuX,MAAAqqD,SAAAzR,EAAA0R,GAEA,GAAA7hE,KAAAuX,MAAAiqD,mBAAA,CACA,IAAA5mD,EAAA5a,KAAAuX,MAAAkqD,oBACA,OAAA,SAAA7K,EAAAhlD,EAAA4nB,GACA,OAAAu9B,EAAA+K,EAAAlL,EAAAhlD,EAAA4nB,GAAA5e,IAGA,OAAA,SAAAg8C,EAAAhlD,EAAA4nB,GACA,IAAA3O,EAAAi3C,EAAAlL,EAAAhlD,EAAA4nB,GACAjiB,EAAAwqD,EAAAnL,EAAAhlD,EAAAiZ,GAEA,OAAAy2C,EAAAz2C,EAAAtT,KAUAgqD,EAAAthE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAA6qB,OAAA,SAAA7qB,MACAqd,EAAArd,KAAAuX,MAAA,QAAAvX,OAUAuhE,EAAAthE,UAAAm4B,IAAA,SAAA/a,GACA,OAAA,IAAAkkD,EAAAvhE,KAAAgiE,QAAA3kD,EAAArd,KAAA6qB,OAAA,SAAA7qB,OAAAA,KAAAgiE,QAAA3kD,EAAArd,KAAAuX,MAAA,QAAAvX,SAQAuhE,EAAAthE,UAAAuD,MAAA,WACA,OAAA,IAAA+9D,EAAAvhE,KAAA6qB,OAAA7qB,KAAAuX,QASAgqD,EAAAthE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAA3wB,EAAA7qB,KAAA6qB,OAAApnB,SAAA+3C,GAMA,OAJAkmB,EAAA1hE,KAAA6qB,UACAA,EAAA,IAAAA,EAAA,KAGAA,EAAA7qB,KAAAuX,MAAA9T,SAAA+3C,IASA+lB,EAAAthE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAA3wB,EAAA7qB,KAAA6qB,OAAAq3C,OAAA1mB,GAMA,OAJAkmB,EAAA1hE,KAAA6qB,UACAA,EAAA,iEAAAA,EAAA,kEAGAA,EAAA7qB,KAAAuX,MAAA2qD,OAAA1mB,IASA+lB,EAAAthE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAA3wB,EAAA7qB,KAAA6qB,OAAAu3C,MAAA5mB,GAMA,OAJAkmB,EAAA1hE,KAAA6qB,UACAA,EAAA,iCAGAA,EAAA7qB,KAAAuX,MAAA6qD,MAAA5mB,IAQA+lB,EAAAthE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,eACA1rC,OAAA7qB,KAAA6qB,OACAtT,MAAAvX,KAAAuX,QAYAgqD,EAAA/K,SAAA,SAAA1D,GACA,OAAA,IAAAyO,EAAAzO,EAAAjoC,OAAAioC,EAAAv7C,QAaAgqD,wFCrMA,aAEA,IAAAnpC,EAAAt7B,EAAA,qBAAAs7B,IA6LAx6B,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA7LA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WAQA,SAAAulE,EAAA1kD,GACA,KAAA3d,gBAAAqiE,GACA,MAAA,IAAA7jE,YAAA,oDAKA,GAFAwB,KAAA2d,MAAAA,GAAA,IAEAR,MAAA2gB,QAAA99B,KAAA2d,SAAA3d,KAAA2d,MAAA4oC,MAAAlP,EAAAwc,QACA,MAAA,IAAAl6B,UAAA,mCAIA,IAAA2oC,EAAA,WACA,MAAA,IAAA7kE,MAAA,4EAGAyG,OAAAC,eAAAnE,KAAA,QAAA,CACA6a,IAAAynD,EACA7tD,IAAA6tD,IA6JA,OAzJAD,EAAApiE,UAAA,IAAAohE,GACAhqB,KAAA,YACAgrB,EAAApiE,UAAA6zD,aAAA,EAeAuO,EAAApiE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAU,EAAAnqC,EAAAp4B,KAAA2d,MAAA,SAAAmzC,GACA,OAAAA,EAAA8Q,SAAAzR,EAAA0R,KAIA,GAFA,UAAA1R,EAAAx9C,SAAA89C,OAUA,OAAA,SAAAmG,EAAAhlD,EAAA4nB,GACA,OAAApB,EAAAmqC,EAAA,SAAAC,GACA,OAAAA,EAAA5L,EAAAhlD,EAAA4nB,MATA,IAAAi3B,EAAAN,EAAAM,OACA,OAAA,SAAAmG,EAAAhlD,EAAA4nB,GACA,OAAAi3B,EAAAr4B,EAAAmqC,EAAA,SAAAC,GACA,OAAAA,EAAA5L,EAAAhlD,EAAA4nB,QAiBA6oC,EAAApiE,UAAAqX,QAAA,SAAA+F,GACA,IAAA,IAAAjgB,EAAA,EAAAA,EAAA4C,KAAA2d,MAAA7f,OAAAV,IAEAigB,EADArd,KAAA2d,MAAAvgB,GACA,SAAAA,EAAA,IAAA4C,OAWAqiE,EAAApiE,UAAAm4B,IAAA,SAAA/a,GAGA,IAFA,IAAAM,EAAA,GAEAvgB,EAAA,EAAAA,EAAA4C,KAAA2d,MAAA7f,OAAAV,IACAugB,EAAAvgB,GAAA4C,KAAAgiE,QAAA3kD,EAAArd,KAAA2d,MAAAvgB,GAAA,SAAAA,EAAA,IAAA4C,OAGA,OAAA,IAAAqiE,EAAA1kD,IAQA0kD,EAAApiE,UAAAuD,MAAA,WACA,OAAA,IAAA6+D,EAAAriE,KAAA2d,MAAA9T,MAAA,KAUAw4D,EAAApiE,UAAAgiE,UAAA,SAAAzmB,GAIA,MAAA,IAHAx7C,KAAA2d,MAAAya,IAAA,SAAAupC,GACA,OAAAA,EAAAl+D,SAAA+3C,KAEA91B,KAAA,MAAA,KAQA28C,EAAApiE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,YACA54C,MAAA3d,KAAA2d,QAYA0kD,EAAA7L,SAAA,SAAA1D,GACA,OAAA,IAAAuP,EAAAvP,EAAAn1C,QAUA0kD,EAAApiE,UAAAiiE,OAAA,SAAA1mB,GAIA,MAAA,kEAHAx7C,KAAA2d,MAAAya,IAAA,SAAAupC,GACA,OAAAA,EAAAO,OAAA1mB,KAEA91B,KAAA,yCAAA,mEASA28C,EAAApiE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAArzC,EAAA,mBAcA,OAbAnI,KAAA2d,MAAArG,QAAA,SAAAqqD,GACAA,EAAAhkD,MACAxV,GAAAw5D,EAAAhkD,MAAAya,IAAA,SAAAqqC,GACA,OAAAA,EAAAL,MAAA5mB,KACA91B,KAAA,KAEAvd,GAAAw5D,EAAAS,MAAA5mB,GAIArzC,GAAA,SAEAA,GAAA,kBAIAk6D,iEC5LA,aAEA,IAAAtL,EAAAj6D,EAAA,uBAAAi6D,gBAEAC,EAAAl6D,EAAA,uBAAAk6D,gBAqTAp5D,EAAA2I,KAAA,iBACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QArTA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WACAqY,EAAAy7C,EAAA9zD,EAAA,mBACAwkE,EAAA1Q,EAAA9zD,EAAA,mBAEA4lE,EAAA5lE,EAAA,gBA6BA,SAAA6lE,EAAA93C,EAAAtT,EAAAnT,GACA,KAAApE,gBAAA2iE,GACA,MAAA,IAAAnkE,YAAA,oDAOA,GAJAwB,KAAA6qB,OAAAA,EACA7qB,KAAAuX,MAAAnT,EAAAmT,EAAA,KACAvX,KAAAoE,MAAAA,GAAAmT,GAEA8/B,EAAAqd,aAAA7pC,KAAAwsB,EAAAuc,eAAA/oC,GACA,MAAA,IAAA8O,UAAA,mDAGA,GAAA0d,EAAAqd,aAAA7pC,IAAA,QAAAA,EAAAtkB,KACA,MAAA,IAAA9I,MAAA,iCAGA,GAAAuC,KAAAuX,QAAA8/B,EAAAgd,YAAAr0D,KAAAuX,OAEA,MAAA,IAAAoiB,UAAA,iCAGA,IAAA0d,EAAAwc,OAAA7zD,KAAAoE,OACA,MAAA,IAAAu1B,UAAA,4BAIAz1B,OAAAC,eAAAnE,KAAA,OAAA,CACA6a,IAAA,WACA,OAAA7a,KAAAuX,MACAvX,KAAAuX,MAAAiqD,mBAAAxhE,KAAAuX,MAAAkqD,oBAAA,GAEAzhE,KAAA6qB,OAAAtkB,MAAA,IAEA60C,KAAAp7C,MACAyU,IAAA,WACA,MAAA,IAAAhX,MAAA,kDAgJA,SAAAikE,EAAAC,EAAAiB,GACAA,IACAA,EAAA,QAGA,IAAAC,EAAAH,EAAAI,cAAAnB,EAAAiB,GACAG,EAAAL,EAAAI,cAAAnB,EAAAv9D,MAAAw+D,GACA,MAAA,QAAAA,GAAA,OAAAG,GAAAA,GAAAF,EAmFA,OArOAF,EAAA1iE,UAAA,IAAAohE,GACAhqB,KAAA,iBACAsrB,EAAA1iE,UAAA8zD,kBAAA,EAeA4O,EAAA1iE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAC,EAAA9hE,KAAA6qB,OAAA+2C,SAAAzR,EAAA0R,GAEAE,EAAA/hE,KAAAuX,MAAAvX,KAAAuX,MAAAqqD,SAAAzR,EAAA0R,GAAA,KAEAmB,EAAAhjE,KAAAoE,MAAAw9D,SAAAzR,EAAA0R,GAEAt7D,EAAAvG,KAAA6qB,OAAAtkB,KAEA,GAAAvG,KAAAuX,MASA,CAAA,GAAAvX,KAAAuX,MAAAiqD,mBAAA,CAEA,IAAA5mD,EAAA5a,KAAAuX,MAAAkqD,oBACA,OAAA,SAAA7K,EAAAhlD,EAAA4nB,GACA,IAAA3O,EAAAi3C,EAAAlL,EAAAhlD,EAAA4nB,GACAp1B,EAAA4+D,EAAApM,EAAAhlD,EAAA4nB,GACA,OAAAw9B,EAAAnsC,EAAAjQ,EAAAxW,IAEA,GAAAizC,EAAAqd,aAAA10D,KAAA6qB,QAEA,OAAA,SAAA+rC,EAAAhlD,EAAA4nB,GACA,IAAAypC,EAAAnB,EAAAlL,EAAAhlD,EAAA4nB,GACAp1B,EAAA4+D,EAAApM,EAAAhlD,EAAA4nB,GACAjiB,EAAAwqD,EAAAnL,EAAAhlD,EAAAqxD,GAGA,OADAjM,EAAAJ,EAAArwD,EAAA4O,EAAA8tD,EAAA1rD,EAAAnT,IACAA,GAQA,IAAA8+D,EAAAljE,KAAA6qB,OAAAA,OAAA+2C,SAAAzR,EAAA0R,GAEA,GAAA7hE,KAAA6qB,OAAAtT,MAAAiqD,mBAAA,CACA,IAAA2B,EAAAnjE,KAAA6qB,OAAAtT,MAAAkqD,oBACA,OAAA,SAAA7K,EAAAhlD,EAAA4nB,GACA,IAAAsO,EAAAo7B,EAAAtM,EAAAhlD,EAAA4nB,GACAypC,EAAAlM,EAAAjvB,EAAAq7B,GACA5rD,EAAAwqD,EAAAnL,EAAAhlD,EAAAqxD,GAEA7+D,EAAA4+D,EAAApM,EAAAhlD,EAAA4nB,GAEA,OADAw9B,EAAAlvB,EAAAq7B,EAAAhuD,EAAA8tD,EAAA1rD,EAAAnT,IACAA,GAIA,IAAAg/D,EAAApjE,KAAA6qB,OAAAtT,MAAAqqD,SAAAzR,EAAA0R,GAEA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GACA,IAAAsO,EAAAo7B,EAAAtM,EAAAhlD,EAAA4nB,GACA6pC,EAAAD,EAAAxM,EAAAhlD,EAAAk2B,GAEAm7B,EAAA3B,EAAAx5B,EAAAu7B,GACA9rD,EAAAwqD,EAAAnL,EAAAhlD,EAAAqxD,GAEA7+D,EAAA4+D,EAAApM,EAAAhlD,EAAA4nB,GAEA,OADArkB,EAAA2yB,EAAAu7B,EAAAluD,EAAA8tD,EAAA1rD,EAAAnT,IACAA,GAzDA,IAAAizC,EAAAqd,aAAA10D,KAAA6qB,QACA,MAAA,IAAA8O,UAAA,iCAGA,OAAA,SAAAi9B,EAAAhlD,EAAA4nB,GACA,OAAAw9B,EAAAJ,EAAArwD,EAAAy8D,EAAApM,EAAAhlD,EAAA4nB,MA+DAmpC,EAAA1iE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAA6qB,OAAA,SAAA7qB,MAEAA,KAAAuX,OACA8F,EAAArd,KAAAuX,MAAA,QAAAvX,MAGAqd,EAAArd,KAAAoE,MAAA,QAAApE,OAUA2iE,EAAA1iE,UAAAm4B,IAAA,SAAA/a,GAOA,OAAA,IAAAslD,EANA3iE,KAAAgiE,QAAA3kD,EAAArd,KAAA6qB,OAAA,SAAA7qB,OAEAA,KAAAuX,MAAAvX,KAAAgiE,QAAA3kD,EAAArd,KAAAuX,MAAA,QAAAvX,OAAA,KAEAA,KAAAgiE,QAAA3kD,EAAArd,KAAAoE,MAAA,QAAApE,SAUA2iE,EAAA1iE,UAAAuD,MAAA,WACA,OAAA,IAAAm/D,EAAA3iE,KAAA6qB,OAAA7qB,KAAAuX,MAAAvX,KAAAoE,QA0BAu+D,EAAA1iE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAA3wB,EAAA7qB,KAAA6qB,OAAApnB,SAAA+3C,GACAjkC,EAAAvX,KAAAuX,MAAAvX,KAAAuX,MAAA9T,SAAA+3C,GAAA,GACAp3C,EAAApE,KAAAoE,MAAAX,SAAA+3C,GAMA,OAJAkmB,EAAA1hE,KAAAw7C,GAAAA,EAAAonB,eACAx+D,EAAA,IAAAA,EAAA,KAGAymB,EAAAtT,EAAA,MAAAnT,GAQAu+D,EAAA1iE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,iBACA1rC,OAAA7qB,KAAA6qB,OACAtT,MAAAvX,KAAAuX,MACAnT,MAAApE,KAAAoE,QAYAu+D,EAAAnM,SAAA,SAAA1D,GACA,OAAA,IAAA6P,EAAA7P,EAAAjoC,OAAAioC,EAAAv7C,MAAAu7C,EAAA1uD,QASAu+D,EAAA1iE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAA3wB,EAAA7qB,KAAA6qB,OAAAq3C,OAAA1mB,GACAjkC,EAAAvX,KAAAuX,MAAAvX,KAAAuX,MAAA2qD,OAAA1mB,GAAA,GACAp3C,EAAApE,KAAAoE,MAAA89D,OAAA1mB,GAMA,OAJAkmB,EAAA1hE,KAAAw7C,GAAAA,EAAAonB,eACAx+D,EAAA,iEAAAA,EAAA,kEAGAymB,EAAAtT,EAAA,uHAAAnT,GASAu+D,EAAA1iE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAA3wB,EAAA7qB,KAAA6qB,OAAAu3C,MAAA5mB,GACAjkC,EAAAvX,KAAAuX,MAAAvX,KAAAuX,MAAA6qD,MAAA5mB,GAAA,GACAp3C,EAAApE,KAAAoE,MAAAg+D,MAAA5mB,GAMA,OAJAkmB,EAAA1hE,KAAAw7C,GAAAA,EAAAonB,eACAx+D,EAAA,UAAAw9C,OAAAx9C,EAAA,aAGAymB,EAAAtT,EAAA,KAAAnT,GAGAu+D,gICtTA,aAEA,IAAArrD,EAAAxa,EAAA,qBAAAwa,QAEA8gB,EAAAt7B,EAAA,qBAAAs7B,IA0LAx6B,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA1LA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WACAwmE,EAAA1S,EAAA9zD,EAAA,mCAWA,SAAAymE,EAAAC,GACA,KAAAxjE,gBAAAujE,GACA,MAAA,IAAA/kE,YAAA,oDAIA,IAAA2e,MAAA2gB,QAAA0lC,GAAA,MAAA,IAAA/lE,MAAA,kBACAuC,KAAAwjE,OAAAA,EAAAprC,IAAA,SAAAqrC,GACA,IAAA9B,EAAA8B,GAAAA,EAAA9B,KACA+B,GAAAD,QAAApkE,IAAAokE,EAAAC,SAAAD,EAAAC,QACA,IAAArsB,EAAAwc,OAAA8N,GAAA,MAAA,IAAAhoC,UAAA,kCACA,GAAA,kBAAA+pC,EAAA,MAAA,IAAA/pC,UAAA,wCACA,MAAA,CACAgoC,KAAAA,EACA+B,QAAAA,KA0JA,OArJAH,EAAAtjE,UAAA,IAAAohE,GACAhqB,KAAA,YACAksB,EAAAtjE,UAAA+zD,aAAA,EAeAuP,EAAAtjE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAA8B,EAAAvrC,EAAAp4B,KAAAwjE,OAAA,SAAAC,GACA,MAAA,CACArN,KAAAqN,EAAA9B,KAAAC,SAAAzR,EAAA0R,GACA6B,QAAAD,EAAAC,WAGA,OAAA,SAAA9M,EAAAhlD,EAAA4nB,GACA,IAAAoqC,EAAA,GAQA,OAPAtsD,EAAAqsD,EAAA,SAAAF,GACA,IAAAzsD,EAAAysD,EAAArN,KAAAQ,EAAAhlD,EAAA4nB,GAEAiqC,EAAAC,SACAE,EAAAx2D,KAAA4J,KAGA,IAAAssD,EAAAM,KASAL,EAAAtjE,UAAAqX,QAAA,SAAA+F,GACA,IAAA,IAAAjgB,EAAA,EAAAA,EAAA4C,KAAAwjE,OAAA1lE,OAAAV,IACAigB,EAAArd,KAAAwjE,OAAApmE,GAAAukE,KAAA,UAAAvkE,EAAA,SAAA4C,OAWAujE,EAAAtjE,UAAAm4B,IAAA,SAAA/a,GAGA,IAFA,IAAAmmD,EAAA,GAEApmE,EAAA,EAAAA,EAAA4C,KAAAwjE,OAAA1lE,OAAAV,IAAA,CACA,IAAAqmE,EAAAzjE,KAAAwjE,OAAApmE,GAEAukE,EAAA3hE,KAAAgiE,QAAA3kD,EAAAomD,EAAA9B,KAAA,UAAAvkE,EAAA,SAAA4C,OAEAwjE,EAAApmE,GAAA,CACAukE,KAAAA,EACA+B,QAAAD,EAAAC,SAIA,OAAA,IAAAH,EAAAC,IAQAD,EAAAtjE,UAAAuD,MAAA,WAOA,OAAA,IAAA+/D,EANAvjE,KAAAwjE,OAAAprC,IAAA,SAAAqrC,GACA,MAAA,CACA9B,KAAA8B,EAAA9B,KACA+B,QAAAD,EAAAC,aAaAH,EAAAtjE,UAAAgiE,UAAA,SAAAzmB,GACA,OAAAx7C,KAAAwjE,OAAAprC,IAAA,SAAAyrC,GACA,OAAAA,EAAAlC,KAAAl+D,SAAA+3C,IAAAqoB,EAAAH,QAAA,GAAA,OACAh+C,KAAA,OAQA69C,EAAAtjE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,YACAiN,OAAAxjE,KAAAwjE,SAYAD,EAAA/M,SAAA,SAAA1D,GACA,OAAA,IAAAyQ,EAAAzQ,EAAA0Q,SAUAD,EAAAtjE,UAAAiiE,OAAA,SAAA1mB,GACA,OAAAx7C,KAAAwjE,OAAAprC,IAAA,SAAAyrC,GACA,OAAAA,EAAAlC,KAAAO,OAAA1mB,IAAAqoB,EAAAH,QAAA,GAAA,2CACAh+C,KAAA,+CASA69C,EAAAtjE,UAAAkiE,OAAA,SAAA3mB,GACA,OAAAx7C,KAAAwjE,OAAAprC,IAAA,SAAAyrC,GACA,OAAAA,EAAAlC,KAAAS,MAAA5mB,IAAAqoB,EAAAH,QAAA,GAAA,OACAh+C,KAAA,aAGA69C,sGC3LA,aAEA,IAAAb,EAAA5lE,EAAA,gBA0OAc,EAAA2I,KAAA,kBACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA1OA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WACAgnE,EAAAlT,EAAA9zD,EAAA,gCAYA,SAAAinE,EAAAC,EAAAC,EAAAC,GACA,KAAAlkE,gBAAA+jE,GACA,MAAA,IAAAvlE,YAAA,oDAGA,IAAA64C,EAAAwc,OAAAmQ,GAAA,MAAA,IAAArqC,UAAA,sCACA,IAAA0d,EAAAwc,OAAAoQ,GAAA,MAAA,IAAAtqC,UAAA,qCACA,IAAA0d,EAAAwc,OAAAqQ,GAAA,MAAA,IAAAvqC,UAAA,sCACA35B,KAAAgkE,UAAAA,EACAhkE,KAAAikE,SAAAA,EACAjkE,KAAAkkE,UAAAA,EA6MA,OA1MAH,EAAA9jE,UAAA,IAAAohE,GACAhqB,KAAA,kBACA0sB,EAAA9jE,UAAAg0D,mBAAA,EAeA8P,EAAA9jE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAsC,EAAAnkE,KAAAgkE,UAAApC,SAAAzR,EAAA0R,GAEAuC,EAAApkE,KAAAikE,SAAArC,SAAAzR,EAAA0R,GAEAwC,EAAArkE,KAAAkkE,UAAAtC,SAAAzR,EAAA0R,GAEA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GACA,OAuJA,SAAAwqC,GACA,GAAA,iBAAAA,GAAA,kBAAAA,GAAA,iBAAAA,EACA,QAAAA,EAGA,GAAAA,EAAA,CACA,GAAA3sB,EAAA6b,YAAA8Q,GACA,OAAAA,EAAAngE,SAGA,GAAAwzC,EAAA4b,UAAA+Q,GACA,SAAAA,EAAA7kE,KAAA6kE,EAAA5kE,IAGA,GAAAi4C,EAAA2b,OAAAgR,GACA,QAAAA,EAAA5/D,MAIA,GAAA4/D,MAAAA,EAIA,MAAA,IAAArqC,UAAA,kCAAAmqC,EAAAE,GAAA,KAHA,OAAA,EA3KAM,CAAAH,EAAAvN,EAAAhlD,EAAA4nB,IAAA4qC,EAAAxN,EAAAhlD,EAAA4nB,GAAA6qC,EAAAzN,EAAAhlD,EAAA4nB,KASAuqC,EAAA9jE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAAgkE,UAAA,YAAAhkE,MACAqd,EAAArd,KAAAikE,SAAA,WAAAjkE,MACAqd,EAAArd,KAAAkkE,UAAA,YAAAlkE,OAUA+jE,EAAA9jE,UAAAm4B,IAAA,SAAA/a,GACA,OAAA,IAAA0mD,EAAA/jE,KAAAgiE,QAAA3kD,EAAArd,KAAAgkE,UAAA,YAAAhkE,OAAAA,KAAAgiE,QAAA3kD,EAAArd,KAAAikE,SAAA,WAAAjkE,OAAAA,KAAAgiE,QAAA3kD,EAAArd,KAAAkkE,UAAA,YAAAlkE,SAQA+jE,EAAA9jE,UAAAuD,MAAA,WACA,OAAA,IAAAugE,EAAA/jE,KAAAgkE,UAAAhkE,KAAAikE,SAAAjkE,KAAAkkE,YASAH,EAAA9jE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAC,EAAAH,EAAAI,cAAA9iE,KAAA4iE,GAKAoB,EAAAhkE,KAAAgkE,UAAAvgE,SAAA+3C,GACA+oB,EAAA7B,EAAAI,cAAA9iE,KAAAgkE,UAAApB,IAEA,QAAAA,GAAA,iBAAA5iE,KAAAgkE,UAAA3sB,MAAA,OAAAktB,GAAAA,GAAA1B,KACAmB,EAAA,IAAAA,EAAA,KAGA,IAAAC,EAAAjkE,KAAAikE,SAAAxgE,SAAA+3C,GACAgpB,EAAA9B,EAAAI,cAAA9iE,KAAAikE,SAAArB,IAEA,QAAAA,GAAA,iBAAA5iE,KAAAikE,SAAA5sB,MAAA,OAAAmtB,GAAAA,GAAA3B,KACAoB,EAAA,IAAAA,EAAA,KAGA,IAAAC,EAAAlkE,KAAAkkE,UAAAzgE,SAAA+3C,GACAipB,EAAA/B,EAAAI,cAAA9iE,KAAAkkE,UAAAtB,GAMA,OAJA,QAAAA,GAAA,iBAAA5iE,KAAAkkE,UAAA7sB,MAAA,OAAAotB,GAAAA,GAAA5B,KACAqB,EAAA,IAAAA,EAAA,KAGAF,EAAA,MAAAC,EAAA,MAAAC,GAQAH,EAAA9jE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,kBACAyN,UAAAhkE,KAAAgkE,UACAC,SAAAjkE,KAAAikE,SACAC,UAAAlkE,KAAAkkE,YAYAH,EAAAvN,SAAA,SAAA1D,GACA,OAAA,IAAAiR,EAAAjR,EAAAkR,UAAAlR,EAAAmR,SAAAnR,EAAAoR,YASAH,EAAA9jE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAC,EAAAH,EAAAI,cAAA9iE,KAAA4iE,GAKAoB,EAAAhkE,KAAAgkE,UAAA9B,OAAA1mB,GACA+oB,EAAA7B,EAAAI,cAAA9iE,KAAAgkE,UAAApB,IAEA,QAAAA,GAAA,iBAAA5iE,KAAAgkE,UAAA3sB,MAAA,OAAAktB,GAAAA,GAAA1B,KACAmB,EAAA,iEAAAA,EAAA,kEAGA,IAAAC,EAAAjkE,KAAAikE,SAAA/B,OAAA1mB,GACAgpB,EAAA9B,EAAAI,cAAA9iE,KAAAikE,SAAArB,IAEA,QAAAA,GAAA,iBAAA5iE,KAAAikE,SAAA5sB,MAAA,OAAAmtB,GAAAA,GAAA3B,KACAoB,EAAA,iEAAAA,EAAA,kEAGA,IAAAC,EAAAlkE,KAAAkkE,UAAAhC,OAAA1mB,GACAipB,EAAA/B,EAAAI,cAAA9iE,KAAAkkE,UAAAtB,GAMA,OAJA,QAAAA,GAAA,iBAAA5iE,KAAAkkE,UAAA7sB,MAAA,OAAAotB,GAAAA,GAAA5B,KACAqB,EAAA,iEAAAA,EAAA,kEAGAF,EAAA,iEAAAC,EAAA,iEAAAC,GASAH,EAAA9jE,UAAAkiE,OAAA,SAAA3mB,GACA,MAAA,mBAAAx7C,KAAAikE,SAAA7B,MAAA5mB,GAAA,4BAAAx7C,KAAAgkE,UAAA5B,MAAA5mB,GAAA,SAAAx7C,KAAAkkE,UAAA9B,MAAA5mB,GAAA,6CAmCAuoB,8FCzOA,aAEA,IAAA1N,EAAAv5D,EAAA,sBAAAu5D,OAEAqO,EAAA5nE,EAAA,qBAAA8nC,OAuLAhnC,EAAA2I,KAAA,eACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QAvLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WACA6nE,EAAA/T,EAAA9zD,EAAA,gCAcA,SAAA8nE,EAAAxgE,GACA,KAAApE,gBAAA4kE,GACA,MAAA,IAAApmE,YAAA,oDAGA,GAAA,IAAA2U,UAAArV,OAEA,MAAA,IAAAU,YAAA,kKAGAwB,KAAAoE,MAAAA,EAwJA,OArJAwgE,EAAA3kE,UAAA,IAAAohE,GACAhqB,KAAA,eACAutB,EAAA3kE,UAAAi0D,gBAAA,EAeA0Q,EAAA3kE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAz9D,EAAApE,KAAAoE,MACA,OAAA,WACA,OAAAA,IASAwgE,EAAA3kE,UAAAqX,QAAA,SAAA+F,KAUAunD,EAAA3kE,UAAAm4B,IAAA,SAAA/a,GACA,OAAArd,KAAAwD,SAQAohE,EAAA3kE,UAAAuD,MAAA,WACA,OAAA,IAAAohE,EAAA5kE,KAAAoE,QASAwgE,EAAA3kE,UAAAgiE,UAAA,SAAAzmB,GACA,OAAA6a,EAAAr2D,KAAAoE,MAAAo3C,IASAopB,EAAA3kE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAAp3C,EAAApE,KAAAiiE,UAAAzmB,GAEA,OAAAmpB,EAAA3kE,KAAAoE,QACA,IAAA,SACA,IAAA,YACA,IAAA,WACA,MAAA,6BAAAA,EAAA,UAEA,IAAA,SACA,MAAA,6BAAAA,EAAA,UAEA,IAAA,UACA,MAAA,8BAAAA,EAAA,UAEA,IAAA,OACA,MAAA,kCAAAA,EAAA,UAEA,IAAA,YACA,MAAA,gCAAAA,EAAA,UAEA,QACA,MAAA,6BAAAA,EAAA,YASAwgE,EAAA3kE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,eACAnyD,MAAApE,KAAAoE,QAYAwgE,EAAApO,SAAA,SAAA1D,GACA,OAAA,IAAA8R,EAAA9R,EAAA1uD,QASAwgE,EAAA3kE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAAp3C,EAAApE,KAAAiiE,UAAAzmB,GAEA,OAAAmpB,EAAA3kE,KAAAoE,QACA,IAAA,SACA,MAAA,YAAAsgE,EAAAtgE,GAAA,IAEA,IAAA,SACA,IAAA,YACA,IAAAmT,EAAAnT,EAAAyP,cAAA/L,QAAA,KAEA,OAAA,IAAAyP,EACAnT,EAAAmO,UAAA,EAAAgF,GAAA,aAAAnT,EAAAmO,UAAAgF,EAAA,GAAA,IAGAnT,EAEA,IAAA,WACA,OAAApE,KAAAoE,MAAA6U,UAEA,QACA,OAAA7U,IAIAwgE,4HCxLA,aAEA,IAAAC,EAAA/nE,EAAA,eAEA8nC,EAAA9nC,EAAA,sBAAA8nC,OAEAttB,EAAAxa,EAAA,qBAAAwa,QAEAoO,EAAA5oB,EAAA,qBAAA4oB,KAEAo/C,EAAAhoE,EAAA,qBAEA4lE,EAAA5lE,EAAA,gBAEAk6D,EAAAl6D,EAAA,uBAAAk6D,gBA8NAp5D,EAAA2I,KAAA,yBACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA9NA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WAcA,SAAAioE,EAAAx+D,EAAAy+D,EAAA7O,GACA,KAAAn2D,gBAAA+kE,GACA,MAAA,IAAAvmE,YAAA,oDAIA,GAAA,iBAAA+H,EAAA,MAAA,IAAAozB,UAAA,wCACA,IAAAxc,MAAA2gB,QAAAknC,GAAA,MAAA,IAAArrC,UAAA,uEACA,IAAA0d,EAAAwc,OAAAsC,GAAA,MAAA,IAAAx8B,UAAA,sCACA,GAAApzB,KAAAs+D,EAAA,MAAA,IAAApnE,MAAA,2BAAA8I,EAAA,2BACAvG,KAAAuG,KAAAA,EACAvG,KAAAglE,OAAAA,EAAA5sC,IAAA,SAAAyrC,GACA,OAAAA,GAAAA,EAAAt9D,MAAAs9D,IAEA7jE,KAAAynB,MAAAu9C,EAAA5sC,IAAA,SAAAyrC,GACA,OAAAA,GAAAA,EAAAxsB,MAAA,QAEAr3C,KAAAm2D,KAAAA,EA0FA,SAAAuL,EAAAC,EAAAiB,GACA,IAAAC,EAAAH,EAAAI,cAAAnB,EAAAiB,GACAG,EAAAL,EAAAI,cAAAnB,EAAAxL,KAAAyM,GACA,MAAA,QAAAA,GAAA,OAAAG,GAAAA,GAAAF,EA4FA,OAtLAkC,EAAA9kE,UAAA,IAAAohE,GACAhqB,KAAA,yBACA0tB,EAAA9kE,UAAAk0D,0BAAA,EAeA4Q,EAAA9kE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAoD,EAAA/gE,OAAA62B,OAAA8mC,GACAvqD,EAAAtX,KAAAglE,OAAA,SAAAnB,GACAoB,EAAApB,IAAA,IAGA,IAAAqB,EAAAllE,KAAAm2D,KAAAyL,SAAAzR,EAAA8U,GAEA1+D,EAAAvG,KAAAuG,KACAy+D,EAAAhlE,KAAAglE,OACAG,EAAAz/C,EAAA1lB,KAAAynB,MAAA,KACAwuC,EAAA1vD,EAAA,IAAAmf,EAAA1lB,KAAAglE,OAAA,MAAA,IACA,OAAA,SAAApO,EAAAhlD,EAAA4nB,GACA,IAAA04B,EAAA,GAEAA,EAAAiT,GAAA,WAGA,IAFA,IAAAC,EAAAlhE,OAAA62B,OAAAnpB,GAEAxU,EAAA,EAAAA,EAAA4nE,EAAAlnE,OAAAV,IACAgoE,EAAAJ,EAAA5nE,IAAA+V,UAAA/V,GAGA,OAAA8nE,EAAAtO,EAAAwO,EAAA5rC,IAGA,IAAA+a,EAAA+b,EAAA/pD,EAAA2rD,GAGA,OAFA3d,EAAA0hB,OAAAA,EACAe,EAAAJ,EAAArwD,EAAAguC,GACAA,IASAwwB,EAAA9kE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAAm2D,KAAA,OAAAn2D,OAUA+kE,EAAA9kE,UAAAm4B,IAAA,SAAA/a,GACA,IAAA84C,EAAAn2D,KAAAgiE,QAAA3kD,EAAArd,KAAAm2D,KAAA,OAAAn2D,OAEA,OAAA,IAAA+kE,EAAA/kE,KAAAuG,KAAAvG,KAAAglE,OAAAn7D,MAAA,GAAAssD,IAQA4O,EAAA9kE,UAAAuD,MAAA,WACA,OAAA,IAAAuhE,EAAA/kE,KAAAuG,KAAAvG,KAAAglE,OAAAn7D,MAAA,GAAA7J,KAAAm2D,OAsBA4O,EAAA9kE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAzM,EAAAn2D,KAAAm2D,KAAA1yD,SAAA+3C,GAMA,OAJAkmB,EAAA1hE,KAAA4iE,KACAzM,EAAA,IAAAA,EAAA,KAGAn2D,KAAAuG,KAAA,IAAAvG,KAAAglE,OAAAt/C,KAAA,MAAA,OAAAywC,GAQA4O,EAAA9kE,UAAA6P,OAAA,WACA,IAAA2X,EAAAznB,KAAAynB,MACA,MAAA,CACA8uC,OAAA,yBACAhwD,KAAAvG,KAAAuG,KACAy+D,OAAAhlE,KAAAglE,OAAA5sC,IAAA,SAAAyrC,EAAAtsD,GACA,MAAA,CACAhR,KAAAs9D,EACAxsB,KAAA5vB,EAAAlQ,MAGA4+C,KAAAn2D,KAAAm2D,OAYA4O,EAAAvO,SAAA,SAAA1D,GACA,OAAA,IAAAiS,EAAAjS,EAAAvsD,KAAAusD,EAAAkS,OAAAlS,EAAAqD,OASA4O,EAAA9kE,UAAAiiE,OAAA,SAAA1mB,GAIA,IAHA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAoC,EAAA,GAEA5nE,EAAA,EAAAA,EAAA4C,KAAAglE,OAAAlnE,OAAAV,IACA4nE,EAAA53D,KAAA,4CAAAw3B,EAAA5kC,KAAAglE,OAAA5nE,IAAA,WAGA,IAAA+4D,EAAAn2D,KAAAm2D,KAAA+L,OAAA1mB,GAMA,OAJAkmB,EAAA1hE,KAAA4iE,KACAzM,EAAA,iEAAAA,EAAA,kEAGA,+BAAAvxB,EAAA5kC,KAAAuG,MAAA,wEAAAy+D,EAAAt/C,KAAA,yCAAA,qLAAAywC,GASA4O,EAAA9kE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAzM,EAAAn2D,KAAAm2D,KAAAiM,MAAA5mB,GAMA,OAJAkmB,EAAA1hE,KAAA4iE,KACAzM,EAAA,UAAAvU,OAAAuU,EAAA,aAGA,YAAAn2D,KAAAuG,KAAA,WAAAvG,KAAAglE,OAAA5sC,IAAA0sC,EAAAO,UAAA3/C,KAAA,KAAA,aAAAywC,GAGA4O,iLCzOA,aAEA,SAAArT,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,SAAAsC,IAAA,OAAAA,EAAAhR,OAAAiR,QAAA,SAAAC,GAAA,IAAA,IAAAhY,EAAA,EAAAA,EAAA+V,UAAArV,OAAAV,IAAA,CAAA,IAAAiY,EAAAlC,UAAA/V,GAAA,IAAA,IAAAkY,KAAAD,EAAAnR,OAAAjE,UAAAyU,eAAA7W,KAAAwX,EAAAC,KAAAF,EAAAE,GAAAD,EAAAC,IAAA,OAAAF,IAAAsC,MAAA1X,KAAAmT,WAEA,IAAA2xD,EAAAhoE,EAAA,qBAEA8nC,EAAA9nC,EAAA,sBAAA8nC,OAEAlwB,EAAA5X,EAAA,sBAAA4X,eAEA0jB,EAAAt7B,EAAA,qBAAAs7B,IAEAktC,EAAAxoE,EAAA,uBAAAwoE,mBAEAvO,EAAAj6D,EAAA,uBAAAi6D,gBAmcAn5D,EAAA2I,KAAA,eACA3I,EAAA2oC,KAAA,kBACA3oC,EAAAuyD,MAAA,EAEAvyD,EAAA8vD,QArcA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAkR,EAAAzQ,EAAA9zD,EAAA,WACAyoE,EAAA3U,EAAA9zD,EAAA,iBAUA,SAAA0oE,EAAAjxB,EAAA3iC,GACA,KAAA5R,gBAAAwlE,GACA,MAAA,IAAAhnE,YAAA,oDAQA,GALA,iBAAA+1C,IACAA,EAAA,IAAAgxB,EAAAhxB,KAIA8C,EAAAwc,OAAAtf,GAAA,MAAA,IAAA5a,UAAA,mCAEA,IAAAxc,MAAA2gB,QAAAlsB,KAAAA,EAAA20C,MAAAlP,EAAAwc,QACA,MAAA,IAAAl6B,UAAA,wDAGA35B,KAAAu0C,GAAAA,EACAv0C,KAAA4R,KAAAA,GAAA,GAEA1N,OAAAC,eAAAnE,KAAA,OAAA,CACA6a,IAAA,WACA,OAAA7a,KAAAu0C,GAAAhuC,MAAA,IACA60C,KAAAp7C,MACAyU,IAAA,WACA,MAAA,IAAAhX,MAAA,kDAIA,IAAA6kE,EAAA,WACA,MAAA,IAAA7kE,MAAA,gFAGAyG,OAAAC,eAAAnE,KAAA,SAAA,CACA6a,IAAAynD,EACA7tD,IAAA6tD,KAIAkD,EAAAvlE,UAAA,IAAAohE,GACAhqB,KAAA,eACAmuB,EAAAvlE,UAAAm0D,gBAAA,EAeAoR,EAAAvlE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,KAAA7hE,gBAAAwlE,GACA,MAAA,IAAA7rC,UAAA,yBAIA,IAAA8rC,EAAArtC,EAAAp4B,KAAA4R,KAAA,SAAAnR,GACA,OAAAA,EAAAmhE,SAAAzR,EAAA0R,KAGA,GAAAxqB,EAAAqd,aAAA10D,KAAAu0C,IAAA,CAEA,IAAAhuC,EAAAvG,KAAAu0C,GAAAhuC,KACAguC,EAAAhuC,KAAA4pD,EAAA4G,EAAA5G,EAAA5pD,QAAAlH,EAGA,GAFA,mBAAAk1C,IAAA,IAAAA,EAAAmxB,QAEA,CAGA,IAAAA,EAAA1lE,KAAA4R,KACA,OAAA,SAAAglD,EAAAhlD,EAAA4nB,GACA,OAAAjzB,KAAAqwD,EAAAG,EAAAH,EAAArwD,GAAAguC,GAAAmxB,EAAAvV,EAAAj7C,EAAA,GAAA0hD,EAAAhlD,KAIA,GAAA,IAAA6zD,EAAA3nE,OAAA,CACA,IAAA6nE,EAAAF,EAAA,GACA,OAAA,SAAA7O,EAAAhlD,EAAA4nB,GACA,OAAAjzB,KAAAqwD,EAAAG,EAAAH,EAAArwD,GAAAguC,GAAAoxB,EAAA/O,EAAAhlD,EAAA4nB,KAEA,GAAA,IAAAisC,EAAA3nE,OAOA,OAAA,SAAA84D,EAAAhlD,EAAA4nB,GACA,OAAAjzB,KAAAqwD,EAAAG,EAAAH,EAAArwD,GAAAguC,GAAA78B,MAAA,KAAA0gB,EAAAqtC,EAAA,SAAAG,GACA,OAAAA,EAAAhP,EAAAhlD,EAAA4nB,OARA,IAAAqsC,EAAAJ,EAAA,GACAK,EAAAL,EAAA,GACA,OAAA,SAAA7O,EAAAhlD,EAAA4nB,GACA,OAAAjzB,KAAAqwD,EAAAG,EAAAH,EAAArwD,GAAAguC,GAAAsxB,EAAAjP,EAAAhlD,EAAA4nB,GAAAssC,EAAAlP,EAAAhlD,EAAA4nB,KAUA,GAAA6d,EAAAuc,eAAA5zD,KAAAu0C,KAAA8C,EAAAgd,YAAAr0D,KAAAu0C,GAAAh9B,QAAAvX,KAAAu0C,GAAAh9B,MAAAiqD,mBAAA,CAEA,IAAAM,EAAA9hE,KAAAu0C,GAAA1pB,OAAA+2C,SAAAzR,EAAA0R,GAEAjnD,EAAA5a,KAAAu0C,GAAAh9B,MAAAkqD,oBACAsE,EAAA/lE,KAAA4R,KACA,OAAA,SAAAglD,EAAAhlD,EAAA4nB,GACA,IAAA3O,EAAAi3C,EAAAlL,EAAAhlD,EAAA4nB,GAGA,OAFA8rC,EAAAz6C,EAAAjQ,GACAiQ,EAAAjQ,IAAAiQ,EAAAjQ,GAAA8qD,QACA76C,EAAAjQ,GAAAmrD,EAAA5V,EAAAj7C,EAAA,GAAA0hD,EAAAhlD,IACAiZ,EAAAjQ,GAAAlD,MAAAmT,EAAAuN,EAAAqtC,EAAA,SAAAG,GAEA,OAAAA,EAAAhP,EAAAhlD,EAAA4nB,OAMA,IAAAwsC,EAAAhmE,KAAAu0C,GAAAqtB,SAAAzR,EAAA0R,GAEAoE,EAAAjmE,KAAA4R,KACA,OAAA,SAAAglD,EAAAhlD,EAAA4nB,GACA,IAAA+a,EAAAyxB,EAAApP,EAAAhlD,EAAA4nB,GAEA,OADA+a,GAAAA,EAAAmxB,QACAnxB,EAAA0xB,EAAA9V,EAAAj7C,EAAA,GAAA0hD,EAAAhlD,IACA2iC,EAAA78B,MAAA68B,EAAAnc,EAAAqtC,EAAA,SAAAG,GAEA,OAAAA,EAAAhP,EAAAhlD,EAAA4nB,QAWAgsC,EAAAvlE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAAu0C,GAAA,KAAAv0C,MAEA,IAAA,IAAA5C,EAAA,EAAAA,EAAA4C,KAAA4R,KAAA9T,OAAAV,IACAigB,EAAArd,KAAA4R,KAAAxU,GAAA,QAAAA,EAAA,IAAA4C,OAWAwlE,EAAAvlE,UAAAm4B,IAAA,SAAA/a,GAKA,IAJA,IAAAk3B,EAAAv0C,KAAAgiE,QAAA3kD,EAAArd,KAAAu0C,GAAA,KAAAv0C,OAEA4R,EAAA,GAEAxU,EAAA,EAAAA,EAAA4C,KAAA4R,KAAA9T,OAAAV,IACAwU,EAAAxU,GAAA4C,KAAAgiE,QAAA3kD,EAAArd,KAAA4R,KAAAxU,GAAA,QAAAA,EAAA,IAAA4C,OAGA,OAAA,IAAAwlE,EAAAjxB,EAAA3iC,IAQA4zD,EAAAvlE,UAAAuD,MAAA,WACA,OAAA,IAAAgiE,EAAAxlE,KAAAu0C,GAAAv0C,KAAA4R,KAAA/H,MAAA,KAKA,IAAAq8D,EAAAV,EAAAvlE,UAAAwD,SA8FA,SAAA0iE,EAAAxc,EAAAgY,EAAAnmB,GASA,IARA,IAMA77C,EANAmlE,EAAA,GAGAsB,EAAA,IAAApkD,OAAA,yDAAA,MACAqkD,EAAA,EAIA,QAAA1mE,EAAAymE,EAAAjsC,KAAAwvB,KAMA,GAHAmb,GAAAnb,EAAAp3C,UAAA8zD,EAAA1mE,EAAA4X,OACA8uD,EAAA1mE,EAAA4X,MAEA,OAAA5X,EAAA,GAEAmlE,GAAA,IACAuB,QACA,CAEAA,GAAA1mE,EAAA,GAAA7B,OACA,IAAAysC,EAAAo3B,EAAAhiE,EAAA,IAEA,IAAA4qC,EACA,MAAA,IAAA+7B,eAAA,sBAAA3mE,EAAA,GAAA,oBAGA,QAAAN,IAAAM,EAAA,GAEA,OAAA+xD,EAAAnnB,IACA,IAAA,SACAu6B,GAAAv6B,EACA,MAEA,IAAA,SACA,GAAA8M,EAAAwc,OAAAtpB,GACAu6B,GAAAv6B,EAAA63B,MAAA5mB,OACA,CAAA,IAAAr+B,MAAA2gB,QAAAyM,GAUA,MAAA,IAAA5Q,UAAA,aAAAh6B,EAAA,GAAA,+CARAmlE,GAAAv6B,EAAAnS,IAAA,SAAA33B,EAAA8W,GACA,GAAA8/B,EAAAwc,OAAApzD,GACA,OAAAA,EAAA2hE,MAAA5mB,GAGA,MAAA,IAAA7hB,UAAA,aAAAh6B,EAAA,GAAA,IAAA4X,EAAA,sBACAmO,KAAA,KAKA,MAEA,QACA,MAAA,IAAAiU,UAAA,aAAAh6B,EAAA,GAAA,mDAEA,CAEA,IAAA03C,EAAAwc,OAAAtpB,EAAA5qC,EAAA,KAAA4qC,EAAA5qC,EAAA,KAGA,MAAA,IAAAg6B,UAAA,aAAAh6B,EAAA,GAAA,IAAAA,EAAA,GAAA,oBAFAmlE,GAAAv6B,EAAA5qC,EAAA,IAAAyiE,MAAA5mB,IAUA,OAFAspB,GAAAnb,EAAA9/C,MAAAw8D,GAnJAb,EAAAvlE,UAAAwD,SAAA,SAAA+3C,GACA,IAAA+qB,EACAhgE,EAAAvG,KAAAu0C,GAAA9wC,SAAA+3C,GAOA,OALAA,GAAA,WAAAkW,EAAAlW,EAAAgrB,UAAA9xD,EAAA8mC,EAAAgrB,QAAAjgE,KAEAggE,EAAA/qB,EAAAgrB,QAAAjgE,GAAAvG,KAAAw7C,SAGA,IAAA+qB,EACAA,EAIAL,EAAAroE,KAAAmC,KAAAw7C,IASAgqB,EAAAvlE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAA5pC,EAAA5R,KAAA4R,KAAAwmB,IAAA,SAAA33B,GACA,OAAAA,EAAAgD,SAAA+3C,KAIA,OAFAnE,EAAA8c,yBAAAn0D,KAAAu0C,IAAA,IAAAv0C,KAAAu0C,GAAA9wC,SAAA+3C,GAAA,IAAAx7C,KAAAu0C,GAAA9wC,SAAA+3C,IAEA,IAAA5pC,EAAA8T,KAAA,MAAA,KAQA8/C,EAAAvlE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,eACAhiB,GAAAv0C,KAAAu0C,GACA3iC,KAAA5R,KAAA4R,OAYA4zD,EAAAhP,SAAA,SAAA1D,GACA,OAAA,IAAA0S,EAAA1S,EAAAve,GAAAue,EAAAlhD,OASA4zD,EAAAvlE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAA5pC,EAAA5R,KAAA4R,KAAAwmB,IAAA,SAAA33B,GACA,OAAAA,EAAAyhE,OAAA1mB,KAGA,MAAA,+BAAA5W,EAAA5kC,KAAAu0C,IAAA,wEAAA3iC,EAAA8T,KAAA,yCAAA,kEAsFA,IAAA+gD,EAAAjB,EAAAvlE,UAAAmiE,MA0FA,OA7EAoD,EAAAvlE,UAAAmiE,MAAA,SAAA5mB,GACA,IAAAkrB,EAOA,OALAlrB,GAAA,WAAAkW,EAAAlW,EAAAgrB,UAAA9xD,EAAA8mC,EAAAgrB,QAAAxmE,KAAAuG,QAEAmgE,EAAAlrB,EAAAgrB,QAAAxmE,KAAAuG,MAAAvG,KAAAw7C,SAGA,IAAAkrB,EACAA,EAIAD,EAAA5oE,KAAAmC,KAAAw7C,IASAgqB,EAAAvlE,UAAAkiE,OAAA,SAAA3mB,GACA,IAIAmrB,EAOAC,EAXAh1D,EAAA5R,KAAA4R,KAAAwmB,IAAA,SAAA33B,GAEA,OAAAA,EAAA2hE,MAAA5mB,KAWA,QAPA2U,EAAAnwD,KAAAuG,OAAA,mBAAA4pD,EAAAnwD,KAAAuG,MAAA67D,OAAA,WAAA1Q,EAAAvB,EAAAnwD,KAAAuG,MAAA67D,QAAA,iBAAAjS,EAAAnwD,KAAAuG,MAAA67D,QAEAuE,EAAAxW,EAAAnwD,KAAAuG,MAAA67D,OAKA1Q,EAAAiV,IACA,IAAA,WAEAC,EAAAD,EAAA3mE,KAAAw7C,GACA,MAEA,IAAA,SAEAorB,EAAAT,EAAAQ,EAAA3mE,KAAAw7C,GACA,MAEA,IAAA,SAEA,OAAAkW,EAAAiV,EAAA/0D,EAAA9T,UACA,IAAA,WACA8oE,EAAAD,EAAA/0D,EAAA9T,QAAAkC,KAAAw7C,GACA,MAEA,IAAA,SACAorB,EAAAT,EAAAQ,EAAA/0D,EAAA9T,QAAAkC,KAAAw7C,IAMA,YAAA,IAAAorB,EACAA,EAGAT,EAAArB,EAAA+B,gBAAA7mE,KAAAw7C,IAQAgqB,EAAAvlE,UAAA6mE,cAAA,WACA,OAAA9mE,KAAAq3C,KAAA,IAAAr3C,KAAAuG,MAGAi/D,wLChdA,aAEA,IAAAptC,EAAAt7B,EAAA,qBAAAs7B,IAEAwM,EAAA9nC,EAAA,sBAAA8nC,OA+QAhnC,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA/QA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WACAiqE,EAAAnW,EAAA9zD,EAAA,4BACAghC,EAAA3gB,MAAA2gB,QAiBA,SAAAkpC,EAAAC,EAAAC,GACA,KAAAlnE,gBAAAgnE,GACA,MAAA,IAAAxoE,YAAA,oDAMA,GAHAwB,KAAAinE,WAAAA,EACAjnE,KAAAknE,YAAAA,IAAA,GAEAppC,EAAAmpC,KAAAA,EAAA1gB,MAAAlP,EAAAwc,QACA,MAAA,IAAAl6B,UAAA,8DAGA,GAAA35B,KAAAknE,cAAAlnE,KAAAwhE,mBACA,MAAA,IAAA/jE,MAAA,qDAIA,IAAA6kE,EAAA,WACA,MAAA,IAAA7kE,MAAA,0EAGAyG,OAAAC,eAAAnE,KAAA,SAAA,CACA6a,IAAAynD,EACA7tD,IAAA6tD,IA2NA,SAAAhtB,EAAA/H,EAAAW,EAAAqH,GACA,OAAA,IAAAwxB,EAAA1vB,EAAA6b,YAAA3lB,GAAAA,EAAAn+B,WAAAm+B,EAAA8J,EAAA6b,YAAAhlB,GAAAA,EAAA9+B,WAAA8+B,EAAAmJ,EAAA6b,YAAA3d,GAAAA,EAAAnmC,WAAAmmC,GAGA,OA3NAyxB,EAAA/mE,UAAA,IAAAohE,GACAhqB,KAAA,YACA2vB,EAAA/mE,UAAAo0D,aAAA,EAeA2S,EAAA/mE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GAMA,IAAAsF,EAAA/uC,EAAAp4B,KAAAinE,WAAA,SAAAnmB,EAAA1jD,GACA,GAAAi6C,EAAAod,YAAA3T,GAAA,CACA,GAAAA,EAAAsmB,WAAA,CAEA,IAAAnC,EAAA/gE,OAAA62B,OAAA8mC,GACAoD,EAAA,KAAA,EAEA,IAAAoC,EAAAvmB,EAAAvT,MAAAq0B,SAAAzR,EAAA8U,GAEAqC,EAAAxmB,EAAA5S,IAAA0zB,SAAAzR,EAAA8U,GAEAsC,EAAAzmB,EAAAvL,KAAAuL,EAAAvL,KAAAqsB,SAAAzR,EAAA8U,GAAA,WACA,OAAA,GAEA,OAAA,SAAArO,EAAAhlD,EAAA4nB,GACA,IAAAnB,EAAA83B,EAAA93B,KAAAmB,GAAA51B,UACAwhE,EAAAlhE,OAAA62B,OAAAnpB,GAEA,OADAwzD,EAAA,IAAA/sC,EAAAj7B,GACAk4C,EAAA+xB,EAAAzQ,EAAAwO,EAAA5rC,GAAA8tC,EAAA1Q,EAAAwO,EAAA5rC,GAAA+tC,EAAA3Q,EAAAwO,EAAA5rC,KAIA,IAAAguC,EAAA1mB,EAAAvT,MAAAq0B,SAAAzR,EAAA0R,GAEA4F,EAAA3mB,EAAA5S,IAAA0zB,SAAAzR,EAAA0R,GAEA6F,EAAA5mB,EAAAvL,KAAAuL,EAAAvL,KAAAqsB,SAAAzR,EAAA0R,GAAA,WACA,OAAA,GAGA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GACA,OAAA8b,EAAAkyB,EAAA5Q,EAAAhlD,EAAA4nB,GAAAiuC,EAAA7Q,EAAAhlD,EAAA4nB,GAAAkuC,EAAA9Q,EAAAhlD,EAAA4nB,KAGA,GAAA6d,EAAAqd,aAAA5T,IAAA,QAAAA,EAAAv6C,KAAA,CAEA,IAAAohE,EAAAzjE,OAAA62B,OAAA8mC,GAEA8F,EAAA,KAAA,EAEA,IAAAC,EAAA9mB,EAAA8gB,SAAAzR,EAAAwX,GAEA,OAAA,SAAA/Q,EAAAhlD,EAAA4nB,GACA,IAAAnB,EAAA83B,EAAA93B,KAAAmB,GAAA51B,UACAwhE,EAAAlhE,OAAA62B,OAAAnpB,GAEA,OADAwzD,EAAA,IAAA/sC,EAAAj7B,GACAwqE,EAAAhR,EAAAwO,EAAA5rC,IAIA,IAAAquC,EAAA/mB,EAAA8gB,SAAAzR,EAAA0R,GAEA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GACA,OAAAquC,EAAAjR,EAAAhlD,EAAA4nB,MAIA,OAAA,SAAAo9B,EAAAhlD,EAAA4nB,GACA,IAAAytC,EAAA7uC,EAAA+uC,EAAA,SAAAW,GACA,OAAAA,EAAAlR,EAAAhlD,EAAA4nB,KAEA,OAAA22B,EAAA54C,MAAAG,MAAAy4C,EAAA8W,KASAD,EAAA/mE,UAAAqX,QAAA,SAAA+F,GACA,IAAA,IAAAjgB,EAAA,EAAAA,EAAA4C,KAAAinE,WAAAnpE,OAAAV,IACAigB,EAAArd,KAAAinE,WAAA7pE,GAAA,cAAAA,EAAA,IAAA4C,OAWAgnE,EAAA/mE,UAAAm4B,IAAA,SAAA/a,GAGA,IAFA,IAAA4pD,EAAA,GAEA7pE,EAAA,EAAAA,EAAA4C,KAAAinE,WAAAnpE,OAAAV,IACA6pE,EAAA7pE,GAAA4C,KAAAgiE,QAAA3kD,EAAArd,KAAAinE,WAAA7pE,GAAA,cAAAA,EAAA,IAAA4C,OAGA,OAAA,IAAAgnE,EAAAC,IAQAD,EAAA/mE,UAAAuD,MAAA,WACA,OAAA,IAAAwjE,EAAAhnE,KAAAinE,WAAAp9D,MAAA,KAQAm9D,EAAA/mE,UAAAuhE,iBAAA,WACA,OAAA,IAAAxhE,KAAAinE,WAAAnpE,QAAAu5C,EAAA6c,eAAAl0D,KAAAinE,WAAA,KAAA,iBAAAjnE,KAAAinE,WAAA,GAAA7iE,OASA4iE,EAAA/mE,UAAAwhE,kBAAA,WACA,OAAAzhE,KAAAwhE,mBAAAxhE,KAAAinE,WAAA,GAAA7iE,MAAA,MASA4iE,EAAA/mE,UAAAgiE,UAAA,SAAAzmB,GAEA,OAAAx7C,KAAAknE,YAAA,IAAAlnE,KAAAyhE,oBAAA,IAAAzhE,KAAAinE,WAAAvhD,KAAA,MAAA,KAQAshD,EAAA/mE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,YACA0Q,WAAAjnE,KAAAinE,WACAC,YAAAlnE,KAAAknE,cAYAF,EAAAxQ,SAAA,SAAA1D,GACA,OAAA,IAAAkU,EAAAlU,EAAAmU,WAAAnU,EAAAoU,cASAF,EAAA/mE,UAAAiiE,OAAA,SAAA1mB,GAIA,IAFA,IAAAyrB,EAAA,GAEA7pE,EAAA,EAAAA,EAAA4C,KAAAinE,WAAAnpE,OAAAV,IACA6pE,EAAA7pE,GAAA4C,KAAAinE,WAAA7pE,GAAA8kE,SAGA,OAAAliE,KAAAknE,YACA,sGAAAtiC,EAAA5kC,KAAAyhE,qBAAA,UAEA,kEAAAwF,EAAAvhD,KAAA,yCAAA,mEAUAshD,EAAA/mE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAAyrB,EAAAjnE,KAAAinE,WAAA7uC,IAAA,SAAA0oB,GACA,OAAAA,EAAAshB,MAAA5mB,KAEA,OAAAx7C,KAAAknE,YAAA,IAAAlnE,KAAAyhE,oBAAA,KAAAwF,EAAAvhD,KAAA,KAAA,KAQAshD,wHChRA,aAEA,SAAAtV,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAAiyD,EAAA/nE,EAAA,eAEAqiE,EAAAriE,EAAA,sBAAAqiE,UAEAzqD,EAAA5X,EAAA,sBAAA4X,eA0aA9W,EAAA2I,KAAA,OACA3I,EAAA2oC,KAAA,kBACA3oC,EAAAuyD,MAAA,EAEAvyD,EAAA8vD,QA5aA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GAIA,SAAAkR,IACA,KAAArhE,gBAAAqhE,GACA,MAAA,IAAA7iE,YAAA,oDA+ZA,OArZA6iE,EAAAphE,UAAAm2D,KAAA,SAAAQ,GACA,OAAA52D,KAAA82D,UAAAV,KAAAQ,IAGAyK,EAAAphE,UAAAo3C,KAAA,OACAgqB,EAAAphE,UAAA4zD,QAAA,EACAwN,EAAAphE,UAAA8nE,QAAA,GASA1G,EAAAphE,UAAA62D,QAAA,WACA,IAAAX,EAAAn2D,KAAA4hE,SAAAzR,EAAAC,WAAAC,kBAAA,IAEAz+C,EAAA,GAEA,MAAA,CACAwkD,KAAA,SAAAQ,GACA,IAAAzuD,EAAAyuD,GAAA,GAIA,OAiXA,SAAAA,GACA,IAAA,IAAAlzB,KAAAkzB,EACA,GAAAliD,EAAAkiD,EAAAlzB,IACAA,KAAAmhC,EACA,MAAA,IAAApnE,MAAA,sCAAAimC,EAAA,2BAvXAskC,CAAA7/D,GAEAguD,EAAAhuD,EAAAyJ,EAPA,SA0BAyvD,EAAAphE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,MAAA,IAAApkE,MAAA,iDAAAuC,KAAAq3C,OAQAgqB,EAAAphE,UAAAqX,QAAA,SAAA+F,GAEA,MAAA,IAAA5f,MAAA,2CAUA4jE,EAAAphE,UAAAm4B,IAAA,SAAA/a,GAEA,MAAA,IAAA5f,MAAA,uCAUA4jE,EAAAphE,UAAA+hE,QAAA,SAAAL,GACA,IAAAtqB,EAAAwc,OAAA8N,GACA,MAAA,IAAAhoC,UAAA,wCAGA,OAAAgoC,GAUAN,EAAAphE,UAAA2xD,SAAA,SAAAv0C,GAEAA,EAAArd,KAAA,KAAA,MAGA,SAAAioE,EAAAtG,EAAAtkD,GACAskD,EAAArqD,QAAA,SAAA4wD,EAAA3hC,EAAAuB,GACAzqB,EAAA6qD,EAAA3hC,EAAAuB,GAEAmgC,EAAAC,EAAA7qD,KAIA4qD,CAAAjoE,KAAAqd,IAyBAgkD,EAAAphE,UAAAs4B,UAAA,SAAAlb,GAWA,OATA,SAAA8qD,EAAAxG,EAAAtkD,GACA,OAAAskD,EAAAvpC,IAAA,SAAA8vC,EAAA3hC,EAAAuB,GAEA,OAAAqgC,EADA9qD,EAAA6qD,EAAA3hC,EAAAuB,GACAzqB,KAMA8qD,CAFA9qD,EAAArd,KAAA,KAAA,MAEAqd,IAkBAgkD,EAAAphE,UAAAuiD,OAAA,SAAAnlC,GACA,IAAA+qD,EAAA,GAMA,OALApoE,KAAA4xD,SAAA,SAAA+P,EAAAp7B,EAAAuB,GACAzqB,EAAAskD,EAAAp7B,EAAAuB,IACAsgC,EAAAh7D,KAAAu0D,KAGAyG,GAIA/G,EAAAphE,UAAA06C,KAAA,WACA,MAAA,IAAAl9C,MAAA,+DAIA4jE,EAAAphE,UAAAN,MAAA,WACA,MAAA,IAAAlC,MAAA,iGAQA4jE,EAAAphE,UAAAuD,MAAA,WAEA,MAAA,IAAA/F,MAAA,kCAQA4jE,EAAAphE,UAAA8lD,UAAA,WACA,OAAA/lD,KAAAo4B,IAAA,SAAAupC,GACA,OAAAA,EAAA5b,eAWAsb,EAAAphE,UAAAsD,OAAA,SAAA4jC,GACA,QAAAA,GAAAg4B,EAAAn/D,KAAAmnC,IAmBAk6B,EAAAphE,UAAAwD,SAAA,SAAA+3C,GACA,IAAA+qB,EAEA,GAAA/qB,GAAA,WAAAkW,EAAAlW,GACA,OAAAkW,EAAAlW,EAAAgrB,UACA,IAAA,SACA,IAAA,YACA,MAEA,IAAA,WACAD,EAAA/qB,EAAAgrB,QAAAxmE,KAAAw7C,GACA,MAEA,QACA,MAAA,IAAA7hB,UAAA,2CAIA,YAAA,IAAA4sC,EACAA,EAGAvmE,KAAAiiE,UAAAzmB,IAUA6lB,EAAAphE,UAAA6P,OAAA,WACA,MAAA,IAAArS,MAAA,sDAAAuC,KAAAq3C,OAmBAgqB,EAAAphE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAA+qB,EAEA,GAAA/qB,GAAA,WAAAkW,EAAAlW,GACA,OAAAkW,EAAAlW,EAAAgrB,UACA,IAAA,SACA,IAAA,YACA,MAEA,IAAA,WACAD,EAAA/qB,EAAAgrB,QAAAxmE,KAAAw7C,GACA,MAEA,QACA,MAAA,IAAA7hB,UAAA,2CAIA,YAAA,IAAA4sC,EACAA,EAGAvmE,KAAAkiE,OAAA1mB,IAUA6lB,EAAAphE,UAAAgiE,UAAA,WAEA,MAAA,IAAAxkE,MAAA,iCAAAuC,KAAAq3C,OAmBAgqB,EAAAphE,UAAAmiE,MAAA,SAAA5mB,GACA,IAAAkrB,EAEA,GAAAlrB,GAAA,WAAAkW,EAAAlW,GACA,OAAAkW,EAAAlW,EAAAgrB,UACA,IAAA,SACA,IAAA,YACA,MAEA,IAAA,WACAE,EAAAlrB,EAAAgrB,QAAAxmE,KAAAw7C,GACA,MAEA,QACA,MAAA,IAAA7hB,UAAA,2CAIA,YAAA,IAAA+sC,EACAA,EAGA1mE,KAAAmiE,OAAA3mB,IAWA6lB,EAAAphE,UAAAkiE,OAAA,SAAA3mB,GAEA,MAAA,IAAA/9C,MAAA,8BAAAuC,KAAAq3C,OAQAgqB,EAAAphE,UAAA6mE,cAAA,WACA,OAAA9mE,KAAAq3C,MAQAgqB,EAAAphE,UAAAooE,WAAA,WACA,OAAAroE,MAmBAqhE,uEC/aA,aAEA,SAAA3P,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAAs+C,EAAAp0D,EAAA,sBAAAo0D,UAEAtsB,EAAA9nC,EAAA,sBAAA8nC,OAEA0jC,EAAAxrE,EAAA,uBAAAwrE,eAEA5zD,EAAA5X,EAAA,sBAAA4X,eA+MA9W,EAAA2I,KAAA,aACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA/MA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WAQA,SAAAyrE,EAAA5tD,GACA,KAAA3a,gBAAAuoE,GACA,MAAA,IAAA/pE,YAAA,oDAKA,GAFAwB,KAAA2a,WAAAA,GAAA,GAEAA,IACA,WAAA+2C,EAAA/2C,KAAAzW,OAAAiT,KAAAwD,GAAA4rC,MAAA,SAAAjxC,GACA,OAAA+hC,EAAAwc,OAAAl5C,EAAArF,OAEA,MAAA,IAAAqkB,UAAA,oCAsLA,OAjLA4uC,EAAAtoE,UAAA,IAAAohE,GACAhqB,KAAA,aACAkxB,EAAAtoE,UAAAq0D,cAAA,EAeAiU,EAAAtoE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAA2G,EAAA,GAEA,IAAA,IAAAlzD,KAAAtV,KAAA2a,WACA,GAAAjG,EAAA1U,KAAA2a,WAAArF,GAAA,CAGA,IAAAmzD,EAAAvX,EAAA57C,GACAozD,EAAAzX,KAAAhyD,MAAAwpE,GAEA,IAAAH,EAAAtoE,KAAA2a,WAAA+tD,GACA,MAAA,IAAAjrE,MAAA,0BAAAirE,EAAA,KAGAF,EAAAE,GAAA1oE,KAAA2a,WAAArF,GAAAssD,SAAAzR,EAAA0R,GAIA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GACA,IAAA5mB,EAAA,GAEA,IAAA,IAAA+1D,KAAAH,EACA9zD,EAAA8zD,EAAAG,KACA/1D,EAAA+1D,GAAAH,EAAAG,GAAA/R,EAAAhlD,EAAA4nB,IAIA,OAAA5mB,IASA21D,EAAAtoE,UAAAqX,QAAA,SAAA+F,GACA,IAAA,IAAA/H,KAAAtV,KAAA2a,WACA3a,KAAA2a,WAAAjG,eAAAY,IACA+H,EAAArd,KAAA2a,WAAArF,GAAA,cAAA47C,EAAA57C,GAAA,IAAAtV,OAYAuoE,EAAAtoE,UAAAm4B,IAAA,SAAA/a,GACA,IAAA1C,EAAA,GAEA,IAAA,IAAArF,KAAAtV,KAAA2a,WACA3a,KAAA2a,WAAAjG,eAAAY,KACAqF,EAAArF,GAAAtV,KAAAgiE,QAAA3kD,EAAArd,KAAA2a,WAAArF,GAAA,cAAA47C,EAAA57C,GAAA,IAAAtV,QAIA,OAAA,IAAAuoE,EAAA5tD,IAQA4tD,EAAAtoE,UAAAuD,MAAA,WACA,IAAAmX,EAAA,GAEA,IAAA,IAAArF,KAAAtV,KAAA2a,WACA3a,KAAA2a,WAAAjG,eAAAY,KACAqF,EAAArF,GAAAtV,KAAA2a,WAAArF,IAIA,OAAA,IAAAizD,EAAA5tD,IAUA4tD,EAAAtoE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAAtc,EAAA,GAEA,IAAA,IAAA5pB,KAAAtV,KAAA2a,WACA3a,KAAA2a,WAAAjG,eAAAY,IACA4pB,EAAA9xB,KAAA8jD,EAAA57C,GAAA,KAAAtV,KAAA2a,WAAArF,GAAA7R,SAAA+3C,IAIA,MAAA,IAAAtc,EAAAxZ,KAAA,MAAA,KAQA6iD,EAAAtoE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,aACA57C,WAAA3a,KAAA2a,aAYA4tD,EAAA/R,SAAA,SAAA1D,GACA,OAAA,IAAAyV,EAAAzV,EAAAn4C,aAUA4tD,EAAAtoE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAAtc,EAAA,GAEA,IAAA,IAAA5pB,KAAAtV,KAAA2a,WACA3a,KAAA2a,WAAAjG,eAAAY,IACA4pB,EAAA9xB,KAAA,2CAAAw3B,EAAAtvB,GAAA,8HAAAtV,KAAA2a,WAAArF,GAAA4sD,OAAA1mB,IAIA,MAAA,iEAAAtc,EAAAxZ,KAAA,yCAAA,kEASA6iD,EAAAtoE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAAtc,EAAA,GAEA,IAAA,IAAA5pB,KAAAtV,KAAA2a,WACA3a,KAAA2a,WAAAjG,eAAAY,IACA4pB,EAAA9xB,KAAA,YAAAkI,EAAA,QAAAtV,KAAA2a,WAAArF,GAAA8sD,MAAA5mB,GAAA,QAIA,MAAA,8BAAAoG,OAAA1iB,EAAAxZ,KAAA,MAAA,2BAGA6iD,qHCtNA,aAEA,IAAAzD,EAAAhoE,EAAA,qBAEAs7B,EAAAt7B,EAAA,qBAAAs7B,IAEAwM,EAAA9nC,EAAA,sBAAA8nC,OAEAgkC,EAAA9rE,EAAA,uBAAA8rE,aAEA7R,EAAAj6D,EAAA,uBAAAi6D,gBAEA2L,EAAA5lE,EAAA,gBAkqBAc,EAAA2I,KAAA,eACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QAlqBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WAYA,SAAA+rE,EAAAC,EAAAv0B,EAAA3iC,EAAAm3D,GACA,KAAA/oE,gBAAA6oE,GACA,MAAA,IAAArqE,YAAA,oDAIA,GAAA,iBAAAsqE,EACA,MAAA,IAAAnvC,UAAA,sCAGA,GAAA,iBAAA4a,EACA,MAAA,IAAA5a,UAAA,sCAGA,IAAAxc,MAAA2gB,QAAAlsB,KAAAA,EAAA20C,MAAAlP,EAAAwc,QACA,MAAA,IAAAl6B,UAAA,wDAGA35B,KAAA+oE,UAAA,IAAAA,EACA/oE,KAAA8oE,GAAAA,EACA9oE,KAAAu0C,GAAAA,EACAv0C,KAAA4R,KAAAA,GAAA,GA8HA,SAAAo3D,EAAA/qE,EAAA2kE,EAAAmG,EAAAn3D,EAAAkzD,GAEA,IAoBA9tD,EApBA6rD,EAAAH,EAAAI,cAAA7kE,EAAA2kE,GACAqG,EAAAvG,EAAAwG,iBAAAjrE,EAAA2kE,GAEA,GAAA,QAAAA,GAAA,EAAAhxD,EAAA9T,QAAA,qBAAAG,EAAA6oE,iBAAA,0BAAA7oE,EAAA6oE,gBAcA,OAbAl1D,EAAAwmB,IAAA,SAAA33B,GACA,OAAAA,EAAA4nE,aAAAhxB,MAEA,IAAA,YACA,IAAA,eACA,IAAA,aACA,IAAA,kBACA,OAAA,EAEA,QACA,OAAA,KAQA,OAAAzlC,EAAA9T,QACA,KAAA,EACAkZ,EAAA,GACA,MAEA,KAAA,EAGA,IAAAmyD,EAAAzG,EAAAI,cAAAlxD,EAAA,GAAAgxD,GAEA,GAAAkC,GAAA,OAAAqE,EAAA,CACA,IAAAC,EACAC,EAWA,GAPAA,EAFA,SAAAzG,GACAwG,EAAAx3D,EAAA,GAAAk1D,gBACA7oE,EAAA6oE,kBAGAsC,EAAAx3D,EAAA,GAAAy2D,aAAAvB,gBACA7oE,EAAAoqE,aAAAvB,kBAGA,IAAApE,EAAA/nD,WAAAkoD,GAAAwG,GAAAC,gBAAA,CACAtyD,EAAA,EAAA,GACA,MAGA,IAAA,IAAA0rD,EAAA/nD,WAAAwuD,GAAAC,GAAAG,YAAA,CACAvyD,EAAA,EAAA,GACA,OAIA,GAAA,OAAAmyD,EAAA,CAEAnyD,EAAA,EAAA,GACA,MAGA,GAAAmyD,GAAAtG,EAAA,CAEA7rD,EAAA,EAAA,GACA,MAIAA,EAAA,EAAA,GACA,MAEA,KAAA,EAEA,IAAAwyD,EAuBAC,EApBAC,EAAAhH,EAAAI,cAAAlxD,EAAA,GAAAgxD,GAEA+G,EAAAjH,EAAAkH,kBAAA3rE,EAAA2T,EAAA,GAAAgxD,GAKA4G,EAHA,OAAAE,IAIAA,IAAA7G,GAAA,UAAAoG,IAAAU,GAMAD,EAAA7G,GASA,IAsBAgH,EAEAC,EACAC,EAzBAC,EAAAtH,EAAAI,cAAAlxD,EAAA,GAAAgxD,GAEAqH,EAAAvH,EAAAkH,kBAAA3rE,EAAA2T,EAAA,GAAAgxD,GAKA6G,EAHA,OAAAO,IAIAA,IAAAnH,GAAA,SAAAoG,IAAAgB,GAMAD,EAAAnH,GAOAiC,IASAiF,EAHA,SAAAnH,GACAiH,EAAA5rE,EAAA6oE,gBACAgD,EAAA7rE,EAAA2T,KAAA,GAAAk1D,gBACA7oE,EAAA2T,KAAA,GAAAk1D,kBAGA+C,EAAA5rE,EAAAoqE,aAAAvB,gBACAgD,EAAA7rE,EAAA2T,KAAA,GAAAy2D,aAAAvB,gBACA7oE,EAAA2T,KAAA,GAAAy2D,aAAAvB,iBAGA,OAAA4C,KACA,IAAAhH,EAAA/nD,WAAAkoD,GAAAgH,GAAAP,kBACAE,GAAA,IAGA,IAAA9G,EAAA/nD,WAAA+uD,GAAAI,GAAAP,cACAC,GAAA,IAIA,OAAAQ,KACA,IAAAtH,EAAA/nD,WAAAkoD,GAAAgH,GAAAK,mBACAT,GAAA,IAGA,IAAA/G,EAAA/nD,WAAAqvD,GAAAD,GAAAR,cACAE,GAAA,KAKAzyD,EAAA,CAAAwyD,EAAAC,GACA,MAEA,QACA,qBAAAxrE,EAAA6oE,iBAAA,0BAAA7oE,EAAA6oE,kBACA9vD,EAAApF,EAAAwmB,IAAA,SAAA33B,GACA,IAAA0pE,EAAAzH,EAAAI,cAAAriE,EAAAmiE,GACAwH,EAAA1H,EAAAkH,kBAAA3rE,EAAAwC,EAAAmiE,GACAyH,EAAA3H,EAAAwG,iBAAAzoE,EAAAmiE,GAEA,OAAA,OAAAuH,IAGAtH,IAAAsH,GAAAlB,IAAAoB,IAAAD,GAEAD,EAAAtH,MA2BA,OAbA,GAAAjxD,EAAA9T,QAAA,0BAAAG,EAAA6oE,iBAAA7oE,EAAA8qE,UAAA,SAAAnG,GAAA,SAAAmG,IACA/xD,EAAApF,EAAAwmB,IAAA,SAAA33B,EAAA8W,GACA,IAAAi9C,EAAA,oBAAA/zD,EAAAqmE,gBAEA,SAAA9vD,EAAAO,KAAAi9C,MASAx9C,EAkTA,OAxnBA6xD,EAAA5oE,UAAA,IAAAohE,GACAhqB,KAAA,eACAwxB,EAAA5oE,UAAAs0D,gBAAA,EAeAsU,EAAA5oE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GAEA,GAAA,iBAAA7hE,KAAAu0C,KAAAq0B,EAAAzY,EAAAnwD,KAAAu0C,IACA,MAAA4b,EAAAnwD,KAAAu0C,IAGA,IAAA92C,MAAA,0BAAAuC,KAAAu0C,GAAA,KAFA,IAAA92C,MAAA,YAAAuC,KAAAu0C,GAAA,yCAMA,IAAAA,EAAAwiB,EAAA5G,EAAAnwD,KAAAu0C,IACAkxB,EAAArtC,EAAAp4B,KAAA4R,KAAA,SAAAnR,GACA,OAAAA,EAAAmhE,SAAAzR,EAAA0R,KAGA,GAAA,IAAA4D,EAAA3nE,OAAA,CACA,IAAA6nE,EAAAF,EAAA,GACA,OAAA,SAAA7O,EAAAhlD,EAAA4nB,GACA,OAAA+a,EAAAoxB,EAAA/O,EAAAhlD,EAAA4nB,KAEA,GAAA,IAAAisC,EAAA3nE,OAOA,OAAA,SAAA84D,EAAAhlD,EAAA4nB,GACA,OAAA+a,EAAA78B,MAAA,KAAA0gB,EAAAqtC,EAAA,SAAAG,GACA,OAAAA,EAAAhP,EAAAhlD,EAAA4nB,OARA,IAAAqsC,EAAAJ,EAAA,GACAK,EAAAL,EAAA,GACA,OAAA,SAAA7O,EAAAhlD,EAAA4nB,GACA,OAAA+a,EAAAsxB,EAAAjP,EAAAhlD,EAAA4nB,GAAAssC,EAAAlP,EAAAhlD,EAAA4nB,MAgBAqvC,EAAA5oE,UAAAqX,QAAA,SAAA+F,GACA,IAAA,IAAAjgB,EAAA,EAAAA,EAAA4C,KAAA4R,KAAA9T,OAAAV,IACAigB,EAAArd,KAAA4R,KAAAxU,GAAA,QAAAA,EAAA,IAAA4C,OAWA6oE,EAAA5oE,UAAAm4B,IAAA,SAAA/a,GAGA,IAFA,IAAAzL,EAAA,GAEAxU,EAAA,EAAAA,EAAA4C,KAAA4R,KAAA9T,OAAAV,IACAwU,EAAAxU,GAAA4C,KAAAgiE,QAAA3kD,EAAArd,KAAA4R,KAAAxU,GAAA,QAAAA,EAAA,IAAA4C,OAGA,OAAA,IAAA6oE,EAAA7oE,KAAA8oE,GAAA9oE,KAAAu0C,GAAA3iC,EAAA5R,KAAA+oE,WAQAF,EAAA5oE,UAAAuD,MAAA,WACA,OAAA,IAAAqlE,EAAA7oE,KAAA8oE,GAAA9oE,KAAAu0C,GAAAv0C,KAAA4R,KAAA/H,MAAA,GAAA7J,KAAA+oE,WASAF,EAAA5oE,UAAAqqE,QAAA,WACA,OAAA,IAAAtqE,KAAA4R,KAAA9T,QASA+qE,EAAA5oE,UAAA6F,SAAA,WACA,OAAA,IAAA9F,KAAA4R,KAAA9T,QAqOA+qE,EAAA5oE,UAAAgiE,UAAA,SAAAzmB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAmG,EAAAvtB,GAAAA,EAAAutB,SAAAvtB,EAAAutB,SAAA,OACAn3D,EAAA5R,KAAA4R,KACA24D,EAAAvB,EAAAhpE,KAAA4iE,EAAAmG,EAAAn3D,GAAA,GAEA,GAAA,IAAAA,EAAA9T,OAAA,CAEA,IAAA0sE,EAAA9H,EAAAwG,iBAAAlpE,KAAA4iE,GACA6H,EAAA74D,EAAA,GAAAnO,SAAA+3C,GAEA+uB,EAAA,KACAE,EAAA,IAAAA,EAAA,KAIA,IAAAC,EAAA,YAAAh3D,KAAA1T,KAAA8oE,IAEA,MAAA,UAAA0B,EAEAxqE,KAAA8oE,IAAA4B,EAAA,IAAA,IAAAD,EACA,SAAAD,EAEAC,GAAAC,EAAA,IAAA,IAAA1qE,KAAA8oE,GAIA2B,EAAAzqE,KAAA8oE,GACA,GAAA,IAAAl3D,EAAA9T,OAAA,CACA,IAAA6sE,EAAA/4D,EAAA,GAAAnO,SAAA+3C,GAEAovB,EAAAh5D,EAAA,GAAAnO,SAAA+3C,GAYA,OAVA+uB,EAAA,KAEAI,EAAA,IAAAA,EAAA,KAGAJ,EAAA,KAEAK,EAAA,IAAAA,EAAA,KAGA5qE,KAAA+oE,UAAA,0BAAA/oE,KAAA8mE,iBAAA,SAAAiC,EACA4B,EAAA,IAAAC,EAGAD,EAAA,IAAA3qE,KAAA8oE,GAAA,IAAA8B,EACA,GAAA,EAAAh5D,EAAA9T,SAAA,qBAAAkC,KAAA8mE,iBAAA,0BAAA9mE,KAAA8mE,iBAAA,CACA,IAAA+D,EAAAj5D,EAAAwmB,IAAA,SAAA33B,EAAA8W,GAQA,OAPA9W,EAAAA,EAAAgD,SAAA+3C,GAEA+uB,EAAAhzD,KAEA9W,EAAA,IAAAA,EAAA,KAGAA,IAGA,OAAAT,KAAA+oE,UAAA,0BAAA/oE,KAAA8mE,iBAAA,SAAAiC,EACA8B,EAAAnlD,KAAA,KAGAmlD,EAAAnlD,KAAA,IAAA1lB,KAAA8oE,GAAA,KAGA,OAAA9oE,KAAAu0C,GAAA,IAAAv0C,KAAA4R,KAAA8T,KAAA,MAAA,KASAmjD,EAAA5oE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,eACAuS,GAAA9oE,KAAA8oE,GACAv0B,GAAAv0C,KAAAu0C,GACA3iC,KAAA5R,KAAA4R,KACAm3D,SAAA/oE,KAAA+oE,WAYAF,EAAArS,SAAA,SAAA1D,GACA,OAAA,IAAA+V,EAAA/V,EAAAgW,GAAAhW,EAAAve,GAAAue,EAAAlhD,KAAAkhD,EAAAiW,WASAF,EAAA5oE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAmG,EAAAvtB,GAAAA,EAAAutB,SAAAvtB,EAAAutB,SAAA,OACAn3D,EAAA5R,KAAA4R,KACA24D,EAAAvB,EAAAhpE,KAAA4iE,EAAAmG,EAAAn3D,GAAA,GAEA,GAAA,IAAAA,EAAA9T,OAAA,CAEA,IAAA0sE,EAAA9H,EAAAwG,iBAAAlpE,KAAA4iE,GACA6H,EAAA74D,EAAA,GAAAswD,OAAA1mB,GAMA,OAJA+uB,EAAA,KACAE,EAAA,iEAAAA,EAAA,kEAGA,UAAAD,EAEA,gFAAA5lC,EAAA5kC,KAAA8oE,IAAA,UAAA2B,EAGA,iFAAA7lC,EAAA5kC,KAAA8oE,IAAA,UAAA2B,EAKA,GAAA,IAAA74D,EAAA9T,OAAA,CAEA,IAAA6sE,EAAA/4D,EAAA,GAAAswD,OAAA1mB,GAEAovB,EAAAh5D,EAAA,GAAAswD,OAAA1mB,GAYA,OAVA+uB,EAAA,KAEAI,EAAA,iEAAAA,EAAA,kEAGAJ,EAAA,KAEAK,EAAA,iEAAAA,EAAA,kEAGA5qE,KAAA+oE,UAAA,0BAAA/oE,KAAA8mE,iBAAA,SAAAiC,EACA4B,EAAA,yFAAAC,EAGAD,EAAA,kFAAA/lC,EAAA5kC,KAAA8oE,IAAA,UAAA8B,EAEA,IAAAC,EAAAj5D,EAAAwmB,IAAA,SAAA33B,EAAA8W,GAQA,OAPA9W,EAAAA,EAAAyhE,OAAA1mB,GAEA+uB,EAAAhzD,KAEA9W,EAAA,iEAAAA,EAAA,kEAGAA,IAGA,OAAA,EAAAmR,EAAA9T,SAAA,qBAAAkC,KAAA8mE,iBAAA,0BAAA9mE,KAAA8mE,iBACA9mE,KAAA+oE,UAAA,0BAAA/oE,KAAA8mE,iBAAA,SAAAiC,EACA8B,EAAAnlD,KAAA,0FAGAmlD,EAAAnlD,KAAA,kFAAAkf,EAAA5kC,KAAA8oE,IAAA,WAGA,+BAAAlkC,EAAA5kC,KAAAu0C,IAAA,wEAAAs2B,EAAAnlD,KAAA,yCAAA,kEAWAmjD,EAAA5oE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAmG,EAAAvtB,GAAAA,EAAAutB,SAAAvtB,EAAAutB,SAAA,OACAn3D,EAAA5R,KAAA4R,KACA24D,EAAAvB,EAAAhpE,KAAA4iE,EAAAmG,EAAAn3D,GAAA,GACAk3D,EAAAhE,EAAApC,UAAA1iE,KAAAu0C,IAGA,GAFAu0B,OAAA,IAAAA,EAAA9oE,KAAA8oE,GAAAA,EAEA,IAAAl3D,EAAA9T,OAAA,CAEA,IAAA0sE,EAAA9H,EAAAwG,iBAAAlpE,KAAA4iE,GACA6H,EAAA74D,EAAA,GAAAwwD,MAAA5mB,GAMA,OAJA+uB,EAAA,KACAE,EAAA,UAAA7oB,OAAA6oB,EAAA,aAGA,UAAAD,EAEA1B,EAAA2B,EAGAA,EAAA3B,EAKA,GAAA,IAAAl3D,EAAA9T,OAAA,CAEA,IAAA6sE,EAAA/4D,EAAA,GAEAk5D,EAAAH,EAAAvI,MAAA5mB,GAEA+uB,EAAA,KACAO,EAAA,UAAAlpB,OAAAkpB,EAAA,aAGA,IASAhB,EAPAiB,EAFAn5D,EAAA,GAEAwwD,MAAA5mB,GAgBA,OAdA+uB,EAAA,KACAQ,EAAA,UAAAnpB,OAAAmpB,EAAA,aAOAjB,EADA,SAAAlH,EACA+H,EAAA7D,gBAGA6D,EAAAtC,aAAAvB,gBAGA9mE,KAAA8mE,iBACA,IAAA,sBAEA,OAAAgC,EAAA,IAAAgC,EAAA,KAAAC,EAAA,IAEA,IAAA,mBAIA,OAHAD,EAAA,IAAAA,EAAA,IACAC,EAAA,IAAAA,EAAA,IAEAjB,GACA,IAAA,kBAEA,IAAA,sBACAgB,EAAA,UAAAlpB,OAAAkpB,EAAA,YAGA,MAEA,IAAA,wBACA,GAAA9qE,KAAA+oE,UAAA,SAAAA,EACA,OAAA+B,EAAA,IAAAC,EAKA,OAAAD,EAAAhC,EAAAiC,EACA,GAAA,EAAAn5D,EAAA9T,SAAA,qBAAAkC,KAAA8mE,iBAAA,0BAAA9mE,KAAA8mE,iBAAA,CACA,IAAAkE,EAAAp5D,EAAAwmB,IAAA,SAAA33B,EAAA8W,GAOA,OANA9W,EAAAA,EAAA2hE,MAAA5mB,GAEA+uB,EAAAhzD,KACA9W,EAAA,UAAAmhD,OAAAnhD,EAAA,aAGAA,IAGA,MAAA,0BAAAT,KAAA8mE,iBAAA9mE,KAAA+oE,SACAiC,EAAAtlD,KAAA,KAGAslD,EAAAtlD,KAAAojD,GAKA,MAAA,YAAA9oE,KAAAu0C,GAAA,WAAA3iC,EAAAwmB,IAAA,SAAA33B,GACA,OAAAA,EAAA2hE,MAAA5mB,KACA91B,KAAA,KAAA,YASAmjD,EAAA5oE,UAAA6mE,cAAA,WACA,OAAA9mE,KAAAq3C,KAAA,IAAAr3C,KAAAu0C,IAGAs0B,+JC3qBA,aA8JAjrE,EAAA2I,KAAA,kBACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QA9JA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WASA,SAAAmuE,EAAAC,GACA,KAAAlrE,gBAAAirE,GACA,MAAA,IAAAzsE,YAAA,oDAIA,IAAA64C,EAAAwc,OAAAqX,GACA,MAAA,IAAAvxC,UAAA,yCAGA35B,KAAAkrE,QAAAA,EAqIA,OAlIAD,EAAAhrE,UAAA,IAAAohE,GACAhqB,KAAA,kBACA4zB,EAAAhrE,UAAAu0D,mBAAA,EAeAyW,EAAAhrE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,OAAA7hE,KAAAkrE,QAAAtJ,SAAAzR,EAAA0R,IASAoJ,EAAAhrE,UAAAooE,WAAA,WACA,OAAAroE,KAAAkrE,QAAA7C,cAQA4C,EAAAhrE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAAkrE,QAAA,UAAAlrE,OAUAirE,EAAAhrE,UAAAm4B,IAAA,SAAA/a,GAEA,OAAA,IAAA4tD,EADA5tD,EAAArd,KAAAkrE,QAAA,UAAAlrE,QASAirE,EAAAhrE,UAAAuD,MAAA,WACA,OAAA,IAAAynE,EAAAjrE,KAAAkrE,UAUAD,EAAAhrE,UAAAgiE,UAAA,SAAAzmB,GACA,OAAAA,GAAAA,IAAAA,EAAAonB,aAAApnB,GAAA,SAAAA,EAAAonB,YACA,IAAA5iE,KAAAkrE,QAAAznE,SAAA+3C,GAAA,IAGAx7C,KAAAkrE,QAAAznE,SAAA+3C,IAQAyvB,EAAAhrE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,kBACA2U,QAAAlrE,KAAAkrE,UAYAD,EAAAzU,SAAA,SAAA1D,GACA,OAAA,IAAAmY,EAAAnY,EAAAoY,UAUAD,EAAAhrE,UAAAiiE,OAAA,SAAA1mB,GACA,OAAAA,GAAAA,IAAAA,EAAAonB,aAAApnB,GAAA,SAAAA,EAAAonB,YACA,iEAAA5iE,KAAAkrE,QAAAhJ,OAAA1mB,GAAA,iEAGAx7C,KAAAkrE,QAAAhJ,OAAA1mB,IAUAyvB,EAAAhrE,UAAAkiE,OAAA,SAAA3mB,GACA,OAAAA,GAAAA,IAAAA,EAAAonB,aAAApnB,GAAA,SAAAA,EAAAonB,YACA,UAAAhhB,OAAA5hD,KAAAkrE,QAAA9I,MAAA5mB,GAAA,YAGAx7C,KAAAkrE,QAAA9I,MAAA5mB,IAGAyvB,yCC3JA,aAEA,IAAAvI,EAAA5lE,EAAA,gBAyRAc,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QAzRA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WAUA,SAAAquE,EAAA59B,EAAAW,EAAAqH,GACA,KAAAv1C,gBAAAmrE,GACA,MAAA,IAAA3sE,YAAA,oDAIA,IAAA64C,EAAAwc,OAAAtmB,GAAA,MAAA,IAAA5T,UAAA,iBACA,IAAA0d,EAAAwc,OAAA3lB,GAAA,MAAA,IAAAvU,UAAA,iBACA,GAAA4b,IAAA8B,EAAAwc,OAAAte,GAAA,MAAA,IAAA5b,UAAA,iBACA,GAAA,EAAAxmB,UAAArV,OAAA,MAAA,IAAAL,MAAA,sBACAuC,KAAAutC,MAAAA,EAEAvtC,KAAAkuC,IAAAA,EAEAluC,KAAAu1C,KAAAA,GAAA,KAgGA,SAAAyzB,EAAArH,EAAAiB,GACA,IAAAC,EAAAH,EAAAI,cAAAnB,EAAAiB,GACA2H,EAAA,GACAa,EAAA1I,EAAAI,cAAAnB,EAAAp0B,MAAAq1B,GAGA,GAFA2H,EAAAh9B,MAAA,OAAA69B,GAAAA,GAAAvI,GAAA,QAAAD,EAEAjB,EAAApsB,KAAA,CACA,IAAA81B,EAAA3I,EAAAI,cAAAnB,EAAApsB,KAAAqtB,GACA2H,EAAAh1B,KAAA,OAAA81B,GAAAA,GAAAxI,GAAA,QAAAD,EAGA,IAAA0I,EAAA5I,EAAAI,cAAAnB,EAAAzzB,IAAA00B,GAEA,OADA2H,EAAAr8B,IAAA,OAAAo9B,GAAAA,GAAAzI,GAAA,QAAAD,EACA2H,EA8IA,OAxPAY,EAAAlrE,UAAA,IAAAohE,GACAhqB,KAAA,YACA8zB,EAAAlrE,UAAAw0D,aAAA,EAOA0W,EAAAlrE,UAAAmnE,SAAA,WAKA,OAAA,EAHApnE,KAAAwiD,OAAA,SAAAmf,GACA,OAAAtqB,EAAAqd,aAAAiN,IAAA,QAAAA,EAAAp7D,OAEAzI,QAiBAqtE,EAAAlrE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAA/gB,EAAAqP,EAAArP,MAEAumB,EAAArnE,KAAAutC,MAAAq0B,SAAAzR,EAAA0R,GAEAyF,EAAAtnE,KAAAkuC,IAAA0zB,SAAAzR,EAAA0R,GAEA,GAAA7hE,KAAAu1C,KAAA,CACA,IAAAgyB,EAAAvnE,KAAAu1C,KAAAqsB,SAAAzR,EAAA0R,GAEA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GACA,OAAAsnB,EAAAumB,EAAAzQ,EAAAhlD,EAAA4nB,GAAA8tC,EAAA1Q,EAAAhlD,EAAA4nB,GAAA+tC,EAAA3Q,EAAAhlD,EAAA4nB,KAGA,OAAA,SAAAo9B,EAAAhlD,EAAA4nB,GACA,OAAAsnB,EAAAumB,EAAAzQ,EAAAhlD,EAAA4nB,GAAA8tC,EAAA1Q,EAAAhlD,EAAA4nB,MAUA2xC,EAAAlrE,UAAAqX,QAAA,SAAA+F,GACAA,EAAArd,KAAAutC,MAAA,QAAAvtC,MACAqd,EAAArd,KAAAkuC,IAAA,MAAAluC,MAEAA,KAAAu1C,MACAl4B,EAAArd,KAAAu1C,KAAA,OAAAv1C,OAWAmrE,EAAAlrE,UAAAm4B,IAAA,SAAA/a,GACA,OAAA,IAAA8tD,EAAAnrE,KAAAgiE,QAAA3kD,EAAArd,KAAAutC,MAAA,QAAAvtC,OAAAA,KAAAgiE,QAAA3kD,EAAArd,KAAAkuC,IAAA,MAAAluC,OAAAA,KAAAu1C,MAAAv1C,KAAAgiE,QAAA3kD,EAAArd,KAAAu1C,KAAA,OAAAv1C,SAQAmrE,EAAAlrE,UAAAuD,MAAA,WACA,OAAA,IAAA2nE,EAAAnrE,KAAAutC,MAAAvtC,KAAAkuC,IAAAluC,KAAAu1C,MAAAv1C,KAAAu1C,OAiCA41B,EAAAlrE,UAAAgiE,UAAA,SAAAzmB,GACA,IAGA50C,EAFA2jE,EAAAvB,EAAAhpE,KADAw7C,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,QAIAr1B,EAAAvtC,KAAAutC,MAAA9pC,SAAA+3C,GAQA,GANA+uB,EAAAh9B,QACAA,EAAA,IAAAA,EAAA,KAGA3mC,EAAA2mC,EAEAvtC,KAAAu1C,KAAA,CACA,IAAAA,EAAAv1C,KAAAu1C,KAAA9xC,SAAA+3C,GAEA+uB,EAAAh1B,OACAA,EAAA,IAAAA,EAAA,KAGA3uC,GAAA,IAAA2uC,EAGA,IAAArH,EAAAluC,KAAAkuC,IAAAzqC,SAAA+3C,GAOA,OALA+uB,EAAAr8B,MACAA,EAAA,IAAAA,EAAA,KAGAtnC,GAAA,IAAAsnC,GASAi9B,EAAAlrE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,YACAhpB,MAAAvtC,KAAAutC,MACAW,IAAAluC,KAAAkuC,IACAqH,KAAAv1C,KAAAu1C,OAYA41B,EAAA3U,SAAA,SAAA1D,GACA,OAAA,IAAAqY,EAAArY,EAAAvlB,MAAAulB,EAAA5kB,IAAA4kB,EAAAvd,OASA41B,EAAAlrE,UAAAiiE,OAAA,SAAA1mB,GACA,IAGA50C,EAFA2jE,EAAAvB,EAAAhpE,KADAw7C,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,QAIAr1B,EAAAvtC,KAAAutC,MAAA20B,OAAA1mB,GAQA,GANA+uB,EAAAh9B,QACAA,EAAA,iEAAAA,EAAA,kEAGA3mC,EAAA2mC,EAEAvtC,KAAAu1C,KAAA,CACA,IAAAA,EAAAv1C,KAAAu1C,KAAA2sB,OAAA1mB,GAEA+uB,EAAAh1B,OACAA,EAAA,iEAAAA,EAAA,kEAGA3uC,GAAA,2DAAA2uC,EAGA,IAAArH,EAAAluC,KAAAkuC,IAAAg0B,OAAA1mB,GAOA,OALA+uB,EAAAr8B,MACAA,EAAA,iEAAAA,EAAA,kEAGAtnC,GAAA,2DAAAsnC,GAUAi9B,EAAAlrE,UAAAkiE,OAAA,SAAA3mB,GACA,IACA+uB,EAAAvB,EAAAhpE,KADAw7C,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,QAEAh8D,EAAA5G,KAAAutC,MAAA60B,MAAA5mB,GAMA,GAJA+uB,EAAAh9B,QACA3mC,EAAA,UAAAg7C,OAAAh7C,EAAA,aAGA5G,KAAAu1C,KAAA,CACA,IAAAA,EAAAv1C,KAAAu1C,KAAA6sB,MAAA5mB,GAEA+uB,EAAAh1B,OACAA,EAAA,UAAAqM,OAAArM,EAAA,aAGA3uC,GAAA,IAAA2uC,EAGA,IAAArH,EAAAluC,KAAAkuC,IAAAk0B,MAAA5mB,GAOA,OALA+uB,EAAAr8B,MACAA,EAAA,UAAA0T,OAAA1T,EAAA,aAGAtnC,GAAA,IAAAsnC,GAIAi9B,4DCxRA,aAEA,IAAAzI,EAAA5lE,EAAA,gBAEAgoE,EAAAhoE,EAAA,qBAEA8nC,EAAA9nC,EAAA,sBAAA8nC,OAwNAhnC,EAAA2I,KAAA,iBACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QAxNA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+Q,EAAAzQ,EAAA9zD,EAAA,WAEAi6D,EAAAj6D,EAAA,uBAAAi6D,gBAYA,SAAAwU,EAAAC,EAAAxG,GACA,KAAAhlE,gBAAAurE,GACA,MAAA,IAAA/sE,YAAA,oDAGA,IAAA2e,MAAA2gB,QAAA0tC,GAAA,MAAA,IAAA7xC,UAAA,2CACA,IAAAxc,MAAA2gB,QAAAknC,GAAA,MAAA,IAAArrC,UAAA,qCACA,GAAA6xC,EAAA1tE,SAAAknE,EAAAlnE,OAAA,EAAA,MAAA,IAAA67B,UAAA,sFACA35B,KAAAwrE,aAAAA,EACAxrE,KAAAglE,OAAAA,EA2LA,OAxLAuG,EAAAtrE,UAAA,IAAAohE,GACAhqB,KAAA,iBACAk0B,EAAAtrE,UAAAwrE,kBAAA,EAeAF,EAAAtrE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAA7sD,EAAAhV,KACA0rE,EAAA1rE,KAAAglE,OAAA5sC,IAAA,SAAAz6B,GACA,OAAAA,EAAAikE,SAAAzR,EAAA0R,KAEA,OAAA,SAAAjL,EAAAhlD,EAAA4nB,GAIA,IAHA,IAAAmyC,EACAC,EAAAF,EAAA,GAAA9U,EAAAhlD,EAAA4nB,GAEAp8B,EAAA,EAAAA,EAAA4X,EAAAw2D,aAAA1tE,OAAAV,IAKA,GAJAuuE,EAAAC,EACAA,EAAAF,EAAAtuE,EAAA,GAAAw5D,EAAAhlD,EAAA4nB,IACAu9B,EAAA5G,EAAAn7C,EAAAw2D,aAAApuE,GAEAyuE,CAAAF,EAAAC,GACA,OAAA,EAIA,OAAA,IASAL,EAAAtrE,UAAAqX,QAAA,SAAA+F,GACA,IAAAyuD,EAAA9rE,KAEAA,KAAAglE,OAAA1tD,QAAA,SAAAra,EAAAG,GACA,OAAAigB,EAAApgB,EAAA,UAAAG,EAAA,IAAA0uE,IACA9rE,OAUAurE,EAAAtrE,UAAAm4B,IAAA,SAAA/a,GACA,IAAA0uD,EAAA/rE,KAEA,OAAA,IAAAurE,EAAAvrE,KAAAwrE,aAAA3hE,QAAA7J,KAAAglE,OAAA5sC,IAAA,SAAAn7B,EAAAG,GACA,OAAA2uE,EAAA/J,QAAA3kD,EAAApgB,EAAA,UAAAG,EAAA,IAAA2uE,KACA/rE,QAQAurE,EAAAtrE,UAAAuD,MAAA,WACA,OAAA,IAAA+nE,EAAAvrE,KAAAwrE,aAAAxrE,KAAAglE,SASAuG,EAAAtrE,UAAAgiE,UAAA,SAAAzmB,GAiBA,IAhBA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAC,EAAAH,EAAAI,cAAA9iE,KAAA4iE,GACAoJ,EAAAhsE,KAAAglE,OAAA5sC,IAAA,SAAAz6B,EAAA4Z,GACA,IAAA00D,EAAAvJ,EAAAI,cAAAnlE,EAAAilE,GACA,MAAA,QAAAA,GAAA,OAAAqJ,GAAAA,GAAApJ,EAAA,IAAAllE,EAAA8F,SAAA+3C,GAAA,IAAA79C,EAAA8F,SAAA+3C,KAEA0wB,EAAA,CACAC,MAAA,KACA1M,QAAA,KACAF,QAAA,IACAF,OAAA,IACAG,UAAA,KACAF,SAAA,MAEA57D,EAAAsoE,EAAA,GAEA5uE,EAAA,EAAAA,EAAA4C,KAAAwrE,aAAA1tE,OAAAV,IACAsG,GAAA,IAAAwoE,EAAAlsE,KAAAwrE,aAAApuE,IAAA,IAAA4uE,EAAA5uE,EAAA,GAGA,OAAAsG,GAQA6nE,EAAAtrE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,iBACAiV,aAAAxrE,KAAAwrE,aACAxG,OAAAhlE,KAAAglE,SAYAuG,EAAA/U,SAAA,SAAA1D,GACA,OAAA,IAAAyY,EAAAzY,EAAA0Y,aAAA1Y,EAAAkS,SASAuG,EAAAtrE,UAAAiiE,OAAA,SAAA1mB,GAiBA,IAhBA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAC,EAAAH,EAAAI,cAAA9iE,KAAA4iE,GACAoJ,EAAAhsE,KAAAglE,OAAA5sC,IAAA,SAAAz6B,EAAA4Z,GACA,IAAA00D,EAAAvJ,EAAAI,cAAAnlE,EAAAilE,GACA,MAAA,QAAAA,GAAA,OAAAqJ,GAAAA,GAAApJ,EAAA,iEAAAllE,EAAAukE,OAAA1mB,GAAA,iEAAA79C,EAAAukE,OAAA1mB,KAEA0wB,EAAA,CACAC,MAAA,KACA1M,QAAA,KACAF,QAAA,IACAF,OAAA,IACAG,UAAA,KACAF,SAAA,MAEA57D,EAAAsoE,EAAA,GAEA5uE,EAAA,EAAAA,EAAA4C,KAAAwrE,aAAA1tE,OAAAV,IACAsG,GAAA,kFAAAkhC,EAAAsnC,EAAAlsE,KAAAwrE,aAAApuE,KAAA,UAAA4uE,EAAA5uE,EAAA,GAGA,OAAAsG,GASA6nE,EAAAtrE,UAAAkiE,OAAA,SAAA3mB,GASA,IARA,IAAAonB,EAAApnB,GAAAA,EAAAonB,YAAApnB,EAAAonB,YAAA,OACAC,EAAAH,EAAAI,cAAA9iE,KAAA4iE,GACAoJ,EAAAhsE,KAAAglE,OAAA5sC,IAAA,SAAAz6B,EAAA4Z,GACA,IAAA00D,EAAAvJ,EAAAI,cAAAnlE,EAAAilE,GACA,MAAA,QAAAA,GAAA,OAAAqJ,GAAAA,GAAApJ,EAAA,UAAAllE,EAAAykE,MAAA5mB,GAAA,UAAA79C,EAAAykE,MAAA5mB,KAEA93C,EAAAsoE,EAAA,GAEA5uE,EAAA,EAAAA,EAAA4C,KAAAwrE,aAAA1tE,OAAAV,IACAsG,GAAAohE,EAAApC,UAAA1iE,KAAAwrE,aAAApuE,IAAA4uE,EAAA5uE,EAAA,GAGA,OAAAsG,GAGA6nE,uIC3NA,aAEA,IAAAzG,EAAAhoE,EAAA,qBAEA8nC,EAAA9nC,EAAA,sBAAA8nC,OAEAlwB,EAAA5X,EAAA,sBAAA4X,eAEAqiD,EAAAj6D,EAAA,uBAAAi6D,gBAqMAn5D,EAAA2I,KAAA,aACA3I,EAAA2oC,KAAA,kBACA3oC,EAAAuyD,MAAA,EAEAvyD,EAAA8vD,QAvMA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAkR,EAAAzQ,EAAA9zD,EAAA,WAOA,SAAAsvE,EAAA7lE,GACA,QAAA8wC,EAAAg1B,MAAAh1B,EAAAg1B,KAAAD,gBAAA7lE,GAWA,SAAAg/D,EAAAh/D,GACA,KAAAvG,gBAAAulE,GACA,MAAA,IAAA/mE,YAAA,oDAIA,GAAA,iBAAA+H,EAAA,MAAA,IAAAozB,UAAA,wCACA35B,KAAAuG,KAAAA,EAqKA,OAlKAg/D,EAAAtlE,UAAA,IAAAohE,GACAhqB,KAAA,aACAkuB,EAAAtlE,UAAAy0D,cAAA,EAeA6Q,EAAAtlE,UAAA2hE,SAAA,SAAAzR,EAAA0R,GACA,IAAAt7D,EAAAvG,KAAAuG,KAEA,GAAAmO,EAAAmtD,EAAAt7D,GAGA,OAAA,SAAAqwD,EAAAhlD,EAAA4nB,GACA,OAAA5nB,EAAArL,IAEA,GAAAA,KAAA4pD,EACA,OAAA,SAAAyG,EAAAhlD,EAAA4nB,GACA,OAAAu9B,EAAAxwD,KAAAqwD,EAAAA,EAAAzG,EAAA5pD,IAGA,IAAAysD,EAAAoZ,EAAA7lE,GACA,OAAA,SAAAqwD,EAAAhlD,EAAA4nB,GACA,OAAAjzB,KAAAqwD,EAAAG,EAAAH,EAAArwD,GAAAysD,EAAA,IAAA3b,EAAAg1B,KAAA,KAAA9lE,GA6BA,SAAAA,GACA,MAAA,IAAA9I,MAAA,oBAAA8I,GA9BA+lE,CAAA/lE,KAUAg/D,EAAAtlE,UAAAqX,QAAA,SAAA+F,KAUAkoD,EAAAtlE,UAAAm4B,IAAA,SAAA/a,GACA,OAAArd,KAAAwD,SAiBA+hE,EAAAtlE,UAAAuD,MAAA,WACA,OAAA,IAAA+hE,EAAAvlE,KAAAuG,OAUAg/D,EAAAtlE,UAAAgiE,UAAA,SAAAzmB,GACA,OAAAx7C,KAAAuG,MAUAg/D,EAAAtlE,UAAAiiE,OAAA,SAAA1mB,GACA,IAAAj1C,EAAAq+B,EAAA5kC,KAAAuG,MAEA,MAAA,SAAAA,GAAA,UAAAA,EACA,0CAAAA,EAAA,UACA,MAAAA,EACA,mDAAAA,EAAA,UACA,aAAAA,EACA,kDAAAA,EAAA,UACA,QAAAA,EACA,6CAAAA,EAAA,UACA,SAAAA,EACA,8CAAAA,EAAA,UACA,cAAAA,EACA,mDAAAA,EAAA,UAGA,6BAAAA,EAAA,WAQAg/D,EAAAtlE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,aACAhwD,KAAAvG,KAAAuG,OAYAg/D,EAAA/O,SAAA,SAAA1D,GACA,OAAA,IAAAyS,EAAAzS,EAAAvsD,OAUAg/D,EAAAtlE,UAAAkiE,OAAA,SAAA3mB,GACA,IAAAwX,GAAA,OAEA,IAAA7C,EAAAnwD,KAAAuG,OAAA6lE,EAAApsE,KAAAuG,QACAysD,GAAA,GAGA,IAAAtvB,EAAAohC,EAAAO,SAAArlE,KAAAuG,KAAAysD,GAEA,MAAA,OAAAtvB,EAAA,GAEAA,EAIA,IAAAA,GAGA6hC,6IC1MA,aAcA3nE,EAAA2I,KAAA,aACA3I,EAAA2oC,KAAA,kBACA3oC,EAAA8vD,QAdA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GASA,OALA,WAEA,MAAA,IAAA7yD,MAAA,qFCRA,aAEAO,EAAAJ,QAAA,CAAAd,EAAA,kBAAAA,EAAA,eAAAA,EAAA,oBAAAA,EAAA,eAAAA,EAAA,qBAAAA,EAAA,kBAAAA,EAAA,eAAAA,EAAA,4BAAAA,EAAA,kBAAAA,EAAA,UAAAA,EAAA,gBAAAA,EAAA,kBAAAA,EAAA,qBAAAA,EAAA,eAAAA,EAAA,oBAAAA,EAAA,gBAAAA,EAAA,yYCFA,aAEA,SAAA40D,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAA25D,EAAAzvE,EAAA,mCAAAy7B,UAEAw+B,EAAAj6D,EAAA,0BAAAi6D,gBAyCAn5D,EAAA8vD,QAvCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+N,EAAAzN,EAAA9zD,EAAA,oCAaA,OAAA,SAAA+tB,EAAAtT,GACA,IACA,GAAA4F,MAAA2gB,QAAAjT,GACA,OAAAwzC,EAAAxzC,EAAAtT,GACA,GAAAsT,GAAA,mBAAAA,EAAAwzC,OAEA,OAAAxzC,EAAAwzC,OAAA9mD,GACA,GAAA,iBAAAsT,EAEA,OAAAwzC,EAAAxzC,EAAAtT,GACA,GAAA,WAAAm6C,EAAA7mC,GAOA,MAAA,IAAA8O,UAAA,kDANA,IAAApiB,EAAAiqD,mBACA,MAAA,IAAA7nC,UAAA,mDAGA,OAAAo9B,EAAAlsC,EAAAtT,EAAAkqD,qBAIA,MAAAzM,GACA,MAAAuX,EAAAvX,wIC1CA,aAEA,SAAAtD,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAA25D,EAAAzvE,EAAA,mCAAAy7B,UAEAy+B,EAAAl6D,EAAA,0BAAAk6D,gBA8CAp5D,EAAA8vD,QA5CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+N,EAAAzN,EAAA9zD,EAAA,oCACA2zD,EAAAG,EAAA9zD,EAAA,yCAgBA,OAAA,SAAA+tB,EAAAtT,EAAAnT,GACA,IACA,GAAA+Y,MAAA2gB,QAAAjT,GACA,OAAA4lC,EAAA5lC,GAAAwzC,OAAA9mD,EAAAnT,GAAAR,UACA,GAAAinB,GAAA,mBAAAA,EAAAwzC,OAEA,OAAAxzC,EAAAwzC,OAAA9mD,EAAAnT,GACA,GAAA,iBAAAymB,EAEA,OAAAwzC,EAAAxzC,EAAAtT,EAAAnT,GACA,GAAA,WAAAstD,EAAA7mC,GAQA,MAAA,IAAA8O,UAAA,kDAPA,IAAApiB,EAAAiqD,mBACA,MAAA7nC,UAAA,mDAIA,OADAq9B,EAAAnsC,EAAAtT,EAAAkqD,oBAAAr9D,GACAymB,EAIA,MAAAmqC,GACA,MAAAuX,EAAAvX,mLC/CA,aAmBA,IAAAr6C,EAAA,CAAA,CAEAgoD,eAAA,GACAoC,uBAAA,IACA,CAEAhB,gBAAA,CACAuF,iBAAA,EACAY,kBAAA,EACAX,aAAA,IAIA,CAEAiD,kBAAA,CACAvD,cAAA,OACAwD,gBAAA,KAEA,CAEAC,mBAAA,CACAzD,cAAA,OACAwD,gBAAA,KAEA,CAEAE,mBAAA,CACA1D,cAAA,OACAwD,gBAAA,KAEA,CAEAG,qBAAA,CACA3D,cAAA,OACAwD,gBAAA,KAEA,CAEAI,sBAAA,CACA5D,cAAA,OACAwD,gBAAA,KAEA,CAEAK,sBAAA,CACA7D,cAAA,OACAwD,gBAAA,KAEA,CAEAM,qBAAA,CACA9D,cAAA,OACAwD,gBAAA,IAEAO,uBAAA,CACA/D,cAAA,OACAwD,gBAAA,IAEAQ,uBAAA,CACAhE,cAAA,OACAwD,gBAAA,IAEAS,sBAAA,CACAjE,cAAA,OACAwD,gBAAA,IAEAU,yBAAA,CACAlE,cAAA,OACAwD,gBAAA,IAEAW,wBAAA,CACAnE,cAAA,OACAwD,gBAAA,IAEAlB,eAAA,CACAtC,cAAA,OACAwD,gBAAA,KAEA,CAEAY,yBAAA,CACApE,cAAA,OACAwD,gBAAA,IAEAa,+BAAA,CACArE,cAAA,OACAwD,gBAAA,IAEAc,6BAAA,CACAtE,cAAA,OACAwD,gBAAA,KAEA,CAEAe,kBAAA,CACAvE,cAAA,OACAwD,gBAAA,KAEA,CAEAtB,UAAA,IACA,CAEAsC,mBAAA,CACAxE,cAAA,OACAwD,gBAAA,CAAA,mBAAA,0BAEAiB,wBAAA,CACAzE,cAAA,OACAwD,gBAAA,KAEA,CAEAkB,wBAAA,CACA1E,cAAA,OACAwD,gBAAA,CAAA,wBAAA,sBAAA,uBAAA,uBAEAmB,sBAAA,CACA3E,cAAA,OACAwD,gBAAA,GACAnD,iBAAA,EACAY,kBAAA,EACAX,aAAA,GAKAsE,2BAAA,CACA5E,cAAA,OACAwD,gBAAA,CAAA,wBAAA,sBAAA,2BAAA,0BAEAqB,yBAAA,CACA7E,cAAA,OACAwD,gBAAA,IAEAsB,mBAAA,CACA9E,cAAA,OACAwD,gBAAA,KAEA,CAEAuB,yBAAA,CACA/E,cAAA,SAEAgF,0BAAA,CACAhF,cAAA,SAEAiF,sBAAA,CACAjF,cAAA,SAEAkF,mBAAA,CACAlF,cAAA,UAEA,CAEAmF,mBAAA,CACAnF,cAAA,QACAwD,gBAAA,GACAvC,kBAAA,GAKAmE,sBAAA,CACApF,cAAA,QACAwD,gBAAA,KAEA,CAEA6B,yBAAA,CACArF,cAAA,SAEA,CAEAsF,yBAAA,CACAtF,cAAA,UAaA,SAAAnG,EAAA0L,EAAA5L,GACA,IAAAjB,EAAA6M,EAEA,SAAA5L,IAEAjB,EAAA6M,EAAAnG,cAKA,IAFA,IAAAoG,EAAA9M,EAAAmF,gBAEA1pE,EAAA,EAAAA,EAAAud,EAAA7c,OAAAV,IACA,GAAAqxE,KAAA9zD,EAAAvd,GACA,OAAAA,EAIA,OAAA,KAwFAY,EAAAJ,QAAA+c,WAAAA,EACA3c,EAAAJ,QAAAklE,cAAAA,EACA9kE,EAAAJ,QAAAsrE,iBA5EA,SAAAsF,EAAA5L,GACA,IAAAjB,EAAA6M,EAEA,SAAA5L,IAEAjB,EAAA6M,EAAAnG,cAGA,IAAAoG,EAAA9M,EAAAmF,gBACAvvD,EAAAurD,EAAAnB,EAAAiB,GAEA,GAAA,OAAArrD,EAEA,OAAA,KAGA,IAAAgzB,EAAA5vB,EAAApD,GAAAk3D,GAEA,GAAAlkC,EAAA71B,eAAA,iBAAA,CACA,GAAA,SAAA61B,EAAA0+B,cACA,MAAA,OAGA,GAAA,UAAA1+B,EAAA0+B,cACA,MAAA,QAIA,MAAAxrE,MAAA,IAAAgxE,EAAA,oCAAAlkC,EAAA0+B,cAAA,MAIA,OAAA,MA6CAjrE,EAAAJ,QAAAgsE,kBAhCA,SAAA8E,EAAAC,EAAA/L,GAEA,IAAAplE,EAAA,SAAAolE,EAAA8L,EAAArG,aAAAqG,EACAhwE,EAAA,SAAAkkE,EAAA8L,EAAArG,aAAAsG,EACAC,EAAApxE,EAAAspE,gBACA+H,EAAAnwE,EAAAooE,gBACAvvD,EAAAurD,EAAAtlE,EAAAolE,GAEA,GAAA,OAAArrD,EAEA,OAAA,KAGA,IAAAgzB,EAAA5vB,EAAApD,GAAAq3D,GAEA,GAAArkC,EAAA71B,eAAA,oBAAA61B,EAAAkiC,2BAAAtvD,MAAA,CACA,IAAA,IAAA/f,EAAA,EAAAA,EAAAmtC,EAAAkiC,gBAAA3uE,OAAAV,IACA,GAAAmtC,EAAAkiC,gBAAArvE,KAAAyxE,EACA,OAAA,EAIA,OAAA,EAIA,OAAA,iCCrTA,aAEA,SAAA35D,KAAA,OAAAA,GAAAhR,OAAAiR,QAAA,SAAAC,GAAA,IAAA,IAAAhY,EAAA,EAAAA,EAAA+V,UAAArV,OAAAV,IAAA,CAAA,IAAAiY,EAAAlC,UAAA/V,GAAA,IAAA,IAAAkY,KAAAD,EAAAnR,OAAAjE,UAAAyU,eAAA7W,KAAAwX,EAAAC,KAAAF,EAAAE,GAAAD,EAAAC,IAAA,OAAAF,IAAAsC,MAAA1X,KAAAmT,WAEA,IAAA0+C,GAAA/0D,GAAA,2BAEA+jE,GAAA/jE,GAAA,+BAiqDAc,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,aACA3oC,EAAA8vD,QAjqDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwe,EAAAle,EAAA9zD,GAAA,oBACAykE,EAAA3Q,EAAA9zD,GAAA,wBACAulE,EAAAzR,EAAA9zD,GAAA,qBACA6lE,EAAA/R,EAAA9zD,GAAA,0BACAymE,EAAA3S,EAAA9zD,GAAA,qBACAinE,EAAAnT,EAAA9zD,GAAA,2BACA8nE,EAAAhU,EAAA9zD,GAAA,wBACAioE,EAAAnU,EAAA9zD,GAAA,kCACAkqE,EAAApW,EAAA9zD,GAAA,qBACAyrE,EAAA3X,EAAA9zD,GAAA,sBACA+rE,EAAAjY,EAAA9zD,GAAA,wBACAmuE,EAAAra,EAAA9zD,GAAA,2BACA0oE,EAAA5U,EAAA9zD,GAAA,wBACAquE,EAAAva,EAAA9zD,GAAA,qBACAyuE,EAAA3a,EAAA9zD,GAAA,0BACAyoE,EAAA3U,EAAA9zD,GAAA,sBAkCA,SAAAmC,EAAAk3D,EAAA3a,GACA,GAAA,IAAAroC,UAAArV,QAAA,IAAAqV,UAAArV,OACA,MAAA,IAAA+zD,GAAA,QAAA1+C,UAAArV,OAAA,EAAA,GAIA,IAAAixE,EAAAvzB,GAAAA,EAAA4sB,MAAA5sB,EAAA4sB,MAAA,GAEA,GAAA,iBAAAjS,EAEA,OAAA6Y,EAAA7Y,EAAA4Y,GACA,GAAA5xD,MAAA2gB,QAAAq4B,IAAAA,aAAA9e,EAAA43B,OAEA,OAAApO,GAAA1K,EAAA,SAAA+Y,GACA,GAAA,iBAAAA,EAAA,MAAA,IAAAv1C,UAAA,mBACA,OAAAq1C,EAAAE,EAAAH,KAIA,MAAA,IAAAp1C,UAAA,6BAKA,IAAAw1C,EAAA,CACAC,KAAA,EACAC,UAAA,EACAje,OAAA,EACAke,OAAA,EACAC,QAAA,GAGAC,EAAA,CACAC,KAAA,EACAC,KAAA,EACAC,KAAA,EACAC,KAAA,EACAC,KAAA,EACAr6D,KAAA,EACAC,KAAA,EACAqiB,KAAA,EACAtR,KAAA,EACAspD,KAAA,EACAC,KAAA,EACAC,KAAA,EACAC,KAAA,EACAC,MAAA,EACAC,KAAA,EACAC,MAAA,EACAv6D,KAAA,EACAE,KAAA,EACAs6D,MAAA,EACAp6D,KAAA,EACAq6D,KAAA,EACAx6D,KAAA,EACAy6D,KAAA,EACAC,MAAA,EACAC,KAAA,EACAC,KAAA,EACAC,KAAA,EACAC,MAAA,EACAC,MAAA,EACAj5C,KAAA,EACAC,KAAA,EACAi5C,MAAA,EACAC,MAAA,EACAC,MAAA,EACAC,MAAA,EACAC,OAAA,GAGAC,EAAA,CACA3jE,KAAA,EACAsnD,IAAA,EACAsc,IAAA,EACAC,KAAA,EACAn3B,KAAA,EACAo3B,IAAA,EACAC,KAAA,GAEAC,EAAA,CACAC,MAAA,EACAC,OAAA,EACAC,KAAA,KACAtyE,eAAAA,GAEAuyE,EAAA,CAAA,MAAA,YAgCA,SAAAC,EAAAC,EAAAh0E,GACA,OAAAg0E,EAAA1hB,WAAA2hB,OAAAD,EAAAv6D,MAAAzZ,GAWA,SAAAk0E,EAAAF,GACA,OAAAD,EAAAC,EAAA,GAUA,SAAAj0B,EAAAi0B,GACAA,EAAAv6D,QASA,SAAA06D,EAAAH,GACA,OAAAA,EAAA1hB,WAAAroD,OAAA+pE,EAAAv6D,MAAA,GASA,SAAA26D,EAAAJ,GACA,OAAAA,EAAA1hB,WAAAroD,OAAA+pE,EAAAv6D,MAAA,GASA,SAAA46D,EAAAL,GAMA,IALAA,EAAAM,UAAAjD,EAAAC,KACA0C,EAAAO,MAAA,GACAP,EAAA/J,QAAA,GAGA9oE,EAAAqzE,aAAAN,EAAAF,GAAAA,EAAAS,eACA10B,EAAAi0B,GAIA,GAAA,MAAAE,EAAAF,GACA,KAAA,OAAAE,EAAAF,IAAA,KAAAE,EAAAF,IACAA,EAAA/J,SAAAiK,EAAAF,GACAj0B,EAAAi0B,GAKA,GAAA,KAAAE,EAAAF,GAAA,CAOA,GAAA,OAAAE,EAAAF,KAAAA,EAAAS,aAIA,OAHAT,EAAAM,UAAAjD,EAAAE,UACAyC,EAAAO,MAAAL,EAAAF,QACAj0B,EAAAi0B,GAIA,IAAAU,EAAAR,EAAAF,GACAW,EAAAZ,EAAAC,EAAA,GACAY,EAAAb,EAAAC,EAAA,GAEA,GAAA,IAAAY,EAAA50E,QAAA0xE,EAAAkD,GAMA,OALAZ,EAAAM,UAAAjD,EAAAE,UACAyC,EAAAO,MAAAK,EACA70B,EAAAi0B,GACAj0B,EAAAi0B,QACAj0B,EAAAi0B,GAKA,GAAA,IAAAW,EAAA30E,QAAA0xE,EAAAiD,GAKA,OAJAX,EAAAM,UAAAjD,EAAAE,UACAyC,EAAAO,MAAAI,EACA50B,EAAAi0B,QACAj0B,EAAAi0B,GAKA,GAAAtC,EAAAgD,GAIA,OAHAV,EAAAM,UAAAjD,EAAAE,UACAyC,EAAAO,MAAAG,OACA30B,EAAAi0B,GAKA,GAAA7yE,EAAA0zE,WAAAH,GAAA,CAGA,GAFAV,EAAAM,UAAAjD,EAAA/d,OAEA,MAAA4gB,EAAAF,GACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAEA7yE,EAAA2zE,QAAAZ,EAAAF,MAEAA,EAAAM,UAAAjD,EAAAE,eAEA,CACA,KAAApwE,EAAA2zE,QAAAZ,EAAAF,KACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAGA7yE,EAAA4zE,cAAAb,EAAAF,GAAAI,EAAAJ,MACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,IAIA,KAAA7yE,EAAA2zE,QAAAZ,EAAAF,KACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAIA,GAAA,MAAAE,EAAAF,IAAA,MAAAE,EAAAF,GACA,GAAA7yE,EAAA2zE,QAAAV,EAAAJ,KAAA,MAAAI,EAAAJ,IAAA,MAAAI,EAAAJ,GAAA,CAUA,GATAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAEA,MAAAE,EAAAF,IAAA,MAAAE,EAAAF,KACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,KAIA7yE,EAAA2zE,QAAAZ,EAAAF,IACA,MAAAgB,GAAAhB,EAAA,wBAAAE,EAAAF,GAAA,KAGA,KAAA7yE,EAAA2zE,QAAAZ,EAAAF,KACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAGA,GAAA7yE,EAAA4zE,cAAAb,EAAAF,GAAAI,EAAAJ,IACA,MAAAgB,GAAAhB,EAAA,wBAAAE,EAAAF,GAAA,UAEA,GAAA,MAAAI,EAAAJ,GAEA,MADAj0B,EAAAi0B,GACAgB,GAAAhB,EAAA,wBAAAE,EAAAF,GAAA,SAtDA,CA8DA,IAAA7yE,EAAA8zE,QAAAf,EAAAF,GAAAG,EAAAH,GAAAI,EAAAJ,IAAA,CAkBA,IAFAA,EAAAM,UAAAjD,EAAAI,QAEA,KAAAyC,EAAAF,IACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAGA,MAAAgB,GAAAhB,EAAA,yBAAAA,EAAAO,MAAA,KAtBA,KAAApzE,EAAA8zE,QAAAf,EAAAF,GAAAG,EAAAH,GAAAI,EAAAJ,KAAA7yE,EAAA2zE,QAAAZ,EAAAF,KACAA,EAAAO,OAAAL,EAAAF,GACAj0B,EAAAi0B,GAGAX,EAAAz8D,eAAAo9D,EAAAO,OACAP,EAAAM,UAAAjD,EAAAE,UAEAyC,EAAAM,UAAAjD,EAAAG,aAlHAwC,EAAAM,UAAAjD,EAAAE,UAuIA,SAAA2D,EAAAlB,GACA,KACAK,EAAAL,GACA,OAAAA,EAAAO,SASA,SAAAY,EAAAnB,GACAA,EAAAS,eAQA,SAAAW,EAAApB,GACAA,EAAAS,eA0GA,SAAAvD,EAAA5e,EAAA2e,GACA,IAAA+C,EA/WA,CACA/C,WAAA,GAEA3e,WAAA,GAEA2X,QAAA,GAEAxwD,MAAA,EAEA86D,MAAA,GAEAD,UAAAjD,EAAAC,KAEAmD,aAAA,EAEAY,iBAAA,MAkWAj+D,GAAA48D,EAAA,CACA1hB,WAAAA,EACA2e,WAAAA,IAGAoD,EAAAL,GACA,IAAAnQ,EAwBA,SAAAmQ,GACA,IAAAnQ,EAEA+B,EADAF,EAAA,GASA,IANA,KAAAsO,EAAAO,OAAA,OAAAP,EAAAO,OAAA,MAAAP,EAAAO,SACA1Q,EAAAyR,EAAAtB,IACA/J,QAAA+J,EAAA/J,SAIA,OAAA+J,EAAAO,OAAA,MAAAP,EAAAO,OAEA,IAAA7O,EAAA1lE,QAAA6jE,IACA+B,EAAA,MAAAoO,EAAAO,MACA7O,EAAAp2D,KAAA,CACAu0D,KAAAA,EACA+B,QAAAA,KAIAyO,EAAAL,GAEA,OAAAA,EAAAO,OAAA,MAAAP,EAAAO,OAAA,KAAAP,EAAAO,SACA1Q,EAAAyR,EAAAtB,IACA/J,QAAA+J,EAAA/J,QACArE,EAAA,MAAAoO,EAAAO,MACA7O,EAAAp2D,KAAA,CACAu0D,KAAAA,EACA+B,QAAAA,KAKA,OAAA,EAAAF,EAAA1lE,OACA,IAAAylE,EAAAC,IAEA7B,KACAA,EAAA,IAAAiD,OAAAvlE,IACA0oE,QAAA+J,EAAA/J,SAGApG,GAlEA0R,CAAAvB,GAGA,GAAA,KAAAA,EAAAO,MACA,MAAAP,EAAAM,YAAAjD,EAAAE,UAGA73D,GAAAs6D,EAAA,uBAAAA,EAAAO,OAEAS,GAAAhB,EAAA,oBAAAA,EAAAO,MAAA,KAIA,OAAA1Q,EAkEA,SAAAyR,EAAAtB,GACA,IAAAvrE,EAAAqL,EAAAxN,EAAAkvE,EACA3R,EAmDA,SAAAmQ,GAGA,IAFA,IAAAnQ,EA8BA,SAAAmQ,GAGA,IAFA,IAAAnQ,EAAA4R,EAAAzB,GAEA,OAAAA,EAAAO,OAEAW,EAAAlB,GACAnQ,EAAA,IAAAkH,EAAA,KAAA,KAAA,CAAAlH,EAAA4R,EAAAzB,KAGA,OAAAnQ,EAvCA6R,CAAA1B,GAEA,MAAAA,EAAAO,OAAA,CAIA,IAAAhhB,EAAAygB,EAAAqB,iBACArB,EAAAqB,iBAAArB,EAAAS,aACAS,EAAAlB,GACA,IAAA9N,EAAArC,EACAsC,EAAAmP,EAAAtB,GACA,GAAA,MAAAA,EAAAO,MAAA,MAAAS,GAAAhB,EAAA,iDACAA,EAAAqB,iBAAA,KACAH,EAAAlB,GACA,IAAA5N,EAAAkP,EAAAtB,GAEAnQ,EAAA,IAAAoC,EAAAC,EAAAC,EAAAC,GAEA4N,EAAAqB,iBAAA9hB,EAGA,OAAAsQ,EAzEA8R,CAAA3B,GAEA,GAAA,MAAAA,EAAAO,MAmCA,OAAA1Q,EAlCA,GAAAtqB,EAAAqd,aAAAiN,GAKA,OAHAp7D,EAAAo7D,EAAAp7D,KACAysE,EAAAlB,GACA1tE,EAAAgvE,EAAAtB,GACA,IAAAnP,EAAA,IAAA4C,EAAAh/D,GAAAnC,GACA,GAAAizC,EAAAuc,eAAA+N,GAIA,OAFAqR,EAAAlB,GACA1tE,EAAAgvE,EAAAtB,GACA,IAAAnP,EAAAhB,EAAA92C,OAAA82C,EAAApqD,MAAAnT,GACA,GAAAizC,EAAA+c,eAAAuN,IAAAtqB,EAAAqd,aAAAiN,EAAAptB,MAEA++B,GAAA,EACA1hE,EAAA,GACArL,EAAAo7D,EAAAp7D,KACAo7D,EAAA/vD,KAAA0F,QAAA,SAAA7W,EAAA8W,GACA8/B,EAAAqd,aAAAj0D,GACAmR,EAAA2F,GAAA9W,EAAA8F,KAEA+sE,GAAA,IAIAA,GAGA,OAFAN,EAAAlB,GACA1tE,EAAAgvE,EAAAtB,GACA,IAAA/M,EAAAx+D,EAAAqL,EAAAxN,GAIA,MAAA0uE,GAAAhB,EAAA,mDAkEA,SAAAyB,EAAAzB,GAGA,IAFA,IAAAnQ,EAAA+R,EAAA5B,GAEA,QAAAA,EAAAO,OAEAW,EAAAlB,GACAnQ,EAAA,IAAAkH,EAAA,MAAA,MAAA,CAAAlH,EAAA+R,EAAA5B,KAGA,OAAAnQ,EASA,SAAA+R,EAAA5B,GAGA,IAFA,IAAAnQ,EAAAgS,EAAA7B,GAEA,QAAAA,EAAAO,OAEAW,EAAAlB,GACAnQ,EAAA,IAAAkH,EAAA,MAAA,MAAA,CAAAlH,EAAAgS,EAAA7B,KAGA,OAAAnQ,EASA,SAAAgS,EAAA7B,GAGA,IAFA,IAAAnQ,EAAAiS,EAAA9B,GAEA,MAAAA,EAAAO,OAEAW,EAAAlB,GACAnQ,EAAA,IAAAkH,EAAA,IAAA,QAAA,CAAAlH,EAAAiS,EAAA9B,KAGA,OAAAnQ,EASA,SAAAiS,EAAA9B,GAGA,IAFA,IAAAnQ,EAAAkS,EAAA/B,GAEA,OAAAA,EAAAO,OAEAW,EAAAlB,GACAnQ,EAAA,IAAAkH,EAAA,KAAA,SAAA,CAAAlH,EAAAkS,EAAA/B,KAGA,OAAAnQ,EASA,SAAAkS,EAAA/B,GAGA,IAFA,IAAAnQ,EAAAmS,EAAAhC,GAEA,MAAAA,EAAAO,OAEAW,EAAAlB,GACAnQ,EAAA,IAAAkH,EAAA,IAAA,SAAA,CAAAlH,EAAAmS,EAAAhC,KAGA,OAAAnQ,EAQA,SAAAmS,EAAAhC,GAYA,IAXA,IAAA9M,EAAA,CAAA+O,EAAAjC,IACAtG,EAAA,GACA9I,EAAA,CACAkO,KAAA,QACAC,KAAA,UACAj5C,IAAA,UACAC,IAAA,SACAi5C,KAAA,YACAC,KAAA,YAGArO,EAAAhuD,eAAAo9D,EAAAO,QAAA,CAEA,IAAAxwB,EAAA,CACAt7C,KAAAurE,EAAAO,MACA99B,GAAAmuB,EAAAoP,EAAAO,QAEA7G,EAAAp+D,KAAAy0C,GACAmxB,EAAAlB,GACA9M,EAAA53D,KAAA2mE,EAAAjC,IAGA,OAAA,IAAA9M,EAAAlnE,OACAknE,EAAA,GACA,IAAAA,EAAAlnE,OACA,IAAA+qE,EAAA2C,EAAA,GAAAjlE,KAAAilE,EAAA,GAAAj3B,GAAAywB,GAEA,IAAAuG,EAAAC,EAAApzC,IAAA,SAAA96B,GACA,OAAAA,EAAAi3C,KACAywB,GAUA,SAAA+O,EAAAjC,GACA,IAAAnQ,EAAAe,EAAAn8D,EAAAguC,EAAAywB,EAQA,IAPArD,EAAAqS,EAAAlC,GACApP,EAAA,CACAsO,KAAA,YACAC,KAAA,kBACAC,MAAA,iBAGAxO,EAAAhuD,eAAAo9D,EAAAO,QAEA99B,EAAAmuB,EADAn8D,EAAAurE,EAAAO,OAEAW,EAAAlB,GACA9M,EAAA,CAAArD,EAAAqS,EAAAlC,IACAnQ,EAAA,IAAAkH,EAAAtiE,EAAAguC,EAAAywB,GAGA,OAAArD,EASA,SAAAqS,EAAAlC,GACA,IAAAnQ,EAAAe,EAAAn8D,EAAAguC,EAAAywB,EAQA,IAPArD,EAAAsS,EAAAnC,GACApP,EAAA,CACA5N,GAAA,KACAsc,GAAA,MAIA1O,EAAAhuD,eAAAo9D,EAAAO,QAEA99B,EAAAmuB,EADAn8D,EAAAurE,EAAAO,OAEAW,EAAAlB,GAIAnQ,EAFA,OAAAp7D,GAAA,KAAAurE,EAAAO,MAEA,IAAAxJ,EAAA,IAAA,WAAA,CAAAlH,EAAA,IAAA4D,EAAA,QAAA,IAGAP,EAAA,CAAArD,EAAAsS,EAAAnC,IACA,IAAAjJ,EAAAtiE,EAAAguC,EAAAywB,IAIA,OAAArD,EASA,SAAAsS,EAAAnC,GACA,IAAAnQ,EACAqD,EAAA,GAUA,GANArD,EAFA,MAAAmQ,EAAAO,MAEA,IAAAzN,EAAA,GAGAsP,EAAApC,GAGA,MAAAA,EAAAO,OAAAP,EAAAqB,mBAAArB,EAAAS,aAAA,CAIA,IAFAvN,EAAA53D,KAAAu0D,GAEA,MAAAmQ,EAAAO,OAAArN,EAAAlnE,OAAA,GAEAk1E,EAAAlB,GAEA,MAAAA,EAAAO,OAAA,MAAAP,EAAAO,OAAA,MAAAP,EAAAO,OAAA,KAAAP,EAAAO,MAEArN,EAAA53D,KAAA,IAAAm4D,EAAA,QAGAP,EAAA53D,KAAA8mE,EAAApC,IAMAnQ,EAFA,IAAAqD,EAAAlnE,OAEA,IAAAqtE,EAAAnG,EAAA,GAAAA,EAAA,GAAAA,EAAA,IAIA,IAAAmG,EAAAnG,EAAA,GAAAA,EAAA,IAIA,OAAArD,EASA,SAAAuS,EAAApC,GACA,IAAAnQ,EAAAe,EAAAn8D,EAAAguC,EAAAywB,EAOA,IANArD,EAAAwS,EAAArC,GACApP,EAAA,CACAqN,IAAA,MACAC,IAAA,YAGAtN,EAAAhuD,eAAAo9D,EAAAO,QAEA99B,EAAAmuB,EADAn8D,EAAAurE,EAAAO,OAEAW,EAAAlB,GACA9M,EAAA,CAAArD,EAAAwS,EAAArC,IACAnQ,EAAA,IAAAkH,EAAAtiE,EAAAguC,EAAAywB,GAGA,OAAArD,EASA,SAAAwS,EAAArC,GACA,IAAAnQ,EAAA55B,EAAA26B,EAAAn8D,EAAAguC,EAYA,IAVAxM,EADA45B,EAAAyS,EAAAtC,GAEApP,EAAA,CACAuN,IAAA,WACAC,KAAA,cACAC,IAAA,SACAC,KAAA,YACAv6D,IAAA,MACArI,IAAA,OAIAk1D,EAAAhuD,eAAAo9D,EAAAO,QAGA99B,EAAAmuB,EADAn8D,EAAAurE,EAAAO,OAEAW,EAAAlB,GACA/pC,EAAAqsC,EAAAtC,GACAnQ,EAAA,IAAAkH,EAAAtiE,EAAAguC,EAAA,CAAAotB,EAAA55B,IAMA,OAAA45B,EASA,SAAAyS,EAAAtC,GACA,IAAAnQ,EAAA55B,EAIA,IAFAA,EADA45B,EAAA0S,EAAAvC,GAIAA,EAAAM,YAAAjD,EAAAG,QAAA,OAAAwC,EAAAO,OAAAh7B,EAAA6c,eAAAyN,MAAAmQ,EAAAM,YAAAjD,EAAA/d,QAAA/Z,EAAA6c,eAAAnsB,IAAAsP,EAAAkd,eAAAxsB,IAAA,MAAAA,EAAA+gC,KAAA,MAAAgJ,EAAAO,OAMAtqC,EAAAssC,EAAAvC,GACAnQ,EAAA,IAAAkH,EAAA,IAAA,WAAA,CAAAlH,EAAA55B,IAAA,GAQA,OAAA45B,EAWA,SAAA0S,EAAAvC,GAKA,IAJA,IAAAnQ,EAAA2S,EAAAxC,GACA/pC,EAAA45B,EACA4S,EAAA,GAIA,MAAAzC,EAAAO,OAAAh7B,EAAA6c,eAAAnsB,IAFA,CAOA,GAHAwsC,EAAAnnE,KAAA8H,GAAA,GAAA48D,IACAkB,EAAAlB,GAEAA,EAAAM,YAAAjD,EAAA/d,OAqBA,CAEAl8C,GAAA48D,EAAAyC,EAAAlnE,OAEA,MApBA,GAHAknE,EAAAnnE,KAAA8H,GAAA,GAAA48D,IACAkB,EAAAlB,GAEAA,EAAAM,YAAAjD,EAAAG,QAAA,MAAAwC,EAAAO,MAQA,CAEAkC,EAAAlnE,MAEA6H,GAAA48D,EAAAyC,EAAAlnE,OAEA,MAXA6H,GAAA48D,EAAAyC,EAAAlnE,OAEAknE,EAAAlnE,MACA06B,EAAAusC,EAAAxC,GACAnQ,EAAA,IAAAkH,EAAA,IAAA,SAAA,CAAAlH,EAAA55B,IAoBA,OAAA45B,EASA,SAAA2S,EAAAxC,GACA,IAAAvrE,EAAAy+D,EAAAzwB,EACAmuB,EAAA,CACAsN,IAAA,aACAD,IAAA,YACA95D,IAAA,SACAs7D,IAAA,OAGA,OAAA7O,EAAAhuD,eAAAo9D,EAAAO,QACA99B,EAAAmuB,EAAAoP,EAAAO,OACA9rE,EAAAurE,EAAAO,MACAW,EAAAlB,GACA9M,EAAA,CAAAsP,EAAAxC,IACA,IAAAjJ,EAAAtiE,EAAAguC,EAAAywB,IAaA,SAAA8M,GACA,IAAAnQ,EAAAp7D,EAAAguC,EAAAywB,EAYA,OAXArD,EAoBA,SAAAmQ,GACA,IAAAnQ,EAAAe,EAAAn8D,EAAAguC,EAOA,IANAotB,EA+CA,SAAAmQ,GACA,IAAA9M,EAAA,GAEA,GAAA8M,EAAAM,YAAAjD,EAAAG,QAAAwC,EAAA/C,WAAAr6D,eAAAo9D,EAAAO,OAAA,CACA,IAAAmC,EAAA1C,EAAA/C,WAAA+C,EAAAO,OAGA,GAFAF,EAAAL,GAEA,MAAAA,EAAAO,MAAA,CAKA,GAJArN,EAAA,GACAiO,EAAAnB,GACAK,EAAAL,GAEA,MAAAA,EAAAO,MAGA,IAFArN,EAAA53D,KAAAgmE,EAAAtB,IAEA,MAAAA,EAAAO,OAEAF,EAAAL,GACA9M,EAAA53D,KAAAgmE,EAAAtB,IAIA,GAAA,MAAAA,EAAAO,MACA,MAAAS,GAAAhB,EAAA,0BAGAoB,EAAApB,GACAK,EAAAL,GAKA,OAAA,IAAA0C,EAAAxP,GAGA,OASA,SAAA8M,GACA,IAAAnQ,EAAAp7D,EAEA,OAAAurE,EAAAM,YAAAjD,EAAAG,QAAAwC,EAAAM,YAAAjD,EAAAE,WAAAyC,EAAAO,SAAAlB,GACA5qE,EAAAurE,EAAAO,MACAF,EAAAL,GAIAnQ,EAFA6P,EAAA98D,eAAAnO,GAEA,IAAAq+D,EAAA4M,EAAAjrE,KACA,IAAAqrE,EAAA9pE,QAAAvB,GAEA,IAAAq+D,EAAAkK,EAAAvoE,EAAA,WAEA,IAAAg/D,EAAAh/D,GAIAo7D,EAAA8S,EAAA3C,EAAAnQ,IAuGA,SAAAmQ,GACA,IAAAnQ,EAAA/6D,EAEA,MAAA,MAAAkrE,EAAAO,MAgDA,SAAAP,GACA,IAAAnQ,EAAA/6D,EAEA,MAAA,MAAAkrE,EAAAO,MAgDA,SAAAP,GACA,IAAAppD,EAAAs8C,EAAA0P,EAAAC,EAEA,GAAA,MAAA7C,EAAAO,MAyDA,OA6BA,SAAAP,GACA,GAAA,MAAAA,EAAAO,MA6CA,OASA,SAAAP,GACA,IAAA8C,EAEA,OAAA9C,EAAAM,YAAAjD,EAAA/d,OAgBA,SAAA0gB,GACA,IAAAnQ,EAEA,GAAA,MAAAmQ,EAAAO,MAiBA,OASA,SAAAP,GACA,KAAA,KAAAA,EAAAO,MAEAS,GAAAhB,EAAA,gCAEAgB,GAAAhB,EAAA,kBAdA+C,CAAA/C,GAXA,GAJAmB,EAAAnB,GACAK,EAAAL,GACAnQ,EAAAyR,EAAAtB,GAEA,MAAAA,EAAAO,MAQA,OAJAa,EAAApB,GACAK,EAAAL,GACAnQ,EAAA,IAAAsJ,EAAAtJ,GACAA,EAAA8S,EAAA3C,EAAAnQ,GANA,MAAAmR,GAAAhB,EAAA,0BAnBAgD,CAAAhD,IALA8C,EAAA9C,EAAAO,MACAF,EAAAL,GACA,IAAAlN,EAAAkK,EAAA8F,EAAAjiE,EAAA+uB,UAhBAqzC,CAAAjD,GA3CA,IAAAx8D,EADA29D,EAAAnB,GAEA,IAAAn3D,EAAA,GAEA,GAGA,GAFAw3D,EAAAL,GAEA,MAAAA,EAAAO,MAAA,CAEA,GAAA,MAAAP,EAAAO,MACA/8D,EAAA0/D,EAAAlD,QACA,GAAA,MAAAA,EAAAO,MACA/8D,EAAA2/D,EAAAnD,OACA,CAAA,GAAAA,EAAAM,YAAAjD,EAAAG,OAIA,MAAAwD,GAAAhB,EAAA,2CAHAx8D,EAAAw8D,EAAAO,MACAF,EAAAL,GAMA,GAAA,MAAAA,EAAAO,MACA,MAAAS,GAAAhB,EAAA,qCAGAK,EAAAL,GAEAn3D,EAAArF,GAAA89D,EAAAtB,UAEA,MAAAA,EAAAO,OAGA,GAAA,MAAAP,EAAAO,MACA,MAAAS,GAAAhB,EAAA,oDAGAoB,EAAApB,GACAK,EAAAL,GACA,IAAAnQ,EAAA,IAAA4G,EAAA5tD,GAGA,OADAgnD,EAAA8S,EAAA3C,EAAAnQ,GAvEAuT,CAAApD,GApDA,GAHAmB,EAAAnB,GACAK,EAAAL,GAEA,MAAAA,EAAAO,MAAA,CAEA,IAAA8C,EAAAC,GAAAtD,GAEA,GAAA,MAAAA,EAAAO,MAAA,CAKA,IAHAqC,EAAA,EACA1P,EAAA,CAAAmQ,GAEA,MAAArD,EAAAO,OAEAF,EAAAL,GACA9M,EAAA0P,GAAAU,GAAAtD,GACA4C,IAGA,GAAA,MAAA5C,EAAAO,MACA,MAAAS,GAAAhB,EAAA,4BAGAoB,EAAApB,GACAK,EAAAL,GAEA6C,EAAA3P,EAAA,GAAArnD,MAAA7f,OAEA,IAAA,IAAAf,EAAA,EAAAA,EAAA23E,EAAA33E,IACA,GAAAioE,EAAAjoE,GAAA4gB,MAAA7f,SAAA62E,EACA,MAAAn9D,GAAAs6D,EAAA,+BAAA9M,EAAAjoE,GAAA4gB,MAAA7f,OAAA,QAAA62E,EAAA,KAIAjsD,EAAA,IAAA25C,EAAA2C,OACA,CAEA,GAAA,MAAA8M,EAAAO,MACA,MAAAS,GAAAhB,EAAA,4BAGAoB,EAAApB,GACAK,EAAAL,GACAppD,EAAAysD,QAIAjC,EAAApB,GACAK,EAAAL,GACAppD,EAAA,IAAA25C,EAAA,IAGA,OAAAoS,EAAA3C,EAAAppD,GAhGA2sD,CAAAvD,IARAlrE,EAAAquE,EAAAnD,GAEAnQ,EAAA,IAAAiD,EAAAh+D,GAEA+6D,EAAA8S,EAAA3C,EAAAnQ,IA/CA2T,CAAAxD,IARAlrE,EAAAouE,EAAAlD,GAEAnQ,EAAA,IAAAiD,EAAAh+D,GAEA+6D,EAAA8S,EAAA3C,EAAAnQ,IA3GA4T,CAAAzD,GA/BA0D,CAAA1D,GAlFA2D,CAAA3D,GACApP,EAAA,CACA4N,IAAA,YACA9pD,IAAA,cAGAk8C,EAAAhuD,eAAAo9D,EAAAO,QACA9rE,EAAAurE,EAAAO,MACA99B,EAAAmuB,EAAAn8D,GACA4rE,EAAAL,GAEAnQ,EAAA,IAAAkH,EAAAtiE,EAAAguC,EADA,CAAAotB,IAEAA,EAAA8S,EAAA3C,EAAAnQ,GAGA,OAAAA,EArCA+T,CAAA5D,IAEA,MAAAA,EAAAO,OAAA,OAAAP,EAAAO,SACA9rE,EAAAurE,EAAAO,MACA99B,EAAA,MAAAhuC,EAAA,MAAA,SACAysE,EAAAlB,GACA9M,EAAA,CAAArD,EAAA2S,EAAAxC,IAEAnQ,EAAA,IAAAkH,EAAAtiE,EAAAguC,EAAAywB,IAGArD,EAvBAgU,CAAA7D,GAoKA,SAAA2C,EAAA3C,EAAAnQ,EAAAl6C,GAGA,IAFA,IAAAu9C,IAEA,MAAA8M,EAAAO,OAAA,MAAAP,EAAAO,OAAA,MAAAP,EAAAO,OAAA5qD,IAAA,IAAAA,EAAA3f,QAAAgqE,EAAAO,SAIA,GAFArN,EAAA,GAEA,MAAA8M,EAAAO,MAAA,CACA,IAAAh7B,EAAAqd,aAAAiN,KAAAtqB,EAAAuc,eAAA+N,GA0BA,OAAAA,EArBA,GAHAsR,EAAAnB,GACAK,EAAAL,GAEA,MAAAA,EAAAO,MAGA,IAFArN,EAAA53D,KAAAgmE,EAAAtB,IAEA,MAAAA,EAAAO,OAEAF,EAAAL,GACA9M,EAAA53D,KAAAgmE,EAAAtB,IAIA,GAAA,MAAAA,EAAAO,MACA,MAAAS,GAAAhB,EAAA,0BAGAoB,EAAApB,GACAK,EAAAL,GACAnQ,EAAA,IAAA6D,EAAA7D,EAAAqD,QAOA,GAAA,MAAA8M,EAAAO,MAAA,CAKA,GAHAY,EAAAnB,GACAK,EAAAL,GAEA,MAAAA,EAAAO,MAGA,IAFArN,EAAA53D,KAAAgmE,EAAAtB,IAEA,MAAAA,EAAAO,OAEAF,EAAAL,GACA9M,EAAA53D,KAAAgmE,EAAAtB,IAIA,GAAA,MAAAA,EAAAO,MACA,MAAAS,GAAAhB,EAAA,0BAGAoB,EAAApB,GACAK,EAAAL,GACAnQ,EAAA,IAAAJ,EAAAI,EAAA,IAAAqF,EAAAhC,QACA,CAIA,GAFAmN,EAAAL,GAEAA,EAAAM,YAAAjD,EAAAG,OACA,MAAAwD,GAAAhB,EAAA,oCAGA9M,EAAA53D,KAAA,IAAAw3D,EAAAkN,EAAAO,QACAF,EAAAL,GAEAnQ,EAAA,IAAAJ,EAAAI,EAAA,IAAAqF,EAAAhC,GADA,IAKA,OAAArD,EA6BA,SAAAqT,EAAAlD,GAGA,IAFA,IAAAlrE,EAAA,GAEA,KAAAorE,EAAAF,IAAA,MAAAE,EAAAF,IACA,OAAAE,EAAAF,KAGAlrE,GAAAorE,EAAAF,GACAj0B,EAAAi0B,IAGAlrE,GAAAorE,EAAAF,GACAj0B,EAAAi0B,GAKA,GAFAK,EAAAL,GAEA,MAAAA,EAAAO,MACA,MAAAS,GAAAhB,EAAA,4BAIA,OADAK,EAAAL,GACA7gB,KAAAhyD,MAAA,IAAA2H,EAAA,KA6BA,SAAAquE,EAAAnD,GAGA,IAFA,IAAAlrE,EAAA,GAEA,KAAAorE,EAAAF,IAAA,MAAAE,EAAAF,IACA,OAAAE,EAAAF,KAGAlrE,GAAAorE,EAAAF,GACAj0B,EAAAi0B,IAGAlrE,GAAAorE,EAAAF,GACAj0B,EAAAi0B,GAKA,GAFAK,EAAAL,GAEA,MAAAA,EAAAO,MACA,MAAAS,GAAAhB,EAAA,4BAIA,OADAK,EAAAL,GACA7gB,KAAAhyD,MAAA,IAAA2H,EAAA,KA6EA,SAAAwuE,GAAAtD,GAIA,IAHA,IAAA9M,EAAA,CAAAoO,EAAAtB,IACA7oE,EAAA,EAEA,MAAA6oE,EAAAO,OAEAF,EAAAL,GAEA9M,EAAA/7D,GAAAmqE,EAAAtB,GACA7oE,IAGA,OAAA,IAAAo5D,EAAA2C,GA2IA,SAAA4Q,GAAA9D,GACA,OAAAA,EAAAv6D,MAAAu6D,EAAAO,MAAAv0E,OAAA,EAUA,SAAAg1E,GAAAhB,EAAAnpC,GACA,IAAArrC,EAAAs4E,GAAA9D,GACA13D,EAAA,IAAA5b,YAAAmqC,EAAA,UAAArrC,EAAA,KAEA,OADA8c,EAAA,KAAA9c,EACA8c,EAUA,SAAA5C,GAAAs6D,EAAAnpC,GACA,IAAArrC,EAAAs4E,GAAA9D,GACA13D,EAAA,IAAA5b,YAAAmqC,EAAA,UAAArrC,EAAA,KAEA,OADA8c,EAAA,KAAA9c,EACA8c,EAGA,OAvvCAnb,EAAA8zE,QAAA,SAAAz1E,EAAAu4E,EAAAC,GACA,OAAA72E,EAAA82E,oBAAAz4E,IAAA2B,EAAA+2E,kBAAA14E,EAAAw4E,IAAA72E,EAAA+2E,kBAAAH,EAAAv4E,IASA2B,EAAA82E,oBAAA,SAAAz4E,GACA,MAAA,sDAAAoW,KAAApW,IAmBA2B,EAAA+2E,kBAAA,SAAAznC,EAAAD,GACA,MAAA,aAAA56B,KAAA66B,IAAA,oBAAA76B,KAAA46B,IAAA,2KAAA56B,KAAA46B,IAUArvC,EAAAqzE,aAAA,SAAAh1E,EAAAi1E,GAEA,MAAA,MAAAj1E,GAAA,OAAAA,GAAA,OAAAA,GAAA,EAAAi1E,GAWAtzE,EAAA4zE,cAAA,SAAAv1E,EAAAw4E,GACA,MAAA,MAAAx4E,GAAA,MAAAw4E,GAAA,MAAAA,GAAA,MAAAA,GASA72E,EAAA0zE,WAAA,SAAAr1E,GACA,MAAA,KAAAA,GAAAA,GAAA,KAAA,MAAAA,GASA2B,EAAA2zE,QAAA,SAAAt1E,GACA,MAAA,KAAAA,GAAAA,GAAA,KA4qCA2B,2fCpqDA,aAEA,IAAAstE,EAAAzvE,EAAA,qBAAAy7B,UAiCA36B,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QAzBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA54C,EAAAk5C,EAAA9zD,EAAA,gCAEA,OAAAwzD,EAAA,QAAA,CACA2lB,SAAA,SAAArkE,GAEA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAGA,IACA,OAAA6X,EAAAA,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,2FC7BA,aAEA,IAAAuX,EAAAzvE,EAAA,qBAAAy7B,UAkCA36B,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1O,EAAAgP,EAAA9zD,EAAA,iCAEA,OAAAwzD,EAAA,SAAA,CACA2lB,SAAA,SAAArkE,GAEA,IAAAgnB,EAAAhnB,EAAA9T,OAAA,EACAiqC,EAAAn2B,EAAAgnB,GAEAye,EAAAsG,SAAA5V,GACAn2B,EAAAgnB,GAAAmP,EAAA,EACAsP,EAAA6b,YAAAnrB,KACAn2B,EAAAgnB,GAAAmP,EAAAloC,MAAA,IAGA,IACA,OAAA+hD,EAAAlqC,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,4FC9BA,aAEA,IAAAS,EAAA34D,EAAA,0BAQAc,EAAA26B,UAAA,SAAAy8B,GACA,OAAAA,GAAAA,EAAAU,aACA,IAAAD,EAAAT,EAAAz9C,MAAA,EAAAy9C,EAAAhuD,IAAA,OAAA3H,IAAA21D,EAAA/tD,IAAA+tD,EAAA/tD,IAAA,OAAA5H,GAGA21D,wDCfA,aAEA,IAAAxS,EAAA1lD,EAAA,qBAAA0lD,OAEA2zB,EAAAr5E,EAAA,qBAAAq5E,aAEAC,EAAAt5E,EAAA,wBAAAs5E,iBA8DA,SAAAC,EAAAl4E,EAAAkf,GAEA,IAAAzL,EAAAwkE,EAAA/4D,GACA,OAAAmlC,EAAArkD,EAAA,SAAAiG,EAAAmT,EAAAmR,GAEA,OAAA,IAAA9W,EACAyL,EAAAjZ,GACA,IAAAwN,EACAyL,EAAAjZ,EAAA,CAAAmT,EAAA,IAGA8F,EAAAjZ,EAAA,CAAAmT,EAAA,GAAAmR,KAKA9qB,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QAtEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAgmB,EAAA1lB,EAAA9zD,EAAA,oCACA2zD,EAAAG,EAAA9zD,EAAA,sCAEA,SAAAy5E,EAAA3kE,EAAAu+C,EAAAyG,GACA,IAAAz4D,EAAAkf,EAgBA,OAdAzL,EAAA,KACAzT,EAAAyT,EAAA,GAAAklD,UAAAV,KAAAQ,IAGAhlD,EAAA,KAGAyL,EAFAg6B,EAAAqd,aAAA9iD,EAAA,KAAAylC,EAAA8c,yBAAAviD,EAAA,IAEAA,EAAA,GAAAklD,UAAAV,KAAAQ,GAGA0f,EAAA1kE,EAAA,GAAAu+C,EAAAyG,IAIApU,EAAArkD,EAAAkf,GAGAk5D,EAAA7Q,SAAA,EAEA,IAAAljB,EAAA8N,EAAA,SAAA,CACAkmB,kBAAAH,EACAI,mBAAA,SAAAt4E,EAAAuV,GACA,OAAA+8C,EAAA4lB,EAAAl4E,EAAAif,UAAA1J,KAEAgjE,gBAAAP,EACAQ,iBAAA,SAAAx4E,EAAAuV,GACA,OAAA+8C,EAAA0lB,EAAAh4E,EAAAif,UAAA1J,OAKA,OAFA8uC,EAAA4f,WAAA/iE,EAEAk3E,6JCtDA,aAEA,IAAAH,EAAAt5E,EAAA,wBAAAs5E,iBAEA9+D,EAAAxa,EAAA,qBAAAwa,QAiEA1Z,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAgmB,EAAA1lB,EAAA9zD,EAAA,oCAEA,SAAA85E,EAAAhlE,EAAAu+C,EAAAyG,GACA,IAAAz4D,EAAAkf,EAgBA,OAdAzL,EAAA,KACAzT,EAAAyT,EAAA,GAAAklD,UAAAV,KAAAQ,IAGAhlD,EAAA,KAGAyL,EAFAg6B,EAAAqd,aAAA9iD,EAAA,KAAAylC,EAAA8c,yBAAAviD,EAAA,IAEAA,EAAA,GAAAklD,UAAAV,KAAAQ,GAGA0f,EAAA1kE,EAAA,GAAAu+C,EAAAyG,IAIAigB,EAAA14E,EAAAkf,GAGAu5D,EAAAlR,SAAA,EAEA,IAAAmR,EAAAvmB,EAAA,UAAA,CACAwmB,2BAAA,SAAApuD,EAAArL,GAEA,IAAAzL,EAAAwkE,EAAA/4D,IAEA,SAAA05D,EAAA3yE,EAAAmT,GACA4F,MAAA2gB,QAAA15B,GACAkT,EAAAlT,EAAA,SAAA8jE,EAAA9qE,GAEA25E,EAAA7O,EAAA3wD,EAAAqqC,OAAAxkD,EAAA,MAIA,IAAAwU,EACAyL,EAAAjZ,GACA,IAAAwN,EACAyL,EAAAjZ,EAAAmT,GAGA8F,EAAAjZ,EAAAmT,EAAAmR,GAKAquD,CAAAruD,EAAA9kB,UAAA,OAIA,OAAAgzE,qHClEA,aAEA54E,EAAAJ,QAAA,CAAAd,EAAA,qBAAAA,EAAA,sBAAAA,EAAA,sBAAAA,EAAA,uBAAAA,EAAA,qBAAAA,EAAA,mBAAAA,EAAA,mBAAAA,EAAA,oBAAAA,EAAA,mBAAAA,EAAA,qBAAAA,EAAA,mBAAAA,EAAA,sBAAAA,EAAA,mBAAAA,EAAA,qXCFA,aA4CAc,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QAtCA,SAAArW,EAAA1kC,EAAAi+C,GACA,OAAA,WAGA,IAFA,IAAAh/C,EAAA,GAEAxU,EAAA,EAAA45E,EAAA7jE,UAAArV,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAAqD,EAAA0S,UAAA/V,GAEA,GAAAi6C,EAAAoc,QAAAhzD,GACAA,EAAA8sC,QACA9sC,EAAAytC,KAAA,EAAAztC,EAAA80C,KAAA,EAAA,OACA,GAAA90C,IAAA,IAAAA,EAAA2nB,MACA3nB,EAAAA,EAAA23B,IAAA,SAAAvlB,GACA,OAAAA,EAAA,SAEA,GAAAwkC,EAAAvZ,QAAAr9B,IAAA42C,EAAA+b,SAAA3yD,GACAA,EAAAA,EAAA23B,IAAA,SAAAvlB,GACA,OAAAA,EAAA,SAEA,GAAAwkC,EAAAsG,SAAAl9C,GACAA,SACA,GAAA42C,EAAA6b,YAAAzyD,GACAA,EAAAA,EAAA2O,WAAA,OACA,GAAA,iBAAA3O,EAEA,MAAA,IAAAk5B,UAAA,gEAGA/nB,EAAAxU,GAAAqD,EAGA,IAAA6B,EAAA,IAAA+0C,EAAAh8B,MAEA,OADAg8B,EAAAh8B,MAAA3D,MAAApV,EAAAsP,GACAtP,8BCxCA,aAEA,IAAA8zE,EAAAt5E,EAAA,wBAAAs5E,iBAEAh+C,EAAAt7B,EAAA,qBAAAs7B,IAuDA,SAAA6+C,EAAAvuD,EAAArL,EAAA65D,GAEA,IAAAC,EAAAf,EAAA/4D,GAqBA,OAnBA,SAAA05D,EAAA3yE,EAAAmT,GACA,OAAA4F,MAAA2gB,QAAA15B,GACAg0B,EAAAh0B,EAAA,SAAA8jE,EAAA9qE,GAEA,OAAA25E,EAAA7O,EAAA3wD,EAAAqqC,OAAAxkD,EAAA,MAIA,IAAA+5E,EACA95D,EAAAjZ,GACA,IAAA+yE,EACA95D,EAAAjZ,EAAAmT,GAGA8F,EAAAjZ,EAAAmT,EAAA2/D,GAKAH,CAAAruD,EAAA,IAGA9qB,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAgmB,EAAA1lB,EAAA9zD,EAAA,oCACA2zD,EAAAG,EAAA9zD,EAAA,sCAEA,SAAAs6E,EAAAxlE,EAAAu+C,EAAAyG,GACA,IAAAz4D,EAAAkf,EAgBA,OAdAzL,EAAA,KACAzT,EAAAyT,EAAA,GAAAklD,UAAAV,KAAAQ,IAGAhlD,EAAA,KAGAyL,EAFAg6B,EAAAqd,aAAA9iD,EAAA,KAAAylC,EAAA8c,yBAAAviD,EAAA,IAEAA,EAAA,GAAAklD,UAAAV,KAAAQ,GAGA0f,EAAA1kE,EAAA,GAAAu+C,EAAAyG,IAIAx+B,EAAAj6B,EAAAkf,GAGA+5D,EAAA1R,SAAA,EAEA,IAAAttC,EAAAk4B,EAAA,MAAA,CACAkmB,kBAAA,SAAAr4E,EAAAkf,GACA,OAAA45D,EAAA94E,EAAAkf,EAAAlf,IAEAs4E,mBAAA,SAAAt4E,EAAAkf,GACA,OAAAozC,EAAAwmB,EAAA94E,EAAAyF,UAAAyZ,EAAAlf,OAGA,OAAAi5E,6JC/CA,aAEA,IAAA7K,EAAAzvE,EAAA,qBAAAy7B,UAEA8+C,EAAAv6E,EAAA,uCAkCAc,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAArpD,EAAA2pD,EAAA9zD,EAAA,kCACA,OAAAwzD,EAAA,MAAA,CACA2lB,SAAA,SAAArkE,GAEA,GAAA,IAAAA,EAAA9T,QAAAu5E,EAAAzlE,EAAA,IAAA,CACA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAIA,IACA,OAAAoH,EAAAyQ,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,uIChCA,aAEA,IAAAuX,EAAAzvE,EAAA,qBAAAy7B,UAEA8+C,EAAAv6E,EAAA,uCAkCAc,EAAA2I,KAAA,OACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAArI,EAAA2I,EAAA9zD,EAAA,mCACA,OAAAwzD,EAAA,OAAA,CACA2lB,SAAA,SAAArkE,GAEA,GAAA,IAAAA,EAAA9T,QAAAu5E,EAAAzlE,EAAA,IAAA,CACA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAIA,IACA,OAAAooD,EAAAvwC,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,wIChCA,aAEA,IAAAuX,EAAAzvE,EAAA,qBAAAy7B,UAEA8+C,EAAAv6E,EAAA,uCAkCAc,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAtpD,EAAA4pD,EAAA9zD,EAAA,kCACA,OAAAwzD,EAAA,MAAA,CACA2lB,SAAA,SAAArkE,GAEA,GAAA,IAAAA,EAAA9T,QAAAu5E,EAAAzlE,EAAA,IAAA,CACA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAIA,IACA,OAAAmH,EAAA0Q,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,uIChCA,aAyBAp3D,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QAnBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAxP,EAAA8P,EAAA9zD,EAAA,gCACA,OAAAwzD,EAAA,QAAA,CACA2lB,SAAA,SAAArkE,GASA,MALA,kBAFAA,EADAA,EAAA9T,OAAA,IAKA8T,EAAAxE,MAAA,GAGA0zC,EAAAppC,MAAA,KAAA9F,kECpBA,aAEA,IAAA26D,EAAAzvE,EAAA,qBAAAy7B,UAEA8+C,EAAAv6E,EAAA,uCAkCAc,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAmQ,EAAA7P,EAAA9zD,EAAA,kCACA,OAAAwzD,EAAA,MAAA,CACA2lB,SAAA,SAAArkE,GAEA,GAAA,GAAAA,EAAA9T,QAAAu5E,EAAAzlE,EAAA,IAAA,CACA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAIA,IACA,OAAA4gE,EAAA/oD,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,uIChCA,aAEA,IAAAuX,EAAAzvE,EAAA,qBAAAy7B,UAsBA36B,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QAfA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+N,EAAAzN,EAAA9zD,EAAA,iCACA,OAAAwzD,EAAA,SAAA,CACA2lB,SAAA,SAAArkE,GACA,IACA,OAAAysD,EAAA3mD,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,4FClBA,aAEA,IAAAuX,EAAAzvE,EAAA,qBAAAy7B,UAEA8+C,EAAAv6E,EAAA,uCAkCAc,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAv+C,EAAA6+C,EAAA9zD,EAAA,kCACA,OAAAwzD,EAAA,MAAA,CACA2lB,SAAA,SAAArkE,GAEA,GAAA,IAAAA,EAAA9T,QAAAu5E,EAAAzlE,EAAA,IAAA,CACA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAIA,IACA,OAAAkS,EAAA2F,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,uIChCA,aAiCAp3D,EAAA8vD,QA/BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GASA,OAAA,SAAAF,EAAAD,EAAAyG,GAEA,IAAAlzB,EAAA0sB,EAAA5N,OAAA,SAAAmf,GACA,OAAAtqB,EAAAqd,aAAAiN,MAAAA,EAAAp7D,QAAA4pD,MAAAwR,EAAAp7D,QAAAqwD,KACA,GAEA,IAAAlzB,EACA,MAAA,IAAAjmC,MAAA,qDAAA2yD,EAAA,KAIA,IAAA7pD,EAAAm9B,EAAAn9B,KAEA+wE,EAAApzE,OAAA62B,OAAA67B,GACA7sD,EAAAqmD,EAAA0G,UACA,OAAA,SAAA34D,GAEA,OADAm5E,EAAA/wE,GAAApI,EACA4L,EAAAqsD,KAAAkhB,gCC5BA,aAEA,IAAA/K,EAAAzvE,EAAA,qBAAAy7B,UAEA8+C,EAAAv6E,EAAA,uCAkCAc,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,uBACA3oC,EAAA8vD,QA1BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAinB,EAAA3mB,EAAA9zD,EAAA,kCACA,OAAAwzD,EAAA,MAAA,CACA2lB,SAAA,SAAArkE,GAEA,GAAA,GAAAA,EAAA9T,QAAAu5E,EAAAzlE,EAAA,IAAA,CACA,IAAAskE,EAAAtkE,EAAA,GAEAylC,EAAAsG,SAAAu4B,GACAtkE,EAAA,GAAAskE,EAAA,EACA7+B,EAAA6b,YAAAgjB,KACAtkE,EAAA,GAAAskE,EAAAr2E,MAAA,IAIA,IACA,OAAA03E,EAAA7/D,MAAA,KAAA9F,GACA,MAAAojD,GACA,MAAAuX,EAAAvX,uIChCA,aAEA,IAEAnqC,EAFA/tB,EAAA,wBAEA+tB,OA2ZAjtB,EAAA2I,KAAA,MACA3I,EAAA8vD,QA1ZA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,yCACA8B,EAAAgyD,EAAA9zD,EAAA,yBACA06E,EAAA5mB,EAAA9zD,EAAA,+BACA26E,EAAA7mB,EAAA9zD,EAAA,kCACA46E,EAAA9mB,EAAA9zD,EAAA,oCACAqT,EAAAygD,EAAA9zD,EAAA,8BACAuiE,EAAAzO,EAAA9zD,EAAA,4BACA66E,EAAA/mB,EAAA9zD,EAAA,iCACAw/D,EAAA1L,EAAA9zD,EAAA,gCACA86E,EAAAvgC,EAAAugC,aACA3iB,EAAA5d,EAAA4d,YACA4iB,EAAAxgC,EAAAwgC,IAkDA,SAAAC,EAAAtuE,GAEA,IAaApM,EAAAsK,EAAAjB,EAbAiuE,EAAAlrE,EAAAuuE,MAAA,GACAC,EAAAxuE,EAAAuuE,MAAA,GAEA96E,EAAAmB,KAAA4I,IAAA0tE,EAAAsD,GAEAt4C,EAAA7U,EAAArnB,MAAAgG,EAAAyuE,OAEAC,EAAA,GACAC,EAAA,CAAAzD,EAAAz3E,GAEAm7E,EAAA,GACAC,EAAA,CAAAp7E,EAAA+6E,GAIAr6E,EAAA,GAEA,IAAAP,EAAA,EAAAA,EAAAs3E,EAAAt3E,IACAO,EAAAP,GAAAA,EAIA,IAAAsK,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA,GAAA,EAAAA,EAEA,IAAAtK,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAAA,CAEA,IAAA4J,EAAA5I,KAAA4I,IAAA5J,EAAAsK,GAEAS,EAAA,EAEA,IAAA1B,EAAA,EAAAA,EAAAO,EAAAP,IAEA0B,EAAAqvE,EAAArvE,EAAAuvE,EAAAh4C,EAAAtiC,GAAAqJ,GAAAi5B,EAAAj5B,GAAAiB,KAGAg4B,EAAAtiC,GAAAsK,GAAAyI,EAAAuvB,EAAAtiC,GAAAsK,GAAAS,GAKA,IAAAuK,EAAAhL,EACA4wE,EAAA,EACAC,EAAA,EAEA,IAAAn7E,EAAAsK,EAAAtK,EAAAs3E,EAAAt3E,IAAA,CAEA,IAAAyV,EAAA6sB,EAAAtiC,GAAAsK,GAEA8wE,EAAA55E,EAAAiU,GAEAwsD,EAAAmZ,EAAAF,KAEA5lE,EAAAtV,EAEAk7E,EAAAE,EAEAD,EAAA1lE,GAaA,GARAnL,IAAAgL,IAEA/U,EAAA+J,GAAA,CAAA/J,EAAA+U,GAAA/U,EAAA+U,GAAA/U,EAAA+J,IAAA,GAEAutD,EAAAwjB,UAAA/wE,EAAAgL,EAAAgtB,IAIAh4B,EAAAgtE,EAEA,IAAAt3E,EAAAsK,EAAA,EAAAtK,EAAAs3E,EAAAt3E,IAAA,CAEA,IAAAs7E,EAAAh5C,EAAAtiC,GAAAsK,GAEAiwE,EAAAe,EAAA,KAEAh5C,EAAAtiC,GAAAsK,GAAA+vE,EAAA/3C,EAAAtiC,GAAAsK,GAAA6wE,KAOA,IAAA7wE,EAAA,EAAAA,EAAAswE,EAAAtwE,IAEA,IAAAtK,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEA,IAAAsK,IAEAtK,EAAA46E,IAEAI,EAAAh7E,GAAA,IAIA86E,EAAA96E,GAAA,IAIAA,EAAAsK,GAEAtK,EAAA46E,IAEAI,EAAAh7E,GAAAsK,GAAAg4B,EAAAtiC,GAAAsK,IAIAA,EAAAgtE,IAEAwD,EAAA96E,GAAAsK,GAAA,IAOAtK,IAAAsK,GAiBAtK,EAAA46E,IAEAI,EAAAh7E,GAAAsK,GAAA,GAIAA,EAAAgtE,IAEAwD,EAAA96E,GAAAsK,GAAAg4B,EAAAtiC,GAAAsK,MAvBAtK,EAAA46E,IAEAI,EAAAh7E,GAAAsK,GAAAg4B,EAAAtiC,GAAAsK,IAIAA,EAAAgtE,IAEAwD,EAAA96E,GAAAsK,GAAA,IAqBA,IAAAixE,EAAA,IAAA1jB,EAAA,CACAv1B,KAAAw4C,EACA7/C,KAAA8/C,IAGA56E,EAAA,IAAA03D,EAAA,CACAv1B,KAAA04C,EACA//C,KAAAggD,IAGAO,EAAA,GAEA,IAAAx7E,EAAA,EAAAH,EAAAU,EAAAG,OAAAV,EAAAH,EAAAG,IACAw7E,EAAAj7E,EAAAP,IAAAA,EAIA,MAAA,CACAy7E,EAAAF,EACAG,EAAAv7E,EACAI,EAAAi7E,EACAn1E,SAAA,WACA,MAAA,MAAAzD,KAAA64E,EAAAp1E,WAAA,QAAAzD,KAAA84E,EAAAr1E,WAAA,QAAAzD,KAAArC,IA0KA,OA9WA2yD,EAAA,MAAA,CACA2E,YAAA,SAAAzrD,GACA,OAAAsuE,EAAAtuE,IAEAouE,aAAA,SAAApuE,GACA,OAoMA,SAAAA,GAEA,IAmBApM,EAAAsK,EAAAjB,EAnBAiuE,EAAAlrE,EAAAuuE,MAAA,GACAC,EAAAxuE,EAAAuuE,MAAA,GAEA96E,EAAAmB,KAAA4I,IAAA0tE,EAAAsD,GAEAtuD,EAAAlgB,EAAAuvE,QACAxhE,EAAA/N,EAAA8R,OACA09D,EAAAxvE,EAAAyvE,KAEAC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAjB,EAAA,CAAAzD,EAAAz3E,GAEAo8E,EAAA,GACAC,EAAA,GACAC,EAAA,GACAlB,EAAA,CAAAp7E,EAAA+6E,GAIAwB,EAAA,GACAC,EAAA,GAEA,IAAAr8E,EAAA,EAAAA,EAAAs3E,EAAAt3E,IACAo8E,EAAAp8E,GAAAA,EACAq8E,EAAAr8E,GAAAA,EAIA,IAaAga,EAAA,WAEA,IAAAsiE,EAAA,IAAA7B,EAEAnwE,EAAAgtE,IAEA0E,EAAAhsE,KAAA8rE,EAAAp7E,QAEAo7E,EAAA9rE,KAAA,GACA+rE,EAAA/rE,KAAA1F,IAIA6xE,EAAAnsE,KAAAisE,EAAAv7E,QAEA,IAAA67E,EAAAX,EAAAtxE,GACAkyE,EAAAZ,EAAAtxE,EAAA,GAEA,IAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAEArJ,EAAAma,EAAA9Q,GAEAizE,EAAAjlE,IAAA+kE,EAAAp8E,GAAAssB,EAAAjjB,IAIA,EAAAiB,GAEAgyE,EAAApiE,QAAA,EAAA5P,EAAA,EAAA,SAAAjB,EAAAozE,GAEAjC,EAAAkC,YAAArzE,EAAAyyE,EAAAC,EAAAC,EAAA,SAAAh8E,EAAA28E,GAEAtzE,EAAArJ,GAEAs8E,EAAAM,WAAA58E,EAAAk/D,EAAAob,EAAAqC,EAAAF,SAOA,IAAAnnE,EAAAhL,EACA6wE,EAAAmB,EAAA7+D,IAAAnT,GACA4wE,EAAA15E,EAAA25E,GAEAmB,EAAApiE,QAAA5P,EAAA,EAAAgtE,EAAA,EAAA,SAAAv2E,EAAA0U,GAEA,IAAA2lE,EAAA55E,EAAAiU,GAEAwsD,EAAAmZ,EAAAF,KAEA5lE,EAAAvU,EAEAm6E,EAAAE,EAEAD,EAAA1lE,KAIAnL,IAAAgL,IAEAklE,EAAAa,UAAA/wE,EAAAgL,EAAAylE,EAAA,GAAAe,EAAAC,EAAAC,GAGAxB,EAAAa,UAAA/wE,EAAAgL,EAAA2lE,EAAA,GAAAgB,EAAAC,EAAAC,GAGAG,EAAAO,KAAAvyE,EAAAgL,GAhFA,SAAAvU,EAAA+C,GAEA,IAAAg5E,EAAAT,EAAAt7E,GACAg8E,EAAAV,EAAAv4E,GAEAs4E,EAAAU,GAAAh5E,EACAs4E,EAAAW,GAAAh8E,EAEAs7E,EAAAt7E,GAAAg8E,EACAV,EAAAv4E,GAAAg5E,EAyEAE,CAAA1yE,EAAAgL,IAIAgnE,EAAApiE,QAAA,EAAAo9D,EAAA,EAAA,SAAAv2E,EAAA0U,GAEA1U,GAAAuJ,GAEA2xE,EAAAjsE,KAAAyF,GACAymE,EAAAlsE,KAAAjP,KAGA0U,EAAA4kE,EAAA5kE,EAAA0lE,GAEAZ,EAAA9kE,EAAA,KAEAqmE,EAAA9rE,KAAAyF,GACAsmE,EAAA/rE,KAAAjP,QAMA,IAAAuJ,EAAA,EAAAA,EAAAswE,EAAAtwE,IACA0P,IAOA,OAHAmiE,EAAAnsE,KAAAisE,EAAAv7E,QACAs7E,EAAAhsE,KAAA8rE,EAAAp7E,QAEA,CACA+6E,EAAA,IAAAjB,EAAA,CACAluD,OAAAwvD,EACA3hE,MAAA4hE,EACAH,IAAAI,EACA/gD,KAAA8/C,IAEAW,EAAA,IAAAlB,EAAA,CACAluD,OAAA2vD,EACA9hE,MAAA+hE,EACAN,IAAAO,EACAlhD,KAAAggD,IAEA16E,EAAA67E,EACA/1E,SAAA,WACA,MAAA,MAAAzD,KAAA64E,EAAAp1E,WAAA,QAAAzD,KAAA84E,EAAAr1E,WAAA,QAAAzD,KAAArC,IApWA08E,CAAA7wE,IAEA2T,MAAA,SAAA3f,GAEA,IAEAT,EAAA+6E,EAFArnB,EAAAjzD,IAKA,MAAA,CACAq7E,EAAA97E,EAAA87E,EAAAj1E,UACAk1E,EAAA/7E,EAAA+7E,EAAAl1E,UACAjG,EAAAZ,EAAAY,+WC/DA,aAiOAC,EAAA2I,KAAA,KACA3I,EAAA8vD,QAhOA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,yCACA0hE,EAAA5N,EAAA9zD,EAAA,uBACAstC,EAAAwmB,EAAA9zD,EAAA,0BACA+G,EAAA+sD,EAAA9zD,EAAA,uBACA2iE,EAAA7O,EAAA9zD,EAAA,6BACAoD,EAAA0wD,EAAA9zD,EAAA,0BACA6D,EAAAiwD,EAAA9zD,EAAA,0BACAsgE,EAAAxM,EAAA9zD,EAAA,uBACAw/D,EAAA1L,EAAA9zD,EAAA,gCACA06E,EAAA5mB,EAAA9zD,EAAA,+BACA26E,EAAA7mB,EAAA9zD,EAAA,kCACA46E,EAAA9mB,EAAA9zD,EAAA,oCACAqT,EAAAygD,EAAA9zD,EAAA,8BAkEA,SAAAw9E,EAAA9wE,GAEA,IASApM,EAAAsK,EAAAjB,EATAiuE,EAAAlrE,EAAAuuE,MAAA,GAEApD,EAAAnrE,EAAAuuE,MAAA,GAEAwC,EAAAnwC,EAAA,CAAAsqC,GAAA,SACA8F,EAAAD,EAAAtC,MACAwC,EAAAjxE,EAAAhG,QACAk3E,EAAAD,EAAAxC,MAGApxE,EAAA23D,EAAA,CAAAkW,GAAA,IAEA,IAAAjuE,EAAA,EAAAA,EAAArI,KAAA4I,IAAA2tE,EAAAD,KAAAjuE,EAAA,CAwBA,IAAAk0E,EAAAD,EAAAj0E,GAAAA,GACAm0E,EAAAte,EAAAp8D,EAAAy6E,IACAE,EAAAzd,EAAAwd,GACAE,EAAA,EAEA,IAAA19E,EAAAqJ,EAAArJ,EAAAs3E,EAAAt3E,IACA09E,EAAAtD,EAAAsD,EAAApD,EAAAgD,EAAAt9E,GAAAqJ,GAAA22D,EAAAsd,EAAAt9E,GAAAqJ,MAGA,IAAAs0E,EAAArD,EAAAkD,EAAAj6E,EAAAm6E,IAEA,IAAAj3E,EAAAk3E,GAAA,CAEA,IAAAC,EAAA7qE,EAAAwqE,EAAAI,GAIA,IAAA39E,EAAAqJ,GAFAI,EAAAJ,GAAA,GAEArJ,EAAAs3E,EAAAt3E,IACAyJ,EAAAzJ,GAAAq6E,EAAAiD,EAAAt9E,GAAAqJ,GAAAu0E,GAIA,IAAAjjB,EAAAuE,EAAAc,EAAAqa,EAAAuD,EAAAD,KACA5yE,OAAA,EAcA,IAAAT,EAAAjB,EAAAiB,EAAAitE,EAAAjtE,IAAA,CAGA,IAFAS,EAAA,EAEA/K,EAAAqJ,EAAArJ,EAAAs3E,EAAAt3E,IACA+K,EAAAqvE,EAAArvE,EAAAuvE,EAAAta,EAAAv2D,EAAAzJ,IAAAs9E,EAAAt9E,GAAAsK,KAMA,IAFAS,EAAAuvE,EAAAvvE,EAAA4vD,GAEA36D,EAAAqJ,EAAArJ,EAAAs3E,EAAAt3E,IACAs9E,EAAAt9E,GAAAsK,GAAAgwE,EAAAvnE,EAAAuqE,EAAAt9E,GAAAsK,GAAAgwE,EAAA7wE,EAAAzJ,GAAA+K,IAAA0yE,GAYA,IAAAz9E,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAAA,CAGA,IAFA+K,EAAA,EAEAT,EAAAjB,EAAAiB,EAAAgtE,EAAAhtE,IACAS,EAAAqvE,EAAArvE,EAAAuvE,EAAA8C,EAAAp9E,GAAAsK,GAAAb,EAAAa,KAMA,IAFAS,EAAAuvE,EAAAvvE,EAAA4vD,GAEArwD,EAAAjB,EAAAiB,EAAAgtE,IAAAhtE,EACA8yE,EAAAp9E,GAAAsK,GAAA+vE,EAAAtnE,EAAAqqE,EAAAp9E,GAAAsK,GAAAgwE,EAAAvvE,EAAAi1D,EAAAv2D,EAAAa,MAAAmzE,KAQA,IAAAz9E,EAAA,EAAAA,EAAAs3E,IAAAt3E,EACA,IAAAsK,EAAA,EAAAA,EAAAtK,GAAAsK,EAAAitE,IAAAjtE,EAAA,CACA,GAAA+3D,EAAA,EAAAgY,EAAAiD,EAAAt9E,GAAAsK,GAAA,MACA,MAAA,IAAAjK,MAAA,kEAAAL,EAAA,KAAAsK,EAAA,QAAAgzE,EAAAt9E,GAAAsK,GAAA,KAGAgzE,EAAAt9E,GAAAsK,GAAAgwE,EAAAgD,EAAAt9E,GAAAsK,GAAA,GAKA,MAAA,CACA6yE,EAAAA,EACAE,EAAAA,EACAh3E,SAAA,WACA,MAAA,MAAAzD,KAAAu6E,EAAA92E,WAAA,QAAAzD,KAAAy6E,EAAAh3E,aASA,OAlKA6sD,EAAA,KAAA,CACA2E,YAAA,SAAAzrD,GACA,OAAA8wE,EAAA9wE,IAEAouE,aAAA,SAAApuE,GACA,OAyJA,SAAAA,GACA,MAAA,IAAA/L,MAAA,8CA1JAw9E,IAEA99D,MAAA,SAAA3f,GAEA,IAEAT,EAAAu9E,EAFA7pB,EAAAjzD,IAKA,MAAA,CACA+8E,EAAAx9E,EAAAw9E,EAAA32E,UACA62E,EAAA19E,EAAA09E,EAAA72E,8bC5EA,aAEA,IAGAsI,EAHApP,EAAA,wBAEA4kC,OACAx1B,UA0EAtO,EAAA2I,KAAA,MACA3I,EAAA8vD,QAzEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA4qB,EAAAtqB,EAAA9zD,EAAA,+BACAq+E,EAAAvqB,EAAA9zD,EAAA,8BAmEA,OA5BAwzD,EAAA,MAAA,CACA8qB,+BAAA,SAAA59E,EAAAovC,EAAAyuC,GAEA,IAAAnvE,EAAA0gC,IAAAA,EAAA,GAAA,EAAAA,EACA,MAAA,IAAAnvC,MAAA,yFAIA,GAAA49E,EAAA,GAAA,EAAAA,EACA,MAAA,IAAA59E,MAAA,2DAIA,IAAA0K,EAAA+yE,EAAAtuC,EAAApvC,GAAA,GAEAH,EAAA89E,EAAA39E,EAAA2K,EAAAkzE,GAEA,MAAA,CACAxC,EAAAx7E,EAAAw7E,EACAC,EAAAz7E,EAAAy7E,EACAn7E,EAAAN,EAAAi+E,KACA7tE,EAAAtF,EAAAsF,EACAhK,SAAA,WACA,MAAA,MAAAzD,KAAA64E,EAAAp1E,WAAA,QAAAzD,KAAA84E,EAAAr1E,WAAA,QAAAzD,KAAArC,EAAA8F,YAAAzD,KAAAyN,EAAA,QAAAzN,KAAAyN,EAAAhK,WAAA,IAAA,gICvEA,aAumBA7F,EAAA2I,KAAA,aACA3I,EAAA8vD,QAtmBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAArxD,EAAA2xD,EAAA9zD,EAAA,2BACA4b,EAAAk4C,EAAA9zD,EAAA,eACAqvE,EAAAvb,EAAA9zD,EAAA,wBACA+G,EAAA+sD,EAAA9zD,EAAA,oBACA6nE,EAAA/T,EAAA9zD,EAAA,oBACAgyE,EAAAle,EAAA9zD,EAAA,uBACA8nE,EAAAhU,EAAA9zD,EAAA,uCACA0oE,EAAA5U,EAAA9zD,EAAA,uCACA+rE,EAAAjY,EAAA9zD,EAAA,uCACAmuE,EAAAra,EAAA9zD,EAAA,0CACAyoE,EAAA3U,EAAA9zD,EAAA,qCAwCAo+D,EAAA5K,EAAA,aAAA,CACAirB,2BAAA,SAAAplB,EAAApxB,EAAAyW,GACA,IAAAggC,EAAA,GACAC,EAAAD,EAAArlB,EAAApxB,EAAAx+B,MAEA,IAAAjE,EAAAo5E,EAAAvlB,EAAAqlB,GAEA,OAAAhgC,EAAA9iC,SAAAA,EAAApW,GAAAA,GAEAq5E,mBAAA,SAAAxlB,EAAApxB,GACA,OAAAm2B,EAAA/E,EAAApxB,EAAA,CACArsB,UAAA,KAGAkjE,qBAAA,SAAAzlB,EAAApxB,GACA,OAAAm2B,EAAAj8D,EAAAk3D,GAAApxB,IAEA82C,6BAAA,SAAA1lB,EAAApxB,EAAAyW,GACA,OAAA0f,EAAAj8D,EAAAk3D,GAAApxB,EAAAyW,IAEAsgC,iBAAA,SAAA3lB,EAAApxB,GACA,OAAAm2B,EAAAj8D,EAAAk3D,GAAAl3D,EAAA8lC,KAEAg3C,yBAAA,SAAA5lB,EAAApxB,EAAAyW,GACA,OAAA0f,EAAAj8D,EAAAk3D,GAAAl3D,EAAA8lC,GAAAyW,IAEAwgC,eAAA,SAAA7lB,EAAApxB,GACA,OAAAm2B,EAAA/E,EAAAl3D,EAAA8lC,KAEAk3C,uBAAA,SAAA9lB,EAAApxB,EAAAyW,GACA,OAAA0f,EAAA/E,EAAAl3D,EAAA8lC,GAAAyW,MAgBA0f,EAAAghB,WAAA,EAEAhhB,EAAAkH,MAAA,SAAA+Z,GACA,OAAAC,EAAA1kE,MAAA,KAAAykE,EAAAvqE,OAIA,IAAAwqE,EAAA9rB,EAAA,YAAA,CACAqrB,mBAAA,SAAAxlB,EAAAh4D,GACA,OAAAk5C,EAAA6c,eAAAiC,IAAA,WAAAwO,EAAAxO,EAAA/xD,OACAg4E,EAAAn9E,EAAAk3D,EAAA/xD,OAAAX,WAAAtF,EAAAsF,WAAA,GAEA24E,EAAAjmB,EAAA1yD,WAAAtF,EAAAsF,WAAA,IAGA44E,qBAAA,SAAAlmB,EAAAh4D,GACA,GAAA,WAAAwmE,EAAAxmE,EAAAiG,OACA,OAAAg4E,EAAAjmB,EAAAl3D,EAAAd,EAAAiG,QAEA,MAAA,IAAA3G,MAAA,kEAGA6+E,iCAAA,SAAAnmB,EAAAh4D,EAAAyuC,GACA,OAAAwvC,EAAAjmB,EAAA1yD,WAAAtF,EAAAoI,KAAAqmC,EAAAxoC,QAEAm4E,yBAAA,SAAApmB,EAAAh4D,EAAAyuC,GASA,OANA,IAAAA,EACA,aAAAzuC,EAAA,IAEA,OAAAyuC,EAAA,YAAAzuC,EAAA,KAAAyuC,EAAA,MAGA,UAAAgV,OAAAuU,EAAA,eAoBAslB,EAAAnrB,EAAA,WAAA,CACAksB,+BAAA,SAAAhB,EAAA7Z,GAEA,OADA6Z,EAAA7Z,IAAA,GAGA8a,6BAAA,SAAAjB,EAAA7Z,EAAA+a,GAGA,OAAA/a,EAAAp7D,OAAAm2E,IACAlB,EAAA7Z,IAAA,IAMAgb,kCAAA,SAAAnB,EAAA7Z,EAAA+a,GACA,OAAAjB,EAAAD,EAAA7Z,EAAAuJ,QAAAwR,IAEAE,yCAAA,SAAApB,EAAA7Z,EAAA+a,GACA,OAAA,IAAA/a,EAAAqD,OAAAl9D,QAAA40E,GACAlB,EAAA7Z,IAAA,EAIA8Z,EAAAD,EAAA7Z,EAAAxL,KAAAumB,IAEAG,8CAAA,SAAArB,EAAA7Z,EAAA+a,GACA,GAAA,EAAA/a,EAAA/vD,KAAA9T,OAAA,CAGA,IAFA,IAAAg/E,EAAArB,EAAAD,EAAA7Z,EAAA/vD,KAAA,GAAA8qE,GAEAt/E,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,SAAAV,EACA0/E,EAAArB,EAAAD,EAAA7Z,EAAA/vD,KAAAxU,GAAAs/E,IAAAI,EAGA,GAAAA,EAEA,OADAtB,EAAA7Z,IAAA,EAKA,OAAA,KAWA+Z,EAAAprB,EAAA,cAAA,CACAysB,uBAAA,SAAApb,GACA,OAAAqb,EAAA,IAEAC,qBAAA,SAAAtb,EAAA6Z,GACA,YAAAn8E,IAAAm8E,EAAA7Z,GACAqb,EAAA,GAGAA,EAAA,IAEAE,0BAAA,SAAAvb,EAAA6Z,GACA,OAAA,IAAAvQ,EAAAyQ,EAAA/Z,EAAAuJ,QAAAsQ,KAEA2B,iCAAA,SAAAxb,EAAA6Z,GACA,YAAAn8E,IAAAm8E,EAAA7Z,GACAqb,EAAA,GAGAtB,EAAA/Z,EAAAxL,KAAAqlB,IAEA4B,uBAAA,SAAAzb,EAAA6Z,GAKA,GAJA,IAAA7Z,EAAA/vD,KAAA9T,QAqWA,SAAA6jE,GAEA,GAAA,QAAAA,EAAAp7D,MAAA,YAAAo7D,EAAAp7D,MAAA,QAAAo7D,EAAAp7D,MAAA,IAAAo7D,EAAA/vD,KAAA9T,OAAA,CAOA,IAAA,IAAAV,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,SAAAV,EACAukE,EAAA/vD,KAAAxU,GAAA4/E,EAAA,GAIA,MADArb,EAAA7K,UAAAV,OACA,IAAA34D,MAAA,uCAlXA4/E,CAAA1b,QAGAtiE,IAAAm8E,EAAA7Z,GACA,OAAAqb,EAAA,GAGA,IACAM,EAKAC,EAkNAzU,EAAAvgD,EAxNAi1D,EAAA7b,EAAA/vD,KAAA,GAEAtR,GAAA,EAEAm9E,GAAA,EAIA,OAAA9b,EAAAp7D,MACA,IAAA,OAEAjG,GAAA,EACAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAnU,EAAA,IAAA,MAAA,CAAA2U,EAAA,IAAA3U,EAAA,IAAA,SAAA,CAAAmU,EAAA,GAAAA,EAAA,SACA,MAEA,IAAA,OACA,IAAA,UAEA,GAAA,IAAArb,EAAA/vD,KAAA9T,OACAwC,GAAA,EACAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAxX,EAAA,OAAA,CAAAgY,WACA,GAAA,IAAA7b,EAAA/vD,KAAA9T,OAKA,OADA09E,EAFA8B,EAAA,IAAAzU,EAAA,IAAA,SAAA,CAAAmU,EAAA,GAAArb,EAAA/vD,KAAA,MAEA4pE,EAAA7Z,EAAA/vD,KAAA,IACA8pE,EAAA,IAAA7S,EAAA,IAAA,MAAA,CAAA2U,EAAAF,IAAA9B,GAGA,MAEA,IAAA,QACA8B,EAAAN,EAAA,IAIA,IAAA,MACA,GAAAM,GAAA,IAAA3b,EAAA/vD,KAAA9T,QAIA,GAAA,IAAA6jE,EAAA/vD,KAAA9T,QAAAw/E,GAAA,IAAA3b,EAAA/vD,KAAA9T,aAAAuB,IAAAm8E,EAAA7Z,EAAA/vD,KAAA,IAEA2rE,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAA2U,EAAAh6E,QAAA,IAAAgiE,EAAA,MAAA,CAAA8X,GAAA3b,EAAA/vD,KAAA,OACAtR,GAAA,OACA,GAAA,IAAAqhE,EAAA/vD,KAAA9T,OAEA,OAAA49E,EAAA,IAAA7S,EAAA,IAAA,SAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,IAAA,IAAAhY,EAAA,MAAA,CAAA7D,EAAA/vD,KAAA,OAAA4pE,QARA+B,EAAAC,EAAAh6E,QACAlD,GAAA,EAUA,MAEA,IAAA,MAGA,OAFAk7E,EAAA8B,GAAA9B,EAAA7Z,EAAA/vD,KAAA,IAEA8pE,EAAA,IAAA7S,EAAA,IAAA,MAAA,CAAA2U,EAAA7b,EAAA/vD,KAAA,KAAA4pE,GAEA,IAAA,MAEA+B,EAAA,IAAA/X,EAAA,MAAA,CAAAgY,EAAAh6E,UACA,MAEA,IAAA,MAEA+5E,EAAA,IAAA/X,EAAA,MAAA,CAAAgY,EAAAh6E,UACA,MAEA,IAAA,MAEA+5E,EAAA,IAAA1U,EAAA,IAAA,aAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,EAAAh6E,YACA,MAEA,IAAA,MAEA+5E,EAAA,IAAA1U,EAAA,IAAA,MAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,EAAAh6E,UAAAw5E,EAAA,KACA,MAEA,IAAA,MAEAO,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAlH,EAAA,IAAA6D,EAAA,MAAA,CAAAgY,EAAAh6E,YACA,MAEA,IAAA,MAEAi6E,GAAA,EACAF,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAlH,EAAA,IAAA6D,EAAA,MAAA,CAAAgY,EAAAh6E,YACA,MAEA,IAAA,MAEAi6E,GAAA,EACAF,EAAA,IAAA1U,EAAA,IAAA,MAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,EAAAh6E,UAAAw5E,EAAA,KACA,MAEA,IAAA,OAEA18E,GAAA,EACAi9E,EAAA,IAAA/X,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAnU,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,SACA,MAEA,IAAA,OAGAS,EADAn9E,GAAA,EAEAi9E,EAAA,IAAA/X,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAnU,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,SACA,MAEA,IAAA,OAEA18E,GAAA,EACAi9E,EAAA,IAAA1U,EAAA,IAAA,MAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,KACA,MAEA,IAAA,OAEA18E,GAAA,EACAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,EAAAh6E,UAAA,IAAAgiE,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,WAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,SACA,MAEA,IAAA,OAGAS,EADAn9E,GAAA,EAEAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,EAAAh6E,UAAA,IAAAgiE,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,WAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,SACA,MAEA,IAAA,OAGAS,EADAn9E,GAAA,EAEAi9E,EAAA,IAAA1U,EAAA,IAAA,MAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,KACA,MAEA,IAAA,OAEAO,EAAA,IAAA/X,EAAA,OAAA,CAAAgY,EAAAh6E,UACA,MAEA,IAAA,OAEA+5E,EAAA,IAAA/X,EAAA,OAAA,CAAAgY,EAAAh6E,UACA,MAEA,IAAA,OAEA+5E,EAAA,IAAA1U,EAAA,IAAA,MAAA,CAAA,IAAArD,EAAA,OAAA,CAAAgY,EAAAh6E,UAAAw5E,EAAA,KACA,MAEA,IAAA,OAEAS,GAAA,EACAF,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAlH,EAAA,IAAA6D,EAAA,OAAA,CAAAgY,EAAAh6E,YACA,MAEA,IAAA,OAEAi6E,GAAA,EACAF,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAlH,EAAA,IAAA6D,EAAA,OAAA,CAAAgY,EAAAh6E,YACA,MAEA,IAAA,OAEAi6E,GAAA,EACAF,EAAA,IAAA1U,EAAA,IAAA,MAAA,CAAA,IAAArD,EAAA,OAAA,CAAAgY,EAAAh6E,UAAAw5E,EAAA,KACA,MAEA,IAAA,QAEA18E,GAAA,EACAi9E,EAAA,IAAA/X,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,MAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,OACA,MAEA,IAAA,QAEA18E,GAAA,EACAi9E,EAAA,IAAA/X,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,WAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,OACA,MAEA,IAAA,QAEA18E,GAAA,EACAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAnU,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,OACA,MAEA,IAAA,QAGAS,EADAn9E,GAAA,EAEAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAA2U,EAAAh6E,QAAA,IAAAgiE,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAnU,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,WACA,MAEA,IAAA,QAGAS,EADAn9E,GAAA,EAEAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAA,IAAArD,EAAA,MAAA,CAAAgY,EAAAh6E,UAAA,IAAAgiE,EAAA,OAAA,CAAA,IAAAqD,EAAA,IAAA,MAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,KAAAA,EAAA,SACA,MAEA,IAAA,QAGAS,EADAn9E,GAAA,EAEAi9E,EAAA,IAAA1U,EAAA,IAAA,WAAA,CAAAmU,EAAA,GAAA,IAAAnU,EAAA,IAAA,MAAA,CAAA2U,EAAAh6E,QAAAw5E,EAAA,OACA,MAEA,IAAA,MAEAO,EAAA,IAAA1U,EAAA,IAAA,SAAA,CAAA,IAAArD,EAAA,IAAAD,EAAA,OAAA,CAAAiY,EAAAh6E,UAAAg6E,EAAAh6E,UACA,MAEA,IAAA,QAEA,QACA,MAAA,IAAA/F,MAAA,aAAAkkE,EAAAp7D,KAAA,8EAOAgiB,EAFAjoB,GACAwoE,EAAA,IACA,WAEAA,EAAA,IACA,YAOA,IAAA4U,EAAAhC,EAAA8B,EAAAhC,GAMA,OAJAiC,IACAC,EAAA,IAAA7U,EAAA,IAAA,aAAA,CAAA6U,KAGA,IAAA7U,EAAAC,EAAAvgD,EAAA,CAAAm1D,EAAAH,KAEAI,uBAAA,SAAAhc,EAAA6Z,GACA,QAAAn8E,IAAAm8E,EAAA7Z,GACA,OAAAqb,EAAA,GAGA,GAAA,MAAArb,EAAAmH,GAEA,OAAA,IAAAD,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAAotB,EAAA/vD,KAAAwmB,IAAA,SAAA33B,GACA,OAAAi7E,EAAAj7E,EAAA+6E,MAIA,GAAA,MAAA7Z,EAAAmH,GAAA,CAEA,GAAAnH,EAAA2I,UACA,OAAA,IAAAzB,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAAmnC,EAAA/Z,EAAA/vD,KAAA,GAAA4pE,KAIA,GAAA7Z,EAAA77D,WACA,OAAA,IAAA+iE,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAAmnC,EAAA/Z,EAAA/vD,KAAA,GAAA4pE,GAAAE,EAAA/Z,EAAA/vD,KAAA,GAAA4pE,KAIA,GAAA,MAAA7Z,EAAAmH,GAAA,CAEA,IAAA8U,EAAAjc,EAAA/vD,KAAA4wC,OAAA,SAAA/hD,GACA,YAAApB,IAAAm8E,EAAA/6E,KAGA,GAAA,EAAAm9E,EAAA9/E,OAAA,CACA,IAAA+/E,EAAAlc,EAAA/vD,KAAA4wC,OAAA,SAAA/hD,GACA,YAAApB,IAAAm8E,EAAA/6E,KAEAq9E,EAAA,IAAAD,EAAA//E,OAAA+/E,EAAA,GAAA,IAAAhV,EAAA,IAAA,WAAAgV,GACAE,EAAAH,EAAAh8B,OAAA85B,EAAAoC,EAAAtC,IACA,OAAA,IAAA3S,EAAA,IAAA,WAAAkV,GAIA,OAAA,IAAAlV,EAAA,IAAA,MAAAlH,EAAA/vD,KAAAwmB,IAAA,SAAA4lD,GACA,OAAA,IAAAnV,EAAA,IAAA,WAAAlH,EAAA/vD,KAAAwmB,IAAA,SAAA6lD,GACA,OAAAA,IAAAD,EAAAtC,EAAAuC,EAAAzC,GAAAyC,EAAAz6E,cAKA,GAAA,MAAAm+D,EAAAmH,IAAAnH,EAAA77D,WAAA,CACA,IAAA03E,EAAA7b,EAAA/vD,KAAA,GACA0rE,EAAA3b,EAAA/vD,KAAA,GAEA,YAAAvS,IAAAm8E,EAAA8B,GACA,IAAAzU,EAAA,IAAA,SAAA,CAAA6S,EAAA8B,EAAAhC,GAAA8B,SAIAj+E,IAAAm8E,EAAAgC,GACA,IAAA3U,EAAA,IAAA,WAAA,CAAA,IAAAA,EAAA,IAAA,aAAA,CAAA2U,IAAA,IAAA3U,EAAA,IAAA,SAAA,CAAA6S,EAAA4B,EAAA9B,GAAA,IAAA3S,EAAA,IAAA,MAAA,CAAAyU,EAAA95E,QAAAw5E,EAAA,SAIA,IAAAnU,EAAA,IAAA,SAAA,CAAA,IAAAA,EAAA,IAAA,WAAA,CAAA,IAAAA,EAAA,IAAA,WAAA,CAAA6S,EAAA8B,EAAAhC,GAAA8B,EAAA95E,UAAA,IAAAqlE,EAAA,IAAA,WAAA,CAAA2U,EAAAh6E,QAAAk4E,EAAA4B,EAAA9B,OAAA,IAAA3S,EAAA,IAAA,MAAA,CAAAyU,EAAA95E,QAAAw5E,EAAA,OAGA,GAAA,MAAArb,EAAAmH,IAAAnH,EAAA77D,WAAA,CACA,IAAAo4E,EAAAvc,EAAA/vD,KAAA,GACAusE,EAAAxc,EAAA/vD,KAAA,GAEA,QAAAvS,IAAAm8E,EAAA0C,GAEA,OAAA7mC,EAAA6c,eAAAgqB,KAAAr6E,EAAAq6E,EAAA95E,QAAA+nE,EAAA+R,EAAA95E,MAAA,IACA44E,EAAA,GAIA,IAAAnU,EAAA,IAAA,WAAA,CAAAlH,EAAA,IAAAkH,EAAA,IAAA,WAAA,CAAA,IAAArD,EAAA,MAAA,CAAA0Y,EAAA16E,UAAAk4E,EAAAyC,EAAA36E,QAAAg4E,OAGA,QAAAn8E,IAAAm8E,EAAA2C,GAmBA,OAAA,IAAAtV,EAAA,IAAA,WAAA,CAAA,IAAAA,EAAA,IAAA,MAAA,CAAAqV,EAAA16E,QAAA26E,EAAA36E,UAAA,IAAAqlE,EAAA,IAAA,MAAA,CAAA,IAAAA,EAAA,IAAA,WAAA,CAAA6S,EAAAwC,EAAA1C,GAAA,IAAA3S,EAAA,IAAA,SAAA,CAAAsV,EAAA36E,QAAA06E,EAAA16E,YAAA,IAAAqlE,EAAA,IAAA,WAAA,CAAA6S,EAAAyC,EAAA3C,GAAA,IAAAhW,EAAA,MAAA,CAAA0Y,EAAA16E,gBAlBA,GAAA6zC,EAAA6c,eAAAiqB,GAAA,CAEA,GAAAt6E,EAAAs6E,EAAA/5E,OACA,OAAA44E,EAAA,GAIA,GAAA7Q,EAAAgS,EAAA/5E,MAAA,GACA,OAAAs3E,EAAAwC,EAAA1C,GAKA,IAAA4C,EAAA,IAAAvV,EAAA,IAAA,MAAA,CAAAqV,EAAA16E,QAAA,IAAAqlE,EAAA,IAAA,WAAA,CAAAsV,EAAAnB,EAAA,OACA,OAAA,IAAAnU,EAAA,IAAA,WAAA,CAAAsV,EAAA36E,QAAA,IAAAqlE,EAAA,IAAA,WAAA,CAAA6S,EAAAwC,EAAA1C,GAAA4C,MAOA,MAAA,IAAA3gF,MAAA,aAAAkkE,EAAAmH,GAAA,iFAoCA,SAAAkU,EAAA54E,EAAAi6E,GACA,OAAA,IAAAzZ,EAAAkK,EAAA1qE,EAAAi6E,GAAA1rE,EAAA+uB,SAGA,OAAAw5B,uXCpmBA,aAEAl9D,EAAAJ,QAAA,CAAAd,EAAA,gBACAA,EAAA,cACAA,EAAA,iBACAA,EAAA,sBAAAA,EAAA,uBAAAA,EAAA,uBACAA,EAAA,mBAAAA,EAAA,oBAAAA,EAAA,qPCNA,aAu0BAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QAt0BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA53C,EAAAk4C,EAAA9zD,EAAA,eACAwhF,EAAA1tB,EAAA9zD,EAAA,4BACAyhF,EAAA3tB,EAAA9zD,EAAA,gCACAmC,EAAA2xD,EAAA9zD,EAAA,oCAEA4kC,EAAA5kC,EAAA,sBAEA8nE,EAAAhU,EAAA9zD,EAAA,uCACA+rE,EAAAjY,EAAA9zD,EAAA,uCACAyoE,EAAA3U,EAAA9zD,EAAA,qCAuDAw+D,EAAAhL,EAAA,cAAA,CACAp4B,OAAA,SAAAi+B,GACA,OAAAmF,EAAAr8D,EAAAk3D,GAAA,IAAA,IAEAqoB,kBAAA,SAAAroB,EAAAsoB,GACA,OAAAnjB,EAAAr8D,EAAAk3D,GAAA,GAAAsoB,IAEA1d,iBAAA,SAAA5K,EAAAS,GACA,OAAA0E,EAAAr8D,EAAAk3D,GAAAS,GAAA,IAEA8nB,0BAAA,SAAAvoB,EAAAS,EAAA6nB,GACA,OAAAnjB,EAAAr8D,EAAAk3D,GAAAS,EAAA6nB,IAEApd,KAAA,SAAAlL,GACA,OAAAmF,EAAAnF,EAAA,IAAA,IAEAwoB,gBAAA,SAAAxoB,EAAAsoB,GACA,OAAAnjB,EAAAnF,EAAA,GAAAsoB,IAEAG,eAAA,SAAAzoB,EAAAS,GACA,OAAA0E,EAAAnF,EAAAS,GAAA,IAEAioB,wBAAA,SAAA1oB,EAAAS,EAAA6nB,GACA,IAAAK,EAmMA,WACA,IAAAC,EAAA,CAAAT,EACA,CACA3F,EAAA,MACA57E,EAAA,OACA,CACA47E,EAAA,OACA57E,EAAA,KACAwhF,EACA,CACA5F,EAAA,YACA57E,EAAA,QACA,CACA47E,EAAA,WACA57E,EAAA,WACA,CACA47E,EAAA,QACA57E,EAAA,QACA,CACA47E,EAAA,YACA57E,EAAA,aACA,CACA47E,EAAA,MACA57E,EAAA,MAEAiiF,EAAA,CAAA,CACArG,EAAA,cACA57E,EAAA,SAEA,CACA47E,EAAA,cACA57E,EAAA,SAEA,CACA47E,EAAA,SACA57E,EAAA,SAEA,CACA47E,EAAA,QACA57E,EAAA,YAEA,CACA47E,EAAA,aACA57E,EAAA,mBAEA,CACA47E,EAAA,aACA57E,EAAA,iBAEA,CACA47E,EAAA,cACA57E,EAAA,aAEA,CACA47E,EAAA,WACA57E,EAAA,YAEA,CACA47E,EAAA,cACA57E,EAAA,aAEA,CACA47E,EAAA,WACA57E,EAAA,YAEA,CACA47E,EAAA,MACA57E,EAAA,WAEA,CACA47E,EAAA,OACA57E,EAAA,YAEA,CACA47E,EAAA,QACA57E,EAAA,OAEA,CACA47E,EAAA,OACA57E,EAAA,QAEA,CACA47E,EAAA,OACA57E,EAAA,QAEA,CACA47E,EAAA,MACA57E,EAAA,OAEA,CACA47E,EAAA,YACA57E,EAAA,WAEA,CACA47E,EAAA,WACA57E,EAAA,YAEA,CACA47E,EAAA,YACA57E,EAAA,WAEA,CACA47E,EAAA,WACA57E,EAAA,YAEA,CACA47E,EAAA,aACA57E,EAAA,gBAEA,CACA47E,EAAA,YACA57E,EAAA,WAEA,CACA47E,EAAA,WACA57E,EAAA,aAgBAkiF,EAAA,CAAA,CACAtG,EAAA,eACA57E,EAAA,gBAEA,CACA47E,EAAA,aACA57E,EAAA,iBAEA+hF,EAAA,GA8FA,OA1FAA,EAAAI,WAAAH,EAAAn9B,OAAAo9B,EAAAC,GAEAH,EAAAK,cA3BA,CAAA,CACAxG,EAAA,kBACA57E,EAAA,6BAEA,CACA47E,EAAA,eACA57E,EAAA,qBAEA,CACA47E,EAAA,eACA57E,EAAA,sBAmBA+hF,EAAAM,YAAAH,EAEAH,EAAAO,gBAAAN,EAAAn9B,OAAAo9B,GAKAF,EAAAQ,WAAA,CAAAhB,EACA,CACA3F,EAAA,OACA57E,EAAA,QAEA,CACA47E,EAAA,MACA57E,EAAA,OAEAwhF,EACA,CACA5F,EAAA,UACA57E,EAAA,aAEA,CACA47E,EAAA,SACA57E,EAAA,YAEA,CACA47E,EAAA,aACA57E,EAAA,cAEA,CACA47E,EAAA,YACA57E,EAAA,aAEA,CACA47E,EAAA,UACA57E,EAAA,aAEA,CACA47E,EAAA,SACA57E,EAAA,YAEA,CACA47E,EAAA,UACA57E,EAAA,aAEA,CACA47E,EAAA,SACA57E,EAAA,YAEA,CACA47E,EAAA,UACA57E,EAAA,aAEA,CACA47E,EAAA,SACA57E,EAAA,YAEA,CACA47E,EAAA,aACA57E,EAAA,aAEA,CACA47E,EAAA,YACA57E,EAAA,aAEA,CACA47E,EAAA,cACA57E,EAAA,YAEA,CACA47E,EAAA,SACA57E,EAAA,QAEA,CACA47E,EAAA,SACA57E,EAAA,SAEA,CACA47E,EAAA,MACA57E,EAAA,OAEA,CACA47E,EAAA,aACA57E,EAAA,iBAGA+hF,EA5aAS,GAEAC,EA0GA,SAAArpB,EAAAS,EAAA6oB,EAAAC,GACA,IAAAC,EAAA,GACAhe,EAAAjpD,EAAAy9C,EAAAupB,EAAA9oB,EAAA,CACAgpB,gBAAA,IAIAC,EAAA,QADAJ,IAAAA,GACA,IAAA,KAuBA,SAAAK,EAAAne,GACA,IAAAoe,EAAApe,EAAAtqB,KAEA,GAAA,iBAAA0oC,EAEA,MAAA,IAAAtiF,MAAA,sCACA,GAAA,iBAAAsiF,EACA,GAAA,MAAApe,EAAAmH,GAAA,CAKA,GAJA,eAAAnH,EAAA/vD,KAAA,GAAA2iC,KACAotB,EAAAA,EAAA/vD,KAAA,IAGA,iBAAA+vD,EAAA/vD,KAAA,GAAAylC,OAAA3V,EAAAx1B,UAAAnM,WAAA4hE,EAAA/vD,KAAA,GAAAxN,QACA,MAAA,IAAA3G,MAAA,mCAEAqiF,EAAAne,EAAA/vD,KAAA,QAEA,CACA,IAAA,IAAAiuE,EAAA/3E,QAAA65D,EAAAmH,IACA,MAAA,IAAArrE,MAAA,YAAAkkE,EAAAmH,GAAA,qCAGA,IAAA,IAAA1rE,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,OAAAV,IACA0iF,EAAAne,EAAA/vD,KAAAxU,SAIA,GAAA,eAAA2iF,EAAA,CACA,IAAAx5E,EAAAo7D,EAAAp7D,KAEAy5E,EAAAL,EAAA73E,QAAAvB,IAEA,IAAAy5E,GAEAL,EAAAvyE,KAAA7G,QAEA,GAAA,oBAAAw5E,EACAD,EAAAne,EAAAuJ,cACA,GAAA,iBAAA6U,EACA,MAAA,IAAAtiF,MAAA,QAAAsiF,EAAA,4CA7DAD,CAAAne,GACA,IAAAse,EAAA,GAGA,OAFAA,EAAA7vB,WAAAuR,EACAse,EAAAN,UAAAA,EACAM,EAtHAC,CAAA/pB,EAAAS,GAAA,EAAAkoB,EAAAI,YAEAiB,EAAAX,EAAAG,UAAA7hF,OAGA,GAFAq4D,EAAAqpB,EAAApvB,WAEA,GAAA+vB,EAAA,CAIA,IAAAC,EAEAV,EAJAvpB,EAwbA,SAAAkqB,EAAA1e,EAAA75B,EAAAw4C,GACA,IAAAP,EAAApe,EAAAtqB,KACAkpC,EAAA,EAAAptE,UAAArV,OAEA,GAAA,iBAAAiiF,GAAApe,EAAA77D,WAAA,CACA,IACAgV,EADA0lE,GAAA,EAYA,GATA,MAAA7e,EAAAmH,KAEA,oBAAAnH,EAAA/vD,KAAA,GAAAylC,MAAA,iBAAAsqB,EAAA/vD,KAAA,GAAAylC,MAAA,iBAAAsqB,EAAA/vD,KAAA,GAAAylC,OAEAv8B,EAAA/a,WAAA4hE,EAAA/vD,KAAA,GAAAxN,OACAo8E,EAAA,GAAA1lE,GAAA4mB,EAAAx1B,UAAA4O,KAIA0lE,EAAA,CAOA,GAAA,EAAA1lE,EAAA,CASA,IAAA2lE,EAAA9e,EAAA/vD,KAAA,GACA8uE,EAAA,IAAA7X,EAAA,IAAA,MAAA,CAAAlH,EAAA/vD,KAAA,GAAAm0C,YAAA,IAAA6e,EAAA9pD,EAAA,KACA6mD,EAAA,IAAAkH,EAAA,IAAA,WAAA,CAAA4X,EAAAC,SAQA/e,EAAA,IAAAkH,EAAA,IAAA,WAAA,CAAAlH,EAAA/vD,KAAA,GAAA+vD,EAAA/vD,KAAA,GAAAm0C,cAGAw6B,IAEA,YAAAD,EACAx4C,EAAAojC,QAAAvJ,EAEA75B,EAAAl2B,KAAA0uE,GAAA3e,IAQA,GAAA,oBAAAoe,EAEAM,EAAA1e,EAAAuJ,QAAAvJ,EAAA,gBACA,GAAA,iBAAAoe,GAAA,eAAAA,EACA,IAAA,IAAA3iF,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,OAAAV,IACAijF,EAAA1e,EAAA/vD,KAAAxU,GAAAukE,EAAAvkE,GAIA,IAAAmjF,EAEA,OAAA5e,EA9fA0e,CAAAlqB,GAKA,IAMAhuD,EANAw4E,GAAA,EACAC,GAAA,EAOA,IANAzqB,EAAAz9C,EAAAy9C,EAAA2oB,EAAAI,WAAA,GAAA,CACAU,gBAAA,IAOAF,EAAAiB,EAAA7B,EAAAK,cAAAL,EAAAM,YAGAuB,GAAAA,GAEAx4E,GAJAguD,EAAAz9C,EAAAy9C,EAAAupB,IAIAj8E,cAEA28E,GAIAQ,GAAA,EACAR,EAAAj4E,EAGAy4E,IAEAzqB,EAAAz9C,EAAAy9C,EAAA2oB,EAAAO,gBAAA,GAAA,CACAO,gBAAA,KAIAzpB,EAAAz9C,EAAAy9C,EAAA2oB,EAAAQ,WAAA,GAAA,CACAM,gBAAA,IAKA,IAAAiB,EAAA,GACAC,EAAA,GAyBA,MAvBA,iBAAA3qB,EAAA9e,MAAA8e,EAAArwD,YAAA,MAAAqwD,EAAA2S,IAEA,IAAAqX,IACAhqB,EAAAvkD,KAAA,GAAAmvE,EAAA5qB,EAAAvkD,KAAA,GAAAivE,GACA1qB,EAAAvkD,KAAA,GAAAmvE,EAAA5qB,EAAAvkD,KAAA,KAGA6sE,IACAqC,EAAA7uE,UAAAkkD,EAAAvkD,KAAA,GACAkvE,EAAAj0E,YAAAspD,EAAAvkD,KAAA,MAGA,IAAAuuE,IACAhqB,EAAA4qB,EAAA5qB,EAAA0qB,IAGApC,IACAqC,EAAA7uE,UAAAkkD,EACA2qB,EAAAj0E,YAAA,OAKA4xE,GACAqC,EAAAD,aAAAA,EACAC,EAAAnB,UAAAH,EAAAG,UACAmB,EAAA1wB,WAAA+F,EACA2qB,GAJA3qB,KAsdA,SAAA4qB,EAAApf,EAAAkf,QACAxhF,IAAAwhF,IACAA,EAAA,IAMA,IAAA1jF,EAAA,CACA6jF,IAAA,EACAnB,KAAA,IAGAoB,KAAA,IACAC,EARAL,EAAA,GAAA,EAUAM,EAAA,IA+DA,SAAAC,EAAAzf,EAAA0f,EAAAlkF,GACA,IAAA4iF,EAAApe,EAAAtqB,KAEA,GAAA,iBAAA0oC,EAGA,MAAA,IAAAtiF,MAAA,sCACA,GAAA,iBAAAsiF,EAAA,CAEA,IAAA,IAAA,OAAAj4E,QAAA65D,EAAAmH,IAAA,MAAA,IAAArrE,MAAA,YAAAkkE,EAAAmH,GAAA,YAEA,GAAA,OAAAuY,EAAA,CAEA,IAAA,eAAA1f,EAAAptB,IAAA,QAAAotB,EAAAptB,KAAA,QAAA8sC,EAAA9sC,IAAA,aAAA8sC,EAAA9sC,IAAA,aAAA8sC,EAAA9sC,GACA,MAAA,IAAA92C,MAAA,WAAAkkE,EAAAmH,GAAA,YAIA,IAAA,aAAAnH,EAAAptB,IAAA,QAAAotB,EAAAptB,IAAA,aAAAotB,EAAAptB,KAAA,QAAA8sC,EAAA9sC,IAAA,aAAA8sC,EAAA9sC,GACA,MAAA,IAAA92C,MAAA,WAAAkkE,EAAAmH,GAAA,YAIA,IAAA,aAAAnH,EAAAptB,IAAA,QAAAotB,EAAAptB,IAAA,eAAAotB,EAAAptB,KAAA,IAAAp3C,EAAAmkF,MACA,MAAA,IAAA7jF,MAAA,WAAAkkE,EAAAmH,GAAA,YAMA,MAAAnH,EAAAmH,IAAA,MAAAnH,EAAAmH,KACA3rE,EAAA8jF,KAAAtf,EAAAmH,IAGA,IAAA,IAAAyY,EAAA,EAAAA,EAAA5f,EAAA/vD,KAAA9T,OAAAyjF,IAEA,eAAA5f,EAAAptB,KAAAp3C,EAAA0iF,KAAA,KAEA,MAAAle,EAAAmH,IAAA,aAAAnH,EAAAptB,KACAp3C,EAAA8jF,KAAA,GACA9jF,EAAA6jF,IAAA,EAEA7jF,EAAA0iF,KAAA,IAAA0B,EAAA,IAAA5f,EAAAmH,IAGA3rE,EAAAmkF,MAAAC,EAEAH,EAAAzf,EAAA/vD,KAAA2vE,GAAA5f,EAAAxkE,QAGA,GAAA,eAAA4iF,EAAA,CAEA,GAAApe,EAAAp7D,OAAA46E,GAAA,KAAAA,EACA,MAAA,IAAA1jF,MAAA,mCAKA,GAFA0jF,EAAAxf,EAAAp7D,KAEA,OAAA86E,EAEA,YADAR,EAAA,GAAA,GAKA,GAAA,MAAAQ,EAAAvY,IAAA,IAAA3rE,EAAAmkF,MACA,MAAA,IAAA7jF,MAAA,uDAIA,GAAA,MAAA4jF,EAAAvY,IAAA,IAAA3rE,EAAAmkF,MACA,MAAA,IAAA7jF,MAAA,2DAIA,KAAAN,EAAA8jF,MAAA,MAAA9jF,EAAA8jF,OACAC,EAAA,IAAAL,EAAA,GAAA,GACAA,EAAA,IAAA1jF,EAAA6jF,KAAA,MAAA7jF,EAAA0iF,KAAA,GAAA,GACAqB,EAAA9iF,KAAA6I,IAAA,EAAAi6E,QAEA,CAAA,GAAA,iBAAAnB,EAgCA,MAAA,IAAAtiF,MAAA,QAAAsiF,EAAA,mBA/BA,IAAAyB,EAAAzhF,WAAA4hE,EAAAv9D,OAEA,GAAA,OAAAi9E,EAEA,YADAR,EAAA,GAAAW,GAIA,GAAA,MAAAH,EAAAvY,GAAA,CAEA,GAAA,IAAA3rE,EAAAmkF,MAAA,MAAA,IAAA7jF,MAAA,8BAEA,IAAAikC,EAAAx1B,UAAAs1E,IAAAA,GAAA,EACA,MAAA,IAAA/jF,MAAA,uCAGA,IAAA,IAAAgkF,EAAAP,EAAA,EAAAO,EAAAD,EAAAC,IACAZ,EAAAY,GAAA,EAMA,OAHAP,EAAAM,IAAAX,EAAAW,GAAA,GACAX,EAAAW,IAAArkF,EAAA6jF,KAAA,MAAA7jF,EAAA0iF,KAAA,GAAA,QACAqB,EAAA9iF,KAAA6I,IAAAu6E,EAAAN,IAIA/jF,EAAA6jF,IAAAQ,EAEA,KAAArkF,EAAA8jF,OACAJ,EAAA,IAAA1jF,EAAA6jF,KAAA,MAAA7jF,EAAA0iF,KAAA,GAAA,KAzKAuB,CAAAzf,EAAA,KAAAxkE,GAKA,IAHA,IACAukF,EADAt2B,GAAA,EAGAhuD,EAJA8jF,EAAAL,EAAA/iF,OAAA,EAIA,GAAAV,EAAAA,IACA,GAAA,IAAAyjF,EAAAzjF,GAAA,CACA,IAAA4R,EAAA,IAAA41D,EAAAxZ,EAAAy1B,EAAAzjF,GAAAgB,KAAAQ,IAAAiiF,EAAAzjF,KACA0rE,EAAA+X,EAAAzjF,GAAA,EAAA,IAAA,IAEA,GAAA,EAAAA,EAAA,CAEA,IAAAukF,EAAA,IAAApc,EAAA4b,GAEA,GAAA,EAAA/jF,EAAA,CACA,IAAAwkF,EAAA,IAAAhd,EAAAxnE,GACAukF,EAAA,IAAA9Y,EAAA,IAAA,MAAA,CAAA8Y,EAAAC,IAIA5yE,GADA,IAAA6xE,EAAAzjF,IAAAguD,EACA,IAAAyd,EAAA,IAAA,aAAA,CAAA8Y,IACA,IAAAvjF,KAAAQ,IAAAiiF,EAAAzjF,IACAukF,EAEA,IAAA9Y,EAAA,IAAA,WAAA,CAAA75D,EAAA2yE,IAKAD,EADAt2B,EACAp8C,EACA,KAAA85D,EACA,IAAAD,EAAA,IAAA,MAAA,CAAA6Y,EAAA1yE,IAEA,IAAA65D,EAAA,IAAA,WAAA,CAAA6Y,EAAA1yE,IAGAo8C,GAAA,EAIA,OAAAA,EACA,IAAAwZ,EAAA,GAEA8c,EAwIA,OAAApmB,qSCn0BA,aAEA,SAAA5J,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAsvBAhV,EAAAuyD,MAAA,EACAvyD,EAAA2I,KAAA,WACA3I,EAAA8vD,QAtvBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAlxD,EAAA2xD,EAAA9zD,EAAA,2BACAqvE,EAAAvb,EAAA9zD,EAAA,wBACA8nE,EAAAhU,EAAA9zD,EAAA,uCACA0oE,EAAA5U,EAAA9zD,EAAA,uCACA+rE,EAAAjY,EAAA9zD,EAAA,uCACAmuE,EAAAra,EAAA9zD,EAAA,0CACAyoE,EAAA3U,EAAA9zD,EAAA,qCACAyhF,EAAA3tB,EAAA9zD,EAAA,gCACAwhF,EAAA1tB,EAAA9zD,EAAA,4BACAkd,EAAA42C,EAAA9zD,EAAA,uBACA+kF,EAAAjxB,EAAA9zD,EAAA,oBACAglF,EAAAD,EAAAC,cACAC,EAAAF,EAAAE,cACA5qC,EAAA0qC,EAAA1qC,QACA6qC,EAAAH,EAAAG,WACAC,EAAAJ,EAAAI,WACAC,EAAAL,EAAAK,uBAsEAxpE,EAAA43C,EAAA,WAAA,CACAp4B,OAAA,SAAAi+B,GACA,OAAAz9C,EAAAzZ,EAAAk3D,GAAAz9C,EAAAgnE,MAAA,GAAA,KAEA3e,iBAAA,SAAA5K,EAAAS,GACA,OAAAl+C,EAAAzZ,EAAAk3D,GAAAz9C,EAAAgnE,MAAA9oB,EAAA,KAEAurB,yBAAA,SAAAhsB,EAAAS,EAAApb,GACA,OAAA9iC,EAAAzZ,EAAAk3D,GAAAz9C,EAAAgnE,MAAA9oB,EAAApb,IAEA4mC,gBAAA,SAAAjsB,EAAAupB,GACA,OAAAhnE,EAAAzZ,EAAAk3D,GAAAupB,EAAA,GAAA,KAEA2C,wBAAA,SAAAlsB,EAAAupB,EAAA9oB,GACA,OAAAl+C,EAAAzZ,EAAAk3D,GAAAupB,EAAA9oB,EAAA,KAEA0rB,gCAAA,SAAAnsB,EAAAupB,EAAA9oB,EAAApb,GACA,OAAA9iC,EAAAzZ,EAAAk3D,GAAAupB,EAAA9oB,EAAApb,IAEAojC,eAAA,SAAAzoB,EAAAS,GACA,OAAAl+C,EAAAy9C,EAAAz9C,EAAAgnE,MAAA9oB,EAAA,KAEA2rB,uBAAA,SAAApsB,EAAAS,EAAApb,GACA,OAAA9iC,EAAAy9C,EAAAz9C,EAAAgnE,MAAA9oB,EAAApb,IAEA6lB,KAAA,SAAAlL,GACA,OAAAz9C,EAAAy9C,EAAAz9C,EAAAgnE,MAAA,GAAA,KAEA8C,cAAA,SAAArsB,EAAAupB,GACA,OAAAhnE,EAAAy9C,EAAAupB,EAAA,GAAA,KAEA+C,sBAAA,SAAAtsB,EAAAupB,EAAA9oB,GACA,OAAAl+C,EAAAy9C,EAAAupB,EAAA9oB,EAAA,KAEA8rB,8BAAA,SAAAvsB,EAAAupB,EAAA9oB,EAAApb,GACAkkC,EAuMA,SAAAA,GAIA,IAFA,IAAAiD,EAAA,GAEAvlF,EAAA,EAAAA,EAAAsiF,EAAA5hF,OAAAV,IAAA,CACA,IAAAwlF,EAAAlD,EAAAtiF,GACAylF,OAAA,EAEAC,EAAApxB,EAAAkxB,GAEA,OAAAE,GACA,IAAA,SACA,IAAAC,EAAAH,EAAA5jE,MAAA,MAEA,GAAA,IAAA+jE,EAAAjlF,OAMA,MAAAU,YAAA,yBAAAokF,GALAA,EAAA,CACAjK,EAAAoK,EAAA,GACAhmF,EAAAgmF,EAAA,IAQA,IAAA,SAcA,GAbAF,EAAA,CACAlK,EAAAqK,EAAA/jF,EAAA2jF,EAAAjK,IACA57E,EAAAimF,EAAA/jF,EAAA2jF,EAAA7lF,KAGA6lF,EAAAppD,UACAqpD,EAAAh+C,SAAA+9C,EAAAppD,SAGAopD,EAAA/9C,WACAg+C,EAAAh+C,SAAA5lC,EAAA2jF,EAAA/9C,WAGAk9C,EAAAc,EAAAlK,GAAA,CACA,IAAAsK,EAAAf,EAAAW,EAAAlK,GAEAuK,EAgCA,IAAA3d,EAAA,KAAA4d,KA9BAN,EAAAO,SAAA,GACAP,EAAAO,SAAAzK,EAAAsK,EAAA,CAAAJ,EAAAlK,EAAAn1E,QAAA0/E,IAGA/rC,EAAA0rC,EAAAO,SAAAzK,GACAqJ,EAAAa,EAAAO,SAAAzK,GACAkK,EAAAO,SAAArmF,EAAAkmF,EAAA,CAAAJ,EAAA9lF,EAAAmmF,IAGA,MAEA,IAAA,WACAL,EAAAD,EACA,MAEA,QACA,MAAAjpD,UAAA,6BAAAmpD,GAKAH,EAAAv1E,KAAAy1E,GAGA,OAAAF,EA3QAU,CAAA3D,GAQA,IAPA,IAAAp9E,EAAA0X,EAAAm8C,EAAAS,GAEA0sB,EAAA,GACA18E,GAFAtE,EAAA0gF,EAAA1gF,IAEAmB,SAAA,CACAm/D,YAAA,SAGA0gB,EAAA18E,IAAA,CACA08E,EAAA18E,IAAA,EAGA,IAAA,IAAAxJ,EAFA+lF,EAAA,EAEA/lF,EAAAsiF,EAAA5hF,OAAAV,IAEAkF,EADA,mBAAAo9E,EAAAtiF,GACAsiF,EAAAtiF,GAAAkF,EAAAk5C,IAEArE,EAAA70C,GACAihF,EAAAjhF,EAAAo9E,EAAAtiF,KAGA6kF,EAAA3/E,GAGAsE,EAAAtE,EAAAmB,SAAA,CACAm/D,YAAA,QAIA,OAAAtgE,KAMA,SAAA0gF,EAAArhB,GACA,OAAAA,EAAAppC,UAAA,SAAAopC,EAAAp7B,EAAAuB,GACA,OAAAuP,EAAAmd,kBAAAmN,GAAAA,EAAAuJ,QAAAvJ,IALAjpD,EAAA4lE,aAAAA,EACA5lE,EAAAsB,QAAAA,EASA,IAAAwpE,EAAA,CACA/R,MAAA,EACAC,OAAA,EACA10E,GAAA,EACAI,GAAA,EACAyE,UAAA,EACA41D,KAAA,EACA5yD,MAAA,EACA6yD,OAAA,EACAC,QAAA,EACA3zD,KAAA,EACA4zD,KAAA,EACAllD,IAAA,EACAmlD,SAAA,EACAC,OAAA,EACAC,KAAA,GAcAr/C,EAAAgnE,MAAA,CAAApB,EAOA,CACA3F,EAAA,SACA57E,EAAA,KAEA,CACA47E,EAAA,OACA57E,EAAA,SAEA,CACA47E,EAAA,SACA57E,EAAA,YAEA,CACA47E,EAAA,KACA57E,EAAA,YACA,CACA47E,EAAA,UACA57E,EAAA,YAEA,CACA47E,EAAA,OACA57E,EAAA,WAEA,CACA47E,EAAA,gBACA57E,EAAA,iBAEA,CACA47E,EAAA,MACA57E,EAAA,OACA,CACA47E,EAAA,WACA57E,EAAA,YACA,CACA47E,EAAA,cACA57E,EAAA,aAEA,CACA47E,EAAA,MACA57E,EAAA,OACA,CACA47E,EAAA,OACA57E,EAAA,KACA,CACA47E,EAAA,aACA57E,EAAA,aACA,CACA47E,EAAA,gBACA57E,EAAA,cAEA,CACA47E,EAAA,sBACA57E,EAAA,0BACAwhF,EAAA,CACA5F,EAAA,UACA57E,EAAA,WAGA,CACA47E,EAAA,MACA57E,EAAA,MACAy8B,QAAA,CACAr5B,IAAA,CACAsjF,aAAA,KAGA,CACA9K,EAAA,MACA57E,EAAA,MACAy8B,QAAA,CACA2nB,SAAA,CACAsiC,aAAA,KAKA,CACA9K,EAAA,QACA57E,EAAA,QAEA,CACA47E,EAAA,YACA57E,EAAA,QAEA,CACA47E,EAAA,WACA57E,EAAA,WACA,CACA47E,EAAA,QACA57E,EAAA,QACA,CACA47E,EAAA,YACA57E,EAAA,aAEA,CACA47E,EAAA,YACA57E,EAAA,WAIA,CACA47E,EAAA,MACA57E,EAAA,MA2FA,IAAAomF,EAAA,EAaAI,EAAAjzB,EAAA,YAAA,CACAsuB,eAAA,SAAAjd,EAAAihB,GAGA,IAAAtgF,EAAAq/D,EAIA,GAAAr/D,aAAAumE,GAAAvmE,aAAAkjE,GACA,GAAAljE,EAAAsP,KACA,IAAA,IAAAxU,EAAA,EAAAA,EAAAkF,EAAAsP,KAAA9T,OAAAV,IACAkF,EAAAsP,KAAAxU,GAAAmmF,EAAAjhF,EAAAsP,KAAAxU,GAAAwlF,QAGAtgF,aAAA2oE,GACA3oE,EAAA4oE,UACA5oE,EAAA4oE,QAAAqY,EAAAjhF,EAAA4oE,QAAA0X,IAKA,IAAAc,EAAAd,EAAA7lF,EAEAsmD,EAAAsgC,EAAAf,EAAAjK,EAAAr2E,GAAA,GASA,IALA+gD,GAAAu/B,EAAAQ,WACAM,EAAAd,EAAAQ,SAAArmF,EACAsmD,EAAAsgC,EAAAf,EAAAQ,SAAAzK,EAAAr2E,GAAA,IAGA+gD,EAAA,CAIA,IAAA0lB,EAAAzmE,EAAAymE,SACAzmE,EAAAohF,EAAAlgF,QAEAulE,GAAA,aAAA2a,IACAphF,EAAAymE,UAAA,GAYAzmE,EARA,SAAA6lE,EAAAxG,GACA,OAAAA,EAAAjN,cAAArR,EAAAugC,aAAAlvE,eAAAitD,EAAAp7D,MACA88C,EAAAugC,aAAAjiB,EAAAp7D,MAAA/C,QAEAm+D,EAAAvpC,IAAA+vC,GAIAA,CAAA7lE,GAIA,OAAAA,KAqCA,SAAAuhF,EAAAC,EAAAC,GACA,IAAAzhF,EAAA,CACAshF,aAAA,IAIA,IAAAE,EAAAF,eAAAG,EAAAH,aACA,OAAAthF,EACA,IAAAwhF,EAAAF,aACA,OAAAG,EACA,IAAAA,EAAAH,aACA,OAAAE,EAIA,IAAA,IAAAxuE,KAAAwuE,EAAAF,aAGA,GAFAthF,EAAAshF,aAAAtuE,GAAAwuE,EAAAF,aAAAtuE,GAEAyuE,EAAAH,aAAAlvE,eAAAY,KACA0uE,EAAAF,EAAAF,aAAAtuE,GAAAyuE,EAAAH,aAAAtuE,IACA,OAAA,KAKA,IAAA,IAAAqzD,KAAAob,EAAAH,aACAthF,EAAAshF,aAAAjb,GAAAob,EAAAH,aAAAjb,GAGA,OAAArmE,EAQA,SAAA2hF,EAAAC,EAAAC,GACA,IAMAC,EANA9hF,EAAA,GAEA,GAAA,IAAA4hF,EAAApmF,QAAA,IAAAqmF,EAAArmF,OACA,OAAAwE,EAKA,IAAA,IAAA+hF,EAAA,EAAAA,EAAAH,EAAApmF,OAAAumF,IACA,IAAA,IAAAC,EAAA,EAAAA,EAAAH,EAAArmF,OAAAwmF,KACAF,EAAAP,EAAAK,EAAAG,GAAAF,EAAAG,MAGAhiF,EAAA8K,KAAAg3E,GAKA,OAAA9hF,EAsCA,SAAAqhF,EAAAf,EAAAjhB,EAAA4iB,GAKA,IAAAjiF,EAAA,CAAA,CACAshF,aAAA,KAGA,GAAAhB,aAAA/Z,GAAAlH,aAAAkH,GAAA+Z,aAAApd,GAAA7D,aAAA6D,EAAA,CAEA,GAAAod,aAAA/Z,GACA,GAAA+Z,EAAA9Z,KAAAnH,EAAAmH,IAAA8Z,EAAAruC,KAAAotB,EAAAptB,GACA,MAAA,QAEA,GAAAquC,aAAApd,GACAod,EAAAr8E,OAAAo7D,EAAAp7D,KACA,MAAA,GAKA,IAAA,IAAAo7D,EAAA/vD,KAAA9T,QAAA,IAAA8kF,EAAAhxE,KAAA9T,SAAAikF,EAAApgB,KAAA4iB,EAiBA,CAAA,GAAA,GAAA5iB,EAAA/vD,KAAA9T,QAAA,IAAA8kF,EAAAhxE,KAAA9T,OAAA,CAOA,IAHA,IAAA0mF,EAlKA,SAAA7iB,EAAAnoC,GACA,IACAirD,EAAAC,EADApiF,EAAA,GAEA2gF,EAAAf,EAAAvgB,GAEA,GAAAmgB,EAAAngB,EAAAnoC,GACA,IAAA,IAAAp8B,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,OAAAV,KACAsnF,EAAA/iB,EAAA/vD,KAAA/H,MAAA,IACAoxB,OAAA79B,EAAA,GACAqnF,EAAA,IAAAC,EAAA5mF,OAAA4mF,EAAA,GAAAzB,EAAAyB,GACApiF,EAAA8K,KAAA61E,EAAA,CAAAthB,EAAA/vD,KAAAxU,GAAAqnF,UAIAA,EAAA,KADAC,EAAA/iB,EAAA/vD,KAAA/H,MAAA,IACA/L,OAAA4mF,EAAA,GAAAzB,EAAAyB,GACApiF,EAAA8K,KAAA61E,EAAA,CAAAthB,EAAA/vD,KAAA,GAAA6yE,KAGA,OAAAniF,EAgJAqiF,CAAAhjB,EAAAihB,EAAAppD,SACAorD,EAAA,GAEArD,EAAA,EAAAA,EAAAiD,EAAA1mF,OAAAyjF,IAAA,CACA,IAAAsD,EAAAlB,EAAAf,EAAA4B,EAAAjD,IAAA,GAGAqD,EAAAA,EAAAhjC,OAAAijC,GAGA,OAAAD,EACA,GAAA,EAAAhC,EAAAhxE,KAAA9T,OACA,MAAAL,MAAA,+CAAAmlF,EAAAn/E,YAGA,MAAA,GAhCA,IAFA,IAAAqhF,EAAA,GAEA1nF,EAAA,EAAAA,EAAAwlF,EAAAhxE,KAAA9T,OAAAV,IAAA,CACA,IAAA2nF,EAAApB,EAAAf,EAAAhxE,KAAAxU,GAAAukE,EAAA/vD,KAAAxU,IAEA,GAAA,IAAA2nF,EAAAjnF,OAEA,MAAA,GAIAgnF,EAAA13E,KAAA23E,GAGAziF,EAnEA,SAAAwiF,GACA,GAAA,IAAAA,EAAAhnF,OACA,OAAAgnF,EAOA,IAJA,IAAAE,EAAAF,EAAAh8B,OAAAm7B,GACAgB,EAAA,GACAC,EAAA,GAEA9nF,EAAA,EAAAA,EAAA4nF,EAAAlnF,OAAAV,IAAA,CACA,IAAA+K,EAAA8oD,KAAAC,UAAA8zB,EAAA5nF,IAEA8nF,EAAA/8E,KACA+8E,EAAA/8E,IAAA,EACA88E,EAAA73E,KAAA43E,EAAA5nF,KAIA,OAAA6nF,EAiDAE,CAAAL,QAsBA,GAAAlC,aAAArd,EAAA,CAKA,GAAA,IAAAqd,EAAAr8E,KAAAzI,OACA,MAAA,IAAAL,MAAA,oCAGA,GAAA0yD,EAAAz7C,eAAAkuE,EAAAr8E,MAAA,CACA,IAAAi9E,EAAAZ,EAAAr8E,MACA,MAAA,IAAA9I,MAAA,sBAAAmlF,EAAAr8E,KAAA,kCAIA,GAAAq8E,EAAAr8E,OAAAo7D,EAAAp7D,KACA,MAAA,QAEA,GAAA,MAAAq8E,EAAAr8E,KAAA,IAAA,OAAAq8E,EAAAr8E,KAAAgM,UAAA,EAAA,GAIAjQ,EAAA,GAAAshF,aAAAhB,EAAAr8E,MAAAo7D,OACA,GAAA,MAAAihB,EAAAr8E,KAAA,GAAA,CAEA,GAAA8wC,EAAA6c,eAAAyN,GAIA,MAAA,GAHAr/D,EAAA,GAAAshF,aAAAhB,EAAAr8E,MAAAo7D,MAKA,CAAA,GAAA,MAAAihB,EAAAr8E,KAAA,GASA,MAAA,IAAA9I,MAAA,2BAAAmlF,EAAAr8E,MAPA,KAAAo7D,aAAAiD,GAIA,MAAA,GAHAtiE,EAAA,GAAAshF,aAAAhB,EAAAr8E,MAAAo7D,OAQA,CAAA,KAAAihB,aAAAhe,GAOA,MAAA,GALA,IAAAuH,EAAAyW,EAAAx+E,MAAAu9D,EAAAv9D,OACA,MAAA,GASA,OAAA9B,EAWA,SAAA0hF,EAAArmF,EAAA8P,GACA,GAAA9P,aAAAinE,GAAAn3D,aAAAm3D,GACA,IAAAuH,EAAAxuE,EAAAyG,MAAAqJ,EAAArJ,OACA,OAAA,OAEA,GAAAzG,aAAA4nE,GAAA93D,aAAA83D,GACA,GAAA5nE,EAAA4I,OAAAkH,EAAAlH,KACA,OAAA,MAEA,CAAA,KAAA5I,aAAAkrE,GAAAp7D,aAAAo7D,GAAAlrE,aAAA6nE,GAAA/3D,aAAA+3D,GAqBA,OAAA,EApBA,GAAA7nE,aAAAkrE,GACA,GAAAlrE,EAAAmrE,KAAAr7D,EAAAq7D,IAAAnrE,EAAA42C,KAAA9mC,EAAA8mC,GACA,OAAA,OAEA,GAAA52C,aAAA6nE,GACA7nE,EAAA4I,OAAAkH,EAAAlH,KACA,OAAA,EAIA,GAAA5I,EAAAiU,KAAA9T,SAAA2P,EAAAmE,KAAA9T,OACA,OAAA,EAGA,IAAA,IAAAV,EAAA,EAAAA,EAAAO,EAAAiU,KAAA9T,OAAAV,IACA,IAAA4mF,EAAArmF,EAAAiU,KAAAxU,GAAAqQ,EAAAmE,KAAAxU,IACA,OAAA,EAOA,OAAA,EAGA,OAAAsb,gZCrvBA,aA2DA9a,EAAAuyD,MAAA,EACAvyD,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,mBACA3oC,EAAA8vD,QA5DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAkR,EAAAlR,EAAAC,WAAAuR,KAAAN,KACAwH,EAAA1Y,EAAAC,WAAAuR,KAAAkH,aACArD,EAAArV,EAAAC,WAAAuR,KAAA6D,aACAyF,EAAA9a,EAAAC,WAAAuR,KAAAsJ,gBAkDA,OA/BA,SAAAjxD,EAAA2nD,EAAA/K,GACA,IAAAA,EACA,OAAA+K,EAGA,GAAAtqB,EAAAqd,aAAAiN,GAAA,CACA,IAAAv9D,EAAAwyD,EAAA+K,EAAAp7D,MAEA,GAAAnC,aAAAi9D,EACA,OAAArnD,EAAA5V,EAAAwyD,GACA,GAAA,iBAAAxyD,EACA,OAAA+rD,EAAAlxD,MAAAkT,OAAA/N,QAEA,CAAA,GAAAizC,EAAAkd,eAAAoN,GAAA,CACA,IAAA/vD,EAAA+vD,EAAA/vD,KAAAwmB,IAAA,SAAA33B,GACA,OAAAuZ,EAAAvZ,EAAAm2D,KAEA,OAAA,IAAAiS,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA3iC,EAAA+vD,EAAAoH,UACA,GAAA1xB,EAAAmd,kBAAAmN,GACA,OAAA,IAAAsJ,EAAAjxD,EAAA2nD,EAAAuJ,QAAAtU,IACA,GAAAvf,EAAA+c,eAAAuN,GAAA,CACA,IAAAyjB,EAAAzjB,EAAA/vD,KAAAwmB,IAAA,SAAA33B,GACA,OAAAuZ,EAAAvZ,EAAAm2D,KAGA,OAAA,IAAA4O,EAAA7D,EAAAp7D,KAAA6+E,IAGA,OAAAzjB,8BCrDA,aAqSA/jE,EAAAuyD,MAAA,EACAvyD,EAAA2I,KAAA,mBACA3I,EAAA2oC,KAAA,mBACA3oC,EAAA8vD,QAtSA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAA0xB,EAAAjxB,EAAA9zD,EAAA,WACAglF,EAAAD,EAAAC,cACAC,EAAAF,EAAAE,cACAsD,EAAAxD,EAAAwD,YACAnD,EAAAL,EAAAK,uBACAtd,EAAAzU,EAAAC,WAAAuR,KAAAiD,aACAiE,EAAA1Y,EAAAC,WAAAuR,KAAAkH,aACArD,EAAArV,EAAAC,WAAAuR,KAAA6D,aAOA,SAAA8f,EAAAC,EAAA3zE,EAAA4pC,GACA,IACA,OAAAgqC,EAAAr1B,EAAAo1B,GAAA7tE,MAAA,KAAA9F,GAAA4pC,GACA,MAAAwS,GASA,OAPAp8C,EAAAA,EAAAwmB,IAAA,SAAAj6B,GACA,OAAAk5C,EAAA8b,WAAAh1D,GACAA,EAAAyF,UAGAzF,IAEAqnF,EAAAr1B,EAAAo1B,GAAA7tE,MAAA,KAAA9F,GAAA4pC,IAIA,IAAAiqC,EAAAn1B,EAAA,CACAz4C,SAwEA,SAAAxa,GACA,IAAAJ,EACAyoF,EAAAroF,EAAA8K,EAAA9K,EAAAJ,EAQA,OALAA,EADAyoF,EAAA,EACA,IAAA7c,EAAA,IAAA,aAAA,CAAA,IAAAjE,GAAA8gB,KAEA,IAAA9gB,EAAA8gB,GAGA,IAAAroF,EAAAkD,EAIA,IAAAsoE,EAAA,IAAA,SAAA,CAAA5rE,EAAA,IAAA2nE,EAAAvnE,EAAAkD,KAHAtD,GAlFAykC,OAAA,SAAAzkC,GACA,OAAAA,EAAA,EACA0oF,EAAA,IAAA/gB,GAAA3nE,IAGA,IAAA2nE,EAAA3nE,IAEA83D,UAAA,SAAA93D,GACA,OAAAA,EAAA,EACA0oF,EAAA,IAAA/gB,GAAA3nE,IAGA,IAAA2nE,EAAA3nE,IAEAuC,QAAA,SAAA2I,GACA,MAAA,IAAA1K,MAAA,4CAKA,SAAAmoF,EAAA3oF,EAAAu+C,GAGA,GAFAA,IAAA,IAAAA,EAAAokC,gBAEArgF,SAAAtC,GAAA,CACA,IAAAI,EAAA8yD,EAAAkH,SAAAp6D,GAEA,GAAAI,EAAAuG,YAAA3G,EACA,OAAAI,EAIA,OAAAJ,EAKA,IAAAuoF,EAAAl1B,EAAA,CACAyQ,iBAAA,SAAA54D,EAAAqzC,GACA,MAAA,cAAA7oC,EAAA+uB,OACAyuB,EAAA+G,UAAA/uD,GACA,aAAAwK,EAAA+uB,OACAyuB,EAAAkH,SAAAlvD,GAGAy9E,EADA7lF,WAAAoI,GACAqzC,IAGAqqC,mBAAA,SAAA19E,EAAAqzC,GACA,OAAArzC,GAGA29E,oBAAA,SAAA39E,EAAAqzC,GACA,OAAArzC,GAGA49E,iBAAA,SAAA59E,EAAAqzC,GACA,OAAAoqC,EAAAz9E,EAAAqzC,IAEAwqC,kBAAA,SAAA79E,EAAAqzC,GACA,OAAA,IAAArzC,EAAA/I,GACA+I,EAGAy9E,EAAAz9E,EAAAhJ,GAAAq8C,MAIA,SAAAmqC,EAAA1oF,GACA,OAAA,IAAA4rE,EAAA,IAAA,aAAA,CAAA5rE,IA+BA,SAAAgpF,EAAA1xC,EAAA3iC,EAAAqxE,EAAAznC,GACA,OAAA5pC,EAAAk3C,OAAA,SAAAtrD,EAAAkB,GACA,GAAA24C,EAAAwc,OAAAr2D,IAAA65C,EAAAwc,OAAAn1D,GAOA24C,EAAAwc,OAAAr2D,GAEA65C,EAAAwc,OAAAn1D,KACAA,EAAA+mF,EAAA/mF,IAFAlB,EAAAioF,EAAAjoF,OARA,CACA,IACA,OAAA8nF,EAAA/wC,EAAA,CAAA/2C,EAAAkB,GAAA88C,GACA,MAAA0qC,IAEA1oF,EAAAioF,EAAAjoF,GACAkB,EAAA+mF,EAAA/mF,GAOA,OAAAukF,EAAA,CAAAzlF,EAAAkB,MA6IA,OAtRA,SAAAy3D,EAAA3a,GACA,IAAAl5C,EA6IA,SAAA6jF,EAAAxkB,EAAAnmB,GACA,OAAAmmB,EAAAtqB,MACA,IAAA,aACA,OAAAsqB,EAEA,IAAA,eACA,MAAA,iBAAAA,EAAAv9D,OAAAtE,MAAA6hE,EAAAv9D,OAIAu9D,EAHA6jB,EAAA7jB,EAAAv9D,MAAAo3C,GAKA,IAAA,eACA,GAAA2U,EAAAwR,EAAAp7D,OAAA4pD,EAAAwR,EAAAp7D,MAAAm/D,QACA,OAAA/D,EAIA,IAAAykB,EAAA,CAAA,MAAA,YAEA,IAAA,IAAAA,EAAAt+E,QAAA65D,EAAAp7D,MAAA,CACA,IAAA6+E,EAAAzjB,EAAA/vD,KAAAwmB,IAAA,SAAA33B,GACA,OAAA0lF,EAAA1lF,EAAA+6C,KAIA,IAAA4pC,EAAAl8B,KAAA7R,EAAAwc,QACA,IACA,OAAAyxB,EAAA3jB,EAAAp7D,KAAA6+E,EAAA5pC,GACA,MAAA6qC,IAOA,OAHAjB,EAAAA,EAAAhtD,IAAA,SAAA33B,GACA,OAAA42C,EAAAwc,OAAApzD,GAAAA,EAAAglF,EAAAhlF,KAEA,IAAA+kE,EAAA7D,EAAAp7D,KAAA6+E,GAMA,IAAA,eACA,IACAxzE,EACAtP,EAFAiyC,EAAAotB,EAAAptB,GAAA9wC,WAGAw/E,EAAAf,EAAAvgB,GAEA,GAAAA,EAAA2I,UACA14D,EAAA,CAAAu0E,EAAAxkB,EAAA/vD,KAAA,GAAA4pC,IAKAl5C,EAHA+0C,EAAAwc,OAAAjiD,EAAA,IAGAqxE,EAAArxE,GAFA0zE,EAAA/wC,EAAA3iC,EAAA4pC,QAIA,GAAAumC,EAAApgB,GAMA,GAJA/vD,GADAA,EAAAyzE,EAAA1jB,IACAvpC,IAAA,SAAA33B,GACA,OAAA0lF,EAAA1lF,EAAA+6C,KAGAsmC,EAAAvtC,GAAA,CAKA,IAHA,IAAA+xC,EAAA,GACAC,EAAA,GAEAnpF,EAAA,EAAAA,EAAAwU,EAAA9T,OAAAV,IACAi6C,EAAAwc,OAAAjiD,EAAAxU,IAGAmpF,EAAAn5E,KAAAwE,EAAAxU,IAFAkpF,EAAAl5E,KAAAwE,EAAAxU,IASAkF,EAHA,EAAAgkF,EAAAxoF,QACAwE,EAAA2jF,EAAA1xC,EAAA+xC,EAAArD,EAAAznC,GACA+qC,EAAA14E,QAAAvL,GACA2jF,EAAA1xC,EAAAgyC,EAAAtD,EAAAznC,IAGAyqC,EAAA1xC,EAAA3iC,EAAAqxE,EAAAznC,QAIAl5C,EAAA2jF,EAAA1xC,EAAA3iC,EAAAqxE,EAAAznC,QAIA5pC,EAAA+vD,EAAA/vD,KAAAwmB,IAAA,SAAA33B,GACA,OAAA0lF,EAAA1lF,EAAA+6C,KAEAl5C,EAAA2jF,EAAA1xC,EAAA3iC,EAAAqxE,EAAAznC,GAGA,OAAAl5C,EAEA,IAAA,kBAEA,OAAA6jF,EAAAxkB,EAAAuJ,QAAA1vB,GAEA,IAAA,eAGA,IAAA,YAGA,IAAA,iBAGA,IAAA,YAGA,IAAA,yBAGA,IAAA,YAGA,IAAA,aAGA,IAAA,YAGA,IAAA,aAGA,IAAA,kBAGA,QACA,MAAA,IAAA/9C,MAAA,gDAAAmkD,OAAA+f,EAAAtqB,QAjRA8uC,CAAAhwB,EAAA3a,GACA,OAAAnE,EAAAwc,OAAAvxD,GAAAA,EAAAmjF,EAAAnjF,2CCdA,aA4LA1E,EAAAuyD,MAAA,EACAvyD,EAAA2I,KAAA,eACA3I,EAAA2oC,KAAA,mBACA3oC,EAAA8vD,QA7LA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAgc,EAAAvb,EAAA9zD,EAAA,2BACA+G,EAAA+sD,EAAA9zD,EAAA,uBACAqD,EAAAywD,EAAA9zD,EAAA,yBACAqT,EAAAygD,EAAA9zD,EAAA,8BACAqkD,EAAAyP,EAAA9zD,EAAA,8BACAgN,EAAA8mD,EAAA9zD,EAAA,4BACA0D,EAAAowD,EAAA9zD,EAAA,yBACA8nE,EAAAzU,EAAAC,WAAAuR,KAAAiD,aACAiE,EAAA1Y,EAAAC,WAAAuR,KAAAkH,aACArD,EAAArV,EAAAC,WAAAuR,KAAA6D,aACAyF,EAAA9a,EAAAC,WAAAuR,KAAAsJ,gBACAub,EAAA,IAAA5hB,EAAA,GACA6hB,EAAA,IAAA7hB,EAAA,GA0KA,OAjJA,SAAA0Z,EAAA3c,GACA,GAAAtqB,EAAAkd,eAAAoN,IAAAA,EAAA2I,UAAA,CACA,IAAAoc,EAAApI,EAAA3c,EAAA/vD,KAAA,IAEA,GAAA,MAAA+vD,EAAAmH,GAEA,OAAA4d,EAGA,GAAA,MAAA/kB,EAAAmH,GAAA,CAEA,GAAAzxB,EAAAkd,eAAAmyB,GAAA,CACA,GAAAA,EAAApc,WAAA,MAAAoc,EAAA5d,GACA,OAAA4d,EAAA90E,KAAA,GACA,GAAA80E,EAAA5gF,YAAA,aAAA4gF,EAAAnyC,GACA,OAAA,IAAAs0B,EAAA,IAAA,WAAA,CAAA6d,EAAA90E,KAAA,GAAA80E,EAAA90E,KAAA,KAIA,OAAA,IAAAi3D,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAAmyC,UAEA,GAAArvC,EAAAkd,eAAAoN,IAAAA,EAAA77D,WAAA,CACA,IAAAnH,EAAA2/E,EAAA3c,EAAA/vD,KAAA,IAEA+0E,EAAArI,EAAA3c,EAAA/vD,KAAA,IAEA,GAAA,MAAA+vD,EAAAmH,GAAA,CACA,GAAAzxB,EAAA6c,eAAAv1D,GAAA,CACA,GAAAkF,EAAAlF,EAAAyF,OACA,OAAAuiF,EACA,GAAAtvC,EAAA6c,eAAAyyB,GACA,OAAA,IAAA/hB,EAAAzkE,EAAAxB,EAAAyF,MAAAuiF,EAAAviF,QAIA,OAAAizC,EAAA6c,eAAAyyB,IAAA9iF,EAAA8iF,EAAAviF,OACAzF,EAGA04C,EAAAkd,eAAAoyB,IAAAA,EAAArc,WAAA,MAAAqc,EAAA7d,GACA,IAAAD,EAAA,IAAA,WAAA,CAAAlqE,EAAAgoF,EAAA/0E,KAAA,KAGA,IAAAi3D,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAAoyC,EAAA,CAAAhoF,EAAAgoF,GAAA,CAAAhoF,IACA,GAAA,MAAAgjE,EAAAmH,GAAA,CACA,GAAAzxB,EAAA6c,eAAAv1D,IAAAgoF,EAAA,CACA,GAAAtvC,EAAA6c,eAAAyyB,GACA,OAAA,IAAA/hB,EAAAz0D,EAAAxR,EAAAyF,MAAAuiF,EAAAviF,QACA,GAAAP,EAAAlF,EAAAyF,OACA,OAAA,IAAAykE,EAAA,IAAA,aAAA,CAAA8d,IAKA,GAAA,aAAAhlB,EAAAptB,GACA,OAAA8C,EAAA6c,eAAAyyB,IAAA9iF,EAAA8iF,EAAAviF,OACAzF,EAGA04C,EAAAkd,eAAAoyB,IAAAA,EAAArc,WAAA,MAAAqc,EAAA7d,GACAwV,EAAA,IAAAzV,EAAA,IAAA,MAAA,CAAAlqE,EAAAgoF,EAAA/0E,KAAA,MAGA,IAAAi3D,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAA51C,EAAAgoF,QAEA,CAAA,GAAA,MAAAhlB,EAAAmH,GAAA,CACA,GAAAzxB,EAAA6c,eAAAv1D,GAAA,CACA,GAAAkF,EAAAlF,EAAAyF,OACA,OAAAoiF,EACA,GAAAra,EAAAxtE,EAAAyF,MAAA,GACA,OAAAuiF,EACA,GAAAtvC,EAAA6c,eAAAyyB,GACA,OAAA,IAAA/hB,EAAAzjB,EAAAxiD,EAAAyF,MAAAuiF,EAAAviF,QAIA,GAAAizC,EAAA6c,eAAAyyB,GAAA,CACA,GAAA9iF,EAAA8iF,EAAAviF,OACA,OAAAoiF,EACA,GAAAra,EAAAwa,EAAAviF,MAAA,GACA,OAAAzF,EACA,GAAA04C,EAAAkd,eAAA51D,IAAAA,EAAAmH,YAAAnH,EAAAmqE,KAAAnH,EAAAmH,GAAA,CACA,IAAA8d,EAAAjoF,EAAAiT,KAAA,GAEA,GAAAylC,EAAA6c,eAAA0yB,GAAA,CACA,IAAAC,EAAA,IAAAjiB,EAAAzjB,EAAAylC,EAAAxiF,MAAAuiF,EAAAviF,QACA,OAAA,IAAAykE,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAAsyC,EAAAloF,EAAAiT,KAAA,IAAA+vD,EAAAoH,WAIA,OAAA,IAAAF,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAAoyC,EAAAhoF,GAAAgjE,EAAAoH,UAGA,OAAA,IAAAF,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAA51C,EAAAgoF,GAAAhlB,EAAAoH,UACA,GAAA,MAAApH,EAAAmH,GAAA,CACA,GAAAzxB,EAAA6c,eAAAv1D,GAAA,CACA,GAAAkF,EAAAlF,EAAAyF,OACA,OAAAoiF,EACA,GAAAnvC,EAAA6c,eAAAyyB,KAAAxa,EAAAwa,EAAAviF,MAAA,IAAA+nE,EAAAwa,EAAAviF,MAAA,IAAA+nE,EAAAwa,EAAAviF,MAAA,IACA,OAAA,IAAAwgE,EAAA96D,EAAAnL,EAAAyF,MAAAuiF,EAAAviF,QAIA,OAAA,IAAAykE,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAA51C,EAAAgoF,IACA,GAAA,MAAAhlB,EAAAmH,GAAA,CACA,GAAAzxB,EAAA6c,eAAAyyB,GAAA,CACA,GAAA9iF,EAAA8iF,EAAAviF,OACA,OAAAqiF,EACA,GAAAta,EAAAwa,EAAAviF,MAAA,GACA,OAAAzF,EAEA,GAAA04C,EAAA6c,eAAAv1D,GAEA,OAAA,IAAAimE,EAAApkE,EAAA7B,EAAAyF,MAAAuiF,EAAAviF,QACA,GAAAizC,EAAAkd,eAAA51D,IAAAA,EAAAmH,YAAA,MAAAnH,EAAAmqE,GAAA,CACA,IAAAge,EAAAnoF,EAAAiT,KAAA,GAEA,GAAAylC,EAAA6c,eAAA4yB,GACA,OAAA,IAAAje,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAA51C,EAAAiT,KAAA,GAAA,IAAAgzD,EAAAzjB,EAAA2lC,EAAA1iF,MAAAuiF,EAAAviF,WAMA,OAAA,IAAAykE,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA,CAAA51C,EAAAgoF,UAEA,CAAA,GAAAtvC,EAAAmd,kBAAAmN,GAAA,CACA,IAAArkE,EAAAghF,EAAA3c,EAAAuJ,SAEA,OAAA7zB,EAAAmd,kBAAAl3D,IAAA+5C,EAAAqd,aAAAp3D,IAAA+5C,EAAA6c,eAAA52D,GACAA,EAGA,IAAA2tE,EAAA3tE,GACA,GAAA+5C,EAAA+c,eAAAuN,GAAA,CACA,IAAA/vD,EAAA+vD,EAAA/vD,KAAAwmB,IAAAkmD,GAAAlmD,IAAA,SAAA33B,GACA,OAAA42C,EAAAmd,kBAAA/zD,GAAAA,EAAAyqE,QAAAzqE,IAEA,OAAA,IAAA+kE,EAAA8Y,EAAA3c,EAAAptB,IAAA3iC,IAIA,OAAA+vD,uOCtLA,aAgLA/jE,EAAA8vD,QA9KA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAqV,EAAArV,EAAAC,WAAAuR,KAAA6D,aACAqD,EAAA1Y,EAAAC,WAAAuR,KAAAkH,aACAtD,EAAApV,EAAAC,WAAAuR,KAAA4D,WAKAke,EAAA,CACAtjF,KAAA,EACAghD,UAAA,GAEA4lC,EAAA,CACA5mF,KAAA,EACAghD,UAAA,GAiBA,SAAA4gC,EAAApgB,EAAAnoC,GACA,IAAA6d,EAAAkd,eAAAoN,GACA,OAAA,EAGA,IAAAp7D,EAAAo7D,EAAAptB,GAAA9wC,WAEA,OAAA+1B,GAAAA,EAAA9kB,eAAAnO,IAAAizB,EAAAjzB,GAAAmO,eAAA,eACA8kB,EAAAjzB,GAAAwgF,YAGAA,EAAAxgF,KAAA,EAyBA,SAAA8+E,EAAA1jB,GACA,IAAAmH,EACAke,EAAA,GAcA,OAAAjF,EAAApgB,IACAmH,EAAAnH,EAAAmH,GAbA,SAAAme,EAAAtlB,GACA,IAAA,IAAAvkE,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,OAAAV,IAAA,CACA,IAAA8qE,EAAAvG,EAAA/vD,KAAAxU,GAEAi6C,EAAAkd,eAAA2T,IAAAY,IAAAZ,EAAAY,GACAme,EAAA/e,GAEA8e,EAAA55E,KAAA86D,IAOA+e,CAAAtlB,GACAqlB,GAEArlB,EAAA/vD,KA0DA,SAAAswE,EAAAvgB,GACA,OAAAtqB,EAAAkd,eAAAoN,GACA,SAAA/vD,GACA,IACA,OAAA,IAAAi3D,EAAAlH,EAAAmH,GAAAnH,EAAAptB,GAAA3iC,EAAA+vD,EAAAoH,UACA,MAAA/T,GAEA,OADA1H,QAAAlzC,MAAA46C,GACA,KAIA,SAAApjD,GACA,OAAA,IAAA4zD,EAAA,IAAAD,EAAA5D,EAAAp7D,MAAAqL,IAKA,MAAA,CACAswE,uBAAAA,EACAJ,cApJA,SAAAngB,EAAAnoC,GACA,IAAA6d,EAAAkd,eAAAoN,GACA,OAAA,EAGA,IAAAp7D,EAAAo7D,EAAAptB,GAAA9wC,WAEA,OAAA+1B,GAAAA,EAAA9kB,eAAAnO,IAAAizB,EAAAjzB,GAAAmO,eAAA,eACA8kB,EAAAjzB,GAAAk9E,YAGAA,EAAAl9E,KAAA,GA0IAw7E,cAAAA,EACA5qC,QArHA,SAAAA,EAAAwqB,GACA,IAAAA,EAAA/vD,MAAA,IAAA+vD,EAAA/vD,KAAA9T,OACA,OAAA6jE,EAGAA,EAAA/vD,KAAAyzE,EAAA1jB,GAEA,IAAA,IAAAvkE,EAAA,EAAAA,EAAAukE,EAAA/vD,KAAA9T,OAAAV,IACA+5C,EAAAwqB,EAAA/vD,KAAAxU,KA8GAioF,YAAAA,EACArD,WAzEA,SAAAA,EAAArgB,GACA,GAAAA,EAAA/vD,MAAA,IAAA+vD,EAAA/vD,KAAA9T,OAAA,CAOA,IAHA,IAAAmlF,EAAAf,EAAAvgB,GACAgX,EAAAhX,EAAA/vD,KAAA9T,OAEAV,EAAA,EAAAA,EAAAu7E,EAAAv7E,IACA4kF,EAAArgB,EAAA/vD,KAAAxU,IAGA,GAAA,EAAAu7E,GAAAoJ,EAAApgB,GAAA,CAGA,IAFA,IAAAulB,EAAAvlB,EAAA/vD,KAAAvE,MAEA,EAAAs0D,EAAA/vD,KAAA9T,QACAopF,EAAAjE,EAAA,CAAAthB,EAAA/vD,KAAAvE,MAAA65E,IAGAvlB,EAAA/vD,KAAAs1E,EAAAt1E,QAuDAqwE,WA/CA,SAAAA,EAAAtgB,GACA,GAAAA,EAAA/vD,MAAA,IAAA+vD,EAAA/vD,KAAA9T,OAAA,CAOA,IAHA,IAAAmlF,EAAAf,EAAAvgB,GACAgX,EAAAhX,EAAA/vD,KAAA9T,OAEAV,EAAA,EAAAA,EAAAu7E,EAAAv7E,IACA6kF,EAAAtgB,EAAA/vD,KAAAxU,IAGA,GAAA,EAAAu7E,GAAAoJ,EAAApgB,GAAA,CAGA,IAFA,IAAAulB,EAAAvlB,EAAA/vD,KAAAtE,QAEA,EAAAq0D,EAAA/vD,KAAA9T,QACAopF,EAAAjE,EAAA,CAAAiE,EAAAvlB,EAAA/vD,KAAAtE,UAGAq0D,EAAA/vD,KAAAs1E,EAAAt1E,UAiCAhU,EAAAuyD,MAAA,4BCjLA,aAwLAvyD,EAAA2I,KAAA,SACA3I,EAAA8vD,QAvLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,yCACA26E,EAAA7mB,EAAA9zD,EAAA,kCACA46E,EAAA9mB,EAAA9zD,EAAA,oCACAqT,EAAAygD,EAAA9zD,EAAA,8BACA66E,EAAA/mB,EAAA9zD,EAAA,iCACAqqF,EAAAv2B,EAAA9zD,EAAA,4BACAm4D,EAAA5d,EAAA4d,YA8CA,SAAAmyB,EAAA59E,EAAA9K,GAaA,IATA,IAAA2oF,GAFA3oF,EAAAyoF,EAAA39E,EAAA9K,GAAA,IAEAu5E,MAEAvD,EAAAlrE,EAAAuuE,MAAA,GACAC,EAAAxuE,EAAAuuE,MAAA,GAEA55E,EAAA,GAEAuhC,EAAAl2B,EAAAyuE,MAEAvwE,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA,IAAA4/E,EAAAD,EAAA3/E,GAAA,IAAA,EAEA6/E,OAAA,EAEA,GAAA5P,EAAA2P,EAAA,GAkBAC,EAAA,MAlBA,CAEA,IAAAhP,EAAA74C,EAAAh4B,GAAAA,GAEA,GAAAiwE,EAAAY,EAAA,GAEA,MAAA,IAAA96E,MAAA,2DAIA8pF,EAAA9P,EAAA6P,EAAA/O,GAEA,IAAA,IAAAn7E,EAAAsK,EAAA,EAAAtK,EAAAs3E,EAAAt3E,IAEAiqF,EAAAjqF,GAAA,CAAA+S,EAAAk3E,EAAAjqF,GAAA,IAAA,EAAAs6E,EAAA6P,EAAA7nD,EAAAtiC,GAAAsK,MAQAvJ,EAAAuJ,GAAA,CAAA6/E,GAIA,OAAA,IAAAtyB,EAAA,CACAv1B,KAAAvhC,EACAk6B,KAAA,CAAAq8C,EAAA,KA+EA,OAlJApkB,EAAA,SAAA,CACAk3B,+BAAA,SAAAh+E,EAAA9K,GAEA,OAoEA,SAAA8K,EAAA9K,GAiBA,IAbA,IASAtB,EAAAqJ,EATA4gF,GAFA3oF,EAAAyoF,EAAA39E,EAAA9K,GAAA,IAEAu5E,MAEAvD,EAAAlrE,EAAAuuE,MAAA,GACAC,EAAAxuE,EAAAuuE,MAAA,GAEAruD,EAAAlgB,EAAAuvE,QACAxhE,EAAA/N,EAAA8R,OACA09D,EAAAxvE,EAAAyvE,KAIA96E,EAAA,GAEAuJ,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA,IAAA4/E,EAAAD,EAAA3/E,GAAA,IAAA,EAEA,GAAAiwE,EAAA2P,EAAA,GA2CAnpF,EAAAuJ,GAAA,CAAA,OA3CA,CAEA,IAAA6wE,EAAA,EAEAkP,EAAA,GACAC,EAAA,GAEA/O,EAAAK,EAAAtxE,EAAA,GAEA,IAAAjB,EAAAuyE,EAAAtxE,GAAAjB,EAAAkyE,EAAAlyE,KAEArJ,EAAAma,EAAA9Q,MAEAiB,EAEA6wE,EAAA7uD,EAAAjjB,GACAiB,EAAAtK,IAEAqqF,EAAAr6E,KAAAsc,EAAAjjB,IACAihF,EAAAt6E,KAAAhQ,IAKA,GAAAu6E,EAAAY,EAAA,GAEA,MAAA,IAAA96E,MAAA,2DAIA,IAAA8pF,EAAA9P,EAAA6P,EAAA/O,GAEA,IAAA9xE,EAAA,EAAAkyE,EAAA+O,EAAA5pF,OAAA2I,EAAAkyE,EAAAlyE,IAEArJ,EAAAsqF,EAAAjhF,GAEA4gF,EAAAjqF,GAAA,CAAA+S,EAAAk3E,EAAAjqF,GAAA,IAAA,EAAAs6E,EAAA6P,EAAAE,EAAAhhF,MAIAtI,EAAAuJ,GAAA,CAAA6/E,IAQA,OAAA,IAAAtyB,EAAA,CACAv1B,KAAAvhC,EACAk6B,KAAA,CAAAq8C,EAAA,KA3IAiT,CAAAn+E,EAAA9K,IAEAkpF,8BAAA,SAAAp+E,EAAA9K,GAEA,OAAA0oF,EAAA59E,EAAA9K,IAEAmpF,wBAAA,SAAArqF,EAAAkB,GAOA,OAHA0oF,EAFA32B,EAAAjzD,GAEAkB,GAGAkF,6PCnDA,aAEA,IAAAk6B,EAAA3gB,MAAA2gB,QA0HAlgC,EAAA2I,KAAA,UACA3I,EAAA8vD,QAzHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,yCACAs+D,EAAAxK,EAAA9zD,EAAA,yBACAy+D,EAAA3K,EAAA9zD,EAAA,yBACAgrF,EAAAl3B,EAAA9zD,EAAA,sBACAqqF,EAAAv2B,EAAA9zD,EAAA,4BACA0+D,EAAA5K,EAAA9zD,EAAA,aACAq+D,EAAAvK,EAAA9zD,EAAA,aAmCAu+D,EAAA/K,EAAA,UAAA,CACAu3B,wBAAA,SAAArqF,EAAAkB,GAEAlB,EAAAizD,EAAAjzD,GAEA,IAAA+C,EAAA66D,EAAA59D,GAKA,OAHAuqF,EAAAxnF,EAAAs4E,EAAAt4E,EAAAu4E,EAAAv4E,EAAA5C,EAAA,KAAAe,GAGAkF,WAEAgkF,8BAAA,SAAApqF,EAAAkB,GAEA,IAAA6B,EAAA66D,EAAA59D,GAEA,OAAAuqF,EAAAxnF,EAAAs4E,EAAAt4E,EAAAu4E,EAAAv4E,EAAA5C,EAAA,KAAAe,IAEA8oF,+BAAA,SAAAhqF,EAAAkB,GAEA,IAAA6B,EAAA66D,EAAA59D,GAEA,OAAAuqF,EAAAxnF,EAAAs4E,EAAAt4E,EAAAu4E,EAAAv4E,EAAA5C,EAAA,KAAAe,IAEAspF,+CAAA,SAAAxqF,EAAAkB,EAAAkuC,EAAAyuC,GAEA,IAAA96E,EAAAg7D,EAAA/9D,EAAAovC,EAAAyuC,GAEA,OAAA0M,EAAAxnF,EAAAs4E,EAAAt4E,EAAAu4E,EAAAv4E,EAAA5C,EAAA4C,EAAAkN,EAAA/O,IAEAupF,yBAAA,SAAA1nF,EAAA7B,GAEA,OAAAqpF,EAAAxnF,EAAAs4E,EAAAt4E,EAAAu4E,EAAAv4E,EAAA5C,EAAA4C,EAAAkN,EAAA/O,MAIAwpF,EAAA,SAAA1qF,GAEA,GAAA65C,EAAA+b,SAAA51D,GACA,OAAAA,EAIA,GAAAsgC,EAAAtgC,GACA,OAAAizD,EAAAjzD,GAIA,MAAA,IAAAm8B,UAAA,oCAGA,SAAAouD,EAAApP,EAAAp7E,EAAAI,EAAA8P,EAAA/O,GAEAi6E,EAAAuP,EAAAvP,GACAp7E,EAAA2qF,EAAA3qF,GAEAmB,EAAAyoF,EAAAxO,EAAAj6E,GAAA,GAEAf,IACAe,EAAAu5E,MAAA6P,EAAAnqF,EAAAe,EAAAu5E,QAIA,IAAA/2E,EAAAi6D,EAAAwd,EAAAj6E,GAEAP,EAAAq9D,EAAAj+D,EAAA2D,GAOA,OALAuM,IACAtP,EAAA85E,MAAA6P,EAAAr6E,EAAAtP,EAAA85E,QAIA95E,EAGA,OAAAk9D,iNCzHA,aAyLAz9D,EAAA2I,KAAA,SACA3I,EAAA8vD,QAxLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,yCACA26E,EAAA7mB,EAAA9zD,EAAA,kCACA46E,EAAA9mB,EAAA9zD,EAAA,oCACAqT,EAAAygD,EAAA9zD,EAAA,8BACA66E,EAAA/mB,EAAA9zD,EAAA,iCACAqqF,EAAAv2B,EAAA9zD,EAAA,4BACAm4D,EAAA5d,EAAA4d,YA8CA,SAAAkzB,EAAA3+E,EAAA9K,GAaA,IATA,IAAA2oF,GAFA3oF,EAAAyoF,EAAA39E,EAAA9K,GAAA,IAEAu5E,MAEAvD,EAAAlrE,EAAAuuE,MAAA,GACAC,EAAAxuE,EAAAuuE,MAAA,GAEA55E,EAAA,GAEAuhC,EAAAl2B,EAAAyuE,MAEAvwE,EAAAswE,EAAA,EAAA,GAAAtwE,EAAAA,IAAA,CAEA,IAAA4/E,EAAAD,EAAA3/E,GAAA,IAAA,EAEA6/E,OAAA,EAEA,GAAA5P,EAAA2P,EAAA,GAkBAC,EAAA,MAlBA,CAEA,IAAAhP,EAAA74C,EAAAh4B,GAAAA,GAEA,GAAAiwE,EAAAY,EAAA,GAEA,MAAA,IAAA96E,MAAA,2DAIA8pF,EAAA9P,EAAA6P,EAAA/O,GAEA,IAAA,IAAAn7E,EAAAsK,EAAA,EAAA,GAAAtK,EAAAA,IAEAiqF,EAAAjqF,GAAA,CAAA+S,EAAAk3E,EAAAjqF,GAAA,IAAA,EAAAs6E,EAAA6P,EAAA7nD,EAAAtiC,GAAAsK,MAQAvJ,EAAAuJ,GAAA,CAAA6/E,GAIA,OAAA,IAAAtyB,EAAA,CACAv1B,KAAAvhC,EACAk6B,KAAA,CAAAq8C,EAAA,KAgFA,OAnJApkB,EAAA,SAAA,CACAk3B,+BAAA,SAAAh+E,EAAA9K,GAEA,OAoEA,SAAA8K,EAAA9K,GAiBA,IAbA,IASAtB,EAAAqJ,EATA4gF,GAFA3oF,EAAAyoF,EAAA39E,EAAA9K,GAAA,IAEAu5E,MAEAvD,EAAAlrE,EAAAuuE,MAAA,GACAC,EAAAxuE,EAAAuuE,MAAA,GAEAruD,EAAAlgB,EAAAuvE,QACAxhE,EAAA/N,EAAA8R,OACA09D,EAAAxvE,EAAAyvE,KAIA96E,EAAA,GAEAuJ,EAAAswE,EAAA,EAAA,GAAAtwE,EAAAA,IAAA,CAEA,IAAA4/E,EAAAD,EAAA3/E,GAAA,IAAA,EAEA,GAAAiwE,EAAA2P,EAAA,GA4CAnpF,EAAAuJ,GAAA,CAAA,OA5CA,CAEA,IAAA6wE,EAAA,EAEAkP,EAAA,GACAC,EAAA,GAEArqF,EAAA27E,EAAAtxE,GACAixE,EAAAK,EAAAtxE,EAAA,GAEA,IAAAjB,EAAAkyE,EAAA,EAAAt7E,GAAAoJ,EAAAA,KAEArJ,EAAAma,EAAA9Q,MAEAiB,EAEA6wE,EAAA7uD,EAAAjjB,GACArJ,EAAAsK,IAEA+/E,EAAAr6E,KAAAsc,EAAAjjB,IACAihF,EAAAt6E,KAAAhQ,IAKA,GAAAu6E,EAAAY,EAAA,GAEA,MAAA,IAAA96E,MAAA,2DAIA,IAAA8pF,EAAA9P,EAAA6P,EAAA/O,GAEA,IAAA9xE,EAAA,EAAAkyE,EAAA+O,EAAA5pF,OAAA2I,EAAAkyE,EAAAlyE,IAEArJ,EAAAsqF,EAAAjhF,GAEA4gF,EAAAjqF,GAAA,CAAA+S,EAAAk3E,EAAAjqF,GAAA,GAAAs6E,EAAA6P,EAAAE,EAAAhhF,MAIAtI,EAAAuJ,GAAA,CAAA6/E,IAQA,OAAA,IAAAtyB,EAAA,CACAv1B,KAAAvhC,EACAk6B,KAAA,CAAAq8C,EAAA,KA5IA0T,CAAA5+E,EAAA9K,IAEAkpF,8BAAA,SAAAp+E,EAAA9K,GAEA,OAAAypF,EAAA3+E,EAAA9K,IAEAmpF,wBAAA,SAAArqF,EAAAkB,GAOA,OAHAypF,EAFA13B,EAAAjzD,GAEAkB,GAGAkF,6PCnDA,aAEA,IAAAi+E,EAAA/kF,EAAA,2BAEAo7B,EAAA2pD,EAAA3pD,OACAxP,EAAAm5D,EAAAn5D,MACAoV,EAAA3gB,MAAA2gB,QAoLAlgC,EAAA8vD,QAlLA,SAAArW,GACA,IAAA4d,EAAA5d,EAAA4d,YA8KA,OAnKA,SAAAzrD,EAAA9K,EAAA+U,GAEA,IAAA4kB,EAAA7uB,EAAA6uB,OAEA,GAAA,IAAAA,EAAAv6B,OACA,MAAA,IAAAy3D,WAAA,yCAAAr9B,EAAAm+B,OAAAh+B,GAAA,KAIA,IAQAqH,EAAAtiC,EAAAiqF,EARA3S,EAAAr8C,EAAA,GAGA,GAAAq8C,IAFAr8C,EAAA,GAGA,MAAA,IAAAk9B,WAAA,gCAAAr9B,EAAAm+B,OAAAh+B,GAAA,KAMA,GAAAgf,EAAA+b,SAAA10D,GAAA,CAEA,IAAA2pF,EAAA3pF,EAAA25B,OAEA,GAAA,IAAAgwD,EAAAvqF,OAAA,CAEA,GAAAuqF,EAAA,KAAA3T,EACA,MAAA,IAAAnf,WAAA,gEAQA,IAJA71B,EAAA,GAEA2nD,EAAA3oF,EAAAu5E,MAEA76E,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEAsiC,EAAAtiC,GAAA,CAAAiqF,EAAAjqF,IAIA,OAAA,IAAA63D,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAq8C,EAAA,GACA4T,SAAA5pF,EAAA6pF,YAKA,GAAA,IAAAF,EAAAvqF,OA4DA,MAAA,IAAAy3D,WAAA,gEA1DA,GAAA8yB,EAAA,KAAA3T,GAAA,IAAA2T,EAAA,GACA,MAAA,IAAA9yB,WAAA,gEAIA,GAAAle,EAAAkc,cAAA70D,GAAA,CAEA,GAAA+U,EAAA,CAMA,IAJAisB,EAAA,GAEA2nD,EAAA3oF,EAAAu5E,MAEA76E,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEAsiC,EAAAtiC,GAAA,CAAAiqF,EAAAjqF,GAAA,IAIA,OAAA,IAAA63D,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAq8C,EAAA,GACA4T,SAAA5pF,EAAA6pF,YAKA,OAAA7pF,EAMA,IAFAghC,EAAA,GAEAtiC,EAAA,EAAAA,EAAAs3E,EAAAt3E,IACAsiC,EAAAtiC,GAAA,CAAA,GAQA,IAJA,IAAAssB,EAAAhrB,EAAAq6E,QACAxhE,EAAA7Y,EAAA4c,OACA09D,EAAAt6E,EAAAu6E,KAEAW,EAAAZ,EAAA,GAAAvyE,EAAAuyE,EAAA,GAAAvyE,EAAAmzE,EAAAnzE,IAIAi5B,EAFAtiC,EAAAma,EAAA9Q,IAEA,GAAAijB,EAAAjjB,GAIA,OAAA,IAAAwuD,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAq8C,EAAA,GACA4T,SAAA5pF,EAAA6pF,YASA,GAAAzqD,EAAAp/B,GAAA,CAEA,IAAA8pF,EAAA9/D,EAAA2P,KAAA35B,GAEA,GAAA,IAAA8pF,EAAA1qF,OAAA,CAEA,GAAA0qF,EAAA,KAAA9T,EACA,MAAA,IAAAnf,WAAA,gEAMA,IAFA71B,EAAA,GAEAtiC,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEAsiC,EAAAtiC,GAAA,CAAAsB,EAAAtB,IAIA,OAAA,IAAA63D,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAq8C,EAAA,KAIA,GAAA,IAAA8T,EAAA1qF,OAsBA,MAAA,IAAAy3D,WAAA,gEApBA,GAAAizB,EAAA,KAAA9T,GAAA,IAAA8T,EAAA,GACA,MAAA,IAAAjzB,WAAA,gEAMA,IAFA71B,EAAA,GAEAtiC,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEAsiC,EAAAtiC,GAAA,CAAAsB,EAAAtB,GAAA,IAIA,OAAA,IAAA63D,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAq8C,EAAA,+DC9KA,aAqnBA92E,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QArnBA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAA63B,EAAA73B,EAAA9zD,EAAA,aACA4rF,GAAA93B,EAAA9zD,EAAA,cACA6rF,GAAA/3B,EAAA9zD,EAAA,aACAqD,GAAAywD,EAAA9zD,EAAA,yBACAqkD,GAAAyP,EAAA9zD,EAAA,8BACAyhE,GAAA3N,EAAA9zD,EAAA,2BAulBA,SAAA8rF,GAAAC,EAAAC,EAAAC,EAAAliF,EAAA5J,GACA,GAAA4rF,EAAA,GAAAA,EAAAC,EAAA,EAAA,CACA,IAAA,IAAAriF,EAAA,EAAAA,EAAAxJ,EAAAwJ,IACA,IAAAsiF,EAAAliF,EAAAJ,KACAsiF,EAAAliF,EAAAJ,GAAA,GAIAoiF,EAAA,EAIA,OAAAA,EAGA,SAAAG,GAAA5rF,EAAAsK,GACA,OAAAtK,IAAAsK,EAGA,OA7lBA,SAAAklC,EAAApvC,GAEA,IAAAA,GAAAovC,GAAA,GAAA,EAAAA,EACA,OAAA,KAIA,IAAA47C,EAAAhrF,EAAAu6E,MAEAvuE,EAAAg/E,EAAA,GACAvrF,EAAAurF,EAAA,GAEAM,EAAA,EAEAG,EAAA7qF,KAAA6I,IAAA,GAAA,GAAA7I,KAAAuC,KAAA1D,IAGAisF,EAgbA,SAAAt8C,EAAApvC,EAAAgM,EAAAvM,EAAAgsF,GAEA,IAAA5qC,EAAAkgB,GAAA/gE,GAEA,GAAA,IAAAovC,GAAA3vC,IAAAuM,EAEA,OAAArJ,GAAA3C,EAAA6gD,GAIA,GAAA,IAAAzR,EAgCA,OAAAuU,GAAA9C,EAAA7gD,GAzBA,IALA,IAAA2rF,EAAA9qC,EAAA/iC,OACA8tE,EAAA/qC,EAAA46B,KAEA/gE,EAAA,EAEAxQ,EAAA,EAAAA,EAAA8B,EAAA9B,IAAA,CAEA,IAAA/J,EAAAyrF,EAAA1hF,GAIA,GAFA0hF,EAAA1hF,GAAAwQ,IAEAkxE,EAAA1hF,EAAA,GAAA/J,EAAAsrF,GAKA,IAAA,IAAAhxE,EAAAmxE,EAAA1hF,EAAA,GAAA/J,EAAAsa,EAAAta,IACAwrF,EAAAjxE,KAAAixE,EAAAxrF,GASA,OAJAyrF,EAAA5/E,GAAA0O,EAEA1a,EAAA+gE,GAAAlgB,GAEA8C,GAAA9C,EAAA7gD,GAtdA6rF,CAAAz8C,EAAApvC,EAAAgM,EAAAvM,EAFAgsF,EAAA7qF,KAAA4I,IAAA/J,EAAA,EAAAgsF,IAKAP,GAAAQ,EAAAF,GAAA,MAuCA,IArCA,IAmCA5rF,EAAAsK,EAAAjB,EAAAmzE,EAAA0P,EAAAtsF,EAAAusF,EAAA99E,EAAA+9E,EAAAC,EAAAC,EAAAzxE,EAAAC,EAAAyxE,EAAAC,EAAArpF,EAnCAspF,EAAAX,EAAA5tE,OACAwuE,EAAAZ,EAAAjQ,KAEA8Q,EAAAD,EAAA7sF,GAEAqJ,EAAA,GAEAyiF,EAAA,GAGAiB,EAAA/sF,EAAA,EAEA4gD,EAAA,GAAA5gD,EAAA,GAEAk8C,EAAA,GAAAl8C,EAAA,GAEAgtF,EAAA,GAAAhtF,EAAA,GAEAitF,EAAA,GAAAjtF,EAAA,GAEA4J,EAAA,GAAA5J,EAAA,GAEAktF,EAAA,GAAAltF,EAAA,GAGA8qC,EAAAzhC,EAEAuiF,EAscA,SAAA5rF,EAAA6sF,EAAAf,EAAA9/E,EAAAkwC,EAAApR,EAAA8V,EAAAssC,EAAAH,EAAAnjF,EAAAojF,EAAAC,GAEA,IAAA,IAAAzjF,EAAA,EAAAA,EAAAxJ,EAAAwJ,IACAsiF,EAAA9/E,EAAAxC,GAAAqjF,EAAArjF,EAAA,GAAAqjF,EAAArjF,GAKA,IAAA,IAAArJ,EAFA2rF,EAAA9/E,EAAAhM,GAAA,EAEAG,GAAAH,EAAAG,IAEA2rF,EAAA5vC,EAAA/7C,IAAA,EACA2qC,EAAA3qC,IAAA,EACA2rF,EAAAlrC,EAAAzgD,IAAA,EAEA2rF,EAAAoB,EAAA/sF,IAAA,EAEA2rF,EAAAiB,EAAA5sF,GAAA,EAEA2rF,EAAAliF,EAAAzJ,GAAA,EAEA2rF,EAAAkB,EAAA7sF,GAAA,EAEA2rF,EAAAmB,EAAA9sF,GAAA2rF,EAAA9/E,EAAA7L,GAIA,IAAAyrF,EAAAD,GAAA,EAAA,EAAAG,EAAAliF,EAAA5J,GASA,OANA8rF,EAAAkB,EAAAhtF,IAAA,EAEA6sF,EAAA7sF,IAAA,EAEA8rF,EAAAliF,EAAA5J,GAAA,EAEA4rF,EAzeAuB,CAAAntF,EAAA6sF,EAAAf,EAnBA,EAmBA5vC,EAAApR,EAAA8V,EAAAssC,EAAAH,EAAAnjF,EAAAojF,EAAAC,GAGAG,EA+eA,SAAAptF,EAAA6sF,EAAAf,EAAAmB,EAAAD,EAAApjF,EAAAoiF,EAAAe,EAAA7wC,EAAApR,EAAA8V,GAIA,IAFA,IAAAwsC,EAAA,EAEAjtF,EAAA,EAAAA,EAAAH,EAAAG,IAAA,CAEA,IAAAmD,EAAAwoF,EAAAmB,EAAA9sF,GAEA,GAAA,IAAAmD,EAEAwoF,EAAAkB,EAAA7sF,IAAA,EACAitF,IAEAP,EAAA1sF,IAAA,EACA2rF,EAAAliF,EAAAzJ,GAAA,OACA,GAAA6rF,EAAA1oF,EAEAwoF,EAAAiB,EAAA5sF,GAAA,EAEA2rF,EAAAkB,EAAA7sF,IAAA,EACAitF,IACAP,EAAA1sF,GAAAqrF,EAAAxrF,GACA8rF,EAAAiB,EAAA/sF,SACA,CACA,IAAA2sF,EAAAb,EAAA5vC,EAAA54C,IAEA,IAAAqpF,IACA7hD,EAAA6hD,GAAAxsF,GAIA2rF,EAAAlrC,EAAAzgD,GAAA2rF,EAAA5vC,EAAA54C,GACAwoF,EAAA5vC,EAAA54C,GAAAnD,GAIA,OAAAitF,EAnhBAC,CAAArtF,EAAA6sF,EAAAf,EAAAmB,EAAAD,EAAApjF,EAAAoiF,EAAAe,EAAA7wC,EAAApR,EAAA8V,GAGA0sC,EAAA,EAIAF,EAAAptF,GAAA,CAIA,IAAAwJ,GAAA,EAAA8jF,EAAAttF,IAAA,KAAAwJ,EAAAsiF,EAAA5vC,EAAAoxC,IAAAA,MAIA,IAAAxB,EAAAlrC,EAAAp3C,KACAshC,EAAAghD,EAAAlrC,EAAAp3C,KAAA,GAIAsiF,EAAA5vC,EAAAoxC,GAAAxB,EAAAlrC,EAAAp3C,GAEA,IAAA+jF,EAAAzB,EAAAkB,EAAAxjF,GAEAgkF,EAAA1B,EAAAiB,EAAAvjF,GAEA4jF,GAAAI,EAIA,IAAAC,EAAA,EAEA3B,EAAAiB,EAAAvjF,IAAAgkF,EACA,IAAA9sF,EAAAmsF,EAAArjF,GAEAkkF,EAAA,IAAAH,EAAA7sF,EAAAosF,EACAa,EAAAD,EAEA,IAAA/Q,EAAA,EAAAA,GAAA4Q,EAAA,EAAA5Q,IAAA,CAgBA,IATAnuE,EANA++E,EAAA5Q,GAIA2P,EAAA5rF,EAEAorF,EAnEA,GA+DA/rF,EAAAyJ,IAIA+jF,IAIAjB,EAAAO,EADA9sF,EAAA6sF,EAAAlsF,MAGAorF,EAzEA,EAyEA/rF,IAGAssF,EAAA,EAAAA,GAAA79E,EAAA69E,KAGAE,EAAAT,EAAAiB,GAFA5sF,EAAAysF,EAAAN,SAEA,IAKAmB,GAAAlB,EAEAT,EAAAiB,EAAA5sF,IAAAosF,GAIA,IAAAT,EAAAlrC,GAFAgsC,EAAAe,KAAAxtF,MAGA2qC,EAAAghD,EAAAlrC,EAAAzgD,IAAA2qC,EAAA3qC,KAIA,IAAA2qC,EAAA3qC,GACA2rF,EAAAlrC,EAAA9V,EAAA3qC,IAAA2rF,EAAAlrC,EAAAzgD,GAEA2rF,EAAA5vC,EAAA4vC,EAAAmB,EAAA9sF,IAAA2rF,EAAAlrC,EAAAzgD,IAIAJ,IAAAyJ,IAEAqjF,EAAA9sF,GAAAyrF,EAAAhiF,GAEAsiF,EAAAliF,EAAA7J,GAAA,GAqBA,IAhBA,IAAAwtF,IACAT,EAAAa,GAIA7B,EAAAmB,EAAAzjF,GAAAikF,EAEAZ,EAAArjF,GAAAkkF,EACA5B,EAvHA,EAuHAtiF,GAAAmkF,EAAAD,EAEA5B,EAAAkB,EAAAxjF,IAAA,EAIAoiF,EAAAD,GAAAC,EAAAC,EAAAC,EAAAliF,EAAA5J,GAEAwsF,EAAAkB,EAAAlB,EAAAmB,EAAAnB,IAGA,MAAAC,EAAAX,EAAAkB,GAFA7sF,EAAAysF,EAAAJ,OAEA,GAAA,CAMA,IAAAoB,EAAAhC,GADAW,GAAAT,EAAAiB,EAAA5sF,IAGA,IAAAO,EAAAmsF,EAAA1sF,GAAA6a,EAAA6xE,EAAA1sF,GAAAssF,EAAA,EAAA/rF,GAAAsa,EAAAta,IAGAorF,EAAAliF,GAFA7J,EAAA6sF,EAAAlsF,MAEAkrF,EAEAE,EAAAliF,EAAA7J,IAAAwsF,EACA,IAAAT,EAAAliF,EAAA7J,KAEA+rF,EAAAliF,EAAA7J,GAAA+rF,EAAAmB,EAAAltF,GAAA6tF,GASA,IAAApB,EAAAkB,EAAAlB,EAAAmB,EAAAnB,IAAA,CAOA,IAHAvxE,GADAD,EAAA6xE,EADA1sF,EAAAysF,EAAAJ,KAEAV,EAAAkB,EAAA7sF,GAAA,EAGAmD,EAAAqpF,EAAA,EAAAjsF,EAFAgsF,EAAA1xE,EAEAta,GAAAua,EAAAva,IAGA,GAAA,IAAAorF,EAAAliF,GAFA7J,EAAA6sF,EAAAlsF,KAEA,CAEA,IAAAmtF,EAAA/B,EAAAliF,EAAA7J,GAAA6rF,EAEA,EAAAiC,GAEAvqF,GAAAuqF,EAIAlB,GAFAC,EAAAF,KAAA3sF,IAKA8sF,EAAA9sF,GAAAyrF,EAAAhiF,GAEAsiF,EAAAliF,EAAA7J,GAAA,GAMA+rF,EAAAkB,EAAA7sF,GAAAusF,EAAA1xE,EAAA,EACA,IAAA8yE,EAAApB,EACAqB,EAAA/yE,EAAA8wE,EA5LA,EA4LA3rF,GAEA,IAAAO,EAAA,EAAAua,EAAAva,EAAAqtF,EAAArtF,IAAA,CAGA,IAAAstF,EAAAlC,EAAAiB,GAFAtiF,EAAAmiF,EAAAlsF,KAIAstF,GAAA,IAKA1qF,GAAA0qF,EAIArB,GAFAC,EAAAF,KAAAjiF,GAMA,IAAAnH,GAEAupF,EAAA1sF,GAAAqrF,EAAAhiF,GAGAikF,GAFAlB,GAAAT,EAAAiB,EAAA5sF,GAIAqtF,GAAAjB,EACAa,GAAAb,EACAT,EAAAiB,EAAA5sF,GAAA,EAEA2rF,EAAAkB,EAAA7sF,IAAA,IAGA2rF,EAAAmB,EAAA9sF,GAAAgB,KAAA4I,IAAA+hF,EAAAmB,EAAA9sF,GAAAmD,GAEAspF,EAAAF,GAAAE,EAAAkB,GAEAlB,EAAAkB,GAAAlB,EAAA5xE,GAEA4xE,EAAA5xE,GAAAxR,EAEAsiF,EAtOA,EAsOA3rF,GAAAusF,EAAA1xE,EAAA,EAEA2xE,GAAAA,EAAA,GAAAA,EAAAA,GAAA3sF,EAEA8rF,EAAAlrC,EAAAzgD,GAAA2rF,EAAAoB,EAAAP,GAGA7hD,EAFAghD,EAAAoB,EAAAP,GAAAxsF,GAEAwsF,GAWA,IANAb,EAAAmB,EAAAzjF,GAAAikF,EAGA7B,EAAAD,GAAAC,GAFAC,EAAA1qF,KAAA6I,IAAA6hF,EAAA4B,IAEA5B,EAAAC,EAAAliF,EAAA5J,GAGAwsF,EAAAkB,EAAAlB,EAAAmB,EAAAnB,IAGA,KAAA,GAAAV,EAAAiB,GAFA5sF,EAAAysF,EAAAJ,MAYA,IAJArsF,EAAA2rF,EAAAoB,GADAP,EAAA7hD,EAAA3qC,KAGA2rF,EAAAoB,EAAAP,IAAA,GAEA,IAAAxsF,IAAA,IAAA2rF,EAAAlrC,EAAAzgD,GAAAA,EAAA2rF,EAAAlrC,EAAAzgD,GAAAyrF,IAAA,CAIA,IAHAp9E,EAAAs9E,EAtQA,EAsQA3rF,GACAssF,EAAAX,EAAAkB,EAAA7sF,GAEAO,EAAAmsF,EAAA1sF,GAAA,EAAAO,GAAAmsF,EAAA1sF,GAAAqO,EAAA,EAAA9N,IACAorF,EAAAliF,EAAAgjF,EAAAlsF,IAAAkrF,EAGA,IAAAqC,EAAA9tF,EAEA,IAAAsK,EAAAqhF,EAAAlrC,EAAAzgD,IAAA,IAAAsK,GAAA,CACA,IAAAyjF,EAAApC,EAhRA,EAgRArhF,KAAA+D,GAAAs9E,EAAAkB,EAAAviF,KAAAgiF,EAEA,IAAA/rF,EAAAmsF,EAAApiF,GAAA,EAAAyjF,GAAAxtF,GAAAmsF,EAAApiF,GAAA+D,EAAA,EAAA9N,IAEAorF,EAAAliF,EAAAgjF,EAAAlsF,MAAAkrF,IACAsC,EAAA,GAKAA,GAEArB,EAAApiF,GAAA+gF,EAAArrF,GACA2rF,EAAAiB,EAAA5sF,IAAA2rF,EAAAiB,EAAAtiF,GACAqhF,EAAAiB,EAAAtiF,GAAA,EAEAqhF,EAAAkB,EAAAviF,IAAA,EAEAA,EAAAqhF,EAAAlrC,EAAAn2C,GACAqhF,EAAAlrC,EAAAqtC,GAAAxjF,GAIAA,EAAAqhF,EAAAlrC,GADAqtC,EAAAxjF,KASA,IAAA+hF,EAAA9rF,EAAAgtF,EAAAlB,EAAAmB,EAAAnB,KAGAD,GAAAT,EAAAiB,GAFA5sF,EAAAysF,EAAAJ,OAEA,IAKAV,EAAAiB,EAAA5sF,GAAAosF,EAEAjpF,EAAAwoF,EAAAmB,EAAA9sF,GAAAstF,EAAAlB,GAGA,IAAAT,EAAA5vC,GAFA54C,EAAAnC,KAAA4I,IAAAzG,EAAAtD,EAAAotF,EAAAb,OAGAzhD,EAAAghD,EAAA5vC,EAAA54C,IAAAnD,GAIA2rF,EAAAlrC,EAAAzgD,GAAA2rF,EAAA5vC,EAAA54C,GACAwnC,EAAA3qC,IAAA,EACA2rF,EAAA5vC,EAAA54C,GAAAnD,EAEAmtF,EAAAnsF,KAAA4I,IAAAujF,EAAAhqF,GACAwoF,EAAAmB,EAAA9sF,GAAAmD,EAEAspF,EAAAlsF,KAAAP,GAIA2rF,EAAAiB,EAAAvjF,GAAAgkF,EAEA,IAAA1B,EA9UA,EA8UAtiF,GAAA9I,EAAAgtF,KAEAb,EAAArjF,IAAA,EAEAsiF,EAAAliF,EAAAJ,GAAA,GAGA,IAAA+jF,IAEAT,EAAApsF,GASA,IAAAP,EAAA,EAAAA,EAAAH,EAAAG,IACA0sF,EAAA1sF,GAAAqrF,EAAAqB,EAAA1sF,IAGA,IAAAsK,EAAA,EAAAA,GAAAzK,EAAAyK,IACAqhF,EAAA5vC,EAAAzxC,IAAA,EAIA,IAAAA,EAAAzK,EAAA,GAAAyK,EAAAA,IAEA,EAAAqhF,EAAAiB,EAAAtiF,KAKAqhF,EAAAlrC,EAAAn2C,GAAAqhF,EAAA5vC,EAAA2wC,EAAApiF,IACAqhF,EAAA5vC,EAAA2wC,EAAApiF,IAAAA,GAIA,IAAA1K,EAAAC,EAAA,GAAAD,EAAAA,IAEA+rF,EAAAiB,EAAAhtF,IAAA,IAIA,IAAA8sF,EAAA9sF,KAEA+rF,EAAAlrC,EAAA7gD,GAAA+rF,EAAA5vC,EAAA2wC,EAAA9sF,IACA+rF,EAAA5vC,EAAA2wC,EAAA9sF,IAAAA,GAKA,IAAAI,EAAAqJ,EAAA,EAAArJ,GAAAH,EAAAG,KACA,IAAA0sF,EAAA1sF,KACAqJ,EAAAkiF,GAAAvrF,EAAAqJ,EAAAsiF,EAAA5vC,EAAA0E,EAAAv3C,EAAAO,IAOA,OAFAP,EAAA20B,OAAA30B,EAAAxI,OAAA,EAAA,GAEAwI,mKC/bA,aA4IA1I,EAAA2I,KAAA,WACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QA5IA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAA2N,EAAA3N,EAAA9zD,EAAA,2BACAsuF,EAAAx6B,EAAA9zD,EAAA,aAqIA,OAvHA,SAAAU,EAAAsqC,EAAAujD,EAAAC,GAEA,IAAA9tF,IAAAsqC,IAAAujD,EACA,OAAA,KAIA,IAKAjuF,EAAAsK,EAAAjB,EAAA8kF,EAAA5tF,EAAA6tF,EAAAvzE,EALAuwE,EAAAhrF,EAAAu6E,MAEAvuE,EAAAg/E,EAAA,GACAvrF,EAAAurF,EAAA,GAIArgF,EAAA,EAAAlL,GAAAquF,EAAAruF,EAAAuM,EAAA,EAAA,GAEA3C,EAAA,GAIA4kF,EAAAxuF,EAEAyuF,EAAA,EAAAzuF,EAEAmuD,EAAA,EAAAnuD,EAEAk8C,EAAA,EAAAl8C,EAEA4gD,EAAA,EAAA5gD,EAAA,EAGA,IAAAwJ,EAAA,EAAAA,EAAA0B,EAAA1B,IACAI,EAAAJ,IAAA,EAIA,IAAAklF,EAAA,GAGAttC,EAAAkgB,EAAA/gE,GAEA2rF,EAAA9qC,EAAA/iC,OACA8tE,EAAA/qC,EAAA46B,KAEA,IAAAxyE,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAKA,IAFAklF,EAFAjkF,EAAA2jF,EAAA5kF,KAEA,IAAAI,EAAAukD,EAAA1jD,GAAA,EAAA,GAEA,IAAAA,IAAA,IAAAb,EAAAukD,EAAA1jD,GAAAA,EAAAogC,EAAApgC,GACAb,EAAAukD,EAAA1jD,GAAAjB,EAKA,GAAA6kF,EAAA,CAEA,IAAA7kF,EAAA,EAAAA,EAAAxJ,EAAAwJ,IACAI,EAAAwkF,EAAA5kF,IAAAA,EAIA,IAAArJ,EAAA,EAAAA,EAAAoM,EAAApM,IAAA,CAEA,IAAAqJ,EAAAxJ,EAAAuuF,EAAApC,EAAAhsF,GAAA6a,EAAAmxE,EAAAhsF,EAAA,GAAAO,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IACA8I,EAAArI,KAAA4I,IAAAP,EAAAI,EAAAsiF,EAAAxrF,KAIAkJ,EAAAg3C,EAAAzgD,GAAAyJ,EAAAsyC,EAAA1yC,GACAI,EAAAsyC,EAAA1yC,GAAArJ,GAKA,IAAAA,EAAA,EAAAA,EAAAH,EAAAG,IACAyJ,EA1DA,EA0DAzJ,GAAAA,EAGA,IAAAqJ,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAAA,CASA,KALA,IAAAqhC,EAFApgC,EAAA2jF,EAAA5kF,KAGAklF,EAAA7jD,EAAApgC,MAIA6jF,EAAAD,EAAAzkF,EAAAsyC,EAAA1yC,GAAAiB,GAAA,IAAA6jF,EAAAA,EAAAD,EAAAzkF,EAAAg3C,EAAA0tC,IAAA,EACA,IAAA5tF,EAAAyrF,EAAAmC,GAAA5tF,EAAAyrF,EAAAmC,EAAA,GAAA5tF,IAAA,CACAP,EAAA+rF,EAAAxrF,GACA,IAAAZ,EAAAquF,EAAAhuF,EAAAsK,EAAAb,EAAAukD,EAAAqgC,EAAAC,EAzEA,GA2EA,GAAA3uF,EAAA6uF,OACAD,EAAAjkF,KAIA,IAAA3K,EAAA6uF,OACAD,EAAA5uF,EAAA0Q,MAKA,IAAAq6B,EAAApgC,KACAb,EAvFA,EAuFAa,GAAAogC,EAAApgC,IAKA,IAAAA,EAAA,EAAAA,EAAAzK,EAAAyK,KACA,IAAAogC,EAAApgC,KACAikF,EAAA7jD,EAAApgC,KAAAikF,EAAAjkF,IAIA,OAAAikF,yECtIA,aAsFA/tF,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAtFA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAAi7B,EAAAj7B,EAAA9zD,EAAA,eACAgvF,EAAAl7B,EAAA9zD,EAAA,aACAivF,EAAAn7B,EAAA9zD,EAAA,eA8EA,OA5DA,SAAA4K,EAAA0R,EAAA4yE,EAAAp7E,EAAA0qE,GAEA,IAMAl+E,EAAAO,EAAAua,EANAX,EAAA6B,EAAAkC,OACA09D,EAAA5/D,EAAA6/D,KAGAh8E,EAFAmc,EAAA2+D,MAEA,GAIA5+B,EAAA,EAIA,IAFAvoC,EAAA,GAAAlJ,EAEA,GAAAyxC,GAAA,CAEAzxC,EAAAkJ,EAAAuoC,GAEA,IAAA8yC,EAAA3Q,EAAAA,EAAA5zE,GAAAA,EAEAmkF,EAAA7S,EAAAtxE,KAEAokF,EAAA9S,EAAAtxE,GAEAkJ,EAAA3T,EAAAk8C,GAAA8yC,EAAA,EAAA,EAAAF,EAAA/S,EAAAiT,KAIA,IAAAnuC,EAAA,EAEA,IAAAngD,EAAAiT,EAAA3T,EAAAk8C,GAAAjhC,EAAA+zE,EAAA,EAAA,EAAAF,EAAA/S,EAAAiT,EAAA,IAAAtuF,EAAAua,EAAAva,IAIA,GAFAP,EAAAma,EAAA5Z,IAEAkuF,EAAA7S,EAAA57E,GAAA,CAKAwT,EAAA3T,EAAAk8C,GAAAx7C,EAEAiT,IAAAuoC,GAAA/7C,EAEA0gD,EAAA,EAEA,MAIAA,IAEA3E,IAEAvoC,IAAAo7E,GAAAtkF,GAIA,OAAAskF,8EChFA,aAgFApuF,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAhFA,WA2EA,OAjEA,SAAAlwD,EAAA8tF,GAEA,IAAA9tF,EACA,OAAA,KAIA,IAgBAJ,EAAA8uF,EAhBAC,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACAuP,EAAAhrF,EAAAu6E,MAEAvuE,EAAAg/E,EAAA,GACAvrF,EAAAurF,EAAA,GAEA1gD,EAAA,GAGAjhC,EAAA,GAIAwqD,EAAAp0D,EAIA,GAAAquF,EAEA,IAAAluF,EAAA,EAAAA,EAAAoM,EAAApM,IACAyJ,EAAAwqD,EAAAj0D,IAAA,EAKA,IAAA,IAAAqJ,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAAA,CAEAqhC,EAAArhC,IAAA,EAEAI,EAlBA,EAkBAJ,IAAA,EAEA,IAAA,IAAA+kF,EAAAY,EAAA3lF,GAAAwR,EAAAm0E,EAAA3lF,EAAA,GAAA9I,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IAAA,CAEA,IAAAZ,EAAAovF,EAAAxuF,GAIA,IAFAP,EAAAkuF,EAAAzkF,EAAAwqD,EAAAt0D,GAAAA,GAEA,IAAAK,GAAAA,EAAAqJ,EAAArJ,EAAA8uF,EAEAA,EAAArlF,EA5BA,EA4BAzJ,GAEAyJ,EA9BA,EA8BAzJ,GAAAqJ,GAEA,IAAAylF,IACApkD,EAAA1qC,GAAAqJ,GAIA6kF,IACAzkF,EAAAwqD,EAAAt0D,GAAA0J,IAKA,OAAAqhC,8BC1EA,aAmEAlqC,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAnEA,WA8DA,OA9CA,SAAAlwD,EAAA6f,EAAA8pB,GAWA,IATA,IAAAklD,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KAGAh8E,EAFAO,EAAAu6E,MAEA,GAEAuU,EAAA,EAEA5kF,EAAA,EAAAA,EAAAzK,EAAAyK,IAAA,CAEA,IAAA/J,EAAAyuF,EAAA1kF,GAIA,IAFA0kF,EAAA1kF,GAAA4kF,EAEA3uF,EAAAyuF,EAAA1kF,EAAA,GAAA/J,IAEA0f,EAAA8uE,EAAAxuF,GAAA+J,EAAA2kF,EAAAA,EAAA1uF,GAAA,EAAAwpC,KAEAglD,EAAAG,GAAAH,EAAAxuF,GAEA0uF,IACAA,EAAAC,GAAAD,EAAA1uF,IAIA2uF,KAeA,OATAF,EAAAnvF,GAAAqvF,EAEAH,EAAAlxD,OAAAqxD,EAAAH,EAAAruF,OAAAwuF,GAEAD,GACAA,EAAApxD,OAAAqxD,EAAAD,EAAAvuF,OAAAwuF,GAIAA,8BC7DA,aAkBA1uF,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAlBA,WAaA,OALA,SAAAtwD,GAEA,OAAAA,EAAA,8BCZA,aAqCAQ,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QArCA,WAgCA,OAvBA,SAAA/vD,EAAAe,GAEA,IAAA+H,EACAxJ,EAAAyB,EAAAZ,OACAK,EAAA,GAEA,GAAAR,EAEA,IAAA8I,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAEAtI,EAAAR,EAAA8I,IAAA/H,EAAA+H,QAIA,IAAAA,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAEAtI,EAAAsI,GAAA/H,EAAA+H,GAIA,OAAAtI,8BC/BA,aA+DAP,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QA/DA,WA0DA,OAzCA,SAAAtwD,EAAAsK,EAAAb,EAAAukD,EAAAqgC,EAAAC,EAAAa,GACA,IAAApkF,EAAAqkF,EAAAC,EAGAh/E,EADAm+E,EAAA,EAGA,GAAAxuF,GAAAsK,GAAAb,EAAAukD,EAAA1jD,IAAAb,EAAA4kF,EAAAruF,GACA,OAAA,EASA,GALAyJ,EAAA4kF,EAAAruF,GAAAyJ,EAAAukD,EAAA1jD,GAEA+kF,EAAA5lF,EAAA6kF,EAAAtuF,GACAyJ,EAAA6kF,EAAAtuF,GAAAsK,GAEA,IAAA+kF,EAEAb,EAAA,EACAn+E,EAAArQ,MACA,CAIA,IAFAwuF,EAAA,EAEAn+E,EAAAg/E,EAAAh/E,IAAA5G,EAAA0lF,EAAA9+E,GAAAA,EAAA5G,EAAA0lF,EAAA9+E,IAIA,IAAAtF,EAAAskF,EAAAtkF,IAAAsF,EAAAtF,EAAAqkF,EAEAA,EAAA3lF,EAAA0lF,EAAApkF,GACAtB,EAAA0lF,EAAApkF,GAAAsF,EAIA,MAAA,CACAm+E,MAAAA,EACAn+E,EAAAA,+BCxDA,aAgMA7P,EAAA2I,KAAA,OACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAhMA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAAhyD,EAAAgyD,EAAA9zD,EAAA,yBACA26E,EAAA7mB,EAAA9zD,EAAA,kCACAqkD,EAAAyP,EAAA9zD,EAAA,8BACAuiE,EAAAzO,EAAA9zD,EAAA,4BACAwiE,EAAA1O,EAAA9zD,EAAA,8BACA4vF,EAAA97B,EAAA9zD,EAAA,gBACA86E,EAAAvgC,EAAAugC,aAoLA,OAnKA,SAAApuE,EAAArB,EAAAwkF,GAEA,IAAAnjF,EACA,OAAA,KAIA,IAIAiE,EAFAxQ,EAFAuM,EAAAuuE,MAEA,GAGA6U,EAAA,IACAC,EAAA,IAEA1kF,IACAsF,EAAAtF,EAAAsF,EACAm/E,EAAAzkF,EAAAykF,KAAAA,EACAC,EAAA1kF,EAAA0kF,KAAAA,GAIA,IA+BAzvF,EAAAO,EA/BAu7E,EAAA,GAEAC,EAAA,GAEAC,EAAA,GAGAP,EAAA,IAAAjB,EAAA,CACAluD,OAAAwvD,EACA3hE,MAAA4hE,EACAH,IAAAI,EACA/gD,KAAA,CAAAp7B,EAAAA,KAGAo8E,EAAA,GAEAC,EAAA,GAEAC,EAAA,GAGAT,EAAA,IAAAlB,EAAA,CACAluD,OAAA2vD,EACA9hE,MAAA+hE,EACAN,IAAAO,EACAlhD,KAAA,CAAAp7B,EAAAA,KAGAq+E,EAAA,GAKAn9E,EAAA,GAEAyS,EAAA,GAGA,IAAAxT,EAAA,EAAAA,EAAAH,EAAAG,IAEAe,EAAAf,GAAA,EAEAk+E,EAAAl+E,IAAA,EAEAg8E,EAAAh8E,EAAA,GAAA,EAOA,IAAA,IAAAqJ,EAFAomF,EADAD,EAAA,EAGAnmF,EAAAxJ,EAAAwJ,IAAA,CAEA2yE,EAAA3yE,GAAAmmF,EACArT,EAAA9yE,GAAAomF,EAEA,IAAAjX,EAAAnoE,EAAAA,EAAAhH,GAAAA,EAEAulF,EAAAU,EAAA7T,EAAArvE,EAAAosE,EAAAhlE,EAAAzS,EAAAm9E,EAAA,GAEAwR,GAAA,EACAtvF,GAAA,EAEA,IAAAG,EAAAquF,EAAAruF,EAAAV,EAAAU,IAIA,GAAA29E,EAFAl+E,EAAAwT,EAAAjT,IAEA,EAAA,CAEA,IAAAovF,EAAAnuF,EAAAT,EAAAf,IAEAiiE,EAAA0tB,EAAAvvF,KAEAA,EAAAuvF,EACAD,EAAA1vF,QAIAk8E,EAAAuT,GAAAvR,EAAAl+E,GACAi8E,EAAAwT,KAAA1uF,EAAAf,GAKA,IAAA,IAAA0vF,GAAAtvF,GAAA,EACA,OAAA,KAIA89E,EAAA1F,GAAA,GAAAtW,EAAA1gE,EAAAT,EAAAy3E,IAAAz0B,EAAA3jD,EAAAmvF,MACAG,EAAAlX,GAIA,IAAA+E,EAAAx8E,EAAA2uF,GAUA,IARAxT,EAAAuT,GAAApmF,EACA4yE,EAAAwT,KAAAlS,EAEAW,EAAAwR,GAAArmF,EAEA0yE,EAAAyT,GAAAE,EACA5T,EAAA0T,KAAA,EAEAjvF,EAAAquF,EAAAruF,EAAAV,EAAAU,IAIA29E,EAFAl+E,EAAAwT,EAAAjT,IAEA,IAEAw7E,EAAAyT,GAAAxvF,EAEA87E,EAAA0T,KAAAnV,EAAAt5E,EAAAf,GAAAu9E,IAIAx8E,EAAAf,GAAA,EAQA,IAHAg8E,EAAAn8E,GAAA2vF,EACArT,EAAAt8E,GAAA4vF,EAEAlvF,EAAA,EAAAA,EAAAivF,EAAAjvF,IACAw7E,EAAAx7E,GAAA29E,EAAAnC,EAAAx7E,IASA,OALAu7E,EAAAj+C,OAAA2xD,EAAA1T,EAAAp7E,OAAA8uF,GACAzT,EAAAl+C,OAAA2xD,EAAAzT,EAAAr7E,OAAA8uF,GACAvT,EAAAp+C,OAAA4xD,EAAAxT,EAAAv7E,OAAA+uF,GACAvT,EAAAr+C,OAAA4xD,EAAAvT,EAAAx7E,OAAA+uF,GAEA,CACAhU,EAAAA,EACAC,EAAAA,EACAwC,KAAAA,6MCzLA,aAqBA19E,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QArBA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAA63B,EAAA73B,EAAA9zD,EAAA,aAeA,OALA,SAAA+J,EAAAa,GAEAb,EAAAa,GAAA+gF,EAAA5hF,EAAAa,8CCfA,aAmBA9J,EAAA2I,KAAA,WACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAnBA,WAcA,OALA,SAAA7mD,EAAAa,GAEA,OAAAb,EAAAa,GAAA,8BCbA,aAwEA9J,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAxEA,SAAArW,GACA,IAAAugC,EAAAvgC,EAAAugC,aAkEA,OApDA,SAAAp6E,EAAA89E,EAAA7tE,EAAAic,GAmBA,IAjBA,IAAA2iE,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACAuP,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEA/+E,EAAAg/E,EAAA,GACAvrF,EAAAurF,EAAA,GAEAyE,EAAAvjE,GAAAlsB,EAAAu7E,QAAA,GAAA,KACA8Q,EAAA,GAEAC,EAAA,GAGAwC,EAAA,EAEA7lF,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAAA,CAEAqjF,EAAArjF,GAAA6lF,EAIA,IAFA,IAAA5kF,EAAA+F,EAAAA,EAAAhH,GAAAA,EAEAymF,EAAAd,EAAA1kF,GAAAjG,EAAA2qF,EAAA1kF,EAAA,GAAAxK,EAAAgwF,EAAAhwF,EAAAuE,EAAAvE,IAAA,CAEA,IAAAH,EAAAu+E,EAAAA,EAAA6Q,EAAAjvF,IAAAivF,EAAAjvF,GAEA2sF,EAAAyC,GAAAvvF,EAEAkwF,IACAA,EAAAX,GAAAD,EAAAnvF,IAIAovF,KAOA,OAFAxC,EAAA7sF,GAAAqvF,EAEA,IAAA1U,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAA7uB,EAAAvM,GACAqrF,SAAA0E,gCCjEA,aAkEApvF,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAlEA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAA+3B,EAAA/3B,EAAA9zD,EAAA,aA4DA,OAlDA,SAAAgrC,EAAA7qC,GAEA,IAAA6qC,EACA,OAAA,KAIA,IACApgC,EADAjB,EAAA,EAGA4kF,EAAA,GAGAxkF,EAAA,GAGAg3C,EAAA5gD,EACA+kC,EAAA,EAAA/kC,EAEA,IAAAyK,EAAA,EAAAA,EAAAzK,EAAAyK,IAEAb,EANA,EAMAa,IAAA,EAIA,IAAAA,EAAAzK,EAAA,EAAA,GAAAyK,EAAAA,KAEA,IAAAogC,EAAApgC,KAKAb,EAAAg3C,EAAAn2C,GAAAb,EAjBA,EAiBAihC,EAAApgC,IACAb,EAlBA,EAkBAihC,EAAApgC,IAAAA,GAIA,IAAAA,EAAA,EAAAA,EAAAzK,EAAAyK,KAEA,IAAAogC,EAAApgC,KAKAjB,EAAAkiF,EAAAjhF,EAAAjB,EAAAI,EA7BA,EA6BAg3C,EAAAwtC,EAAArpD,IAGA,OAAAqpD,4CC5DA,aA2DAztF,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QA3DA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAAu8B,EAAAv8B,EAAA9zD,EAAA,YACA+uF,EAAAj7B,EAAA9zD,EAAA,eACAgvF,EAAAl7B,EAAA9zD,EAAA,aAmDA,OAjCA,SAAAsc,EAAA1a,EAAA+H,EAAAmK,EAAA0qE,GAEA,IAQA39E,EAAA6tF,EAAAvzE,EARAm1E,EAAAh0E,EAAA6/D,KACAoU,EAAAj0E,EAAA2+D,MAEAuV,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KAEAh8E,EAAAowF,EAAA,GAIArB,EAAA/uF,EAEA,IAAAuuF,EAAA+B,EAAA9mF,GAAAwR,EAAAs1E,EAAA9mF,EAAA,GAAA9I,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IAAA,CAEA,IAAAP,EAAAkwF,EAAA3vF,GAEAkuF,EAAAuB,EAAAhwF,KAEA4uF,EAAAmB,EAAA/vF,EAAAgc,EAAA4yE,EAAAp7E,EAAA0qE,IAKA,IAAA39E,EAAAquF,EAAAruF,EAAAV,EAAAU,IAEAmuF,EAAAsB,EAAAx8E,EAAAjT,IAGA,OAAAquF,2ECrDA,aAwFApuF,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAxFA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAA6mB,EAAA7mB,EAAA9zD,EAAA,kCACAqkD,EAAAyP,EAAA9zD,EAAA,8BACAqT,EAAAygD,EAAA9zD,EAAA,8BACA0wF,EAAA58B,EAAA9zD,EAAA,cA+EA,OA1DA,SAAAsc,EAAA1a,EAAA+H,EAAAmK,EAAAzS,EAAAm9E,EAAAmS,GAEA,IAWA9vF,EAAA6tF,EAAAvzE,EAAAxK,EAXAigF,EAAAt0E,EAAA2/D,QACA4U,EAAAv0E,EAAAkC,OACA8xE,EAAAh0E,EAAA6/D,KAGAh8E,EAFAmc,EAAA2+D,MAEA,GAEA6V,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KAIA+S,EAAAwB,EAAAp0E,EAAA1a,EAAA+H,EAAAmK,EAAA0qE,GAEA,IAAA39E,EAAAquF,EAAAruF,EAAAV,EAAAU,IACAQ,EAAAyS,EAAAjT,IAAA,EAIA,IAAA6tF,EAAA+B,EAAA9mF,GAAAwR,EAAAs1E,EAAA9mF,EAAA,GAAA9I,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IACAQ,EAAAmvF,EAAA3vF,IAAAiwF,EAAAjwF,GAIA,IAAA,IAAAqO,EAAAggF,EAAAhgF,EAAA/O,EAAA+O,IAAA,CAEA,IAAAtE,EAAAkJ,EAAA5E,GAEAu/E,EAAAjQ,EAAAA,EAAA5zE,GAAAA,EAEA,KAAA6jF,EAAA,GAaA,IARAC,EAAA4B,EAAA7B,GACAtzE,EAAAm1E,EAAA7B,EAAA,GAEAptF,EAAAuJ,GAAA+vE,EAAAt5E,EAAAuJ,GAAAgmF,EAAAD,EAAAjC,EAAAvzE,EAAA,IAEAta,EAAA8vF,EAAAjC,EAAA,EAAAA,EACA/9E,EAAAggF,EAAAx1E,EAAAA,EAAA,EAEAta,EAAA8P,EAAA9P,IAAA,CAEA,IAAAP,EAAAuwF,EAAAhwF,GAEAQ,EAAAf,GAAA+S,EAAAhS,EAAAf,GAAA+jD,EAAAusC,EAAA/vF,GAAAQ,EAAAuJ,MAKA,OAAAskF,iJClFA,aAyLApuF,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAzLA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAAi9B,EAAAj9B,EAAA9zD,EAAA,YACAgxF,EAAAl9B,EAAA9zD,EAAA,gBACAixF,EAAAn9B,EAAA9zD,EAAA,cACAkxF,EAAAp9B,EAAA9zD,EAAA,aACAmxF,EAAAr9B,EAAA9zD,EAAA,eA+KA,OAjKA,SAAA8vC,EAAApvC,EAAAi+D,GAEA,IAKAh1D,EALA2lF,EAAA5uF,EAAAy7E,KAGAh8E,EAFAO,EAAAu6E,MAEA,GAIA5vE,EAAA,GAIA,GAFAA,EAAAsF,EAAAogF,EAAAjhD,EAAApvC,GAEAovC,IAAAzkC,EAAAsF,EACA,OAAA,KAIA,GAAAguD,EAAA,CAEA,IAAAn+D,EAAAsvC,EAAAkhD,EAAAtwF,EAAA,KAAA2K,EAAAsF,EAAA,GAAAjQ,EAEA2K,EAAA2/B,OAAAimD,EAAAzwF,EAAA,GAEA,IAAA+tF,EAAA2C,EAAA7lF,EAAA2/B,OAAA7qC,GAIA,GAFAkL,EAAA+lF,GAAAD,EAAA3wF,EAAA6K,EAAA2/B,OAAAujD,EAAA,GAEA/tF,GAAA6K,EAAA2/B,QAAA3/B,EAAA+lF,IAoBA,SAAA1wF,EAAA2K,GAEA,IAAAikF,EAAA5uF,EAAAy7E,KACAkT,EAAA3uF,EAAA8d,OACAktE,EAAAhrF,EAAAu6E,MAEAvuE,EAAAg/E,EAAA,GACAvrF,EAAAurF,EAAA,GAEArgF,EAAAmzE,KAAA,GAEAnzE,EAAAgmF,SAAA,GAGA,IAWA/wF,EAAAqJ,EAAA9I,EAAA6tF,EAAAvzE,EAXA6vB,EAAA3/B,EAAA2/B,OACAwzC,EAAAnzE,EAAAmzE,KACA6S,EAAAhmF,EAAAgmF,SAEAtnF,EAAA,GAGAsyC,EAAA3vC,EACA+6C,EAAA/6C,EAAAvM,EACAmxF,EAAA5kF,EAAA,EAAAvM,EAIA,IAAAwJ,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAEAI,EAAAsyC,EAAA1yC,IAAA,EACAI,EAAA09C,EAAA99C,IAAA,EACAI,EAAAunF,EAAA3nF,GAAA,EAIA,IAAArJ,EAAA,EAAAA,EAAAoM,EAAApM,IACA+wF,EAAA/wF,IAAA,EAIA,IAAAqJ,EAAAxJ,EAAA,EAAA,GAAAwJ,EAAAA,IAEA,IAAA+kF,EAAAY,EAAA3lF,GAAAwR,EAAAm0E,EAAA3lF,EAAA,GAAA9I,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IAEAwwF,EAAAhC,EAAAxuF,IAAA8I,EAKA,IAAArJ,EAAAoM,EAAA,EAAA,GAAApM,EAAAA,KAEAk+E,EAAAl+E,IAAA,MACAqJ,EAAA0nF,EAAA/wF,MAOA,GAAAyJ,EAAAunF,EAAA3nF,OACAI,EAAA09C,EAAA99C,GAAArJ,GAIAyJ,EA5CA,EA4CAzJ,GAAAyJ,EAAAsyC,EAAA1yC,GACAI,EAAAsyC,EAAA1yC,GAAArJ,GAMA,IAHA+K,EAAAykF,IAAA,EACAzkF,EAAAkmF,GAAA7kF,EAEA/C,EAAA,EAAAA,EAAAxJ,EAAAwJ,IAaA,GAXArJ,EAAAyJ,EAAAsyC,EAAA1yC,GAEA0B,EAAAykF,MAEAxvF,EAAA,IACAA,EAAA+K,EAAAkmF,MAIA/S,EAAAl+E,GAAAqJ,MAEA2nF,EAAA3nF,IAAA,GAAA,CAKA0B,EAAAykF,KAAA/lF,EAAAunF,EAAA3nF,GAEA,IAAA6nF,EAAAxmD,EAAArhC,IAEA,IAAA6nF,IACA,IAAAznF,EAAAunF,EAAAE,KACAznF,EAAA09C,EAAA+pC,GAAAznF,EAAA09C,EAAA99C,IAGAI,EA9EA,EA8EAA,EAAA09C,EAAA99C,IAAAI,EAAAsyC,EAAAm1C,GACAznF,EAAAsyC,EAAAm1C,GAAAznF,EA/EA,EA+EAzJ,GACAyJ,EAAAunF,EAAAE,IAAAznF,EAAAunF,EAAA3nF,IAIA,IAAArJ,EAAA,EAAAA,EAAAoM,EAAApM,IACAk+E,EAAAl+E,GAAA,IACAk+E,EAAAl+E,GAAAqJ,KAIA,OAAA,EAlIA8nF,CAAAjxF,EAAA6K,GAEA,IAAA1B,EAAA0B,EAAA0kF,IAAA,EAAApmF,EAAAxJ,EAAAwJ,IACA0B,EAAA0kF,KAAA1kF,EAAA+lF,GAAAznF,QAKA0B,EAAA0kF,IAAA,EAAAT,EAAAnvF,GAAAA,EACAkL,EAAAykF,IAAAzkF,EAAA0kF,IAIA,OAAA1kF,6GC9DA,aAiDAvK,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QAjDA,WA4CA,OA9BA,SAAAhmD,EAAAjB,EAAAI,EAAAsyC,EAAA0E,EAAAwtC,EAAArpD,GAEA,IAAAgqD,EAAA,EAIA,IAFAnlF,EAAAm7B,GAAAt6B,EAEA,GAAAskF,GAAA,CAEA,IAAAruF,EAAAkJ,EAAAm7B,EAAAgqD,GAEA5uF,EAAAyJ,EAAAsyC,EAAAx7C,IAEA,IAAAP,GAEA4uF,IAEAX,EAAA5kF,KAAA9I,IAGAkJ,EAAAsyC,EAAAx7C,GAAAkJ,EAAAg3C,EAAAzgD,GAIAyJ,EAAAm7B,KAFAgqD,GAEA5uF,GAIA,OAAAqJ,8BC3CA,aAoBA7I,EAAA2I,KAAA,WACA3I,EAAA2oC,KAAA,iBACA3oC,EAAA8vD,QApBA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAA63B,EAAA73B,EAAA9zD,EAAA,aAcA,OALA,SAAAM,GAEA,OAAAA,EAAA,EAAAqrF,EAAArrF,GAAAA,4CCdA,aAEA,IAAAyjE,EAAA/jE,EAAA,kCAoDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAnDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,IAAA1xD,EAAA0xD,EAAA,MAAA,CACA5uB,OAAAtjC,KAAAQ,IACAY,QAAA,SAAArB,GACA,OAAAA,EAAAS,OAEAm2D,UAAA,SAAA52D,GACA,OAAAA,EAAAS,OAEAiZ,SAAA,SAAA1Z,GACA,OAAAA,EAAAS,OAEAkiE,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAS,GAAA,IAEAytE,KAAA,SAAAluE,GACA,OAAAA,EAAAS,SAMA,OAHAA,EAAAwjE,MAAA,CACArkE,EAAA,6BAEAa,iECnDA,aAEA,IAAAgnD,EAAA9oD,EAAA,sBAAA8oD,OA+GAhoD,EAAA2I,KAAA,MACA3I,EAAA8vD,QA9GA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA06E,EAAA5mB,EAAA9zD,EAAA,gBAEAgoE,EAAAhoE,EAAA,wBAEA0xF,EAAA59B,EAAA9zD,EAAA,wCACA2xF,EAAA79B,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAoCAqD,EAAAmwD,EAAA,MAAA1K,EAAA,CAEAipC,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAs2E,IAEAsX,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAstF,EAAArwF,EAAA+C,EAAAs2E,GAAA,IAEAuX,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAstF,EAAAttF,EAAA/C,EAAAq5E,GAAA,IAEAwX,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAutF,EAAAtwF,EAAA+C,EAAAs2E,IAEAyX,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAf,EAAAswD,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAf,EAAAswD,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAf,EAAAhC,EAAAsyD,EAAAvvD,KAEAkuF,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAs2E,GAAA,IAEA6X,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAwtF,EAAAvwF,EAAA+C,EAAAs2E,GAAA,IAEA8X,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAq5E,GAAA,IAEA+X,oBAAA,SAAApxF,EAAA+C,GACA,OAAAwtF,EAAAxtF,EAAA/C,EAAAq5E,GAAA,IAEAgY,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAs2E,GAAA,GAAA5zE,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAq5E,GAAA,GAAA5zE,WAEA8rF,WAAAlY,EACAmY,mBAAA,SAAAxxF,EAAA+C,EAAA6iD,GAGA,IAFA,IAAA/sC,EAAA7W,EAAAhC,EAAA+C,GAEA9D,EAAA,EAAAA,EAAA2mD,EAAAjmD,OAAAV,IACA4Z,EAAA7W,EAAA6W,EAAA+sC,EAAA3mD,IAGA,OAAA4Z,IAEAwgE,EAAAtlB,aAIA,OAHA/xD,EAAAiiE,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,IAAA,uBAEAviE,4VC9GA,aA0CAvC,EAAA8vD,QAxCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAcA,IAAAnwD,EAAAmwD,EAAA,MAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,EAAA+C,GAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAgC,IAAAe,IAEA6uF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAyB,KAAAsB,IAEA8uF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAgC,IAAAe,IAEA+uF,aAAA,SAAA9xF,EAAA+C,GACA,GAAA,OAAA/C,EAAAiG,YAAA/E,IAAAlB,EAAAiG,MAAA,MAAA,IAAA3G,MAAA,oDACA,GAAA,OAAAyD,EAAAkD,YAAA/E,IAAA6B,EAAAkD,MAAA,MAAA,IAAA3G,MAAA,oDACA,IAAAU,EAAA+xF,UAAAhvF,GAAA,MAAA,IAAAzD,MAAA,sBACA,IAAA6E,EAAAnE,EAAAqF,QAGA,OAFAlB,EAAA8B,MAAAjE,EAAAmC,EAAA8B,MAAAlD,EAAAkD,OACA9B,EAAA6tF,WAAA,EACA7tF,KAGA,OAAAnC,6BCvCA,aAEA,IAAA0gE,EAAA/jE,EAAA,kCAmJA,IAAAszF,EAAAhyF,KAAAmL,MAAA,SAAApL,GACA,GAAA,IAAAA,EACA,OAAAA,EAGA,IACA6Y,EADAmmC,EAAAh/C,EAAA,EAeA,OAZAg/C,IACAh/C,GAAAA,GAMA6Y,EAHAzX,SAAApB,IAGAA,IAFA6Y,EAAA5Y,KAAAC,IAAAD,KAAAU,IAAAX,GAAA,IAEA6Y,GAAA,EAAAA,GAAA,EAEA7Y,EAGAg/C,GAAAnmC,EAAAA,GAGApZ,EAAA2I,KAAA,OACA3I,EAAA8vD,QAzKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAgM,EAAA1L,EAAA9zD,EAAA,iBACAsP,EAAAwkD,EAAA9zD,EAAA,wBACA2zD,EAAAG,EAAA9zD,EAAA,sCAyCAyM,EAAA+mD,EAAA,OAAA,CACA5uB,OAAA0uD,EAGA5wF,QAAA6wF,EACAC,mBAAAD,EACAt7B,UAAA,SAAA52D,GACA,OAAAA,EAAAoL,QAEA8iE,KAsCA,SAAAluE,GACA,GAAAA,EAAAiG,OAAAizC,EAAA4b,UAAA90D,EAAAiG,OAAA,CACA,IAAA4S,EAAA7Y,EAAAqF,QAMA,OALAwT,EAAA5S,MAAA,GACA4S,EAAAA,EAAAxW,IAAA,EAAA,IAEA4D,MAAAisF,EAAAlyF,EAAAiG,OAEA4S,EAEA,IAOAu5E,EAPApzC,EAAA/wC,EAAAjO,EAAAiG,OAEA+4C,IACAh/C,EAAAiG,MAAAk4D,EAAAn+D,EAAAiG,QAOAmsF,EADAl5C,EAAA6b,YAAA/0D,EAAAiG,OACA,IAAAizC,EAAA0d,UAAA,GAAAz0D,IAAA,GACA+2C,EAAA8b,WAAAh1D,EAAAiG,OACA,IAAAizC,EAAAx/B,SAAA,EAAA,GAEA,EAAA,EAGA,IAAA24E,EAAAryF,EAAAqC,IAAA+vF,GAMA,OAJApzC,IACAqzC,EAAApsF,MAAAk4D,EAAAk0B,EAAApsF,QAGAosF,GAtEA1vB,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAoL,GAAA,MAaA,SAAA8mF,EAAAlyF,EAAAsyF,GAEA,IAAAC,EAAAvyF,EAAAsC,MAAA,EACA7B,EAAAT,EAAAS,MAEA+xF,EAAA,IAAAt5C,EAAA73C,QAAA4wF,EAAAxxF,GAAA,GAAAyB,IAAA,IAAAg3C,EAAA73C,QAAA,EAAAkxF,GAAAryF,OAEA,GAAAoyF,EAAA,CACA,IAAAG,EAAA,CAAAD,EAAA,IAAAt5C,EAAA73C,QAAA4wF,EAAAxxF,GAAA,GAAAyB,IAAA,IAAAg3C,EAAA73C,QAAA,EAAAkxF,EAAA,EAAAtyF,KAAA2C,GAAA,GAAA1C,OAAA,IAAAg5C,EAAA73C,QAAA4wF,EAAAxxF,GAAA,GAAAyB,IAAA,IAAAg3C,EAAA73C,QAAA,EAAAkxF,EAAA,EAAAtyF,KAAA2C,GAAA,GAAA1C,QACA,MAAA,UAAAsU,EAAA89C,OAAAmgC,EAAAngC,EAAAmgC,GAEA,OAAAD,EAmDA,OAHApnF,EAAA64D,MAAA,CACArkE,EAAA,yBAEAwL,sJCvIA,aAEA,IAAAs3D,EAAA/jE,EAAA,kCAEA+zF,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAiEAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAhEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAhtD,EAAAstD,EAAA9zD,EAAA,oCA8BAqG,EAAAmtD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA0yF,EAAA1yF,EAAAmF,EAAAnF,GAAAwU,EAAA69C,SACAltD,EAAAnF,GAEAC,KAAA+E,KAAAhF,IAGAqB,QAAA,SAAArB,GACA,OAAAA,EAAAgF,QAEA4xD,UAAA,SAAA52D,GACA,OAAA2yF,EAAA3yF,EAAAmF,EAAAnF,GAAAwU,EAAA69C,SACAltD,EAAAnF,GAEAA,EAAAgF,QAGA0U,SAAA,SAAA1Z,GACA,OAAAA,EAAAgF,QAEA29D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAgF,GAAA,MAMA,OAHAA,EAAAi/D,MAAA,CACArkE,EAAA,yCAEAoF,wKCpEA,aAEA,IAAA09D,EAAA/jE,EAAA,kCAsDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QArDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,IAAAoL,EAAApL,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,EAAAA,EAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAkC,IAAAlC,GAAAkC,IAAAlC,IAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAAgL,MAAAhL,GAAAgL,MAAAhL,IAEA0Z,SAAA,SAAA1Z,GACA,OAAAA,EAAAqC,IAAA,IAEAsgE,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAu9D,GAAA,IAEA2Q,KAAA,SAAAluE,GACA,OAAAA,EAAAqC,IAAA,MAMA,OAHAk7D,EAAA0G,MAAA,CACArkE,EAAA,+BAEA29D,iECrDA,aAEA,IAAA9V,EAAA9oD,EAAA,sBAAA8oD,OAsEAhoD,EAAA2I,KAAA,SACA3I,EAAA8vD,QArEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAmnB,EAAA7mB,EAAA9zD,EAAA,mBACAqkD,EAAAyP,EAAA9zD,EAAA,eACAghE,EAAAlN,EAAA9zD,EAAA,kBACA2zD,EAAAG,EAAA9zD,EAAA,sCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAiCAgN,EAAAwmD,EAAA,SAAA1K,EAAA,CAEAorC,iCAAA,SAAA7yF,EAAA+C,GAKA,OAAAigD,EAAAhjD,EAAA2/D,EAAA58D,KAEAkuF,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAu2E,GAAA,IAEA4X,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAu2E,GAAA,IAEA+X,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAu2E,GAAA,GAAA7zE,WAEAqtF,sBAAA,SAAA9yF,EAAA+C,GACA,OAAAigD,EAAAhjD,EAAA2/D,EAAA58D,MAEAu2E,EAAAvlB,aAIA,OAHApoD,EAAAs4D,MAAA,CACAwtB,EAAA,kCAEA9lF,2OCrEA,aAsDAlM,EAAA8vD,QApDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwe,EAAAle,EAAA9zD,EAAA,uBACAo0F,EAAAtgC,EAAA9zD,EAAA,gCAeA26E,EAAAnnB,EAAA,SAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,EAAA+C,GAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAmC,IAAAY,IAEA6uF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAmC,IAAAY,IAEA8uF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAmC,IAAAY,IAEAiwF,sCAAA,SAAAhzF,EAAA+C,GACA,IAAAoB,EAAAnE,EAAAqF,QAEAkH,EAAAokE,EAAA,EAAAoiB,EAAAhwF,IAEA,OADAoB,EAAA8B,MAAAqzE,EAAA,OAAAn1E,EAAA8B,MAAA9B,EAAA8uF,WAAA1mF,GAAApI,EAAA8B,MAAAlD,GACAoB,GAEA+uF,sCAAA,SAAAlzF,EAAA+C,GACA,IAAAoB,EAAApB,EAAAsC,QACAlB,EAAAA,EAAA9B,KAAA,GAEA,IAAAkK,EAAAokE,EAAA,EAAAoiB,EAAA/yF,IAEA,OADAmE,EAAA8B,MAAAqzE,EAAAt5E,EAAA,OAAA+C,EAAAkD,MAAAlD,EAAAkwF,WAAA1mF,GAAAxJ,EAAAkD,OACA9B,GAEA2tF,aAAA,SAAA9xF,EAAA+C,GACA,OAAA/C,EAAA2L,OAAA5I,MAGA,OAAAu2E,uFCnDA,aA+FA75E,EAAA2I,KAAA,YACA3I,EAAA8vD,QA9FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA26E,EAAA7mB,EAAA9zD,EAAA,mBAEAgoE,EAAAhoE,EAAA,qBAEAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA4BA6+D,EAAArL,EAAA,YAAA,CACAo/B,WAAAjY,EACAuX,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAu2E,GAAA,IAEAsX,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAAs5E,GAAA,IAEAqX,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAu2E,GAAA,IAEAoX,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAu2E,IAEAwX,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAy6D,EAAAlL,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAy6D,EAAAlL,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAy6D,EAAAx9D,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAu2E,GAAA,IAEA2X,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAu2E,GAAA,IAEA8X,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAs5E,GAAA,IAEA6X,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAs5E,GAAA,IAEA+X,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAu2E,GAAA,GAAA7zE,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAs5E,GAAA,GAAA7zE,aAMA,OAHA+3D,EAAAyG,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,UAAA,uBAEA/G,uZC5FA,aA6FA/9D,EAAA2I,KAAA,cACA3I,EAAA8vD,QA5FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA46E,EAAA9mB,EAAA9zD,EAAA,qBAEAgoE,EAAAhoE,EAAA,qBAEAw0F,EAAA1gC,EAAA9zD,EAAA,wCACA40F,EAAA9gC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA4BA8+D,EAAAtL,EAAA,cAAA,CACAo/B,WAAAhY,EACAsX,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAwwF,EAAAvzF,EAAA+C,EAAAw2E,GAAA,IAEAqX,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAAu5E,GAAA,IAEAoX,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAowF,EAAAnzF,EAAA+C,EAAAw2E,GAAA,IAEAmX,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAw2E,IAEAuX,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA06D,EAAAnL,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA06D,EAAAnL,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA06D,EAAAz9D,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAw2E,GAAA,IAEA0X,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAw2E,GAAA,IAEA6X,oBAAA,SAAApxF,EAAA+C,GACA,OAAA6vF,EAAA7vF,EAAA/C,EAAAu5E,GAAA,IAEA4X,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAu5E,GAAA,IAEA8X,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAw2E,GAAA,GAAA9zE,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAu5E,GAAA,GAAA9zE,aAMA,OAHAg4D,EAAAwG,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,YAAA,uBAEA9G,qUC1FA,aA2FAh+D,EAAA2I,KAAA,SACA3I,EAAA8vD,QA1FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA0D,EAAAowD,EAAA9zD,EAAA,UAEAgoE,EAAAhoE,EAAA,qBAEAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAyBA++D,EAAAvL,EAAA,SAAA,CACAo/B,WAAAlvF,EACAwuF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAV,GAAA,IAEAuuF,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAqC,GAAA,IAEAsuF,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAV,GAAA,IAEAquF,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAV,IAEAyuF,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA26D,EAAApL,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA26D,EAAApL,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA26D,EAAA19D,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAA26D,GAAA,IAEAuzB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAA26D,GAAA,IAEA0zB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAA09D,GAAA,IAEAyzB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAA09D,GAAA,IAEA2zB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAA26D,GAAA,GAAAj4D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAA09D,GAAA,GAAAj4D,aAMA,OAHAi4D,EAAAuG,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,OAAA,uBAEA7G,oWCxFA,aAEA,IAAAgF,EAAA/jE,EAAA,kCAkDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA6BA,IAAAjyD,EAAAiyD,EAAA,MAAA,CACA5uB,OAAAtjC,KAAAC,IACAmB,QAAA,SAAArB,GACA,OAAAA,EAAAE,OAEA02D,UAAA,SAAA52D,GACA,OAAAA,EAAAE,OAEAyiE,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAE,MAMA,OAHAA,EAAA+jE,MAAA,CACArkE,EAAA,kCAEAM,iECjDA,aAEA,IAAAwiE,EAAA/jE,EAAA,kCA8DAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA7DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBA+BA+D,EAAAyvD,EAAA,QAAA,CACA5uB,OAAAtjC,KAAAyC,OAmBA,SAAA1C,GACA,OAAA,MAAAA,GAAAA,IAAA,KAAAC,KAAAC,IAAAF,GAAA,EAAAA,EAAAA,EAAAA,EAAA,EAAAA,EAAAA,EAAAA,EAAA,GAnBAqB,QAAA,SAAArB,GACA,IAAApB,EAAAqB,KAAAC,IAAAF,EAAAgB,IACA,OAAA,IAAAk4C,EAAA73C,QAAAzC,EAAAqB,KAAAW,IAAAZ,EAAAiB,IAAA,EAAArC,EAAAqB,KAAAqB,IAAAtB,EAAAiB,MAEA21D,UAAA,SAAA52D,GACA,OAAAA,EAAAE,MAAAwB,MAAA,IAEAihE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA0C,MAeA,OADAA,EAAAuhE,MAAA,WAAAxgB,OAAAkjB,EAAApC,UAAA,IAAA,0BACA7hE,yFC7DA,aAEA,IAAAggE,EAAA/jE,EAAA,kCAyDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAxDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAntD,EAAAytD,EAAA9zD,EAAA,mCACAuG,EAAAutD,EAAA9zD,EAAA,oCA6BAi/D,EAAAzL,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,EAAAA,EAAAkF,EAAAlF,GAAAgF,EAAAhF,IAEAqB,QAAA,SAAArB,GACA,OAAA,IAAAk5C,EAAA73C,QAAA,EAAArB,EAAAgB,GAAAf,KAAAiF,MAAAlF,EAAAgB,IAAAf,KAAA+E,KAAAhF,EAAAgB,IAAA,EAAAhB,EAAAiB,GAAAhB,KAAAiF,MAAAlF,EAAAiB,IAAAhB,KAAA+E,KAAAhF,EAAAiB,MAEA21D,UAAA,SAAA52D,GACA,OAAAA,EAAAiO,aAAAjJ,EAAAhF,GAAAkF,EAAAlF,IAEA0Z,SAAA,SAAA1Z,GACA,OAAAA,EAAAgK,EAAA,EAAAhK,EAAAgF,OAAAhF,EAAAkF,SAEAy9D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAA49D,GAAA,MAMA,OAHAA,EAAAqG,MAAA,CACArkE,EAAA,8CAEAg+D,4ICxDA,aAEA,IAAA8E,EAAA/jE,EAAA,kCAEA+zF,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAgEAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA/DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAhtD,EAAAstD,EAAA9zD,EAAA,oCA6BAuG,EAAAitD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA0yF,EAAA1yF,EAAAmF,EAAAnF,GAAAwU,EAAA69C,SACAltD,EAAAnF,GAEAC,KAAAiF,MAAAlF,IAGAqB,QAAA,SAAArB,GACA,OAAAA,EAAAkF,SAEA0xD,UAAA,SAAA52D,GACA,OAAA2yF,EAAA3yF,EAAAmF,EAAAnF,GAAAwU,EAAA69C,SACAltD,EAAAnF,GAEAA,EAAAkF,SAGAwU,SAAA,SAAA1Z,GACA,OAAAA,EAAAkF,SAEAy9D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAkF,GAAA,MAMA,OAHAA,EAAA++D,MAAA,CACArkE,EAAA,2CAEAsF,wKCnEA,aAEA,IAAA6I,EAAApP,EAAA,sBAAAoP,UAoIA,SAAAylF,EAAAn0F,EAAAkB,GACA,IAAAwN,EAAA1O,KAAA0O,EAAAxN,GACA,MAAA,IAAAjB,MAAA,sDAMA,IAFA,IAAAV,EAEA,IAAA2B,GACA3B,EAAAS,EAAAkB,EACAlB,EAAAkB,EACAA,EAAA3B,EAGA,OAAAS,EAAA,GAAAA,EAAAA,EAGAI,EAAA2I,KAAA,MACA3I,EAAA8vD,QApJA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA0xF,EAAA59B,EAAA9zD,EAAA,wCACA2xF,EAAA79B,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA2BA0b,EAAA83C,EAAA,MAAA,CACAu/B,iBAAA8B,EACA5B,uBAqEA,SAAAvyF,EAAAkB,GACA,IAAAlB,EAAA2O,UAAAzN,EAAAyN,QACA,MAAA,IAAA1O,MAAA,sDAMA,IAFA,IAAAm0F,EAAA,IAAAv6C,EAAA0d,UAAA,IAEAr2D,EAAAmF,UAAA,CACA,IAAA9G,EAAAS,EAAAgQ,IAAA9O,GACAlB,EAAAkB,EACAA,EAAA3B,EAGA,OAAAS,EAAAgP,GAAAolF,GAAAp0F,EAAA0F,MAAA1F,GAlFAwyF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAqa,IAAAtX,IAEA8tF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAutF,EAAAtwF,EAAA+C,EAAAsX,IAEAu2E,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAstF,EAAAttF,EAAA/C,EAAAqa,GAAA,IAEAs2E,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAstF,EAAArwF,EAAA+C,EAAAsX,GAAA,IAEAq2E,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAsX,IAEAy2E,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAsX,EAAAi4C,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAsX,EAAAi4C,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAsX,EAAAra,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GACA,OAAAwtF,EAAAvwF,EAAA+C,EAAAsX,GAAA,IAEAs5E,kCAAA,SAAA3zF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAsX,GAAA,IAEAu5E,mCAAA,SAAA5zF,EAAA+C,GACA,OAAAwtF,EAAAxtF,EAAA/C,EAAAqa,GAAA,IAEAw5E,kCAAA,SAAA7zF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAqa,GAAA,IAEAy5E,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAsX,GAAA,GAAA5U,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAqa,GAAA,GAAA5U,WAGAuuF,mHAAA,SAAA30F,EAAAkB,EAAAkT,GAGA,IAFA,IAAAtP,EAAAkW,EAAAhb,EAAAkB,GAEAtB,EAAA,EAAAA,EAAAwU,EAAA9T,OAAAV,IACAkF,EAAAkW,EAAAlW,EAAAsP,EAAAxU,IAGA,OAAAkF,KAIA,OADAkW,EAAA4pD,MAAA,8BACA5pD,+SCnGA,aAEA,IAAA2+B,EAAAr6C,EAAA,qBAAAq6C,QAgFAv5C,EAAA2I,KAAA,QACA3I,EAAA8vD,QA/EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1xD,EAAAgyD,EAAA9zD,EAAA,UACAqD,EAAAywD,EAAA9zD,EAAA,gBACAgN,EAAA8mD,EAAA9zD,EAAA,mBACAqkD,EAAAyP,EAAA9zD,EAAA,qBACA6D,EAAAiwD,EAAA9zD,EAAA,WACAyiE,EAAA3O,EAAA9zD,EAAA,0BACAuP,EAAAukD,EAAA9zD,EAAA,wBA8BAqE,EAAAmvD,EAAA,QAAA,CACA8hC,yBAeA,SAAAxgF,GAMA,IAHA,IAAAoF,EAAA,EACAq7E,EAAA,EAEAj1F,EAAA,EAAAA,EAAAwU,EAAA9T,OAAAV,IAAA,CACA,IAAAgH,EAAAxF,EAAAgT,EAAAxU,IAEAmiE,EAAA8yB,EAAAjuF,IACA4S,EAAAmqC,EAAAnqC,EAAAmqC,EAAAr3C,EAAAuoF,EAAAjuF,GAAA0F,EAAAuoF,EAAAjuF,KACA4S,EAAA7W,EAAA6W,EAAA,GACAq7E,EAAAjuF,GAEA4S,EAAA7W,EAAA6W,EAAA3K,EAAAjI,GAAA+8C,EAAAr3C,EAAA1F,EAAAiuF,GAAAvoF,EAAA1F,EAAAiuF,IAAAjuF,GAIA,OAAA+8C,EAAAkxC,EAAA1xF,EAAAqW,KAhCAmG,MAAA,SAAAhf,GACA,OAAAgD,EAAAuW,MAAAvW,EAAAg2C,EAAAh5C,KAEA8wE,OAAA,SAAA9wE,GACA,OAAAgD,EAAAuW,MAAAvW,EAAAg2C,EAAAh5C,EAAAif,eAgCA,OADAjc,EAAAihE,MAAA,gCACAjhE,iMC/EA,aAEAnD,EAAAJ,QAAA,CAAAd,EAAA,SAAAA,EAAA,SAAAA,EAAA,eAAAA,EAAA,UAAAA,EAAA,UAAAA,EAAA,UAAAA,EAAA,YAAAA,EAAA,eAAAA,EAAA,iBAAAA,EAAA,YAAAA,EAAA,SAAAA,EAAA,WAAAA,EAAA,SAAAA,EAAA,WAAAA,EAAA,SAAAA,EAAA,WAAAA,EAAA,SAAAA,EAAA,SAAAA,EAAA,WAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,cAAAA,EAAA,UAAAA,EAAA,aAAAA,EAAA,cAAAA,EAAA,SAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,UAAAA,EAAA,YAAAA,EAAA,cAAAA,EAAA,gBAAAA,EAAA,eAAAA,EAAA,yhBCFA,aAEA,IAAAoP,EAAApP,EAAA,sBAAAoP,UA8IA,SAAAomF,EAAA90F,EAAAkB,GACA,IAAAwN,EAAA1O,KAAA0O,EAAAxN,GACA,MAAA,IAAAjB,MAAA,sDAGA,GAAA,IAAAD,GAAA,IAAAkB,EACA,OAAA,EAQA,IAHA,IAAAxB,EACAoT,EAAA9S,EAAAkB,EAEA,IAAAA,GAEAA,EAAAlB,GADAN,EAAAwB,GAEAlB,EAAAN,EAGA,OAAAkB,KAAAQ,IAAA0R,EAAA9S,GAGAI,EAAA2I,KAAA,MACA3I,EAAA8vD,QApKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy1F,EAAA3hC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA+BA2b,EAAA63C,EAAA,MAAA,CACAu/B,iBAAAyC,EACAvC,uBAsEA,SAAAvyF,EAAAkB,GACA,IAAAlB,EAAA2O,UAAAzN,EAAAyN,QACA,MAAA,IAAA1O,MAAA,sDAGA,GAAAD,EAAAqG,UAAAnF,EAAAmF,SACA,OAAA,IAAAwzC,EAAA0d,UAAA,GAOA,IAFA,IAAAzkD,EAAA9S,EAAA2L,MAAAzK,IAEAA,EAAAmF,UAAA,CACA,IAAA3G,EAAAwB,EACAA,EAAAlB,EAAAgQ,IAAAtQ,GACAM,EAAAN,EAGA,OAAAoT,EAAAhQ,IAAA9C,GAAAoB,OAxFAoxF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAsa,IAAAvX,IAEA8tF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAqxF,EAAAp0F,EAAA+C,EAAAuX,IAEAs2E,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAAsa,GAAA,IAEAq2E,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAowF,EAAAnzF,EAAA+C,EAAAuX,GAAA,IAEAo2E,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAuX,IAEAw2E,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAuX,EAAAg4C,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAuX,EAAAg4C,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAuX,EAAAta,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAuX,GAAA,IAEAq5E,kCAAA,SAAA3zF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAuX,GAAA,IAEAs5E,mCAAA,SAAA5zF,EAAA+C,GACA,OAAA6vF,EAAA7vF,EAAA/C,EAAAsa,GAAA,IAEAu5E,kCAAA,SAAA7zF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAsa,GAAA,IAEAw5E,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAuX,GAAA,GAAA7U,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAsa,GAAA,GAAA7U,WAGAuuF,mHAAA,SAAA30F,EAAAkB,EAAAkT,GAGA,IAFA,IAAAtP,EAAAmW,EAAAjb,EAAAkB,GAEAtB,EAAA,EAAAA,EAAAwU,EAAA9T,OAAAV,IACAkF,EAAAmW,EAAAnW,EAAAsP,EAAAxU,IAGA,OAAAkF,KAKA,OAFAmW,EAAA2pD,WAAA/iE,EAEAoZ,+SCxGA,aAEA,IAAAooD,EAAA/jE,EAAA,kCA0EAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAzEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAmnB,EAAA7mB,EAAA9zD,EAAA,mBAoCAgC,EAAAwxD,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAU,IAAAX,GAGA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAAW,OAGAU,QAAA,SAAArB,GACA,OAAAA,EAAAW,OAEAi2D,UAAA,SAAA52D,GACA,OAAAA,EAAAiO,cAAAuG,EAAA+9C,YACAvyD,EAAAsN,KAGA,IAAA4rC,EAAA73C,QAAArB,EAAAiR,WAAA,GAAAtQ,OAGAgiE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAW,IAEA4wF,WAAA,SAAAvxF,EAAAwO,GAEA,OAAA8qE,EAAA34E,EAAAX,GAAAW,EAAA6N,OAOA,OAJA7N,EAAAsjE,MAAA,CACArkE,EAAA,gCACA6xF,EAAA,+CAEA9wF,sFCzEA,aAEA,IAAA+hE,EAAA/jE,EAAA,kCAiEA,IAAA01F,EAAAp0F,KAAAkV,OAAA,SAAAnV,GACA,OAAAC,KAAAU,IAAAX,GAAAC,KAAAyG,MAGAjH,EAAA2I,KAAA,QACA3I,EAAA8vD,QApEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAAh9C,EAAAg9C,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAwU,EAAA+9C,YACA8hC,EAAAr0F,GAGA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAAW,MAAAwB,IAAAlC,KAAAyG,OAGArF,QAAA,SAAArB,GACA,OAAA,IAAAk5C,EAAA73C,QAAArB,GAAAW,MAAAwB,IAAAlC,KAAAyG,OAEAkwD,UAAA,SAAA52D,GACA,OAAAA,EAAAiO,cAAAuG,EAAA+9C,YACAvyD,EAAAW,MAGA,IAAAu4C,EAAA73C,QAAArB,EAAAiR,WAAA,GAAAtQ,MAAAwB,IAAAlC,KAAAyG,OAGAi8D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAmV,MAMA,OAHAA,EAAA8uD,MAAA,CACArkE,EAAA,uCAEAuV,iECzDA,aAEA,IAAAutD,EAAA/jE,EAAA,kCA6FAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA5FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAmnB,EAAA7mB,EAAA9zD,EAAA,mBACAgC,EAAA8xD,EAAA9zD,EAAA,UAiCAk/D,EAAA1L,EAAA,QAAA,CACA5uB,OA2BA,SAAAvjC,GACA,OAAA,GAAAA,GAAAwU,EAAA+9C,YACAtyD,KAAA49D,MAAA59D,KAAA49D,MAAA79D,GAAAC,KAAAU,IAAAX,EAAA,GAGAs0F,EAAA,IAAAp7C,EAAA73C,QAAArB,EAAA,KA/BAqB,QAAAizF,EACA19B,UAAA,SAAA52D,GACA,IAAA+C,EAAA/C,EAAAyB,KAAA,GAEA,OAAAsB,EAAAkL,cAAAuG,EAAA+9C,YACAxvD,EAAAuK,KAGAgnF,EAAA,IAAAp7C,EAAA73C,QAAArB,EAAAiR,WAAA,KAGA0xD,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA69D,IAEA0zB,WAAA,SAAAvxF,EAAAwO,GAEA,OAAA8qE,EAAAzb,EAAA79D,GAAAW,EAAA6N,OA0BA,SAAA8lF,EAAAt0F,GACA,IAAAu0F,EAAAv0F,EAAAgB,GAAA,EACA,OAAA,IAAAk4C,EAAA73C,QAAApB,KAAAU,IAAAV,KAAAuC,KAAA+xF,EAAAA,EAAAv0F,EAAAiB,GAAAjB,EAAAiB,KAAAhB,KAAAY,MAAAb,EAAAiB,GAAAszF,IAOA,OAJA12B,EAAAoG,MAAA,CACArkE,EAAA,kCACA6xF,EAAA,iDAEA5zB,kGC5FA,aAEA,IAAA6E,EAAA/jE,EAAA,kCAkEAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAjEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAAj9C,EAAAi9C,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAiV,KAAAjV,KAAAiV,KAAAlV,GAAAC,KAAAU,IAAAX,GAAAC,KAAAq5D,IAGAk7B,EAAA,IAAAt7C,EAAA73C,QAAArB,EAAA,KAGAqB,QAAAmzF,EACA59B,UAAA,SAAA52D,GACA,OAAAA,EAAAiO,cAAAuG,EAAA+9C,YACAvyD,EAAAW,IAAA,GAGA6zF,EAAA,IAAAt7C,EAAA73C,QAAArB,EAAAiR,WAAA,KAGA0xD,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAkV,MAUA,SAAAs/E,EAAAx0F,GACA,IAAAy0F,EAAAx0F,KAAAuC,KAAAxC,EAAAgB,GAAAhB,EAAAgB,GAAAhB,EAAAiB,GAAAjB,EAAAiB,IACA,OAAA,IAAAi4C,EAAA73C,QAAApB,KAAAiV,KAAAjV,KAAAiV,KAAAu/E,GAAAx0F,KAAAU,IAAA8zF,GAAAx0F,KAAAq5D,IAAAr5D,KAAAY,MAAAb,EAAAiB,GAAAjB,EAAAgB,IAAAf,KAAAq5D,KAIA,OADApkD,EAAA+uD,MAAA,qCACA/uD,iECjEA,aAmIAzV,EAAA2I,KAAA,MACA3I,EAAA8vD,QAlIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAEAgoE,EAAAhoE,EAAA,qBAEAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA+1F,EAAAjiC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAqCA0Q,EAAA8iD,EAAA,MAAA,CACAu/B,iBAgEA,SAAA1xF,EAAA+C,GACA,GAAA,EAAAA,EAIA,OAAA/C,EAAA+C,EAAA9C,KAAAiF,MAAAlF,EAAA+C,GACA,GAAA,IAAAA,EACA,OAAA/C,EAIA,MAAA,IAAAV,MAAA,gDA1EAsyF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAAA,EAAA2C,SAAA1F,EAAAA,EAAAqP,IAAAtM,IAEA8uF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAqP,IAAAtM,IAEA8tF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAA2xF,EAAA10F,EAAA+C,EAAAsM,GAAA,IAEAuhF,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAAqP,GAAA,IAEAshF,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAsM,GAAA,IAEAqhF,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAsM,IAEAyhF,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAsM,EAAAijD,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAsM,EAAAijD,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAsM,EAAArP,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAsM,GAAA,IAEA4hF,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAsM,GAAA,IAEA+hF,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAqP,GAAA,IAEA8hF,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAqP,GAAA,IAEAgiF,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAsM,GAAA,GAAA5J,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAqP,GAAA,GAAA5J,aAMA,OAHA4J,EAAA40D,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,IAAA,uBAEAl1D,kYC1GA,aAEA,IAAAo4C,EAAA9oD,EAAA,sBAAA8oD,OAEAl9B,EAAA5rB,EAAA,qBA25BAc,EAAA2I,KAAA,WACA3I,EAAA8vD,QA15BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA06E,EAAA5mB,EAAA9zD,EAAA,gBACA46E,EAAA9mB,EAAA9zD,EAAA,qBACA66E,EAAA/mB,EAAA9zD,EAAA,8BACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCACAm4D,EAAA5d,EAAA4d,YACA2iB,EAAAvgC,EAAAugC,aAmCAz2B,EAAAmP,EAAA,WAAA1K,EAAA,CAEAqpC,eAAA,SAAA9wF,EAAA+C,GAEA4xF,EAAApqE,EAAA2P,KAAAl6B,GAAAuqB,EAAA2P,KAAAn3B,IAGA,IAAAsI,EAAA23C,EAAAsP,EAAAtyD,GAAAsyD,EAAAvvD,IAEA,OAAAm2C,EAAA+b,SAAA5pD,GAAAA,EAAA5F,UAAA4F,GAEAupF,iBAAA,SAAA50F,EAAA+C,GAEA,IAAA8xF,EAAA70F,EAAAk6B,OACA46D,EAAA/xF,EAAAm3B,OAKA,OAHAy6D,EAAAE,EAAAC,GAGA,IAAAD,EAAAl1F,OAEA,IAAAm1F,EAAAn1F,OAiIA,SAAAN,EAAAkB,EAAAzB,GAEA,GAAA,IAAAA,EACA,MAAA,IAAAQ,MAAA,qCAIA,IAMAy1F,EANAC,EAAA31F,EAAAy6E,MACA+U,EAAAxvF,EAAA+qF,UAEAlB,EAAA3oF,EAAAu5E,MACAmb,EAAA10F,EAAA6pF,UAIA8K,EAAA7b,EAEA8b,EAAA5b,EAEAsV,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,KAMA,IAFA,IAAA51F,EAAAg2F,EAAAH,EAAA,GAAA9L,EAAA,IAEAjqF,EAAA,EAAAA,EAAAH,EAAAG,IAEAE,EAAA+1F,EAAA/1F,EAAAg2F,EAAAH,EAAA/1F,GAAAiqF,EAAAjqF,KAGA,OAAAE,EAlKAi2F,CAAAp1F,EAAA+C,EAAA8xF,EAAA,IA8KA,SAAAx1F,EAAAkB,GAEA,GAAA,UAAAA,EAAA80F,UAIA,OAYA,SAAAh2F,EAAAkB,GAEA,IAWAw0F,EAXAC,EAAA31F,EAAAy6E,MACAuQ,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAlB,EAAA3oF,EAAAu5E,MACAwb,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEAmL,EAAAlL,EAAA,GACAmL,EAAAF,EAAA,GAIAJ,EAAA7b,EAEA8b,EAAA5b,EAEAsV,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,KAMA,IAFA,IAAA51F,EAAA,GAEAoK,EAAA,EAAAA,EAAAisF,EAAAjsF,IAAA,CAIA,IAFA,IAAAqK,EAAAuhF,EAAAH,EAAA,GAAA9L,EAAA,GAAA3/E,IAEAtK,EAAA,EAAAA,EAAAs2F,EAAAt2F,IAEA2U,EAAAshF,EAAAthF,EAAAuhF,EAAAH,EAAA/1F,GAAAiqF,EAAAjqF,GAAAsK,KAGApK,EAAAoK,GAAAqK,EAIA,OAAA,IAAAkjD,EAAA,CACAv1B,KAAApiC,EACA+6B,KAAA,CAAAs7D,GACArL,SAAA4K,IA1DAU,CAAAp2F,EAAAkB,GAHA,MAAA,IAAAjB,MAAA,4CA7KAo2F,CAAA11F,EAAA+C,GAIA,IAAA+xF,EAAAn1F,OAEAg2F,EAAA31F,EAAA+C,GAIA6yF,EAAA51F,EAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAigD,EAAAhjD,EAAAsyD,EAAAvvD,KAEAguF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAigD,EAAAsP,EAAAtyD,EAAA+C,EAAAsyF,WAAAtyF,IAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAw2E,GAAA,IAEA0X,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAw2E,GAAA,IAEA6X,oBAAA,SAAApxF,EAAA+C,GACA,OAAA6vF,EAAA7vF,EAAA/C,EAAAu5E,GAAA,IAEA4X,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAu5E,GAAA,IAEA8X,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAw2E,GAAA,GAAA9zE,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAu5E,GAAA,GAAA9zE,WAEA8rF,WAAAhY,EACAiY,mBAAA,SAAAxxF,EAAA+C,EAAA6iD,GAGA,IAFA,IAAA/sC,EAAAmqC,EAAAhjD,EAAA+C,GAEA9D,EAAA,EAAAA,EAAA2mD,EAAAjmD,OAAAV,IACA4Z,EAAAmqC,EAAAnqC,EAAA+sC,EAAA3mD,IAGA,OAAA4Z,IAEA0gE,EAAAxlB,aAEA,SAAA4gC,EAAAkB,EAAAC,GAEA,OAAAD,EAAAl2F,QACA,KAAA,EAEA,OAAAm2F,EAAAn2F,QACA,KAAA,EAEA,GAAAk2F,EAAA,KAAAC,EAAA,GAEA,MAAA,IAAA1+B,WAAA,2EAGA,MAEA,KAAA,EAEA,GAAAy+B,EAAA,KAAAC,EAAA,GAEA,MAAA,IAAA1+B,WAAA,wDAAAy+B,EAAA,GAAA,6BAAAC,EAAA,GAAA,KAGA,MAEA,QACA,MAAA,IAAAx2F,MAAA,+DAAAw2F,EAAAn2F,OAAA,gBAGA,MAEA,KAAA,EAEA,OAAAm2F,EAAAn2F,QACA,KAAA,EAEA,GAAAk2F,EAAA,KAAAC,EAAA,GAEA,MAAA,IAAA1+B,WAAA,yDAAAy+B,EAAA,GAAA,+BAAAC,EAAA,GAAA,KAGA,MAEA,KAAA,EAEA,GAAAD,EAAA,KAAAC,EAAA,GAEA,MAAA,IAAA1+B,WAAA,2DAAAy+B,EAAA,GAAA,+BAAAC,EAAA,GAAA,KAGA,MAEA,QACA,MAAA,IAAAx2F,MAAA,+DAAAw2F,EAAAn2F,OAAA,gBAGA,MAEA,QACA,MAAA,IAAAL,MAAA,+DAAAu2F,EAAAl2F,OAAA,iBAyIA,IAAAg2F,EAAAxjC,EAAA,wBAAA,CACA8+B,mBA6BA,SAAA5xF,EAAAkB,GAEA,IAUAw0F,EAVAC,EAAA31F,EAAAy6E,MACAuQ,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAlB,EAAA3oF,EAAAu5E,MACAmb,EAAA10F,EAAA6pF,UAEA2L,EAAA1L,EAAA,GACA2L,EAAA3L,EAAA,GAIA6K,EAAA7b,EAEA8b,EAAA5b,EAEAsV,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,KAMA,IAFA,IAAA51F,EAAA,GAEAF,EAAA,EAAAA,EAAA82F,EAAA92F,IAAA,CAMA,IAJA,IAAA+3E,EAAAge,EAAA/1F,GAEA2U,EAAAuhF,EAAAne,EAAA,GAAAkS,EAAA,IAEA3/E,EAAA,EAAAA,EAAAysF,EAAAzsF,IAEAqK,EAAAshF,EAAAthF,EAAAuhF,EAAAne,EAAAztE,GAAA2/E,EAAA3/E,KAGApK,EAAAF,GAAA2U,EAIA,OAAA,IAAAkjD,EAAA,CACAv1B,KAAApiC,EACA+6B,KAAA,CAAA67D,GACA5L,SAAA4K,KA3EA7D,oBA0QA,SAAA7xF,EAAAkB,GAEA,IAAA2tF,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACA+T,EAAAxvF,EAAA+qF,UAEA,IAAA8D,EACA,MAAA,IAAA5uF,MAAA,0DAIA,IAUAy1F,EAVA7L,EAAA3oF,EAAAu5E,MACAmb,EAAA10F,EAAA6pF,UAEA2L,EAAA12F,EAAAu6E,MAAA,GACAqc,EAAA11F,EAAAq5E,MAAA,GAEAkV,EAAA,GACApD,EAAA,GACAC,EAAA,GAIAuJ,EAAA7b,EAEA8b,EAAA5b,EAEA3tE,EAAA4tE,EAEAia,EAAA,EAEA5E,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,IACAnpF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,IAUA,IANA,IAAA/0F,EAAA,GAEA0I,EAAA,GAIAwtF,EAFAvK,EAAA,GAAA,EAEAuK,EAAAD,EAAAC,IAAA,CAEA,IAAAC,EAAAjN,EAAAgN,GAEA,IAAAtqF,EAAAuqF,EAAA1C,GAEA,IAAA,IAAA2C,EAAAnI,EAAAiI,GAAAG,EAAApI,EAAAiI,EAAA,GAAAI,EAAAF,EAAAE,EAAAD,EAAAC,IAAA,CAEA,IAAAC,EAAAvI,EAAAsI,GAEA5tF,EAAA6tF,GASAv2F,EAAAu2F,GAAArB,EAAAl1F,EAAAu2F,GAAApB,EAAAgB,EAAAjI,EAAAoI,MAPA5tF,EAAA6tF,IAAA,EAEA7K,EAAAz8E,KAAAsnF,GAEAv2F,EAAAu2F,GAAApB,EAAAgB,EAAAjI,EAAAoI,MAUA,IAAA,IAAAx8E,EAAA4xE,EAAA/rF,OAAAH,EAAA,EAAAA,EAAAsa,EAAAta,IAAA,CAEA,IAAAg3F,EAAA9K,EAAAlsF,GAEAsvF,EAAAtvF,GAAAQ,EAAAw2F,GAMA,OAFA7K,EAAA,GAAAD,EAAA/rF,OAEA,IAAA85E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAA67D,EAAA,GACA5L,SAAA4K,OAzVAa,EAAAzjC,EAAA,wBAAA,CACAu+B,2BA2EA,SAAArxF,EAAAkB,GAEA,IAYAw0F,EAZAC,EAAA31F,EAAAy6E,MACAuQ,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAlB,EAAA3oF,EAAAu5E,MACAwb,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA2L,EAAA1L,EAAA,GACA2L,EAAA3L,EAAA,GACAmL,EAAAF,EAAA,GAIAJ,EAAA7b,EAEA8b,EAAA5b,EAEAsV,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,KAMA,IAFA,IAAA51F,EAAA,GAEAF,EAAA,EAAAA,EAAA82F,EAAA92F,IAAA,CAEA,IAAA+3E,EAAAge,EAAA/1F,GAEAE,EAAAF,GAAA,GAEA,IAAA,IAAAsK,EAAA,EAAAA,EAAAisF,EAAAjsF,IAAA,CAIA,IAFA,IAAAqK,EAAAuhF,EAAAne,EAAA,GAAAkS,EAAA,GAAA3/E,IAEAvJ,EAAA,EAAAA,EAAAg2F,EAAAh2F,IAEA4T,EAAAshF,EAAAthF,EAAAuhF,EAAAne,EAAAh3E,GAAAkpF,EAAAlpF,GAAAuJ,KAGApK,EAAAF,GAAAsK,GAAAqK,GAKA,OAAA,IAAAkjD,EAAA,CACAv1B,KAAApiC,EACA+6B,KAAA,CAAA67D,EAAAP,GACArL,SAAA4K,KAhIApE,4BA6IA,SAAAtxF,EAAAkB,GAEA,IAAAy0F,EAAA31F,EAAAy6E,MACAuQ,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KACAwa,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,IAAAqF,EACA,MAAA,IAAAnwF,MAAA,0DAIA,IAGAy1F,EAHAgB,EAAA1L,EAAA,GACAmL,EAAAF,EAAA,GAIAJ,EAAA7b,EAEA8b,EAAA5b,EAEA3tE,EAAA4tE,EAEAia,EAAA,EAEA5E,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,IACAnpF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,IAgBA,IAZA,IAAAjG,EAAA,GACApD,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAA67D,EAAAP,GACArL,SAAA4K,IAGA0B,EAAA,EAAAA,EAAAjB,EAAAiB,IAAA,CAEA9K,EAAA8K,GAAA/K,EAAA/rF,OAEA,IAAA+2F,EAAAtH,EAAAqH,GACAE,EAAAvH,EAAAqH,EAAA,GAEA,GAAAC,EAAAC,EAIA,IAFA,IAAA/sD,EAAA,EAEA3qC,EAAA,EAAAA,EAAA82F,EAAA92F,IAAA,CAMA,IAJA,IAAAyrF,EAAAzrF,EAAA,EAEA23F,OAAA,EAEAC,EAAAH,EAAAG,EAAAF,EAAAE,IAAA,CAEA,IAAAX,EAAA/G,EAAA0H,GAEAjtD,IAAA8gD,GAEAkM,EAAAzB,EAAAH,EAAA/1F,GAAAi3F,GAAAzG,EAAAoH,IAEAjtD,EAAA8gD,GAGAkM,EAAA1B,EAAA0B,EAAAzB,EAAAH,EAAA/1F,GAAAi3F,GAAAzG,EAAAoH,KAKAjtD,IAAA8gD,GAAA9+E,EAAAgrF,EAAAnD,KAEA/H,EAAAz8E,KAAAhQ,GACA6vF,EAAA7/E,KAAA2nF,KASA,OAFAjL,EAAA6J,GAAA9J,EAAA/rF,OAEAR,GA/OAyxF,4BAmWA,SAAAvxF,EAAAkB,GAEA,IAAA2tF,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACA+T,EAAAxvF,EAAA+qF,UAEA,IAAA8D,EACA,MAAA,IAAA5uF,MAAA,0DAIA,IAOAy1F,EAPA7L,EAAA3oF,EAAAu5E,MACAmb,EAAA10F,EAAA6pF,UAEA2L,EAAA12F,EAAAu6E,MAAA,GACAqc,EAAA11F,EAAAq5E,MAAA,GACA4b,EAAAj1F,EAAAq5E,MAAA,GAIAsb,EAAA7b,EAEA8b,EAAA5b,EAEA3tE,EAAA4tE,EAEAia,EAAA,EAEA5E,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,IACAnpF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,IAoBA,IAhBA,IAAAjG,EAAA,GACApD,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAA67D,EAAAP,GACArL,SAAA4K,IAGA/0F,EAAA,GAEA0I,EAAA,GAEA+tF,EAAA,EAAAA,EAAAjB,EAAAiB,IAAA,CAEA9K,EAAA8K,GAAA/K,EAAA/rF,OAIA,IAFA,IAAA+qF,EAAA+L,EAAA,EAEAP,EAAA,EAAAA,EAAAD,EAAAC,IAAA,CAEA,IAAAY,EAAA5N,EAAAgN,GAAAO,GAEA,IAAA7qF,EAAAkrF,EAAArD,GAEA,IAAA,IAAA2C,EAAAnI,EAAAiI,GAAAG,EAAApI,EAAAiI,EAAA,GAAAI,EAAAF,EAAAE,EAAAD,EAAAC,IAAA,CAEA,IAAAC,EAAAvI,EAAAsI,GAEA5tF,EAAA6tF,KAAA7L,GAEAhiF,EAAA6tF,GAAA7L,EAEAgB,EAAAz8E,KAAAsnF,GAEAv2F,EAAAu2F,GAAApB,EAAA2B,EAAA5I,EAAAoI,KAGAt2F,EAAAu2F,GAAArB,EAAAl1F,EAAAu2F,GAAApB,EAAA2B,EAAA5I,EAAAoI,MAOA,IAAA,IAAAjJ,EAAA1B,EAAA8K,GAAA38E,EAAA4xE,EAAA/rF,OAAAH,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IAAA,CAEA,IAAAg3F,EAAA9K,EAAAlsF,GAEAsvF,EAAAtvF,GAAAQ,EAAAw2F,IAOA,OAFA7K,EAAA6J,GAAA9J,EAAA/rF,OAEAR,GAtcA0xF,6BAkdA,SAAAxxF,EAAAkB,GAEA,IAeAw0F,EAfA7G,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACA+T,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KACAma,EAAA10F,EAAA6pF,UAEA2L,EAAA12F,EAAAu6E,MAAA,GACA4b,EAAAj1F,EAAAq5E,MAAA,GAEAruD,EAAA2iE,GAAAuB,EAIAyF,EAAA7b,EAEA8b,EAAA5b,EAEAsV,GAAAoG,GAAApG,IAAAoG,GAAA,iBAAApG,IAEAkG,EAAAlG,EAEAqG,EAAA/iC,EAAA3V,KAAA68B,EAAA,CAAA0b,EAAAA,IACAI,EAAAhjC,EAAA3V,KAAA+8B,EAAA,CAAAwb,EAAAA,KAsBA,IAlBA,IAgBAuB,EAAAF,EAAAC,EAAAQ,EAAAH,EAAAC,EAAAJ,EAAAL,EAhBApH,EAAAvjE,EAAA,QAAArqB,EACAwqF,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAA67D,EAAAP,GACArL,SAAA4K,IAGA/0F,EAAAurB,EAAA,QAAArqB,EAEAwH,EAAA,GAIA+tF,EAAA,EAAAA,EAAAjB,EAAAiB,IAAA,CAEA9K,EAAA8K,GAAA/K,EAAA/rF,OAEA,IAAA+qF,EAAA+L,EAAA,EAEA,IAAAC,EAAAtH,EAAAqH,GAAAE,EAAAvH,EAAAqH,EAAA,GAAAI,EAAAH,EAAAG,EAAAF,EAAAE,IAIA,GAFAX,EAAA/G,EAAA0H,GAEAtrE,EAEA,IAAA6qE,EAAAnI,EAAAiI,GAAAG,EAAApI,EAAAiI,EAAA,GAAAI,EAAAF,EAAAE,EAAAD,EAAAC,IAEAC,EAAAvI,EAAAsI,GAEA5tF,EAAA6tF,KAAA7L,GAEAhiF,EAAA6tF,GAAA7L,EAEAgB,EAAAz8E,KAAAsnF,GAEAv2F,EAAAu2F,GAAApB,EAAA1F,EAAAoH,GAAA3I,EAAAoI,KAGAt2F,EAAAu2F,GAAArB,EAAAl1F,EAAAu2F,GAAApB,EAAA1F,EAAAoH,GAAA3I,EAAAoI,UAKA,IAAAF,EAAAnI,EAAAiI,GAAAG,EAAApI,EAAAiI,EAAA,GAAAI,EAAAF,EAAAE,EAAAD,EAAAC,IAEAC,EAAAvI,EAAAsI,GAEA5tF,EAAA6tF,KAAA7L,IAEAhiF,EAAA6tF,GAAA7L,EAEAgB,EAAAz8E,KAAAsnF,IAOA,GAAAhrE,EAEA,IAAA,IAAA8hE,EAAA1B,EAAA8K,GAAA38E,EAAA4xE,EAAA/rF,OAAAH,EAAA6tF,EAAA7tF,EAAAsa,EAAAta,IAAA,CAEA,IAAAg3F,EAAA9K,EAAAlsF,GAEAsvF,EAAAtvF,GAAAQ,EAAAw2F,IAQA,OAFA7K,EAAA6J,GAAA9J,EAAA/rF,OAEAR,KAMA,OAHA6jD,EAAAihB,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,SAAA,uBAEAvhB,0SC55BA,aA8CAvjD,EAAA8vD,QA5CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAcA,IAAAonB,EAAApnB,EAAA,iBAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,EAAA+C,GAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAkC,IAAAa,IAEA6uF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAgL,MAAAjI,IAEA8uF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAkC,IAAAa,IAEAg0F,gDAAA,SAAA/2F,EAAA+C,GACA,IAAAoB,EAAApB,EAAAsC,QAEA,OADAlB,EAAA8B,MAAA,OAAA9B,EAAA8B,MAAA9B,EAAA8uF,WAAAjzF,GAAAu5E,EAAAp1E,EAAA8B,MAAAjG,GACAmE,GAEA6yF,gDAAA,SAAAh3F,EAAA+C,GACA,IAAAoB,EAAAnE,EAAAqF,QAEA,OADAlB,EAAA8B,MAAA,OAAA9B,EAAA8B,MAAA9B,EAAA8uF,WAAAlwF,GAAAw2E,EAAAp1E,EAAA8B,MAAAlD,GACAoB,GAEA2tF,aAAA,SAAA9xF,EAAA+C,GACA,OAAA/C,EAAAgjD,SAAAjgD,MAGA,OAAAw2E,6BC3CA,aAuNA95E,EAAA2I,KAAA,OACA3I,EAAA8vD,QAtNA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1xD,EAAAgyD,EAAA9zD,EAAA,sBACAqD,EAAAywD,EAAA9zD,EAAA,sBACA0D,EAAAowD,EAAA9zD,EAAA,sBACAsgE,EAAAxM,EAAA9zD,EAAA,oBACA6D,EAAAiwD,EAAA9zD,EAAA,uBACAqkD,EAAAyP,EAAA9zD,EAAA,2BACA66E,EAAA/mB,EAAA9zD,EAAA,8BACAuiE,EAAAzO,EAAA9zD,EAAA,yBACAyiE,EAAA3O,EAAA9zD,EAAA,0BACA2zD,EAAAG,EAAA9zD,EAAA,sCAwCAm/D,EAAA3L,EAAA,OAAA,CACA5uB,OAAAtjC,KAAAQ,IACAY,QAAA,SAAArB,GACA,OAAAA,EAAAS,OAEAm2D,UAAA,SAAA52D,GAEA,OAAAA,EAAAS,OAEAw2F,QAAA,SAAAj3F,GAEA,OAAAC,KAAAQ,IAAAT,IAEAgf,MAAA,SAAAhf,GACA,OAAAk3F,EAAA5kC,EAAAtyD,GAAA,IAEA8wE,OAAA,SAAA9wE,GACA,OAAAk3F,EAAAl3F,EAAA,IAEAm3F,sEAAA,SAAAn3F,GAEA,OAAA89D,EAAA99D,IAEAo3F,qCAAA,SAAAp3F,EAAAR,GACA,OAAA03F,EAAA5kC,EAAAtyD,GAAAR,IAEA63F,sCAAA,SAAAr3F,EAAAR,GACA,OAAA03F,EAAAl3F,EAAAR,MAWA,SAAA03F,EAAAl3F,EAAAR,GAEA,IAAA83F,EAAAt3F,EAAAk6B,OAEA,GAAA,IAAAo9D,EAAA33F,OAAA,CAEA,GAAAH,IAAA2B,OAAAo2F,mBAAA,QAAA/3F,EAAA,CAEA,IAAAg4F,EAAA,EASA,OAPAx3F,EAAAmZ,QAAA,SAAAlT,GACA,IAAAyO,EAAAjU,EAAAwF,GAEAi7D,EAAAxsD,EAAA8iF,KACAA,EAAA9iF,KAEA,GACA8iF,EAKA,IAAAC,EAFA,GAAAj4F,IAAA2B,OAAAu2F,mBAAA,SAAAl4F,EAWA,OAPAQ,EAAAmZ,QAAA,SAAAlT,GACA,IAAAyO,EAAAjU,EAAAwF,GAEAwxF,IAAAr2B,EAAA1sD,EAAA+iF,KACAA,EAAA/iF,KAEA,GACA+iF,GAAA,EAGA,GAAA,QAAAj4F,EACA,OAAA03F,EAAAl3F,EAAA,GAGA,GAAA,iBAAAR,GAAAmC,MAAAnC,GAgBA,MAAA,IAAAF,MAAA,+BAdA,GAAAk6E,EAAAh6E,EAAA,GAUA,OAAA2B,OAAAo2F,kBARA,IAAAz4F,EAAA,EAKA,OAHAkB,EAAAmZ,QAAA,SAAAlT,GACAnH,EAAAkD,EAAAK,EAAA5B,EAAAwF,GAAAzG,GAAAV,KACA,GACAuD,EAAAvD,EAAA,EAAAU,GAWA,GAAA,IAAA83F,EAAA33F,OAAA,CAEA,GAAA,IAAAH,EAAA,CAEA,IAAAL,EAAA,GAEAw4F,EAAA,EAYA,OAVA33F,EAAAmZ,QAAA,SAAAlT,EAAAmT,GACA,IAAA7P,EAAA6P,EAAA,GACAw+E,EAAA51F,EAAA7C,EAAAoK,IAAA,EAAA9I,EAAAwF,IAEAi7D,EAAA02B,EAAAD,KACAA,EAAAC,GAGAz4F,EAAAoK,GAAAquF,IACA,GACAD,EAGA,GAAAn4F,IAAA2B,OAAAo2F,mBAAA,QAAA/3F,EAAA,CAEA,IAAAZ,EAAA,GAEAi5F,EAAA,EAYA,OAVA73F,EAAAmZ,QAAA,SAAAlT,EAAAmT,GACA,IAAAna,EAAAma,EAAA,GACA0+E,EAAA91F,EAAApD,EAAAK,IAAA,EAAAwB,EAAAwF,IAEAi7D,EAAA42B,EAAAD,KACAA,EAAAC,GAGAl5F,EAAAK,GAAA64F,IACA,GACAD,EAGA,GAAA,QAAAr4F,EAAA,CAEA,IAAAu4F,EAAA,EAIA,OAHA/3F,EAAAmZ,QAAA,SAAAlT,EAAAmT,GACA2+E,EAAA/1F,EAAA+1F,EAAA/0C,EAAA/8C,EAAAg5D,EAAAh5D,OAEAxF,EAAA+B,EAAAu1F,IAGA,GAAA,IAAAv4F,EAEA,MAAA,IAAAF,MAAA,8FAIA,MAAA,IAAAA,MAAA,gCASA,OALAw+D,EAAAmG,MAAA,CACArkE,EAAA,gCACA6xF,OAAAvwF,GAGA48D,+SCpNA,aAuLA,SAAAk6B,EAAA34F,EAAAS,GACA,IAAA6/D,EAAA7/D,EAAA,EAMA,GAJA6/D,IACA7/D,GAAAA,GAGA,IAAAA,EACA,MAAA,IAAAR,MAAA,yBAGA,GAAAD,EAAA,GAAAY,KAAAQ,IAAAX,GAAA,GAAA,EACA,MAAA,IAAAR,MAAA,wCAIA,GAAA,IAAAD,EACA,OAAAsgE,EAAAj8D,EAAAA,EAAA,EAGA,IAAAtC,SAAA/B,GACA,OAAAsgE,EAAA,EAAAtgE,EAGA,IAAAW,EAAAC,KAAAoC,IAAApC,KAAAQ,IAAApB,GAAA,EAAAS,GAIA,OADAE,EAAAX,EAAA,GAAAW,EAAAA,EACA2/D,EAAA,EAAA3/D,EAAAA,EAuBAP,EAAA2I,KAAA,UACA3I,EAAA8vD,QAzOA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA0xF,EAAA59B,EAAA9zD,EAAA,wCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy1F,EAAA3hC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA+BAs5F,EAAA,0EACAl6B,EAAA5L,EAAA,UAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAg4F,EAAAh4F,EAAA,IAEA0xF,iBAAAsG,EACAphC,UAAA,SAAA52D,GACA,OAAAk4F,EAAAl4F,EAAA,IAAAk5C,EAAA0d,UAAA,KAEAv1D,QAAA,SAAArB,GACA,MAAA,IAAAV,MAAA24F,IAEAE,kBAAA,SAAAn4F,EAAA+C,GACA,MAAA,IAAAzD,MAAA24F,IAEArG,uBAAAsG,EACAv1B,iBAAA,SAAA3iE,GACA,OAAA+9D,EAAA/9D,EAAA,IAEA6wF,6BAAA,SAAA7wF,EAAA+C,GAEA,GAAA,IAAAA,EAAAq1F,UAEA,OAAAhE,EAAAp0F,EAAA+C,EAAAg7D,GAGA,MAAA,IAAAz+D,MAAA,0BAGAsxF,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAA+9D,GAAA,IAEA4yB,4BAAA,SAAA3wF,EAAA+C,GAEA,GAAA,IAAAA,EAAAq1F,UAEA,OAAA/H,EAAArwF,EAAA+C,EAAAg7D,GAAA,GAGA,MAAA,IAAAz+D,MAAA,0BAGAoxF,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAg7D,IAEA+yB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAg7D,EAAAzL,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAg7D,EAAAzL,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAg7D,EAAA/9D,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAg7D,GAAA,IAEA41B,kCAAA,SAAA3zF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAg7D,GAAA,IAEA61B,mCAAA,SAAA5zF,EAAA+C,GAEA,GAAA,IAAAA,EAAAq1F,UAEA,OAAAxF,EAAA7vF,EAAA/C,EAAA+9D,GAAA,GAGA,MAAA,IAAAz+D,MAAA,0BAGAu0F,kCAAA,SAAA7zF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAA+9D,GAAA,IAEA+1B,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAAg7D,EAAAzL,EAAAtyD,GAAA+C,GAAA0C,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GAEA,OAAAg7D,EAAA/9D,EAAAsyD,EAAAvvD,IAAA0C,aAMA,OAHAs4D,EAAAkG,MAAA,CACAwtB,EAAA,kCAEA1zB,EASA,SAAAm6B,EAAA74F,EAAAS,GACA,IAAA8G,EAAAsyC,EAAA0d,UAAAhwD,UACAyxF,EAAAn/C,EAAA0d,UAAAvxD,MAAA,CACAuB,UAAAA,EAAA,IAEA6sF,EAAA,IAAAv6C,EAAA0d,UAAA,GACArqD,EAAA,IAAA8rF,EAAA,GACA14B,EAAA7/D,EAAAmO,aAMA,GAJA0xD,IACA7/D,EAAAA,EAAAiF,OAGAjF,EAAA4F,SACA,MAAA,IAAApG,MAAA,yBAGA,GAAAD,EAAA4O,eAAAnO,EAAAW,MAAA4O,IAAA,GAAAjK,OAAA,GACA,MAAA,IAAA9F,MAAA,wCAIA,GAAAD,EAAAqG,SACA,OAAAi6D,EAAA,IAAA04B,EAAA30F,EAAAA,GAAA,EAGA,IAAArE,EAAA+B,WACA,OAAAu+D,EAAA8zB,EAAAp0F,EAGA,IAAAW,EAAAX,EAAAoB,MAAA4B,IAAAkK,EAAApK,IAAArC,IAIA,OADAE,EAAAX,EAAA6N,QAAAlN,EAAA+E,MAAA/E,EACA,IAAAk5C,EAAA0d,WAAA+I,EAAApzD,EAAApK,IAAAnC,GAAAA,GAAAsR,YAAA1K,mUC3KA,aAEA,IAAAvF,EAAA1C,EAAA,8BAEAwzD,EAAAxzD,EAAA,oBAEAq6D,EAAA33D,EAAAkuD,QAAA,UAAA,GAAA,GAAA4C,EAAA,CACAmmC,GAAA,SAAAt4F,EAAA+C,OAuDA,IAAAw1F,EAAA,CAAA,SAAA57E,GACA,OAAAq8C,EAAAr8C,IACA,SAAAA,GACA,OAAAq8C,EAAA,EAAAr8C,IACA,SAAAA,GACA,OAAAq8C,GAAAr8C,IACA,SAAAA,GACA,OAAAq8C,EAAA,GAAAr8C,KASA,SAAA67E,EAAAn5F,EAAAS,GACA,GAAAA,EAAA,EAAA,MAAA,IAAAR,MAAA,kCACA,GAAA,IAAAQ,EAAA,MAAA,IAAAR,MAAA,yBACA,GAAAQ,EAAA,GAAA,EAAA,MAAA,IAAAR,MAAA,2BACA,GAAA,IAAAD,GAAA,IAAAA,EAAAoB,MAAA,MAAA,CAAAu4D,EAAA,IACA,IACAxtC,EADAitE,EAAA,iBAAAp5F,GAGAo5F,GAAA,IAAAp5F,EAAA2B,IAAA,IAAA3B,EAAA4B,MAEAuqB,EADAitE,EACA,IAAAp5F,EAAA,GACA,IAAAA,EAAA4B,GACA,IAAA5B,EAAA2B,GAAA,GAEA,IAAA3B,EAAA4B,GAAA,GAAA,GASA,IALA,IAAAqB,EAAAjD,EAAAiD,MACA7B,EAAApB,EAAAoB,MACAi4F,EAAA,GACA95F,EAAAqB,KAAAoC,IAAA5B,EAAA,EAAAX,GAEAwI,EAAA,EAAAA,EAAAxI,EAAAwI,IAAA,CACA,IAAAqwF,GAAAntE,EAAA,EAAAljB,GAAAxI,EAMA64F,IAAA14F,KAAAkF,MAAAwzF,GAKAD,EAAAzpF,KAAA+pD,EAAA,CACAp6D,EAAAA,EACA66D,KAAAn3D,EAAA,EAAArC,KAAA2C,GAAA0F,GAAAxI,KANA44F,EAAAzpF,KAAAspF,EAAAI,EAAA,GAAA/5F,IAUA,OAAA85F,EAGAj5F,EAAA2I,KAAA,WACA3I,EAAA8vD,QAjHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAiCA,IAAA6L,EAAA7L,EAAA,WAAA,CACA9wD,QAAA,SAAArB,GACA,OAAAw4F,EAAAx4F,EAAA,IAEAm4F,kBAAAK,IAKA,OAHAx6B,EAAAiG,MAAA,CACAwtB,EAAA,yCAEAzzB,mFCpDA,aAEA,IAAAjwD,EAAApP,EAAA,sBAAAoP,UAEAmsB,EAAAv7B,EAAA,qBAAAu7B,KAsLAz6B,EAAA2I,KAAA,MACA3I,EAAA8vD,QArLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEAstC,EAAAwmB,EAAA9zD,EAAA,uBACAqkD,EAAAyP,EAAA9zD,EAAA,eACA2zD,EAAAG,EAAA9zD,EAAA,sCACAu6D,EAAAzG,EAAA9zD,EAAA,0CACA4kC,EAAAkvB,EAAA9zD,EAAA,sBAkCA0D,EAAA8vD,EAAA,MAAA,CACAu/B,iBAAAkH,EACAjH,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAqC,IAAAU,IAEA6uF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAAA,EAAAgL,aAAA,GAAA/N,GAAAwU,EAAA+9C,YACAvyD,EAAAqC,IAAAU,GAEA,IAAAm2C,EAAA73C,QAAArB,EAAAiR,WAAA,GAAA5O,IAAAU,EAAAkO,WAAA,IAGA4gF,qBAAA,SAAA7xF,EAAA+C,GACA,GAAA,IAAAA,EAAAX,EAOA,OAAApC,EAAAqC,IAAAU,GANA,GAAAyR,EAAA+9C,YACA,MAAA,IAAAjzD,MAAA,sEAEA,OAAAs5F,EAAA54F,EAAAyF,UAAA1C,EAAA0C,YAMAozF,gBAAAC,EACAC,mBAAA,SAAA/4F,EAAA+C,GACA,OAAA+1F,EAAA94F,EAAA+C,EAAAkO,aAEA+nF,iBAAAC,EACAC,oBAAA,SAAAl5F,EAAA+C,GACA,OAAAk2F,EAAAj5F,EAAA+C,EAAAkO,aAEAkoF,2BAAA,SAAAn5F,EAAA+C,GACA,OAAA/C,EAAAqC,IAAAU,MAWA,SAAA61F,EAAA54F,EAAA+C,GAGA,GAAAyR,EAAA+9C,cAAAxkD,EAAAhL,IAAA/C,EAAA,EAEA,IACA,IAAAo5F,EAAAlgC,EAAAn2D,GACAs2F,EAAA91D,EAAA61D,GAEA,IAAAr2F,IAAAs2F,GAAAp5F,KAAAQ,KAAAsC,EAAAs2F,GAAAt2F,GAAA,QACAq2F,EAAAh3F,EAAA,GAAA,EACA,OAAAg3F,EAAAt6F,EAAA,GAAA,EAAA,GAAA,GAAAmB,KAAAoC,KAAArC,EAAA+C,GAGA,MAAAu2F,IAOA,OAAAt5F,EAAAA,EAAA,GAAA+C,IAAAW,EAAAA,GAAA,EAAA1D,EAAAA,GAAA+C,KAAA,EAAA,EACA,EAMAyR,EAAA+9C,cAAAvyD,GAAA,GAAA+C,IAAAW,EAAAA,IAAA,EAAA1D,GAAAA,EAAA,GAAA+C,KAAA,EAAA,GACA8C,IAGAkI,EAAAhL,IAAA,GAAA/C,GAAAwU,EAAA+9C,YACAtyD,KAAAoC,IAAArC,EAAA+C,GAEA,IAAAm2C,EAAA73C,QAAArB,EAAA,GAAAqC,IAAAU,EAAA,GAYA,SAAA+1F,EAAA94F,EAAA+C,GACA,IAAAgL,EAAAhL,IAAAA,EAAA,EACA,MAAA,IAAAy4B,UAAA,mDAAAz4B,EAAA,KAIA,IAAAiH,EAAAkwB,EAAAl6B,GAEA,GAAA,IAAAgK,EAAArK,OACA,MAAA,IAAAL,MAAA,2CAAA0K,EAAArK,OAAA,gBAGA,GAAAqK,EAAA,KAAAA,EAAA,GACA,MAAA,IAAA1K,MAAA,sCAAA0K,EAAA,GAAA,IAAAA,EAAA,GAAA,KAMA,IAHA,IAAA7F,EAAA8nC,EAAAjiC,EAAA,IAAAvE,UACAoI,EAAA7N,EAEA,GAAA+C,GACA,IAAA,EAAAA,KACAoB,EAAA6+C,EAAAn1C,EAAA1J,IAGApB,IAAA,EACA8K,EAAAm1C,EAAAn1C,EAAAA,GAGA,OAAA1J,EAWA,SAAA80F,EAAAj5F,EAAA+C,GACA,OAAAuvD,EAAAwmC,EAAA94F,EAAAyF,UAAA1C,IAMA,OAHAV,EAAA4hE,MAAA,CACAwtB,EAAA,4BAAAhuC,OAAAkjB,EAAApC,UAAA,IAAA,iBAEAliE,2PCvLA,aAEA,IAAA0L,EAAApP,EAAA,sBAAAoP,UAEAuC,EAAA3R,EAAA,sBAAA2R,QAEAoyD,EAAA/jE,EAAA,kCAEA46F,EAAA,0DA4JA,SAAAC,EAAAvzF,EAAAwzF,GACA,OAAA73F,WAAA0O,EAAArK,EAAAwzF,IAGAh6F,EAAA2I,KAAA,QACA3I,EAAA8vD,QA/JA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA66E,EAAA/mB,EAAA9zD,EAAA,8BACA0hE,EAAA5N,EAAA9zD,EAAA,oBACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAiCAwG,EAAAgtD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAw5F,EAAAx5F,EAAA,IAEA0xF,iBAAA,SAAA1xF,EAAAlB,GACA,IAAAiP,EAAAjP,GACA,MAAA,IAAA08B,UAAA+9D,GAGA,GAAAz6F,EAAA,GAAA,GAAAA,EACA,MAAA,IAAAQ,MAAA,oEAGA,OAAAk6F,EAAAx5F,EAAAlB,IAEAuC,QAAA,SAAArB,GACA,OAAAA,EAAAmF,SAEAgzF,kBAAA,SAAAn4F,EAAAlB,GACA,GAAAA,EAAA,EACA,MAAA,IAAA08B,UAAA+9D,GAGA,OAAAv5F,EAAAmF,MAAArG,IAEA46F,qBAAA,SAAA15F,EAAAlB,GACA,IAAAA,EAAAiP,YACA,MAAA,IAAAytB,UAAA+9D,GAGA,IAAAI,EAAA76F,EAAAmS,WAEA,OAAAjR,EAAAmF,MAAAw0F,IAEAC,oBAAA,SAAA55F,EAAAlB,GACA,IAAAA,EAAAiP,YACA,MAAA,IAAAytB,UAAA+9D,GAGA,OAAA,IAAArgD,EAAA0d,UAAA52D,GAAAmQ,gBAAArR,EAAAmS,aAEA2lD,UAAA,SAAA52D,GACA,OAAAA,EAAAmQ,gBAAA,IAEAyhF,uBAAA,SAAA5xF,EAAAlB,GACA,IAAAA,EAAAiP,YACA,MAAA,IAAAytB,UAAA+9D,GAGA,OAAAv5F,EAAAmQ,gBAAArR,EAAAmS,aAEAyI,SAAA,SAAA1Z,GACA,OAAAA,EAAAmF,SAEA00F,mBAAA,SAAA75F,EAAAlB,GACA,GAAAA,EAAA,EACA,MAAA,IAAA08B,UAAA+9D,GAGA,OAAAv5F,EAAAmF,MAAArG,IAEA6jE,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAmF,GAAA,IAEAuuF,mCAAA,SAAA1zF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAoC,GAAA,IAEAwuF,kCAAA,SAAA3zF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAoC,GAAA,IAEA20F,6CAAA,SAAA95F,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GAEAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA/B,EAAAvwF,EAAA/C,EAAAmF,GAAA,IAEA40F,4CAAA,SAAA/5F,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GAEAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA5E,EAAA1tF,EAAA/C,EAAAmF,GAAA,IAEA2uF,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAoC,GAAA,GAAAM,WAEAu0F,sCAAA,SAAAh6F,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAmF,GAAA,GAAAM,aAQA,OALAN,EAAA8+D,MAAA,CACArkE,EAAA,yCACA6xF,OAAAvwF,GAGAiE,sTCxJA,aAEA,IAAAo+B,EAAA5kC,EAAA,sBAEA+jE,EAAA/jE,EAAA,kCA0DAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAzDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA+BA,IAAApwD,EAAAowD,EAAA,OAAA,CACA5uB,OAAAA,EAAAxhC,KACAV,QAAA,SAAArB,GACA,OAAAA,EAAA+B,QAEA60D,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA52D,EAAAmK,IAAA,KAEAuP,SAAA,SAAA1Z,GACA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,EAAAgK,EAAA,IAEA24D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAA+B,GAAA,IAEAmsE,KAAA,SAAAluE,GACA,OAAA+B,EAAA/B,EAAAiG,UAMA,OAHAlE,EAAAkiE,MAAA,CACArkE,EAAA,8CAEAmC,0FC3DA,aAEA,IAAA2gE,EAAA/jE,EAAA,kCAwEAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAvEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,IAAA3vD,EAAA2vD,EAAA,OAAA,CACA5uB,OAAA02D,EACA54F,QAAA,SAAArB,GACA,OAAAA,EAAAwC,QAEAo0D,UAAA,SAAA52D,GACA,OAAAA,EAAAiO,cAAAuG,EAAA+9C,YACAvyD,EAAAwC,OAGAy3F,EAAAj6F,EAAAiR,aAGA0xD,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAwC,GAAA,IAEA0rE,KAAA,SAAAluE,GAEA,OAAAA,EAAAqC,IAAA,OAUA,SAAA43F,EAAAj6F,GACA,OAAA2B,MAAA3B,GACA6F,IACA,GAAA7F,GAAAwU,EAAA+9C,YACAtyD,KAAAuC,KAAAxC,GAEA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAAwC,OAOA,OAHAA,EAAAyhE,MAAA,CACArkE,EAAA,sBAEA4C,iECvEA,aAEA,IAAAkgE,EAAA/jE,EAAA,kCAwDAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QAvDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA2BA,IAAA+L,EAAA/L,EAAA,SAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,EAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAkC,IAAAlC,IAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAAgL,MAAAhL,IAEA0Z,SAAA,SAAA1Z,GACA,OAAAA,EAAAkC,IAAAlC,IAEA2iE,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAk+D,GAAA,IAEAgQ,KAAA,SAAAluE,GACA,OAAAA,EAAAqC,IAAA,MAMA,OAHA67D,EAAA+F,MAAA,CACArkE,EAAA,+BAEAs+D,iECvDA,aAEA,IAAAlH,EAAAr4D,EAAA,8BA8IA,SAAAu7F,EAAAl6F,EAAA+C,GACA,IAAA8xF,EAAA70F,EAAAk6B,OACA46D,EAAA/xF,EAAAm3B,OAEA,GAAA26D,EAAAl1F,SAAAm1F,EAAAn1F,OACA,MAAA,IAAAq3D,EAAA69B,EAAAl1F,OAAAm1F,EAAAn1F,QAIAF,EAAA2I,KAAA,WACA3I,EAAA8vD,QAtJA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA06E,EAAA5mB,EAAA9zD,EAAA,gBACAw/D,EAAA1L,EAAA9zD,EAAA,iBACA0xF,EAAA59B,EAAA9zD,EAAA,wCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA+1F,EAAAjiC,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAoCAqT,EAAAmgD,EAAA,WAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,EAAA+C,GAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAiC,IAAAc,IAEA6uF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAA0B,MAAAqB,IAEA8uF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAiC,IAAAc,IAEA+uF,aAAA,SAAA9xF,EAAA+C,GACA,GAAA,OAAA/C,EAAAiG,MACA,MAAA,IAAA3G,MAAA,oDAGA,GAAA,OAAAyD,EAAAkD,MACA,MAAA,IAAA3G,MAAA,oDAGA,IAAAU,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,sBAGA,IAAA6E,EAAAnE,EAAAqF,QAGA,OAFAlB,EAAA8B,MAAA+L,EAAA7N,EAAA8B,MAAAlD,EAAAkD,OACA9B,EAAA6tF,WAAA,EACA7tF,GAEA0sF,6BAAA,SAAA7wF,EAAA+C,GAEA,OADAm3F,EAAAl6F,EAAA+C,GACA2xF,EAAA10F,EAAA+C,EAAAiP,IAEA4+E,4BAAA,SAAA5wF,EAAA+C,GAEA,OADAm3F,EAAAl6F,EAAA+C,GACAqwF,EAAArwF,EAAA/C,EAAAgS,GAAA,IAEA2+E,4BAAA,SAAA3wF,EAAA+C,GAEA,OADAm3F,EAAAl6F,EAAA+C,GACAstF,EAAArwF,EAAA+C,EAAAiP,GAAA,IAEA0+E,2BAAA,SAAA1wF,EAAA+C,GAEA,OADAm3F,EAAAl6F,EAAA+C,GACAytF,EAAAxwF,EAAA+C,EAAAiP,IAEA8+E,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAiP,EAAAsgD,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAiP,EAAAsgD,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAiP,EAAAhS,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAwtF,EAAAvwF,EAAAm+D,EAAAp7D,GAAAs2E,IAEA4X,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAiP,IAEAo/E,oBAAA,SAAApxF,EAAA+C,GACA,OAAAwtF,EAAAxtF,EAAA/C,EAAAgS,GAAA,IAEAm/E,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAgS,GAAA,IAEAq/E,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAiP,GAAA,GAAAvM,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAgS,GAAA,GAAAvM,aAMA,OAHAuM,EAAAiyD,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,SAAA,uBAEAvyD,6ZCtIA,aAEA,IAAA0wD,EAAA/jE,EAAA,kCA2DAc,EAAA2I,KAAA,aACA3I,EAAA8vD,QA1DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBA0BAw/D,EAAAhM,EAAA,aAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAA+E,OAEA6xD,UAAA,SAAA52D,GACA,OAAAA,EAAA+E,OAEA2U,SAAA,SAAA1Z,GACA,OAAAA,EAAA+E,OAEAmpE,KAAA,SAAAluE,GACA,IAAAmE,EAAAnE,EAAAqF,QAEA,OADAlB,EAAA8B,MAAAk4D,EAAAn+D,EAAAiG,OACA9B,GAEAw+D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAm+D,GAAA,MAOA,OAHAA,EAAA8F,MAAA,CACArkE,EAAA,GAAA6jD,OAAAkjB,EAAApC,UAAA,WAAA,8BAEApG,yFC1DA,aAEA,IAAAuE,EAAA/jE,EAAA,kCA6DAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QA5DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBA2BAy/D,EAAAjM,EAAA,YAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,GAEA0Z,SAAA,SAAA1Z,GACA,OAAAA,GAEAkuE,KAAA,SAAAluE,GACA,OAAAA,EAAAqF,SAEAs9D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAo+D,GAAA,IAEA+7B,mBAAA,SAAAn6F,GAEA,MAAA,cAAAwU,EAAA+uB,OAAA,IAAA2V,EAAA0d,WAAA52D,IAAAA,KAMA,OAHAo+D,EAAA6F,MAAA,CACArkE,EAAA,GAAA6jD,OAAAkjB,EAAApC,UAAA,UAAA,8BAEAnG,yFC5DA,aAEA,IAAArwD,EAAApP,EAAA,sBAAAoP,UAyIAtO,EAAA2I,KAAA,OACA3I,EAAA8vD,QAxIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAyBA0/D,EAAAlM,EAAA,OAAA,CACAu/B,iBAeA,SAAAryF,EAAAkB,GAEA,IAAAxB,EAEAuQ,EAEA1Q,EAwBAuF,EAtBAnE,EAAA,EACAo6F,EAAA,EACAr3F,EAAA,EACAs3F,EAAA,EAEA,IAAAtsF,EAAA1O,KAAA0O,EAAAxN,GACA,MAAA,IAAAjB,MAAA,uDAGA,KAAAiB,GACA+O,EAAArP,KAAAiF,MAAA7F,EAAAkB,GACA3B,EAAAS,EAAAiQ,EAAA/O,EAEAP,EAAAo6F,EAAA9qF,GADAvQ,EAAAiB,GAEAo6F,EAAAr7F,EAEAgE,EAAAs3F,EAAA/qF,GADAvQ,EAAAgE,GAEAs3F,EAAAt7F,EACAM,EAAAkB,EACAA,EAAA3B,EAWA,OALAuF,EADA9E,EAAA,EACA,EAAAA,GAAA+6F,GAAAC,GAEA,CAAAh7F,EAAAA,EAAA+6F,EAAA,EAAAC,GAGA,UAAA7lF,EAAA89C,OAAAnuD,EAAAmuD,EAAAnuD,IApDAytF,uBA+DA,SAAAvyF,EAAAkB,GAEA,IACAxB,EAEAuQ,EAEA1Q,EAyBAuF,EAxBAsvF,EAAA,IAAAv6C,EAAA0d,UAAA,GACArqD,EAAA,IAAA2sC,EAAA0d,UAAA,GACA52D,EAAAyzF,EACA2G,EAAA7tF,EACAxJ,EAAAwJ,EACA8tF,EAAA5G,EAEA,IAAAp0F,EAAA2O,UAAAzN,EAAAyN,QACA,MAAA,IAAA1O,MAAA,uDAGA,MAAAiB,EAAAmF,UACA4J,EAAAjQ,EAAA8C,IAAA5B,GAAA2E,QACAtG,EAAAS,EAAAgQ,IAAA9O,GACAxB,EAAAiB,EACAA,EAAAo6F,EAAA14F,MAAA4N,EAAAtE,MAAAhL,IACAo6F,EAAAr7F,EACAA,EAAAgE,EACAA,EAAAs3F,EAAA34F,MAAA4N,EAAAtE,MAAAjI,IACAs3F,EAAAt7F,EACAM,EAAAkB,EACAA,EAAA3B,EAWA,OALAuF,EADA9E,EAAAgP,GAAAolF,GACA,CAAAp0F,EAAA0F,MAAAq1F,EAAAr1F,MAAAs1F,EAAAt1F,OAEA,CAAA1F,EAAAA,EAAAqG,SAAA,EAAA00F,EAAAC,GAGA,UAAA7lF,EAAA89C,OAAAnuD,EAAAmuD,EAAAnuD,MAlGA,OAFAk6D,EAAA4F,WAAA/iE,EAEAm9D,6FCrCA,aAEA,IAAAtwD,EAAApP,EAAA,sBAAAoP,UAEAusF,EAAA37F,EAAA,gCA8FAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QA7FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy1F,EAAA3hC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAwBA2/D,EAAAnM,EAAA,SAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,IAAAgL,EAAA/N,KAAA+N,EAAAhL,GACA,MAAA,IAAAzD,MAAA,wCAGA,OAAAU,EAAA+C,GAEA6uF,uBAAA0I,EACAzJ,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAqxF,EAAAp0F,EAAA+C,EAAAu7D,GAAA,IAEAsyB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAAs+D,GAAA,IAEAqyB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAowF,EAAAnzF,EAAA+C,EAAAu7D,GAAA,IAEAoyB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAu7D,IAEAwyB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAu7D,EAAAhM,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAu7D,EAAAhM,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAu7D,EAAAt+D,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAu7D,GAAA,IAEA2yB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAu7D,GAAA,IAEA8yB,oBAAA,SAAApxF,EAAA+C,GACA,OAAA6vF,EAAA7vF,EAAA/C,EAAAs+D,GAAA,IAEA6yB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAs+D,GAAA,IAEA+yB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAu7D,GAAA,GAAA74D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAs+D,GAAA,GAAA74D,aAMA,OAHA64D,EAAA2F,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,OAAA,uBAEAjG,0WC/FA,aAEA,IAAAoE,EAAA/jE,EAAA,kCAEA47F,EAAA57F,EAAA,gCAEAoP,EAAApP,EAAA,sBAAAoP,UA+CAtO,EAAA2I,KAAA,SACA3I,EAAA8vD,QA9CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAyBA4/D,EAAApM,EAAA,SAAA,CACA5uB,OAAA,SAAAvjC,GACA,IAAA+N,EAAA/N,GACA,MAAA,IAAAV,MAAA,uCAGA,OAAAU,GAEA42D,UAAA2jC,EACA53B,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAu+D,MAMA,OAHAA,EAAA0F,MAAA,CACArkE,EAAA+mE,EAAApC,UAAA,OAAA,6BAEAhG,qJClDA,aAEA,IAAAxwD,EAAApP,EAAA,sBAAAoP,UAEAysF,EAAA77F,EAAA,+BA+FAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA9FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA0xF,EAAA59B,EAAA9zD,EAAA,wCACA2xF,EAAA79B,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAyBA6/D,EAAArM,EAAA,QAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,IAAAgL,EAAA/N,KAAA+N,EAAAhL,GACA,MAAA,IAAAzD,MAAA,uCAGA,OAAAU,EAAA+C,GAEA6uF,uBAAA4I,EACA3J,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAutF,EAAAtwF,EAAA+C,EAAAy7D,IAEAoyB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAstF,EAAAttF,EAAA/C,EAAAw+D,GAAA,IAEAmyB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAstF,EAAArwF,EAAA+C,EAAAy7D,GAAA,IAEAkyB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAy7D,IAEAsyB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAy7D,EAAAlM,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAy7D,EAAAlM,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAy7D,EAAAx+D,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAwtF,EAAAvwF,EAAA+C,EAAAy7D,GAAA,IAEAyyB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAy7D,GAAA,IAEA4yB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAwtF,EAAAxtF,EAAA/C,EAAAw+D,GAAA,IAEA2yB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAw+D,GAAA,IAEA6yB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAy7D,GAAA,GAAA/4D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAw+D,GAAA,GAAA/4D,aAMA,OAHA+4D,EAAAyF,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,MAAA,uBAEA/F,yWChGA,aAEA,IAAAzwD,EAAApP,EAAA,sBAAAoP,UAEA0sF,EAAA97F,EAAA,gCA8FAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QA7FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAwBA8/D,EAAAtM,EAAA,SAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,IAAAgL,EAAA/N,KAAA+N,EAAAhL,GACA,MAAA,IAAAzD,MAAA,wCAGA,OAAAU,EAAA+C,GAEA6uF,uBAAA6I,EACA5J,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAA07D,IAEAmyB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAy+D,GAAA,IAEAkyB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAA07D,GAAA,IAEAiyB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAA07D,IAEAqyB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA07D,EAAAnM,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA07D,EAAAnM,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA07D,EAAAz+D,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAA07D,GAAA,IAEAwyB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAA07D,GAAA,IAEA2yB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAy+D,GAAA,IAEA0yB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAy+D,GAAA,IAEA4yB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAA07D,GAAA,GAAAh5D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAy+D,GAAA,GAAAh5D,aAMA,OAHAg5D,EAAAwF,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,OAAA,uBAEA9F,0WC/FA,aAEA5+D,EAAAJ,QAAA,CAAAd,EAAA,YAAAA,EAAA,YAAAA,EAAA,WAAAA,EAAA,YAAAA,EAAA,eAAAA,EAAA,qBAAAA,EAAA,wKCFA,aAEA,IAAAoP,EAAApP,EAAA,sBAAAoP,UAEA2sF,EAAA/7F,EAAA,mCAuHAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QAtHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA66E,EAAA/mB,EAAA9zD,EAAA,8BACA0hE,EAAA5N,EAAA9zD,EAAA,oBACA0xF,EAAA59B,EAAA9zD,EAAA,wCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAg8F,EAAAloC,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAyBA+/D,EAAAvM,EAAA,YAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,IAAAgL,EAAA/N,KAAA+N,EAAAhL,GACA,MAAA,IAAAzD,MAAA,2CAGA,OAAAU,GAAA+C,GAEA6uF,uBAAA8I,EACA7J,6BAAA,SAAA7wF,EAAA+C,GACA,OAAA43F,EAAA36F,EAAA+C,EAAA27D,GAAA,IAEAkyB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAA0+D,GAAA,IAEAiyB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAstF,EAAArwF,EAAA+C,EAAA27D,GAAA,IAEAgyB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAA27D,IAEAoyB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA27D,EAAApM,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA27D,EAAApM,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA27D,EAAA1+D,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GAEA,OAAAy2E,EAAAz2E,EAAA,GACA/C,EAAAqF,QAGAutF,EAAA5yF,EAAA+C,EAAA27D,GAAA,IAEAi1B,kCAAA,SAAA3zF,EAAA+C,GAEA,OAAAy2E,EAAAz2E,EAAA,GACA/C,EAAAqF,QAGAorF,EAAAzwF,EAAA+C,EAAA27D,GAAA,IAEAk1B,mCAAA,SAAA5zF,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GACAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA9E,EAAAxtF,EAAA/C,EAAA0+D,GAAA,IAEAm1B,kCAAA,SAAA7zF,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GACAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA5E,EAAA1tF,EAAA/C,EAAA0+D,GAAA,IAEAo1B,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAA27D,EAAApM,EAAAtyD,GAAA+C,GAAA0C,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GAEA,OAAA27D,EAAA1+D,EAAAsyD,EAAAvvD,IAAA0C,aAMA,OAHAi5D,EAAAuF,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,UAAA,uBAEA7F,ufCxHA,aAEA,IAAA3wD,EAAApP,EAAA,sBAAAoP,UAEA6sF,EAAAj8F,EAAA,yCAuHAc,EAAA2I,KAAA,kBACA3I,EAAA8vD,QAtHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA66E,EAAA/mB,EAAA9zD,EAAA,8BACA0hE,EAAA5N,EAAA9zD,EAAA,oBACA0xF,EAAA59B,EAAA9zD,EAAA,wCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAg8F,EAAAloC,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAyBAggE,EAAAxM,EAAA,kBAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,IAAAgL,EAAA/N,KAAA+N,EAAAhL,GACA,MAAA,IAAAzD,MAAA,iDAGA,OAAAU,GAAA+C,GAEA6uF,uBAAAgJ,EACA/J,6BAAA,SAAA7wF,EAAA+C,GACA,OAAA43F,EAAA36F,EAAA+C,EAAA47D,GAAA,IAEAiyB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAA2+D,GAAA,IAEAgyB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAstF,EAAArwF,EAAA+C,EAAA47D,GAAA,IAEA+xB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAA47D,IAEAmyB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA47D,EAAArM,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA47D,EAAArM,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA47D,EAAA3+D,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GAEA,OAAAy2E,EAAAz2E,EAAA,GACA/C,EAAAqF,QAGAutF,EAAA5yF,EAAA+C,EAAA47D,GAAA,IAEAg1B,kCAAA,SAAA3zF,EAAA+C,GAEA,OAAAy2E,EAAAz2E,EAAA,GACA/C,EAAAqF,QAGAorF,EAAAzwF,EAAA+C,EAAA47D,GAAA,IAEAi1B,mCAAA,SAAA5zF,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GACAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA9E,EAAAxtF,EAAA/C,EAAA2+D,GAAA,IAEAk1B,kCAAA,SAAA7zF,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GACAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA5E,EAAA1tF,EAAA/C,EAAA2+D,GAAA,IAEAm1B,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAA47D,EAAArM,EAAAtyD,GAAA+C,GAAA0C,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GAEA,OAAA47D,EAAA3+D,EAAAsyD,EAAAvvD,IAAA0C,aAMA,OAHAk5D,EAAAsF,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,gBAAA,uBAEA5F,6fCxHA,aAEA,IAAA5wD,EAAApP,EAAA,sBAAAoP,UAuHAtO,EAAA2I,KAAA,gBACA3I,EAAA8vD,QAtHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA66E,EAAA/mB,EAAA9zD,EAAA,8BACA0hE,EAAA5N,EAAA9zD,EAAA,oBACA0xF,EAAA59B,EAAA9zD,EAAA,wCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAg8F,EAAAloC,EAAA9zD,EAAA,wCACA4xF,EAAA99B,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAyBAigE,EAAAzM,EAAA,gBAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,IAAAgL,EAAA/N,KAAA+N,EAAAhL,GACA,MAAA,IAAAzD,MAAA,+CAGA,OAAAU,IAAA+C,GAGA8tF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAA43F,EAAA36F,EAAA+C,EAAA67D,GAAA,IAEAgyB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAA4+D,GAAA,IAEA+xB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAstF,EAAArwF,EAAA+C,EAAA67D,GAAA,IAEA8xB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAA67D,IAEAkyB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA67D,EAAAtM,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA67D,EAAAtM,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA67D,EAAA5+D,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GAEA,OAAAy2E,EAAAz2E,EAAA,GACA/C,EAAAqF,QAGAutF,EAAA5yF,EAAA+C,EAAA67D,GAAA,IAEA+0B,kCAAA,SAAA3zF,EAAA+C,GAEA,OAAAy2E,EAAAz2E,EAAA,GACA/C,EAAAqF,QAGAorF,EAAAzwF,EAAA+C,EAAA67D,GAAA,IAEAg1B,mCAAA,SAAA5zF,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GACAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA9E,EAAAxtF,EAAA/C,EAAA4+D,GAAA,IAEAi1B,kCAAA,SAAA7zF,EAAA+C,GAEA,OAAAy2E,EAAAx5E,EAAA,GACAqgE,EAAAt9D,EAAAm3B,OAAAn3B,EAAAsyF,WAGA5E,EAAA1tF,EAAA/C,EAAA4+D,GAAA,IAEAk1B,4BAAA,SAAA9zF,EAAA+C,GAEA,OAAA67D,EAAAtM,EAAAtyD,GAAA+C,GAAA0C,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GAEA,OAAA67D,EAAA5+D,EAAAsyD,EAAAvvD,IAAA0C,aAMA,OAHAm5D,EAAAqF,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,cAAA,uBAEA3F,idCtHA,aAmDAn/D,EAAA2I,KAAA,cACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAqgE,EAAAvM,EAAA9zD,EAAA,iBACAsP,EAAAwkD,EAAA9zD,EAAA,wBACAoP,EAAA0kD,EAAA9zD,EAAA,uBAuBAkgE,EAAA1M,EAAA,cAAA,CACA0oC,qBAAA,SAAA/7F,GACA,IAAAiP,EAAAjP,IAAAmP,EAAAnP,GACA,MAAA,IAAA08B,UAAA,+DAMA,IAFA,IAAA3iB,EAAA,EAEA5Z,EAAA,EAAAA,GAAAH,EAAAG,IACA4Z,EAAA7W,EAAA6W,EAAAmmD,EAAAlgE,EAAAG,IAGA,OAAA4Z,KAMA,OAHAgmD,EAAAoF,MAAA,CACArkE,EAAA,4BAEAi/D,0HChDA,aA8CAp/D,EAAA2I,KAAA,UACA3I,EAAA8vD,QA7CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAgN,EAAA8mD,EAAA9zD,EAAA,yBACAqkD,EAAAyP,EAAA9zD,EAAA,2BACA2hE,EAAA7N,EAAA9zD,EAAA,gCACAsP,EAAAwkD,EAAA9zD,EAAA,wBACAoP,EAAA0kD,EAAA9zD,EAAA,uBAuBAmgE,EAAA3M,EAAA,UAAA,CACA0oC,qBAAA,SAAA/7F,GACA,IAAAiP,EAAAjP,IAAAmP,EAAAnP,GACA,MAAA,IAAA08B,UAAA,2DAGA,OAAA7vB,EAAA20D,EAAAtd,EAAAlkD,EAAA,GAAAA,GAAAkD,EAAAlD,EAAA,OAMA,OAHAggE,EAAAmF,MAAA,CACArkE,EAAA,4BAEAk/D,iMC3CA,aA+CAr/D,EAAA2I,KAAA,cACA3I,EAAA8vD,QA9CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAmO,EAAA7N,EAAA9zD,EAAA,gCACAqD,EAAAywD,EAAA9zD,EAAA,4BACAuP,EAAAukD,EAAA9zD,EAAA,wBACAoP,EAAA0kD,EAAA9zD,EAAA,uBACAuiE,EAAAzO,EAAA9zD,EAAA,yBAwBAogE,EAAA5M,EAAA,cAAA,CACA2oC,yCAAA,SAAAh8F,EAAAwJ,GACA,KAAAyF,EAAAjP,IAAAoP,EAAApP,IAAAiP,EAAAzF,IAAA4F,EAAA5F,IACA,MAAA,IAAAkzB,UAAA,2DACA,GAAA0lC,EAAA54D,EAAAxJ,GACA,MAAA,IAAA08B,UAAA,6DAGA,OAAA8kC,EAAAt+D,EAAAlD,GAAA,GAAAkD,EAAAsG,GAAA,OAKA,OAFAy2D,EAAAkF,WAAA/iE,EAEA69D,0KC5CA,aAEAl/D,EAAAJ,QAAA,CAAAd,EAAA,iBAAAA,EAAA,iBAAAA,EAAA,gBAAAA,EAAA,kHCFA,aAkEAc,EAAA2I,KAAA,aACA3I,EAAA8vD,QAjEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAqT,EAAAygD,EAAA9zD,EAAA,2BACAqkD,EAAAyP,EAAA9zD,EAAA,2BACAgN,EAAA8mD,EAAA9zD,EAAA,yBACA0D,EAAAowD,EAAA9zD,EAAA,sBACA4hE,EAAA9N,EAAA9zD,EAAA,6BACA2hE,EAAA7N,EAAA9zD,EAAA,gCACAsP,EAAAwkD,EAAA9zD,EAAA,wBACAoP,EAAA0kD,EAAA9zD,EAAA,uBACAuiE,EAAAzO,EAAA9zD,EAAA,yBA0BAqgE,EAAA7M,EAAA,aAAA,CACA2oC,yCAAA,SAAAh8F,EAAAwJ,GACA,IAAAyF,EAAAjP,IAAAmP,EAAAnP,KAAAiP,EAAAzF,IAAA2F,EAAA3F,GACA,MAAA,IAAAkzB,UAAA,8DACA,GAAA0lC,EAAA54D,EAAAxJ,GACA,MAAA,IAAA08B,UAAA,4DAOA,IAHA,IAAAu/D,EAAAx6B,EAAAj4D,GACAuQ,EAAA,EAEA5Z,EAAA,EAAAA,GAAAqJ,EAAArJ,IAAA,CACA,IAAA+7F,EAAA34F,GAAA,EAAA2P,EAAA1J,EAAArJ,IACAg8F,EAAA36B,EAAAh4D,EAAArJ,GACAi8F,EAAA74F,EAAApD,EAAAH,GACA+Z,EAAA7W,EAAA6W,EAAAmqC,EAAAA,EAAAi4C,EAAAC,GAAAF,IAGA,OAAArvF,EAAAkN,EAAAkiF,MAMA,OAHA/7B,EAAAiF,MAAA,CACAwtB,EAAA,qCAEAzyB,gTC/DA,aAEA,IAAA0D,EAAA/jE,EAAA,kCAmDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA4BA,IAAA7vD,EAAA6vD,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAC,KAAAY,MAAA,EAAAb,IAEA42D,UAAA,SAAA52D,GACA,OAAAk5C,EAAA0d,UAAA/1D,MAAA,EAAAb,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAsC,OAGAqgE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAsC,MAMA,OAHAA,EAAA2hE,MAAA,CACArkE,EAAA,kCAEA0C,iEClDA,aAEA,IAAAogE,EAAA/jE,EAAA,kCAgDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QA/CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAA8M,EAAA9M,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAA8E,aAEA69D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAi/D,MAMA,OAHAA,EAAAgF,MAAA,CACArkE,EAAA,+BAEAq/D,iEC/CA,aAEA,IAAAyD,EAAA/jE,EAAA,kCAkDAc,EAAA2I,KAAA,KACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA4BA,IAAAlxD,EAAAkxD,EAAA,KAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,IAEAv1D,QAAA,SAAArB,GACA,OAAAA,EAAAiB,IAEA0hE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAiB,MAMA,OAHAA,EAAAgjE,MAAA,CACArkE,EAAA,+CAEAqB,iECjDA,aAEApB,EAAAJ,QAAA,CAAAd,EAAA,SAAAA,EAAA,UAAAA,EAAA,QAAAA,EAAA,iFCFA,aAEA,IAAA+jE,EAAA/jE,EAAA,kCAkDAc,EAAA2I,KAAA,KACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA4BA,IAAAnxD,EAAAmxD,EAAA,KAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAgB,IAEA2hE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAgB,MAMA,OAHAA,EAAAijE,MAAA,CACArkE,EAAA,+CAEAoB,iECjDA,aA8VAvB,EAAA2I,KAAA,WACA3I,EAAA8vD,QA7VA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,4BACAqT,EAAAygD,EAAA9zD,EAAA,2BACAqkD,EAAAyP,EAAA9zD,EAAA,iCACAgN,EAAA8mD,EAAA9zD,EAAA,+BACAqgD,EAAAyT,EAAA9zD,EAAA,6BACA6D,EAAAiwD,EAAA9zD,EAAA,uBACA8B,EAAAgyD,EAAA9zD,EAAA,sBAmOA,SAAAw8F,EAAA97F,GAEA,MAAA,iBAAAA,GAAA65C,EAAA6b,YAAA11D,GAGA,SAAA+7F,EAAA/7F,GAMA,OAJAA,EAAA0K,cAAAiV,QACA3f,EAAAg8F,EAAAh8F,IAGA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,IAGA,SAAAi8F,EAAAj8F,GAMA,OAJAA,EAAA0K,cAAAiV,QACA3f,EAAAg8F,EAAAh8F,IAGA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,IAGA,SAAAk8F,EAAAl8F,GAKA,OAJAA,EAAA0K,cAAAiV,QACA3f,EAAAg8F,EAAAh8F,IAGA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,KAAA87F,EAAA97F,EAAA,IAGA,SAAAg8F,EAAAr8F,GAIA,IAHA,IAAAga,EAAAjT,OAAAiT,KAAAha,GACAK,EAAA,GAEAJ,EAAA,EAAAA,EAAA+Z,EAAArZ,OAAAV,IACAI,EAAA4P,KAAAjQ,EAAAga,EAAA/Z,KAGA,OAAAI,EAwBA,SAAAm8F,EAAAx7F,EAAA+C,EAAA1D,EAAAkB,EAAApB,GACA,IAAAyP,EAAAnO,EAAAuB,EAAAA,EAAAghD,EAAA3jD,EAAAW,GAAAgjD,EAAAziD,EAAAwC,IAAA5D,IACAs8F,EAAAj5F,EAAAR,EAAAghD,EAAA3jD,EAAAA,GAAA2jD,EAAAziD,EAAAA,KAEA,OADAoL,EAAAiD,EAAA6sF,GAIA,SAAAC,EAAA17F,EAAA+C,EAAAhC,EAAA46F,EAAAC,EAAAC,EAAAx8F,EAAAkB,EAAApB,GACA,IAAAyP,EAAA,CAAAoD,EAAAgxC,EAAAhxC,EAAA4pF,EAAA74F,GAAA5D,GAAA6jD,EAAAhxC,EAAA6pF,EAAA96F,GAAAR,IAAAyR,EAAAgxC,EAAAhxC,EAAA6pF,EAAA96F,GAAA1B,GAAA2jD,EAAAhxC,EAAA2pF,EAAA37F,GAAAb,IAAA6S,EAAAgxC,EAAAhxC,EAAA2pF,EAAA37F,GAAAO,GAAAyiD,EAAAhxC,EAAA4pF,EAAA74F,GAAA1D,KACAuP,EAAApM,EAAAR,EAAAA,EAAAghD,EAAAp0C,EAAA,GAAAA,EAAA,IAAAo0C,EAAAp0C,EAAA,GAAAA,EAAA,KAAAo0C,EAAAp0C,EAAA,GAAAA,EAAA,MACA,IAAA6sF,EAAAj5F,EAAAR,EAAAA,EAAAghD,EAAA3jD,EAAAA,GAAA2jD,EAAAziD,EAAAA,IAAAyiD,EAAA7jD,EAAAA,KAEA,OADAwM,EAAAiD,EAAA6sF,GAIA,SAAAK,EAAA/nF,EAAAgoF,EAAAjuF,EAAAkuF,GACA,IAAAC,EAAAjqF,EAAAgqF,EAAAD,GACAG,EAAAlqF,EAAAlE,EAAAiG,GACAooF,EAAAn6F,EAAAghD,EAAAi5C,EAAAA,GAAAj5C,EAAAk5C,EAAAA,IAEA,OADA15F,EAAA25F,GAIA,SAAAC,EAAAroF,EAAAgoF,EAAAM,EAAAvuF,EAAAkuF,EAAAM,GACA,IAAAC,EAAAvqF,EAAAsqF,EAAAD,GACAJ,EAAAjqF,EAAAgqF,EAAAD,GACAG,EAAAlqF,EAAAlE,EAAAiG,GACAooF,EAAAn6F,EAAAA,EAAAghD,EAAAu5C,EAAAA,GAAAv5C,EAAAi5C,EAAAA,IAAAj5C,EAAAk5C,EAAAA,IAEA,OADA15F,EAAA25F,GAoBA,OA7RAhqC,EAAA,WAAA,CACAqqC,sBAAA,SAAAx8F,EAAA+C,EAAAhC,GAEA,GAAA,IAAAf,EAAAL,QAAA,IAAAoD,EAAApD,QAAA,IAAAoB,EAAApB,OAmBA,MAAA,IAAA67B,UAAA,gCAlBA,IAAA4/D,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,kEAGA,IAAA4/D,EAAAr4F,GACA,MAAA,IAAAy4B,UAAA,mEAGA,IAAA4/D,EAAAr6F,GACA,MAAA,IAAAy6B,UAAA,kEAGA,IAAAnwB,EAAAM,EAAAqG,EAAAjR,EAAA,GAAAA,EAAA,IAAAiR,EAAAjP,EAAA,GAAAA,EAAA,KACA05F,EAAAz5C,EAAAA,EAAA33C,EAAAA,GAAAtI,EAAA,IACA25F,EAAA19C,EAAAgE,EAAA33C,EAAAtI,EAAA,KACA6sC,EAAA5vC,EAAA,GACA,OAAAw7F,EAAAx7F,EAAA,GAAAA,EAAA,GAAAy8F,EAAAC,EAAA9sD,IAKA+sD,yBAAA,SAAA38F,EAAA+C,EAAAhC,GACA,GAAA,IAAAgF,OAAAiT,KAAAhZ,GAAAL,QAAA,IAAAoG,OAAAiT,KAAAjW,GAAApD,QAAA,IAAAoG,OAAAiT,KAAAjY,GAAApB,OAuBA,MAAA,IAAA67B,UAAA,gCAtBA,IAAA4/D,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,+DAGA,IAAA4/D,EAAAr4F,GACA,MAAA,IAAAy4B,UAAA,uEAGA,IAAA4/D,EAAAr6F,GACA,MAAA,IAAAy6B,UAAA,uEAGA,GAAAx7B,EAAAuW,eAAA,WAAAvW,EAAAuW,eAAA,WAAAxT,EAAAwT,eAAA,eAAAxT,EAAAwT,eAAA,eAAAxV,EAAAwV,eAAA,eAAAxV,EAAAwV,eAAA,cAAA,CACA,IAAAlL,EAAAM,EAAAqG,EAAAjR,EAAA67F,WAAA77F,EAAA87F,YAAA7qF,EAAAjP,EAAA+5F,WAAA/5F,EAAAg6F,aACAN,EAAAz5C,EAAAA,EAAA33C,EAAAA,GAAAtI,EAAAg6F,YACAL,EAAA19C,EAAAgE,EAAA33C,EAAAtI,EAAAg6F,aACAntD,EAAA5vC,EAAAg9F,OACA,OAAAxB,EAAAx7F,EAAAg9F,OAAAh9F,EAAAi9F,OAAAR,EAAAC,EAAA9sD,GAEA,MAAA,IAAApU,UAAA,2BAMAs1D,eAAA,SAAA9wF,EAAA+C,GAEA,GAAA,IAAA/C,EAAAL,QAAA,IAAAoD,EAAApD,OAAA,CACA,IAAAy7F,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,kEAGA,IAAA8/D,EAAAv4F,GACA,MAAA,IAAAy4B,UAAA,mEAGA,OAAAggE,EAAAx7F,EAAA,GAAAA,EAAA,GAAA+C,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,GAAA,IAAA/C,EAAAL,QAAA,IAAAoD,EAAApD,OAAA,CAEA,IAAA27F,EAAAt7F,GACA,MAAA,IAAAw7B,UAAA,kEAGA,IAAA+/D,EAAAx4F,GACA,MAAA,IAAAy4B,UAAA,mEAGA,OAAAkgE,EAAA17F,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAA+C,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA,GAAA,IAAA/C,EAAAL,QAAA,IAAAoD,EAAApD,OAAA,CAEA,IAAAy7F,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,kEAGA,IAAA4/D,EAAAr4F,GACA,MAAA,IAAAy4B,UAAA,mEAGA,OAAAsgE,EAAA97F,EAAA,GAAAA,EAAA,GAAA+C,EAAA,GAAAA,EAAA,IACA,GAAA,IAAA/C,EAAAL,QAAA,IAAAoD,EAAApD,OAYA,MAAA,IAAA67B,UAAA,gCAVA,IAAA8/D,EAAAt7F,GACA,MAAA,IAAAw7B,UAAA,kEAGA,IAAA8/D,EAAAv4F,GACA,MAAA,IAAAy4B,UAAA,mEAGA,OAAA4gE,EAAAp8F,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAA+C,EAAA,GAAAA,EAAA,GAAAA,EAAA,KAKAm6F,iBAAA,SAAAl9F,EAAA+C,GACA,GAAA,IAAAgD,OAAAiT,KAAAhZ,GAAAL,QAAA,IAAAoG,OAAAiT,KAAAjW,GAAApD,OAAA,CACA,IAAAy7F,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,+DAGA,IAAA8/D,EAAAv4F,GACA,MAAA,IAAAy4B,UAAA,iFAGA,GAAAx7B,EAAAuW,eAAA,WAAAvW,EAAAuW,eAAA,WAAAxT,EAAAwT,eAAA,eAAAxT,EAAAwT,eAAA,eAAAxT,EAAAwT,eAAA,YACA,OAAAilF,EAAAx7F,EAAAg9F,OAAAh9F,EAAAi9F,OAAAl6F,EAAAo6F,WAAAp6F,EAAAq6F,WAAAr6F,EAAA6sC,UAEA,MAAA,IAAApU,UAAA,0BAEA,GAAA,IAAAz1B,OAAAiT,KAAAhZ,GAAAL,QAAA,IAAAoG,OAAAiT,KAAAjW,GAAApD,OAAA,CAEA,IAAA27F,EAAAt7F,GACA,MAAA,IAAAw7B,UAAA,uEAGA,IAAA+/D,EAAAx4F,GACA,MAAA,IAAAy4B,UAAA,oEAGA,GAAAx7B,EAAAuW,eAAA,WAAAvW,EAAAuW,eAAA,WAAAxT,EAAAwT,eAAA,OAAAxT,EAAAwT,eAAA,OAAAxT,EAAAwT,eAAA,OAAAxT,EAAAwT,eAAA,MAAAxT,EAAAwT,eAAA,MAAAxT,EAAAwT,eAAA,KACA,OAAAmlF,EAAA17F,EAAAg9F,OAAAh9F,EAAAi9F,OAAAj9F,EAAAq9F,OAAAt6F,EAAA44F,GAAA54F,EAAA64F,GAAA74F,EAAA84F,GAAA94F,EAAA1D,EAAA0D,EAAAxC,EAAAwC,EAAA5D,GAEA,MAAA,IAAAq8B,UAAA,0BAEA,GAAA,IAAAz1B,OAAAiT,KAAAhZ,GAAAL,QAAA,IAAAoG,OAAAiT,KAAAjW,GAAApD,OAAA,CAEA,IAAAy7F,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,qEAGA,IAAA4/D,EAAAr4F,GACA,MAAA,IAAAy4B,UAAA,qEAGA,GAAAx7B,EAAAuW,eAAA,cAAAvW,EAAAuW,eAAA,cAAAxT,EAAAwT,eAAA,cAAAxT,EAAAwT,eAAA,aACA,OAAAulF,EAAA97F,EAAAs9F,UAAAt9F,EAAAu9F,UAAAx6F,EAAAy6F,UAAAz6F,EAAA06F,WAEA,MAAA,IAAAjiE,UAAA,0BAEA,GAAA,IAAAz1B,OAAAiT,KAAAhZ,GAAAL,QAAA,IAAAoG,OAAAiT,KAAAjW,GAAApD,OAgBA,MAAA,IAAA67B,UAAA,gCAdA,IAAA8/D,EAAAt7F,GACA,MAAA,IAAAw7B,UAAA,gFAGA,IAAA8/D,EAAAv4F,GACA,MAAA,IAAAy4B,UAAA,gFAGA,GAAAx7B,EAAAuW,eAAA,cAAAvW,EAAAuW,eAAA,cAAAvW,EAAAuW,eAAA,cAAAxT,EAAAwT,eAAA,cAAAxT,EAAAwT,eAAA,cAAAxT,EAAAwT,eAAA,aACA,OAAA6lF,EAAAp8F,EAAAs9F,UAAAt9F,EAAAu9F,UAAAv9F,EAAA09F,UAAA36F,EAAAy6F,UAAAz6F,EAAA06F,UAAA16F,EAAA46F,WAEA,MAAA,IAAAniE,UAAA,2BAMAxc,MAAA,SAAAvV,GACA,IAkDA,SAAApK,GAEA,GAAA,IAAAA,EAAA,GAAAM,QAAAw7F,EAAA97F,EAAA,GAAA,KAAA87F,EAAA97F,EAAA,GAAA,KACA,IAAA,IAAAJ,KAAAI,EACA,GAAA,IAAAA,EAAAJ,GAAAU,SAAAw7F,EAAA97F,EAAAJ,GAAA,MAAAk8F,EAAA97F,EAAAJ,GAAA,IACA,OAAA,MAGA,CAAA,KAAA,IAAAI,EAAA,GAAAM,QAAAw7F,EAAA97F,EAAA,GAAA,KAAA87F,EAAA97F,EAAA,GAAA,KAAA87F,EAAA97F,EAAA,GAAA,KAOA,OAAA,EANA,IAAA,IAAA+jF,KAAA/jF,EACA,GAAA,IAAAA,EAAA+jF,GAAAzjF,SAAAw7F,EAAA97F,EAAA+jF,GAAA,MAAA+X,EAAA97F,EAAA+jF,GAAA,MAAA+X,EAAA97F,EAAA+jF,GAAA,IACA,OAAA,EAOA,OAAA,EApEAwa,CAAAn0F,GACA,MAAA,IAAA+xB,UAAA,oEAGA,OAmGA,SAAAn8B,GAGA,IAFA,IAAAwZ,EAAA,GAEA5Z,EAAA,EAAAA,EAAAI,EAAAM,OAAA,EAAAV,IACA,IAAA,IAAAsK,EAAAtK,EAAA,EAAAsK,EAAAlK,EAAAM,OAAA4J,IACA,IAAAlK,EAAA,GAAAM,OACAkZ,EAAA5J,KAAA6sF,EAAAz8F,EAAAJ,GAAA,GAAAI,EAAAJ,GAAA,GAAAI,EAAAkK,GAAA,GAAAlK,EAAAkK,GAAA,KACA,IAAAlK,EAAA,GAAAM,QACAkZ,EAAA5J,KAAAmtF,EAAA/8F,EAAAJ,GAAA,GAAAI,EAAAJ,GAAA,GAAAI,EAAAJ,GAAA,GAAAI,EAAAkK,GAAA,GAAAlK,EAAAkK,GAAA,GAAAlK,EAAAkK,GAAA,KAKA,OAAAsP,EAhHAglF,CAAAp0F,+OCxOA,aAEA5J,EAAAJ,QAAA,CAAAd,EAAA,eAAAA,EAAA,2ECFA,aAqMAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QApMA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1xD,EAAAgyD,EAAA9zD,EAAA,sBACAqD,EAAAywD,EAAA9zD,EAAA,sBACA06E,EAAA5mB,EAAA9zD,EAAA,4BACA2zD,EAAAG,EAAA9zD,EAAA,sCACAqkD,EAAAyP,EAAA9zD,EAAA,2BACA46E,EAAA9mB,EAAA9zD,EAAA,iCACA26E,EAAA7mB,EAAA9zD,EAAA,+BACAqT,EAAAygD,EAAA9zD,EAAA,2BACAyiE,EAAA3O,EAAA9zD,EAAA,0BACA66E,EAAA/mB,EAAA9zD,EAAA,8BA6BAygE,EAAAjN,EAAA,YAAA,CACAqqC,sBAAA,SAAAx8F,EAAA+C,EAAA+6F,GACA,IAAAxC,EAAAt7F,GACA,MAAA,IAAAw7B,UAAA,kEAGA,IAAA8/D,EAAAv4F,GACA,MAAA,IAAAy4B,UAAA,mEAGA,IAqEA,SAAAx7B,GACA,OAAA,IAAAA,EAAAL,QAAAw7F,EAAAn7F,EAAA,KAAAm7F,EAAAn7F,EAAA,KAAAm7F,EAAAn7F,EAAA,KAAAm7F,EAAAn7F,EAAA,IAtEA+9F,CAAAD,GACA,MAAA,IAAAtiE,UAAA,mDAGA,OA2HA,SAAAznB,EAAAgoF,EAAAM,EAAAvuF,EAAAkuF,EAAAM,EAAAt8F,EAAA+C,EAAAhC,EAAA5B,GACA,IAAA6+F,EAAAzkB,EAAAxlE,EAAA/T,GACAi+F,EAAA1kB,EAAAzrE,EAAA9N,GACAk+F,EAAA3kB,EAAAwiB,EAAAh5F,GACAo7F,EAAA5kB,EAAAyiB,EAAAj5F,GACAq7F,EAAA7kB,EAAA8iB,EAAAt7F,GACAs9F,EAAA9kB,EAAA+iB,EAAAv7F,GACAhC,EAAAu6E,EAAAtnE,EAAAA,EAAAA,EAAA7S,EAAA6+F,GAAAE,GAAAE,GAAApsF,EAAAA,EAAAA,EAAAqnE,EAAAA,EAAA4kB,EAAAE,GAAAE,GAAAL,GAAAE,GAAAE,IACAvwF,EAAAwrE,EAAAtlE,EAAAwlE,EAAAx6E,EAAAiT,EAAAlE,EAAAiG,KACAuqF,EAAAjlB,EAAA0iB,EAAAxiB,EAAAx6E,EAAAiT,EAAAgqF,EAAAD,KACAwC,EAAAllB,EAAAgjB,EAAA9iB,EAAAx6E,EAAAiT,EAAAsqF,EAAAD,KACA,MAAA,CAAAxuF,EAAAywF,EAAAC,GAtIAC,CAAAx+F,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAA+C,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAA+6F,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,KAEAW,6BAAA,SAAA/1F,EAAA1I,EAAA+C,EAAAhC,GACA,GAAA,IAAA2H,EAAA/I,OAAA,CACA,IAAAy7F,EAAA1yF,GACA,MAAA,IAAA8yB,UAAA,kEAGA,IAAA4/D,EAAAp7F,GACA,MAAA,IAAAw7B,UAAA,mEAGA,IAAA4/D,EAAAr4F,GACA,MAAA,IAAAy4B,UAAA,kEAGA,IAAA4/D,EAAAr6F,GACA,MAAA,IAAAy6B,UAAA,mEAGA,OAiDA,SAAAkjE,EAAAC,EAAAC,EAAAC,GACA,IAAAC,EAAAJ,EACAK,EAAAH,EACAluF,EAAAsB,EAAA8sF,EAAAH,GACAhuF,EAAAqB,EAAA+sF,EAAAF,GACAt/B,EAAAvtD,EAAAunE,EAAA7oE,EAAA,GAAAC,EAAA,IAAA4oE,EAAA5oE,EAAA,GAAAD,EAAA,KAEA,GAAA0wD,EAAA3gE,EAAA8+D,GAAA/qD,EAAA69C,SACA,OAAA,KAGA,IAAA2sC,EAAAzlB,EAAA5oE,EAAA,GAAAmuF,EAAA,IACAG,EAAA1lB,EAAA5oE,EAAA,GAAAmuF,EAAA,IACAI,EAAA3lB,EAAA5oE,EAAA,GAAAouF,EAAA,IACAI,EAAA5lB,EAAA5oE,EAAA,GAAAouF,EAAA,IACAhgG,EAAAu6E,EAAAD,EAAArnE,EAAAA,EAAAgtF,EAAAC,GAAAC,GAAAC,GAAA5/B,GACA,OAAAv9D,EAAAghD,EAAAtyC,EAAA3R,GAAA+/F,GAjEAM,CAAA12F,EAAA1I,EAAA+C,EAAAhC,GACA,GAAA,IAAA2H,EAAA/I,OAmBA,MAAA,IAAA67B,UAAA,uDAlBA,IAAA8/D,EAAA5yF,GACA,MAAA,IAAA8yB,UAAA,kEAGA,IAAA8/D,EAAAt7F,GACA,MAAA,IAAAw7B,UAAA,mEAGA,IAAA8/D,EAAAv4F,GACA,MAAA,IAAAy4B,UAAA,kEAGA,IAAA8/D,EAAAv6F,GACA,MAAA,IAAAy6B,UAAA,mEAGA,OA0DA,SAAAznB,EAAAgoF,EAAAM,EAAAvuF,EAAAkuF,EAAAM,EAAA+C,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,IAAAC,EAAAC,EAAA7rF,EAAAsrF,EAAAG,EAAAH,EAAAtD,EAAAuD,EAAAG,EAAAH,EAAAjD,EAAAkD,EAAAG,EAAAH,GAEAM,EAAAD,EAAAJ,EAAAH,EAAAvxF,EAAAiG,EAAA0rF,EAAAH,EAAAtD,EAAAD,EAAA2D,EAAAH,EAAAjD,EAAAD,GAEAyD,EAAAF,EAAA7rF,EAAAsrF,EAAAvxF,EAAAiG,EAAAgoF,EAAAuD,EAAAtD,EAAAD,EAAAM,EAAAkD,EAAAjD,EAAAD,GAEA0D,EAAAH,EAAAJ,EAAAH,EAAAG,EAAAH,EAAAI,EAAAH,EAAAG,EAAAH,EAAAI,EAAAH,EAAAG,EAAAH,GAEAS,EAAAJ,EAAA9xF,EAAAiG,EAAAjG,EAAAiG,EAAAioF,EAAAD,EAAAC,EAAAD,EAAAO,EAAAD,EAAAC,EAAAD,GAEA4D,EAAA3mB,EAAAtnE,EAAAunE,EAAAomB,EAAAE,GAAAtmB,EAAAumB,EAAAC,IAAA/tF,EAAAunE,EAAAymB,EAAAD,GAAAxmB,EAAAsmB,EAAAA,KACAK,EAAA5mB,EAAAD,EAAAsmB,EAAApmB,EAAA0mB,EAAAJ,IAAAE,GACAI,EAAA9mB,EAAAtlE,EAAAwlE,EAAA0mB,EAAAjuF,EAAAlE,EAAAiG,KACAqsF,EAAA/mB,EAAA0iB,EAAAxiB,EAAA0mB,EAAAjuF,EAAAgqF,EAAAD,KACAsE,EAAAhnB,EAAAgjB,EAAA9iB,EAAA0mB,EAAAjuF,EAAAsqF,EAAAD,KACAiE,EAAAjnB,EAAAgmB,EAAA9lB,EAAA2mB,EAAAluF,EAAAwtF,EAAAH,KACAkB,EAAAlnB,EAAAimB,EAAA/lB,EAAA2mB,EAAAluF,EAAAytF,EAAAH,KACAkB,EAAAnnB,EAAAkmB,EAAAhmB,EAAA2mB,EAAAluF,EAAA0tF,EAAAH,KAEA,OAAA/lB,EAAA2mB,EAAAG,IAAA9mB,EAAA4mB,EAAAG,IAAA/mB,EAAA6mB,EAAAG,GACA,CAAAL,EAAAC,EAAAC,GAEA,KAjFAI,CAAA/3F,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAA1I,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAA+C,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAhC,EAAA,GAAAA,EAAA,GAAAA,EAAA,KAKA2/F,yBAAA,SAAA1gG,EAAA+C,EAAA+6F,GACA,OAAAxrC,EAAA8M,EAAAp/D,EAAAyF,UAAA1C,EAAA0C,UAAAq4F,EAAAr4F,aAEAk7F,iCAAA,SAAAj4F,EAAA1I,EAAA+C,EAAAhC,GAEA,OAAAuxD,EAAA8M,EAAA12D,EAAAjD,UAAAzF,EAAAyF,UAAA1C,EAAA0C,UAAA1E,EAAA0E,eAIA,SAAA01F,EAAA97F,GAEA,MAAA,iBAAAA,GAAA65C,EAAA6b,YAAA11D,GAGA,SAAA+7F,EAAAp7F,GACA,OAAA,IAAAA,EAAAL,QAAAw7F,EAAAn7F,EAAA,KAAAm7F,EAAAn7F,EAAA,IAGA,SAAAs7F,EAAAt7F,GACA,OAAA,IAAAA,EAAAL,QAAAw7F,EAAAn7F,EAAA,KAAAm7F,EAAAn7F,EAAA,KAAAm7F,EAAAn7F,EAAA,IA0BA,SAAA4/F,EAAAvgG,EAAAkB,EAAApB,EAAAiD,EAAAvD,EAAAK,EAAA+b,EAAAwwE,EAAAxsF,EAAAsK,EAAAjB,EAAAkyE,GAEA,IAAAomB,EAAArnB,EAAAvnE,EAAA3S,EAAAkB,GAAAyR,EAAA7S,EAAAiD,IACAy+F,EAAAtnB,EAAAvnE,EAAAnT,EAAAK,GAAA8S,EAAAiJ,EAAAwwE,IACAqV,EAAAvnB,EAAAvnE,EAAA/S,EAAAsK,GAAAyI,EAAA1J,EAAAkyE,IACA,OAAAnB,EAAAA,EAAAunB,EAAAC,GAAAC,GA8CA,OAAA1hC,4UClMA,aAEAv/D,EAAAJ,QAAA,CAAAd,EAAA,aAAAA,EAAA,gBAAAA,EAAA,aAAAA,EAAA,mBAAAA,EAAA,aAAAA,EAAA,cAAAA,EAAA,aAAAA,EAAA,YAAAA,EAAA,iBAAAA,EAAA,gBAAAA,EAAA,SAAAA,EAAA,aAAAA,EAAA,gBAAAA,EAAA,YAAAA,EAAA,kBAAAA,EAAA,UAAAA,EAAA,mUCFA,aAkIAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAjIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA0hE,EAAA5N,EAAA9zD,EAAA,oBACAy0E,EAAA3gB,EAAA9zD,EAAA,UACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy1F,EAAA3hC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA8BAu0E,EAAA/gB,EAAA,MAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,SAAA/C,IAAA+C,IAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,QAAA,IAAA/C,EAAAgB,IAAA,IAAAhB,EAAAiB,IAAA,IAAA8B,EAAA/B,IAAA,IAAA+B,EAAA9B,KAEA2wF,uBAAA,SAAA5xF,EAAA+C,GACA,QAAA/C,EAAA0F,UAAA3C,EAAA2C,UAAA1F,EAAA2B,SAAAoB,EAAApB,UAEAmwF,aAAA,SAAA9xF,EAAA+C,GACA,OAAAmwE,EAAAlzE,EAAAiG,OAAA,EAAAlD,EAAAkD,OAAA,IAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAqxF,EAAAp0F,EAAA+C,EAAAmwE,GAAA,IAEA0d,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAowF,EAAApwF,EAAA/C,EAAAkzE,GAAA,IAEAyd,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAowF,EAAAnzF,EAAA+C,EAAAmwE,GAAA,IAEAwd,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAmwE,IAEA4d,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAmwE,EAAA5gB,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAmwE,EAAA5gB,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAmwE,EAAAlzE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GAEA,OAAAqwE,EAAArwE,GAEAs9D,EAAArgE,EAAAk6B,OAAAl6B,EAAAq1F,WAGAzC,EAAA5yF,EAAA+C,EAAAmwE,GAAA,IAEA+d,mBAAA,SAAAjxF,EAAA+C,GAEA,OAAAqwE,EAAArwE,GAEAs9D,EAAArgE,EAAAk6B,OAAAl6B,EAAAq1F,WAGA5E,EAAAzwF,EAAA+C,EAAAmwE,GAAA,IAEAke,oBAAA,SAAApxF,EAAA+C,GAEA,OAAAqwE,EAAApzE,GAEAqgE,EAAArgE,EAAAk6B,OAAAl6B,EAAAq1F,WAGAzC,EAAA7vF,EAAA/C,EAAAkzE,GAAA,IAEAie,mBAAA,SAAAnxF,EAAA+C,GAEA,OAAAqwE,EAAApzE,GAEAqgE,EAAArgE,EAAAk6B,OAAAl6B,EAAAq1F,WAGA5E,EAAA1tF,EAAA/C,EAAAkzE,GAAA,IAEAme,aAAA,SAAArxF,EAAA+C,GAEA,OAAAmwE,EAAA5gB,EAAAtyD,GAAA+C,GAAA0C,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAAmwE,EAAAlzE,EAAAsyD,EAAAvvD,IAAA0C,aAMA,OAHAytE,EAAAjP,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,IAAA,uBAEA2O,gVC/HA,aAEArzE,EAAAJ,QAAA,CAAAd,EAAA,SAAAA,EAAA,SAAAA,EAAA,QAAAA,EAAA,kFCFA,aAEA,IAAA+jE,EAAA/jE,EAAA,kCAsDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QArDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBA4BAy0E,EAAAjhB,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,GAEAqB,QAAA,SAAArB,GACA,OAAA,IAAAA,EAAAgB,IAAA,IAAAhB,EAAAiB,IAEA21D,UAAA,SAAA52D,GACA,OAAAA,EAAA0F,UAAA1F,EAAA2B,SAEAusE,KAAA,SAAAluE,GACA,OAAA,OAAAA,EAAAiG,OAAAmtE,EAAApzE,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAozE,MAMA,OAHAA,EAAAnP,MAAA,CACArkE,EAAA+mE,EAAApC,UAAA,IAAA,6BAEA6O,yFCrDA,aAwGA3zE,EAAA2I,KAAA,KACA3I,EAAA8vD,QAvGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA+1F,EAAAjiC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA8BAw0E,EAAAhhB,EAAA,KAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,SAAA/C,IAAA+C,IAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA,IAAA/C,EAAAgB,IAAA,IAAAhB,EAAAiB,IAAA,IAAA8B,EAAA/B,IAAA,IAAA+B,EAAA9B,IAEA2wF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAA0F,WAAA1F,EAAA2B,UAAAoB,EAAA2C,WAAA3C,EAAApB,SAEAmwF,aAAA,SAAA9xF,EAAA+C,GACA,OAAAowE,EAAAnzE,EAAAiG,OAAA,EAAAlD,EAAAkD,OAAA,IAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAA2xF,EAAA10F,EAAA+C,EAAAowE,IAEAyd,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAmzE,GAAA,IAEAwd,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAowE,GAAA,IAEAud,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAowE,IAEA2d,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAowE,EAAA7gB,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAowE,EAAA7gB,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAowE,EAAAnzE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAowE,GAAA,IAEA8d,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAowE,GAAA,IAEAie,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAmzE,GAAA,IAEAge,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAmzE,GAAA,IAEAke,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAowE,GAAA,GAAA1tE,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAmzE,GAAA,GAAA1tE,aAMA,OAHA0tE,EAAAlP,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,GAAA,uBAEA4O,8SCrGA,aAwGA1zE,EAAA2I,KAAA,MACA3I,EAAA8vD,QAvGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA8BAo9C,EAAAoW,EAAA,MAAA,CACAu/B,iBAAA,SAAA1xF,EAAA+C,GACA,QAAA/C,KAAA+C,GAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA,IAAA/C,EAAAgB,IAAA,IAAAhB,EAAAiB,MAAA,IAAA8B,EAAA/B,IAAA,IAAA+B,EAAA9B,KAEA2wF,uBAAA,SAAA5xF,EAAA+C,GACA,QAAA/C,EAAA0F,WAAA1F,EAAA2B,YAAAoB,EAAA2C,WAAA3C,EAAApB,UAEAmwF,aAAA,SAAA9xF,EAAA+C,GACA,OAAAg5C,EAAA/7C,EAAAiG,OAAA,EAAAlD,EAAAkD,OAAA,IAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAg5C,IAEA60C,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAA+7C,GAAA,IAEA40C,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAg5C,GAAA,IAEA20C,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAg5C,IAEA+0C,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAg5C,EAAAuW,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAg5C,EAAAuW,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAg5C,EAAA/7C,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAg5C,GAAA,IAEAk1C,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAg5C,GAAA,IAEAq1C,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAA+7C,GAAA,IAEAo1C,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAA+7C,GAAA,IAEAs1C,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAg5C,GAAA,GAAAt2C,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAA+7C,GAAA,GAAAt2C,aAMA,OAHAs2C,EAAAkoB,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,IAAA,uBAEAxoB,8SCrGA,aAEA,IAAAglD,EAAApiG,EAAA,qBAAAu7B,KAEA+6B,EAAAt2D,EAAA,mCAEA24D,EAAA34D,EAAA,0BAsEA,SAAAqiG,EAAAC,EAAAlpB,EAAA74D,GACA,IAAAjgB,EAAAsG,EAAA27F,EAEA,GAAAnpB,GAAA,EAAA,CACA,GAAA/4D,MAAA2gB,QAAAshE,EAAA,IAEA,CAIA,IAHAC,EA2BA,SAAAD,GACA,IAEAhiG,EAAAsK,EAFA43F,EAAAF,EAAAthG,OACAytF,EAAA6T,EAAA,GAAAthG,OAEA4F,EAAA,GAEA,IAAAgE,EAAA,EAAAA,EAAA6jF,EAAA7jF,IAAA,CACA,IAAA9G,EAAA,GAEA,IAAAxD,EAAA,EAAAA,EAAAkiG,EAAAliG,IACAwD,EAAAwM,KAAAgyF,EAAAhiG,GAAAsK,IAGAhE,EAAA0J,KAAAxM,GAGA,OAAA8C,EA3CA67F,CAAAH,GACA17F,EAAA,GAEAtG,EAAA,EAAAA,EAAAiiG,EAAAvhG,OAAAV,IACAsG,EAAAtG,GAAA+hG,EAAAE,EAAAjiG,GAAA84E,EAAA,EAAA74D,GAGA,OAAA3Z,EATA,OAAA2Z,EAAA+hF,GAcA,IAFA17F,EAAA,GAEAtG,EAAA,EAAAA,EAAAgiG,EAAAthG,OAAAV,IACAsG,EAAAtG,GAAA+hG,EAAAC,EAAAhiG,GAAA84E,EAAA,EAAA74D,GAGA,OAAA3Z,EA8BA9F,EAAA2I,KAAA,QACA3I,EAAA8vD,QA1HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAApkD,EAAA0kD,EAAA9zD,EAAA,uBAkCA4a,EAAA44C,EAAA,QAAA,CACAkvC,+CAAA,SAAAJ,EAAAlpB,EAAA74D,GACA,IAAAnR,EAAAgqE,GACA,MAAA,IAAAv8C,UAAA,yCAGA,IAAAtB,EAAAlb,MAAA2gB,QAAAshE,GAAAF,EAAAE,GAAAA,EAAA/mE,OAEA,GAAA69C,EAAA,GAAAA,GAAA79C,EAAAv6B,OACA,MAAA,IAAA23D,EAAAygB,EAAA79C,EAAAv6B,QAGA,OAAAs1D,EAAAgsC,GACAA,EAAArkE,OAAAokE,EAAAC,EAAAx7F,UAAAsyE,EAAA74D,IAEA8hF,EAAAC,EAAAlpB,EAAA74D,MAMA,OAFA3F,EAAA0qD,WAAA/iE,EAEAqY,+IChEA,aAEA,IAAAlU,EAAA1G,EAAA,sBAAA0G,MAEAklB,EAAA5rB,EAAA,qBAEA24D,EAAA34D,EAAA,0BAEAq4D,EAAAr4D,EAAA,8BAoHA,SAAA2iG,EAAAjiG,EAAAkB,EAAAghG,EAAAxpB,GACA,GAAAA,EAAAwpB,EAAA,CAEA,GAAAliG,EAAAM,SAAAY,EAAAZ,OACA,MAAA,IAAAq3D,EAAA33D,EAAAM,OAAAY,EAAAZ,QAKA,IAFA,IAAAR,EAAA,GAEAF,EAAA,EAAAA,EAAAI,EAAAM,OAAAV,IACAE,EAAAF,GAAAqiG,EAAAjiG,EAAAJ,GAAAsB,EAAAtB,GAAAsiG,EAAAxpB,EAAA,GAGA,OAAA54E,EAGA,OAAAE,EAAAokD,OAAAljD,GAIAd,EAAA2I,KAAA,SACA3I,EAAA8vD,QAvIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAoP,EAAA0kD,EAAA9zD,EAAA,uBA+BA8kD,EAAA0O,EAAA,SAAA,CAEAqvC,yCAAA,SAAA/tF,GACA,IAAAxU,EAIAwiG,EAHA32F,EAAA2I,EAAA9T,OACAo4E,GAAA,EAGA2pB,GAAA,EACAC,EAAA,GAEA,IAAA1iG,EAAA,EAAAA,EAAA6L,EAAA7L,IAAA,CACA,IAAAqD,EAAAmR,EAAAxU,GAMA,GAJAi6C,EAAA+b,SAAA3yD,KACAo/F,GAAA,GAGAxoD,EAAAsG,SAAAl9C,IAAA42C,EAAA6b,YAAAzyD,GAAA,CACA,GAAArD,IAAA6L,EAAA,EACA,MAAA,IAAAxL,MAAA,gDAOA,GAHAmiG,EAAA1pB,EACAA,EAAAz1E,EAAAmD,WAEAsI,EAAAgqE,GACA,MAAA,IAAAv8C,UAAA,yCAGA,GAAAu8C,EAAA,GAAA,EAAA94E,GAAAwiG,EAAA1pB,EAEA,MAAA,IAAAzgB,EAAAygB,EAAA0pB,EAAA,OAEA,CAEA,IAAAp2F,EAAAhG,EAAA/C,GAAAmD,UACAy0B,EAAA3P,EAAA2P,KAAA7uB,GAKA,GAJAs2F,EAAA1iG,GAAAoM,EACAo2F,EAAA1pB,EACAA,EAAA79C,EAAAv6B,OAAA,EAEA,EAAAV,GAAA84E,IAAA0pB,EACA,MAAA,IAAAzqC,EAAAyqC,EAAA,EAAA1pB,EAAA,IAKA,GAAA,IAAA4pB,EAAAhiG,OACA,MAAA,IAAAU,YAAA,gCAKA,IAFA,IAAA8D,EAAAw9F,EAAAxyF,QAEAwyF,EAAAhiG,QACAwE,EAAAm9F,EAAAn9F,EAAAw9F,EAAAxyF,QAAA4oE,EAAA,GAGA,OAAA2pB,EAAApvC,EAAAnuD,GAAAA,GAEAy9F,YAAA,SAAAnuF,GACA,OAAAA,EAAA8T,KAAA,OAKA,OAFAk8B,EAAAwgB,WAAA/iE,EAEAuiD,0MC9GA,aAEA,IAAAl5B,EAAA5rB,EAAA,qBAqFAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QApFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAqT,EAAAygD,EAAA9zD,EAAA,2BACAqkD,EAAAyP,EAAA9zD,EAAA,2BAmCA0gE,EAAAlN,EAAA,QAAA,CACAyiC,iBAAA,SAAA50F,EAAA+C,GACA,OAAAuvD,EAAAuvC,EAAA7hG,EAAAif,UAAAlc,EAAAkc,aAEA+xE,gBAAA,SAAAhxF,EAAA+C,GACA,OAAAuvD,EAAAuvC,EAAA7hG,EAAAif,UAAAlc,KAEAguF,gBAAA,SAAA/wF,EAAA+C,GACA,OAAAuvD,EAAAuvC,EAAA7hG,EAAA+C,EAAAkc,aAEA6xE,eAAA+Q,IAKA,OAHAxiC,EAAA4E,MAAA,CACAwtB,EAAA,6DAEApyB,EASA,SAAAwiC,EAAA7hG,EAAA+C,GACA,IAAA++F,EAAA7hG,KAAA6I,IAAAyhB,EAAA2P,KAAAl6B,GAAAL,OAAA4qB,EAAA2P,KAAAn3B,GAAApD,QACAK,EAAAuqB,EAAA01C,QAAAjgE,GACA+C,EAAAwnB,EAAA01C,QAAAl9D,GACA,IAAAg/F,EAAAx3E,EAAA2P,KAAAl6B,GACAgiG,EAAAz3E,EAAA2P,KAAAn3B,GAEA,GAAA,IAAAg/F,EAAApiG,QAAA,IAAAqiG,EAAAriG,QAAA,IAAAoiG,EAAA,IAAA,IAAAC,EAAA,GACA,MAAA,IAAA5qC,WAAA,6CAAA2qC,EAAAx6E,KAAA,MAAA,WAAAy6E,EAAAz6E,KAAA,MAAA,MAGA,IAAA06E,EAAA,CAAAjwF,EAAAgxC,EAAAhjD,EAAA,GAAA+C,EAAA,IAAAigD,EAAAhjD,EAAA,GAAA+C,EAAA,KAAAiP,EAAAgxC,EAAAhjD,EAAA,GAAA+C,EAAA,IAAAigD,EAAAhjD,EAAA,GAAA+C,EAAA,KAAAiP,EAAAgxC,EAAAhjD,EAAA,GAAA+C,EAAA,IAAAigD,EAAAhjD,EAAA,GAAA+C,EAAA,MAEA,OAAA,EAAA++F,EACA,CAAAG,GAEAA,uJClFA,aA0CAxiG,EAAA2I,KAAA,aACA3I,EAAA8vD,QAzCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAiO,EAAA3N,EAAA9zD,EAAA,gBACAsgE,EAAAxM,EAAA9zD,EAAA,oBAEAgoE,EAAAhoE,EAAA,qBAyBA2gE,EAAAnN,EAAA,aAAA,CACA2Q,IAAA,SAAA9iE,GACA,OAAAi/D,EAAAmB,EAAApgE,OAMA,OAHAs/D,EAAA2E,MAAA,CACArkE,EAAA,4BAAA6jD,OAAAkjB,EAAApC,UAAA,aAEAjF,4FCvCA,aAEA,IAAAokB,EAAA/kF,EAAA,qBAEA+tB,EAAAg3D,EAAAh3D,OACAqN,EAAA2pD,EAAA3pD,OA+IAt6B,EAAA2I,KAAA,MACA3I,EAAA8vD,QA9IA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAqT,EAAAygD,EAAA9zD,EAAA,2BACAqkD,EAAAyP,EAAA9zD,EAAA,2BACAw/D,EAAA1L,EAAA9zD,EAAA,6BACAs+D,EAAAxK,EAAA9zD,EAAA,iCA2BA4gE,EAAApN,EAAA,MAAA,CACA2Q,IAAA,SAAA9iE,GACA,OAAA0sB,EAAArnB,MAAArF,IAEA2iE,iBAAA,SAAA3iE,GACA,IAAAk6B,EAYA,QATAA,EADAgf,EAAA+b,SAAAj1D,GACAA,EAAAk6B,OACAlb,MAAA2gB,QAAA3/B,IACAA,EAAAsyD,EAAAtyD,IACAk6B,OAGA,IAGAv6B,QACA,KAAA,EAEA,OAAA+sB,EAAArnB,MAAArF,GAEA,KAAA,EAEA,GAAA,IAAAk6B,EAAA,GACA,OAAAxN,EAAArnB,MAAArF,EAAAyF,UAAA,IAEA,MAAA,IAAA2xD,WAAA,gCAAAr9B,EAAAm+B,OAAAh+B,GAAA,KAGA,KAAA,EAEA,IAAAq8C,EAAAr8C,EAAA,GAGA,GAAAq8C,IAFAr8C,EAAA,GAGA,OAwBA,SAAAo4B,EAAAikB,EAAAC,GACA,GAAA,IAAAD,EAEA,OAAA7pD,EAAArnB,MAAAitD,EAAA,GAAA,IACA,GAAA,IAAAikB,EAGA,OAAAvkE,EAAAgxC,EAAAsP,EAAA,GAAA,GAAAA,EAAA,GAAA,IAAAtP,EAAAsP,EAAA,GAAA,GAAAA,EAAA,GAAA,KAOA,IAJA,IAAA4vC,EAAAjlC,EAAA3K,GAEA6vC,EAAAD,EAAAvnB,EAAA,GAAA,GAEAyI,EAAA,EAAAA,EAAA7M,EAAA6M,IACA+e,EAAAn/C,EAAAm/C,EAAAD,EAAAvnB,EAAAyI,GAAAA,IASA,IAJA,IAAAgf,EAAA,EACAnjG,EAAA,EACAkmF,EAAA,KAEA,CACA,KAAAA,EAAAlmF,IACAA,IAGA,GAAAs3E,GAAAt3E,EAAA,MAIA,IAHA,IAAAsK,EAAAtK,EACAmc,EAAA,GAEA+pE,EAAA+c,EAAA1iG,EAAA+J,KACA47E,EAAA+c,EAAA1iG,EAAA+J,KAAA,EACAA,EAAA24F,EAAA1iG,EAAA+J,GACA6R,IAGAA,EAAA,GAAA,GACAgnF,IAIA,OAAAA,EAAA,GAAA,EAAAD,EAAAhkC,EAAAgkC,GApEAE,CAAAriG,EAAAqF,QAAAI,UAAA8wE,GAEA,MAAA,IAAAnf,WAAA,gCAAAr9B,EAAAm+B,OAAAh+B,GAAA,KAGA,QAEA,MAAA,IAAAk9B,WAAA,yCAAAr9B,EAAAm+B,OAAAh+B,GAAA,SAOA,OAHAqlC,EAAA0E,MAAA,CACArkE,EAAA,kCAEA2/D,wNCzFA,aAEA,IAAAh1C,EAAA5rB,EAAA,qBAEAoP,EAAApP,EAAA,sBAAAoP,UA4JAtO,EAAA2I,KAAA,OACA3I,EAAA8vD,QA3JA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAuCA6gE,EAAArN,EAAA,OAAA,CAEAnzC,MAAA,SAAAhf,GACA,OAAA6qF,EAAA7qF,EAAA,EAAAuqB,EAAA2P,KAAAl6B,GAAA,OAEA64F,gBAAA,SAAA74F,EAAAsI,GACA,OAAAuiF,EAAA7qF,EAAAsI,EAAAiiB,EAAA2P,KAAAl6B,GAAA,OAEA+4F,mBAAA,SAAA/4F,EAAAsI,GACA,OAAAuiF,EAAA7qF,EAAAsI,EAAA2I,WAAAsZ,EAAA2P,KAAAl6B,GAAA,OAEAsiG,gBAAA,SAAAtiG,EAAAk4D,GACA,OAAA2yB,EAAA7qF,EAAA,EAAAuqB,EAAA2P,KAAAl6B,GAAAk4D,IAEAqqC,wBAAA,SAAAviG,EAAAsI,EAAA4vD,GACA,OAAA2yB,EAAA7qF,EAAAsI,EAAAiiB,EAAA2P,KAAAl6B,GAAAk4D,IAEAsqC,2BAAA,SAAAxiG,EAAAsI,EAAA4vD,GACA,OAAA2yB,EAAA7qF,EAAAsI,EAAA2I,WAAAsZ,EAAA2P,KAAAl6B,GAAAk4D,IAEA4Y,OAAA,SAAA9wE,GACA,OAAA6qF,EAAA7qF,EAAA,EAAAA,EAAAk6B,OAAAl6B,EAAAq1F,YAEA2D,iBAAA,SAAAh5F,EAAAsI,GACA,OAAAuiF,EAAA7qF,EAAAsI,EAAAtI,EAAAk6B,OAAAl6B,EAAAq1F,YAEA6D,oBAAA,SAAAl5F,EAAAsI,GACA,OAAAuiF,EAAA7qF,EAAAsI,EAAA2I,WAAAjR,EAAAk6B,OAAAl6B,EAAAq1F,YAEAoN,iBAAA,SAAAziG,EAAAk4D,GACA,OAAA2yB,EAAA7qF,EAAA,EAAAA,EAAAk6B,OAAAg+B,IAEAwqC,yBAAA,SAAA1iG,EAAAsI,EAAA4vD,GACA,OAAA2yB,EAAA7qF,EAAAsI,EAAAtI,EAAAk6B,OAAAg+B,IAEAyqC,4BAAA,SAAA3iG,EAAAsI,EAAA4vD,GACA,OAAA2yB,EAAA7qF,EAAAsI,EAAA2I,WAAAjR,EAAAk6B,OAAAg+B,MAKA,OAFAsH,EAAAyE,WAAA/iE,EAEAs+D,EAWA,SAAAqrB,EAAA7qF,EAAAsI,EAAA4xB,EAAAg+B,GACA,IAAAnqD,EAAAzF,GACA,MAAA,IAAAkzB,UAAA,wDAGA,IAAAonE,EAAA,EAAAt6F,EAAAA,EAAA,EACAu6F,EAAAv6F,EAAA,GAAAA,EAAA,EAEA,OAAA4xB,EAAAv6B,QACA,KAAA,EACA,OASA,SAAAK,EAAAsI,EAAA4vD,EAAAsiB,EAAAqoB,EAAAD,GAEA,IAAAE,EAAA,CAAAtoB,EAAAqoB,EAAAroB,EAAAooB,GAIAv3F,EAFA6tC,EAAA43B,OAAAukB,QAAAn9B,GAAA,SAEA6qC,SAAAD,EAAA9iG,EAAAsI,GAEA,OAAA,OAAA4vD,EAAA7sD,EAAAA,EAAA5F,UAjBAu9F,CAAAhjG,EAAAsI,EAAA4vD,EAAAh+B,EAAA,GAAA2oE,EAAAD,GAEA,KAAA,EACA,OAiBA,SAAA5iG,EAAAsI,EAAA4vD,EAAAluD,EAAA64F,EAAAD,GAEA,GAAA1pD,EAAA+b,SAAAj1D,GAAA,CAEA,IAAAijG,EAAAjjG,EAAA+iG,SAAAz6F,GAEA,OAAA,OAAA4vD,EAEAA,IAAA+qC,EAAA5N,UACA/iC,EAAA2wC,EAAA/qC,GAGA+qC,EAGAA,EAAAx9F,UAQA,IAJA,IAAA3G,EAAAmB,KAAA4I,IAAAmB,EAAA,GAAA64F,EAAA74F,EAAA,GAAA44F,GAEAM,EAAA,GAEAjkG,EAAA,EAAAA,EAAAH,EAAAG,IACAikG,EAAAjkG,GAAAe,EAAAf,EAAA4jG,GAAA5jG,EAAA2jG,GAIA,OAAA,OAAA1qC,EAAA5F,EAAA4wC,GAAAA,EA7CAC,CAAAnjG,EAAAsI,EAAA4vD,EAAAh+B,EAAA2oE,EAAAD,GAGA,MAAA,IAAAxrC,WAAA,sKClHA,aAEA,IAAAl9B,EAAAv7B,EAAA,qBAAAu7B,KAwEAz6B,EAAA2I,KAAA,MACA3I,EAAA8vD,QAvEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAqkD,EAAAyP,EAAA9zD,EAAA,2BAyBA8gE,EAAAtN,EAAA,MAAA,CACAyiC,iBAAA,SAAA50F,EAAA+C,GACA,OAAAqgG,EAAApjG,EAAAif,UAAAlc,EAAAkc,YAEA+xE,gBAAA,SAAAhxF,EAAA+C,GACA,OAAAqgG,EAAApjG,EAAAif,UAAAlc,IAEAguF,gBAAA,SAAA/wF,EAAA+C,GACA,OAAAqgG,EAAApjG,EAAA+C,EAAAkc,YAEA6xE,eAAAsS,IAKA,OAHA3jC,EAAAwE,MAAA,CACAwtB,EAAA,6CAEAhyB,EAUA,SAAA2jC,EAAApjG,EAAA+C,GACA,IAAAg/F,EAAA7nE,EAAAl6B,GACAgiG,EAAA9nE,EAAAn3B,GACA+H,EAAAi3F,EAAA,GACA,GAAA,IAAAA,EAAApiG,QAAA,IAAAqiG,EAAAriG,OAAA,MAAA,IAAAy3D,WAAA,mBAEA,GAAA2qC,EAAA,KAAAC,EAAA,GAAA,MAAA,IAAA5qC,WAAA,mCAAA2qC,EAAA,GAAA,OAAAC,EAAA,GAAA,KACA,GAAA,IAAAl3F,EAAA,MAAA,IAAAssD,WAAA,qDAGA,IAFA,IAAAjlD,EAAA,EAEAlT,EAAA,EAAAA,EAAA6L,EAAA7L,IACAkT,EAAAnQ,EAAAmQ,EAAA6wC,EAAAhjD,EAAAf,GAAA8D,EAAA9D,KAGA,OAAAkT,0GCtEA,aAEA,IAAA+lD,EAAAv5D,EAAA,sBAAAu5D,OAuKAz4D,EAAA2I,KAAA,OACA3I,EAAA8vD,QAtKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1xD,EAAAgyD,EAAA9zD,EAAA,sBACAqD,EAAAywD,EAAA9zD,EAAA,sBACAstC,EAAAwmB,EAAA9zD,EAAA,eACAghE,EAAAlN,EAAA9zD,EAAA,UACAqkD,EAAAyP,EAAA9zD,EAAA,2BACA86E,EAAAvgC,EAAAugC,aA2BA9b,EAAAxL,EAAA,OAAA,CACA2e,OAAA,SAAA72D,GAEA,IAAAigB,EAAAjgB,EAAAigB,OAEA,GAAA,IAAAA,EAAAv6B,QAAAu6B,EAAA,KAAAA,EAAA,GACA,MAAA,IAAAk9B,WAAA,gCAAAc,EAAAh+B,GAAA,KAmCA,IAhCA,IAAAp7B,EAAAo7B,EAAA,GAYA2sC,EAgEA,SAAAw8B,EAAA7oF,GAGA,IAFA,IAEAlS,EAAA,EAAAA,EAFA,GAEAA,IACA,IAAA,IAAAgH,EAAA,EAAAA,GAAAhH,EAAAgH,IAAA,CACA,IAAA/F,EAAAjB,EAAAgH,EAEA,GAAAg0F,EAAAD,EAAA/zF,EAAA/F,GAAAiR,EACA,MAAA,CACAlL,EAAAA,EACA/F,EAAAA,GAMA,MAAA,IAAAjK,MAAA,oHAhFAikG,CAyCA,SAAAtpF,GAIA,IAHA,IAAAnb,EAAAmb,EAAAigB,OAAA,GACAmpE,EAAA,EAEApkG,EAAA,EAAAA,EAAAH,EAAAG,IAAA,CAGA,IAFA,IAAAukG,EAAA,EAEAj6F,EAAA,EAAAA,EAAAzK,EAAAyK,IACAi6F,GAAA/iG,EAAAwZ,EAAAyC,IAAA,CAAAzd,EAAAsK,KAGA85F,EAAApjG,KAAA6I,IAAA06F,EAAAH,GAGA,OAAAA,EA1DAI,CAAAxpF,GANA,OAUA3K,EAAAu3D,EAAAv3D,EACA/F,EAAAs9D,EAAAt9D,EAOAm6F,EAAA1gD,EAAA/oC,EAAAha,KAAAoC,IAAA,GAAAkH,IAEA2R,EAAA+wB,EAAAntC,GACAsb,EAAA6xB,EAAAntC,GAEA6kG,EAAA,EAEAC,EAAAF,EAEAG,GAAA,EAEA5kG,EAAA,EAAAA,GAAAqQ,EAAArQ,IACA,EAAAA,IACA2kG,EAAA5gD,EAAA4gD,EAAAF,GACAG,GAAAA,GAIA3oF,EAAAlZ,EAAAkZ,EAAA8nC,EADA2gD,EAAAA,GAAAr0F,EAAArQ,EAAA,KAAA,EAAAqQ,EAAArQ,EAAA,GAAAA,GACA2kG,IACAxpF,EAAApY,EAAAoY,EAAA4oC,EAAA2gD,EAAAE,EAAAD,IAKA,IAFA,IAAAtnB,EAAAt5B,EAAA2c,EAAAvlD,GAAAc,GAEAkoE,EAAA,EAAAA,EAAA75E,EAAA65E,IACA9G,EAAAt5B,EAAAs5B,EAAAA,GAGA,OAAApjC,EAAAmc,eAAAp7C,GAAA,IAAAw/D,EAAA6C,GAAAA,KAmDA,SAAAgnB,EAAAD,EAAA/zF,EAAA/F,GAGA,IAFA,IAAAu6F,EAAA,EAEA7kG,EAAA,EAAAA,GAAAqQ,EAAArQ,IACA6kG,GAAA7kG,EAKA,IAFA,IAAA8kG,EAAAD,EAEAxgB,EAAAh0E,EAAA,EAAAg0E,GAAA,EAAAh0E,EAAAg0E,IACAygB,GAAAzgB,EAGA,IAAA0gB,EAAAD,GAAA,EAAAz0F,EAAA,GACA,OAAA,EAAArP,KAAAoC,IAAAghG,EAAApjG,KAAAoC,IAAA,EAAAkH,GAAA,EAAA+F,GAAAw0F,EAAAA,GAAAC,EAAAC,GAMA,OAHArmC,EAAAsG,MAAA,CACArkE,EAAA,kCAEA+9D,+JCtKA,aAQAl+D,EAAA2I,KAAA,MACA3I,EAAA8vD,QAPA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,OAAA,WACA,MAAA,IAAA7yD,MAAA,2MCJA,aAEA,IAAA+kD,EAAA1lD,EAAA,qBAAA0lD,OAEA2zB,EAAAr5E,EAAA,qBAAAq5E,aAEAC,EAAAt5E,EAAA,wBAAAs5E,iBAyDA,SAAAgsB,EAAAjkG,EAAAkf,GAEA,IAAAzL,EAAAwkE,EAAA/4D,GACA,OAAAmlC,EAAArkD,EAAA,SAAAiG,EAAAmT,EAAAmR,GAEA,OAAA,IAAA9W,EACAyL,EAAAjZ,GACA,IAAAwN,EACAyL,EAAAjZ,EAAA,CAAAmT,IAGA8F,EAAAjZ,EAAA,CAAAmT,GAAAmR,KAKA9qB,EAAA2I,KAAA,SACA3I,EAAA8vD,QAxEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCA+BA0lD,EAAA8N,EAAA,SAAA,CACAkmB,kBAAA4rB,EACA3rB,mBAAA,SAAAt4E,EAAAuV,GACA,OAAA+8C,EAAA2xC,EAAAjkG,EAAAif,UAAA1J,KAEAgjE,gBAAAP,EACAQ,iBAAA,SAAAx4E,EAAAuV,GACA,OAAA+8C,EAAA0lB,EAAAh4E,EAAAif,UAAA1J,OAKA,OAFA8uC,EAAA4f,WAAA/iE,EAEAmjD,uHCpDA,aAEA,IAAAh/C,EAAA1G,EAAA,sBAAA0G,MAEA6+F,EAAAvlG,EAAA,qBAAAq6C,QAuCAv5C,EAAA2I,KAAA,UACA3I,EAAA8vD,QAtCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAoBAq6C,EAAAmZ,EAAA,UAAA,CACAnzC,MAAA,SAAAhf,GACA,OAAAkkG,EAAA7+F,EAAArF,KAEA8wE,OAAA,SAAA9wE,GACA,IAAAmkG,EAAAD,EAAA7+F,EAAArF,EAAAif,YAGA,OAAAqzC,EAAA6xC,MAKA,OAFAnrD,EAAAirB,WAAA/iE,EAEA83C,qHCxCA,aAEA,IAAAi/B,EAAAt5E,EAAA,wBAAAs5E,iBAEA9+D,EAAAxa,EAAA,qBAAAwa,QA4CA,SAAAu/D,EAAAnuD,EAAArL,GAEA,IAAAzL,EAAAwkE,EAAA/4D,IAEA,SAAA05D,EAAA3yE,EAAAmT,GACA4F,MAAA2gB,QAAA15B,GACAkT,EAAAlT,EAAA,SAAA8jE,EAAA9qE,GAEA25E,EAAA7O,EAAA3wD,EAAAqqC,OAAAxkD,MAIA,IAAAwU,EACAyL,EAAAjZ,GACA,IAAAwN,EACAyL,EAAAjZ,EAAAmT,GAGA8F,EAAAjZ,EAAAmT,EAAAmR,GAKAquD,CAAAruD,EAAA,IAGA9qB,EAAA2I,KAAA,UACA3I,EAAA8vD,QArEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAh5C,EAAAg5C,EAAA,UAAA,CACAkmB,kBAAAK,EACAJ,mBAAA,SAAAt4E,EAAAkf,GACA,OAAAlf,EAAAmZ,QAAA+F,MAKA,OAFA/F,EAAA8qD,WAAA/iE,EAEAiY,+ECtCA,aAkDA1Z,EAAA2I,KAAA,oBACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAiyC,EAAA3xC,EAAA9zD,EAAA,6CA4CA,OARAwzD,EAAA,oBAAA,CACAnzC,MAAA,SAAAhf,GACA,OAAAokG,EAAApkG,IAEA8wE,OAAA,SAAA9wE,GACA,OAAAA,EAAAqkG,0FC5CA,aAEA,IAAA95E,EAAA5rB,EAAA,qBAEAoP,EAAApP,EAAA,sBAAAoP,UAsIAtO,EAAA2I,KAAA,WACA3I,EAAA8vD,QArIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAgCAstC,EAAAkmB,EAAA,WAAA,CACA8Q,GAAA,WACA,MAAA,WAAAzuD,EAAA89C,OAAAA,EAAA,IAAA,IAEAv4B,OAAA,SAAAm+B,GACA,OAAA5F,EAAA4F,IAEA2iC,qBAAA,SAAAtkB,GACA,OAAA+tB,EAAA/tB,EAAAA,EAAA,WAAA/hE,EAAA89C,OAAA,eAAApxD,IAEAqjG,6BAAA,SAAAhuB,EAAAre,GACA,OAAAosC,EAAA/tB,EAAAA,EAAAre,IAEA4iC,yCAAA,SAAAvkB,EAAAC,GACA,OAAA8tB,EAAA/tB,EAAAC,EAAA,WAAAhiE,EAAA89C,OAAA,eAAApxD,IAEAsjG,iDAAA,SAAAjuB,EAAAC,EAAAte,GACA,OAAAosC,EAAA/tB,EAAAC,EAAAte,IAEAl5C,MAAA,SAAAkb,GACA,OAAAuqE,EAAAvqE,IAEAooE,gBAAA,SAAApoE,EAAAg+B,GACA,OAAAusC,EAAAvqE,EAAAg+B,IAEA4Y,OAAA,SAAA52C,GACA,OAAAuqE,EAAAvqE,EAAAz0B,UAAAy0B,EAAAm7D,YAEAoN,iBAAA,SAAAvoE,EAAAg+B,GACA,OAAAusC,EAAAvqE,EAAAz0B,UAAAyyD,MAKA,OAFAjsB,EAAAg4B,WAAA/iE,EAEA+qC,EAEA,SAAAw4D,EAAAvqE,EAAAg+B,GACA,OAAAh+B,EAAAv6B,QACA,KAAA,EACA,OAAAu4D,EAAA5F,EAAA4F,GAAA,GAEA,KAAA,EACA,OAAAosC,EAAApqE,EAAA,GAAAA,EAAA,GAAAg+B,GAEA,KAAA,EACA,OAAAosC,EAAApqE,EAAA,GAAAA,EAAA,GAAAg+B,GAEA,QACA,MAAA,IAAA54D,MAAA,0CAaA,SAAAglG,EAAA/tB,EAAAC,EAAAte,GAEA,IAAAmgC,EAAAn/C,EAAA6b,YAAAwhB,IAAAr9B,EAAA6b,YAAAyhB,GAAAt9B,EAAA0d,UAAA,KAIA,GAHA1d,EAAA6b,YAAAwhB,KAAAA,EAAAA,EAAAtlE,YACAioC,EAAA6b,YAAAyhB,KAAAA,EAAAA,EAAAvlE,aAEAlD,EAAAwoE,IAAAA,EAAA,EACA,MAAA,IAAAj3E,MAAA,6DAGA,IAAAyO,EAAAyoE,IAAAA,EAAA,EACA,MAAA,IAAAl3E,MAAA,6DAGA,IAAAiN,EAAA8rF,EAAA,IAAAn/C,EAAA0d,UAAA,GAAA,EACA/f,EAAAwhD,EAAA,IAAAA,EAAA,GAAA,EACAn+D,EAAA,CAAAq8C,EAAAC,GAEA,GAAAte,EAIA,OAFAhf,EAAA43B,OAAAukB,QAAAn9B,GAEA6qC,SAAA7oE,EAAA3tB,EAAA,EAAAsqC,GAQA,IAJA,IAAA1yC,EAAAomB,EAAAw1C,OAAA,GAAA7lC,EAAA2c,GAEA6tD,EAAAnuB,EAAAC,EAAAD,EAAAC,EAEAp0E,EAAA,EAAAA,EAAAsiG,EAAAtiG,IACA+B,EAAA/B,GAAAA,GAAAmK,EAGA,OAAApI,sHCtIA,aAEAtE,EAAAJ,QAAA,CAAAd,EAAA,WAAAA,EAAA,YAAAA,EAAA,WAAAA,EAAA,gBAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,YAAAA,EAAA,aAAAA,EAAA,aAAAA,EAAA,cAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,qBAAAA,EAAA,WAAAA,EAAA,aAAAA,EAAA,YAAAA,EAAA,UAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,aAAAA,EAAA,YAAAA,EAAA,WAAAA,EAAA,eAAAA,EAAA,WAAAA,EAAA,mfCFA,aAEA,IAAA+kF,EAAA/kF,EAAA,qBAwMAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAvMA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA26E,EAAA7mB,EAAA9zD,EAAA,+BACA06E,EAAA5mB,EAAA9zD,EAAA,4BACAqkD,EAAAyP,EAAA9zD,EAAA,2BACAw/D,EAAA1L,EAAA9zD,EAAA,6BACA4gE,EAAA9M,EAAA9zD,EAAA,kBACAstC,EAAAwmB,EAAA9zD,EAAA,eACA8B,EAAAgyD,EAAA9zD,EAAA,sBAsBAghE,EAAAxN,EAAA,MAAA,CACAwQ,iBAAA,SAAA3iE,GACA,IAAAk6B,EAAAgf,EAAA+b,SAAAj1D,GAAAA,EAAAk6B,OAAAwpD,EAAAn5D,MAAA2P,KAAAl6B,GAEA,OAAAk6B,EAAAv6B,QACA,KAAA,EAEA,GAAA,IAAAu6B,EAAA,GACA,OAAAgf,EAAA+b,SAAAj1D,GACAsyD,EAAA,CAAAgnB,EAAA,EAAAt5E,EAAAyF,UAAA,MAEA,CAAA6zE,EAAA,EAAAt5E,EAAA,KAGA,MAAA,IAAAo3D,WAAA,gCAAAssB,EAAA3pD,OAAAm+B,OAAAh+B,GAAA,KAGA,KAAA,EAEA,IAAAq8C,EAAAr8C,EAAA,GACAs8C,EAAAt8C,EAAA,GAEA,GAAAq8C,IAAAC,EACA,OAAAt9B,EAAA+b,SAAAj1D,GACAsyD,EAAAqyC,EAAA3kG,EAAAyF,UAAA8wE,EAAAC,GAAAx2E,EAAAq1F,WAGAsP,EAAA3kG,EAAAu2E,EAAAC,GAGA,MAAA,IAAApf,WAAA,gCAAAssB,EAAA3pD,OAAAm+B,OAAAh+B,GAAA,KAGA,QAEA,MAAA,IAAAk9B,WAAA,yCAAAssB,EAAA3pD,OAAAm+B,OAAAh+B,GAAA,OAGA4oC,IAAA,SAAA9iE,GAEA,OAAAs5E,EAAA,EAAAt5E,MAYA,SAAA2kG,EAAA1D,EAAA1qB,EAAAC,GACA,IAAA53E,EAAAoL,EAAA9K,EAAA+G,EAAAxB,EAEA,GAAA,IAAA8xE,EAAA,CAIA,GAAA,KAFAtwE,EAAAg7F,EAAA,GAAA,IAGA,MAAA3hG,MAAA,iDAGA,MAAA,CAAA,CAAAg6E,EAAA,EAAArzE,KACA,GAAA,IAAAswE,EAAA,CAEA,IAAAn0E,EAAAm9D,EAAA0hC,GAEA,GAAA,IAAA7+F,EACA,MAAA9C,MAAA,iDAGA,MAAA,CAAA,CAAAg6E,EAAA2nB,EAAA,GAAA,GAAA7+F,GAAAk3E,EAAAnb,EAAA8iC,EAAA,GAAA,IAAA7+F,IAAA,CAAAk3E,EAAAnb,EAAA8iC,EAAA,GAAA,IAAA7+F,GAAAk3E,EAAA2nB,EAAA,GAAA,GAAA7+F,KAQA,IAAA6X,EAAAgnF,EAAAx9C,SAEA,IAAA7kD,EAAA,EAAAA,EAAA23E,EAAA33E,IACAqb,EAAArb,GAAAqb,EAAArb,GAAA6kD,SAOA,IAFA,IAAAvpC,EAAA+xB,EAAAsqC,GAAA9wE,UAEAtG,EAAA,EAAAA,EAAAq3E,EAAAr3E,IAAA,CAEA,IAAAylG,EAAAnkG,EAAAwZ,EAAA9a,GAAAA,IACA0lG,EAAA1lG,EAGA,IAFAP,EAAAO,EAAA,EAEAP,EAAA23E,GACA91E,EAAAwZ,EAAArb,GAAAO,IAAAylG,IACAA,EAAAnkG,EAAAwZ,EAAArb,GAAAO,IACA0lG,EAAAjmG,GAGAA,IAGA,GAAA,IAAAgmG,EACA,MAAAtlG,MAAA,kDAGAV,EAAAimG,KAEA1lG,IACAsF,EAAAwV,EAAA9a,GACA8a,EAAA9a,GAAA8a,EAAArb,GACAqb,EAAArb,GAAA6F,EACAA,EAAAyV,EAAA/a,GACA+a,EAAA/a,GAAA+a,EAAAtb,GACAsb,EAAAtb,GAAA6F,GAIA,IAAAqgG,EAAA7qF,EAAA9a,GACA4lG,EAAA7qF,EAAA/a,GAEA,IAAAP,EAAA,EAAAA,EAAA23E,EAAA33E,IAAA,CACA,IAAAomG,EAAA/qF,EAAArb,GACAqmG,EAAA/qF,EAAAtb,GAEA,GAAAA,IAAAO,GAEA,GAAA,IAAA6lG,EAAA7lG,GAAA,CAIA,IAHAD,EAAAo6E,EAAAnb,EAAA6mC,EAAA7lG,IAAA2lG,EAAA3lG,IAGA6K,EAAA7K,EAAA6K,EAAAwsE,EAAAxsE,IACAg7F,EAAAh7F,GAAAqvE,EAAA2rB,EAAAh7F,GAAAg5C,EAAA9jD,EAAA4lG,EAAA96F,KAGA,IAAAA,EAAA,EAAAA,EAAAwsE,EAAAxsE,IACAi7F,EAAAj7F,GAAAqvE,EAAA4rB,EAAAj7F,GAAAg5C,EAAA9jD,EAAA6lG,EAAA/6F,UAGA,CAKA,IAFA9K,EAAA4lG,EAAA3lG,GAEA6K,EAAA7K,EAAA6K,EAAAwsE,EAAAxsE,IACAg7F,EAAAh7F,GAAAsvE,EAAA0rB,EAAAh7F,GAAA9K,GAGA,IAAA8K,EAAA,EAAAA,EAAAwsE,EAAAxsE,IACAi7F,EAAAj7F,GAAAsvE,EAAA2rB,EAAAj7F,GAAA9K,KAMA,OAAAgb,EAOA,OAHAylD,EAAAsE,MAAA,CACArkE,EAAA,kCAEA+/D,oRCvMA,aAEA,IAAAzlC,EAAAv7B,EAAA,qBAAAu7B,KAsFAz6B,EAAA2I,KAAA,OACA3I,EAAA8vD,QArFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA46E,EAAA9mB,EAAA9zD,EAAA,iCAyCA,OAZAwzD,EAAA,OAAA,CACAyiC,iBAAA,SAAA50F,EAAA+C,GACA,OAAAuvD,EAAA4yC,EAAAllG,EAAAif,UAAAlc,EAAAkc,aAEA+xE,gBAAA,SAAAhxF,EAAA+C,GACA,OAAAuvD,EAAA4yC,EAAAllG,EAAAif,UAAAlc,KAEAguF,gBAAA,SAAA/wF,EAAA+C,GACA,OAAAuvD,EAAA4yC,EAAAllG,EAAA+C,EAAAkc,aAEA6xE,eAAAoU,IAWA,SAAAA,EAAA7lG,EAAAkB,GAYA,GAVA,IAAA25B,EAAA76B,GAAAM,SAEAN,EAAA,CAAAA,IAGA,IAAA66B,EAAA35B,GAAAZ,SAEAY,EAAA,CAAAA,IAGA,EAAA25B,EAAA76B,GAAAM,QAAA,EAAAu6B,EAAA35B,GAAAZ,OACA,MAAA,IAAAy3D,WAAA,+EAAAtE,KAAAC,UAAA1zD,EAAAM,QAAA,SAAAmzD,KAAAC,UAAAxyD,EAAAZ,QAAA,KAGA,IAAAZ,EAAA,GACAH,EAAA,GACA,OAAAS,EAAA46B,IAAA,SAAA56B,GACA,OAAAkB,EAAA05B,IAAA,SAAA15B,GAGA,OAFA3B,EAAA,GACAG,EAAAkQ,KAAArQ,GACAS,EAAA46B,IAAA,SAAAl3B,GACA,OAAAxC,EAAA05B,IAAA,SAAAj6B,GACA,OAAApB,EAAAqQ,KAAAsqE,EAAAx2E,EAAA/C,aAIAjB,gICpFA,aAEA,IAAAk5E,EAAAt5E,EAAA,wBAAAs5E,iBA8CA,SAAAa,EAAAvuD,EAAArL,GAEA,IAAAzL,EAAAwkE,EAAA/4D,GAqBA,OAnBA,SAAA05D,EAAA3yE,EAAAmT,GACA,OAAA4F,MAAA2gB,QAAA15B,GACAA,EAAAg0B,IAAA,SAAA8vC,EAAA9qE,GAEA,OAAA25E,EAAA7O,EAAA3wD,EAAAqqC,OAAAxkD,MAIA,IAAAwU,EACAyL,EAAAjZ,GACA,IAAAwN,EACAyL,EAAAjZ,EAAAmT,GAGA8F,EAAAjZ,EAAAmT,EAAAmR,GAKAquD,CAAAruD,EAAA,IAGA9qB,EAAA2I,KAAA,MACA3I,EAAA8vD,QAvEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,IAAAl4B,EAAAk4B,EAAA,MAAA,CACAkmB,kBAAAS,EACAR,mBAAA,SAAAt4E,EAAAkf,GACA,OAAAlf,EAAAi6B,IAAA/a,MAKA,OAFA+a,EAAAgqC,WAAA/iE,EAEA+4B,uDCrCA,aAEA,IAAAlsB,EAAApP,EAAA,sBAAAoP,UAEAgyD,EAAAphE,EAAA,qBAAAohE,OA8HAtgE,EAAA2I,KAAA,OACA3I,EAAA8vD,QA7HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAmCAkhE,EAAA1N,EAAA,OAAA,CACA8Q,GAAA,WACA,MAAA,UAAAzuD,EAAA89C,OAAA6yC,EAAA,IAAAA,EAAA,GAAA,YAIAC,iCAAA,SAAAlrE,GAGA,GAAA,iBAFAA,EAAAA,EAAAv6B,OAAA,GAKA,MAAA,UAAA6U,EAAA89C,OACA6yC,EAAAjrE,GAEAirE,EAAAjrE,EAAA,WALA,IAAAg+B,EAAAh+B,EAAAhrB,MACA,OAAAi2F,EAAAjrE,EAAAg+B,IAOAl5C,MAAAmmF,EACAr0B,OAAA,SAAA52C,GACA,IAAAg+B,EAAAh+B,EAAAm7D,UACA,OAAA8P,EAAAjrE,EAAAz0B,UAAAyyD,IAEAmtC,yBAAA,SAAAnrE,EAAAg+B,GACA,OAAAitC,EAAAjrE,EAAAz0B,UAAAyyD,MAKA,OAFA2H,EAAAoE,WAAA/iE,EAEA2+D,EASA,SAAAslC,EAAAjrE,EAAAg+B,GACA,IAEArhB,EA0BA,SAAA3c,GACA,IAAAorE,GAAA,EAOA,OANAprE,EAAA/gB,QAAA,SAAAlT,EAAAmT,EAAA3P,GACAyvC,EAAA6b,YAAA9uD,KACAq/F,GAAA,EACA77F,EAAA2P,GAAAnT,EAAAgL,cAGAq0F,EApCArS,CAAA/4D,GAEA,IAAAgf,EAAA0d,UAAA,GAAA,EAIA,GAkCA,SAAA18B,GACAA,EAAA/gB,QAAA,SAAAlT,GACA,GAAA,iBAAAA,IAAA8H,EAAA9H,IAAAA,EAAA,EACA,MAAA,IAAA3G,MAAA,2DAvCAimG,CAAArrE,GAEAg+B,EAAA,CAEA,IAAA7sD,EAAAinD,EAAA4F,GAEA,OAAA,EAAAh+B,EAAAv6B,OACA0L,EAAA00D,OAAA7lC,EAAA2c,GAGAxrC,EAGA,IAAA5B,EAAA,GAEA,OAAA,EAAAywB,EAAAv6B,OACAogE,EAAAt2D,EAAAywB,EAAA2c,GAGAptC,sHCxGA,aAEA,IAAAsE,EAAApP,EAAA,sBAAAoP,UA8IAtO,EAAA2I,KAAA,kBACA3I,EAAA8vD,QA7IA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAoQ,EAAA9P,EAAA9zD,EAAA,uBACAgD,EAAA8wD,EAAA9zD,EAAA,mBACA6mG,EAAA/yC,EAAA9zD,EAAA,0BAEA,SAAAg5D,EAAAt4D,EAAAkB,GACA,OAAAilG,EAAAnmG,EAAAkB,GAoCA,OAAA4xD,EAAA,kBAAA,CACAszC,yBAAA,SAAAzlG,EAAAsI,GACA,OAAAo9F,EAAA1lG,EAAAsI,EAAAk9F,IAEAG,iCAAA,SAAA3lG,EAAAsI,EAAAuJ,GACA,GAAA,QAAAA,EACA,OAAA6zF,EAAA1lG,EAAAsI,EAAAk9F,GACA,GAAA,SAAA3zF,EACA,OAAA6zF,EAAA1lG,EAAAsI,EAAAqvD,GAEA,MAAA,IAAAr4D,MAAA,2CAGAsmG,mCAAAF,IAGA,SAAAA,EAAA1lG,EAAAsI,EAAAuJ,GACA,IAAA9D,EAAAzF,IAAAA,EAAA,EACA,MAAA,IAAAhJ,MAAA,oCAGA,GAAA45C,EAAA+b,SAAAj1D,GAAA,CAGA,GAAA,EAFAA,EAAAk6B,OAEAv6B,OACA,MAAA,IAAAL,MAAA,2CAGA,OAAAumG,EAAA7lG,EAAAyF,UAAA6C,EAAAuJ,GAGA,GAAAmN,MAAA2gB,QAAA3/B,GACA,OAAA6lG,EAAA7lG,EAAAsI,EAAAuJ,GAeA,SAAAg0F,EAAAp8F,EAAAnB,EAAAuJ,GACA,GAAAvJ,GAAAmB,EAAA9J,OACA,MAAA,IAAAL,MAAA,mBAIA,IAAA,IAAAL,EAAA,EAAAA,EAAAwK,EAAA9J,OAAAV,IACA,GAAAsjE,EAAA94D,EAAAxK,KAAA0C,EAAA8H,EAAAxK,IACA,OAAAwK,EAAAxK,GAOA,IAHA,IAAAy3D,EAAA,EACAC,EAAAltD,EAAA9J,OAAA,EAEA+2D,EAAAC,GAAA,CAKA,IAJA,IAAA/3D,EAAA83D,EACAhuD,EAAAiuD,EACA6lB,EAAA/yE,EAAAxJ,KAAAiF,MAAAjF,KAAAmV,UAAAuhD,EAAAD,EAAA,IAAAA,GAEA93D,EAAA8J,GAEA,GAAA,GAAAmJ,EAAApI,EAAA7K,GAAA49E,GAAA,CAEA,IAAA/5E,EAAAgH,EAAAf,GACAe,EAAAf,GAAAe,EAAA7K,GACA6K,EAAA7K,GAAA6D,IACAiG,QAGA9J,EAKA,EAAAiT,EAAApI,EAAA7K,GAAA49E,MACA59E,EAIA0J,GAAA1J,EACA+3D,EAAA/3D,EAEA83D,EAAA93D,EAAA,EAIA,OAAA6K,EAAAnB,iIC5IA,aA4QA7I,EAAA2I,KAAA,QACA3I,EAAA8vD,QA3QA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAyiE,EAAA3O,EAAA9zD,EAAA,0BACAuiE,EAAAzO,EAAA9zD,EAAA,yBACA0iE,EAAA5O,EAAA9zD,EAAA,4BACAwiE,EAAA1O,EAAA9zD,EAAA,2BACAmnG,EAAA,IAAA5sD,EAAA0d,UAAA,GACAmvC,EAAA,IAAA7sD,EAAA0d,UAAA,GA6CAjU,EAAAwP,EAAA,QAAA,CAGAp4B,OAAAisE,EACA3lB,kBAAA2lB,EACAtU,iBAAA,SAAAtiD,EAAAW,GACA,OAAAk2D,EAAAC,EAAA92D,EAAAW,EAAA,KAEAo2D,yBAAA,SAAA/2D,EAAAW,EAAAqH,GACA,OAAA6uD,EAAAC,EAAA92D,EAAAW,EAAAqH,KAEAgvD,0BAAA,SAAAh3D,EAAAW,EAAAs2D,GACA,OAAAJ,EAAAI,EAAAC,EAAAl3D,EAAAW,EAAA,GAAAm2D,EAAA92D,EAAAW,EAAA,KAEAw2D,kCAAA,SAAAn3D,EAAAW,EAAAqH,EAAAivD,GACA,OAAAJ,EAAAI,EAAAC,EAAAl3D,EAAAW,EAAAqH,GAAA8uD,EAAA92D,EAAAW,EAAAqH,KAEAw6C,uBAAA,SAAAxiD,EAAAW,GACA,OAAAk2D,EAAAO,EAAAp3D,EAAAW,EAAAg2D,KAEAU,kCAAA,SAAAr3D,EAAAW,EAAAqH,GACA,OAAA6uD,EAAAO,EAAAp3D,EAAAW,EAAAqH,KAEAsvD,gCAAA,SAAAt3D,EAAAW,EAAAs2D,GACA,OAAAJ,EAAAI,EAAAM,EAAAv3D,EAAAW,EAAAg2D,GAAAS,EAAAp3D,EAAAW,EAAAg2D,KAEAa,2CAAA,SAAAx3D,EAAAW,EAAAqH,EAAAivD,GACA,OAAAJ,EAAAI,EAAAM,EAAAv3D,EAAAW,EAAAqH,GAAAovD,EAAAp3D,EAAAW,EAAAqH,OAKA,OAFAuL,EAAAshB,WAAA/iE,EAEAyhD,EAEA,SAAAsjD,EAAAx8F,GACA,MAAA,UAAA+K,EAAA89C,OAAA7oD,EAAA6oD,EAAA7oD,GAGA,SAAAu8F,EAAAv9F,EAAA49F,GACA,IAAAznG,EA2IA,SAAA6J,GACA,IAEAo+F,EAFAp+F,EAAAoY,MAAA,KAEAoZ,IAAA,SAAA33B,GAEA,OAAAnB,OAAAmB,KAMA,GAJAukG,EAAA97C,KAAA,SAAAn8C,GACA,OAAAjN,MAAAiN,KAIA,OAAA,KAGA,OAAAi4F,EAAAlnG,QACA,KAAA,EACA,MAAA,CACAyvC,MAAAy3D,EAAA,GACA92D,IAAA82D,EAAA,GACAzvD,KAAA,GAGA,KAAA,EACA,MAAA,CACAhI,MAAAy3D,EAAA,GACA92D,IAAA82D,EAAA,GACAzvD,KAAAyvD,EAAA,IAGA,QACA,OAAA,MA1KAtuC,CAAA9vD,GAEA,IAAA7J,EACA,MAAA,IAAAyB,YAAA,WAAAoI,EAAA,uBAKA,MAAA,cAAA+L,EAAA+uB,OAEA0iE,GADAI,EAAAM,EAAAH,GACA,IAAAttD,EAAA0d,UAAAh4D,EAAAwwC,OAAA,IAAA8J,EAAA0d,UAAAh4D,EAAAmxC,KAAA,IAAAmJ,EAAA0d,UAAAh4D,EAAAw4C,QAGA6uD,GADAI,EAAAC,EAAAJ,GACAtnG,EAAAwwC,MAAAxwC,EAAAmxC,IAAAnxC,EAAAw4C,OAaA,SAAA8uD,EAAA92D,EAAAW,EAAAqH,GACA,IAAA7sB,EAAA,GACAvqB,EAAAovC,EAEA,GAAA,EAAAgI,EACA,KAAAgqB,EAAAphE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,GAAAo3C,OAEA,GAAAA,EAAA,EACA,KAAA8pB,EAAAlhE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,GAAAo3C,EAIA,OAAA7sB,EAYA,SAAA+7E,EAAAl3D,EAAAW,EAAAqH,GACA,IAAA7sB,EAAA,GACAvqB,EAAAovC,EAEA,GAAA,EAAAgI,EACA,KAAAiqB,EAAArhE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,GAAAo3C,OAEA,GAAAA,EAAA,EACA,KAAA+pB,EAAAnhE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,GAAAo3C,EAIA,OAAA7sB,EAYA,SAAAi8E,EAAAp3D,EAAAW,EAAAqH,GACA,IAAA7sB,EAAA,GACAvqB,EAAAovC,EAEA,GAAAgI,EAAAjrC,GAAA25F,GACA,KAAA1kC,EAAAphE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,EAAAA,EAAAyB,KAAA21C,QAEA,GAAAA,EAAA/oC,GAAAy3F,GACA,KAAA5kC,EAAAlhE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,EAAAA,EAAAyB,KAAA21C,GAIA,OAAA7sB,EAYA,SAAAo8E,EAAAv3D,EAAAW,EAAAqH,GACA,IAAA7sB,EAAA,GACAvqB,EAAAovC,EAEA,GAAAgI,EAAAjrC,GAAA25F,GACA,KAAAzkC,EAAArhE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,EAAAA,EAAAyB,KAAA21C,QAEA,GAAAA,EAAA/oC,GAAAy3F,GACA,KAAA3kC,EAAAnhE,EAAA+vC,IACAxlB,EAAAtb,KAAAjP,GACAA,EAAAA,EAAAyB,KAAA21C,GAIA,OAAA7sB,uLC3NA,aAEA,IAAAA,EAAA5rB,EAAA,qBAgEAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QA/DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAoP,EAAA0kD,EAAA9zD,EAAA,uBAsCAqhE,EAAA7N,EAAA,UAAA,CACA6+B,gBAAA,SAAAhxF,EAAA8mG,GACA,OAAA9mG,EAAAggE,QACAhgE,EAAAggE,QAAA8mC,GAEAx0C,EAAA/nC,EAAAy1C,QAAAhgE,EAAAyF,UAAAqhG,KAGAhW,eAAA,SAAA9wF,EAAA8mG,GAMA,OALAA,EAAA3tF,QAAA,SAAA+gB,GACA,IAAAnsB,EAAAmsB,GACA,MAAA,IAAAsB,UAAA,+BAAAtB,KAGA3P,EAAAy1C,QAAAhgE,EAAA8mG,MAKA,OAFA9mC,EAAAiE,WAAA/iE,EAEA8+D,qHC/DA,aAEA,IAAAhJ,EAAAr4D,EAAA,8BAEA+0D,EAAA/0D,EAAA,8BAEAoP,EAAApP,EAAA,sBAAAoP,UAEAmqD,EAAAv5D,EAAA,sBAAAu5D,OAEA7yD,EAAA1G,EAAA,sBAAA0G,MAEAklB,EAAA5rB,EAAA,qBA+HAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QA9HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCA6BAohE,EAAA,SAAA//D,EAAAk6B,EAAA2c,GACA,GAAA,IAAA7hC,UAAArV,QAAA,IAAAqV,UAAArV,OACA,MAAA,IAAA+zD,EAAA,SAAA1+C,UAAArV,OAAA,EAAA,GAeA,GAZAu5C,EAAA+b,SAAA/6B,KACAA,EAAAA,EAAAz0B,WAGAyzC,EAAA6b,YAAA76B,EAAA,MAEAA,EAAAA,EAAAD,IAAA,SAAAh0B,GACA,OAAAizC,EAAA6b,YAAA9uD,GAAAA,EAAAgL,WAAAhL,KAKAizC,EAAA+b,SAAAj1D,GAEA,OAAAA,EAAA+/D,OAAA7lC,EAAA2c,GAAA,GAGA,GAAA,iBAAA72C,EAEA,OAoCA,SAAAyI,EAAAyxB,EAAA6sE,GACA,QAAA7lG,IAAA6lG,GACA,GAAA,iBAAAA,GAAA,IAAAA,EAAApnG,OACA,MAAA,IAAA67B,UAAA,kDAGAurE,EAAA,IAGA,GAAA,IAAA7sE,EAAAv6B,OACA,MAAA,IAAAq3D,EAAA98B,EAAAv6B,OAAA,GAGA,IAAAmL,EAAAovB,EAAA,GAEA,GAAA,iBAAApvB,IAAAiD,EAAAjD,GACA,MAAA,IAAA0wB,UAAA,uDAAA08B,EAAAh+B,GAAA,KAGA,GAAAzxB,EAAA9I,OAAAmL,EACA,OAAArC,EAAA2L,UAAA,EAAAtJ,GACA,GAAArC,EAAA9I,OAAAmL,EAAA,CAGA,IAFA,IAAA3G,EAAAsE,EAEAxJ,EAAA,EAAA45E,EAAA/tE,EAAArC,EAAA9I,OAAAV,EAAA45E,EAAA55E,IACAkF,GAAA4iG,EAGA,OAAA5iG,EAEA,OAAAsE,EAlEAu+F,CAAAhnG,EAAAk6B,EAAA2c,GAIA,IAAA6qD,GAAA1iF,MAAA2gB,QAAA3/B,IAAA,UAAAwU,EAAA89C,OAEA,GAAA,IAAAp4B,EAAAv6B,OAAA,CAEA,KAAAqf,MAAA2gB,QAAA3/B,IACAA,EAAAA,EAAA,GAGA,OAAAqF,EAAArF,GAGAgf,MAAA2gB,QAAA3/B,KACAA,EAAA,CAAAA,IAGAA,EAAAqF,EAAArF,GACA,IAAAmE,EAAAomB,EAAAw1C,OAAA//D,EAAAk6B,EAAA2c,GACA,OAAA6qD,EAAApvC,EAAAnuD,GAAAA,GAMA,OAFA47D,EAAAkE,WAAA/iE,EAEA6+D,uOC/FA,aAEA,IAAAx1C,EAAA5rB,EAAA,qBA+CAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QA9CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAyBAu7B,EAAAi4B,EAAA,OAAA,CACA2e,OAAA,SAAA9wE,GAEA,OAAAsyD,EAAAtyD,EAAAk6B,SAEAlb,MAAAuL,EAAA2P,KACAH,OAAA,SAAA/5B,GACA,MAAA,UAAAwU,EAAA89C,OAAA,CAAAtyD,EAAAL,QAAA2yD,EAAA,CAAAtyD,EAAAL,UAEAsnG,uDAAA,SAAAjnG,GAEA,MAAA,UAAAwU,EAAA89C,OAAA,GAAAA,EAAA,OAKA,OAFAp4B,EAAA+pC,WAAA/iE,EAEAg5B,4FC9CA,aAEA,IAAAA,EAAAv7B,EAAA,qBAAAu7B,KA4HAz6B,EAAA2I,KAAA,OACA3I,EAAA8vD,QA3HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAuoG,EAAAz0C,EAAA9zD,EAAA,0BAEAwoG,EAAA,SAAA9nG,EAAAkB,GACA,OAAA2mG,EAAA7nG,EAAAkB,IAGAugE,EAAArO,EAAA9zD,EAAA,iCAiCAuvC,EAAAikB,EAAA,OAAA,CACAnzC,MAAA,SAAAhf,GAGA,OAFAonG,EAAApnG,GAEAA,EAAAkuC,KAAAg5D,IAEAp2B,OAAA,SAAA9wE,GAGA,OAFAqnG,EAAArnG,GAEAsyD,EAAAtyD,EAAAif,UAAAivB,KAAAg5D,GAAAlnG,EAAAq1F,YAEAhd,kBAAA,SAAAr4E,EAAAsnG,GAGA,OAFAF,EAAApnG,GAEAA,EAAAkuC,KAAAo5D,IAEAhvB,mBAAA,SAAAt4E,EAAAsnG,GAGA,OAFAD,EAAArnG,GAEAsyD,EAAAtyD,EAAAif,UAAAivB,KAAAo5D,GAAAtnG,EAAAq1F,YAEAiN,gBAAA,SAAAtiG,EAAAyuC,GAGA,OAFA24D,EAAApnG,GAEAA,EAAAkuC,KAAAo5D,EAAA74D,KAEAg0D,iBAAA,SAAAziG,EAAAyuC,GAGA,OAFA44D,EAAArnG,GAEAsyD,EAAAtyD,EAAAif,UAAAivB,KAAAo5D,EAAA74D,IAAAzuC,EAAAq1F,cAWA,SAAAiS,EAAA74D,GACA,GAAA,QAAAA,EACA,OAAAy4D,EACA,GAAA,SAAAz4D,EACA,OAAA04D,EACA,GAAA,YAAA14D,EACA,OAAAqyB,EAEA,MAAA,IAAAxhE,MAAA,+CAWA,SAAA8nG,EAAA78E,GACA,GAAA,IAAA2P,EAAA3P,GAAA5qB,OACA,MAAA,IAAAL,MAAA,kCAWA,SAAA+nG,EAAA/0C,GACA,GAAA,IAAAA,EAAAp4B,OAAAv6B,OACA,MAAA,IAAAL,MAAA,mCAIA,OA9CA4uC,EAAA+1B,WAAA/iE,EA8CAgtC,2JC3HA,aAEA,IAAA3jB,EAAA5rB,EAAA,qBAEAgoE,EAAAhoE,EAAA,qBAEAo7B,EAAAp7B,EAAA,sBAmGAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QAlGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1xD,EAAAgyD,EAAA9zD,EAAA,sBACAqD,EAAAywD,EAAA9zD,EAAA,sBACAqkD,EAAAyP,EAAA9zD,EAAA,2BACA6D,EAAAiwD,EAAA9zD,EAAA,uBACAqT,EAAAygD,EAAA9zD,EAAA,2BACAghE,EAAAlN,EAAA9zD,EAAA,kBACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAmK,EAAA2pD,EAAA9zD,EAAA,sBACAstC,EAAAwmB,EAAA9zD,EAAA,eAuBAs/D,EAAA9L,EAAA,QAAA,CACAwQ,iBAAA,SAAA1oD,GACA,IAAAigB,EAAAgf,EAAA+b,SAAAh7C,GAAAA,EAAAigB,OAAA3P,EAAA2P,KAAAjgB,GAEA,OAAAigB,EAAAv6B,QACA,KAAA,EAEA,GAAA,IAAAu6B,EAAA,GACA,OAAA13B,EAAAyX,GAEA,MAAA,IAAAm9C,WAAA,gCAAAr9B,EAAAm+B,OAAAh+B,GAAA,KAGA,KAAA,EAKA,GAHAA,EAAA,KACAA,EAAA,GAGA,OAoBA,SAAAjgB,GACA,IAAAgC,EACAsrF,EAAA,EACAC,EAAAvtF,EACAwtF,EAAAx7D,EAAA/R,EAAAjgB,IAEA,EAAA,CACA,IAAAytF,EAAAF,EAKA,GAJAA,EAAAxkD,EAAA,GAAAhhD,EAAA0lG,EAAA/nC,EAAA8nC,KACAA,EAAAzkD,EAAA,GAAAhhD,EAAAylG,EAAA9nC,EAAA+nC,KACAzrF,EAAAnT,EAAArI,EAAAuR,EAAAw1F,EAAAE,KAEAC,EAAA1rF,KAAAsrF,EAAAK,EACA,MAAA,IAAAtoG,MAAA,8EAEAqoG,EAAA1rF,GAEA,OAAAurF,EArCAK,CAAA5tF,GAEA,MAAA,IAAAm9C,WAAA,gCAAAr9B,EAAAm+B,OAAAh+B,GAAA,SAMA0tE,EAAA,IACAD,EAAA,KAkCA,OAHA1pC,EAAAgG,MAAA,CACArkE,EAAA,eAAA6jD,OAAAkjB,EAAApC,UAAA,IAAA,mBAEAtG,0TCtGA,aAEA,IAAAvxC,EAAA/tB,EAAA,sBAEA4rB,EAAA5rB,EAAA,qBAqDAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QApDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCA+BAshE,EAAA9N,EAAA,UAAA,CACAnzC,MAAA,SAAAhf,GACA,OAAAuqB,EAAA01C,QAAAvzC,EAAArnB,MAAArF,KAEA8wE,OAAA,SAAA9wE,GACA,IAAAmE,EAAAomB,EAAA01C,QAAAjgE,EAAAif,WAEA,OAAAD,MAAA2gB,QAAAx7B,GAAAmuD,EAAAnuD,GAAAA,GAEA2+D,IAAA,SAAA9iE,GAEA,OAAA0sB,EAAArnB,MAAArF,MAKA,OAFAigE,EAAAgE,WAAA/iE,EAEA++D,qHCtDA,aAEA,IAAA56D,EAAA1G,EAAA,sBAAA0G,MAEAyiG,EAAAnpG,EAAA,qBAAAmpG,cAEAlvC,EAAAj6D,EAAA,uBAAAi6D,gBAEAC,EAAAl6D,EAAA,uBAAAk6D,gBAEA7B,EAAAr4D,EAAA,8BA6KA,SAAAopG,EAAAr7E,EAAAtT,GACA,GAAA,IAAAA,EAAA8gB,OAAAv6B,OACA,MAAA,IAAAq3D,EAAA59C,EAAA8gB,OAAA,GAGA,IAAA/iB,EAAAiC,EAAA4uF,UAAA,GAEA,GAAA,iBAAA7wF,EACA,MAAA,IAAAqkB,UAAA,2DAGA,OAAAo9B,EAAAlsC,EAAAvV,GAYA,SAAA8wF,EAAAv7E,EAAAtT,EAAA8uF,GACA,GAAA,IAAA9uF,EAAA8gB,OAAAv6B,OACA,MAAA,IAAAq3D,EAAA59C,EAAA8gB,OAAA,GAGA,IAAA/iB,EAAAiC,EAAA4uF,UAAA,GAEA,GAAA,iBAAA7wF,EACA,MAAA,IAAAqkB,UAAA,2DAIA,IAAA2sE,EAAA9iG,EAAAqnB,GAEA,OADAmsC,EAAAsvC,EAAAhxF,EAAA+wF,GACAC,EAGA1oG,EAAA2I,KAAA,SACA3I,EAAA8vD,QApNA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAoCAuhE,EAAA/N,EAAA,SAAA,CAEAi2C,eAAA,SAAAniG,EAAAmT,GACA,IACA8mD,EADA5N,EAAArsD,GACAi6D,OAAA9mD,GAEA,OAAAA,EAAAivF,WAAAnoC,EAAAA,EAAAz6D,WAEA6iG,gBAAA,SAAAriG,EAAAmT,GACA,OAAAnT,EAAAi6D,OAAA9mD,IAEAmvF,gBAAAR,EACAS,gBA6BA,SAAA//F,EAAA2Q,GACA,IAAA8/B,EAAAlX,QAAA5oB,GAEA,MAAA,IAAAoiB,UAAA,kBAGA,GAAA,IAAApiB,EAAA8gB,OAAAv6B,OACA,MAAA,IAAAq3D,EAAA59C,EAAA8gB,OAAAv6B,OAAA,GAIA,IAAA8oG,EAAAhgG,EAAA9I,OACAmoG,EAAA1uF,EAAAvQ,MAAA,GAAA4/F,GACAX,EAAA1uF,EAAAtQ,MAAA,GAAA2/F,GACA,IAAA9lD,EAAAvpC,EAAA4uF,UAAA,GACAp0B,EAAA,GAIA,OAHAjxB,EAAAxpC,QAAA,SAAAzE,GACAk/D,GAAAnrE,EAAAmB,OAAA8K,KAEAk/D,GA9CA80B,oBAAA,SAAAziG,EAAAmT,EAAA8uF,GACA,OAAA51C,EAAAjtD,EAAAY,IAAAi6D,OAAA9mD,EAAA8uF,OAAAhnG,GAAAuE,WAEAkjG,yBAAA,SAAA1iG,EAAAmT,EAAA8uF,EAAArxD,GACA,OAAAyb,EAAAjtD,EAAAY,IAAAi6D,OAAA9mD,EAAA8uF,EAAArxD,GAAApxC,WAEAmjG,qBAAA,SAAA3iG,EAAAmT,EAAA8uF,GACA,OAAAjiG,EAAAZ,QAAA66D,OAAA9mD,EAAA8uF,IAEAW,0BAAA,SAAA5iG,EAAAmT,EAAA8uF,EAAArxD,GACA,OAAA5wC,EAAAZ,QAAA66D,OAAA9mD,EAAA8uF,EAAArxD,IAEAiyD,wBAAAC,EACAC,gCAAAD,EACAE,qBAAAhB,IAIA,OAFA/nC,EAAA+D,WAAA/iE,EAEAg/D,EA0CA,SAAA6oC,EAAAtgG,EAAA2Q,EAAA8uF,EAAArxD,GACA,IAAAz9B,IAAA,IAAAA,EAAA4oB,QAEA,MAAA,IAAAxG,UAAA,kBAGA,GAAA,IAAApiB,EAAA8gB,OAAAv6B,OACA,MAAA,IAAAq3D,EAAA59C,EAAA8gB,OAAAv6B,OAAA,GAGA,QAAAuB,IAAA21C,GACA,GAAA,iBAAAA,GAAA,IAAAA,EAAAl3C,OACA,MAAA,IAAA67B,UAAA,kDAGAqb,EAAA,IAGA,IAAA8L,EAAAvpC,EAAA4uF,UAAA,GAGA,GAFArlD,EAAAzoB,OAAA,KAEAguE,EAAAvoG,OACA,MAAA,IAAAq3D,EAAArU,EAAAzoB,OAAA,GAAAguE,EAAAvoG,QAIA,IAAA8oG,EAAAhgG,EAAA9I,OACAmoG,EAAA1uF,EAAAvQ,MAAA,IACAi/F,EAAA1uF,EAAAtQ,MAAA,IAIA,IAFA,IAAAmuC,EAAA,GAEAh4C,EAAA,EAAAA,EAAAwpG,EAAAxpG,IACAg4C,EAAAh4C,GAAAwJ,EAAAmB,OAAA3K,GAOA,GAJA0jD,EAAAxpC,QAAA,SAAAzE,EAAAzV,GACAg4C,EAAAviC,GAAAwzF,EAAAt+F,OAAA3K,EAAA,MAGAg4C,EAAAt3C,OAAA8oG,EACA,IAAA,IAAArlB,EAAAqlB,EAAA,EAAAS,EAAAjyD,EAAAt3C,OAAAyjF,EAAA8lB,EAAA9lB,IACAnsC,EAAAmsC,KACAnsC,EAAAmsC,GAAAvsC,GAKA,OAAAI,EAAA1vB,KAAA,kLC3KA,aAEA,IAAAliB,EAAA1G,EAAA,sBAAA0G,MAEA6yD,EAAAv5D,EAAA,sBAAAu5D,OAwIAz4D,EAAA2I,KAAA,QACA3I,EAAA8vD,QAvIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAqD,EAAAywD,EAAA9zD,EAAA,sBA6BAwhE,EAAAhO,EAAA,QAAA,CACAnzC,MAAA,SAAAhf,GAEA,OAAAmpG,EAAA72C,EAAAtyD,KAEAy5E,aA6CA,SAAApuE,GAEA,IAAAkgB,EAAAlgB,EAAAuvE,QACAxhE,EAAA/N,EAAA8R,OACA09D,EAAAxvE,EAAAyvE,KACA5gD,EAAA7uB,EAAAuuE,MAEArD,EAAAr8C,EAAA,GACA2/C,EAAA3/C,EAAA,GAEA,GAAAq8C,IAAAsD,EAkCA,MAAA,IAAAziB,WAAA,gCAAAc,EAAAh+B,GAAA,KAhCA,IAAAtmB,EAAA,EAEA,GAAA,EAAA2X,EAAA5rB,OAEA,IAAA,IAAA4J,EAAA,EAAAA,EAAAswE,EAAAtwE,IAKA,IAHA,IAAAiyE,EAAAX,EAAAtxE,GACAkyE,EAAAZ,EAAAtxE,EAAA,GAEAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAAma,EAAA9Q,GAEA,GAAArJ,IAAAsK,EAAA,CAEAqK,EAAA5R,EAAA4R,EAAA2X,EAAAjjB,IAEA,MAGA,GAAAiB,EAAAtK,EAEA,MAOA,OAAA2U,GArFAkjD,YAAAqyC,EACArmC,IAAAz9D,IAGA,SAAA8jG,EAAA99F,GAEA,IAAA6uB,EAAA7uB,EAAAuuE,MACAr4C,EAAAl2B,EAAAyuE,MAEA,OAAA5/C,EAAAv6B,QACA,KAAA,EAEA,GAAA,IAAAu6B,EAAA,GAEA,OAAA70B,EAAAk8B,EAAA,IAGA,MAAA,IAAA61B,WAAA,gCAAAc,EAAAh+B,GAAA,KAEA,KAAA,EAEA,IAAAq8C,EAAAr8C,EAAA,GAGA,GAAAq8C,IAFAr8C,EAAA,GAcA,MAAA,IAAAk9B,WAAA,gCAAAc,EAAAh+B,GAAA,KARA,IAFA,IAAAtmB,EAAA,EAEA3U,EAAA,EAAAA,EAAAs3E,EAAAt3E,IACA2U,EAAA5R,EAAA4R,EAAA2tB,EAAAtiC,GAAAA,IAIA,OAAA2U,EAKA,QAEA,MAAA,IAAAwjD,WAAA,yCAAAc,EAAAh+B,GAAA,MAsDA,OAHAimC,EAAA8D,MAAA,CACArkE,EAAA,yCAEAugE,8ICzIA,aAEA,IAAA96D,EAAA1G,EAAA,sBAAA0G,MAEA6yD,EAAAv5D,EAAA,sBAAAu5D,OAkLAz4D,EAAA2I,KAAA,YACA3I,EAAA8vD,QAjLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACAm4D,EAAA5d,EAAA4d,YACA2iB,EAAAvgC,EAAAugC,aAwBArZ,EAAAjO,EAAA,YAAA,CACAnzC,MAAA,SAAAhf,GAEA,OAAAogE,EAAA9N,EAAAtyD,IAAAyF,WAEAqrE,OAAA,SAAA9wE,GAEA,IAEAb,EAFA+6B,EAAAl6B,EAAAk6B,OAIA,OAAAA,EAAAv6B,QACA,KAAA,EAEAR,EAAAa,EAAAqF,QACA,MAEA,KAAA,EAEA,IAAAkxE,EAAAr8C,EAAA,GACA2/C,EAAA3/C,EAAA,GAEA,GAAA,IAAA2/C,EAEA,MAAA,IAAAziB,WAAA,uDAAAc,EAAAh+B,GAAA,KAIA,OAAAl6B,EAAAq1F,WACA,IAAA,QACAl2F,EAuBA,SAAAkM,EAAAkrE,EAAAsD,GAOA,IALA,IAGAuvB,EAHA7nE,EAAAl2B,EAAAyuE,MAEAuvB,EAAA,GAGA9/F,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA6/F,EAAAC,EAAA9/F,GAAA,GAEA,IAAA,IAAAtK,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEAmqG,EAAAnqG,GAAAoG,EAAAk8B,EAAAtiC,GAAAsK,IAKA,OAAA,IAAAutD,EAAA,CACAv1B,KAAA8nE,EACAnvE,KAAA,CAAA2/C,EAAAtD,GACA4T,SAAA9+E,EAAA++E,YA5CAkf,CAAAtpG,EAAAu2E,EAAAsD,GACA,MAEA,IAAA,SACA16E,EA4CA,SAAAkM,EAAAkrE,EAAAsD,GAYA,IAVA,IAeAr6E,EAAAg7E,EAAAjxE,EAfAgiB,EAAAlgB,EAAAuvE,QACAxhE,EAAA/N,EAAA8R,OACA09D,EAAAxvE,EAAAyvE,KAEAgU,EAAAvjE,EAAA,QAAArqB,EACAwqF,EAAA,GACAC,EAAA,GAEAjjF,EAAA,GAEA1I,EAAA,EAAAA,EAAAu2E,EAAAv2E,IACA0I,EAAA1I,GAAA,EAMA,IAAAR,EAAA,EAAAg7E,EAAAphE,EAAAzZ,OAAAH,EAAAg7E,EAAAh7E,IAEAkJ,EAAA0Q,EAAA5Z,MAMA,IAFA,IAAAoU,EAAA,EAEA3U,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEA0sF,EAAA18E,KAAA2E,GAEAA,GAAAlL,EAAAzJ,GAEAyJ,EAAAzJ,GAAA0sF,EAAA1sF,GAMA,IAFA0sF,EAAA18E,KAAA2E,GAEArK,EAAA,EAAAA,EAAAswE,EAAAtwE,IAEA,IAAA,IAAAiyE,EAAAX,EAAAtxE,GAAAkyE,EAAAZ,EAAAtxE,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAAgH,EAAA5G,EAAA0Q,EAAA9Q,MAEAojF,EAAAp8E,GAAA/F,EAEAgiB,IACAujE,EAAAx/E,GAAAjK,EAAAkmB,EAAAjjB,KAMA,OAAA,IAAAmxE,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAA2/C,EAAAtD,GACA4T,SAAA9+E,EAAA++E,YAvGAmf,CAAAvpG,EAAAu2E,EAAAsD,GAIA,MAEA,QAEA,MAAA,IAAAziB,WAAA,qDAAAc,EAAAr2D,KAAA+3E,OAAA,KAGA,OAAAz6E,GAGA2jE,IAAA,SAAA9iE,GACA,OAAAqF,EAAArF,MA+FA,OAHAogE,EAAA6D,MAAA,CACArkE,EAAA,4BAAA6jD,OAAAkjB,EAAApC,UAAA,YAEAnE,8ICnLA,aAEA,IAAAryD,EAAApP,EAAA,sBAAAoP,UAEAgyD,EAAAphE,EAAA,qBAAAohE,OA6HAtgE,EAAA2I,KAAA,QACA3I,EAAA8vD,QA5HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAiCA0hE,EAAAlO,EAAA,QAAA,CACA8Q,GAAA,WACA,MAAA,UAAAzuD,EAAA89C,OAAAk3C,EAAA,IAAAA,EAAA,GAAA,YAIApE,iCAAA,SAAAlrE,GAGA,GAAA,iBAFAA,EAAAA,EAAAv6B,OAAA,GAKA,MAAA,UAAA6U,EAAA89C,OACAk3C,EAAAtvE,GAEAsvE,EAAAtvE,EAAA,WALA,IAAAg+B,EAAAh+B,EAAAhrB,MACA,OAAAs6F,EAAAtvE,EAAAg+B,IAOAl5C,MAAAwqF,EACA14B,OAAA,SAAA52C,GACA,IAAAg+B,EAAAh+B,EAAAm7D,UACA,OAAAmU,EAAAtvE,EAAAz0B,UAAAyyD,IAEAmtC,yBAAA,SAAAnrE,EAAAg+B,GACA,OAAAsxC,EAAAtvE,EAAAz0B,UAAAyyD,MAKA,OAFAmI,EAAA4D,WAAA/iE,EAEAm/D,EASA,SAAAmpC,EAAAtvE,EAAAg+B,GACA,IAEArhB,EA0BA,SAAA3c,GACA,IAAAorE,GAAA,EAOA,OANAprE,EAAA/gB,QAAA,SAAAlT,EAAAmT,EAAA3P,GACAyvC,EAAA6b,YAAA9uD,KACAq/F,GAAA,EACA77F,EAAA2P,GAAAnT,EAAAgL,cAGAq0F,EApCArS,CAAA/4D,GAEA,IAAAgf,EAAA0d,UAAA,GAAA,EAIA,GAkCA,SAAA18B,GACAA,EAAA/gB,QAAA,SAAAlT,GACA,GAAA,iBAAAA,IAAA8H,EAAA9H,IAAAA,EAAA,EACA,MAAA,IAAA3G,MAAA,4DAvCAimG,CAAArrE,GAEAg+B,EAAA,CAEA,IAAA7sD,EAAAinD,EAAA4F,GAEA,OAAA,EAAAh+B,EAAAv6B,OACA0L,EAAA00D,OAAA7lC,EAAA2c,GAGAxrC,EAGA,IAAA5B,EAAA,GAEA,OAAA,EAAAywB,EAAAv6B,OACAogE,EAAAt2D,EAAAywB,EAAA2c,GAGAptC,sHCtGA,aAEA,IAAAsE,EAAApP,EAAA,sBAAAoP,UAEAk0F,EAAAtjG,EAAA,aAwFA,SAAA8qG,EAAA3qG,GACA,OAAAA,EAAAiP,aAAAjP,EAAAuN,IAAA,GAGA5M,EAAA2I,KAAA,eACA3I,EAAA8vD,QA3FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAmO,EAAAnO,EAAA,eAAA,CACAu/B,iBAAA,SAAA5yF,EAAAwJ,GACA,IAAAohG,EAEA,IAAA37F,EAAAjP,IAAAA,EAAA,EACA,MAAA,IAAA08B,UAAA,4DAGA,IAAAztB,EAAAzF,IAAAA,EAAA,EACA,MAAA,IAAAkzB,UAAA,4DAGA,GAAA18B,EAAAwJ,EACA,MAAA,IAAAkzB,UAAA,qCAKA,OAAAlzB,GAFAohG,EAAA5qG,EAAAwJ,GAGA25F,EAAA,EAAAyH,EAAA5qG,GACAmjG,EAAA,EAAA35F,GAGA25F,EAAA35F,EAAA,EAAAxJ,GACAmjG,EAAA,EAAAyH,IAEA9X,uBAAA,SAAA9yF,EAAAwJ,GACA,IAAAQ,EAAA+P,EAAA5Z,EAAA45E,EACAtsE,EAAA,IAAA2sC,EAAA0d,UAAA,GAEA,IAAA6yC,EAAA3qG,KAAA2qG,EAAAnhG,GACA,MAAA,IAAAkzB,UAAA,4DAGA,GAAAlzB,EAAA6D,GAAArN,GACA,MAAA,IAAA08B,UAAA,kDAOA,IAJA1yB,EAAAhK,EAAA4C,MAAA4G,GACAA,EAAA+F,GAAAvF,KAAAA,EAAAR,GAGArJ,EAFA4Z,EAAAtM,EAEAssE,EAAA/5E,EAAA4C,MAAAoH,GAAA7J,EAAAoO,IAAAwrE,GAAA55E,EAAAA,EAAAwC,KAAA,GACAoX,EAAAA,EAAA7N,MAAAlC,EAAArH,KAAAxC,IAAA8M,UAAA9M,GAGA,OAAA4Z,KAOA,OAHAynD,EAAA2D,MAAA,CACAwtB,EAAA,mCAEAnxB,qECnFA,aAEA,IAAA5M,EAAA/0D,EAAA,8BAEAu6E,EAAAv6E,EAAA,uCAEA6gD,EAAA7gD,EAAA,sBAAA6gD,SAqSA//C,EAAA2I,KAAA,eACA3I,EAAA8vD,QAlSA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAAM,EAAAG,EAAA9zD,EAAA,sCAEA4rB,EAAA5rB,EAAA,qBAGAgrG,EAAAl3C,EAAA9zD,EAAA,gBAyBA,SAAAirG,EAAAxhG,GACA,IAAAyhG,EAAAtzF,eAAAnO,GACA,MAAA,IAAA9I,MAAA,wBAAA8I,GAGA,IAAAqL,EAAAuL,MAAAld,UAAA4J,MAAAhM,KAAAsV,UAAA,GAEA,OAAA,SAAA40F,GAyHA,SAAAE,EAAAC,EAAAxmE,EAAAymE,GACA,IAAAC,OAAA,IAAA1mE,EAMA,GAJA0mE,IACA1mE,EAAA,GAGA2V,EAAA+b,SAAA80C,GACAA,EAAAA,EAAAtkG,eACA,IAAAuZ,MAAA2gB,QAAAoqE,GACA,MAAA,IAAAvuE,UAAA,oDAGA,GAAA,EAAAjR,EAAA2P,KAAA6vE,GAAApqG,OACA,MAAA,IAAAL,MAAA,0CAGA,IAAA4qG,EAAA,EAEA,QAAA,IAAAF,EAAA,CACA,GAAAA,EAAArqG,SAAAoqG,EAAApqG,OACA,MAAA,IAAAL,MAAA,kDAGA,IAAA,IAAAL,EAAA,EAAA6L,EAAAk/F,EAAArqG,OAAAV,EAAA6L,EAAA7L,IAAA,CACA,IAAAugD,EAAAwqD,EAAA/qG,KAAA+qG,EAAA/qG,GAAA,EACA,MAAA,IAAAK,MAAA,gDAGA4qG,GAAAF,EAAA/qG,IAIA,IAAAU,EAAAoqG,EAAApqG,OAEA,GAAA,IAAAA,EACA,MAAA,GACA,GAAAA,GAAA4jC,EACA,OAAA,EAAAA,EAAAwmE,EAAAA,EAAA,GAMA,IAHA,IACAxuE,EADA1iB,EAAA,GAGAA,EAAAlZ,OAAA4jC,GAAA,CACA,QAAA,IAAAymE,EACAzuE,EAAAwuE,EAAA9pG,KAAAiF,MAAAykG,IAAAhqG,SAIA,IAFA,IAAAwqG,EAAAR,IAAAO,EAEA9mB,EAAA,EAAA8lB,EAAAa,EAAApqG,OAAAyjF,EAAA8lB,EAAA9lB,IAGA,IAFA+mB,GAAAH,EAAA5mB,IAEA,EAAA,CACA7nD,EAAAwuE,EAAA3mB,GACA,OAKA,IAAAvqE,EAAAlP,QAAA4xB,IACA1iB,EAAA5J,KAAAssB,GAIA,OAAA0uE,EAAApxF,EAAA,GAAAA,EAGA,SAAAuxF,EAAAvhG,EAAAC,GACA,OAAAD,EAAA+gG,KAAA9gG,EAAAD,GAGA,SAAAwhG,EAAAxhG,EAAAC,GACA,OAAA7I,KAAAiF,MAAA2D,EAAA+gG,KAAA9gG,EAAAD,IAIA,SAAAyhG,EAAApwE,EAAArxB,EAAAC,EAAAyhG,GACA,IAAAhpE,EAAA,GAGA,GAAA,GAFArH,EAAAA,EAAAxuB,MAAA,IAEA/L,OACA,IAAA,IAAAV,EAAA,EAAAU,EAAAu6B,EAAA/qB,QAAAlQ,EAAAU,EAAAV,IACAsiC,EAAAtyB,KAAAq7F,EAAApwE,EAAArxB,EAAAC,EAAAyhG,SAGA,IAAA,IAAAjnB,EAAA,EAAAknB,EAAAtwE,EAAA/qB,QAAAm0E,EAAAknB,EAAAlnB,IACA/hD,EAAAtyB,KAAAs7F,EAAA1hG,EAAAC,IAIA,OAAAy4B,EAGA,MArNA,CACAnsB,OAAA,SAAA+pE,EAAAsrB,EAAAlY,GACA,IAAAr4D,EAAArxB,EAAAC,EAEA,GAAA,EAAAkM,UAAArV,OACA,MAAA,IAAA+zD,EAAA,SAAA1+C,UAAArV,OAAA,EAAA,GAyBA,GAxBA,IAAAqV,UAAArV,OAEAu5E,EAAAiG,GACAjlD,EAAAilD,EAEAr2E,EAAAq2E,EAMAr2E,EAJA,IAAAkM,UAAArV,QAEAu5E,EAAAiG,GACAjlD,EAAAilD,EAGAt2E,EAAAs2E,EAFAsrB,IAOAvwE,EAAAilD,EACAt2E,EAAA4hG,EACAlY,QAIArxF,IAAA2H,IAAA22C,EAAA32C,SAAA3H,IAAA4H,IAAA02C,EAAA12C,GACA,MAAA,IAAA0yB,UAAA,uCAMA,QAHAt6B,IAAA4H,IAAAA,EAAA,QACA5H,IAAA2H,IAAAA,EAAA,QAEA3H,IAAAg5B,EAMA,OAAAkwE,EAAAvhG,EAAAC,GALA,IAAA3E,EAAAmmG,EAAApwE,EAAAz0B,UAAAoD,EAAAC,EAAAshG,GAEA,OAAAlxD,EAAA+b,SAAA/6B,GAAAo4B,EAAAnuD,GAAAA,GAKA08D,UAAA1O,EAAA,CACAu4C,iBAAA,SAAApoG,GAGA,GAAA42E,EAAA52E,GAAA,CACA,IAAA43B,EAAA53B,EAGA6B,EAAAmmG,EAAApwE,EAAAz0B,UANA,EAIA,EAEA4kG,GAEA,OAAAnxD,EAAA+b,SAAA/6B,GAAAo4B,EAAAnuD,GAAAA,EAGA,OAAAkmG,EAXA,EAUA/nG,IAIAqoG,yBAAA,SAAAxrB,EAAAsrB,GACA,GAAAvxB,EAAAiG,GAAA,CACA,IAAAjlD,EAAAilD,EACAr2E,EAAA2hG,EAGAtmG,EAAAmmG,EAAApwE,EAAAz0B,UAFA,EAEAqD,EAAAuhG,GAEA,OAAAnxD,EAAA+b,SAAA/6B,GAAAo4B,EAAAnuD,GAAAA,EAIA,OAAAkmG,EAFAlrB,EACAsrB,IAIAG,wBAAA,SAAA1wE,EAAArxB,EAAAC,GACA,IAAA3E,EAAAmmG,EAAApwE,EAAAz0B,UAAAoD,EAAAC,EAAAuhG,GAEA,OAAAnwE,IAAA,IAAAA,EAAA+6B,SAAA3C,EAAAnuD,GAAAA,KAGAy8D,WAAAzO,EAAA,CACAnzC,MAAA,SAAA+qF,GACA,OAAAD,EAAAC,IAEAc,wBAAA,SAAAd,EAAAU,GACA,IAAAlnE,EAAAymE,EAEA,GAAAhrF,MAAA2gB,QAAA8qE,GACAT,EAAAS,MACA,CAAA,IAAAjrD,EAAAirD,GAGA,MAAA,IAAAjvE,UAAA,2CAFA+H,EAAAknE,EAKA,OAAAX,EAAAC,EAAAxmE,EAAAymE,IAEAc,wCAAA,SAAAf,EAAAU,EAAAlY,GACA,IAAAhvD,EAAAymE,EAUA,GANAzmE,EAFAvkB,MAAA2gB,QAAA8qE,IACAT,EAAAS,EACAlY,IAEAyX,EAAAzX,EACAkY,IAGAzrF,MAAA2gB,QAAAqqE,KAAAxqD,EAAAjc,GACA,MAAA,IAAA/H,UAAA,2CAGA,OAAAsuE,EAAAC,EAAAxmE,EAAAymE,OApHA,CADAH,EAAAzhG,GAAAmR,MAAA1X,KAAA4R,IA8NA,IAAAo2F,EAAA,CACAkB,QAAA,WACA,OAAApB,GAMAqB,OAAA,WACA,OAAA,WAMA,IALA,IAAAnuB,EACAouB,EACAC,GAAA,EAGAA,EAAA,GAAA,EAAAA,GACAruB,EAAA8sB,IACAsB,EAAAtB,IACAuB,EAAA,EAAA,EAAAjrG,KAAAoC,KAAA,EAAApC,KAAAU,IAAAk8E,GAAA,IAAA58E,KAAAW,IAAA,EAAAX,KAAA2C,GAAAqoG,GAAA,GAGA,OAAAC,KAMA,OAFAtB,EAAA3lC,WAAA/iE,EAEA0oG,iNCxSA,aAEA,IAAAlnC,EAAA/jE,EAAA,kCAuDAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QAtDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqO,EAAA/N,EAAA9zD,EAAA,YAEAgoE,EAAAhoE,EAAA,qBAyBA4hE,EAAApO,EAAA,YAAA,CACA5uB,OAAA,SAAAzkC,GACA,GAAAA,EAAA,EACA,MAAA,IAAAQ,MAAA,8BAGA,OAAAkhE,EAAA1hE,EAAA,IAEA83D,UAAA,SAAA93D,GACA,GAAAA,EAAAmP,aACA,MAAA,IAAA3O,MAAA,8BAGA,OAAAkhE,EAAA1hE,EAAA2C,KAAA,KAEAkhE,iBAAA,SAAA7jE,GACA,OAAA4jE,EAAA5jE,EAAAyhE,MAMA,OAHAA,EAAA0D,MAAA,CACArkE,EAAA,4BAAA6jD,OAAAkjB,EAAApC,UAAA,YAEAhE,uGCtDA,aAEA,IAAAmC,EAAA/jE,EAAA,kCAEAoP,EAAApP,EAAA,sBAAAoP,UAuKA,IACAvO,EAAA,CAAA,kBAAA,mBAAA,kBAAA,oBAAA,kBAAA,qBAAA,sBAAA,qBAAA,sBAAA,sBAAA,uBAAA,qBAAA,sBAAA,sBAAA,uBACAC,EAAA2I,KAAA,QACA3I,EAAA8vD,QAxKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnP,EAAAyP,EAAA9zD,EAAA,2BACA0D,EAAAowD,EAAA9zD,EAAA,sBAEAsjG,EAAAtjG,EAAA,aA0BA6hE,EAAArO,EAAA,QAAA,CACA5uB,OAAA,SAAAzkC,GACA,IAAAC,EAAAiB,EAEA,GAAA+N,EAAAjP,GACA,OAAAA,GAAA,EACAsC,SAAAtC,GAAA4E,EAAAA,EAAAmC,IAGA,IAAA/G,EACA4E,EAAAA,EAGAu+F,EAAA,EAAAnjG,EAAA,GAGA,GAAAA,EAAA,GACA,OAAAmB,KAAA2C,IAAA3C,KAAAqB,IAAArB,KAAA2C,GAAA9D,GAAA0hE,EAAA,EAAA1hE,IAGA,GAAA,QAAAA,EACA,OAAA4E,EAAAA,EAGA,GAAA,GAAA5E,EAAA,CAEA,IAAAqsG,EAAArsG,EAAAA,EACAssG,EAAAD,EAAArsG,EACAusG,EAAAD,EAAAtsG,EACAwsG,EAAAD,EAAAvsG,EACA,OAAAmB,KAAAuC,KAAA,EAAAvC,KAAA2C,GAAA9D,GAAAmB,KAAAoC,IAAAvD,EAAAmB,KAAA2F,EAAA9G,IAAA,EAAA,GAAA,GAAAA,GAAA,GAAA,IAAAqsG,GAAA,KAAA,MAAAC,GAAA,KAAA,QAAAC,GAAA,QAAA,UAAAC,GAAA,SAAA,YAAAA,EAAAxsG,MAGAA,EACAkB,EAAAR,EAAA,GAEA,IAAA,IAAAP,EAAA,EAAAA,EAAAO,EAAAG,SAAAV,EACAe,GAAAR,EAAAP,IAAAH,EAAAG,GAIA,OADAF,EAAAD,EA+FA,UA/FA,GACAmB,KAAAuC,KAAA,EAAAvC,KAAA2C,IAAA3C,KAAAoC,IAAAtD,EAAAD,EAAA,IAAAmB,KAAAC,KAAAnB,GAAAiB,GAEAqB,QAAA,SAAAvC,GACA,IAAAC,EAAAiB,EAEA,GAAA,IAAAlB,EAAAmC,GACA,OAAAu/D,EAAA1hE,EAAAkC,IAGAlC,EAAA,IAAAo6C,EAAA73C,QAAAvC,EAAAkC,GAAA,EAAAlC,EAAAmC,IACAjB,EAAA,IAAAk5C,EAAA73C,QAAA7B,EAAA,GAAA,GAEA,IAAA,IAAAP,EAAA,EAAAA,EAAAO,EAAAG,SAAAV,EAAA,CACA,IAAAssG,EAAAzsG,EAAAkC,GAAA/B,EAEAw8F,EAAA8P,EAAAA,EAAAzsG,EAAAmC,GAAAnC,EAAAmC,GAEA,GAAAw6F,GACAz7F,EAAAgB,IAAAxB,EAAAP,GAAAssG,EAAA9P,EACAz7F,EAAAiB,KAAAzB,EAAAP,GAAAH,EAAAmC,GAAAw6F,GAEAz7F,EAAAgB,GAAAxB,EAAAP,GAAA,GAAA,EAAA,EAAAyE,EAAAA,EAIA3E,EAAA,IAAAm6C,EAAA73C,QAAAvC,EAAAkC,GAqEA,UArEA,GAAAlC,EAAAmC,IACA,IAAAuqG,EAAAvrG,KAAAuC,KAAA,EAAAvC,KAAA2C,IACA9D,EAAAkC,IAAA,GACA,IAAA6X,EAAAxW,EAAAtD,EAAAD,GAEA,IAAA+Z,EAAA5X,GAEA4X,EAAA7X,IAAAwqG,GACA,IAAA3yF,EAAA7X,KAGA6X,EAAA7X,IAAAwqG,GAFA3yF,EAAA5X,IAAAuqG,GAMA,IAAA5sG,EAAAqB,KAAAC,KAAAnB,EAAAiC,IAIA,OAFAjC,EAAAiC,GAAApC,EAAAqB,KAAAW,KAAA7B,EAAAkC,IACAlC,EAAAkC,GAAArC,EAAAqB,KAAAqB,KAAAvC,EAAAkC,IACA+hD,EAAAA,EAAAnqC,EAAA9Z,GAAAiB,IAEA42D,UAAA,SAAA93D,GACA,GAAAA,EAAAiP,YACA,OAAAjP,EAAAmP,cAAAnP,EAAA4G,SAAA,IAAAwzC,EAAA0d,UAAAlzD,EAAAA,GAmBA,SAAA5E,GACA,GAAAA,EAAA4G,SACA,OAAA,IAAAwzC,EAAA0d,UAAA,GAUA,IAPA,IAAAhwD,EAAA4N,EAAA5N,WAAA,EAAA3G,KAAAU,IAAA7B,EAAAmS,aAIA9M,EAAA,IAHA+0C,EAAA0d,UAAAvxD,MAAA,CACAuB,UAAAA,IAEA,CAAA9H,GACAmH,EAAAnH,EAAAmS,WAAA,EAEA,EAAAhL,GACA9B,EAAAA,EAAA6G,MAAA/E,GACAA,IAGA,OAAA,IAAAizC,EAAA0d,UAAAzyD,EAAAmN,YAAA4nC,EAAA0d,UAAAhwD,YApCA6kG,CAAA3sG,EAAA4C,MAAA,IAGA,IAAA5C,EAAAsC,WACA,OAAA,IAAA83C,EAAA0d,UAAA93D,EAAAmP,aAAApI,IAAAnC,EAAAA,GAGA,MAAA,IAAApE,MAAA,+BAEAqjE,iBAAA,SAAA7jE,GACA,OAAA4jE,EAAA5jE,EAAA0hE,MAgCA,OAHAA,EAAAyD,MAAA,CACArkE,EAAA,oCAEA4gE,+JCvKA,aAEA3gE,EAAAJ,QAAA,CACAd,EAAA,kBAAAA,EAAA,eAAAA,EAAA,WAAAA,EAAA,kBAAAA,EAAA,iBAAAA,EAAA,kBAAAA,EAAA,gBAAAA,EAAA,YAAAA,EAAA,gNCHA,aAqFAc,EAAA2I,KAAA,eACA3I,EAAA8vD,QApFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAgN,EAAA8mD,EAAA9zD,EAAA,yBACAiV,EAAA6+C,EAAA9zD,EAAA,sBACAqkD,EAAAyP,EAAA9zD,EAAA,2BACA6+D,EAAA/K,EAAA9zD,EAAA,4BACAgC,EAAA8xD,EAAA9zD,EAAA,sBACA4jE,EAAA9P,EAAA9zD,EAAA,uBAiCA,SAAA+sG,EAAAp8F,EAAA9P,GACA,IAAAmsG,EAAAnsG,EAAA06B,OAAAv6B,OACAisG,EAAAt8F,EAAA4qB,OAAAv6B,OAEA,GAAA,EAAAgsG,EACA,MAAA,IAAArsG,MAAA,wCAGA,GAAA,EAAAssG,EACA,MAAA,IAAAtsG,MAAA,yCAGA,GAAAqsG,IAAAC,EACA,MAAA,IAAAtsG,MAAA,uCAMA,GAAA,IAFAsU,EAAAtE,GAGA,MAAA,IAAAhQ,MAAA,oDAKA,GAAA,IAFAsU,EAAApU,GAGA,MAAA,IAAAF,MAAA,qDAGA,IAAAusG,EAAAlgG,EAAA2D,EAAAsE,EAAAtE,IACAw8F,EAAAngG,EAAAnM,EAAAoU,EAAApU,IACAqZ,EAAAjF,EAAAovC,EAAA6oD,EAAAlrG,EAAA68D,EAAAquC,EAAAC,MAEA,OAAAvpC,EAAA1pD,GACAA,EAEA1X,OAAA0E,IAIA,OAvDAssD,EAAA,eAAA,CACA2+B,eAAA,SAAAxhF,EAAA9P,GACA,OAAAksG,EAAAp5C,EAAAhjD,GAAAgjD,EAAA9yD,KAEAwxF,gBAAA,SAAA1hF,EAAA9P,GACA,OAAAksG,EAAAp8F,EAAAgjD,EAAA9yD,KAEAuxF,gBAAA,SAAAzhF,EAAA9P,GACA,OAAAksG,EAAAp5C,EAAAhjD,GAAA9P,IAEAo1F,iBAAA,SAAAtlF,EAAA9P,GACA,OAAAksG,EAAAp8F,EAAA9P,uOCtCA,aAEA,IAAAusG,EAAAptG,EAAA,sCAgDAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QA/CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAqkD,EAAAyP,EAAA9zD,EAAA,2BACAgN,EAAA8mD,EAAA9zD,EAAA,yBACA4hE,EAAA9N,EAAA9zD,EAAA,6BACAoP,EAAA0kD,EAAA9zD,EAAA,uBACAuP,EAAAukD,EAAA9zD,EAAA,wBAuBA,OAAAwzD,EAAA,cAAA,CACAwQ,iBAAA,SAAAtjE,GACA,IAAAuU,EAAA,EACAo4F,EAAA,EASA,OARAD,EAAA1sG,EAAA,SAAA4sG,GACA,IAAAl+F,EAAAk+F,KAAA/9F,EAAA+9F,GACA,MAAA,IAAAzwE,UAAA,2DAGA5nB,EAAA5R,EAAA4R,EAAAq4F,GACAD,EAAAhpD,EAAAgpD,EAAAzrC,EAAA0rC,MAEAtgG,EAAA40D,EAAA3sD,GAAAo4F,2OC7CA,aAEA,IAAAj+F,EAAApP,EAAA,sBAAAoP,UAmFA,SAAA07F,EAAA3qG,GACA,OAAAA,EAAAiP,aAAAjP,EAAAuN,IAAA,GAGA5M,EAAA2I,KAAA,eACA3I,EAAA8vD,QAtFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAoO,EAAA9N,EAAA9zD,EAAA,gBAEAsjG,EAAAtjG,EAAA,aA4BAgiE,EAAAxO,EAAA,eAAA,CACA0oC,qBAAAt6B,EACAmxB,iBAAA,SAAA5yF,EAAAwJ,GACA,IAAAyF,EAAAjP,IAAAA,EAAA,EACA,MAAA,IAAA08B,UAAA,4DAGA,IAAAztB,EAAAzF,IAAAA,EAAA,EACA,MAAA,IAAAkzB,UAAA,4DAGA,GAAA18B,EAAAwJ,EACA,MAAA,IAAAkzB,UAAA,oEAIA,OAAAymE,EAAAnjG,EAAAwJ,EAAA,EAAAxJ,IAEA8yF,uBAAA,SAAA9yF,EAAAwJ,GACA,IAAAuQ,EAAA5Z,EAEA,IAAAwqG,EAAA3qG,KAAA2qG,EAAAnhG,GACA,MAAA,IAAAkzB,UAAA,4DAGA,GAAAlzB,EAAA6D,GAAArN,GACA,MAAA,IAAA08B,UAAA,oEAKA,IAFA3iB,EAAA,IAAAqgC,EAAA0d,UAAA,GAEA33D,EAAAH,EAAA4C,MAAA4G,GAAA7G,KAAA,GAAAxC,EAAAoO,IAAAvO,GAAAG,EAAAA,EAAAwC,KAAA,GACAoX,EAAAA,EAAA7N,MAAA/L,GAGA,OAAA4Z,KAMA,OAFA8nD,EAAAsD,WAAA/iE,EAEAy/D,uFC5EA,aA0CAlhE,EAAA2I,KAAA,aACA3I,EAAA8vD,QAzCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAiCAyO,EAjCAnO,EAAA9zD,EAAA,kBAiCAirG,CAAA,WAAAhpC,WAGA,OAFAA,EAAAqD,WAAA/iE,EAEA0/D,iDCvCA,aAsBA/gE,EAAAJ,QAhBA,SAAAwiG,EAAAhjG,EAAAH,GACA,IAAAotG,EAEA,OAAAptG,EAAAG,EACA,EAGAH,IAAAG,EACAH,EAKAmjG,EAAAhjG,EAFAitG,EAAAptG,EAAAG,GAAA,GAEAgjG,EAAA,EAAAiK,EAAAptG,8BCnBA,aA0CAW,EAAA2I,KAAA,SACA3I,EAAA8vD,QAzCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAiCA/8C,EAjCAq9C,EAAA9zD,EAAA,kBAiCAirG,CAAA,WAAAx0F,OAGA,OAFAA,EAAA6uD,WAAA/iE,EAEAkU,iDCvCA,aAwCA3V,EAAA2I,KAAA,YACA3I,EAAA8vD,QAvCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IA+BA0O,EA/BApO,EAAA9zD,EAAA,kBA+BAirG,CAAA,WAAA/oC,UAGA,OAFAA,EAAAoD,WAAA/iE,EAEA2/D,iDCrCA,aAEA,IAAAsrC,EAAAxtG,EAAA,eAQAytG,EAAAD,IA2BA1sG,EAAA8vD,QAzBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAA58C,EAEA,SAAAi3F,EAAAC,GACAl3F,EAAA,OAAAk3F,EAAAF,EAAAD,EAAAn4F,OAAAs4F,IAkBA,OAdAD,EAAA73F,EAAAg+C,YAOAR,EAAAsmC,GAAA,SAAA,SAAAllC,EAAAF,EAAAG,QAEAnyD,IAAAmyD,EAAAb,YAEA65C,EAAAj5C,EAAAZ,cATA,WACA,OAAAp9C,MAeA3V,EAAAuyD,MAAA,6CCtCA,aAEA,IAAA0gC,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAwHAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QAvHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA+1F,EAAAjiC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAuCAkT,EAAAsgD,EAAA,UAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAA/C,IAAA+C,EAAA,EAAAA,EAAA/C,EAAA,GAAA,GAEA0xF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,IAAA+C,GAAA2vF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,SAAA,EAAAtvD,EAAA/C,EAAA,GAAA,GAEA4xF,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAA4L,GAAA7I,IAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,SAAA,IAAAnZ,EAAA0d,UAAA,GAAA,IAAA1d,EAAA0d,UAAA52D,EAAAmK,IAAApH,KAEA8uF,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA,IAAAm2C,EAAAx/B,SAAA1Z,EAAA6R,QAAA9O,KAEA4uF,mBAAA,WACA,MAAA,IAAAn2D,UAAA,wDAEAs2D,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAAuS,EAAA7R,EAAAiG,MAAAlD,EAAAkD,QAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAA2xF,EAAA10F,EAAA+C,EAAA8O,IAEA++E,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAA6R,GAAA,IAEA8+E,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAA8O,GAAA,IAEA6+E,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAA8O,IAEAi/E,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA8O,EAAAygD,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA8O,EAAAygD,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA8O,EAAA7R,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAA8O,GAAA,IAEAo/E,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAA8O,GAAA,IAEAu/E,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAA6R,GAAA,IAEAs/E,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAA6R,GAAA,IAEAw/E,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAA8O,GAAA,GAAApM,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAA6R,GAAA,GAAApM,aAKA,OAFAoM,EAAAoyD,WAAA/iE,EAEA2Q,uVCzHA,aAEA,IAAAuO,EAAAzhB,EAAA,2BAuSAc,EAAA2I,KAAA,iBACA3I,EAAA8vD,QAtSA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA4gC,EAAAtgC,EAAA9zD,EAAA,oBACAkT,EAAA4gD,EAAA9zD,EAAA,cACA6tG,EAAA36F,EAAAkiD,WAAA,mBAsEA+M,EAAA3O,EAAA,iBAAA,CACAo/B,WAAA,SAAAvxF,EAAA+C,GACA,IAEA5D,EAFAstG,EAAA1Z,EAAA/yF,GACA0sG,EAAA3Z,EAAAhwF,GAGA,KAAA,WAAA0pG,GAAA,cAAAA,GAAA,aAAAA,GAAA,WAAAC,GAAA,cAAAA,GAAA,aAAAA,GAGA,MAAA,OAFAvtG,EAAA0S,EAAA7R,EAAA+C,IAEAuC,WAEA,EAAAnG,EAAA,GAAA,EAEAihB,EAAAqsF,EAAAC,GAKA,GAAA,UAAAD,GAAA,WAAAA,GAAA,UAAAC,GAAA,WAAAA,EAGA,OAAA,KAFAvtG,EA6DA,SAAAwtG,EAAA3sG,EAAA+C,GACA,OAAAm2C,EAAAmc,eAAAr1D,IAAAk5C,EAAAmc,eAAAtyD,GACA6pG,EAAA5sG,EAAA2R,SAAA4Z,OAAAxoB,EAAA4O,SAAA4Z,QAGA2tB,EAAAmc,eAAAr1D,GAEA2sG,EAAA3sG,EAAAif,UAAAlc,GAGAm2C,EAAAmc,eAAAtyD,GAEA4pG,EAAA3sG,EAAA+C,EAAAkc,WAIAi6B,EAAAkc,cAAAp1D,GACA2sG,EAAA3sG,EAAA2R,SAAA4vB,KAAAx+B,GAGAm2C,EAAAkc,cAAAryD,GACA4pG,EAAA3sG,EAAA+C,EAAA4O,SAAA4vB,MAIAviB,MAAA2gB,QAAA3/B,GAIAgf,MAAA2gB,QAAA58B,GAIA6pG,EAAA5sG,EAAA+C,GAHA4pG,EAAA3sG,EAAA,CAAA+C,IAJA4pG,EAAA,CAAA3sG,GAAA+C,GAvFA4pG,CAAA3sG,EAAA+C,IAGA5D,EAEAihB,EAAAqsF,EAAAC,GAKA,GAAAD,IAAAC,EACA,OAAAtsF,EAAAqsF,EAAAC,GAGA,GAAA,YAAAD,EACA,OAsKA,SAAAzsG,EAAA+C,GACA,OAAA/C,EAAAgB,GAAA+B,EAAA/B,GACA,EAGAhB,EAAAgB,GAAA+B,EAAA/B,IACA,EAGAhB,EAAAiB,GAAA8B,EAAA9B,GACA,EAGAjB,EAAAiB,GAAA8B,EAAA9B,IACA,EAGA,EAvLA4rG,CAAA7sG,EAAA+C,GAGA,GAAA,SAAA0pG,EACA,OAAAzsG,EAAA+xF,UAAAhvF,GACA+9D,EAAA9gE,EAAAiG,MAAAlD,EAAAkD,OAIA2mG,EAAA5sG,EAAA8sG,cAAA/pG,EAAA+pG,eAGA,GAAA,YAAAL,EACA,OAAAD,EAAAxsG,EAAA+C,GAGA,GAAA,WAAA0pG,EACA,OAAArsF,EAAApgB,EAAA+C,GAGA,GAAA,WAAA0pG,EACA,OA2GA,SAAAzsG,EAAA+C,GACA,IAAAgqG,EAAAhnG,OAAAiT,KAAAhZ,GACAgtG,EAAAjnG,OAAAiT,KAAAjW,GAEAgqG,EAAA7+D,KAAA9tB,GACA4sF,EAAA9+D,KAAA9tB,GACA,IAAAjhB,EAAAytG,EAAAG,EAAAC,GAEA,GAAA,IAAA7tG,EACA,OAAAA,EAIA,IAAA,IAAAF,EAAA,EAAAA,EAAA8tG,EAAAptG,OAAAV,IAAA,CACA,IAAAyV,EAAAosD,EAAA9gE,EAAA+sG,EAAA9tG,IAAA8D,EAAAiqG,EAAA/tG,KAEA,GAAA,IAAAyV,EACA,OAAAA,EAIA,OAAA,EAhIAu4F,CAAAjtG,EAAA+C,GAGA,GAAA,SAAA0pG,EACA,OAAA,EAGA,GAAA,cAAAA,EACA,OAAA,EAIA,MAAA,IAAAjxE,UAAA,8BAAAixE,EAAA,QA6DA,SAAAG,EAAA5sG,EAAA+C,GAEA,IAAA,IAAA9D,EAAA,EAAA45E,EAAA54E,KAAA4I,IAAA7I,EAAAL,OAAAoD,EAAApD,QAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAAyV,EAAAosD,EAAA9gE,EAAAf,GAAA8D,EAAA9D,IAEA,GAAA,IAAAyV,EACA,OAAAA,EAKA,OAAA1U,EAAAL,OAAAoD,EAAApD,OACA,EAGAK,EAAAL,OAAAoD,EAAApD,QACA,EAIA,EAsCA,OApHAmhE,EAAAmD,WAAA/iE,EAoHA4/D,8FCvQA,aAgGArhE,EAAA2I,KAAA,cACA3I,EAAA8vD,QA/FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCAEA40D,EAAAd,EAAA9zD,EAAA,oBAEA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA8BAoiE,EAAA5O,EAAA,cAAA,CACAo/B,WAAA2b,EACAxc,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAmqG,IAEApc,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAg+D,EAAAzO,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAg+D,EAAAzO,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAg+D,EAAA/gE,EAAAsyD,EAAAvvD,KAEAkuF,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAmqG,GAAA,IAEA/b,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAktG,GAAA,IAEA7b,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAmqG,GAAA,GAAAznG,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAktG,GAAA,GAAAznG,aAWA,SAAAynG,EAAAltG,EAAA+C,GAEA,IAAAm2C,EAAAuG,SAAAz/C,GACA,MAAA,IAAAw7B,UAAA,qGAAA+3B,EAAAvzD,GAAA,eAGA,IAAAk5C,EAAAuG,SAAA18C,GACA,MAAA,IAAAy4B,UAAA,qGAAA+3B,EAAAxwD,GAAA,eAGA,OAAA/C,IAAA+C,EAAA,EAAAA,EAAA/C,EAAA,GAAA,EAKA,OAFA+gE,EAAAkD,WAAA/iE,EAEA6/D,8KC7FA,aA8EAthE,EAAA2I,KAAA,YACA3I,EAAA8vD,QA7EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA6b,EAAAvb,EAAA9zD,EAAA,YA+BAqiE,EAAA7O,EAAA,YAAA,CACAo/B,WAAA,SAAAvxF,EAAA+C,GACA,OAaA,SAAAoqG,EAAAntG,EAAA+C,GACA,GAAAic,MAAA2gB,QAAA3/B,GAAA,CACA,GAAAgf,MAAA2gB,QAAA58B,GAAA,CACA,IAAA+H,EAAA9K,EAAAL,OAEA,GAAAmL,IAAA/H,EAAApD,OACA,OAAA,EAGA,IAAA,IAAAV,EAAA,EAAAA,EAAA6L,EAAA7L,IACA,IAAAkuG,EAAAntG,EAAAf,GAAA8D,EAAA9D,IACA,OAAA,EAIA,OAAA,EAEA,OAAA,EAGA,OAAA+f,MAAA2gB,QAAA58B,IAGAirE,EAAAhuE,EAAA+C,GApCAoqG,CAAAntG,EAAAyF,UAAA1C,EAAA0C,cAKA,OAFAu7D,EAAAiD,WAAA/iE,EAEA8/D,0CCzCA,aAkIAvhE,EAAA2I,KAAA,QACA3I,EAAA8vD,QAjIA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACA66E,EAAA/mB,EAAA9zD,EAAA,kBACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAEAgoE,EAAAhoE,EAAA,qBA+CAqvE,EAAA7b,EAAA,QAAA,CACAo/B,WAAA,SAAAvxF,EAAA+C,GAEA,OAAA,OAAA/C,EACA,OAAA+C,EAGA,OAAAA,EACA,OAAA/C,OAGAkB,IAAAlB,OACAkB,IAAA6B,OAGA7B,IAAA6B,OACA7B,IAAAlB,EAGAw5E,EAAAx5E,EAAA+C,IAEA8tF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAy2E,IAEAoX,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAw5E,GAAA,IAEAmX,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAy2E,GAAA,IAEAkX,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAy2E,IAEAsX,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAirE,EAAA1b,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAirE,EAAA1b,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAirE,EAAAhuE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAy2E,GAAA,IAEAyX,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAy2E,GAAA,IAEA4X,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAw5E,GAAA,IAEA2X,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAw5E,GAAA,IAEA6X,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAy2E,GAAA,GAAA/zE,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAw5E,GAAA,GAAA/zE,aAMA,OAHAuoE,EAAA/J,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,MAAA,uBAEAyJ,kUC/HA,aAEA,IAAA0kB,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAsCAc,EAAA8vD,QApCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GASA,IAAAqnB,EAAArnB,EAAA,cAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAA/C,IAAA+C,GAEA2uF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,IAAA+C,GAAA2vF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,UAEAu/B,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAA4L,GAAA7I,IAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,UAEAw/B,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAoF,OAAArC,IAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAoF,OAAArC,IAEA+uF,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAAk6E,EAAAx5E,EAAAiG,MAAAlD,EAAAkD,UAGA,OAAAuzE,6FCvCA,aA0CA/5E,EAAA2I,KAAA,YACA3I,EAAA8vD,QAzCA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA4O,EAAAtO,EAAA9zD,EAAA,kBACA+G,EAAA+sD,EAAA9zD,EAAA,oBA4BAsiE,EAAA9O,EAAA,YAAA,CACAo/B,WAAA,SAAAvxF,EAAA+C,GACA,OAAA2C,EAAAq7D,EAAA/gE,EAAA+C,OAKA,OAFAk+D,EAAAgD,WAAA/iE,EAEA+/D,sECvCA,aAEAphE,EAAAJ,QAAA,CAAAd,EAAA,aAAAA,EAAA,oBAAAA,EAAA,iBAAAA,EAAA,eAAAA,EAAA,WAAAA,EAAA,eAAAA,EAAA,YAAAA,EAAA,cAAAA,EAAA,aAAAA,EAAA,eAAAA,EAAA,sOCFA,aAEA,IAAA+zF,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAsHAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QArHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAEAgoE,EAAAhoE,EAAA,qBAkCAuiE,EAAA/O,EAAA,SAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAAA,EAAA/C,GAEA0xF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAAA,EAAA/C,IAAA0yF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,UAEAu/B,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAmM,GAAApJ,KAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,UAEAw/B,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA,IAAA/C,EAAA6R,QAAA9O,IAEA4uF,mBAAA,WACA,MAAA,IAAAn2D,UAAA,wDAEAs2D,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAA4hE,EAAAlhE,EAAAiG,MAAAlD,EAAAkD,QAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAm+D,IAEA0vB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAkhE,GAAA,IAEAyvB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAm+D,GAAA,IAEAwvB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAm+D,IAEA4vB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAm+D,EAAA5O,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAm+D,EAAA5O,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAm+D,EAAAlhE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAm+D,GAAA,IAEA+vB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAm+D,GAAA,IAEAkwB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAkhE,GAAA,IAEAiwB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAkhE,GAAA,IAEAmwB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAm+D,GAAA,GAAAz7D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAkhE,GAAA,GAAAz7D,aAMA,OAHAy7D,EAAA+C,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,OAAA,uBAEArD,+WCvHA,aAEA,IAAAwxB,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAkHAc,EAAA2I,KAAA,WACA3I,EAAA8vD,QAjHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAEAgoE,EAAAhoE,EAAA,qBA8BAwiE,EAAAhP,EAAA,WAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAAA,GAAA/C,GAEA0xF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAAA,GAAA/C,GAAA0yF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,UAEAu/B,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAqM,IAAAtJ,IAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,UAEAw/B,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA,IAAA/C,EAAA6R,QAAA9O,IAEA4uF,mBAAA,WACA,MAAA,IAAAn2D,UAAA,wDAEAs2D,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAA6hE,EAAAnhE,EAAAiG,MAAAlD,EAAAkD,QAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAo+D,IAEAyvB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAmhE,GAAA,IAEAwvB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAo+D,GAAA,IAEAuvB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAo+D,IAEA2vB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAo+D,EAAA7O,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAo+D,EAAA7O,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAo+D,EAAAnhE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAo+D,GAAA,IAEA8vB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAo+D,GAAA,IAEAiwB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAmhE,GAAA,IAEAgwB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAmhE,GAAA,IAEAkwB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAo+D,GAAA,GAAA17D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAmhE,GAAA,GAAA17D,aAMA,OAHA07D,EAAA8C,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,SAAA,uBAEApD,+WCnHA,aAEA,IAAAuxB,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAsHAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QArHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAEAgoE,EAAAhoE,EAAA,qBAkCAyiE,EAAAjP,EAAA,UAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAA/C,EAAA+C,GAEA2uF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,EAAA+C,IAAA2vF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,UAEAu/B,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAqO,GAAAtL,KAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,UAEAw/B,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA,IAAA/C,EAAA6R,QAAA9O,IAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,MAAA,IAAAy4B,UAAA,wDAEAs2D,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAA8hE,EAAAphE,EAAAiG,MAAAlD,EAAAkD,QAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAq+D,IAEAwvB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAohE,GAAA,IAEAuvB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAq+D,GAAA,IAEAsvB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAq+D,IAEA0vB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAq+D,EAAA9O,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAq+D,EAAA9O,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAq+D,EAAAphE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAq+D,GAAA,IAEA6vB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAq+D,GAAA,IAEAgwB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAohE,GAAA,IAEA+vB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAohE,GAAA,IAEAiwB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAq+D,GAAA,GAAA37D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAohE,GAAA,GAAA37D,aAMA,OAHA27D,EAAA6C,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,QAAA,uBAEAnD,+WCvHA,aAEA,IAAAsxB,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCAkHAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QAjHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAEAgoE,EAAAhoE,EAAA,qBA8BA0iE,EAAAlP,EAAA,YAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAA/C,GAAA+C,GAEA2uF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA/C,GAAA+C,GAAA2vF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,UAEAu/B,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA/C,EAAAqN,IAAAtK,IAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,UAEAw/B,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA,IAAA/C,EAAA6R,QAAA9O,IAEA4uF,mBAAA,WACA,MAAA,IAAAn2D,UAAA,wDAEAs2D,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAA+hE,EAAArhE,EAAAiG,MAAAlD,EAAAkD,QAEA4qF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAs+D,IAEAuvB,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAqhE,GAAA,IAEAsvB,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAs+D,GAAA,IAEAqvB,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAs+D,IAEAyvB,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAs+D,EAAA/O,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAs+D,EAAA/O,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAs+D,EAAArhE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAs+D,GAAA,IAEA4vB,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAs+D,GAAA,IAEA+vB,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAqhE,GAAA,IAEA8vB,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAqhE,GAAA,IAEAgwB,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAs+D,GAAA,GAAA57D,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAqhE,GAAA,GAAA57D,aAMA,OAHA47D,EAAA4C,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,UAAA,uBAEAlD,+WCnHA,aAEA,IAAAqxB,EAAA/zF,EAAA,sBAAA+zF,YAEAC,EAAAh0F,EAAA,qCA0JAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QAzJA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA00F,EAAA5gC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCAEAgoE,EAAAhoE,EAAA,qBA8CA2iE,EAAAnP,EAAA,UAAA,CACAo/B,WAAA,SAAAvxF,EAAA+C,GAEA,OAAA,OAAA/C,EACA,OAAA+C,EAGA,OAAAA,EACA,OAAA/C,OAGAkB,IAAAlB,OACAkB,IAAA6B,OAGA7B,IAAA6B,OACA7B,IAAAlB,EAGAotG,EAAAptG,EAAA+C,IAEA8tF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAswF,EAAArzF,EAAA+C,EAAAqqG,IAEAxc,4BAAA,SAAA5wF,EAAA+C,GACA,OAAAqwF,EAAArwF,EAAA/C,EAAAotG,GAAA,IAEAzc,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAqqG,GAAA,IAEA1c,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAqqG,IAEAtc,eAAA,SAAA9wF,EAAA+C,GAEA,OAAAu+D,EAAAhP,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAAu+D,EAAAhP,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAAu+D,EAAAthE,EAAAsyD,EAAAvvD,KAEAmuF,oBAAA,SAAAlxF,EAAA+C,GACA,OAAAuwF,EAAAtzF,EAAA+C,EAAAqqG,GAAA,IAEAnc,mBAAA,SAAAjxF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAqqG,GAAA,IAEAhc,oBAAA,SAAApxF,EAAA+C,GACA,OAAAuwF,EAAAvwF,EAAA/C,EAAAotG,GAAA,IAEAjc,mBAAA,SAAAnxF,EAAA+C,GACA,OAAA0tF,EAAA1tF,EAAA/C,EAAAotG,GAAA,IAEA/b,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAqqG,GAAA,GAAA3nG,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAotG,GAAA,GAAA3nG,aAIA2nG,EAAAj7C,EAAA,WAAA,CACAo6C,mBAAA,SAAAvsG,EAAA+C,GACA,OAAA/C,IAAA+C,GAEA2uF,iBAAA,SAAA1xF,EAAA+C,GACA,OAAA2vF,EAAA1yF,EAAA+C,EAAAyR,EAAA69C,UAEAu/B,uBAAA,SAAA5xF,EAAA+C,GACA,OAAA4vF,EAAA3yF,EAAA+C,EAAAyR,EAAA69C,UAEAw/B,qBAAA,SAAA7xF,EAAA+C,GACA,OAAA/C,EAAAoF,OAAArC,IAEA4uF,mBAAA,SAAA3xF,EAAA+C,GACA,OAAA/C,EAAAoF,OAAArC,IAEA+uF,aAAA,SAAA9xF,EAAA+C,GACA,IAAA/C,EAAA+xF,UAAAhvF,GACA,MAAA,IAAAzD,MAAA,4CAGA,OAAAgiE,EAAAthE,EAAAiG,MAAAlD,EAAAkD,UAOA,OAHAq7D,EAAA2C,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,QAAA,uBAEAjD,+WC3JA,aAEAzhE,EAAAJ,QAAA,CAAAd,EAAA,kBAAAA,EAAA,mBAAAA,EAAA,iBAAAA,EAAA,kBAAAA,EAAA,iBAAAA,EAAA,qBAAAA,EAAA,iBAAAA,EAAA,aAAAA,EAAA,sBAAAA,EAAA,sPCFA,aAEA,IAAAq6C,EAAAr6C,EAAA,qBAAAq6C,QA0DAv5C,EAAA2I,KAAA,eACA3I,EAAA8vD,QAzDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACAm4D,EAAArE,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACAmiE,EAAArO,EAAA9zD,EAAA,iCAgDA,OA1BAwzD,EAAA,eAAA,CACA0gC,iCAAA,SAAArK,EAAA8kB,GACA,IAAAz0F,EAAA,GAEA,GAAA,IAAAqnD,EAAAhmC,EAAAsuD,GAAA,IAAA6kB,EAAA,KAAA,IAAAntC,EAAAhmC,EAAAozE,GAAA,IAAAD,EAAA,IAAA,CAEA,IAAAE,EAAAv0D,EAAAh6B,MAAA2gB,QAAA6oD,GAAAA,EAAAA,EAAAvpE,WAAAivB,KAAA4yB,GACA0sC,EAAAx0D,EAAAh6B,MAAA2gB,QAAA2tE,GAAAA,EAAAA,EAAAruF,WAAAivB,KAAA4yB,GACAjoD,EAAA,GAEA,IAAA,IAAA5Z,EAAA,EAAAA,EAAAsuG,EAAA5tG,OAAAV,IACA,IAAA,IAAAsK,EAAA,EAAAA,EAAAikG,EAAA7tG,OAAA4J,IACAsP,EAAA5J,KAAA,CAAAs+F,EAAAtuG,GAAAuuG,EAAAjkG,KAMA,OAAAyV,MAAA2gB,QAAA6oD,IAAAxpE,MAAA2gB,QAAA2tE,GACAz0F,EAIA,IAAAi+C,EAAAj+C,+MCtDA,aAEA,IAAAmgC,EAAAr6C,EAAA,qBAAAq6C,QAEAy0D,EAAA9uG,EAAA,qBAAA8uG,SAEAC,EAAA/uG,EAAA,qBAAA+uG,WA2EAjuG,EAAA2I,KAAA,gBACA3I,EAAA8vD,QA1EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACAm4D,EAAArE,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACAmiE,EAAArO,EAAA9zD,EAAA,iCAiEA,OA1CAwzD,EAAA,gBAAA,CACA0gC,iCAAA,SAAArK,EAAA8kB,GACA,IAAAz0F,EAEA,GAAA,IAAAqnD,EAAAhmC,EAAAsuD,GAAA,IAAA6kB,EAAA,IAEAx0F,EAAA,OACA,CAAA,GAAA,IAAAqnD,EAAAhmC,EAAAozE,GAAA,IAAAD,EAAA,IAEA,OAAAr0D,EAAAwvC,EAAAvpE,WAEA,IAGA0uF,EAHAJ,EAAAE,EAAAz0D,EAAAh6B,MAAA2gB,QAAA6oD,GAAAA,EAAAA,EAAAvpE,WAAAivB,KAAA4yB,IACA0sC,EAAAC,EAAAz0D,EAAAh6B,MAAA2gB,QAAA2tE,GAAAA,EAAAA,EAAAruF,WAAAivB,KAAA4yB,IACAjoD,EAAA,GAGA,IAAA,IAAA5Z,EAAA,EAAAA,EAAAsuG,EAAA5tG,OAAAV,IAAA,CACA0uG,GAAA,EAEA,IAAA,IAAApkG,EAAA,EAAAA,EAAAikG,EAAA7tG,OAAA4J,IACA,GAAA,IAAAu3D,EAAAysC,EAAAtuG,GAAAgH,MAAAunG,EAAAjkG,GAAAtD,QAAAsnG,EAAAtuG,GAAAqxE,aAAAk9B,EAAAjkG,GAAA+mE,WAAA,CAEAq9B,GAAA,EACA,MAIAA,GACA90F,EAAA5J,KAAAs+F,EAAAtuG,KAMA,OAAA+f,MAAA2gB,QAAA6oD,IAAAxpE,MAAA2gB,QAAA2tE,GACAI,EAAA70F,GAIA,IAAAi+C,EAAA42C,EAAA70F,gNC3EA,aAEA,IAAAmgC,EAAAr6C,EAAA,qBAAAq6C,QA2DAv5C,EAAA2I,KAAA,cACA3I,EAAA8vD,QA1DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACAm4D,EAAArE,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACAmiE,EAAArO,EAAA9zD,EAAA,iCAiDA,OA5BAwzD,EAAA,cAAA,CACAwQ,iBAAA,SAAAtjE,GACA,IAAAwZ,EAEA,GAAA,IAAAqnD,EAAAhmC,EAAA76B,GAAA,IAAAguG,EAAA,IAEAx0F,EAAA,OACA,CACA,IAAAtY,EAAAy4C,EAAAh6B,MAAA2gB,QAAAtgC,GAAAA,EAAAA,EAAA4f,WAAAivB,KAAA4yB,IACAjoD,EAAA,IACA5J,KAAA1O,EAAA,IAEA,IAAA,IAAAtB,EAAA,EAAAA,EAAAsB,EAAAZ,OAAAV,IACA,IAAA6hE,EAAAvgE,EAAAtB,GAAAsB,EAAAtB,EAAA,KACA4Z,EAAA5J,KAAA1O,EAAAtB,IAMA,OAAA+f,MAAA2gB,QAAAtgC,GACAwZ,EAIA,IAAAi+C,EAAAj+C,+MCvDA,aAEA,IAAAmgC,EAAAr6C,EAAA,qBAAAq6C,QAEAy0D,EAAA9uG,EAAA,qBAAA8uG,SAEAC,EAAA/uG,EAAA,qBAAA+uG,WAiEAjuG,EAAA2I,KAAA,eACA3I,EAAA8vD,QAhEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACAm4D,EAAArE,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACAmiE,EAAArO,EAAA9zD,EAAA,iCAuDA,OAhCAwzD,EAAA,eAAA,CACA0gC,iCAAA,SAAArK,EAAA8kB,GACA,IAAAz0F,EAEA,GAAA,IAAAqnD,EAAAhmC,EAAAsuD,GAAA,IAAA6kB,EAAA,KAAA,IAAAntC,EAAAhmC,EAAAozE,GAAA,IAAAD,EAAA,IAEAx0F,EAAA,OACA,CACA,IAAA00F,EAAAE,EAAAz0D,EAAAh6B,MAAA2gB,QAAA6oD,GAAAA,EAAAA,EAAAvpE,WAAAivB,KAAA4yB,IACA0sC,EAAAC,EAAAz0D,EAAAh6B,MAAA2gB,QAAA2tE,GAAAA,EAAAA,EAAAruF,WAAAivB,KAAA4yB,IACAjoD,EAAA,GAEA,IAAA,IAAA5Z,EAAA,EAAAA,EAAAsuG,EAAA5tG,OAAAV,IACA,IAAA,IAAAsK,EAAA,EAAAA,EAAAikG,EAAA7tG,OAAA4J,IACA,GAAA,IAAAu3D,EAAAysC,EAAAtuG,GAAAgH,MAAAunG,EAAAjkG,GAAAtD,QAAAsnG,EAAAtuG,GAAAqxE,aAAAk9B,EAAAjkG,GAAA+mE,WAAA,CAEAz3D,EAAA5J,KAAAs+F,EAAAtuG,IACA,OAOA,OAAA+f,MAAA2gB,QAAA6oD,IAAAxpE,MAAA2gB,QAAA2tE,GACAI,EAAA70F,GAIA,IAAAi+C,EAAA42C,EAAA70F,gNCjEA,aAEA,IAAAmgC,EAAAr6C,EAAA,qBAAAq6C,QAEAy0D,EAAA9uG,EAAA,qBAAA8uG,SAiEAhuG,EAAA2I,KAAA,cACA3I,EAAA8vD,QAhEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACAmiE,EAAArO,EAAA9zD,EAAA,iCAwDA,OAjCAwzD,EAAA,cAAA,CACA0gC,iCAAA,SAAArK,EAAA8kB,GACA,GAAA,IAAAptC,EAAAhmC,EAAAsuD,GAAA,IAAA6kB,EAAA,IAEA,OAAA,EACA,GAAA,IAAAntC,EAAAhmC,EAAAozE,GAAA,IAAAD,EAAA,IAEA,OAAA,EAOA,IAJA,IAEAM,EAFAJ,EAAAE,EAAAz0D,EAAAh6B,MAAA2gB,QAAA6oD,GAAAA,EAAAA,EAAAvpE,WAAAivB,KAAA4yB,IACA0sC,EAAAC,EAAAz0D,EAAAh6B,MAAA2gB,QAAA2tE,GAAAA,EAAAA,EAAAruF,WAAAivB,KAAA4yB,IAGA7hE,EAAA,EAAAA,EAAAsuG,EAAA5tG,OAAAV,IAAA,CACA0uG,GAAA,EAEA,IAAA,IAAApkG,EAAA,EAAAA,EAAAikG,EAAA7tG,OAAA4J,IACA,GAAA,IAAAu3D,EAAAysC,EAAAtuG,GAAAgH,MAAAunG,EAAAjkG,GAAAtD,QAAAsnG,EAAAtuG,GAAAqxE,aAAAk9B,EAAAjkG,GAAA+mE,WAAA,CAEAq9B,GAAA,EACA,MAIA,IAAA,IAAAA,EACA,OAAA,EAIA,OAAA,0KC/DA,aAEA,IAAA30D,EAAAr6C,EAAA,qBAAAq6C,QAmDAv5C,EAAA2I,KAAA,kBACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2O,EAAArO,EAAA9zD,EAAA,iCACA0uG,EAAA56C,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBA0CA,OAnBAwzD,EAAA,kBAAA,CACAy7C,0DAAA,SAAA/uG,EAAAQ,GACA,GAAA,IAAA6gE,EAAAhmC,EAAA76B,GAAA,IAAAguG,EAAA,IAEA,OAAA,EAMA,IAHA,IAAA9sG,EAAAy4C,EAAAh6B,MAAA2gB,QAAAtgC,GAAAA,EAAAA,EAAA4f,WACAK,EAAA,EAEArgB,EAAA,EAAAA,EAAAsB,EAAAZ,OAAAV,IACA,IAAA6hE,EAAAvgE,EAAAtB,GAAAJ,IACAygB,IAIA,OAAAA,0KC/CA,aAEA,IAAA05B,EAAAr6C,EAAA,qBAAAq6C,QA+EAv5C,EAAA2I,KAAA,cACA3I,EAAA8vD,QA9EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACAmiE,EAAArO,EAAA9zD,EAAA,iCAyCA,OApBAwzD,EAAA,cAAA,CACAwQ,iBAAA,SAAAtjE,GACA,GAAA,IAAA6gE,EAAAhmC,EAAA76B,GAAA,IAAAguG,EAAA,IAEA,MAAA,GAOA,IAJA,IAAA9sG,EAAAy4C,EAAAh6B,MAAA2gB,QAAAtgC,GAAAA,EAAAA,EAAA4f,WAAAivB,KAAA4yB,GACAjoD,EAAA,GACA0qB,EAAA,EAEAA,EAAAj+B,SAAA,GAAA3F,QAAAY,EAAAZ,QACAkZ,EAAA5J,KAAA4+F,EAAAttG,EAAAgjC,EAAAj+B,SAAA,GAAAub,MAAA,IAAAhX,YACA05B,IAIA,OAkBA,SAAAhZ,GAGA,IAFA,IAAA9lB,EAAA,GAEAxF,EAAAsrB,EAAA5qB,OAAA,EAAA,EAAAV,EAAAA,IACA,IAAA,IAAAsK,EAAA,EAAAA,EAAAtK,EAAAsK,IACAghB,EAAAhhB,GAAA5J,OAAA4qB,EAAAhhB,EAAA,GAAA5J,SACA8E,EAAA8lB,EAAAhhB,GACAghB,EAAAhhB,GAAAghB,EAAAhhB,EAAA,GACAghB,EAAAhhB,EAAA,GAAA9E,GAKA,OAAA8lB,EA/BAujF,CAAAj1F,MAKA,SAAAg1F,EAAAtjF,EAAAwjF,GAGA,IAFA,IAAAl1F,EAAA,GAEA5Z,EAAA,EAAAA,EAAA8uG,EAAApuG,OAAAV,IACA,MAAA8uG,EAAA9uG,IACA4Z,EAAA5J,KAAAsb,EAAAtrB,IAIA,OAAA4Z,wKC5DA,aAEA,IAAAmgC,EAAAr6C,EAAA,qBAAAq6C,QAkDAv5C,EAAA2I,KAAA,UACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2O,EAAArO,EAAA9zD,EAAA,iCA4CA,OArBAwzD,EAAA,UAAA,CACAwQ,iBAAA,SAAAtjE,GACA,OAAA2f,MAAA2gB,QAAAtgC,GAAA25C,EAAA35C,GAAAM,OAAAq5C,EAAA35C,EAAA4f,WAAAtf,QAEAquG,0BAAA,SAAA3uG,EAAA0nF,GACA,IAAA,IAAAA,GAAA,IAAA1nF,EAAAM,OACA,OAAAqf,MAAA2gB,QAAAtgC,GAAA25C,EAAA35C,GAAAM,OAAAq5C,EAAA35C,EAAA4f,WAAAtf,OAKA,IAHA,IAAAY,EAAAy4C,EAAAh6B,MAAA2gB,QAAAtgC,GAAAA,EAAAA,EAAA4f,WAAAivB,KAAA4yB,GACAxhD,EAAA,EAEArgB,EAAA,EAAAA,EAAAsB,EAAAZ,OAAAV,IACA,IAAA6hE,EAAAvgE,EAAAtB,GAAAsB,EAAAtB,EAAA,KACAqgB,IAIA,OAAAA,0FC7CA,aAEA,IAAA05B,EAAAr6C,EAAA,qBAAAq6C,QA+CAv5C,EAAA2I,KAAA,mBACA3I,EAAA8vD,QA9CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACA8kD,EAAAgP,EAAA9zD,EAAA,qBACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACA6iE,EAAA/O,EAAA9zD,EAAA,yBAqCA,OAdAwzD,EAAA,mBAAA,CACA0gC,iCAAA,SAAArK,EAAA8kB,GACA,GAAA,IAAAptC,EAAAhmC,EAAAsuD,GAAA,IAAA6kB,EAAA,IAEA,OAAAr0D,EAAAs0D,GACA,GAAA,IAAAptC,EAAAhmC,EAAAozE,GAAA,IAAAD,EAAA,IACA,OAAAr0D,EAAAwvC,GAGA,IAAA+kB,EAAAv0D,EAAAwvC,GACAglB,EAAAx0D,EAAAs0D,GACA,OAAA7pD,EAAA+d,EAAA+rC,EAAAC,GAAAhsC,EAAAgsC,EAAAD,2LC3CA,aAEA,IAAAv0D,EAAAr6C,EAAA,qBAAAq6C,QAgDAv5C,EAAA2I,KAAA,WACA3I,EAAA8vD,QA/CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAk7C,EAAA56C,EAAA9zD,EAAA,kCACA8kD,EAAAgP,EAAA9zD,EAAA,qBACAu7B,EAAAu4B,EAAA9zD,EAAA,mBACAuhE,EAAAzN,EAAA9zD,EAAA,qBACA+iE,EAAAjP,EAAA9zD,EAAA,wBACAojE,EAAAtP,EAAA9zD,EAAA,4BAqCA,OAdAwzD,EAAA,WAAA,CACA0gC,iCAAA,SAAArK,EAAA8kB,GACA,GAAA,IAAAptC,EAAAhmC,EAAAsuD,GAAA,IAAA6kB,EAAA,IAEA,OAAAr0D,EAAAs0D,GACA,GAAA,IAAAptC,EAAAhmC,EAAAozE,GAAA,IAAAD,EAAA,IACA,OAAAr0D,EAAAwvC,GAGA,IAAA+kB,EAAAv0D,EAAAwvC,GACAglB,EAAAx0D,EAAAs0D,GACA,OAAA7pD,EAAAse,EAAAwrC,EAAAC,GAAA9rC,EAAA6rC,EAAAC,wNC5CA,aAEA,IAAA9qC,EAAA/jE,EAAA,kCAEAoD,EAAApD,EAAA,sBAAAoD,KA6IA,IAaAoG,EAAA,CAAA,CAAA,mBAAA,mBAAA,iBAAA,mBAAA,oBAAA,CAAA,kBAAA,kBAAA,kBAAA,kBAAA,iBAAA,mBAAA,mBAAA,mBAAA,uBAAA,CAAA,mBAAA,mBAAA,mBAAA,oBAAA,qBAAA,sBAOAi0E,EAAA,CAAA,CAAA,mBAAA,mBAAA,mBAAA,mBAAA,CAAA,mBAAA,kBAAA,kBAAA,mBAAA,mBAAA,kBAAA,mBAAA,oBAAA,CAAA,kBAAA,mBAAA,kBAAA,mBAAA,uBAOA6xB,EAAAhuG,KAAAoC,IAAA,EAAA,IACA5C,EAAA2I,KAAA,MACA3I,EAAA8vD,QAxKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,IAAA8P,EAAA9P,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,IAAA+C,EAAA9C,KAAAQ,IAAAT,GAEA,OAAAiuG,GAAAlrG,EACAhB,EAAA/B,GAGA+C,GA0GA,OAzGAhB,EAAA/B,GA4BA,SAAA+C,GACA,IAGA9D,EAHAivG,EAAAnrG,EAAAA,EACAorG,EAAAhmG,EAAA,GAAA,GAAA+lG,EACAE,EAAAF,EAGA,IAAAjvG,EAAA,EAAAA,EAAA,EAAAA,GAAA,EACAkvG,GAAAA,EAAAhmG,EAAA,GAAAlJ,IAAAivG,EACAE,GAAAA,EAAAhyB,EAAA,GAAAn9E,IAAAivG,EAGA,OAAAnrG,GAAAorG,EAAAhmG,EAAA,GAAA,KAAAimG,EAAAhyB,EAAA,GAAA,IAvCAiyB,CAAAtrG,GAGAA,GAAA,EACAhB,EAAA/B,IAAA,EA8CA,SAAA+C,GACA,IAEA9D,EAFAkvG,EAAAhmG,EAAA,GAAA,GAAApF,EACAqrG,EAAArrG,EAGA,IAAA9D,EAAA,EAAAA,EAAA,EAAAA,GAAA,EACAkvG,GAAAA,EAAAhmG,EAAA,GAAAlJ,IAAA8D,EACAqrG,GAAAA,EAAAhyB,EAAA,GAAAn9E,IAAA8D,EAGA,IAAA8V,GAAAs1F,EAAAhmG,EAAA,GAAA,KAAAimG,EAAAhyB,EAAA,GAAA,IACA8xB,EAAAt0F,SAAA,GAAA7W,GAAA,GACAurG,GAAAvrG,EAAAmrG,IAAAnrG,EAAAmrG,GACA,OAAAjuG,KAAAC,KAAAguG,EAAAA,GAAAjuG,KAAAC,KAAAouG,GAAAz1F,EA3DA01F,CAAAxrG,IAGAhB,EAAA/B,IAAA,EAqEA,SAAA+C,GACA,IAGA9D,EAHAivG,EAAA,GAAAnrG,EAAAA,GACAorG,EAAAhmG,EAAA,GAAA,GAAA+lG,EACAE,EAAAF,EAGA,IAAAjvG,EAAA,EAAAA,EAAA,EAAAA,GAAA,EACAkvG,GAAAA,EAAAhmG,EAAA,GAAAlJ,IAAAivG,EACAE,GAAAA,EAAAhyB,EAAA,GAAAn9E,IAAAivG,EAGA,IAAAr1F,EAAAq1F,GAAAC,EAAAhmG,EAAA,GAAA,KAAAimG,EAAAhyB,EAAA,GAAA,IACAvjE,GAuBA,kBAvBAA,GAAA9V,EACAmrG,EAAAt0F,SAAA,GAAA7W,GAAA,GACA,IAAAurG,GAAAvrG,EAAAmrG,IAAAnrG,EAAAmrG,GACA,OAAAjuG,KAAAC,KAAAguG,EAAAA,GAAAjuG,KAAAC,KAAAouG,GAAAz1F,EApFA21F,CAAAzrG,KAKA6zD,UAAA,SAAA93D,GACA,OAAA,IAAAo6C,EAAA0d,UAAAqL,EAAAnjE,EAAAmS,cAEA0xD,iBAAA,SAAA7jE,GACA,OAAA4jE,EAAA5jE,EAAAmjE,MAiFA,OAHAA,EAAAgC,MAAA,CACArkE,EAAA,gCAEAqiE,0FCzIA,aAEApiE,EAAAJ,QAAA,CAAAd,EAAA,+CCFA,aAEAkB,EAAAJ,QAAA,CAAAd,EAAA,SAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,YAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,UAAAA,EAAA,iBAAAA,EAAA,SAAAA,EAAA,SAAAA,EAAA,qLCFA,aAEA,IAAAq6C,EAAAr6C,EAAA,qBAAAq6C,QAmEAv5C,EAAA2I,KAAA,MACA3I,EAAA8vD,QAlEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA1xD,EAAAgyD,EAAA9zD,EAAA,sBACAs7B,EAAAw4B,EAAA9zD,EAAA,kBACAwjE,EAAA1P,EAAA9zD,EAAA,yBACAqT,EAAAygD,EAAA9zD,EAAA,2BACA8vG,EAAAh8C,EAAA9zD,EAAA,gCA0BAujE,EAAA/P,EAAA,MAAA,CAEAwQ,iBAAA+rC,EAEAC,MAAA,SAAAl7F,GACA,OAAAi7F,EAAAj7F,MAKA,OAFAyuD,EAAA+B,WAAA/iE,EAEAghE,EAEA,SAAAwsC,EAAAnkF,GAGA,GAAA,KAFAA,EAAAyuB,EAAAzuB,EAAA9kB,YAEA9F,OACA,MAAA,IAAAL,MAAA,sEAGA,IACA,IAAAsvG,EAAAzsC,EAAA53C,GACA,OAAA43C,EAAAloC,EAAA1P,EAAA,SAAAtkB,GACA,OAAAxF,EAAAuR,EAAA/L,EAAA2oG,OAEA,MAAA/3C,GACA,MAAAA,aAAAr7B,YAAA,IAAAq7B,EAAArsB,QAAA7gC,QAAA,UACA,IAAA6xB,UAAAq7B,EAAArsB,QAAAt2B,QAAA,SAAA,QAEAu6F,EAAA53C,EAAA,iMC/DA,aAEA,IAAAk1C,EAAAptG,EAAA,sCAEAgsD,EAAAhsD,EAAA,iCAEAkwG,EAAAlwG,EAAA,8CAoGAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAnGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA+O,EAAAzO,EAAA9zD,EAAA,yBACA8vG,EAAAh8C,EAAA9zD,EAAA,gCAiCAmK,EAAAqpD,EAAA,MAAA,CAEAwQ,iBAAAmsC,EAEAC,qCAAA,SAAAxkF,EAAAwtD,GACA,OAAAptB,EAAApgC,EAAAwtD,EAAAtyE,UAAAupG,IAGAL,MAAA,SAAAl7F,GACA,GAAAo7F,EAAAp7F,GACA,MAAA,IAAA+nB,UAAA,0CAGA,OAAAszE,EAAAr7F,MAIA,OADA3K,EAAAm7D,MAAA,8BACAn7D,EASA,SAAAkmG,EAAAhvG,EAAA+C,GACA,IACA,OAAAm+D,EAAAlhE,EAAA+C,GAAA/C,EAAA+C,EACA,MAAA8zD,GACA,MAAA43C,EAAA53C,EAAA,MAAA9zD,IAWA,SAAA+rG,EAAAvkF,GACA,IAAAzhB,EAaA,GAZAijG,EAAAxhF,EAAA,SAAAtkB,GACA,IACAtE,MAAAsE,IAAA,iBAAAA,EACA6C,EAAAjD,UACA3E,IAAA4H,GAAAo4D,EAAAj7D,EAAA6C,MACAA,EAAA7C,GAEA,MAAA4wD,GACA,MAAA43C,EAAA53C,EAAA,MAAA5wD,WAIA/E,IAAA4H,EACA,MAAA,IAAAxJ,MAAA,0CAGA,OAAAwJ,wNCtGA,aAEA,IAAAoxB,EAAAv7B,EAAA,qBAAAu7B,KAEA6xE,EAAAptG,EAAA,sCAEAgsD,EAAAhsD,EAAA,iCAEAkwG,EAAAlwG,EAAA,8CAiGAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAhGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAgN,EAAA8mD,EAAA9zD,EAAA,yBACA8vG,EAAAh8C,EAAA9zD,EAAA,gCA6BAmrD,EAAAqI,EAAA,OAAA,CAEAwQ,iBAAAssC,EAEAF,qCAsBA,SAAAxkF,EAAAwtD,GACA,IACA,IAAAnkE,EAAA+2C,EAAApgC,EAAAwtD,EAAA/1E,GACAgI,EAAAgV,MAAA2gB,QAAApV,GAAA2P,EAAA3P,GAAAA,EAAA2P,OACA,OAAAvuB,EAAAiI,EAAA5J,EAAA+tE,IACA,MAAAlhB,GACA,MAAA43C,EAAA53C,EAAA,UA1BA83C,MAAA,SAAAl7F,GACA,GAAAo7F,EAAAp7F,GACA,MAAA,IAAA+nB,UAAA,2CAGA,OAAAyzE,EAAAx7F,MAKA,OAFAq2C,EAAAma,WAAA/iE,EAEA4oD,EA2BA,SAAAmlD,EAAA1kF,GACA,IAAA3W,EAAA,EACAhF,EAAA,EAUA,GATAm9F,EAAAxhF,EAAA,SAAAtkB,GACA,IACA2N,EAAA5R,EAAA4R,EAAA3N,GACA2I,IACA,MAAAioD,GACA,MAAA43C,EAAA53C,EAAA,OAAA5wD,MAIA,IAAA2I,EACA,MAAA,IAAAtP,MAAA,2CAGA,OAAAqM,EAAAiI,EAAAhF,yQCrGA,aAEA,IAAAoqC,EAAAr6C,EAAA,qBAAAq6C,QAEA61D,EAAAlwG,EAAA,8CA6GAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QA5GA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,4BACAgN,EAAA8mD,EAAA9zD,EAAA,+BACAkT,EAAA4gD,EAAA9zD,EAAA,0BACAmhE,EAAArN,EAAA9zD,EAAA,8BACA8vG,EAAAh8C,EAAA9zD,EAAA,gCA4BAwjE,EAAAhQ,EAAA,SAAA,CAEAwQ,iBAAAusC,EAEAH,qCAAA,SAAAxkF,EAAAwtD,GAEA,MAAA,IAAAz4E,MAAA,wCAGAqvG,MAAA,SAAAl7F,GACA,GAAAo7F,EAAAp7F,GACA,MAAA,IAAA+nB,UAAA,6CAGA,OAAA0zE,EAAAz7F,MAUA,SAAAy7F,EAAA3kF,GACA,IAEA,IAAA3b,GADA2b,EAAAyuB,EAAAzuB,EAAA9kB,YACA9F,OAEA,GAAA,IAAAiP,EACA,MAAA,IAAAtP,MAAA,6CAGA,GAAAsP,EAAA,GAAA,EAAA,CAOA,IALA,IAAAyhC,EAAAzhC,EAAA,EAAA,EACA03E,EAAAxmB,EAAAv1C,EAAA,EAAA8lB,GAEA8+D,EAAA5kF,EAAA8lB,GAEApxC,EAAA,EAAAA,EAAAoxC,IAAApxC,EACA,EAAA4S,EAAA0Y,EAAAtrB,GAAAkwG,KACAA,EAAA5kF,EAAAtrB,IAIA,OAAAmwG,EAAAD,EAAA7oB,GAGA,IAAAj7E,EAAAy0D,EAAAv1C,GAAA3b,EAAA,GAAA,GACA,OAAAygG,EAAAhkG,GAEA,MAAAwrD,GACA,MAAA43C,EAAA53C,EAAA,WAKA,IAAAw4C,EAAAl9C,EAAA,CACAm9C,sCAAA,SAAArpG,GACA,OAAAA,KAIAmpG,EAAAj9C,EAAA,CACAo9C,2EAAA,SAAAJ,EAAA7oB,GACA,OAAA36E,EAAA3J,EAAAmtG,EAAA7oB,GAAA,MAKA,OAFAnkB,EAAA8B,WAAA/iE,EAEAihE,kQC9GA,aAEA,IAAA4pC,EAAAptG,EAAA,sCAEAgsD,EAAAhsD,EAAA,iCAEAkwG,EAAAlwG,EAAA,8CAoGAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAnGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAiP,EAAA3O,EAAA9zD,EAAA,0BACA8vG,EAAAh8C,EAAA9zD,EAAA,gCAiCAkK,EAAAspD,EAAA,MAAA,CAEAwQ,iBAAA6sC,EAEAT,qCAAA,SAAAxkF,EAAAwtD,GACA,OAAAptB,EAAApgC,EAAAwtD,EAAAtyE,UAAAgqG,IAGAd,MAAA,SAAAl7F,GACA,GAAAo7F,EAAAp7F,GACA,MAAA,IAAA+nB,UAAA,0CAGA,OAAAg0E,EAAA/7F,MAIA,OADA5K,EAAAo7D,MAAA,8BACAp7D,EASA,SAAA4mG,EAAAzvG,EAAA+C,GACA,IACA,OAAAq+D,EAAAphE,EAAA+C,GAAA/C,EAAA+C,EACA,MAAA8zD,GACA,MAAA43C,EAAA53C,EAAA,MAAA9zD,IAWA,SAAAysG,EAAAjlF,GACA,IAAA1hB,EAaA,GAZAkjG,EAAAxhF,EAAA,SAAAtkB,GACA,IACAtE,MAAAsE,IAAA,iBAAAA,EACA4C,EAAAhD,UACA3E,IAAA2H,GAAAu4D,EAAAn7D,EAAA4C,MACAA,EAAA5C,GAEA,MAAA4wD,GACA,MAAA43C,EAAA53C,EAAA,MAAA5wD,WAIA/E,IAAA2H,EACA,MAAA,IAAAvJ,MAAA,0CAGA,OAAAuJ,yNCtGA,aAEA,IAAAmwC,EAAAr6C,EAAA,qBAAAq6C,QAkFAv5C,EAAA2I,KAAA,OACA3I,EAAA8vD,QAjFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAxwD,EAAA8wD,EAAA9zD,EAAA,mBACA4jE,EAAA9P,EAAA9zD,EAAA,uBAiCA,OANAwzD,EAAA,OAAA,CACAwQ,iBAAA+sC,EACAf,MAAA,SAAAl7F,GACA,OAAAi8F,EAAAj8F,MAWA,SAAAi8F,EAAAnkF,GAIA,GAAA,KAHAA,EAAAytB,EAAAztB,EAAA9lB,YACA9F,OAGA,MAAA,IAAAL,MAAA,2CAOA,IAJA,IAAAggB,EAAA,GACA8iD,EAAA,GACAt5D,EAAA,EAEA7J,EAAA,EAAAA,EAAAssB,EAAA5rB,OAAAV,IAAA,CACA,IAAAgH,EAAAslB,EAAAtsB,GAEA,GAAAsjE,EAAAt8D,IAAAtE,EAAAsE,GACA,MAAA,IAAA3G,MAAA,2DAGA2G,KAAAqZ,IACAA,EAAArZ,GAAA,GAGAqZ,EAAArZ,KAEAqZ,EAAArZ,KAAA6C,EACAs5D,EAAAnzD,KAAAhJ,GACAqZ,EAAArZ,GAAA6C,IACAA,EAAAwW,EAAArZ,GACAm8D,EAAA,CAAAn8D,IAIA,OAAAm8D,mGChFA,aAEA,IAAA2pC,EAAAptG,EAAA,sCAwEAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAvEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnP,EAAAyP,EAAA9zD,EAAA,iCACA8vG,EAAAh8C,EAAA9zD,EAAA,gCA2BAwT,EAAAggD,EAAA,OAAA,CAEAwQ,iBAAAgtC,EAEAZ,qCAAA,SAAAxkF,EAAAwtD,GAEA,MAAA,IAAAz4E,MAAA,sCAGAqvG,MAAA,SAAAl7F,GACA,OAAAk8F,EAAAl8F,MAKA,OAFAtB,EAAA8xD,WAAA/iE,EAEAiR,EAQA,SAAAw9F,EAAAplF,GACA,IAAApY,EASA,GARA45F,EAAAxhF,EAAA,SAAAtkB,GACA,IACAkM,OAAAjR,IAAAiR,EAAAlM,EAAA+8C,EAAA7wC,EAAAlM,GACA,MAAA4wD,GACA,MAAA43C,EAAA53C,EAAA,OAAA5wD,WAIA/E,IAAAiR,EACA,MAAA,IAAA7S,MAAA,2CAGA,OAAA6S,2ICtEA,aAEA,IAAApE,EAAApP,EAAA,sBAAAoP,UAEAyxC,EAAA7gD,EAAA,sBAAA6gD,SAEAxG,EAAAr6C,EAAA,qBAAAq6C,QAEAkgC,EAAAv6E,EAAA,uCA2QAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QA1QA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,sBACAqkD,EAAAyP,EAAA9zD,EAAA,2BACAmhE,EAAArN,EAAA9zD,EAAA,8BACAkT,EAAA4gD,EAAA9zD,EAAA,0BAgKA,SAAAixG,EAAArlF,EAAAslF,EAAAC,GACA,IAAA3L,EAAAnrD,EAAAzuB,GACAzf,EAAAq5F,EAAAxkG,OAEA,GAAA,IAAAmL,EACA,MAAA,IAAAxL,MAAA,kDAGA,GAAAkgD,EAAAqwD,GAAA,CACA,IAAA1yF,EAAA0yF,GAAA/kG,EAAA,GAEAilG,EAAA5yF,EAAA,EAEA,GAAA,GAAA4yF,EAAA,CACA,IAAA9pG,EAAA6pG,EAAA3L,EAAAhnF,GAAA2iD,EAAAqkC,EAAAhnF,GAEA,OADA6yF,EAAA/pG,GACAA,EAGA,IAEAgqG,EAEAC,EAJAC,EAAAlwG,KAAAiF,MAAAiY,GAMA,GAAA2yF,EACAG,EAAA9L,EAAAgM,GACAD,EAAA/L,EAAAgM,EAAA,OACA,CACAD,EAAApwC,EAAAqkC,EAAAgM,EAAA,GAEAF,EAAA9L,EAAAgM,GAEA,IAAA,IAAAlxG,EAAA,EAAAA,EAAAkxG,IAAAlxG,EACA,EAAA4S,EAAAsyF,EAAAllG,GAAAgxG,KACAA,EAAA9L,EAAAllG,IAQA,OAHA+wG,EAAAC,GACAD,EAAAE,GAEAluG,EAAAghD,EAAAitD,EAAA,EAAAF,GAAA/sD,EAAAktD,EAAAH,IAIA,IAAA32F,EAAAy2F,EAAA7kG,MAAAF,EAAA,GAEA,GAAAsO,EAAArL,YAAA,CACAqL,EAAAA,EAAAnI,WAEA,IAAAm/F,EAAAN,EAAA3L,EAAA/qF,GAAA0mD,EAAAqkC,EAAA/qF,GAGA,OADA42F,EAAAI,GACAA,EAGA,IAGAjB,EACA7oB,EAJA+pB,EAAAj3F,EAAAlU,QACAorG,EAAAl3F,EAAA1X,MAAA2uG,GACAE,EAAAF,EAAAp/F,WAIA,GAAA6+F,EACAX,EAAAhL,EAAAoM,GACAjqB,EAAA6d,EAAAoM,EAAA,OACA,CACAjqB,EAAAxmB,EAAAqkC,EAAAoM,EAAA,GAEApB,EAAAhL,EAAAoM,GAEA,IAAA,IAAAC,EAAA,EAAAA,EAAAD,IAAAC,EACA,EAAA3+F,EAAAsyF,EAAAqM,GAAArB,KACAA,EAAAhL,EAAAqM,IAKAR,EAAAb,GACAa,EAAA1pB,GAEA,IAAA/5E,EAAA,IAAA+jG,EAAAvmG,YAAA,GACA,OAAA/H,EAAAghD,EAAAmsD,EAAA5iG,EAAA7K,MAAA4uG,IAAAttD,EAAAsjC,EAAAgqB,IAUA,IAAAN,EAAA79C,EAAA,CACAs+C,4BAAA,SAAAzwG,GACA,OAAAA,KAGA,OA9NA,SAAAuhC,EAAAmvE,EAAAZ,GACA,IAAAa,EAAAC,EAAArkG,EAEA,GAAAyI,UAAArV,OAAA,GAAA,EAAAqV,UAAArV,OACA,MAAA,IAAAU,YAAA,yDAGA,GAAA64E,EAAA33C,GAAA,CAGA,GAAA,kBAFAuuE,EAAAA,IAAA,GAoGA,MAAA,IAAAt0E,UAAA,uDA/FA,GAFAo1E,EAAArvE,EAAA97B,UAEA+5C,EAAAkxD,GAAA,CACA,GAAAA,EAAA,EACA,MAAA,IAAApxG,MAAA,+BAGA,GAAAoxG,GAAA,EAEA,OAAAd,EAAAgB,EAAAF,EAAAZ,GAGA,GAAA,EAAAY,EAAA,CAEA,IAAA3iG,EAAA2iG,GACA,MAAA,IAAApxG,MAAA,gCAGA,IAAAuxG,EAAAH,EAAA,EACAC,EAAA,IAAA3xF,MAAA0xF,GAEA,IAAA,IAAAzxG,EAAA,EAAAA,EAAAyxG,GACAC,EAAA1xG,GAAA2wG,EAAAgB,IAAA3xG,EAAA4xG,EAAAf,GAGA,OAAAa,GAIA,GAAAz3D,EAAA6b,YAAA27C,GAAA,CACA,GAAAA,EAAAziG,aACA,MAAA,IAAA3O,MAAA,+BAKA,GAFAiN,EAAA,IAAAmkG,EAAA3mG,YAAA,GAEA2mG,EAAArjG,IAAAd,GAEA,OAAA,IAAA2sC,EAAA0d,UAAAg5C,EAAAgB,EAAAF,EAAAZ,IAGA,GAAAY,EAAAvkG,GAAAI,GAAA,CAEA,IAAAmkG,EAAA3iG,YACA,MAAA,IAAAzO,MAAA,gCAKA,IAAAwxG,EAAAJ,EAAAz/F,WAEA,GAAA,WAAA6/F,EACA,MAAA,IAAAxxG,MAAA,qFAGA,IAAAyxG,EAAA,IAAA73D,EAAA0d,UAAAk6C,EAAA,GAEAH,EAAA,IAAA3xF,MAAA8xF,GAEA,IAAA,IAAA1tB,EAAA,EAAAA,EAAA0tB,GACAH,EAAAvtB,GAAA,IAAAlqC,EAAA0d,UAAAg5C,EAAAgB,EAAA,IAAA13D,EAAA0d,YAAAwsB,GAAAjhF,IAAA4uG,GAAAjB,IAGA,OAAAa,GAIA,GAAA3xF,MAAA2gB,QAAA+wE,GAAA,CAEAC,EAAA,IAAA3xF,MAAA0xF,EAAA/wG,QAEA,IAAA,IAAA2jF,EAAA,EAAAA,EAAAqtB,EAAAhxG,SAAA2jF,EAAA,CACA,IAAA0tB,EAAAN,EAAAptB,GAEA,GAAA9jC,EAAAwxD,IACA,GAAAA,EAAA,GAAA,EAAAA,EACA,MAAA,IAAA1xG,MAAA,sDAEA,CAAA,IAAA45C,EAAA6b,YAAAi8C,GAOA,MAAA,IAAAx1E,UAAA,uDAJA,GAFAjvB,EAAA,IAAAykG,EAAAjnG,YAAA,GAEAinG,EAAA/iG,cAAA+iG,EAAA7kG,GAAAI,GACA,MAAA,IAAAjN,MAAA,kDAMAqxG,EAAArtB,GAAAssB,EAAAgB,EAAAI,EAAAlB,GAGA,OAAAa,EAGA,MAAA,IAAAn1E,UAAA,uDAMA,MAAA,IAAAA,UAAA,8RCjKA,aA6FA/7B,EAAA2I,KAAA,MACA3I,EAAA8vD,QA5FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA3vD,EAAAiwD,EAAA9zD,EAAA,uBACAy6E,EAAA3mB,EAAA9zD,EAAA,sBAsDA2jE,EAAAnQ,EAAA,MAAA,CAEAwQ,iBAAAsuC,EAEA5L,yBAAA4L,EAEAlC,qCAAAkC,EAEAC,6CAAAD,EAEAtC,MAAA,SAAAl7F,GACA,OAAAw9F,EAAAx9F,MAKA,OAFA6uD,EAAA2B,WAAA/iE,EAEAohE,EAEA,SAAA2uC,EAAA1mF,EAAA4mF,GACA,GAAA,IAAA5mF,EAAA5qB,OACA,MAAA,IAAAU,YAAA,6DAGA,IACA,OAAAmC,EAAA42E,EAAA7/D,MAAA,KAAAvE,YACA,MAAA6hD,GACA,MAAAA,aAAAr7B,YAAA,IAAAq7B,EAAArsB,QAAA7gC,QAAA,QACA,IAAA6xB,UAAAq7B,EAAArsB,QAAAt2B,QAAA,OAAA,SAEA2iD,+ECvFA,aAEA,IAAAk1C,EAAAptG,EAAA,sCAEAgsD,EAAAhsD,EAAA,iCAEAkwG,EAAAlwG,EAAA,8CA6FAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QA5FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAnwD,EAAAywD,EAAA9zD,EAAA,4BACA8vG,EAAAh8C,EAAA9zD,EAAA,gCAyBAiV,EAAAu+C,EAAA,MAAA,CAEAwQ,iBAAAyuC,EAEArC,qCAiDA,SAAAxkF,EAAAwtD,GACA,IACA,IAAAs5B,EAAA1mD,EAAApgC,EAAAwtD,EAAA/1E,GAEA,OAAAqvG,EACA,MAAAx6C,GACA,MAAA43C,EAAA53C,EAAA,SArDA83C,MAAA,SAAAl7F,GACA,GAAAo7F,EAAAp7F,GACA,MAAA,IAAA+nB,UAAA,0CAGA,OAAA41E,EAAA39F,MAKA,OAFAG,EAAAqwD,WAAA/iE,EAEA0S,EAQA,SAAAw9F,EAAA7mF,GACA,IAAA3W,EASA,GARAm4F,EAAAxhF,EAAA,SAAAtkB,GACA,IACA2N,OAAA1S,IAAA0S,EAAA3N,EAAAjE,EAAA4R,EAAA3N,GACA,MAAA4wD,GACA,MAAA43C,EAAA53C,EAAA,MAAA5wD,WAIA/E,IAAA0S,EACA,OAAAY,EAAA+uB,QACA,IAAA,SACA,OAAA,EAEA,IAAA,YACA,OAAA,IAAA2V,EAAA0d,UAAA,GAEA,IAAA,WACA,OAAA,IAAA1d,EAAAx/B,SAAA,GAEA,QACA,OAAA,EAIA,OAAA9F,2NCrFA,aAiCAnU,EAAA8vD,QA/BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqU,EAAA/T,EAAA9zD,EAAA,uBAYA,OAAA,SAAAk4D,EAAAy6C,EAAArrG,GAEA,IAAA+zC,EAEA,OAAA,IAAAhmC,OAAA6iD,GAAAltD,QAAA,oBACAqwC,EAAA,EAAAhlC,UAAArV,OAAA,WAAA6mE,EAAAvgE,GAAA,YAAA6sD,KAAAC,UAAA9sD,GAAA,IAAA,WAAA4wD,EAAAt1B,KAAA01B,OAAA,IACA,IAAAz7B,UAAA,oBAAA81E,EAAA,gCAAAt3D,KAGA,IAAAhmC,OAAA6iD,GAAAltD,QAAA,oBACAqwC,EAAA,EAAAhlC,UAAArV,OAAA,WAAA6mE,EAAAvgE,GAAA,YAAA6sD,KAAAC,UAAA9sD,GAAA,IAAA,GACA,IAAAu1B,UAAA,oBAAA81E,EAAA,wDAAAt3D,IAGA6c,sDC7BA,aAEA,IAAA06C,EAAA,WAEAxF,EAAAptG,EAAA,sCA6JAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QA5JA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA54C,EAAAk5C,EAAA9zD,EAAA,oBACAqD,EAAAywD,EAAA9zD,EAAA,4BACAqT,EAAAygD,EAAA9zD,EAAA,2BACAqkD,EAAAyP,EAAA9zD,EAAA,iCACAgN,EAAA8mD,EAAA9zD,EAAA,+BACAgD,EAAA8wD,EAAA9zD,EAAA,mBACA8vG,EAAAh8C,EAAA9zD,EAAA,gCAuDAy6E,EAAAjnB,EAAA,WAAA,CAEAwQ,iBAAA,SAAAp4C,GACA,OAAAinF,EAAAjnF,EAAAgnF,IAGAlM,yBAAAmM,EAEAzC,qCAAA,SAAAxkF,EAAAwtD,GACA,OAAA05B,EAAAlnF,EAAAwtD,EAAAw5B,IAGAL,6CAAAO,EAEA9C,MAAA,SAAAl7F,GACA,OAAA+9F,EAAA/9F,EAAA89F,MAIA,OADAn4B,EAAAnV,MAAA,sCACAmV,EAaA,SAAAo4B,EAAAjnF,EAAA4mF,GACA,IAAAv9F,EAAA,EACAhF,EAAA,EAEA,GAAA,IAAA2b,EAAA5qB,OACA,MAAA,IAAAU,YAAA,6DAYA,GARA0rG,EAAAxhF,EAAA,SAAAtkB,GACA,IACA2N,EAAA5R,EAAA4R,EAAA3N,GACA2I,IACA,MAAAioD,GACA,MAAA43C,EAAA53C,EAAA,MAAA5wD,MAGA,IAAA2I,EAAA,MAAA,IAAAtP,MAAA,0CACA,IAAAwqD,EAAAn+C,EAAAiI,EAAAhF,GAQA,GANAgF,EAAA,EACAm4F,EAAAxhF,EAAA,SAAAtkB,GACA,IAAAyrG,EAAA1/F,EAAA/L,EAAA6jD,GACAl2C,EAAA5R,EAAA4R,EAAAovC,EAAA0uD,EAAAA,MAGA/vG,EAAAiS,GACA,OAAAA,EAGA,OAAAu9F,GACA,IAAA,cACA,OAAAxlG,EAAAiI,EAAAhF,GAEA,IAAA,SACA,OAAAjD,EAAAiI,EAAAhF,EAAA,GAEA,IAAA,WACA,IAAA6kF,EAAAv6C,EAAA6b,YAAAnhD,GAAA,IAAAslC,EAAA0d,UAAA,GAAA,EACA,OAAA,IAAAhoD,EAAA6kF,EAAA9nF,EAAAiI,EAAAhF,EAAA,GAEA,QACA,MAAA,IAAAtP,MAAA,0BAAA6xG,EAAA,gEAIA,SAAAM,EAAAlnF,EAAAwtD,EAAAo5B,GACA,IACA,GAAA,IAAA5mF,EAAA5qB,OACA,MAAA,IAAAU,YAAA,6DAGA,OAAAkZ,EAAAgR,EAAAwtD,EAAA,SAAA/3E,GACA,OAAAwxG,EAAAxxG,EAAAmxG,KAEA,MAAAt6C,GACA,MAAA43C,EAAA53C,EAAA,wRC5JA,aAEA,IAAA98B,EAAAp7B,EAAA,sBAgHAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QA/GA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAqGA,IAAA+F,EAAA/F,EAAA,SAAA,CACA2Q,IAAA/oC,EAAAm+B,OACAy5C,kCAAA53E,EAAAm+B,SAIA,OAFAA,EAAA+L,WAAA/iE,EAEAg3D,qDC/GA,aAEAr4D,EAAAJ,QAAA,CAAAd,EAAA,YAAAA,EAAA,kECFA,aAEA,IAAA8gD,EAAA9gD,EAAA,sBAAA8gD,SAEAyY,EAAAv5D,EAAA,sBAAAu5D,OAkEA,SAAA05C,EAAApmD,EAAAjgC,EAAA8xB,GACA,OAAAmO,EAAAt3C,QAAA,cAAA,SAAA29F,EAAA16F,GAIA,IAHA,IAAA6B,EAAA7B,EAAA0J,MAAA,KACA5a,EAAAslB,EAAAvS,EAAA7J,SAEA6J,EAAArZ,aAAAuB,IAAA+E,GAAA,CACA,IAAAqC,EAAA0Q,EAAA7J,QACAlJ,EAAAqC,EAAArC,EAAAqC,GAAArC,EAAA,IAGA,YAAA/E,IAAA+E,EACAw5C,EAAAx5C,GAGAA,EAFAiyD,EAAAjyD,EAAAo3C,GAMAw0D,IAIApyG,EAAA2I,KAAA,QACA3I,EAAA8vD,QAvFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA6CA,IAAA2/C,EAAA3/C,EAAA,QAAA,CAEA4/C,yBAAAH,EACAI,0CAAAJ,IAIA,OAFAE,EAAA7tC,WAAA/iE,EAEA4wG,qDC1DA,aAEA,IAAApvC,EAAA/jE,EAAA,kCAkDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAA3uD,EAAA2uD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAA,GAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAuD,KAAAxD,GAEA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAAwD,QAGAnC,QAAA,SAAArB,GACA,OAAAA,EAAAwD,QAEAozD,UAAA,SAAA52D,GACA,OAAAA,EAAAwD,QAEAm/D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAwD,MAMA,OAHAA,EAAAygE,MAAA,CACArkE,EAAA,uCAEA4D,iECjDA,aAEA,IAAAk/D,EAAA/jE,EAAA,kCA2DA,IAAAszG,EAAAhyG,KAAAmE,OAAA,SAAApE,GACA,OAAAC,KAAAU,IAAAV,KAAAuC,KAAAxC,EAAAA,EAAA,GAAAA,IAGAP,EAAA2I,KAAA,QACA3I,EAAA8vD,QA9DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAA/tD,EAAA+tD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAwU,EAAA+9C,YACA0/C,EAAAjyG,GAGAA,IAAA,EACA,IAAAk5C,EAAA73C,QAAApB,KAAAU,IAAAV,KAAAuC,KAAAxC,EAAAA,EAAA,GAAAA,GAAAC,KAAA2C,IAGA,IAAAs2C,EAAA73C,QAAArB,EAAA,GAAAoE,SAEA/C,QAAA,SAAArB,GACA,OAAAA,EAAAoE,SAEAwyD,UAAA,SAAA52D,GACA,OAAAA,EAAAoE,SAEAu+D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAoE,MAMA,OAHAA,EAAA6/D,MAAA,CACArkE,EAAA,wCAEAwE,iECnDA,aAEA,IAAAs+D,EAAA/jE,EAAA,kCA8CAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QA7CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAxuD,EAAAwuD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAC,KAAAwD,KAAA,EAAAzD,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAA2D,QAEAizD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,GAAAyD,QAEAk/D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA2D,MAMA,OAHAA,EAAAsgE,MAAA,CACArkE,EAAA,uCAEA+D,iEC7CA,aAEA,IAAA++D,EAAA/jE,EAAA,kCAgDAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA/CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAztD,EAAAytD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAA,IAAA,GAAAwU,EAAA+9C,YACAnxD,SAAApB,IAAAC,KAAAU,KAAAX,EAAA,GAAAA,GAAAC,KAAAU,IAAAX,GAAAA,EAAA,KAAA,EAAA,EAGA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAA0E,SAEArD,QAAA,SAAArB,GACA,OAAAA,EAAA0E,SAEAkyD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,GAAAqE,SAEAs+D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA0E,MAMA,OAHAA,EAAAu/D,MAAA,CACArkE,EAAA,wCAEA8E,iEC/CA,aAEA,IAAAg+D,EAAA/jE,EAAA,kCAkDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAtuD,EAAAsuD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,IAAA,GAAA,GAAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAoD,KAAA,EAAArD,GAGA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAA6D,QAEAxC,QAAA,SAAArB,GACA,OAAAA,EAAA6D,QAEA+yD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,GAAAqD,QAEAs/D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA6D,MAMA,OAHAA,EAAAogE,MAAA,CACArkE,EAAA,uCAEAiE,iECjDA,aAEA,IAAA6+D,EAAA/jE,EAAA,kCA6CAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA5CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAxtD,EAAAwtD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GAEA,OADAA,EAAA,EAAAA,EACAC,KAAAU,IAAAX,EAAAC,KAAAuC,KAAAxC,EAAAA,EAAA,KAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAA2E,SAEAiyD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,GAAAkE,SAEAy+D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA2E,MAMA,OAHAA,EAAAs/D,MAAA,CACArkE,EAAA,gDAEA+E,iEC5CA,aAEA,IAAA+9D,EAAA/jE,EAAA,kCAkDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAjDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAvuD,EAAAuuD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,IAAA,GAAA,GAAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAuD,KAAA,EAAAxD,GAGA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAA4D,QAEAvC,QAAA,SAAArB,GACA,OAAAA,EAAA4D,QAEAgzD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,GAAAwD,QAEAm/D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA4D,MAMA,OAHAA,EAAAqgE,MAAA,CACArkE,EAAA,uCAEAgE,iECjDA,aAEA,IAAA8+D,EAAA/jE,EAAA,kCAuDAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QAtDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAvtD,EAAAutD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,GAAAA,GAAA,IAAA,GAAAA,GAAAwU,EAAA+9C,YAAA,CACAvyD,EAAA,EAAAA,EACA,IAAAuF,EAAAtF,KAAAuC,KAAAxC,EAAAA,EAAA,GAEA,OAAA,EAAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAU,IAAA4E,EAAAvF,GAGA,IAAAk5C,EAAA73C,QAAApB,KAAAU,IAAA4E,EAAAvF,GAAAC,KAAA2C,IAGA,OAAA,IAAAs2C,EAAA73C,QAAArB,EAAA,GAAA4E,SAEAvD,QAAA,SAAArB,GACA,OAAAA,EAAA4E,SAEAgyD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,GAAAoE,SAEAu+D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA4E,MAMA,OAHAA,EAAAq/D,MAAA,CACArkE,EAAA,gDAEAgF,iECtDA,aAEA,IAAA89D,EAAA/jE,EAAA,kCAmDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAA9uD,EAAA8uD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,GAAAA,GAAAA,GAAA,GAAAwU,EAAA+9C,YACAtyD,KAAAoD,KAAArD,GAEA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAAqD,QAGAhC,QAAA,SAAArB,GACA,OAAAA,EAAAqD,QAEAuzD,UAAA,SAAA52D,GACA,OAAAA,EAAAqD,QAEAs/D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAqD,GAAA,MAMA,OAHAA,EAAA4gE,MAAA,CACArkE,EAAA,uCAEAyD,iEClDA,aAEA,IAAAq/D,EAAA/jE,EAAA,kCA6CAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA5CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAjuD,EAAAiuD,EAAA,QAAA,CACA5uB,OAAAtjC,KAAAiE,OAAA,SAAAlE,GACA,OAAAC,KAAAU,IAAAV,KAAAuC,KAAAxC,EAAAA,EAAA,GAAAA,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAkE,SAEA0yD,UAAA,SAAA52D,GACA,OAAAA,EAAAkE,SAEAy+D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAkE,GAAA,MAMA,OAHAA,EAAA+/D,MAAA,CACArkE,EAAA,wCAEAsE,iEC5CA,aAEA,IAAAw+D,EAAA/jE,EAAA,kCA+CAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QA9CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAA1uD,EAAA0uD,EAAA,OAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAC,KAAAwD,KAAAzD,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAyD,QAEAmzD,UAAA,SAAA52D,GACA,OAAAA,EAAAyD,QAEAk/D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAyD,GAAA,MAMA,OAHAA,EAAAwgE,MAAA,CACArkE,EAAA,uCAEA6D,iEC9CA,aAkGAhE,EAAA2I,KAAA,QACA3I,EAAA8vD,QAjGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAG,EAAAG,EAAA9zD,EAAA,sCACAw0F,EAAA1gC,EAAA9zD,EAAA,wCACAy0F,EAAA3gC,EAAA9zD,EAAA,wCACA40F,EAAA9gC,EAAA9zD,EAAA,wCACAi0F,EAAAngC,EAAA9zD,EAAA,wCACA20F,EAAA7gC,EAAA9zD,EAAA,wCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA+BAkC,EAAAsxD,EAAA,QAAA,CACAu/B,iBAAAzxF,KAAAY,MAIA+wF,uBAAA,SAAA7uF,EAAA/C,GACA,OAAAk5C,EAAA0d,UAAA/1D,MAAAkC,EAAA/C,IAEA6wF,6BAAA,SAAA7wF,EAAA+C,GACA,OAAAwwF,EAAAvzF,EAAA+C,EAAAlC,GAAA,IAEA+vF,4BAAA,SAAA5wF,EAAA+C,GAEA,OAAAowF,EAAApwF,EAAA/C,EAAAa,GAAA,IAEA8vF,4BAAA,SAAA3wF,EAAA+C,GACA,OAAAqwF,EAAApzF,EAAA+C,EAAAlC,GAAA,IAEA6vF,2BAAA,SAAA1wF,EAAA+C,GACA,OAAAytF,EAAAxwF,EAAA+C,EAAAlC,IAEAiwF,eAAA,SAAA9wF,EAAA+C,GACA,OAAAlC,EAAAyxD,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GACA,OAAAlC,EAAAyxD,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GACA,OAAAlC,EAAAb,EAAAsyD,EAAAvvD,KAEA2wF,mCAAA,SAAA1zF,EAAA+C,GACA,OAAA6vF,EAAA5yF,EAAA+C,EAAAlC,GAAA,IAEA8yF,kCAAA,SAAA3zF,EAAA+C,GACA,OAAA0tF,EAAAzwF,EAAA+C,EAAAlC,GAAA,IAEA+yF,mCAAA,SAAA5zF,EAAA+C,GAEA,OAAAuwF,EAAAvwF,EAAA/C,EAAAa,GAAA,IAEAgzF,kCAAA,SAAA7zF,EAAA+C,GAEA,OAAA0tF,EAAA1tF,EAAA/C,EAAAa,GAAA,IAEAizF,4BAAA,SAAA9zF,EAAA+C,GACA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAAlC,GAAA,GAAA4E,WAEAsuF,4BAAA,SAAA/zF,EAAA+C,GACA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAAa,GAAA,GAAA4E,aAMA,OAHA5E,EAAAojE,MAAA,CACAwtB,EAAA,yCAEA5wF,0WC/FA,aAEA,IAAA6hE,EAAA/jE,EAAA,kCAwDA,IAAAuzG,EAAAjyG,KAAAoE,OAAA,SAAArE,GACA,OAAAC,KAAAU,KAAA,EAAAX,IAAA,EAAAA,IAAA,GAGAP,EAAA2I,KAAA,QACA3I,EAAA8vD,QA3DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAA9tD,EAAA8tD,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,GAAA,IAAA,GAAAA,GAAAwU,EAAA+9C,YACA2/C,EAAAlyG,GAGA,IAAAk5C,EAAA73C,QAAArB,EAAA,GAAAqE,SAEAhD,QAAA,SAAArB,GACA,OAAAA,EAAAqE,SAEAuyD,UAAA,SAAA52D,GACA,OAAAA,EAAAqE,SAEAs+D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAqE,GAAA,MAMA,OAHAA,EAAA4/D,MAAA,CACArkE,EAAA,wCAEAyE,iEChDA,aAEA,IAAAq+D,EAAA/jE,EAAA,kCAsDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QArDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA2BA,IAAAvxD,EAAAuxD,EAAA,MAAA,CACA5uB,OAAAtjC,KAAAW,IACAS,QAAA,SAAArB,GACA,OAAAA,EAAAY,OAEAg2D,UAAA,SAAA52D,GACA,OAAAA,EAAAY,OAEAstE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,oCAGA,OAAA56B,EAAAZ,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAY,MAMA,OAHAA,EAAAqjE,MAAA,CACArkE,EAAA,kCAEAgB,iECrDA,aAEA,IAAA8hE,EAAA/jE,EAAA,kCAwDA,IAAA2zG,EAAAryG,KAAAF,MAAA,SAAAC,GACA,OAAAC,KAAAC,IAAAF,GAAAC,KAAAC,KAAAF,IAAA,GAGAP,EAAA2I,KAAA,OACA3I,EAAA8vD,QA3DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAApyD,EAAAoyD,EAAA,OAAA,CACA5uB,OAAA+uE,EACAjxG,QAAA,SAAArB,GACA,OAAAA,EAAAD,QAEA62D,UAAA,SAAA52D,GACA,OAAAA,EAAAD,QAEAmuE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,qCAGA,OAAAz7B,EAAAC,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAD,MAMA,OAHAA,EAAAkkE,MAAA,CACArkE,EAAA,mCAEAG,iEChDA,aAEA,IAAA2iE,EAAA/jE,EAAA,kCAmDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAjvD,EAAAivD,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,EAAAC,KAAAgD,IAAAjD,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAkD,OAEA0zD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,EAAAiD,QAEAirE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,oCAGA,OAAAt4B,EAAAlD,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAkD,MAMA,OAHAA,EAAA+gE,MAAA,CACArkE,EAAA,kCAEAsD,iEClDA,aAEA,IAAAw/D,EAAA/jE,EAAA,kCA0DA,SAAA4zG,EAAAvyG,GACA,IAAAnB,EAAAoB,KAAAC,IAAA,EAAAF,GACA,OAAAnB,EAAA,IAAAA,EAAA,GAGAY,EAAA2I,KAAA,OACA3I,EAAA8vD,QA9DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAApuD,EAAAouD,EAAA,OAAA,CACA5uB,OAAAgvE,EACAlxG,QAAA,SAAArB,GACA,OAAAA,EAAA+D,QAEA6yD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,EAAA8D,SAEAoqE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,qCAGA,OAAAz3B,EAAA/D,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA+D,MAMA,OAHAA,EAAAkgE,MAAA,CACArkE,EAAA,mCAEAmE,iEClDA,aAEA,IAAA2+D,EAAA/jE,EAAA,kCAmDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAA/uD,EAAA+uD,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,EAAAC,KAAAqB,IAAAtB,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAoD,OAEAwzD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,EAAAsB,QAEA4sE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,oCAGA,OAAAp4B,EAAApD,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAoD,MAMA,OAHAA,EAAA6gE,MAAA,CACArkE,EAAA,kCAEAwD,iEClDA,aAEA,IAAAs/D,EAAA/jE,EAAA,kCAEAoD,EAAApD,EAAA,sBAAAoD,KA0DA,SAAAywG,EAAAxyG,GAEA,OAAA,IAAAA,EACAmB,OAAAo2F,kBAEAt3F,KAAAQ,IAAA,GAAAR,KAAAC,IAAAF,GAAAC,KAAAC,KAAAF,KAAA+B,EAAA/B,GAIAP,EAAA2I,KAAA,OACA3I,EAAA8vD,QAlEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAnuD,EAAAmuD,EAAA,OAAA,CACA5uB,OAAAivE,EACAnxG,QAAA,SAAArB,GACA,OAAAA,EAAAgE,QAEA4yD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,EAAAG,SAEA+tE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,qCAGA,OAAAx3B,EAAAhE,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAgE,MAMA,OAHAA,EAAAigE,MAAA,CACArkE,EAAA,2CAEAoE,0FCpDA,aAEAnE,EAAAJ,QAAA,CAAAd,EAAA,UAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,UAAAA,EAAA,WAAAA,EAAA,WAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,UAAAA,EAAA,SAAAA,EAAA,0WCFA,aAEA,IAAA+jE,EAAA/jE,EAAA,kCAmDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAlDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAhvD,EAAAgvD,EAAA,MAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,EAAAC,KAAAW,IAAAZ,IAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAAmD,OAEAyzD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,EAAAY,QAEAstE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,oCAGA,OAAAr4B,EAAAnD,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAmD,MAMA,OAHAA,EAAA8gE,MAAA,CACArkE,EAAA,kCAEAuD,iEClDA,aAEA,IAAAu/D,EAAA/jE,EAAA,kCA0DA,SAAA8zG,EAAAzyG,GACA,OAAA,GAAAC,KAAAC,IAAAF,GAAAC,KAAAC,KAAAF,IAGAP,EAAA2I,KAAA,OACA3I,EAAA8vD,QA7DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAluD,EAAAkuD,EAAA,OAAA,CACA5uB,OAAAkvE,EACApxG,QAAA,SAAArB,GACA,OAAAA,EAAAiE,QAEA2yD,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,GAAAz0D,IAAAnC,EAAAD,SAEAmuE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,qCAGA,OAAAv3B,EAAAjE,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAiE,MAMA,OAHAA,EAAAggE,MAAA,CACArkE,EAAA,2CAEAqE,iEClDA,aAEA,IAAAy+D,EAAA/jE,EAAA,kCAuDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAtDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA2BA,IAAA7wD,EAAA6wD,EAAA,MAAA,CACA5uB,OAAAtjC,KAAAqB,IACAD,QAAA,SAAArB,GACA,OAAAA,EAAAsB,OAEAs1D,UAAA,SAAA52D,GACA,OAAAA,EAAAsB,OAEA4sE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,oCAGA,OAAAl6B,EAAAtB,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAsB,GAAA,MAMA,OAHAA,EAAA2iE,MAAA,CACArkE,EAAA,kCAEA0B,iECtDA,aAEA,IAAAohE,EAAA/jE,EAAA,kCAyDA,IAAA+zG,EAAAzyG,KAAAE,MAAA,SAAAH,GACA,OAAAC,KAAAC,IAAAF,GAAAC,KAAAC,KAAAF,IAAA,GAGAP,EAAA2I,KAAA,OACA3I,EAAA8vD,QA5DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsBA,IAAAhyD,EAAAgyD,EAAA,OAAA,CACA5uB,OAAAmvE,EACArxG,QAAA,SAAArB,GACA,OAAAA,EAAAG,QAEAy2D,UAAA,SAAA52D,GACA,OAAAA,EAAAG,QAEA+tE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,qCAGA,OAAAr7B,EAAAH,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAG,GAAA,MAMA,OAHAA,EAAA8jE,MAAA,CACArkE,EAAA,mCAEAO,iECjDA,aAEA,IAAAuiE,EAAA/jE,EAAA,kCAoDAc,EAAA2I,KAAA,MACA3I,EAAA8vD,QAnDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAlvD,EAAAkvD,EAAA,MAAA,CACA5uB,OAAAtjC,KAAAgD,IACA5B,QAAA,SAAArB,GACA,OAAAA,EAAAiD,OAEA2zD,UAAA,SAAA52D,GACA,OAAAA,EAAAiD,OAEAirE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,oCAGA,OAAAv4B,EAAAjD,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAAiD,GAAA,MAMA,OAHAA,EAAAghE,MAAA,CACArkE,EAAA,kCAEAqD,iECnDA,aAEA,IAAAy/D,EAAA/jE,EAAA,kCA4DA,IAAAg0G,EAAA1yG,KAAA6D,MAAA,SAAA9D,GACA,IAAAnB,EAAAoB,KAAAC,IAAA,EAAAF,GACA,OAAAnB,EAAA,IAAAA,EAAA,IAGAY,EAAA2I,KAAA,OACA3I,EAAA8vD,QAhEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,IAAAruD,EAAAquD,EAAA,OAAA,CACA5uB,OAAAovE,EACAtxG,QAAA,SAAArB,GACA,OAAAA,EAAA8D,QAEA8yD,UAAA,SAAA52D,GACA,OAAAA,EAAA8D,QAEAoqE,KAAA,SAAAluE,GACA,IAAAA,EAAAmyG,QAAAj5D,EAAAg1B,KAAAkkC,WAAAC,OACA,MAAA,IAAA72E,UAAA,qCAGA,OAAA13B,EAAA9D,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GAEA,OAAA0iE,EAAA1iE,EAAA8D,GAAA,MAMA,OAHAA,EAAAmgE,MAAA,CACArkE,EAAA,mCAEAkE,iECpDA,aAEAjE,EAAAJ,QAAA,CAAAd,EAAA,6CCFA,aA4EAc,EAAA2I,KAAA,KACA3I,EAAA8vD,QA3EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,qBAEA2zD,EAAAG,EAAA9zD,EAAA,sCACA6xF,EAAA/9B,EAAA9zD,EAAA,wCACA8xF,EAAAh+B,EAAA9zD,EAAA,wCA0BAg4D,EAAAxE,EAAA,KAAA,CACAygD,sBAAA,SAAA5yG,EAAAq5D,GACA,OAAAr5D,EAAA22D,GAAA0C,IAEAu7B,iBAAA,SAAA50F,EAAA+C,GAEA,OAAAytF,EAAAxwF,EAAA+C,EAAA4zD,IAEAm6B,eAAA,SAAA9wF,EAAA+C,GAEA,OAAA4zD,EAAArE,EAAAtyD,GAAAsyD,EAAAvvD,IAAA0C,WAEAsrF,gBAAA,SAAA/wF,EAAA+C,GAEA,OAAA4zD,EAAArE,EAAAtyD,GAAA+C,IAEAiuF,gBAAA,SAAAhxF,EAAA+C,GAEA,OAAA4zD,EAAA32D,EAAAsyD,EAAAvvD,KAEA8vG,cAAA,SAAA7yG,EAAA+C,GAEA,OAAA0tF,EAAAzwF,EAAA+C,EAAA4zD,GAAA,IAEAm8C,cAAA,SAAA9yG,EAAA+C,GAEA,OAAA0tF,EAAA1tF,EAAA/C,EAAA22D,GAAA,IAEA06B,aAAA,SAAArxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAtyD,GAAA+C,EAAA4zD,GAAA,GAAAlxD,WAEA6rF,aAAA,SAAAtxF,EAAA+C,GAEA,OAAA0tF,EAAAn+B,EAAAvvD,GAAA/C,EAAA22D,GAAA,GAAAlxD,aAMA,OAHAkxD,EAAAsN,MAAA,CACAwtB,EAAA,oBAAAhuC,OAAAkjB,EAAApC,UAAA,GAAA,uBAEA5N,gLCzEA,aAEA,IAAAjqC,EAAA/tB,EAAA,sBA6BAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QA5BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAmBA,IAAA9sD,EAAA8sD,EAAA,QAAA,CACA2Q,IAAAp2C,EAAArnB,QAIA,OAFAA,EAAA4+D,WAAA/iE,EAEAmE,qDC5BA,aA6CA5F,EAAA2I,KAAA,kBACA3I,EAAA8vD,QA5CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAoQ,EAAA9P,EAAA9zD,EAAA,gBAuCA,OARAwzD,EAAA,kBAAA,CACAp4B,OAAA,SAAA/5B,GACA,OAAA,EAAAA,EAAAusD,OAAA5sD,SAAAgC,MAAAR,OAAAnB,KAEA8iE,IAAA,SAAA9iE,GACA,OAAAuiE,EAAAviE,kDCvCA,aAEAH,EAAAJ,QAAA,CAAAd,EAAA,WAAAA,EAAA,eAAAA,EAAA,gBAAAA,EAAA,eAAAA,EAAA,qBAAAA,EAAA,gBAAAA,EAAA,aAAAA,EAAA,YAAAA,EAAA,WAAAA,EAAA,kNCFA,aAEA,IAAA+jE,EAAA/jE,EAAA,kCAEA4kC,EAAA5kC,EAAA,sBAgDAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QA/CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA8BA,IAAApkD,EAAAokD,EAAA,YAAA,CACA5uB,OAAAA,EAAAx1B,UAEA6oD,UAAA,SAAA52D,GACA,OAAAA,EAAAgO,SAEA0L,SAAA,SAAA1Z,GACA,OAAA,IAAAA,EAAAoC,GAAAhB,SAAApB,EAAAlB,IAEA6jE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA+N,MAGA,OAAAA,0FCjDA,aAEA,IAAA20D,EAAA/jE,EAAA,kCAuDAc,EAAA2I,KAAA,QACA3I,EAAA8vD,QAtDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAkDA,OApBAA,EAAA,QAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAmB,OAAAQ,MAAA3B,IAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAA2B,SAEA+X,SAAA,SAAA1Z,GACA,OAAA,GAEAqB,QAAA,SAAArB,GACA,OAAAA,EAAA2B,SAEAusE,KAAA,SAAAluE,GACA,OAAAmB,OAAAQ,MAAA3B,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAmB,OAAAQ,yECnDA,aAEA,IAAA+gE,EAAA/jE,EAAA,kCAoDAc,EAAA2I,KAAA,aACA3I,EAAA8vD,QAnDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA8BA,IAAAlkD,EAAAkkD,EAAA,aAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAAA,EAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAAkN,UAAAlN,EAAA0F,WAAA1F,EAAA2B,SAEA+X,SAAA,SAAA1Z,GACA,OAAAA,EAAAgK,EAAA,GAEAkkE,KAAA,SAAAluE,GACA,OAAAiO,EAAAjO,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAiO,MAGA,OAAAA,iECnDA,aAEA,IAAAy0D,EAAA/jE,EAAA,kCA8CAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QA7CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA8BA,IAAAoQ,EAAApQ,EAAA,YAAA,CACA4gD,0CAAA,WACA,OAAA,GAEAC,oDAAA,WACA,OAAA,GAEArwC,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAuiE,MAGA,OAAAA,iEC7CA,aAEA,IAAAG,EAAA/jE,EAAA,kCAsDAc,EAAA2I,KAAA,aACA3I,EAAA8vD,QArDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAgCA,IAAAjkD,EAAAikD,EAAA,aAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,EAAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAAkN,UAAAlN,EAAA0F,WAAA1F,EAAA2B,SAEA+X,SAAA,SAAA1Z,GACA,OAAA,EAAAA,EAAAgK,GAAA,EAAAhK,EAAAlB,GAEAovE,KAAA,SAAAluE,GACA,OAAAkO,EAAAlO,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAkO,MAGA,OAAAA,iECrDA,aAEA,IAAAw0D,EAAA/jE,EAAA,kCAiFAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QAhFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA6BA,IAAAsQ,EAAAtQ,EAAA,UAAA,CACA5uB,OAAA,SAAAvjC,GACA,GAAAA,EAAA,EACA,OAAA,EAGA,GAAA,IAAAA,EACA,OAAA,EAGA,GAAAA,EAAA,GAAA,EACA,OAAA,EAGA,IAAA,IAAAf,EAAA,EAAAA,EAAAA,GAAAe,EAAAf,GAAA,EACA,GAAAe,EAAAf,GAAA,EACA,OAAA,EAIA,OAAA,GAEA23D,UAAA,SAAA52D,GACA,GAAAA,EAAAqO,GAAA,GACA,OAAA,EAGA,GAAArO,EAAAoF,OAAA,GACA,OAAA,EAGA,GAAApF,EAAAqP,IAAA,GAAA3J,SACA,OAAA,EAGA,IAAA,IAAAzG,EAAAi6C,EAAA0d,UAAA,GAAA33D,EAAA+L,MAAA/L,GAAAoO,IAAArN,GAAAf,EAAAA,EAAAwC,KAAA,GACA,GAAAzB,EAAAqP,IAAApQ,GAAAyG,SACA,OAAA,EAIA,OAAA,GAEAi9D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAyiE,MAGA,OAAAA,iEChFA,aAEA,IAAAC,EAAA/jE,EAAA,kCA2DAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QA1DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAkCA,IAAAzsD,EAAAysD,EAAA,SAAA,CACA5uB,OAAA,SAAAvjC,GACA,OAAA,IAAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAA0F,UAEArE,QAAA,SAAArB,GACA,OAAA,IAAAA,EAAAgB,IAAA,IAAAhB,EAAAiB,IAEAyY,SAAA,SAAA1Z,GACA,OAAA,IAAAA,EAAAoC,GAAA,IAAApC,EAAAlB,GAEAovE,KAAA,SAAAluE,GACA,OAAA0F,EAAA1F,EAAAiG,QAEA08D,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA0F,MAGA,OAAAA,iEC1DA,aAEA,SAAAutG,EAAAx+F,GAAA,OAAAw+F,EAAA,mBAAAx8F,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAgGAhV,EAAA2I,KAAA,SACA3I,EAAA8vD,QA/FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA2DA,IAAAoB,EAAApB,EAAA,UAAA,CACA2Q,IAAA,SAAA9iE,GACA,IAAAjB,EAAAk0G,EAAAjzG,GAEA,MAAA,WAAAjB,EAEA,OAAAiB,EAAA,OACAgf,MAAA2gB,QAAA3/B,GAAA,QACAA,aAAAghB,KAAA,OACAhhB,aAAA6jB,OAAA,SAEAq1B,EAAA6b,YAAA/0D,GAAA,YACAk5C,EAAA4b,UAAA90D,GAAA,UACAk5C,EAAA8b,WAAAh1D,GAAA,WACAk5C,EAAA+b,SAAAj1D,GAAA,SACAk5C,EAAA2b,OAAA70D,GAAA,OACAk5C,EAAAlX,QAAAhiC,GAAA,QACAk5C,EAAAoc,QAAAt1D,GAAA,QACAk5C,EAAAqc,YAAAv1D,GAAA,YACAk5C,EAAAwc,OAAA11D,GAAAA,EAAAk5C,KACAA,EAAAsd,QAAAx2D,GAAA,QACAk5C,EAAAsc,OAAAx1D,GAAA,OACA,SAGA,aAAAjB,EAAA,WACAA,KAMA,OAFAw0D,EAAA0Q,WAAA/iE,EAEAqyD,6BC/FA,aAEA1zD,EAAAJ,QAAA,CAAAd,EAAA,uDCFA,aAoBAc,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QApBA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GAOA,OAAA,SAAA76C,EAAAlR,GACA,IAAA8D,EAAAmvC,EAAAjzC,GAAAA,EAAAmyD,SAAApG,EAAAC,YAAAD,EAAAC,WAAAuR,KAAAv9D,GAAAA,EAAAmyD,QAEA,OAAAruD,GAAA,mBAAAA,EAAAsuD,SACAtuD,EAAAsuD,SAAApyD,GAGAA,IAOAxG,EAAAuyD,MAAA,4BCvBA,aAEAjsD,OAAAC,eAAAvG,EAAA,aAAA,CACAwG,OAAA,IAEAxG,EAAA8vD,QAOA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAAA4E,EAAAs8C,EAAAhzF,QAAA7a,MAAA,CACAuB,UAAA4N,EAAA5N,YA0CA,OAnCAgwD,EAAA90D,UAAAo3C,KAAA,YACA0d,EAAA90D,UAAAizD,aAAA,EAQA6B,EAAA90D,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,YACAnyD,MAAApE,KAAAyD,aAWAsxD,EAAAyB,SAAA,SAAA1D,GACA,OAAA,IAAAiC,EAAAjC,EAAA1uD,QAIA+rD,EAAAsmC,GAAA,SAAA,SAAAllC,EAAAF,GACAE,EAAAxsD,YAAAssD,EAAAtsD,WACAgwD,EAAApiD,OAAA,CACA5N,UAAAwsD,EAAAxsD,cAIAgwD,GAlDAn3D,EAAAuyD,KAAAvyD,EAAA2oC,KAAA3oC,EAAA2I,UAAA,EAEA,IAEAqM,EAFAy+F,GAEAz+F,EAFA9V,EAAA,gBAEA8V,EAAA0+F,WAAA1+F,EAAA,CAAAyL,QAAAzL,GAkDAhV,EAAA2I,KADA,YAGA3I,EAAA2oC,KADA,OAIA3oC,EAAAuyD,MAFA,0CC/DA,aAEA,IAAA0Q,EAAA/jE,EAAA,qCA4DAc,EAAA2I,KAAA,YACA3I,EAAA8vD,QA3DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAA4G,EAAA5G,EAAA,YAAA,CACA8Q,GAAA,WACA,OAAA,IAAA/pB,EAAA0d,UAAA,IAEArzB,OAAA,SAAAvjC,GAEA,OAAA,IAAAk5C,EAAA0d,UAAA52D,EAAA,KAEA+5B,OAAA,SAAA/5B,GACA,OAAA,IAAAk5C,EAAA0d,UAAA52D,IAEA42D,UAAA,SAAA52D,GAEA,OAAAA,GAEA0Z,SAAA,SAAA1Z,GACA,OAAA,IAAAk5C,EAAA0d,UAAA52D,EAAAlB,GAAAqD,IAAAnC,EAAAoC,GAAA4I,MAAAhL,EAAAgK,IAEAwpE,KAAA,SAAAxzE,GACA,OAAA,IAAAk5C,EAAA0d,UAAA,IAEA+L,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA+4D,MAOA,OAJAA,EAAAkL,MAAA,CACAmvC,EAAA,IACAxzG,EAAA,6BAEAm5D,oEC3DA,aAEAl5D,EAAAJ,QAAA,CACAd,EAAA,eACAA,EAAA,+FCJA,aAEA,IAAA+jE,EAAA/jE,EAAA,iCAwEAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QAvEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA4BA,IAAAkhD,EAAAlhD,EAAA,OAAA,CACA8Q,GAAA,WACA,OAAA,GAEAg0B,QAAA,SAAAj3F,GACA,OAAAA,GAEAujC,OAAA,SAAAvjC,GACA,QAAAA,GAEAwzE,KAAA,SAAAxzE,GACA,OAAA,GAEA42D,UAAA,SAAA52D,GACA,OAAAA,EAAA0F,UAEAq0B,OAAA,SAAA/5B,GAEA,IAAAszG,EAAAtzG,EAAA0V,cAEA,GAAA,SAAA49F,EACA,OAAA,EACA,GAAA,UAAAA,EACA,OAAA,EAIA,IAAA1kG,EAAAzN,OAAAnB,GAEA,GAAA,KAAAA,IAAA2B,MAAAiN,GACA,QAAAA,EAGA,MAAA,IAAAtP,MAAA,mBAAAU,EAAA,mBAEA2iE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAqzG,MAGA,OAAAA,gECvEA,aAEA,IAAAn7C,EAAAv5D,EAAA,sBAAAu5D,OAEA1E,EAAA70D,EAAA,sBAAA60D,KA0LA/zD,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QA1LA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GAmBA,SAAAuhD,EAAAttG,GACA,KAAApE,gBAAA0xG,GACA,MAAA,IAAAlzG,YAAA,oDAGA64C,EAAAsd,QAAAvwD,GACApE,KAAAoE,MAAAA,EAAAA,MAEApE,KAAAoE,MAAAA,EAuEA,SAAAutG,EAAAprG,EAAAguC,GACA,mBAAAA,IACAm9D,EAAAzxG,UAAAsG,GAAAqrG,EAAAr9D,IA+BA,SAAAq9D,EAAAr9D,GACA,OAAA,WAGA,IAFA,IAAA3iC,EAAA,CAAA5R,KAAAoE,OAEAhH,EAAA,EAAAA,EAAA+V,UAAArV,OAAAV,IACAwU,EAAAxU,EAAA,GAAA+V,UAAA/V,GAGA,OAAA,IAAAs0G,EAAAn9D,EAAA78B,MAAA68B,EAAA3iC,KA0CA,OAlJA8/F,EAAAzxG,UAAAo3C,KAAA,QACAq6D,EAAAzxG,UAAA00D,SAAA,EAOA+8C,EAAAzxG,UAAA69C,KAAA,WACA,OAAA99C,KAAAoE,OASAstG,EAAAzxG,UAAA2D,QAAA,WACA,OAAA5D,KAAAoE,OAQAstG,EAAAzxG,UAAAwD,SAAA,WACA,OAAA4yD,EAAAr2D,KAAAoE,QAQAstG,EAAAzxG,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,QACAnyD,MAAApE,KAAAoE,QAYAstG,EAAAl7C,SAAA,SAAA1D,GACA,OAAA,IAAA4+C,EAAA5+C,EAAA1uD,QAuEAstG,EAAAC,YAAA,SAAAn0B,EAAAF,GACA,GAAA,iBAAAE,EAEAm0B,EAAAn0B,EAAAF,QAGA,IAAA,IAAA1iE,KAAA4iE,EACAA,EAAA9oE,eAAAkG,IACA+2F,EAAA/2F,EAAA4iE,EAAA5iE,KAOA82F,EAAAC,YAAAxhD,GAEAA,EAAAsmC,GAAA,SAAA,SAAAlwF,EAAAy2C,EAAAzW,QACAlnC,IAAAknC,GAhEA,SAAAhgC,EAAAy2C,GACA2U,EAAA+/C,EAAAzxG,UAAAsG,EAAA,WACA,IAAAguC,EAAAyI,IAEA,GAAA,mBAAAzI,EACA,OAAAq9D,EAAAr9D,KA6DAs9D,CAAAtrG,EAAAy2C,KAGA00D,GAMA9zG,EAAAuyD,MAAA,EAEAvyD,EAAA+zD,MAAA,6ECnMA,aAgDA/zD,EAAA2I,KAAA,QACA3I,EAAA8vD,QA/CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAoCA,OAAAA,EAAA,QAAA,CACA8Q,GAAA,WACA,OAAA,IAAA/pB,EAAAq6D,OAEAzwC,IAAA,SAAA78D,GACA,OAAA,IAAAizC,EAAAq6D,MAAAttG,iCC3CA,aAEApG,EAAAJ,QAAA,CACAd,EAAA,WACAA,EAAA,mFCJA,aAEA,SAAA40D,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAApT,EAAA1C,EAAA,cAEAu5D,EAAAv5D,EAAA,sBAAAu5D,OAEA1Y,EAAA7gD,EAAA,sBAAA6gD,SAiNA//C,EAAA2I,KAAA,UACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QAjNA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GA4MA,OAxMA3wD,EAAAS,UAAAo3C,KAAA,UACA73C,EAAAS,UAAAgzD,WAAA,EAOAzzD,EAAAS,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,UACAp3D,GAAAa,KAAAb,GACAC,GAAAY,KAAAZ,KAUAI,EAAAS,UAAA6xG,QAAA,WACA,MAAA,CACA/0G,EAAAiD,KAAApB,MACAg5D,IAAA53D,KAAAS,QAcAjB,EAAAS,UAAAo2D,OAAA,SAAA7a,GACA,IACAp8C,EAAAY,KAAAZ,GACAD,EAAAa,KAAAb,GACA4yG,EAAA17C,EAAAr2D,KAAAb,GAAAq8C,GACAw2D,EAAA37C,EAAAr2D,KAAAZ,GAAAo8C,GAEAz2C,EAAA44C,EAAAnC,GAAAA,EAAAA,EAAAA,EAAAz2C,UAAA,KAEA,GAAA,OAAAA,EAAA,CACA,IAAAyrD,EAAApyD,KAAAoC,IAAA,IAAAuE,GAEA3G,KAAAQ,IAAAO,EAAAC,GAAAoxD,IACArxD,EAAA,GAGAf,KAAAQ,IAAAQ,EAAAD,GAAAqxD,IACApxD,EAAA,GAiCA,OA7BA,IAAAA,EAEA2yG,EACA,IAAA5yG,EAEA,IAAAC,EACA,KACA,IAAAA,EACA,KAEA4yG,EAAA,IAIA5yG,EAAA,GACA,IAAAA,EACA2yG,EAAA,OAEAA,EAAA,MAAAC,EAAAz/F,UAAA,GAAA,IAGA,IAAAnT,EACA2yG,EAAA,OAEAA,EAAA,MAAAC,EAAA,KAoBAxyG,EAAAyyG,UAAA,SAAArgG,GACA,OAAAuB,UAAArV,QACA,KAAA,EACA,IAAA2C,EAHAmR,EAKA,GAAA,WAAA8/C,EAAAjxD,GACA,OAAAjB,EAAAiB,GAGA,MAAA,IAAAk5B,UAAA,kDAEA,KAAA,EACA,IAAA58B,EAZA6U,EAaAgmD,EAAAzkD,UAAA,GAEA,GAAAwqC,EAAA5gD,GAAA,CAMA,GALAs6C,EAAA2b,OAAA4E,IAAAA,EAAA04C,QAAA,WAEA14C,EAAAA,EAAAxoD,SAAA,QAGAuuC,EAAAia,GACA,OAAA,IAAAp4D,EAAA,CACAzC,EAAAA,EACA66D,IAAAA,IAIA,MAAA,IAAAj+B,UAAA,0CAEA,MAAA,IAAAA,UAAA,6BAGA,QACA,MAAA,IAAAn7B,YAAA,qDAIAgB,EAAAS,UAAA2D,QAAApE,EAAAS,UAAAwD,SAUAjE,EAAAg3D,SAAA,SAAA1D,GACA,OAAA,IAAAtzD,EAAAszD,IAIAtzD,EAAA0yG,QAAAv/F,EAAA69C,QAEAL,EAAAsmC,GAAA,SAAA,SAAAllC,EAAAF,GACAE,EAAAf,UAAAa,EAAAb,UACAhxD,EAAA0yG,QAAA3gD,EAAAf,WAmBAhxD,EAAAwQ,QAAA,SAAAxS,EAAAkB,GACA,OAAAlB,EAAA2B,GAAAT,EAAAS,GACA,EAGA3B,EAAA2B,GAAAT,EAAAS,IACA,EAGA3B,EAAA4B,GAAAV,EAAAU,GACA,EAGA5B,EAAA4B,GAAAV,EAAAU,IACA,EAGA,GAGAI,GAMA5B,EAAAuyD,MAAA,mEC5NA,aAEA,IAAA0Q,EAAA/jE,EAAA,qCA0FAc,EAAA2I,KAAA,UACA3I,EAAA8vD,QAzFA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAwU,EAAAhoE,EAAA,wBAyCAq6D,EAAA7G,EAAA,UAAA,CACA8Q,GAAA,WACA,OAAA/pB,EAAA73C,QAAAykG,MAEAviE,OAAA,SAAAvjC,GACA,OAAA,IAAAk5C,EAAA73C,QAAArB,EAAA,IAEA0xF,iBAAA,SAAA1wF,EAAAC,GACA,OAAA,IAAAi4C,EAAA73C,QAAAL,EAAAC,IAGA2wF,uBAAA,SAAA5wF,EAAAC,GACA,OAAA,IAAAi4C,EAAA73C,QAAAL,EAAAiQ,WAAAhQ,EAAAgQ,aAEA5P,QAAA,SAAArB,GACA,OAAAA,EAAAqF,SAEA00B,OAAA,SAAA/5B,GACA,OAAAk5C,EAAA73C,QAAArB,IAEAwzE,KAAA,SAAAxzE,GACA,OAAAk5C,EAAA73C,QAAA,IAEA0E,OAAA,SAAA/F,GACA,GAAA,OAAAA,GAAA,OAAAA,EACA,OAAA,IAAAk5C,EAAA73C,QAAArB,EAAAgB,GAAAhB,EAAAiB,IAGA,GAAA,MAAAjB,GAAA,QAAAA,GAAA,QAAAA,GAAA,QAAAA,EACA,OAAA,IAAAk5C,EAAA73C,QAAArB,GAGA,MAAA,IAAAV,MAAA,gFAEAqjE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAg5D,MAQA,OALAA,EAAAiL,MAAA,CACAmvC,EAAA,IACAxzG,EAAA,4BACA6xF,EAAA,oCAAAhuC,OAAAkjB,EAAAqtC,QAAA,EAAA,4CAEAh7C,+FCzFA,aAEAn5D,EAAAJ,QAAA,CACAd,EAAA,aACAA,EAAA,yFCJA,aAEA,IAAA+a,EAAA/a,EAAA,eAMA+a,EAAA5X,UAAAo3C,KAAA,WACAx/B,EAAA5X,UAAAkzD,YAAA,EAOAt7C,EAAA5X,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,WACAt5D,EAAA+C,KAAAmI,EAAAnI,KAAA/C,EACAsD,EAAAP,KAAAO,IAWAsX,EAAA2+C,SAAA,SAAA1D,GACA,OAAA,IAAAj7C,EAAAi7C,IAOAl1D,EAAA2I,KAAA,WACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QANA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,OAAAz4C,4CCpCA,aAEA,IAAAgpD,EAAA/jE,EAAA,qCA6DAc,EAAA2I,KAAA,WACA3I,EAAA8vD,QA5DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAA+G,EAAA/G,EAAA,WAAA,CACA5uB,OAAA,SAAAvjC,GACA,IAAAoB,SAAApB,IAAA2B,MAAA3B,GACA,MAAA,IAAAV,MAAAU,EAAA,wCAGA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,IAEA+5B,OAAA,SAAA/5B,GACA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,IAEA0xF,iBAAA,SAAA59E,EAAApF,GACA,OAAA,IAAAwqC,EAAAx/B,SAAA5F,EAAApF,IAEA8kE,KAAA,SAAAxzE,GACA,OAAA,IAAAk5C,EAAAx/B,SAAA,IAEAk9C,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,EAAAsF,aAEAoU,SAAA,SAAA1Z,GACA,OAAAA,GAEA+F,OAAA,SAAA/F,GACA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,IAEA2iE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAk5D,MAGA,OAAAA,oEC5DA,aAEAr5D,EAAAJ,QAAA,CACAd,EAAA,cACAA,EAAA,4FCJA,aAEAkB,EAAAJ,QAAA,CAAAd,EAAA,eAAAA,EAAA,aAAAA,EAAA,WAAAA,EAAA,aAAAA,EAAA,cAAAA,EAAA,YAAAA,EAAA,YAAAA,EAAA,aAAAA,EAAA,eAAAA,EAAA,YAAAA,EAAA,iNCFA,aAEA,IAAA+kF,EAAA/kF,EAAA,qBAEAq4D,EAAAr4D,EAAA,8BAEAo7B,EAAA2pD,EAAA3pD,OACAxP,EAAAm5D,EAAAn5D,MACAmC,EAAAg3D,EAAAh3D,OACA6W,EAAAmgD,EAAAngD,OACA5D,EAAA3gB,MAAA2gB,QACA6f,EAAAjc,EAAAic,SACAzxC,EAAAw1B,EAAAx1B,UACA0xC,EAAA1lB,EAAA0lB,SACAqoD,EAAAv9E,EAAAu9E,cAs5BAroG,EAAA2I,KAAA,cACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QAt5BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAiyC,EAAA3xC,EAAA9zD,EAAA,6BACAmyE,EAAAre,EAAA9zD,EAAA,aAOA,SAAAm4D,EAAAv1B,EAAA4oD,GACA,KAAAtoF,gBAAAi1D,GACA,MAAA,IAAAz2D,YAAA,oDAGA,GAAA8pF,IAAA1qC,EAAA0qC,GACA,MAAA,IAAA7qF,MAAA,qBAAA6qF,GAGA,GAAAjxC,EAAA+b,SAAA1zB,GAEA,gBAAAA,EAAA2X,MAEAr3C,KAAAi4E,MAAAptD,EAAArnB,MAAAk8B,EAAAu4C,OACAj4E,KAAA+3E,MAAAltD,EAAArnB,MAAAk8B,EAAAq4C,SAIA/3E,KAAAi4E,MAAAv4C,EAAAtiB,UACApd,KAAA+3E,MAAAr4C,EAAArH,QAJAr4B,KAAAuoF,UAAAD,GAAA5oD,EAAA6oD,eAOA,GAAA7oD,GAAA5B,EAAA4B,EAAAA,OAAA5B,EAAA4B,EAAArH,MAEAr4B,KAAAi4E,MAAAv4C,EAAAA,KACA1/B,KAAA+3E,MAAAr4C,EAAArH,KACAr4B,KAAAuoF,UAAAD,GAAA5oD,EAAA4oD,cACA,GAAAxqD,EAAA4B,GAEA1/B,KAAAi4E,MAy1BA,SAAAm6B,EAAA1yE,GACA,IAAA,IAAAtiC,EAAA,EAAA45E,EAAAt3C,EAAA5hC,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAA8xE,EAAAxvC,EAAAtiC,GAEA0gC,EAAAoxC,GACAxvC,EAAAtiC,GAAAg1G,EAAAljC,GACAA,IAAA,IAAAA,EAAA9b,WACA1zB,EAAAtiC,GAAAg1G,EAAAljC,EAAAtrE,YAIA,OAAA87B,EAp2BA0yE,CAAA1yE,GAEA1/B,KAAA+3E,MAAArvD,EAAA2P,KAAAr4B,KAAAi4E,OAEAvvD,EAAAylF,SAAAnuG,KAAAi4E,MAAAj4E,KAAA+3E,OAEA/3E,KAAAuoF,UAAAD,MACA,CAAA,GAAA5oD,EAEA,MAAA,IAAA/F,UAAA,6BAAAkoD,EAAAp6D,MAAA4vB,KAAA3X,GAAA,KAGA1/B,KAAAi4E,MAAA,GACAj4E,KAAA+3E,MAAA,CAAA,GACA/3E,KAAAuoF,UAAAD,GA8XA,SAAA+pB,EAAA5hD,EAAAp4B,EAAA2c,GAEA,GAAA,IAAA3c,EAAAv6B,OAgBA,OAJA2yD,EAAAsnB,MAAA1/C,EAAAxuB,MAAA,GAEA4mD,EAAAwnB,MAAAvvD,EAAAw1C,OAAAzN,EAAAwnB,MAAAxnB,EAAAsnB,MAAA/iC,GAEAyb,EAZA,IAFA,IAAA59C,EAAA49C,EAAAwnB,MAEAn6C,EAAAjrB,IACAA,EAAAA,EAAA,GAGA,OAAAA,EA2CA,SAAAy/F,EAAA7hD,EAAAp4B,EAAA2c,GAMA,IALA,IACAu9D,EAAA9hD,EAAAsnB,MAAAluE,MAAA,GAEA2oG,GAAA,EAEAD,EAAAz0G,OAAAu6B,EAAAv6B,QACAy0G,EAAAnlG,KAAA,GACAolG,GAAA,EAIA,IAAA,IAAAp1G,EAAA,EAAA45E,EAAA3+C,EAAAv6B,OAAAV,EAAA45E,EAAA55E,IACAi7B,EAAAj7B,GAAAm1G,EAAAn1G,KACAm1G,EAAAn1G,GAAAi7B,EAAAj7B,GACAo1G,GAAA,GAIAA,GAEAH,EAAA5hD,EAAA8hD,EAAAv9D,GAqZA,OAz1BAigB,EAAAh1D,UAAA,IAAAgvE,GAKA53B,KAAA,cACA4d,EAAAh1D,UAAAszD,eAAA,EAWA0B,EAAAh1D,UAAAuiG,YAAA,WACA,OAAAD,EAAAviG,KAAAi4E,QAaAhjB,EAAAh1D,UAAAuzF,QAAA,WACA,MAAA,SAaAv+B,EAAAh1D,UAAAqoF,SAAA,WACA,OAAAtoF,KAAAuoF,WAUAtzB,EAAAh1D,UAAA86B,OAAA,SAAA2E,EAAA4oD,GACA,OAAA,IAAArzB,EAAAv1B,EAAA4oD,IAkBArzB,EAAAh1D,UAAAo+D,OAAA,SAAA9mD,EAAA8uF,EAAArxD,GACA,OAAA7hC,UAAArV,QACA,KAAA,EACA,OAgGA,SAAA2yD,EAAAl5C,GACA,IAAA8/B,EAAAlX,QAAA5oB,GACA,MAAA,IAAAoiB,UAAA,iBAKA,GAFApiB,EAAAivF,WAIA,OAAA/1C,EAAA51C,IAAAtD,EAAAvQ,OAGA,IAAAqxB,EAAA9gB,EAAA8gB,OAEA,GAAAA,EAAAv6B,SAAA2yD,EAAAsnB,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA98B,EAAAv6B,OAAA2yD,EAAAsnB,MAAAj6E,QAOA,IAHA,IAAAkJ,EAAAuQ,EAAAvQ,MACAC,EAAAsQ,EAAAtQ,MAEA7J,EAAA,EAAA45E,EAAAvmB,EAAAsnB,MAAAj6E,OAAAV,EAAA45E,EAAA55E,IACA6oG,EAAAj/F,EAAA5J,GAAAqzD,EAAAsnB,MAAA36E,IACA6oG,EAAAh/F,EAAA7J,GAAAqzD,EAAAsnB,MAAA36E,IAKA,OAAA,IAAA63D,EAgBA,SAAAw9C,EAAA/yE,EAAAnoB,EAAAm7F,EAAAx8B,GACA,IAAAnuC,EAAAmuC,IAAAw8B,EAAA,EACA5xD,EAAAvpC,EAAA4uF,UAAAjwB,GAEA,OAAAnuC,EACA+Y,EAAA1oB,IAAA,SAAAh7B,GAEA,OADA6oG,EAAA7oG,EAAAsiC,EAAA5hC,QACA4hC,EAAAtiC,KACAwG,UAEAk9C,EAAA1oB,IAAA,SAAAh7B,GACA6oG,EAAA7oG,EAAAsiC,EAAA5hC,QACA,IAAAoqE,EAAAxoC,EAAAtiC,GACA,OAAAq1G,EAAAvqC,EAAA3wD,EAAAm7F,EAAAx8B,EAAA,KACAtyE,UA9BA6uG,CAAAhiD,EAAAwnB,MAAA1gE,EAAA8gB,EAAAv6B,OAAA,GAAA2yD,EAAA83B,WA7HAoqB,CAAA3yG,KAAAuX,GAGA,KAAA,EACA,KAAA,EACA,OAuKA,SAAAk5C,EAAAl5C,EAAAq7F,EAAA59D,GACA,IAAAz9B,IAAA,IAAAA,EAAA4oB,QACA,MAAA,IAAAxG,UAAA,iBAIA,IAGAk5E,EAHAC,EAAAv7F,EAAA8gB,OACAmuE,EAAAjvF,EAAAivF,WAWA,GAPAnvD,EAAA+b,SAAAw/C,IACAC,EAAAD,EAAAv6E,OACAu6E,EAAAA,EAAAhvG,WAEAivG,EAAAnqF,EAAA2P,KAAAu6E,GAGApM,EAAA,CAGA,GAAA,IAAAqM,EAAA/0G,OACA,MAAA,IAAA67B,UAAA,mBAGA82B,EAAAh8C,IAAA8C,EAAAvQ,MAAA4rG,EAAA59D,OACA,CAGA,GAAA89D,EAAAh1G,OAAA2yD,EAAAsnB,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA29C,EAAAh1G,OAAA2yD,EAAAsnB,MAAAj6E,OAAA,KAGA,GAAA+0G,EAAA/0G,OAAAg1G,EAAAh1G,OAAA,CAKA,IAHA,IAAAV,EAAA,EACAonC,EAAA,EAEA,IAAAsuE,EAAA11G,IAAA,IAAAy1G,EAAAz1G,IACAA,IAGA,KAAA,IAAA01G,EAAA11G,IACAonC,IACApnC,IAIAw1G,EAAAlqF,EAAAqqF,UAAAH,EAAAE,EAAAh1G,OAAA0mC,EAAAquE,GAIA,IAAAhoF,EAAAs0C,UAAA2zC,EAAAD,GACA,MAAA,IAAA19C,EAAA29C,EAAAD,EAAA,KAIA,IAAAx6E,EAAA9gB,EAAAtQ,MAAAmxB,IAAA,SAAAh7B,GACA,OAAAA,EAAA,IAGAk1G,EAAA7hD,EAAAp4B,EAAA2c,GAGA,IAAA09D,EAAAI,EAAAh1G,QAoBA,SAAAk1G,EAAAtzE,EAAAnoB,EAAAq7F,EAAAF,EAAAx8B,GACA,IAAAnuC,EAAAmuC,IAAAw8B,EAAA,EACA5xD,EAAAvpC,EAAA4uF,UAAAjwB,GAEAnuC,EACA+Y,EAAAxpC,QAAA,SAAA27F,EAAAC,GACAjN,EAAAgN,GACAvzE,EAAAuzE,GAAAL,EAAAM,EAAA,MAGApyD,EAAAxpC,QAAA,SAAA27F,EAAAC,GACAjN,EAAAgN,GAEAD,EAAAtzE,EAAAuzE,GAAA17F,EAAAq7F,EAAAM,EAAA,IAAAR,EAAAx8B,EAAA,KA9BA88B,CAAAviD,EAAAwnB,MAAA1gE,EAAAq7F,EAAAF,EAFA,GAKA,OAAAjiD,EA7OA0iD,CAAAnzG,KAAAuX,EAAA8uF,EAAArxD,GAEA,QACA,MAAA,IAAAx2C,YAAA,+BAWAy2D,EAAAh1D,UAAA4a,IAAA,SAAAtD,GACA,IAAAumB,EAAAvmB,GACA,MAAA,IAAAoiB,UAAA,kBAGA,GAAApiB,EAAAzZ,SAAAkC,KAAA+3E,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA59C,EAAAzZ,OAAAkC,KAAA+3E,MAAAj6E,QAIA,IAAA,IAAAK,EAAA,EAAAA,EAAAoZ,EAAAzZ,OAAAK,IACA8nG,EAAA1uF,EAAApZ,GAAA6B,KAAA+3E,MAAA55E,IAKA,IAFA,IAAAuhC,EAAA1/B,KAAAi4E,MAEA76E,EAAA,EAAA45E,EAAAz/D,EAAAzZ,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAAg2G,EAAA77F,EAAAna,GACA6oG,EAAAmN,EAAA1zE,EAAA5hC,QACA4hC,EAAAA,EAAA0zE,GAGA,OAAA1zE,GAcAu1B,EAAAh1D,UAAAwU,IAAA,SAAA8C,EAAAnT,EAAA4wC,GACA,IAAAlX,EAAAvmB,GACA,MAAA,IAAAoiB,UAAA,kBAGA,GAAApiB,EAAAzZ,OAAAkC,KAAA+3E,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA59C,EAAAzZ,OAAAkC,KAAA+3E,MAAAj6E,OAAA,KAGA,IAAAV,EAAA45E,EAAAo8B,EAMAd,EAAAtyG,KAJAuX,EAAA6gB,IAAA,SAAAh7B,GACA,OAAAA,EAAA,IAGA43C,GAGA,IAAAtV,EAAA1/B,KAAAi4E,MAEA,IAAA76E,EAAA,EAAA45E,EAAAz/D,EAAAzZ,OAAA,EAAAV,EAAA45E,EAAA55E,IACAg2G,EAAA77F,EAAAna,GACA6oG,EAAAmN,EAAA1zE,EAAA5hC,QACA4hC,EAAAA,EAAA0zE,GAOA,OAHAA,EAAA77F,EAAAA,EAAAzZ,OAAA,GACAmoG,EAAAmN,EAAA1zE,EAAA5hC,QACA4hC,EAAA0zE,GAAAhvG,EACApE,MA2MAi1D,EAAAh1D,UAAAi+D,OAAA,SAAA7lC,EAAA2c,EAAAvhC,GAEA,IAAAqqB,EAAAzF,GACA,MAAA,IAAAsB,UAAA,kBAMA,OAAA04E,EAFA5+F,EAAAzT,KAAAwD,QAAAxD,KAEAq4B,EAAA2c,IAuCAigB,EAAAh1D,UAAAk+D,QAAA,SAAA9lC,EAAA5kB,GACA,IAAAjK,EAAAiK,EAAAzT,KAAAwD,QAAAxD,KAGA,OAFAwJ,EAAAyuE,MAAAvvD,EAAAy1C,QAAA30D,EAAAyuE,MAAA5/C,GACA7uB,EAAAuuE,MAAA1/C,EAAAxuB,MAAA,GACAL,GA4CAyrD,EAAAh1D,UAAAuD,MAAA,WAMA,OALA,IAAAyxD,EAAA,CACAv1B,KAAA7U,EAAArnB,MAAAxD,KAAAi4E,OACA5/C,KAAAxN,EAAArnB,MAAAxD,KAAA+3E,OACAuQ,SAAAtoF,KAAAuoF,aAWAtzB,EAAAh1D,UAAAo4B,KAAA,WACA,OAAAr4B,KAAA+3E,MAAAluE,MAAA,IAcAorD,EAAAh1D,UAAAm4B,IAAA,SAAA/a,GAEA,IAAAg2F,EAAArzG,KAaA,OAAA,IAAAi1D,EAAA,CACAv1B,KAZA,SAAAq3C,EAAA3yE,EAAAmT,GACA,OAAAumB,EAAA15B,GACAA,EAAAg0B,IAAA,SAAA8vC,EAAA9qE,GACA,OAAA25E,EAAA7O,EAAA3wD,EAAAqqC,OAAAxkD,MAGAigB,EAAAjZ,EAAAmT,EAAA87F,GAMAt8B,CAAA/2E,KAAAi4E,MAAA,IACA5/C,KAAAxN,EAAArnB,MAAAxD,KAAA+3E,OACAuQ,SAAAtoF,KAAAuoF,aAYAtzB,EAAAh1D,UAAAqX,QAAA,SAAA+F,GAEA,IAAAg2F,EAAArzG,MAEA,SAAA+2E,EAAA3yE,EAAAmT,GACAumB,EAAA15B,GACAA,EAAAkT,QAAA,SAAA4wD,EAAA9qE,GACA25E,EAAA7O,EAAA3wD,EAAAqqC,OAAAxkD,MAGAigB,EAAAjZ,EAAAmT,EAAA87F,GAIAt8B,CAAA/2E,KAAAi4E,MAAA,KASAhjB,EAAAh1D,UAAAmd,QAAA,WACA,OAAAyN,EAAArnB,MAAAxD,KAAAi4E,QASAhjB,EAAAh1D,UAAA2D,QAAA,WACA,OAAA5D,KAAAi4E,OAaAhjB,EAAAh1D,UAAAo2D,OAAA,SAAA7a,GACA,OAAAtjB,EAAAm+B,OAAAr2D,KAAAi4E,MAAAz8B,IASAyZ,EAAAh1D,UAAAwD,SAAA,WACA,OAAAy0B,EAAAm+B,OAAAr2D,KAAAi4E,QASAhjB,EAAAh1D,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,cACA72B,KAAA1/B,KAAAi4E,MACA5/C,KAAAr4B,KAAA+3E,MACAuQ,SAAAtoF,KAAAuoF,YAaAtzB,EAAAh1D,UAAAihG,SAAA,SAAAz6F,GAEA,GAAAA,GAOA,GALA4wC,EAAA6b,YAAAzsD,KACAA,EAAAA,EAAA2I,aAIAuuC,EAAAl3C,KAAAyF,EAAAzF,GACA,MAAA,IAAAkzB,UAAA,kDAIAlzB,EAAA,EAaA,IAVA,IAAAs6F,EAAA,EAAAt6F,EAAAA,EAAA,EACAu6F,EAAAv6F,EAAA,GAAAA,EAAA,EAEAiuE,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,GAEA96E,EAAAmB,KAAA4I,IAAA0tE,EAAAssB,EAAAhpB,EAAA+oB,GAEArhE,EAAA,GAEAtiC,EAAA,EAAAA,EAAAH,EAAAG,IACAsiC,EAAAtiC,GAAA4C,KAAAi4E,MAAA76E,EAAA4jG,GAAA5jG,EAAA2jG,GAIA,OAAA,IAAA9rC,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAp7B,GACAqrF,SAAAtoF,KAAAuoF,aAgBAtzB,EAAAisC,SAAA,SAAA7oE,EAAAj0B,EAAAqC,EAAAuuC,EAAAszC,GACA,IAAAxqD,EAAAzF,GACA,MAAA,IAAAsB,UAAA,kCAGA,GAAA,IAAAtB,EAAAv6B,OACA,MAAA,IAAAL,MAAA,4CAmBA,GAfA46B,EAAAA,EAAAD,IAAA,SAAAjwB,GAQA,GANAkvC,EAAA6b,YAAA/qD,KAEAA,EAAAA,EAAAiH,aAIAuuC,EAAAx1C,KAAA+D,EAAA/D,IAAAA,EAAA,EACA,MAAA,IAAA1K,MAAA,yCAGA,OAAA0K,IAGA1B,GAOA,GALA4wC,EAAA6b,YAAAzsD,KACAA,EAAAA,EAAA2I,aAIAuuC,EAAAl3C,KAAAyF,EAAAzF,GACA,MAAA,IAAAkzB,UAAA,kDAIAlzB,EAAA,EAGAuuC,GAAA4I,EAAA0qC,KAEAtzC,EAAAsb,EAAA1nB,QAAAoM,EAAAszC,IAGA,IAQAimB,EARAxN,EAAA,EAAAt6F,EAAAA,EAAA,EACAu6F,EAAAv6F,EAAA,GAAAA,EAAA,EAEAiuE,EAAAr8C,EAAA,GACA2/C,EAAA3/C,EAAA,GAEAp7B,EAAAmB,KAAA4I,IAAA0tE,EAAAssB,EAAAhpB,EAAA+oB,GAKA,GAAAjjE,EAAA15B,GAAA,CAEA,GAAAA,EAAAtG,SAAAb,EAEA,MAAA,IAAAQ,MAAA,8BAIA8wG,EAAA,SAAAnxG,GAEA,OAAAgH,EAAAhH,SAEA,GAAAi6C,EAAA+b,SAAAhvD,GAAA,CAEA,IAAA68F,EAAA78F,EAAAi0B,OAEA,GAAA,IAAA4oE,EAAAnjG,QAAAmjG,EAAA,KAAAhkG,EAEA,MAAA,IAAAQ,MAAA,yBAIA8wG,EAAA,SAAAnxG,GAEA,OAAAgH,EAAAyW,IAAA,CAAAzd,UAIAmxG,EAAA,WAEA,OAAAnqG,GAKA4wC,IAEAA,EAAAqC,EAAA6b,YAAAq7C,EAAA,IAAA,IAAAl3D,EAAA0d,UAAA,GAAA,GAIA,IAAAr1B,EAAA,GAEA,GAAA,EAAArH,EAAAv6B,OAAA,CAEA4hC,EAAAhX,EAAAw1C,OAAAx+B,EAAArH,EAAA2c,GAEA,IAAA,IAAAz0C,EAAA,EAAAA,EAAAtD,EAAAsD,IACAm/B,EAAAn/B,EAAAygG,GAAAzgG,EAAAwgG,GAAAwN,EAAAhuG,GAKA,OAAA,IAAA00D,EAAA,CACAv1B,KAAAA,EACArH,KAAA,CAAAq8C,EAAAsD,MAaA/iB,EAAAuB,SAAA,SAAA1D,GACA,OAAA,IAAAmC,EAAAnC,IAaAmC,EAAAh1D,UAAAqzG,SAAA,SAAAl2G,EAAAsK,GAEA,KAAAi2C,EAAAvgD,IAAA8O,EAAA9O,IAAAugD,EAAAj2C,IAAAwE,EAAAxE,IACA,MAAA,IAAAjK,MAAA,uCAIA,GAAA,IAAAuC,KAAA+3E,MAAAj6E,OACA,MAAA,IAAAL,MAAA,4CAUA,OANAwoG,EAAA7oG,EAAA4C,KAAA+3E,MAAA,IACAkuB,EAAAv+F,EAAA1H,KAAA+3E,MAAA,IAEA9iB,EAAAwjB,UAAAr7E,EAAAsK,EAAA1H,KAAAi4E,OAGAj4E,MAUAi1D,EAAAwjB,UAAA,SAAAr7E,EAAAsK,EAAAg4B,GAEA,IAAA6zE,EAAA7zE,EAAAtiC,GACAsiC,EAAAtiC,GAAAsiC,EAAAh4B,GACAg4B,EAAAh4B,GAAA6rG,GA0BAl8D,EAAA43B,OAAAukC,SAAAvqB,MAAAh0B,EACA5d,EAAA43B,OAAAukC,SAAA,QAAAv+C,GAQAr3D,EAAA+zD,MAAA,iICv6BA,aAkYA/zD,EAAA2I,KAAA,gBACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QAlYA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAiP,EAAA3O,EAAA9zD,EAAA,sCACAuiE,EAAAzO,EAAA9zD,EAAA,qCACA22G,EAAA,EAAAr1G,KAAAU,KAAA,EAAAV,KAAAuC,KAAA,IAAA,GAOA,SAAA+yG,IACA,KAAA1zG,gBAAA0zG,GACA,MAAA,IAAAl1G,YAAA,oDAIAwB,KAAA2zG,SAAA,KACA3zG,KAAA+3E,MAAA,EA+LA,SAAA67B,EAAA/Q,EAAAlhC,EAAA75B,GAEA65B,EAAA2rC,KAAA7oB,MAAA9iB,EAAA8iB,MACA9iB,EAAA8iB,MAAA6oB,KAAA3rC,EAAA2rC,KACAxlE,EAAAoiD,SAEApiD,EAAAogC,QAAAvG,IACA75B,EAAAogC,MAAAvG,EAAA8iB,OAIA,IAAA38C,EAAAoiD,SACApiD,EAAAogC,MAAA,MAIAvG,EAAA2rC,KAAAzK,EACAlhC,EAAA8iB,MAAAoe,EAAApe,QACAoe,EAAApe,MAAA9iB,GACA8iB,MAAA6oB,KAAA3rC,GAEA75B,OAAA,KAEA65B,EAAAknB,MAAA,EA/MA6qB,EAAAzzG,UAAAo3C,KAAA,gBACAq8D,EAAAzzG,UAAA4zG,iBAAA,EAQAH,EAAAzzG,UAAA6zG,OAAA,SAAAx+F,EAAAlR,GAEA,IAAAu9D,EAAA,CACArsD,IAAAA,EACAlR,MAAAA,EACA8lF,OAAA,GAIA,GAAAlqF,KAAA2zG,SAAA,CAEA,IAAA9Q,EAAA7iG,KAAA2zG,SAEAhyC,EAAA2rC,KAAAzK,EACAlhC,EAAA8iB,MAAAoe,EAAApe,OACAoe,EAAApe,MAAA9iB,GACA8iB,MAAA6oB,KAAA3rC,EAEApC,EAAAjqD,EAAAutF,EAAAvtF,OAEAtV,KAAA2zG,SAAAhyC,QAIAA,EAAA2rC,KAAA3rC,GACA8iB,MAAA9iB,EAEA3hE,KAAA2zG,SAAAhyC,EAMA,OAFA3hE,KAAA+3E,QAEApW,GAQA+xC,EAAAzzG,UAAAo4B,KAAA,WACA,OAAAr4B,KAAA+3E,OAQA27B,EAAAzzG,UAAAk/B,MAAA,WACAn/B,KAAA2zG,SAAA,KACA3zG,KAAA+3E,MAAA,GAQA27B,EAAAzzG,UAAAinD,QAAA,WACA,OAAA,IAAAlnD,KAAA+3E,OASA27B,EAAAzzG,UAAA8zG,eAAA,WAEA,IAAApyC,EAAA3hE,KAAA2zG,SAEA,GAAA,OAAAhyC,EACA,OAAAA,EAUA,IANA,IAAAkhC,EAAA7iG,KAAA2zG,SAEAK,EAAAryC,EAAAuoB,OAEA/rF,EAAAwjE,EAAAuG,MAEA,EAAA8rC,GAAA,CAEA,IAAAC,EAAA91G,EAAAsmF,MAEAtmF,EAAAmvG,KAAA7oB,MAAAtmF,EAAAsmF,MACAtmF,EAAAsmF,MAAA6oB,KAAAnvG,EAAAmvG,KAEAnvG,EAAAmvG,KAAAzK,EACA1kG,EAAAsmF,MAAAoe,EAAApe,QACAoe,EAAApe,MAAAtmF,GACAsmF,MAAA6oB,KAAAnvG,GAEA2pC,OAAA,KACA3pC,EAAA81G,EACAD,IAsBA,OAlBAryC,EAAA2rC,KAAA7oB,MAAA9iB,EAAA8iB,MACA9iB,EAAA8iB,MAAA6oB,KAAA3rC,EAAA2rC,KAIAzK,EAFAlhC,IAAAA,EAAA8iB,MAEA,KAqJA,SAAAoe,EAAAxqE,GAEA,IAkBAn3B,EAlBAg+F,EAAA9gG,KAAAiF,MAAAjF,KAAAU,IAAAu5B,GAAAo7E,GAAA,EAEA/qF,EAAA,IAAAvL,MAAA+hF,GAEAgV,EAAA,EACA/1G,EAAA0kG,EAEA,GAAA1kG,EAIA,IAHA+1G,IACA/1G,EAAAA,EAAAsmF,MAEAtmF,IAAA0kG,GACAqR,IACA/1G,EAAAA,EAAAsmF,MAOA,KAAA,EAAAyvB,GAAA,CAMA,IAJA,IAAA3zG,EAAApC,EAAA+rF,OAEArsC,EAAA1/C,EAAAsmF,MAIAvjF,EAAAwnB,EAAAnoB,IAFA,CASA,GAAA8+D,EAAAlhE,EAAAmX,IAAApU,EAAAoU,KAAA,CACA,IAAA1S,EAAA1B,EACAA,EAAA/C,EACAA,EAAAyE,EAIAuxG,EAAAjzG,EAAA/C,GAGAuqB,EAAAnoB,GAAA,KACAA,IAIAmoB,EAAAnoB,GAAApC,EAEAA,EAAA0/C,EACAq2D,IAIArR,EAAA,KAEA,IAAA,IAAAzlG,EAAA,EAAAA,EAAA8hG,EAAA9hG,KAEA8D,EAAAwnB,EAAAtrB,MAOAylG,GAEA3hG,EAAAosG,KAAA7oB,MAAAvjF,EAAAujF,MACAvjF,EAAAujF,MAAA6oB,KAAApsG,EAAAosG,KAEApsG,EAAAosG,KAAAzK,EACA3hG,EAAAujF,MAAAoe,EAAApe,OACAoe,EAAApe,MAAAvjF,GACAujF,MAAA6oB,KAAApsG,EAEAq+D,EAAAr+D,EAAAoU,IAAAutF,EAAAvtF,OACAutF,EAAA3hG,IAGA2hG,EAAA3hG,GAIA,OAAA2hG,EAxOAuR,CAFAvR,EAAAlhC,EAAA8iB,MAEAzkF,KAAA+3E,OAIA/3E,KAAA+3E,QAEA/3E,KAAA2zG,SAAA9Q,EAEAlhC,GAWA+xC,EAAAzzG,UAAA6jD,OAAA,SAAA6d,GAEA3hE,KAAA2zG,SAYA,SAAA9Q,EAAAlhC,EAAArsD,GAEAqsD,EAAArsD,IAAAA,EAEA,IAAAwyB,EAAA65B,EAAA75B,OAgBA,OAdAA,GAAAy3B,EAAAoC,EAAArsD,IAAAwyB,EAAAxyB,OAEAs+F,EAAA/Q,EAAAlhC,EAAA75B,GAsDA,SAAAusE,EAAAxR,EAAAlhC,GAEA,IAAA75B,EAAA65B,EAAA75B,OAEAA,IAKA65B,EAAAknB,MAIA+qB,EAAA/Q,EAAAlhC,EAAA75B,GAGAusE,EAAAvsE,IANA65B,EAAAknB,MAAA,GA7DAwrB,CAAAxR,EAAA/6D,IAIAy3B,EAAAoC,EAAArsD,IAAAutF,EAAAvtF,OACAutF,EAAAlhC,GAIAkhC,EAhCAyR,CAAAt0G,KAAA2zG,SAAAhyC,GAAA,GAEA3hE,KAAA+zG,kBAiGA,IAAAI,EAAA,SAAAxyC,EAAA75B,GAEA65B,EAAA2rC,KAAA7oB,MAAA9iB,EAAA8iB,MACA9iB,EAAA8iB,MAAA6oB,KAAA3rC,EAAA2rC,MAEA3rC,EAAA75B,OAAAA,GAEAogC,OAKAvG,EAAA2rC,KAAAxlE,EAAAogC,MACAvG,EAAA8iB,MAAA38C,EAAAogC,MAAAuc,OACA38C,EAAAogC,MAAAuc,MAAA9iB,GACA8iB,MAAA6oB,KAAA3rC,KAPA75B,EAAAogC,MAAAvG,GACA8iB,MAAA9iB,GACA2rC,KAAA3rC,EASA75B,EAAAoiD,SAEAvoB,EAAAknB,MAAA,GA8FA,OAAA6qB,2GC/XA,aAEA,IAAA7xB,EAAA/kF,EAAA,qBAEAo7B,EAAA2pD,EAAA3pD,OACArN,EAAAg3D,EAAAh3D,OACAiT,EAAA3gB,MAAA2gB,QACA8f,EAAA1lB,EAAA0lB,SA0OAhgD,EAAA2I,KAAA,uBACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QA1OA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAAqE,EAAArE,EAAA9zD,EAAA,kBACAyiE,EAAA3O,EAAA9zD,EAAA,sCAEA,SAAAy3G,EAAA70E,EAAA4oD,GACA,KAAAtoF,gBAAAu0G,GACA,MAAA,IAAA/1G,YAAA,oDAGA,GAAA8pF,IAAA1qC,EAAA0qC,GACA,MAAA,IAAA7qF,MAAA,qBAAA6qF,GAGA,GAAAjxC,EAAA+b,SAAA1zB,IAAA5B,EAAA4B,GAAA,CAEA,IAAA+wB,EAAA,IAAAwE,EAAAv1B,EAAA4oD,GAEAtoF,KAAAi4E,MAAAxnB,EAAAwnB,MACAj4E,KAAA+3E,MAAAtnB,EAAAsnB,MACA/3E,KAAAuoF,UAAA93B,EAAA83B,UACAvoF,KAAA2tG,KAAA,KACA3tG,KAAAitG,KAAA,UACA,GAAAvtE,GAAA5B,EAAA4B,EAAAA,OAAA5B,EAAA4B,EAAArH,MAEAr4B,KAAAi4E,MAAAv4C,EAAAA,KACA1/B,KAAA+3E,MAAAr4C,EAAArH,KACAr4B,KAAAuoF,UAAA7oD,EAAA4oD,SACAtoF,KAAA2tG,UAAA,IAAAjuE,EAAA14B,IAAA04B,EAAA14B,IAAA,KACAhH,KAAAitG,UAAA,IAAAvtE,EAAAz4B,IAAAy4B,EAAAz4B,IAAA,SACA,CAAA,GAAAy4B,EAEA,MAAA,IAAA/F,UAAA,6BAAAkoD,EAAAp6D,MAAA4vB,KAAA3X,GAAA,KAGA1/B,KAAAi4E,MAAA,GACAj4E,KAAA+3E,MAAA,CAAA,GACA/3E,KAAAuoF,UAAAD,EACAtoF,KAAA2tG,KAAA,KACA3tG,KAAAitG,KAAA,MA+LA,OA3LAsH,EAAAt0G,UAAA,IAAAg1D,GAKA5d,KAAA,uBACAk9D,EAAAt0G,UAAAu0G,wBAAA,EAeAD,EAAAt0G,UAAAo+D,OAAA,SAAA9mD,GACA,OAAApE,UAAArV,QACA,KAAA,EAEA,IAAA0L,EAAAyrD,EAAAh1D,UAAAo+D,OAAAxgE,KAAAmC,KAAAuX,GAEA,OAAA8/B,EAAA+b,SAAA5pD,GAEA,IAAA+qG,EAAA,CACA70E,KAAAl2B,EAAAyuE,MACA5/C,KAAA7uB,EAAAuuE,MACAuQ,SAAA9+E,EAAA++E,YAIA/+E,EAGA,KAAA,EACA,KAAA,EACA,MAAA,IAAA/L,MAAA,4DAEA,QACA,MAAA,IAAAe,YAAA,+BAcA+1G,EAAAt0G,UAAAwU,IAAA,WACA,MAAA,IAAAhX,MAAA,sDAgBA82G,EAAAt0G,UAAAi+D,OAAA,WACA,MAAA,IAAAzgE,MAAA,yDASA82G,EAAAt0G,UAAAk+D,QAAA,WACA,MAAA,IAAA1gE,MAAA,0DAQA82G,EAAAt0G,UAAAuD,MAAA,WAMA,OALA,IAAA+wG,EAAA,CACA70E,KAAA7U,EAAArnB,MAAAxD,KAAAi4E,OACA5/C,KAAAxN,EAAArnB,MAAAxD,KAAA+3E,OACAuQ,SAAAtoF,KAAAuoF,aAUAgsB,EAAAt0G,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,uBACA72B,KAAA1/B,KAAAi4E,MACA5/C,KAAAr4B,KAAA+3E,MACAuQ,SAAAtoF,KAAAuoF,YAYAgsB,EAAA/9C,SAAA,SAAA1D,GACA,OAAA,IAAAyhD,EAAAzhD,IAYAyhD,EAAAt0G,UAAAqzG,SAAA,WACA,MAAA,IAAA71G,MAAA,2DAQA82G,EAAAt0G,UAAA+G,IAAA,WAEA,GAAA,OAAAhH,KAAA2tG,KAAA,CAEA,IAAAnkG,EAAA,KAEAxJ,KAAAsX,QAAA,SAAAzE,IACA,OAAArJ,GAAA+1D,EAAA1sD,EAAArJ,MACAA,EAAAqJ,KAGA7S,KAAA2tG,KAAA,OAAAnkG,EAAAA,OAAAnK,EAGA,OAAAW,KAAA2tG,MAQA4G,EAAAt0G,UAAAgH,IAAA,WAEA,GAAA,OAAAjH,KAAAitG,KAAA,CAEA,IAAAzjG,EAAA,KAEAxJ,KAAAsX,QAAA,SAAAzE,IACA,OAAArJ,GAAA+1D,EAAA/1D,EAAAqJ,MACArJ,EAAAqJ,KAGA7S,KAAAitG,KAAA,OAAAzjG,EAAAA,OAAAnK,EAGA,OAAAW,KAAAitG,MAIAsH,gHC9OA,aAEA,IAGA32D,EAHA9gD,EAAA,qBAEAo7B,OACA0lB,SAoRAhgD,EAAA2I,KAAA,SACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QApRA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAuBA,SAAA2e,IACA,KAAAjvE,gBAAAivE,GACA,MAAA,IAAAzwE,YAAA,oDAsPA,OA9OAywE,EAAAhvE,UAAAo3C,KAAA,SACA43B,EAAAhvE,UAAAmzD,UAAA,EASA6b,EAAAukB,QAAA,SAAAn9B,GAEA,IAAAzY,EAAAyY,GACA,MAAA,IAAA18B,UAAA,iCAIA,IAAAzxB,EAAA+mE,EAAAukC,SAAAn9C,GAEA,IAAAnuD,EACA,MAAA,IAAA1J,YAAA,sCAAA63D,GAIA,OAAAnuD,GAIA+mE,EAAAukC,SAAA,GAUAvkC,EAAAhvE,UAAAuzF,QAAA,WAEA,MAAA,IAAA/1F,MAAA,gDAYAwxE,EAAAhvE,UAAAqoF,SAAA,WAEA,MAAA,IAAA7qF,MAAA,iDASAwxE,EAAAhvE,UAAA86B,OAAA,SAAA2E,EAAA4oD,GACA,MAAA,IAAA7qF,MAAA,+CAiBAwxE,EAAAhvE,UAAAo+D,OAAA,SAAA9mD,EAAA8uF,EAAArxD,GAEA,MAAA,IAAAv3C,MAAA,+CASAwxE,EAAAhvE,UAAA4a,IAAA,SAAAtD,GAEA,MAAA,IAAA9Z,MAAA,4CAaAwxE,EAAAhvE,UAAAwU,IAAA,SAAA8C,EAAAnT,EAAA4wC,GAEA,MAAA,IAAAv3C,MAAA,4CAgBAwxE,EAAAhvE,UAAAi+D,OAAA,SAAA7lC,EAAA2c,GAEA,MAAA,IAAAv3C,MAAA,+CAaAwxE,EAAAhvE,UAAAk+D,QAAA,SAAA9lC,EAAA2c,GAEA,MAAA,IAAAv3C,MAAA,gDAQAwxE,EAAAhvE,UAAAuD,MAAA,WAEA,MAAA,IAAA/F,MAAA,8CAQAwxE,EAAAhvE,UAAAo4B,KAAA,WAEA,MAAA,IAAA56B,MAAA,6CAcAwxE,EAAAhvE,UAAAm4B,IAAA,SAAA/a,EAAAo3F,GAEA,MAAA,IAAAh3G,MAAA,4CAUAwxE,EAAAhvE,UAAAqX,QAAA,SAAA+F,GAEA,MAAA,IAAA5f,MAAA,gDAQAwxE,EAAAhvE,UAAAmd,QAAA,WAEA,MAAA,IAAA3f,MAAA,gDAQAwxE,EAAAhvE,UAAA2D,QAAA,WAEA,MAAA,IAAAnG,MAAA,gDAYAwxE,EAAAhvE,UAAAo2D,OAAA,SAAA7a,GAEA,MAAA,IAAA/9C,MAAA,+CAQAwxE,EAAAhvE,UAAAwD,SAAA,WAEA,MAAA,IAAAhG,MAAA,iDAIAwxE,oDCtRA,aAEA,IAAAzrE,EAAA1G,EAAA,sBAAA0G,MAEA0I,EAAApP,EAAA,sBAAAoP,UAqSAtO,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QArSA,SAAArW,GAqBA,SAAAh8B,EAAAq5F,GACA,KAAA10G,gBAAAqb,GACA,MAAA,IAAA7c,YAAA,oDAGAwB,KAAA20G,YAAA,GACA30G,KAAA40G,WAAA,EAEA,IAAA,IAAAx3G,EAAA,EAAA45E,EAAA7jE,UAAArV,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAAqD,EAAA0S,UAAA/V,GAEA,GAAAi6C,EAAAoc,QAAAhzD,GACAT,KAAA20G,YAAAvnG,KAAA3M,GAEAT,KAAA40G,WAAA,OACA,GAAAz3F,MAAA2gB,QAAAr9B,IAAA42C,EAAA+b,SAAA3yD,GAAA,CAEA,IAAA+I,EAAAqrG,EAAAp0G,EAAAmD,WAEA5D,KAAA20G,YAAAvnG,KAAA5D,GAGA,IAAA6uB,EAAA7uB,EAAA6uB,OAEA,IAAAA,EAAAv6B,QAAA,IAAAu6B,EAAA,KACAr4B,KAAA40G,WAAA,QAEA,GAAA,iBAAAn0G,EACAT,KAAA20G,YAAAvnG,KAAAynG,EAAA,CAAAp0G,SACA,CAAA,GAAA,iBAAAA,EAIA,MAAA,IAAAk5B,UAAA,gEAFA35B,KAAA20G,YAAAvnG,KAAA3M,KAeA,SAAAo0G,EAAAp0G,GAEA,IAAA,IAAArD,EAAA,EAAAu7E,EAAAl4E,EAAA3C,OAAAV,EAAAu7E,EAAAv7E,IACA,GAAA,iBAAAqD,EAAArD,KAAA8O,EAAAzL,EAAArD,IACA,MAAA,IAAAu8B,UAAA,qDAKA,OAAA,IAAA0d,EAAAk9D,qBAAA9zG,GAoNA,OAhOA4a,EAAApb,UAAAo3C,KAAA,QACAh8B,EAAApb,UAAAkgC,SAAA,EAoBA9kB,EAAApb,UAAAuD,MAAA,WACA,IAAA+T,EAAA,IAAA8D,EAGA,OAFA9D,EAAAo9F,YAAAnxG,EAAAxD,KAAA20G,aACAp9F,EAAAq9F,UAAA50G,KAAA40G,UACAr9F,GAWA8D,EAAA0f,OAAA,SAAA25E,GACA,IAAAn9F,EAAA,IAAA8D,EAEA,OADAA,EAAA3D,MAAAH,EAAAm9F,GACAn9F,GASA8D,EAAApb,UAAAo4B,KAAA,WAGA,IAFA,IAAAA,EAAA,GAEAj7B,EAAA,EAAA45E,EAAAh3E,KAAA20G,YAAA72G,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAAmD,EAAAP,KAAA20G,YAAAv3G,GACAi7B,EAAAj7B,GAAA,iBAAAmD,EAAA,EAAAA,EAAA83B,OAAA,GAGA,OAAAA,GASAhd,EAAApb,UAAAgH,IAAA,WAGA,IAFA,IAAAyiB,EAAA,GAEAtsB,EAAA,EAAA45E,EAAAh3E,KAAA20G,YAAA72G,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAA0jD,EAAA9gD,KAAA20G,YAAAv3G,GACAssB,EAAAtsB,GAAA,iBAAA0jD,EAAAA,EAAAA,EAAA75C,MAGA,OAAAyiB,GASArO,EAAApb,UAAA+G,IAAA,WAGA,IAFA,IAAA0iB,EAAA,GAEAtsB,EAAA,EAAA45E,EAAAh3E,KAAA20G,YAAA72G,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAA0jD,EAAA9gD,KAAA20G,YAAAv3G,GACAssB,EAAAtsB,GAAA,iBAAA0jD,EAAAA,EAAAA,EAAA95C,MAGA,OAAA0iB,GAWArO,EAAApb,UAAAqX,QAAA,SAAA+F,GACA,IAAA,IAAAjgB,EAAA,EAAA45E,EAAAh3E,KAAA20G,YAAA72G,OAAAV,EAAA45E,EAAA55E,IACAigB,EAAArd,KAAA20G,YAAAv3G,GAAAA,EAAA4C,OAWAqb,EAAApb,UAAAkmG,UAAA,SAAAjwB,GACA,OAAAl2E,KAAA20G,YAAAz+B,IAAA,MAQA76D,EAAApb,UAAAuhE,iBAAA,WACA,OAAA,IAAAxhE,KAAA20G,YAAA72G,QAAA,iBAAAkC,KAAA20G,YAAA,IASAt5F,EAAApb,UAAAwhE,kBAAA,WACA,OAAAzhE,KAAAwhE,mBAAAxhE,KAAA20G,YAAA,GAAA,MAYAt5F,EAAApb,UAAAumG,SAAA,WACA,OAAAxmG,KAAA40G,WA4BAv5F,EAAApb,UAAA2D,QAlBAyX,EAAApb,UAAAmd,QAAA,WAGA,IAFA,IAAAsL,EAAA,GAEAtrB,EAAA,EAAA45E,EAAAh3E,KAAA20G,YAAA72G,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAA+oG,EAAAnmG,KAAA20G,YAAAv3G,GACAsrB,EAAAtb,KAAA,iBAAA+4F,EAAAA,EAAAA,EAAA/oF,WAGA,OAAAsL,GAiBArN,EAAApb,UAAAwD,SAAA,WAGA,IAFA,IAAAqxG,EAAA,GAEA13G,EAAA,EAAA45E,EAAAh3E,KAAA20G,YAAA72G,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAA+oG,EAAAnmG,KAAA20G,YAAAv3G,GAEA,iBAAA+oG,EACA2O,EAAA1nG,KAAA6jD,KAAAC,UAAAi1C,IAEA2O,EAAA1nG,KAAA+4F,EAAA1iG,YAIA,MAAA,IAAAqxG,EAAApvF,KAAA,MAAA,KAUArK,EAAApb,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,QACA0Q,WAAAjnE,KAAA20G,cAYAt5F,EAAAm7C,SAAA,SAAA1D,GACA,OAAAz3C,EAAA0f,OAAA+3B,EAAAmU,aAGA5rD,8ECtSA,aAEA,IAAAqmB,EAAA5kC,EAAA,sBA4UAc,EAAA2I,KAAA,QACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QA5UA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAgCA,SAAAyW,EAAAx5B,EAAAW,EAAAqH,GACA,KAAAv1C,gBAAA+mE,GACA,MAAA,IAAAvoE,YAAA,oDAGA,IAAAu2G,EAAAxnE,MAAAA,EACAynE,EAAA9mE,MAAAA,EACA+mE,EAAA1/D,MAAAA,EAEA,GAAAw/D,EACA,GAAA19D,EAAA6b,YAAA3lB,GACAA,EAAAA,EAAAn+B,gBACA,GAAA,iBAAAm+B,EACA,MAAA,IAAA5T,UAAA,oCAIA,GAAAq7E,EACA,GAAA39D,EAAA6b,YAAAhlB,GACAA,EAAAA,EAAA9+B,gBACA,GAAA,iBAAA8+B,EACA,MAAA,IAAAvU,UAAA,kCAIA,GAAAs7E,EACA,GAAA59D,EAAA6b,YAAA3d,GACAA,EAAAA,EAAAnmC,gBACA,GAAA,iBAAAmmC,EACA,MAAA,IAAA5b,UAAA,mCAIA35B,KAAAutC,MAAAwnE,EAAAh1G,WAAAwtC,GAAA,EACAvtC,KAAAkuC,IAAA8mE,EAAAj1G,WAAAmuC,GAAA,EACAluC,KAAAu1C,KAAA0/D,EAAAl1G,WAAAw1C,GAAA,EAoQA,OA7PAwxB,EAAA9mE,UAAAo3C,KAAA,QACA0vB,EAAA9mE,UAAAwzD,SAAA,EAWAsT,EAAA9nE,MAAA,SAAA2H,GACA,GAAA,iBAAAA,EACA,OAAA,KAGA,IACAo+F,EADAp+F,EAAAoY,MAAA,KACAoZ,IAAA,SAAA33B,GACA,OAAAV,WAAAU,KAMA,GAJAukG,EAAA97C,KAAA,SAAAn8C,GACA,OAAAjN,MAAAiN,KAIA,OAAA,KAGA,OAAAi4F,EAAAlnG,QACA,KAAA,EACA,OAAA,IAAAipE,EAAAi+B,EAAA,GAAAA,EAAA,IAEA,KAAA,EACA,OAAA,IAAAj+B,EAAAi+B,EAAA,GAAAA,EAAA,GAAAA,EAAA,IAEA,QACA,OAAA,OASAj+B,EAAA9mE,UAAAuD,MAAA,WACA,OAAA,IAAAujE,EAAA/mE,KAAAutC,MAAAvtC,KAAAkuC,IAAAluC,KAAAu1C,OAUAwxB,EAAA9mE,UAAAo4B,KAAA,WACA,IAAApvB,EAAA,EACAskC,EAAAvtC,KAAAutC,MACAgI,EAAAv1C,KAAAu1C,KAEAs6D,EADA7vG,KAAAkuC,IACAX,EAYA,OAVA7L,EAAAxhC,KAAAq1C,KAAA7T,EAAAxhC,KAAA2vG,GACA5mG,EAAA7K,KAAA+E,KAAA0sG,EAAAt6D,GACA,GAAAs6D,IACA5mG,EAAA,GAGAnJ,MAAAmJ,KACAA,EAAA,GAGA,CAAAA,IASA89D,EAAA9mE,UAAA+G,IAAA,WACA,IAAAqxB,EAAAr4B,KAAAq4B,OAAA,GAEA,OAAA,EAAAA,EACA,EAAAr4B,KAAAu1C,KAEAv1C,KAAAutC,MAGAvtC,KAAAutC,OAAAlV,EAAA,GAAAr4B,KAAAu1C,UAGA,GAUAwxB,EAAA9mE,UAAAgH,IAAA,WACA,IAAAoxB,EAAAr4B,KAAAq4B,OAAA,GAEA,OAAA,EAAAA,EACA,EAAAr4B,KAAAu1C,KAEAv1C,KAAAutC,OAAAlV,EAAA,GAAAr4B,KAAAu1C,KAGAv1C,KAAAutC,WAGA,GAYAw5B,EAAA9mE,UAAAqX,QAAA,SAAA+F,GACA,IAAAlf,EAAA6B,KAAAutC,MACAgI,EAAAv1C,KAAAu1C,KACArH,EAAAluC,KAAAkuC,IACA9wC,EAAA,EAEA,GAAA,EAAAm4C,EACA,KAAAp3C,EAAA+vC,GACA7wB,EAAAlf,EAAA,CAAAf,GAAA4C,MACA7B,GAAAo3C,EACAn4C,SAEA,GAAAm4C,EAAA,EACA,KAAArH,EAAA/vC,GACAkf,EAAAlf,EAAA,CAAAf,GAAA4C,MACA7B,GAAAo3C,EACAn4C,KAeA2pE,EAAA9mE,UAAAm4B,IAAA,SAAA/a,GACA,IAAAqL,EAAA,GAIA,OAHA1oB,KAAAsX,QAAA,SAAAlT,EAAAmT,EAAA3E,GACA8V,EAAAnR,EAAA,IAAA8F,EAAAjZ,EAAAmT,EAAA3E,KAEA8V,GASAq+C,EAAA9mE,UAAAmd,QAAA,WACA,IAAAsL,EAAA,GAIA,OAHA1oB,KAAAsX,QAAA,SAAAlT,EAAAmT,GACAmR,EAAAnR,EAAA,IAAAnT,IAEAskB,GASAq+C,EAAA9mE,UAAA2D,QAAA,WAEA,OAAA5D,KAAAod,WAcA2pD,EAAA9mE,UAAAo2D,OAAA,SAAA7a,GACA,IAAA50C,EAAA86B,EAAA20B,OAAAr2D,KAAAutC,MAAAiO,GAOA,OALA,IAAAx7C,KAAAu1C,OACA3uC,GAAA,IAAA86B,EAAA20B,OAAAr2D,KAAAu1C,KAAAiG,IAGA50C,GAAA,IAAA86B,EAAA20B,OAAAr2D,KAAAkuC,IAAAsN,IAUAurB,EAAA9mE,UAAAwD,SAAA,WACA,OAAAzD,KAAAq2D,UAUA0Q,EAAA9mE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,QACAhpB,MAAAvtC,KAAAutC,MACAW,IAAAluC,KAAAkuC,IACAqH,KAAAv1C,KAAAu1C,OAYAwxB,EAAAvQ,SAAA,SAAA1D,GACA,OAAA,IAAAiU,EAAAjU,EAAAvlB,MAAAulB,EAAA5kB,IAAA4kB,EAAAvd,OAGAwxB,qDC3UA,aAqJAnpE,EAAA2I,KAAA,MACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QArJA,SAAArW,EAAA1kC,EAAAi+C,GACA,IAAAzwD,EAAAywD,EAAA9zD,EAAA,kCACA66E,EAAA/mB,EAAA9zD,EAAA,0CAMA,SAAA+6E,IACA,KAAA73E,gBAAA63E,GACA,MAAA,IAAAr5E,YAAA,oDAIAwB,KAAA+4E,QAAA,GACA/4E,KAAAk1G,MAAA,IAAA79D,EAAAq8D,cAiIA,OA1HA77B,EAAA53E,UAAAo3C,KAAA,MACAwgC,EAAA53E,UAAAk1G,OAAA,EAQAt9B,EAAA53E,UAAAwU,IAAA,SAAArX,EAAAyV,GAEA,GAAA7S,KAAA+4E,QAAA37E,GAQA4C,KAAA+4E,QAAA37E,GAAAgH,MAAAyO,MARA,CAEA,IAAA8uD,EAAA3hE,KAAAk1G,MAAApB,OAAA12G,EAAAyV,GAGA7S,KAAA+4E,QAAA37E,GAAAukE,IAOAkW,EAAA53E,UAAA4a,IAAA,SAAAzd,GACA,IAAAukE,EAAA3hE,KAAA+4E,QAAA37E,GAEA,OAAAukE,EACAA,EAAAv9D,MAGA,GAGAyzE,EAAA53E,UAAA+5E,WAAA,SAAA58E,EAAAyV,GAEA,IAAA8uD,EAAA3hE,KAAA+4E,QAAA37E,GAEAukE,EAOAA,EAAAv9D,MAAAjE,EAAAwhE,EAAAv9D,MAAAyO,IALA8uD,EAAA3hE,KAAAk1G,MAAApB,OAAA12G,EAAAyV,GAEA7S,KAAA+4E,QAAA37E,GAAAukE,IAOAkW,EAAA53E,UAAAqX,QAAA,SAAAu9C,EAAAC,EAAAz3C,GAEA,IAAA+3F,EAAAp1G,KAAAk1G,MACAxrF,EAAA1pB,KAAA+4E,QAEA3Q,EAAA,GAEAzG,EAAAyzC,EAAArB,iBAOA,IALApyC,GACAyG,EAAAh7D,KAAAu0D,GAIAA,GAAAA,EAAArsD,KAAAw/C,GAEA6M,EAAArsD,KAAAu/C,IAEA8iB,EAAAhW,EAAAv9D,MAAA,IAEAiZ,EAAAskD,EAAArsD,IAAAqsD,EAAAv9D,MAAApE,QAKA2hE,EAAAyzC,EAAArB,mBAGA3rC,EAAAh7D,KAAAu0D,GAKA,IAAA,IAAAvkE,EAAA,EAAAA,EAAAgrE,EAAAtqE,OAAAV,IAAA,CAEA,IAAAH,EAAAmrE,EAAAhrE,GAIAssB,GAFAi4C,EAAAyzC,EAAAtB,OAAA72G,EAAAqY,IAAArY,EAAAmH,QAEAkR,KAAAqsD,IAIAkW,EAAA53E,UAAAg6E,KAAA,SAAA78E,EAAAsK,GAEA,IAAA2tG,EAAAr1G,KAAA+4E,QAAA37E,GACAk4G,EAAAt1G,KAAA+4E,QAAArxE,GAEA,IAAA2tG,GAAAC,EAEAD,EAAAr1G,KAAAk1G,MAAApB,OAAA12G,EAAAk4G,EAAAlxG,OAEApE,KAAAk1G,MAAApxD,OAAAwxD,GAGAt1G,KAAA+4E,QAAA37E,GAAAi4G,EACAr1G,KAAA+4E,QAAArxE,QAAArI,OACA,GAAAg2G,IAAAC,EAEAA,EAAAt1G,KAAAk1G,MAAApB,OAAApsG,EAAA2tG,EAAAjxG,OAEApE,KAAAk1G,MAAApxD,OAAAuxD,GAGAr1G,KAAA+4E,QAAArxE,GAAA4tG,EACAt1G,KAAA+4E,QAAA37E,QAAAiC,OACA,GAAAg2G,GAAAC,EAAA,CAEA,IAAAziG,EAAAwiG,EAAAjxG,MACAixG,EAAAjxG,MAAAkxG,EAAAlxG,MACAkxG,EAAAlxG,MAAAyO,IAIAglE,4GClJA,aAEA,IAAAgK,EAAA/kF,EAAA,qBAEAq4D,EAAAr4D,EAAA,8BAEA4rB,EAAAm5D,EAAAn5D,MACAmC,EAAAg3D,EAAAh3D,OACAqN,EAAA2pD,EAAA3pD,OACAwJ,EAAAmgD,EAAAngD,OACA5D,EAAA3gB,MAAA2gB,QACA6f,EAAAjc,EAAAic,SACAzxC,EAAAw1B,EAAAx1B,UACA0xC,EAAA1lB,EAAA0lB,SACAqoD,EAAAv9E,EAAAu9E,cA0+CAroG,EAAA2I,KAAA,eACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QA1+CA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2e,EAAAre,EAAA9zD,EAAA,aAEA66E,EAAA/mB,EAAA9zD,EAAA,0CACAylG,EAAA3xC,EAAA9zD,EAAA,6BAOA,SAAA86E,EAAAl4C,EAAA4oD,GACA,KAAAtoF,gBAAA43E,GACA,MAAA,IAAAp5E,YAAA,oDAGA,GAAA8pF,IAAA1qC,EAAA0qC,GACA,MAAA,IAAA7qF,MAAA,qBAAA6qF,GAGA,GAAAjxC,EAAA+b,SAAA1zB,IA0BA,SAAA+wB,EAAAp7C,EAAAizE,GAEA,iBAAAjzE,EAAAgiC,MAEAoZ,EAAAsoB,QAAA1jE,EAAA0jE,QAAAluD,EAAArnB,MAAA6R,EAAA0jE,cAAA15E,EACAoxD,EAAAn1C,OAAAuP,EAAArnB,MAAA6R,EAAAiG,QACAm1C,EAAAwoB,KAAApuD,EAAArnB,MAAA6R,EAAA4jE,MACAxoB,EAAAsnB,MAAAltD,EAAArnB,MAAA6R,EAAA0iE,OACAtnB,EAAA83B,UAAAD,GAAAjzE,EAAAkzE,WAGAgtB,EAAA9kD,EAAAp7C,EAAAzR,UAAA0kF,GAAAjzE,EAAAkzE,WAnCAitB,CAAAx1G,KAAA0/B,EAAA4oD,QACA,GAAA5oD,GAAA5B,EAAA4B,EAAAnoB,QAAAumB,EAAA4B,EAAAs5C,MAAAl7C,EAAA4B,EAAArH,MAEAr4B,KAAA+4E,QAAAr5C,EAAAhW,OACA1pB,KAAAsb,OAAAokB,EAAAnoB,MACAvX,KAAAi5E,KAAAv5C,EAAAs5C,IACAh5E,KAAA+3E,MAAAr4C,EAAArH,KACAr4B,KAAAuoF,UAAAD,GAAA5oD,EAAA4oD,cACA,GAAAxqD,EAAA4B,GAEA61E,EAAAv1G,KAAA0/B,EAAA4oD,OACA,CAAA,GAAA5oD,EAEA,MAAA,IAAA/F,UAAA,6BAAAkoD,EAAAp6D,MAAA4vB,KAAA3X,GAAA,KAGA1/B,KAAA+4E,QAAA,GACA/4E,KAAAsb,OAAA,GACAtb,KAAAi5E,KAAA,CAAA,GACAj5E,KAAA+3E,MAAA,CAAA,EAAA,GACA/3E,KAAAuoF,UAAAD,GAmBA,SAAAitB,EAAA9kD,EAAA/wB,EAAA4oD,GAEA73B,EAAAsoB,QAAA,GACAtoB,EAAAn1C,OAAA,GACAm1C,EAAAwoB,KAAA,GACAxoB,EAAA83B,UAAAD,EAEA,IAAA5T,EAAAh1C,EAAA5hC,OACAk6E,EAAA,EAEAjuE,EAAA4tE,EAEAia,EAAA,EAUA,GARAh0C,EAAA0qC,KAEAv+E,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAA2Q,EAAAA,KAAA3Q,EAEAia,EAAAthC,EAAA1nB,QAAA,EAAA0/C,IAIA,EAAA5T,EAAA,CAEA,IAAAhtE,EAAA,EAEA,EAAA,CAEA+oD,EAAAwoB,KAAA7rE,KAAAqjD,EAAAn1C,OAAAxd,QAGA,IAAA,IAAAV,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAAA,CAEA,IAAA+3E,EAAAz1C,EAAAtiC,GAEA,GAAA0gC,EAAAq3C,IAOA,GALA,IAAAztE,GAAAswE,EAAA7C,EAAAr3E,SACAk6E,EAAA7C,EAAAr3E,QAIA4J,EAAAytE,EAAAr3E,OAAA,CAEA,IAAA+U,EAAAsiE,EAAAztE,GAEAqC,EAAA8I,EAAA++E,KAEAnhC,EAAAsoB,QAAA3rE,KAAAyF,GAGA49C,EAAAn1C,OAAAlO,KAAAhQ,UAKA,IAAAsK,GAAAswE,EAAA,IACAA,EAAA,GAIAjuE,EAAAorE,EAAAyc,KAEAnhC,EAAAsoB,QAAA3rE,KAAA+nE,GAGA1kB,EAAAn1C,OAAAlO,KAAAhQ,IAMAsK,UACAA,EAAAswE,GAIAvnB,EAAAwoB,KAAA7rE,KAAAqjD,EAAAn1C,OAAAxd,QAGA2yD,EAAAsnB,MAAA,CAAArD,EAAAsD,GA6YA,SAAAy9B,EAAAr4G,EAAA4uF,EAAA0pB,EAAAn+F,GAEA,GAAAm+F,EAAA1pB,GAAA,EACA,OAAA0pB,EAIA,IAAA,IAAA34G,EAAAivF,EAAAjvF,EAAA24G,EAAA34G,IAEA,GAAAwa,EAAAxa,KAAAK,EACA,OAAAL,EAKA,OAAAivF,EAaA,SAAA2pB,EAAAlvG,EAAArJ,EAAAsK,EAAAmL,EAAA6W,EAAAnS,EAAAyhE,GAEAtvD,EAAAuR,OAAAx0B,EAAA,EAAAoM,GAEA0E,EAAA0jB,OAAAx0B,EAAA,EAAArJ,GAEA,IAAA,IAAAe,EAAAuJ,EAAA,EAAAvJ,EAAA66E,EAAAl7E,OAAAK,IACA66E,EAAA76E,KAwCA,SAAAk0G,EAAA5hD,EAAAikB,EAAAsD,EAAAhjC,GAEA,IAAA5wC,EAAA4wC,GAAA,EAEAjrC,EAAA4tE,EAEAia,EAAA,EAEAh0C,EAAA6S,EAAA83B,aAEAx+E,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAlnB,EAAA83B,UAAA93B,EAAA83B,aAAA5Q,EAEAia,EAAAthC,EAAA1nB,QAAA,EAAA6nB,EAAA83B,WAEAnkF,EAAAksD,EAAA1nB,QAAAxkC,EAAAqsD,EAAA83B,YAIA,IAIAnrF,EAAAsK,EAAAjB,EAJAmvG,GAAA7rG,EAAA3F,EAAAwtF,GAEA70F,EAAA0zD,EAAAsnB,MAAA,GACAz6E,EAAAmzD,EAAAsnB,MAAA,GAGA,GAAAz6E,EAAA06E,EAAA,CAEA,IAAAtwE,EAAApK,EAAAoK,EAAAswE,EAAAtwE,IAIA,GAFA+oD,EAAAwoB,KAAAvxE,GAAA+oD,EAAAsoB,QAAAj7E,OAEA83G,EAEA,IAAAx4G,EAAA,EAAAA,EAAAL,EAAAK,IAEAqzD,EAAAsoB,QAAA3rE,KAAAhJ,GAGAqsD,EAAAn1C,OAAAlO,KAAAhQ,GAMAqzD,EAAAwoB,KAAAjB,GAAAvnB,EAAAsoB,QAAAj7E,YACAk6E,EAAA16E,IAEAmzD,EAAAwoB,KAAAh+C,OAAA+8C,EAAA,EAAA16E,EAAA06E,GAGAvnB,EAAAsoB,QAAA99C,OAAAw1B,EAAAwoB,KAAAjB,GAAAvnB,EAAAsoB,QAAAj7E,QAEA2yD,EAAAn1C,OAAA2f,OAAAw1B,EAAAwoB,KAAAjB,GAAAvnB,EAAAn1C,OAAAxd,SAMA,GAFAR,EAAA06E,EAEAj7E,EAAA23E,GAEA,GAAAkhC,EAAA,CAEA,IAAA34G,EAAA,EAEA,IAAAyK,EAAA,EAAAA,EAAApK,EAAAoK,IAAA,CAEA+oD,EAAAwoB,KAAAvxE,GAAA+oD,EAAAwoB,KAAAvxE,GAAAzK,EAEAwJ,EAAAgqD,EAAAwoB,KAAAvxE,EAAA,GAAAzK,EAEA,IAAAU,EAAA,EAEA,IAAAP,EAAAL,EAAAK,EAAAs3E,EAAAt3E,IAAAO,IAEA8yD,EAAAsoB,QAAA99C,OAAAx0B,EAAA9I,EAAA,EAAAyG,GAGAqsD,EAAAn1C,OAAA2f,OAAAx0B,EAAA9I,EAAA,EAAAP,GAGAH,IAKAwzD,EAAAwoB,KAAA37E,GAAAmzD,EAAAsoB,QAAAj7E,aAEA,GAAA42E,EAAA33E,EAAA,CAEA,IAAAwD,EAAA,EAEA,IAAAmH,EAAA,EAAAA,EAAApK,EAAAoK,IAAA,CAEA+oD,EAAAwoB,KAAAvxE,GAAA+oD,EAAAwoB,KAAAvxE,GAAAnH,EAEA,IAAAo5E,EAAAlpB,EAAAwoB,KAAAvxE,GACAkyE,EAAAnpB,EAAAwoB,KAAAvxE,EAAA,GAAAnH,EAEA,IAAAkG,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAiuE,EAAA,GAFAt3E,EAAAqzD,EAAAn1C,OAAA7U,MAIAgqD,EAAAsoB,QAAA99C,OAAAx0B,EAAA,GAGAgqD,EAAAn1C,OAAA2f,OAAAx0B,EAAA,GAGAlG,KAMAkwD,EAAAwoB,KAAAvxE,GAAA+oD,EAAAsoB,QAAAj7E,OAOA,OAHA2yD,EAAAsnB,MAAA,GAAArD,EACAjkB,EAAAsnB,MAAA,GAAAC,EAEAvnB,EA4TA,SAAAolD,EAAAnsF,EAAAnS,EAAAyhE,EAAA3gD,EAAA5kB,GAEA,IAKArW,EAAAsK,EALAgtE,EAAAr8C,EAAA,GACA2/C,EAAA3/C,EAAA,GAEA76B,EAAA,GAIA,IAAAJ,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAGA,IAFAI,EAAAJ,GAAA,GAEAsK,EAAA,EAAAA,EAAAswE,EAAAtwE,IACAlK,EAAAJ,GAAAsK,GAAA,EAKA,IAAAA,EAAA,EAAAA,EAAAswE,EAAAtwE,IAKA,IAHA,IAAAiyE,EAAAX,EAAAtxE,GACAkyE,EAAAZ,EAAAtxE,EAAA,GAEAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAjJ,EAFAJ,EAAAma,EAAA9Q,IAEAiB,GAAAgiB,EAAAjW,EAAAoX,EAAArnB,MAAAkmB,EAAAjjB,IAAAijB,EAAAjjB,GAAA,EAIA,OAAAjJ,EA2aA,OAr1CAo6E,EAAA33E,UAAA,IAAAgvE,GAKA53B,KAAA,eACAugC,EAAA33E,UAAAuzD,gBAAA,EAWAokB,EAAA33E,UAAAuiG,YAAA,WACA,OAAAD,EAAAviG,KAAA+4E,UAaAnB,EAAA33E,UAAAuzF,QAAA,WACA,MAAA,UAaA5b,EAAA33E,UAAAqoF,SAAA,WACA,OAAAtoF,KAAAuoF,WAUA3Q,EAAA33E,UAAA86B,OAAA,SAAA2E,EAAA4oD,GACA,OAAA,IAAA1Q,EAAAl4C,EAAA4oD,IAaA1Q,EAAA33E,UAAAs2F,QAAA,WAEA,IAAA7hB,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,GAEA,OAAA,IAAArD,GAAA,IAAAsD,EAAAh4E,KAAAsb,OAAAxd,QAAA42E,EAAAsD,GAAA,GAkBAJ,EAAA33E,UAAAo+D,OAAA,SAAA9mD,EAAA8uF,EAAArxD,GAEA,IAAAh1C,KAAA+4E,QACA,MAAA,IAAAt7E,MAAA,iDAIA,OAAA0V,UAAArV,QACA,KAAA,EACA,OAYA,SAAA2yD,EAAAqlD,GAEA,IAAAz+D,EAAAlX,QAAA21E,GACA,MAAA,IAAAn8E,UAAA,iBAKA,GAFAm8E,EAAAtP,WAIA,OAAA/1C,EAAA51C,IAAAi7F,EAAA9uG,OAIA,IAOA5J,EAAA45E,EAAAvwE,EAAAsvG,EAPA19E,EAAAy9E,EAAAz9E,OAEA,GAAAA,EAAAv6B,SAAA2yD,EAAAsnB,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA98B,EAAAv6B,OAAA2yD,EAAAsnB,MAAAj6E,QAMA,IAAAkJ,EAAA8uG,EAAA9uG,MACAC,EAAA6uG,EAAA7uG,MAEA,IAAA7J,EAAA,EAAA45E,EAAAvmB,EAAAsnB,MAAAj6E,OAAAV,EAAA45E,EAAA55E,IACA6oG,EAAAj/F,EAAA5J,GAAAqzD,EAAAsnB,MAAA36E,IACA6oG,EAAAh/F,EAAA7J,GAAAqzD,EAAAsnB,MAAA36E,IAIA,IAAA44G,EAAAvlD,EAAAsoB,QACAk9B,EAAAxlD,EAAAn1C,OACA46F,EAAAzlD,EAAAwoB,KAEAvE,EAAAohC,EAAA3P,UAAA,GACAnuB,EAAA89B,EAAA3P,UAAA,GAEAt/F,EAAA,GACA+xE,EAAA,GAEAlE,EAAAp9D,QAAA,SAAAla,EAAAL,GAEA67E,EAAAx7E,GAAAL,EAAA,GAEA8J,EAAAzJ,IAAA,IAGA,IAAAssB,EAAAssF,EAAA,QAAA32G,EACAkY,EAAA,GACAyhE,EAAA,GAuBA,OArBAhB,EAAA1gE,QAAA,SAAA5P,GAIA,IAFAsxE,EAAA5rE,KAAAmK,EAAAzZ,QAEA2I,EAAAyvG,EAAAxuG,GAAAquG,EAAAG,EAAAxuG,EAAA,GAAAjB,EAAAsvG,EAAAtvG,IAEArJ,EAAA64G,EAAAxvG,IAEA,IAAAI,EAAAzJ,KAEAma,EAAAnK,KAAAwrE,EAAAx7E,IAEAssB,GACAA,EAAAtc,KAAA4oG,EAAAvvG,OAMAuyE,EAAA5rE,KAAAmK,EAAAzZ,QAEA,IAAA85E,EAAA,CACAluD,OAAAA,EACAnS,MAAAA,EACAyhE,IAAAA,EACA3gD,KAAAA,EACAiwD,SAAA73B,EAAA83B,YA3FA4tB,CAAAn2G,KAAAuX,GAGA,KAAA,EACA,KAAA,EACA,OA0FA,SAAAk5C,EAAAl5C,EAAAq7F,EAAA59D,GAEA,IAAAz9B,IAAA,IAAAA,EAAA4oB,QACA,MAAA,IAAAxG,UAAA,iBAIA,IAGAk5E,EAHAC,EAAAv7F,EAAA8gB,OACAmuE,EAAAjvF,EAAAivF,WAeA,GAXAnvD,EAAA+b,SAAAw/C,IAEAC,EAAAD,EAAAv6E,OAEAu6E,EAAAA,EAAAx1F,WAGAy1F,EAAAnqF,EAAA2P,KAAAu6E,GAIApM,EAAA,CAEA,GAAA,IAAAqM,EAAA/0G,OACA,MAAA,IAAA67B,UAAA,mBAIA82B,EAAAh8C,IAAA8C,EAAAvQ,MAAA4rG,EAAA59D,OACA,CAEA,GAAA,IAAA89D,EAAAh1G,QAAA,IAAAg1G,EAAAh1G,OACA,MAAA,IAAAq3D,EAAA29C,EAAAh1G,OAAA2yD,EAAAsnB,MAAAj6E,OAAA,KAIA,GAAA+0G,EAAA/0G,OAAAg1G,EAAAh1G,OAAA,CAKA,IAHA,IAAAV,EAAA,EACAonC,EAAA,EAEA,IAAAsuE,EAAA11G,IAAA,IAAAy1G,EAAAz1G,IACAA,IAGA,KAAA,IAAA01G,EAAA11G,IACAonC,IACApnC,IAIAw1G,EAAAlqF,EAAAqqF,UAAAH,EAAAE,EAAAh1G,OAAA0mC,EAAAquE,GAIA,IAAAhoF,EAAAs0C,UAAA2zC,EAAAD,GACA,MAAA,IAAA19C,EAAA29C,EAAAD,EAAA,KAUA,IANA,IAAA/Y,EAAAviF,EAAAvQ,MAAA,GACA+yF,EAAAxiF,EAAAvQ,MAAA,GAEAwC,EAAAqpG,EAAA,GACA51G,EAAA41G,EAAA,GAEA10G,EAAA,EAAAA,EAAAqL,EAAArL,IAEA,IAAA,IAAA+C,EAAA,EAAAA,EAAAjE,EAAAiE,IAAA,CAEA,IAAA2R,EAAA+/F,EAAAz0G,GAAA+C,GAEAuvD,EAAAh8C,IAAA,CAAAtW,EAAA27F,EAAA54F,EAAA64F,GAAAlnF,EAAAmiC,IAKA,OAAAyb,EAzKA2lD,CAAAp2G,KAAAuX,EAAA8uF,EAAArxD,GAEA,QACA,MAAA,IAAAx2C,YAAA,+BAgLAo5E,EAAA33E,UAAA4a,IAAA,SAAAtD,GACA,IAAAumB,EAAAvmB,GACA,MAAA,IAAAoiB,UAAA,kBAGA,GAAApiB,EAAAzZ,SAAAkC,KAAA+3E,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA59C,EAAAzZ,OAAAkC,KAAA+3E,MAAAj6E,QAIA,IAAAkC,KAAA+4E,QACA,MAAA,IAAAt7E,MAAA,8CAIA,IAAAL,EAAAma,EAAA,GACA7P,EAAA6P,EAAA,GAEA0uF,EAAA7oG,EAAA4C,KAAA+3E,MAAA,IACAkuB,EAAAv+F,EAAA1H,KAAA+3E,MAAA,IAEA,IAAAtxE,EAAAgvG,EAAAr4G,EAAA4C,KAAAi5E,KAAAvxE,GAAA1H,KAAAi5E,KAAAvxE,EAAA,GAAA1H,KAAAsb,QAGA,OAAA7U,EAAAzG,KAAAi5E,KAAAvxE,EAAA,IAAA1H,KAAAsb,OAAA7U,KAAArJ,EACA4C,KAAA+4E,QAAAtyE,GAGA,GAcAmxE,EAAA33E,UAAAwU,IAAA,SAAA8C,EAAA1E,EAAAmiC,GACA,IAAAlX,EAAAvmB,GACA,MAAA,IAAAoiB,UAAA,kBAGA,GAAApiB,EAAAzZ,SAAAkC,KAAA+3E,MAAAj6E,OACA,MAAA,IAAAq3D,EAAA59C,EAAAzZ,OAAAkC,KAAA+3E,MAAAj6E,QAIA,IAAAkC,KAAA+4E,QACA,MAAA,IAAAt7E,MAAA,8CAIA,IAAAL,EAAAma,EAAA,GACA7P,EAAA6P,EAAA,GAEAm9D,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,GAEAhuE,EAAA4tE,EAEAia,EAAA,EAEAh0C,EAAA59C,KAAAuoF,aAEAx+E,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAA33E,KAAAuoF,UAAAvoF,KAAAuoF,aAAA5Q,EAEAia,EAAAthC,EAAA1nB,QAAA,EAAA5oC,KAAAuoF,aAIA7T,EAAA,EAAAt3E,GAAA46E,EAAA,EAAAtwE,KAEA2qG,EAAAryG,KAAA5B,KAAA6I,IAAA7J,EAAA,EAAAs3E,GAAAt2E,KAAA6I,IAAAS,EAAA,EAAAswE,GAAAhjC,GAGA0/B,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,IAIAkuB,EAAA7oG,EAAAs3E,GACAuxB,EAAAv+F,EAAAswE,GAEA,IAAAvxE,EAAAgvG,EAAAr4G,EAAA4C,KAAAi5E,KAAAvxE,GAAA1H,KAAAi5E,KAAAvxE,EAAA,GAAA1H,KAAAsb,QAiBA,OAdA7U,EAAAzG,KAAAi5E,KAAAvxE,EAAA,IAAA1H,KAAAsb,OAAA7U,KAAArJ,EAEA2M,EAAA8I,EAAA++E,GAiCA,SAAAnrF,EAAAiB,EAAAgiB,EAAAnS,EAAAyhE,GAEAtvD,EAAAuR,OAAAx0B,EAAA,GACA8Q,EAAA0jB,OAAAx0B,EAAA,GAEA,IAAA,IAAAtI,EAAAuJ,EAAA,EAAAvJ,EAAA66E,EAAAl7E,OAAAK,IACA66E,EAAA76E,KAlCAk4G,CAAA5vG,EAAAiB,EAAA1H,KAAA+4E,QAAA/4E,KAAAsb,OAAAtb,KAAAi5E,MAHAj5E,KAAA+4E,QAAAtyE,GAAAoM,EAOA8iG,EAAAlvG,EAAArJ,EAAAsK,EAAAmL,EAAA7S,KAAA+4E,QAAA/4E,KAAAsb,OAAAtb,KAAAi5E,MAGAj5E,MAwDA43E,EAAA33E,UAAAi+D,OAAA,SAAA7lC,EAAA2c,EAAAvhC,GAEA,IAAAqqB,EAAAzF,GACA,MAAA,IAAAsB,UAAA,kBAGA,GAAA,IAAAtB,EAAAv6B,OACA,MAAA,IAAAL,MAAA,4CAYA,OARA46B,EAAA/gB,QAAA,SAAAlT,GACA,IAAAs9B,EAAAic,SAAAv5C,KAAAs9B,EAAAx1B,UAAA9H,IAAAA,EAAA,EACA,MAAA,IAAAu1B,UAAA,uDAAAzB,EAAAm+B,OAAAh+B,GAAA,OAMAg6E,EAFA5+F,EAAAzT,KAAAwD,QAAAxD,KAEAq4B,EAAA,GAAAA,EAAA,GAAA2c,IA+IA4iC,EAAA33E,UAAAk+D,QAAA,SAAA9lC,EAAA5kB,GAEA,IAAAqqB,EAAAzF,GACA,MAAA,IAAAsB,UAAA,kBAGA,GAAA,IAAAtB,EAAAv6B,OACA,MAAA,IAAAL,MAAA,0DAUA,GANA46B,EAAA/gB,QAAA,SAAAlT,GACA,IAAAs9B,EAAAic,SAAAv5C,KAAAs9B,EAAAx1B,UAAA9H,IAAAA,EAAA,EACA,MAAA,IAAAu1B,UAAA,uDAAAzB,EAAAm+B,OAAAh+B,GAAA,OAIAr4B,KAAA+3E,MAAA,GAAA/3E,KAAA+3E,MAAA,IAAA1/C,EAAA,GAAAA,EAAA,GACA,MAAA,IAAA56B,MAAA,uEAIA,IAAA+L,EAAAiK,EAAAzT,KAAAwD,QAAAxD,KAEA,GAAAA,KAAA+3E,MAAA,KAAA1/C,EAAA,IAAAr4B,KAAA+3E,MAAA,KAAA1/C,EAAA,GACA,OAAA7uB,EAMA,IAFA,IAAA8sG,EAAA,GAEAl5G,EAAA,EAAAA,EAAAoM,EAAAyvE,KAAAn7E,OAAAV,IACA,IAAA,IAAAsK,EAAA,EAAAA,EAAA8B,EAAAyvE,KAAA77E,EAAA,GAAAoM,EAAAyvE,KAAA77E,GAAAsK,IACA4uG,EAAAlpG,KAAAhQ,GAWA,IANA,IAAAssB,EAAAlgB,EAAAuvE,QAAAlvE,QAGA0sG,EAAA/sG,EAAA8R,OAAAzR,QAGA03E,EAAA,EAAAA,EAAA/3E,EAAA8R,OAAAxd,OAAAyjF,IAAA,CACA,IAAAi1B,EAAAD,EAAAh1B,GACA/O,EAAA8jC,EAAA/0B,GACA+gB,EAAAkU,EAAAhtG,EAAAuuE,MAAA,GAAAvF,EACA8jC,EAAA/0B,GAAA+gB,EAAAjqE,EAAA,GACAk+E,EAAAh1B,GAAAnjF,KAAAiF,MAAAi/F,EAAAjqE,EAAA,IAQA7uB,EAAAuvE,QAAAj7E,OAAA,EACA0L,EAAA8R,OAAAxd,OAAA,EACA0L,EAAAyvE,KAAAn7E,OAAAu6B,EAAA,GAAA,EACA7uB,EAAAuuE,MAAA1/C,EAAAxuB,QAEA,IAAA,IAAA43E,EAAA,EAAAA,EAAAj4E,EAAAyvE,KAAAn7E,OAAA2jF,IACAj4E,EAAAyvE,KAAAwI,GAAA,EAKA,IAAA,IAAAmI,EAAA,EAAAA,EAAAlgE,EAAA5rB,OAAA8rF,IAAA,CACA,IAAA+kB,EAAA4H,EAAA3sB,GACA6sB,EAAAH,EAAA1sB,GACA/2E,EAAA6W,EAAAkgE,GAIA+rB,EAFAF,EAAA9G,EAAAnlG,EAAAyvE,KAAAw9B,GAAAjtG,EAAAyvE,KAAAw9B,EAAA,GAAAjtG,EAAA8R,QAEAqzF,EAAA8H,EAAA5jG,EAAArJ,EAAAuvE,QAAAvvE,EAAA8R,OAAA9R,EAAAyvE,MAIA,OAAAzvE,GASAouE,EAAA33E,UAAAuD,MAAA,WAQA,OAPA,IAAAo0E,EAAA,CACAluD,OAAA1pB,KAAA+4E,QAAAluD,EAAArnB,MAAAxD,KAAA+4E,cAAA15E,EACAkY,MAAAsT,EAAArnB,MAAAxD,KAAAsb,QACA09D,IAAAnuD,EAAArnB,MAAAxD,KAAAi5E,MACA5gD,KAAAxN,EAAArnB,MAAAxD,KAAA+3E,OACAuQ,SAAAtoF,KAAAuoF,aAWA3Q,EAAA33E,UAAAo4B,KAAA,WACA,OAAAr4B,KAAA+3E,MAAAluE,MAAA,IAeA+tE,EAAA33E,UAAAm4B,IAAA,SAAA/a,EAAAo3F,GAEA,IAAAz0G,KAAA+4E,QACA,MAAA,IAAAt7E,MAAA,8CAIA,IAAA41G,EAAArzG,KAWA,OAQA,SAAAywD,EAAAimD,EAAAC,EAAAC,EAAAC,EAAAx5F,EAAAo3F,GAEA,IAAA/qF,EAAA,GACAnS,EAAA,GACAyhE,EAAA,GAEAjvE,EAAA4tE,EAEAia,EAAA,EAEAh0C,EAAA6S,EAAA83B,aAEAx+E,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAlnB,EAAA83B,UAAA93B,EAAA83B,aAAA5Q,EAEAia,EAAAthC,EAAA1nB,QAAA,EAAA6nB,EAAA83B,YAiBA,IAbA,IAAA3pC,EAAA,SAAA/rC,EAAA1U,EAAA+C,GAEA2R,EAAAwK,EAAAxK,EAAA1U,EAAA+C,GAEA6I,EAAA8I,EAAA++E,KAEAloE,EAAAtc,KAAAyF,GAEA0E,EAAAnK,KAAAjP,KAKAuJ,EAAAkvG,EAAAlvG,GAAAmvG,EAAAnvG,IAAA,CAEAsxE,EAAA5rE,KAAAsc,EAAA5rB,QAEA,IAAA67E,EAAAlpB,EAAAwoB,KAAAvxE,GACAkyE,EAAAnpB,EAAAwoB,KAAAvxE,EAAA,GAEA,GAAA+sG,EAEA,IAAA,IAAAhuG,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAAqzD,EAAAn1C,OAAA7U,GAEAiwG,GAAAt5G,GAAAA,GAAAu5G,GAEA/3D,EAAA6R,EAAAsoB,QAAAtyE,GAAArJ,EAAAs5G,EAAAhvG,EAAAkvG,OAGA,CAIA,IAFA,IAAA79B,EAAA,GAEA+9B,EAAAn9B,EAAAm9B,EAAAl9B,EAAAk9B,IAAA,CACA,IAAAC,EAAAtmD,EAAAn1C,OAAAw7F,GACA/9B,EAAAg+B,GAAAtmD,EAAAsoB,QAAA+9B,GAKA,IAAA,IAAAE,EAAAN,EAAAM,GAAAL,EAAAK,IAAA,CACA,IAAA5yG,EAAA4yG,KAAAj+B,EAAAA,EAAAi+B,GAAA,EACAp4D,EAAAx6C,EAAA4yG,EAAAN,EAAAhvG,EAAAkvG,KAQA,OAFA59B,EAAA5rE,KAAAsc,EAAA5rB,QAEA,IAAA85E,EAAA,CACAluD,OAAAA,EACAnS,MAAAA,EACAyhE,IAAAA,EACA3gD,KAAA,CAAAs+E,EAAAD,EAAA,EAAAG,EAAAD,EAAA,KAlFA3/B,CAAAj3E,KAAA,EATAA,KAAA+3E,MAAA,GASA,EAAA,EARA/3E,KAAA+3E,MAAA,GAQA,EANA,SAAAllE,EAAAzV,EAAAsK,GAEA,OAAA2V,EAAAxK,EAAA,CAAAzV,EAAAsK,GAAA2rG,IAIAoB,IA+FA78B,EAAA33E,UAAAqX,QAAA,SAAA+F,EAAAo3F,GAEA,IAAAz0G,KAAA+4E,QACA,MAAA,IAAAt7E,MAAA,kDASA,IALA,IAEAi3E,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,GAEArwE,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA,IAAAiyE,EAAA35E,KAAAi5E,KAAAvxE,GACAkyE,EAAA55E,KAAAi5E,KAAAvxE,EAAA,GAEA,GAAA+sG,EAEA,IAAA,IAAAhuG,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAA4C,KAAAsb,OAAA7U,GAEA4W,EAAArd,KAAA+4E,QAAAtyE,GAAA,CAAArJ,EAAAsK,GAhBA1H,UAkBA,CAIA,IAFA,IAAA0pB,EAAA,GAEAutF,EAAAt9B,EAAAs9B,EAAAr9B,EAAAq9B,IAEAvtF,EADA1pB,KAAAsb,OAAA27F,IACAj3G,KAAA+4E,QAAAk+B,GAKA,IAAA,IAAAC,EAAA,EAAAA,EAAAxiC,EAAAwiC,IAEA75F,EADA65F,KAAAxtF,EAAAA,EAAAwtF,GAAA,EACA,CAAAA,EAAAxvG,GA/BA1H,SA2CA43E,EAAA33E,UAAAmd,QAAA,WACA,OAAAy4F,EAAA71G,KAAA+4E,QAAA/4E,KAAAsb,OAAAtb,KAAAi5E,KAAAj5E,KAAA+3E,OAAA,IASAH,EAAA33E,UAAA2D,QAAA,WACA,OAAAiyG,EAAA71G,KAAA+4E,QAAA/4E,KAAAsb,OAAAtb,KAAAi5E,KAAAj5E,KAAA+3E,OAAA,IA+CAH,EAAA33E,UAAAo2D,OAAA,SAAA7a,GASA,IAPA,IAAAk5B,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,GAEAwe,EAAAv2F,KAAAu2F,UAEA3vF,EAAA,kBAAAsxB,EAAAm+B,OAAAqe,EAAAl5B,GAAA,MAAAtjB,EAAAm+B,OAAA2hB,EAAAx8B,GAAA,cAAAtjB,EAAAm+B,OAAAkgC,EAAA/6C,GAAA,KAEA9zC,EAAA,EAAAA,EAAAswE,EAAAtwE,IAKA,IAHA,IAAAiyE,EAAA35E,KAAAi5E,KAAAvxE,GACAkyE,EAAA55E,KAAAi5E,KAAAvxE,EAAA,GAEAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAA4C,KAAAsb,OAAA7U,GAEAG,GAAA,UAAAsxB,EAAAm+B,OAAAj5D,EAAAo+C,GAAA,KAAAtjB,EAAAm+B,OAAA3uD,EAAA8zC,GAAA,UAAAx7C,KAAA+4E,QAAA7gD,EAAAm+B,OAAAr2D,KAAA+4E,QAAAtyE,GAAA+0C,GAAA,KAIA,OAAA50C,GASAgxE,EAAA33E,UAAAwD,SAAA,WACA,OAAAy0B,EAAAm+B,OAAAr2D,KAAAod,YASAw6D,EAAA33E,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,eACA7sC,OAAA1pB,KAAA+4E,QACAxhE,MAAAvX,KAAAsb,OACA09D,IAAAh5E,KAAAi5E,KACA5gD,KAAAr4B,KAAA+3E,MACAuQ,SAAAtoF,KAAAuoF,YAaA3Q,EAAA33E,UAAAihG,SAAA,SAAAz6F,GAEA,GAAAA,GAOA,GALA4wC,EAAA6b,YAAAzsD,KACAA,EAAAA,EAAA2I,aAIAuuC,EAAAl3C,KAAAyF,EAAAzF,GACA,MAAA,IAAAkzB,UAAA,kDAIAlzB,EAAA,EAGA,IAAAs6F,EAAA,EAAAt6F,EAAAA,EAAA,EACAu6F,EAAAv6F,EAAA,GAAAA,EAAA,EAEAiuE,EAAA10E,KAAA+3E,MAAA,GACAC,EAAAh4E,KAAA+3E,MAAA,GAEA96E,EAAAmB,KAAA4I,IAAA0tE,EAAAssB,EAAAhpB,EAAA+oB,GAEAr3E,EAAA,GACAnS,EAAA,GACAyhE,EAAA,GAEAA,EAAA,GAAA,EAEA,IAAA,IAAAtxE,EAAAq5F,EAAAr5F,EAAAswE,GAAAtuD,EAAA5rB,OAAAb,EAAAyK,IAKA,IAHA,IAAAiyE,EAAA35E,KAAAi5E,KAAAvxE,GACAkyE,EAAA55E,KAAAi5E,KAAAvxE,EAAA,GAEAvJ,EAAAw7E,EAAAx7E,EAAAy7E,EAAAz7E,IAAA,CAEA,IAAAf,EAAA4C,KAAAsb,OAAAnd,GAEA,GAAAf,IAAAsK,EAAAq5F,EAAAC,EAAA,CAEAt3E,EAAAtc,KAAApN,KAAA+4E,QAAA56E,IAEAoZ,EAAAmS,EAAA5rB,OAAA,GAAAV,EAAA4jG,EAEA,OAQA,OAFAhoB,EAAA5rE,KAAAsc,EAAA5rB,QAEA,IAAA85E,EAAA,CACAluD,OAAAA,EACAnS,MAAAA,EACAyhE,IAAAA,EACA3gD,KAAA,CAAAp7B,EAAA,MAaA26E,EAAAphB,SAAA,SAAA1D,GACA,OAAA,IAAA8kB,EAAA9kB,IAeA8kB,EAAAspB,SAAA,SAAA7oE,EAAAj0B,EAAAqC,EAAAuuC,EAAAszC,GACA,IAAAxqD,EAAAzF,GACA,MAAA,IAAAsB,UAAA,kCAGA,GAAA,IAAAtB,EAAAv6B,OACA,MAAA,IAAAL,MAAA,4CAmBA,GAfA46B,EAAAA,EAAAD,IAAA,SAAAjwB,GAQA,GANAkvC,EAAA6b,YAAA/qD,KAEAA,EAAAA,EAAAiH,aAIAuuC,EAAAx1C,KAAA+D,EAAA/D,IAAAA,EAAA,EACA,MAAA,IAAA1K,MAAA,yCAGA,OAAA0K,IAGA1B,GAOA,GALA4wC,EAAA6b,YAAAzsD,KACAA,EAAAA,EAAA2I,aAIAuuC,EAAAl3C,KAAAyF,EAAAzF,GACA,MAAA,IAAAkzB,UAAA,kDAIAlzB,EAAA,EAIA,IAAAsD,EAAA4tE,EAEAia,EAAA,EAEAh0C,EAAA0qC,KAEAv+E,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAA2Q,EAAAA,KAAA3Q,EAEAia,EAAAthC,EAAA1nB,QAAA,EAAA0/C,IAGA,IAQAimB,EARAxN,EAAA,EAAAt6F,EAAAA,EAAA,EACAu6F,EAAAv6F,EAAA,GAAAA,EAAA,EAEAiuE,EAAAr8C,EAAA,GACA2/C,EAAA3/C,EAAA,GAEAp7B,EAAAmB,KAAA4I,IAAA0tE,EAAAssB,EAAAhpB,EAAA+oB,GAKA,GAAAjjE,EAAA15B,GAAA,CAEA,GAAAA,EAAAtG,SAAAb,EAEA,MAAA,IAAAQ,MAAA,8BAIA8wG,EAAA,SAAAnxG,GAEA,OAAAgH,EAAAhH,SAEA,GAAAi6C,EAAA+b,SAAAhvD,GAAA,CAEA,IAAA68F,EAAA78F,EAAAi0B,OAEA,GAAA,IAAA4oE,EAAAnjG,QAAAmjG,EAAA,KAAAhkG,EAEA,MAAA,IAAAQ,MAAA,yBAIA8wG,EAAA,SAAAnxG,GAEA,OAAAgH,EAAAyW,IAAA,CAAAzd,UAIAmxG,EAAA,WAEA,OAAAnqG,GASA,IAJA,IAAAslB,EAAA,GACAnS,EAAA,GACAyhE,EAAA,GAEAtxE,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAsxE,EAAA5rE,KAAAsc,EAAA5rB,QAEA,IAAAV,EAAAsK,EAAAq5F,EAEA,GAAA,GAAA3jG,GAAAA,EAAAH,EAAA,CAEA,IAAA4V,EAAA07F,EAAAnxG,GAGA2M,EAAA8I,EAAA++E,KAEAr6E,EAAAnK,KAAAhQ,EAAA4jG,GAEAt3E,EAAAtc,KAAAyF,KAQA,OAFAmmE,EAAA5rE,KAAAsc,EAAA5rB,QAEA,IAAA85E,EAAA,CACAluD,OAAAA,EACAnS,MAAAA,EACAyhE,IAAAA,EACA3gD,KAAA,CAAAq8C,EAAAsD,MAcAJ,EAAA33E,UAAAqzG,SAAA,SAAAl2G,EAAAsK,GAEA,KAAAi2C,EAAAvgD,IAAA8O,EAAA9O,IAAAugD,EAAAj2C,IAAAwE,EAAAxE,IACA,MAAA,IAAAjK,MAAA,uCAIA,GAAA,IAAAuC,KAAA+3E,MAAAj6E,OACA,MAAA,IAAAL,MAAA,4CAUA,OANAwoG,EAAA7oG,EAAA4C,KAAA+3E,MAAA,IACAkuB,EAAAv+F,EAAA1H,KAAA+3E,MAAA,IAEAH,EAAAa,UAAAr7E,EAAAsK,EAAA1H,KAAA+3E,MAAA,GAAA/3E,KAAA+4E,QAAA/4E,KAAAsb,OAAAtb,KAAAi5E,MAGAj5E,MAaA43E,EAAAkC,YAAA,SAAApyE,EAAAgiB,EAAAnS,EAAAyhE,EAAA37D,GAKA,IAHA,IAAAs8D,EAAAX,EAAAtxE,GACAkyE,EAAAZ,EAAAtxE,EAAA,GAEAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAEA4W,EAAA9F,EAAA9Q,GAAAijB,EAAAjjB,KAeAmxE,EAAAa,UAAA,SAAAt6E,EAAA+C,EAAA82E,EAAAtuD,EAAAnS,EAAAyhE,GAEA,IAAA,IAAAtxE,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA,IAAAiyE,EAAAX,EAAAtxE,GACAkyE,EAAAZ,EAAAtxE,EAAA,GAEAwyE,EAAAu7B,EAAAt3G,EAAAw7E,EAAAC,EAAAriE,GAGA4iE,EAAAs7B,EAAAv0G,EAAAy4E,EAAAC,EAAAriE,GAGA,GAAA2iE,EAAAN,GAAAO,EAAAP,GAAAriE,EAAA2iE,KAAA/7E,GAAAoZ,EAAA4iE,KAAAj5E,GAEA,GAAAwoB,EAAA,CACA,IAAA7W,EAAA6W,EAAAwwD,GACAxwD,EAAAwwD,GAAAxwD,EAAAywD,GACAzwD,EAAAywD,GAAAtnE,QAQA,GAAAqnE,EAAAN,GAAAriE,EAAA2iE,KAAA/7E,IAAAy7E,GAAAO,GAAA5iE,EAAA4iE,KAAAj5E,GAAA,CAEA,IAAAi2G,EAAAztF,EAAAA,EAAAwwD,QAAA76E,EAEAkY,EAAA0jB,OAAAk/C,EAAA,EAAAj5E,GAEAwoB,GACAA,EAAAuR,OAAAk/C,EAAA,EAAAg9B,GAIA5/F,EAAA0jB,OAAAk/C,GAAAD,EAAAA,EAAA,EAAAA,EAAA,GAEAxwD,GACAA,EAAAuR,OAAAk/C,GAAAD,EAAAA,EAAA,EAAAA,EAAA,QAQA,GAAAC,EAAAP,GAAAriE,EAAA4iE,KAAAj5E,IAAA04E,GAAAM,GAAA3iE,EAAA2iE,KAAA/7E,GAAA,CAEA,IAAAi5G,EAAA1tF,EAAAA,EAAAywD,QAAA96E,EAEAkY,EAAA0jB,OAAAi/C,EAAA,EAAA/7E,GAEAurB,GACAA,EAAAuR,OAAAi/C,EAAA,EAAAk9B,GAIA7/F,EAAA0jB,OAAAi/C,GAAAC,EAAAA,EAAA,EAAAA,EAAA,GAEAzwD,GACAA,EAAAuR,OAAAi/C,GAAAC,EAAAA,EAAA,EAAAA,EAAA,MAOA9iC,EAAA43B,OAAAukC,SAAAl8C,OAAAsgB,GAOAh6E,EAAA+zD,MAAA,6KC3/CA,aA2DA/zD,EAAA2I,KAAA,QACA3I,EAAA8vD,QA1DA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAoCA,OAAAA,EAAA,QAAA,CACA+mD,0DAAA,SAAAzlG,GACA,IAAA8iG,EAAA9iG,EAAAwmB,IAAA,SAAA33B,GACA,OAAA42C,EAAA6b,YAAAzyD,GACAA,EAAA2O,WACA+N,MAAA2gB,QAAAr9B,IAAA42C,EAAA+b,SAAA3yD,GACAA,EAAA23B,IAAA,SAAA82C,GAEA,OAAA73B,EAAA6b,YAAAgc,GAAAA,EAAA9/D,WAAA8/D,IAGAzuE,IAGA6B,EAAA,IAAA+0C,EAAAh8B,MAEA,OADAg8B,EAAAh8B,MAAA3D,MAAApV,EAAAoyG,GACApyG,gCCtDA,aA6EA1E,EAAA2I,KAAA,SACA3I,EAAA8vD,QA5EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAiCA,IAAAG,EAAAH,EAAA,SAAA,CACA8Q,GAAA,WACA,OAAAk2C,EAAA,KAEAp/E,OAAA,SAAAm+B,GACA,OAAAihD,EAAA,GAAAjhD,IAEAylB,iBAAA,SAAAzlB,EAAAiyB,GACA,OAAAgvB,EAAA,GAAAjhD,EAAAiyB,IAEAnrE,MAAA,SAAAuiB,GACA,OAAA43E,EAAA53E,IAEAuvC,OAAA,SAAAvvC,GACA,OAAA43E,EAAA53E,EAAAA,EAAA8zD,YAEAgQ,yBAAA8T,EACAC,iCAAAD,IAOA,OALA7mD,EAAA2R,MAAA,CACAmvC,EAAA,iCACAxzG,EAAA,4BACA6xF,EAAA,6BAEAn/B,EAUA,SAAA6mD,EAAA53E,EAAA22B,EAAAiyB,GAIA,OAAA,IAFAjxC,EAAA43B,OAAAukB,QAAAn9B,GAAA,WAEA,CAAA32B,EAAA4oD,+BCzEA,aAqDA1qF,EAAA2I,KAAA,SACA3I,EAAA8vD,QApDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAsnB,EAAAvgC,EAAAugC,aA6BAtgB,EAAAhH,EAAA,SAAA,CACA8Q,GAAA,WACA,OAAA,IAAAwW,EAAA,KAEA1/C,OAAA,SAAAowD,GACA,OAAA,IAAA1Q,EAAA,GAAA0Q,IAEAxnB,iBAAA,SAAAphC,GACA,OAAA,IAAAk4C,EAAAl4C,IAEA8jE,yBAAA,SAAA9jE,EAAA4oD,GACA,OAAA,IAAA1Q,EAAAl4C,EAAA4oD,MAOA,OAJAhxB,EAAA8K,MAAA,CACAmvC,EAAA,iCACAxzG,EAAA,6BAEAu5D,6BClDA,aAEAt5D,EAAAJ,QAAA,CACAd,EAAA,YAAAA,EAAA,iBAAAA,EAAA,kBAAAA,EAAA,SAAAA,EAAA,mBAAAA,EAAA,0BAAAA,EAAA,iBAAAA,EAAA,WACAA,EAAA,oBAAAA,EAAA,qBAAAA,EAAA,qBACAA,EAAA,qTCLA,aAEA,IAAAq4D,EAAAr4D,EAAA,iCA4GAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QA3GA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAsGA,OAjFA,SAAAuiD,EAAAC,EAAAp6F,EAAAra,GAEA,IAAAmwF,EAAAqkB,EAAAv/B,MACAuQ,EAAAgvB,EAAAz/B,MACAiV,EAAAwqB,EAAAjvB,UAEAqF,EAAA6pB,EAAA1+B,QACAuU,EAAAmqB,EAAAn8F,OACAiyE,EAAAkqB,EAAAx+B,KACAwa,EAAAgkB,EAAA1/B,MACAqb,EAAAqkB,EAAAlvB,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAAA7F,EACA,MAAA,IAAAnwF,MAAA,sEAIA,IAOAL,EAAAsK,EAPAgtE,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAEA0K,EAAA,iBAAAlG,GAAAA,IAAAoG,EAAApG,OAAA3tF,EAEAq4G,EAAAxkB,EAAA5iC,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,IAAA71E,EAIAs6F,EAAA,GAEA,IAAAv6G,EAAA,EAAAA,EAAAs3E,EAAAt3E,IACAu6G,EAAAv6G,GAAA,GAIA,IAAAe,EAAA,GAEA0I,EAAA,GAEA,IAAAa,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAIA,IAFA,IAAAmhF,EAAAnhF,EAAA,EAEAiyE,EAAA4T,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAtI,EAFAf,EAAAkwF,EAAA7mF,IAEAzD,EAAA00G,EAAA9pB,EAAAnnF,GAAA0sF,EAAA/1F,GAAAsK,IAAAgwG,EAAAvkB,EAAA/1F,GAAAsK,GAAAkmF,EAAAnnF,IAEAI,EAAAzJ,GAAAyrF,EAIA,IAAAzrF,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEAyJ,EAAAzJ,KAAAyrF,EAEA8uB,EAAAv6G,GAAAsK,GAAAvJ,EAAAf,GAGAu6G,EAAAv6G,GAAAsK,GAAAyrF,EAAA/1F,GAAAsK,GAMA,OAAA,IAAAutD,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,kECvGA,aAEA,IAAA/9B,EAAAr4D,EAAA,iCAgHAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QA/GA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aAyGA,OApFA,SAAA4/B,EAAAC,EAAAp6F,EAAAra,GAEA,IAAAmwF,EAAAqkB,EAAAv/B,MACAuQ,EAAAgvB,EAAAz/B,MACAiV,EAAAwqB,EAAAjvB,UAEAqF,EAAA6pB,EAAA1+B,QACAuU,EAAAmqB,EAAAn8F,OACAiyE,EAAAkqB,EAAAx+B,KACAwa,EAAAgkB,EAAA1/B,MACAqb,EAAAqkB,EAAAlvB,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAAA7F,EACA,MAAA,IAAAnwF,MAAA,sEAIA,IAGAy1F,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAQA,IAJA,IAAAjG,EAAA,GACApD,EAAA,GACAC,EAAA,GAEApiF,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA,IAAA67E,EAAA4T,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAAkwF,EAAA7mF,GAEAsuF,EAAA/xF,EAAA00G,EAAA9pB,EAAAnnF,GAAA0sF,EAAA/1F,GAAAsK,IAAAgwG,EAAAvkB,EAAA/1F,GAAAsK,GAAAkmF,EAAAnnF,IAEAsD,EAAAgrF,EAAAnD,KAEA/H,EAAAz8E,KAAAhQ,GACA6vF,EAAA7/E,KAAA2nF,KAQA,OAFAjL,EAAA9R,GAAA6R,EAAA/rF,OAEA,IAAA85E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,iHC3GA,aAEA,IAAA/9B,EAAAr4D,EAAA,iCAsHAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QArHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAgHA,OA3FA,SAAAuiD,EAAAC,EAAAp6F,EAAAra,GAEA,IAAAmwF,EAAAqkB,EAAAv/B,MACAuQ,EAAAgvB,EAAAz/B,MACAiV,EAAAwqB,EAAAjvB,UAEAqF,EAAA6pB,EAAA1+B,QACAuU,EAAAmqB,EAAAn8F,OACAiyE,EAAAkqB,EAAAx+B,KACAwa,EAAAgkB,EAAA1/B,MACAqb,EAAAqkB,EAAAlvB,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAAA7F,EACA,MAAA,IAAAnwF,MAAA,sEAIA,IAGAy1F,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAoJ,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEA4E,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAMA,IAFA,IAAAykB,EAAA,GAEAz4G,EAAA,EAAAA,EAAAw1E,EAAAx1E,IAEAy4G,EAAAz4G,GAAA,GAQA,IAJA,IAAAf,EAAA,GAEA0I,EAAA,GAEAa,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAIA,IAFA,IAAAmhF,EAAAnhF,EAAA,EAEAiyE,EAAA4T,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAAkwF,EAAA7mF,GAEAtI,EAAAf,GAAA4F,EAAA00G,EAAA9pB,EAAAnnF,GAAA0sF,EAAA/1F,GAAAsK,IAAAgwG,EAAAvkB,EAAA/1F,GAAAsK,GAAAkmF,EAAAnnF,IACAI,EAAAzJ,GAAAyrF,EAIA,IAAA,IAAA3nF,EAAA,EAAAA,EAAAwzE,EAAAxzE,IAEA2F,EAAA3F,KAAA2nF,EAEA8uB,EAAAz2G,GAAAwG,GAAAvJ,EAAA+C,GAGAy2G,EAAAz2G,GAAAwG,GAAA1E,EAAA00G,EAAA9lB,EAAAuB,EAAAjyF,GAAAwG,IAAAgwG,EAAAvkB,EAAAjyF,GAAAwG,GAAAkqF,GAMA,OAAA,IAAA38B,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,kECjHA,aAEA,IAAA/9B,EAAAr4D,EAAA,iCAiLAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QAhLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aA0KA,OAtJA,SAAAp6E,EAAAkB,EAAA2e,GAEA,IAAAgvE,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACAuP,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KACAwa,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAGAP,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAIA,IAkBA91F,EAAAsK,EAAAjB,EAAAkzE,EAAAC,EAlBAqT,EAAAZ,GAAAuB,EAAA,QAAAvuF,EACAwqF,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA0kB,EAAAvrB,GAAAuB,EAAA,QAAAvuF,EACAw4G,EAAAxrB,GAAAuB,EAAA,QAAAvuF,EAEAy4G,EAAA,GACAC,EAAA,GAIA,IAAArwG,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA+qF,EAAAnhF,EAAA,EAEA,IAAAiyE,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAEArJ,EAAA+uF,EAAA1lF,GAEAojF,EAAAz8E,KAAAhQ,GAEA06G,EAAA16G,GAAAyrF,EAEA+uB,IACAA,EAAAx6G,GAAAivF,EAAA5lF,IAKA,IAAAkzE,EAAA4T,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIA,GAAAqxG,EAFA16G,EAAAkwF,EAAA7mF,MAEAoiF,GAEA,GAAA+uB,EAAA,CAEA,IAAA/kG,EAAA6kG,EAAAE,EAAAx6G,GAAAwwF,EAAAnnF,IAEAsD,EAAA8I,EAAA++E,GAKAkmB,EAAA16G,GAAA,KAHAw6G,EAAAx6G,GAAAyV,QAQAg3E,EAAAz8E,KAAAhQ,GAEA26G,EAAA36G,GAAAyrF,EAEAgvB,IACAA,EAAAz6G,GAAAwwF,EAAAnnF,IAMA,GAAAmxG,GAAAC,EAIA,IAFApxG,EAAAqjF,EAAApiF,GAEAjB,EAAAojF,EAAA/rF,QAIAg6G,EAFA16G,EAAAysF,EAAApjF,MAEAoiF,GAEAoE,EAAAxmF,GAAAmxG,EAAAx6G,GAEAqJ,KACAsxG,EAAA36G,KAAAyrF,GAEAoE,EAAAxmF,GAAAoxG,EAAAz6G,GAEAqJ,KAGAojF,EAAA5uD,OAAAx0B,EAAA,GASA,OAFAqjF,EAAA9R,GAAA6R,EAAA/rF,OAEAR,+GC7KA,aAEA,IAAA63D,EAAAr4D,EAAA,iCA0KAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QAzKA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aAmKA,OA/IA,SAAAp6E,EAAAkB,EAAA2e,GAEA,IAAAgvE,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACAuP,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KACAwa,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAGAP,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAIA,IAkBA91F,EAAAsK,EAAAjB,EAAAmzE,EAlBAqT,EAAAZ,GAAAuB,EAAA,QAAAvuF,EACAwqF,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA0kB,EAAA3qB,EAAA,QAAA5tF,EACAw4G,EAAA5qB,EAAA,QAAA5tF,EAEAy4G,EAAA,GACAC,EAAA,GAIA,IAAArwG,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA+qF,EAAAnhF,EAAA,EAEA,IAAAjB,EAAA2lF,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAmzE,EAAAnzE,IAEArJ,EAAA+uF,EAAA1lF,GAEAojF,EAAAz8E,KAAAhQ,GAEA06G,EAAA16G,GAAAyrF,EAEA+uB,IACAA,EAAAx6G,GAAAivF,EAAA5lF,IAKA,IAAAA,EAAA8mF,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAmzE,EAAAnzE,IAIAqxG,EAFA16G,EAAAkwF,EAAA7mF,MAEAoiF,GAEAgB,EAAAz8E,KAAAhQ,GAIA26G,EAAA36G,GAAAyrF,EAEAgvB,IACAA,EAAAz6G,GAAAwwF,EAAAnnF,IAKA,GAAAwmF,EAIA,IAFAxmF,EAAAqjF,EAAApiF,GAEAjB,EAAAojF,EAAA/rF,QAAA,CAIA,IAAAk6G,EAAAF,EAFA16G,EAAAysF,EAAApjF,IAGAwxG,EAAAF,EAAA36G,GAEA,GAAA46G,IAAAnvB,GAAAovB,IAAApvB,EAAA,CAEA,IAGAqvB,EAAAR,EAHAM,IAAAnvB,EAAA+uB,EAAAx6G,GAAAw0F,EACAqmB,IAAApvB,EAAAgvB,EAAAz6G,GAAAw0F,GAIA7nF,EAAAmuG,EAAAtmB,GAOA/H,EAAA5uD,OAAAx0B,EAAA,IALAwmF,EAAA7/E,KAAA8qG,GAEAzxG,OAaA,OAFAqjF,EAAA9R,GAAA6R,EAAA/rF,OAEAR,+GCtKA,aAEA,IAAA66G,EAAAr7G,EAAA,uCAEAq4D,EAAAr4D,EAAA,iCAqJAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QApJA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aA8IA,OA1HA,SAAAp6E,EAAAkB,EAAA2e,GAEA,IAAAgvE,EAAA7uF,EAAAu7E,QACAyP,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACA0a,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAGAP,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAsBA,IAlBA,IAAAjG,EAAAZ,GAAAuB,EAAA,QAAAvuF,EACAwqF,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA/0F,EAAA8uF,EAAA,QAAA5tF,EAEAwH,EAAA,GAEAtJ,EAAA,GAEAmK,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA+qF,EAAAnhF,EAAA,EAMA,GAJAywG,EAAA36G,EAAAkK,EAAAb,EAAA1I,EAAAZ,EAAAsrF,EAAAvrF,EAAAo6G,GAEAS,EAAAz5G,EAAAgJ,EAAAb,EAAA1I,EAAAZ,EAAAsrF,EAAAvrF,EAAAo6G,GAEAv5G,EAIA,IAFA,IAAAsI,EAAAqjF,EAAApiF,GAEAjB,EAAAojF,EAAA/rF,QAAA,CAEA,IAAAV,EAAAysF,EAAApjF,GAEA,GAAAlJ,EAAAH,KAAAyrF,EAAA,CAEA,IAAAh2E,EAAA1U,EAAAf,GAEA2M,EAAA8I,EAAA++E,GAOA/H,EAAA5uD,OAAAx0B,EAAA,IALAwmF,EAAA7/E,KAAAyF,GAEApM,UAOAojF,EAAA5uD,OAAAx0B,EAAA,QAOA,IAFA,IAAA9I,EAAAmsF,EAAApiF,GAEA/J,EAAAksF,EAAA/rF,QAIAP,EAFAssF,EAAAlsF,MAEAkrF,EAEAgB,EAAA5uD,OAAAt9B,EAAA,GAGAA,IASA,OAFAmsF,EAAA9R,GAAA6R,EAAA/rF,OAEAR,yJCnJA,aAEA,IAAA63D,EAAAr4D,EAAA,iCAsHAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QArHA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAiGA,SAAAmjD,EAAA5uG,EAAA9B,EAAAb,EAAA1I,EAAA0qF,GAMA,IAJA,IAAAn/D,EAAAlgB,EAAAuvE,QACAxhE,EAAA/N,EAAA8R,OACA09D,EAAAxvE,EAAAyvE,KAEAxyE,EAAAuyE,EAAAtxE,GAAAkyE,EAAAZ,EAAAtxE,EAAA,GAAAjB,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAAma,EAAA9Q,GAEAI,EAAAzJ,GAAAyrF,EACA1qF,EAAAf,GAAAssB,EAAAjjB,IAIA,OAhGA,SAAAjJ,EAAAkB,EAAA2e,GAEA,IAAAmrE,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAkL,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAGAP,EAgBA91F,EAAAsK,EAnBAgtE,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAoJ,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEA4E,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAMA,IAAAykB,EAAA,GAEA,IAAAv6G,EAAA,EAAAA,EAAAs3E,EAAAt3E,IACAu6G,EAAAv6G,GAAA,GAIA,IAAAE,EAAA,IAAA23D,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA0kB,EAAA,GACAC,EAAA,GAEAC,EAAA,GACAC,EAAA,GAEA,IAAArwG,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEA,IAAAmhF,EAAAnhF,EAAA,EAQA,IANA0wG,EAAA56G,EAAAkK,EAAAowG,EAAAF,EAAA/uB,GAGAuvB,EAAA15G,EAAAgJ,EAAAqwG,EAAAF,EAAAhvB,GAGAzrF,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAAA,CAEA,IAAAi7G,EAAAP,EAAA16G,KAAAyrF,EAAA+uB,EAAAx6G,GAAAw0F,EACA0mB,EAAAP,EAAA36G,KAAAyrF,EAAAgvB,EAAAz6G,GAAAw0F,EAEA+lB,EAAAv6G,GAAAsK,GAAAgwG,EAAAW,EAAAC,IAKA,OAAAh7G,gECnGA,aAEA,IAAA63D,EAAAr4D,EAAA,iCAwJAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QAvJA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aAiJA,OA7HA,SAAAp6E,EAAAkB,EAAA2e,GAEA,IAAAgvE,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACAuP,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KACAwa,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAAApH,IAAAuB,EACA,MAAA,IAAAnwF,MAAA,uDAIA,IAGAy1F,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAsBA,IAlBA,IAgBAzsF,EAAAkzE,EAAAC,EAAAx8E,EAhBA6vF,EAAA,GACApD,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA/0F,EAAA,GAEA0I,EAAA,GAIAa,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA+qF,EAAAnhF,EAAA,EAEA,IAAAiyE,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAI,EAFAzJ,EAAA+uF,EAAA1lF,IAEAoiF,EAEA1qF,EAAAf,GAAAivF,EAAA5lF,GAEAojF,EAAAz8E,KAAAhQ,GAIA,IAAAu8E,EAAA4T,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAI,EAFAzJ,EAAAkwF,EAAA7mF,MAEAoiF,IAEA1qF,EAAAf,GAAAs6G,EAAAv5G,EAAAf,GAAAwwF,EAAAnnF,KAOA,IAFAA,EAAAqjF,EAAApiF,GAEAjB,EAAAojF,EAAA/rF,QAAA,CAIA,IAAA+U,EAAA1U,EAFAf,EAAAysF,EAAApjF,IAIAsD,EAAA8I,EAAA++E,GAOA/H,EAAA5uD,OAAAx0B,EAAA,IALAwmF,EAAA7/E,KAAAyF,GAEApM,MAWA,OAFAqjF,EAAA9R,GAAA6R,EAAA/rF,OAEAR,+GCpJA,aAEA,IAAA63D,EAAAr4D,EAAA,iCA2IAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QA1IA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aAoIA,OAhHA,SAAAp6E,EAAAkB,EAAA2e,GAEA,IAAAgvE,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KACAuP,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAqF,EAAAlvF,EAAAq6E,QACAuU,EAAA5uF,EAAA4c,OACAiyE,EAAA7uF,EAAAu6E,KACAwa,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEA,GAAAC,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,GAAA0qF,EAAA,KAAAiL,EAAA,IAAAjL,EAAA,KAAAiL,EAAA,GACA,MAAA,IAAAl+B,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA,IAGAP,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAIA,IAgBA91F,EAAAsK,EAAAjB,EAAAkzE,EAAAC,EAhBAqT,EAAAZ,GAAAuB,EAAA,QAAAvuF,EACAwqF,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA/0F,EAAA8uF,EAAA,QAAA5tF,EAEAwH,EAAA,GAIA,IAAAa,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA+qF,EAAAnhF,EAAA,EAEA,GAAAvJ,EAEA,IAAAw7E,EAAA4T,EAAA7lF,GAAAkyE,EAAA2T,EAAA7lF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAI,EAFAzJ,EAAAkwF,EAAA7mF,IAEAoiF,EACA1qF,EAAAf,GAAAwwF,EAAAnnF,GAKA,IAAAkzE,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIA,GAFArJ,EAAA+uF,EAAA1lF,GAEAtI,EAAA,CAEA,IAAAm6G,EAAAzxG,EAAAzJ,KAAAyrF,EAAA1qF,EAAAf,GAAAw0F,EAEAsmB,EAAAR,EAAArrB,EAAA5lF,GAAA6xG,GAEAvuG,EAAAmuG,EAAAtmB,KAEA/H,EAAAz8E,KAAAhQ,GAEA6vF,EAAA7/E,KAAA8qG,SAIAruB,EAAAz8E,KAAAhQ,GAQA,OAFA0sF,EAAA9R,GAAA6R,EAAA/rF,OAEAR,+GCvIA,aAwGAM,EAAA2I,KAAA,cACA3I,EAAA8vD,QAvGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAkGA,OA7EA,SAAA9sD,EAAAzJ,EAAA2e,EAAAra,GAEA,IAAAqpF,EAAAlkF,EAAA4wE,QACAoT,EAAAhkF,EAAAmT,OACA8wE,EAAAjkF,EAAA8wE,KACAuP,EAAArgF,EAAA4vE,MACAiV,EAAA7kF,EAAAogF,UAEA,IAAA8D,EACA,MAAA,IAAA5uF,MAAA,sEAIA,IAGAy1F,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAkvB,EAAAr6F,EAEA,iBAAA2vE,IAEAkG,EAAAlG,EAEAtuF,EAAA4xD,EAAA1nB,QAAAlqC,EAAAw0F,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAgBA,IAZA,IAAAykB,EAAA,GAEAr6G,EAAA,IAAA23D,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA/0F,EAAA,GAEA0I,EAAA,GAEAa,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAIA,IAFA,IAAAmhF,EAAAnhF,EAAA,EAEAiyE,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAA1J,EAAAovF,EAAA1lF,GAEAtI,EAAApB,GAAAsvF,EAAA5lF,GACAI,EAAA9J,GAAA8rF,EAIA,IAAA,IAAAzrF,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEA,IAAAsK,IAEAiwG,EAAAv6G,GAAA,IAIAyJ,EAAAzJ,KAAAyrF,EAEA8uB,EAAAv6G,GAAAsK,GAAA1E,EAAA00G,EAAAh5G,EAAAP,EAAAf,IAAAs6G,EAAAv5G,EAAAf,GAAAsB,GAGAi5G,EAAAv6G,GAAAsK,GAAAhJ,EAMA,OAAApB,8BClGA,aAsGAM,EAAA2I,KAAA,cACA3I,EAAA8vD,QArGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAqnB,EAAA/mB,EAAA9zD,EAAA,6CACA86E,EAAAvgC,EAAAugC,aA+FA,OA1EA,SAAAzvE,EAAAzJ,EAAA2e,EAAAra,GAEA,IAAAqpF,EAAAlkF,EAAA4wE,QACAoT,EAAAhkF,EAAAmT,OACA8wE,EAAAjkF,EAAA8wE,KACAuP,EAAArgF,EAAA4vE,MACAiV,EAAA7kF,EAAAogF,UAEA,IAAA8D,EACA,MAAA,IAAA5uF,MAAA,sEAIA,IAGAy1F,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAz+E,EAAA4tE,EAEAia,EAAA,EAEA8lB,EAAAr6F,EAEA,iBAAA2vE,IAEAkG,EAAAlG,EAEAjjF,EAAAumD,EAAA3V,KAAAg9B,EAAA,CAAAub,EAAAA,IAEAtB,EAAAthC,EAAA1nB,QAAA,EAAAsqD,GAEAx0F,EAAA4xD,EAAA1nB,QAAAlqC,EAAAw0F,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAgBA,IAZA,IAAAjG,EAAA,GACApD,EAAA,GACAC,EAAA,GAEAxsF,EAAA,IAAAs6E,EAAA,CACAluD,OAAAujE,EACA11E,MAAAsyE,EACA7Q,IAAA8Q,EACAzxD,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGAxrF,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAEAoiF,EAAApiF,GAAAmiF,EAAA/rF,OAEA,IAAA,IAAA67E,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAArJ,EAAA+uF,EAAA1lF,GAEAoM,EAAA7P,EAAA00G,EAAAh5G,EAAA2tF,EAAA5lF,IAAAixG,EAAArrB,EAAA5lF,GAAA/H,GAEAqL,EAAA8I,EAAA++E,KAEA/H,EAAAz8E,KAAAhQ,GACA6vF,EAAA7/E,KAAAyF,KAQA,OAFAi3E,EAAA9R,GAAA6R,EAAA/rF,OAEAR,4EChGA,aAwGAM,EAAA2I,KAAA,cACA3I,EAAA8vD,QAvGA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAkGA,OA7EA,SAAA9sD,EAAAzJ,EAAA2e,EAAAra,GAEA,IAAAqpF,EAAAlkF,EAAA4wE,QACAoT,EAAAhkF,EAAAmT,OACA8wE,EAAAjkF,EAAA8wE,KACAuP,EAAArgF,EAAA4vE,MACAiV,EAAA7kF,EAAAogF,UAEA,IAAA8D,EACA,MAAA,IAAA5uF,MAAA,sEAIA,IAGAy1F,EAHAxe,EAAA8T,EAAA,GACAxQ,EAAAwQ,EAAA,GAIAkvB,EAAAr6F,EAEA,iBAAA2vE,IAEAkG,EAAAlG,EAEAtuF,EAAA4xD,EAAA1nB,QAAAlqC,EAAAw0F,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAgBA,IAZA,IAAAykB,EAAA,GAEAr6G,EAAA,IAAA23D,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAA,CAAAq8C,EAAAsD,GACAsQ,SAAA4K,IAGA/0F,EAAA,GAEA0I,EAAA,GAEAa,EAAA,EAAAA,EAAAswE,EAAAtwE,IAAA,CAIA,IAFA,IAAAmhF,EAAAnhF,EAAA,EAEAiyE,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAAA,CAEA,IAAA1J,EAAAovF,EAAA1lF,GAEAtI,EAAApB,GAAAsvF,EAAA5lF,GACAI,EAAA9J,GAAA8rF,EAIA,IAAA,IAAAzrF,EAAA,EAAAA,EAAAs3E,EAAAt3E,IAEA,IAAAsK,IAEAiwG,EAAAv6G,GAAA,IAIAyJ,EAAAzJ,KAAAyrF,EAEA8uB,EAAAv6G,GAAAsK,GAAA1E,EAAA00G,EAAAh5G,EAAAP,EAAAf,IAAAs6G,EAAAv5G,EAAAf,GAAAsB,GAGAi5G,EAAAv6G,GAAAsK,GAAA1E,EAAA00G,EAAAh5G,EAAA,GAAAg5G,EAAA,EAAAh5G,GAMA,OAAApB,8BClGA,aAEA,IAAA63D,EAAAr4D,EAAA,iCA6FAc,EAAA2I,KAAA,cACA3I,EAAA8vD,QA5FA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAuFA,OAvEA,SAAAz3D,EAAAkB,EAAA2e,GAEA,IA0BA61E,EA1BAC,EAAA31F,EAAAy6E,MACAuQ,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAEAlB,EAAA3oF,EAAAu5E,MACAwb,EAAA/0F,EAAAq5E,MACAqb,EAAA10F,EAAA6pF,UAEAgwB,EAAA,GAEA,GAAA/vB,EAAA1qF,SAAA21F,EAAA31F,OACA,MAAA,IAAAq3D,EAAAqzB,EAAA1qF,OAAA21F,EAAA31F,QAIA,IAAA,IAAAqK,EAAA,EAAAA,EAAAqgF,EAAA1qF,OAAAqK,IAAA,CAEA,GAAAqgF,EAAArgF,KAAAsrF,EAAAtrF,GACA,MAAA,IAAAotD,WAAA,iCAAAizB,EAAA,0BAAAiL,EAAA,KAIA8kB,EAAApwG,GAAAqgF,EAAArgF,GAMA,IAAAuvG,EAAAr6F,EAEA,iBAAA2vE,GAAAA,IAAAoG,IAEAF,EAAAlG,EAEA0qB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAIA,IAAAykB,EAAA,EAAAY,EAAAz6G,OAUA,SAAA06G,EAAAn7G,EAAA4vD,EAAA9kD,EAAAlL,EAAAw7G,EAAAC,GAEA,IAAAC,EAAA,GAEA,GAAA1rD,IAAA9kD,EAAArK,OAAA,EAEA,IAAA,IAAAV,EAAA,EAAAA,EAAAH,EAAAG,IAEAu7G,EAAAv7G,GAAAC,EAAAo7G,EAAAr7G,GAAAs7G,EAAAt7G,SAIA,IAAA,IAAAsK,EAAA,EAAAA,EAAAzK,EAAAyK,IAEAixG,EAAAjxG,GAAA8wG,EAAAn7G,EAAA4vD,EAAA,EAAA9kD,EAAAA,EAAA8kD,EAAA,GAAAwrD,EAAA/wG,GAAAgxG,EAAAhxG,IAIA,OAAAixG,EA5BAH,CAAAd,EAAA,EAAAa,EAAAA,EAAA,GAAAplB,EAAA9L,GAAA,GAEA,OAAA,IAAApyB,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAAkgF,EACAjwB,SAAA4K,kEClEA,aAEA,IAAA1vF,EAAA1G,EAAA,yBAAA0G,MA0EA5F,EAAA2I,KAAA,cACA3I,EAAA8vD,QAzEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA2E,EAAA5d,EAAA4d,YAoEA,OAnDA,SAAAz3D,EAAAkB,EAAA2e,EAAAra,GAEA,IAIAkwF,EAJAC,EAAA31F,EAAAy6E,MACAuQ,EAAAhrF,EAAAu6E,MACAiV,EAAAxvF,EAAA+qF,UAIAmvB,EAAAr6F,EAEA,iBAAA2vE,IAEAkG,EAAAlG,EAEAtuF,EAAA4xD,EAAA1nB,QAAAlqC,EAAAw0F,GAEAwkB,EAAApnD,EAAA3V,KAAAt9B,EAAA,CAAA61E,EAAAA,KAIA,IAAAykB,EAAA,EAAAnvB,EAAA1qF,OAUA,SAAA06G,EAAAn7G,EAAA4vD,EAAA9kD,EAAAlL,EAAAw7G,EAAAC,EAAA11G,GAEA,IAAA21G,EAAA,GAEA,GAAA1rD,IAAA9kD,EAAArK,OAAA,EAEA,IAAA,IAAAV,EAAA,EAAAA,EAAAH,EAAAG,IAEAu7G,EAAAv7G,GAAA4F,EAAA3F,EAAAq7G,EAAAD,EAAAr7G,IAAAC,EAAAo7G,EAAAr7G,GAAAs7G,QAIA,IAAA,IAAAhxG,EAAA,EAAAA,EAAAzK,EAAAyK,IAEAixG,EAAAjxG,GAAA8wG,EAAAn7G,EAAA4vD,EAAA,EAAA9kD,EAAAA,EAAA8kD,EAAA,GAAAwrD,EAAA/wG,GAAAgxG,EAAA11G,GAIA,OAAA21G,EA5BAH,CAAAd,EAAA,EAAAlvB,EAAAA,EAAA,GAAA2K,EAAAz0F,EAAAsE,GAAA,GAEA,OAAA,IAAAiyD,EAAA,CACAv1B,KAAAi4E,EACAt/E,KAAA70B,EAAAglF,GACAF,SAAA4K,2DC/CA,aAkDAt1F,EAAA8vD,QAhDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAAoB,EAAAd,EAAA9zD,EAAA,mCAmCA,OAjCA,SAAAylG,EAAA75E,GAMA,IALA,IAAAkwF,EAGAjQ,EAAA,EAEAvrG,EAAA,EAAAA,EAAAsrB,EAAA5qB,OAAAV,IAAA,CACA,IAAA0zD,EAAApoC,EAAAtrB,GACA0gC,EAAA3gB,MAAA2gB,QAAAgzB,GAOA,GALA,IAAA1zD,GAAA0gC,IACA6qE,EAAA73C,EAAAhzD,QAIAggC,GAAAgzB,EAAAhzD,SAAA6qG,EACA,OAGA,IAAAkQ,EAAA/6E,EAAAykE,EAAAzxC,GACAY,EAAAZ,GAEA,QAAAzxD,IAAAu5G,EACAA,EAAAC,OACA,GAAAD,IAAAC,EACA,MAAA,QAKA,OAAAD,kECnCA,aAEA,IAAA/3C,EAAA/jE,EAAA,iCAwEAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QAvEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAA5uB,EAAA4uB,EAAA,SAAA,CACA8Q,GAAA,WACA,OAAA,GAEA1/B,OAAA,SAAAvjC,GACA,OAAAA,GAEA+5B,OAAA,SAAA/5B,GACA,GAAA,QAAAA,EAAA,OAAA6F,IACA,IAAA+I,EAAAzN,OAAAnB,GAEA,GAAA2B,MAAAiN,GACA,MAAA,IAAAvO,YAAA,WAAAL,EAAA,wBAGA,OAAA4O,GAEAgoD,UAAA,SAAA52D,GACA,OAAAA,EAAAiR,YAEAyI,SAAA,SAAA1Z,GACA,OAAAA,EAAAyF,WAEAyoE,KAAA,SAAAluE,GACA,MAAA,IAAAV,MAAA,iDAEAk0E,KAAA,SAAAxzE,GACA,OAAA,GAEA26G,sBAAA,SAAAthD,EAAAuhD,GACA,OAAAvhD,EAAApoD,SAAA2pG,IAEAj4C,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAujC,MAQA,OALAA,EAAA0gC,MAAA,CACAmvC,EAAA,IACAxzG,EAAA,4BACA6xF,EAAA,sDAEAluD,gECvEA,aAsDA9jC,EAAA2oC,KAAA,OACA3oC,EAAA2I,KAAA,WACA3I,EAAA8vD,QAtDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GACA,IAAA4gC,EAAAtgC,EAAA9zD,EAAA,6BACAk8G,EAAA,CACA9gF,QAAA,EACAwJ,QAAA,EACAqzB,WAAA,EACAl9C,UAAA,GAGAohG,EAAA,CACAv3E,OAAAkvB,EAAA9zD,EAAA,aACAi4D,UAAAnE,EAAA9zD,EAAA,mCACA+a,SAAA+4C,EAAA9zD,EAAA,kCAYAgyE,EAAA,SAAA1qE,EAAA80G,GACA,IAAAC,EAAAjoB,EAAA9sF,GAEA,KAAA+0G,KAAAH,GACA,MAAA,IAAAr/E,UAAA,kBAAAv1B,EAAA,aAAA+0G,EAAA,4BAAAj1G,OAAAiT,KAAA6hG,GAAAtzF,KAAA,OAGA,KAAAwzF,KAAAD,GACA,MAAA,IAAAt/E,UAAA,kBAAAv1B,EAAA,aAAA80G,EAAA,6BAAAh1G,OAAAiT,KAAA8hG,GAAAvzF,KAAA,OAGA,OAAAwzF,IAAAC,EACA/0G,EAEA60G,EAAAC,GAAA90G,IASA,OALA0qE,EAAA1M,MAAA,SAAAT,EAAAnmB,GAEA,OAAAmmB,EAAA/vD,KAAA,GAAAwwD,SAGA0M,kJCjDA,aAwEAlxE,EAAA2I,KAAA,YACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QAxEA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAOA,SAAAgT,EAAApkC,GACA,KAAAl/B,gBAAAsjE,GACA,MAAA,IAAA9kE,YAAA,oDAGAwB,KAAAk/B,QAAAA,GAAA,GAuDA,OAhDAokC,EAAArjE,UAAAo3C,KAAA,YACAisB,EAAArjE,UAAAyzD,aAAA,EAOA4P,EAAArjE,UAAA2D,QAAA,WACA,OAAA5D,KAAAk/B,SASAokC,EAAArjE,UAAAwD,SAAA,WACA,MAAA,IAAAzD,KAAAk/B,QAAAxZ,KAAA,MAAA,KAUA49C,EAAArjE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,YACAr3B,QAAAl/B,KAAAk/B,UAYAokC,EAAA9M,SAAA,SAAA1D,GACA,OAAA,IAAAwQ,EAAAxQ,EAAA5zB,UAGAokC,6BCrEA,aAEAtlE,EAAAJ,QAAA,CACAd,EAAA,2DCHA,aAEA,IAAA+jE,EAAA/jE,EAAA,iCAEA4kC,EAAA5kC,EAAA,mBAwDAc,EAAA2I,KAAA,SACA3I,EAAA8vD,QAvDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GA0BA,IAAAp4B,EAAAo4B,EAAA,SAAA,CACA8Q,GAAA,WACA,MAAA,IAEA1/B,OAAAA,EAAA20B,OACAsb,KAAA,SAAAxzE,GACA,MAAA,QAEAi3F,QAAA,SAAAj3F,GACA,OAAAA,EAAA,IAEA+5B,OAAA,SAAA/5B,GACA,OAAAA,GAEA2iE,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAA+5B,IAEA+oC,IAAA,SAAA9iE,GACA,OAAAgU,OAAAhU,MAOA,OAJA+5B,EAAAkqC,MAAA,CACAmvC,EAAA,eACAxzG,EAAA,6CAEAm6B,sFCzDA,aAEA,SAAAw5B,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,SAAAsC,IAAA,OAAAA,EAAAhR,OAAAiR,QAAA,SAAAC,GAAA,IAAA,IAAAhY,EAAA,EAAAA,EAAA+V,UAAArV,OAAAV,IAAA,CAAA,IAAAiY,EAAAlC,UAAA/V,GAAA,IAAA,IAAAkY,KAAAD,EAAAnR,OAAAjE,UAAAyU,eAAA7W,KAAAwX,EAAAC,KAAAF,EAAAE,GAAAD,EAAAC,IAAA,OAAAF,IAAAsC,MAAA1X,KAAAmT,WAEA,IAAAizC,EAAAtpD,EAAA,sBAAAspD,SAEA5iD,EAAA1G,EAAA,sBAAA0G,MAEA41G,EAAAt8G,EAAA,mCAo1HAc,EAAA2I,KAAA,OACA3I,EAAA2oC,KAAA,OACA3oC,EAAA8vD,QAp1HA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GACA,IAkFAkpD,EAAA9hG,EAAAja,EAlFA6C,EAAAywD,EAAA9zD,EAAA,wCACAqT,EAAAygD,EAAA9zD,EAAA,uCACAqkD,EAAAyP,EAAA9zD,EAAA,6CACAgN,EAAA8mD,EAAA9zD,EAAA,2CACA0D,EAAAowD,EAAA9zD,EAAA,kCACA8B,EAAAgyD,EAAA9zD,EAAA,kCACAi/D,EAAAnL,EAAA9zD,EAAA,kCACAwG,EAAAstD,EAAA9zD,EAAA,oCACAqvE,EAAAvb,EAAA9zD,EAAA,oCACA4jE,EAAA9P,EAAA9zD,EAAA,mCACAu5D,EAAAzF,EAAA9zD,EAAA,iCACAo0F,EAAAtgC,EAAA9zD,EAAA,gCACAsS,EAAAwhD,EAAA9zD,EAAA,sBACA0C,EAAAoxD,EAAA9zD,EAAA,+BAqBA,SAAAuvE,EAAAjoE,EAAAmC,GACA,KAAAvG,gBAAAqsE,GACA,MAAA,IAAA5uE,MAAA,oDAGA,GAAA2G,MAAAA,IAAAs8D,EAAAt8D,KAAAizC,EAAA4b,UAAA7uD,GACA,MAAA,IAAAu1B,UAAA,kGAGA,QAAAt6B,IAAAkH,IAAA,iBAAAA,GAAA,KAAAA,GACA,MAAA,IAAAozB,UAAA,yDAGA,QAAAt6B,IAAAkH,EAAA,CACA,IAAAhJ,EAAA8uE,EAAAptE,MAAAsH,GACAvG,KAAAs5G,MAAA/7G,EAAA+7G,MACAt5G,KAAAinE,WAAA1pE,EAAA0pE,eACA,CACAjnE,KAAAs5G,MAAA,CAAA,CACA9hD,KAAA+hD,EACAtuD,OAAAuuD,EAAAC,KAEAC,MAAA,IAEA15G,KAAAinE,WAAA,GAEA,IAAA,IAAA7pE,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IACA4C,KAAAinE,WAAA7pE,GAAA,EAIA4C,KAAAoE,MAAAA,MAAAA,EAAApE,KAAAoxF,WAAAhtF,GAAA,KACApE,KAAAmwF,WAAA,EAMAnwF,KAAA45G,6BAAA,EAYA,SAAAC,IACA,KAAA,MAAAv8G,GAAA,OAAAA,GACAugD,IAQA,SAAA+0B,EAAAt1E,GACA,MAAA,KAAAA,GAAAA,GAAA,IAGA,SAAAugD,IACAtmC,IACAja,EAAA+7G,EAAAtxG,OAAAwP,GAGA,SAAAuiG,EAAAC,GACAxiG,EAAAwiG,EACAz8G,EAAA+7G,EAAAtxG,OAAAwP,GAGA,SAAAw9D,IACA,IACAglC,EADAr4E,EAAA,GAWA,GATAq4E,EAAAxiG,EAEA,MAAAja,EACAugD,IACA,MAAAvgD,IACAokC,GAAApkC,EACAugD,MA3BA,SAAAvgD,GACA,MAAA,KAAAA,GAAAA,GAAA,KAAA,MAAAA,EA6BAq1E,CAAAr1E,GAGA,OADAw8G,EAAAC,GACA,KAIA,GAAA,MAAAz8G,GAIA,GAHAokC,GAAApkC,EACAugD,KAEA+0B,EAAAt1E,GAGA,OADAw8G,EAAAC,GACA,SAEA,CACA,KAAAnnC,EAAAt1E,IACAokC,GAAApkC,EACAugD,IAGA,MAAAvgD,IACAokC,GAAApkC,EACAugD,KAIA,KAAA+0B,EAAAt1E,IACAokC,GAAApkC,EACAugD,IAIA,GAAA,MAAAvgD,GAAA,MAAAA,EAAA,CAEA,IAAA08G,EAAA,GACAC,EAAA1iG,EAUA,GATAyiG,GAAA18G,EACAugD,IAEA,MAAAvgD,GAAA,MAAAA,IACA08G,GAAA18G,EACAugD,MAIA+0B,EAAAt1E,GAGA,OADAw8G,EAAAG,GACAv4E,EAMA,IAFAA,GAAAs4E,EAEApnC,EAAAt1E,IACAokC,GAAApkC,EACAugD,IAIA,OAAAnc,EAGA,SAAAw4E,IAKA,IAJA,IAAAC,EAAA,GAEAz8G,EAAA27G,EAAA7mG,WAAA+E,GAEA,IAAA7Z,GAAAA,GAAA,IAAA,IAAAA,GAAAA,GAAA,IAAA,IAAAA,GAAAA,GAAA,KACAy8G,GAAA78G,EACAugD,IACAngD,EAAA27G,EAAA7mG,WAAA+E,GAMA,OAAA,KAFA7Z,EAAAy8G,EAAA3nG,WAAA,KAEA9U,GAAA,IAAA,IAAAA,GAAAA,GAAA,MACAy8G,GAEA,KAIA,SAAAC,EAAAC,GACA,OAAA/8G,IAAA+8G,GACAx8D,IACAw8D,GAEA,KAkVA,SAAAC,EAAA1zG,GAEA,GAAA2zG,EAAA7lG,eAAA9N,GAAA,CACA,IAAA4wD,EAAA+iD,EAAA3zG,GAEA,MAAA,CACA4wD,KAAAA,EACAvM,OAHAuM,EAAAgjD,SAAA,KAOA,IAAA,IAAAj0G,KAAAg0G,EACA,GAAAA,EAAA7lG,eAAAnO,IACA6/C,EAAAx/C,EAAAL,GAAA,CACA,IAAAk0G,EAAAF,EAAAh0G,GACAm0G,EAAA9zG,EAAA9I,OAAAyI,EAAAzI,OACA68G,EAAA/zG,EAAA2L,UAAA,EAAAmoG,GAEAE,EAAAH,EAAAD,SAAA9lG,eAAAimG,GAAAF,EAAAD,SAAAG,QAAAt7G,EAEA,QAAAA,IAAAu7G,EAEA,MAAA,CACApjD,KAAAijD,EACAxvD,OAAA2vD,GAOA,OAAA,KAiMA,SAAAC,EAAArjD,GACA,OAAAA,EAAA04B,UAAAqgB,EAAAkJ,OAAA,OAAAjiD,EAAApzD,QAAAuO,EAAA+9C,YACA8G,EAAApzD,MAEAozD,EA1rBA6U,EAAApsE,UAAAo3C,KAAA,OACAg1B,EAAApsE,UAAA+yD,QAAA,EAkJAqZ,EAAAptE,MAAA,SAAA2H,EAAA40C,GAMA,GALAA,EAAAA,GAAA,GAEAjkC,GAAA,EACAja,EAAA,GAEA,iBAJA+7G,EAAAzyG,GAKA,MAAA,IAAA+yB,UAAA,mDAGA,IAAA69B,EAAA,IAAA6U,EAEAyuC,EAAA,EACAC,IAFAvjD,EAAA8hD,MAAA,IAeAz7D,IACAg8D,IAEA,IAAAmB,EAAAjmC,IACA3wE,EAAA,KAEA42G,IAEA52G,EADA,cAAAuO,EAAA+uB,OACA,IAAA2V,EAAA0d,UAAAimD,GACA,aAAAroG,EAAA+uB,OACA,IAAA2V,EAAAx/B,SAAAmjG,GAGAj7G,WAAAi7G,GAGAnB,IAGAO,EAAA,MACAU,EAAA,EACAC,GAAA,GACAX,EAAA,OACAU,GAAA,EACAC,GAAA,IASA,IAJA,IAAAE,EAAA,GAEAC,EAAA,IAEA,CAIA,IAHArB,IAGA,MAAAv8G,GACA29G,EAAA7tG,KAAA0tG,GACAI,GAAAJ,EACAA,EAAA,EACAj9D,IACAg8D,IAIA,IAAAsB,OAAA,EAEA,IAAA79G,EASA,MARA,IAAA89G,EAAA99G,EAGA,GAAA,QAFA69G,EAAAjB,KAGA,MAAA,IAAA17G,YAAA,eAAA48G,EAAA,SAAA/B,EAAA,cAAA9hG,EAAA9T,YAQA,IAAAnB,EAAAg4G,EAAAa,GAEA,GAAA,OAAA74G,EAEA,MAAA,IAAA9D,YAAA,SAAA28G,EAAA,gBAGA,IAAAzB,EAAAoB,EAAAI,EAIA,GAFArB,IAEAO,EAAA,KAAA,CACAP,IACA,IAAAl8G,EAAAo3E,IAEA,GAAA,OAAAp3E,EAEA,MAAA,IAAAa,YAAA,OAAAoI,EAAA,sDAGA8yG,GAAA/7G,EAIA65D,EAAA8hD,MAAAlsG,KAAA,CACAoqD,KAAAl1D,EAAAk1D,KACAvM,OAAA3oD,EAAA2oD,OACAyuD,MAAAA,IAGA,IAAA,IAAAt8G,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IACAo6D,EAAAyP,WAAA7pE,KAAAkF,EAAAk1D,KAAAyP,WAAA7pE,IAAA,GAAAs8G,EAOA,IAFAG,IAEA,MAAAv8G,GAAA,CACA,GAAA,IAAA29G,EAAAn9G,OACA,MAAA,IAAAU,YAAA,qBAAA66G,EAAA,cAAA9hG,EAAA9T,YAGAy3G,GAAAD,EAAA5tG,MACAwwC,IACAg8D,IAqBA,GAhBAkB,GAAA,EAEAX,EAAA,MAEAU,EAAA,EACAC,GAAA,GACAX,EAAA,MAEAU,GAAA,EACAC,GAAA,GAGAD,EAAA,EAIAx4G,EAAAk1D,KAAA7qD,KAAA,CACA,IAAA0uG,EAAA/4G,EAAAk1D,KAAA7qD,KAAA2I,IACAgmG,EAAAC,KAAAF,GAAA,CACA7jD,KAAAl1D,EAAAk1D,KACAvM,OAAA3oD,EAAA2oD,SAQA,GAFA4uD,IAEAv8G,EACA,MAAA,IAAAkB,YAAA,qBAAAoI,EAAA,KAIA,GAAAm0G,EACA,MAAA,IAAAv8G,YAAA,yBAAAoI,EAAA,KAIA,GAAA,IAAAq0G,EAAAn9G,OACA,MAAA,IAAAU,YAAA,qBAAA66G,EAAA,KAIA,GAAA,IAAA7hD,EAAA8hD,MAAAx7G,SAAA09C,EAAAggE,aACA,MAAA,IAAAh9G,YAAA,IAAAoI,EAAA,uBAIA,OADA4wD,EAAApzD,WAAA/E,IAAA+E,EAAAozD,EAAA45B,WAAAhtF,GAAA,KACAozD,GASA6U,EAAApsE,UAAAuD,MAAA,WACA,IAAAg0D,EAAA,IAAA6U,EACA7U,EAAA24B,UAAAnwF,KAAAmwF,UACA34B,EAAAoiD,4BAAA55G,KAAA45G,4BACApiD,EAAApzD,MAAAZ,EAAAxD,KAAAoE,OACAozD,EAAAyP,WAAAjnE,KAAAinE,WAAAp9D,MAAA,GACA2tD,EAAA8hD,MAAA,GAEA,IAAA,IAAAl8G,EAAA,EAAAA,EAAA4C,KAAAs5G,MAAAx7G,OAAAV,IAGA,IAAA,IAAAO,KAFA65D,EAAA8hD,MAAAl8G,GAAA,GAEA4C,KAAAs5G,MAAAl8G,GACA4C,KAAAs5G,MAAAl8G,GAAAsX,eAAA/W,KACA65D,EAAA8hD,MAAAl8G,GAAAO,GAAAqC,KAAAs5G,MAAAl8G,GAAAO,IAKA,OAAA65D,GASA6U,EAAApsE,UAAAw7G,WAAA,WACA,OAAA,IAAAz7G,KAAAs5G,MAAAx7G,SAIA,EAAAkC,KAAAs5G,MAAAx7G,QAAA,MAAAM,KAAAQ,IAAAoB,KAAAs5G,MAAA,GAAAI,MAAA,KAWArtC,EAAApsE,UAAAmxF,WAAA,SAAAhtF,GACA,IAAAs3G,EAAAC,EAAAC,EAAAC,EACAjzE,EAEA,GAAAxkC,MAAAA,GAAA,IAAApE,KAAAs5G,MAAAx7G,OACA,OAAAsG,EACA,GAAApE,KAAAy7G,aAAA,CAGA,IAAAn5G,EAAA8B,EACAwkC,EAAAyjC,EAAAyvC,oBAAA5qB,EAAA9sF,IAEA,IAAA,IAAAhH,EAAA,EAAAA,EAAA4C,KAAAs5G,MAAAx7G,OAAAV,IACAs+G,EAAA9yE,EAAA5oC,KAAAs5G,MAAAl8G,GAAAo6D,KAAApzD,OACAy3G,EAAAjzE,EAAA5oC,KAAAs5G,MAAAl8G,GAAA6tD,OAAA7mD,OACAw3G,EAAAhzE,EAAA5oC,KAAAs5G,MAAAl8G,GAAAs8G,OACAp3G,EAAA6+C,EAAA7+C,EAAA9B,EAAA2gD,EAAAu6D,EAAAG,GAAAD,IAGA,OAAAt5G,EAQA,OAHAo5G,GAFA9yE,EAAAyjC,EAAAyvC,oBAAA5qB,EAAA9sF,KAEApE,KAAAs5G,MAAA,GAAA9hD,KAAApzD,OACAu3G,EAAA/yE,EAAA5oC,KAAAs5G,MAAA,GAAA9hD,KAAA7tC,QACAkyF,EAAAjzE,EAAA5oC,KAAAs5G,MAAA,GAAAruD,OAAA7mD,OACA+8C,EAAAhhD,EAAAiE,EAAAu3G,GAAAx6D,EAAAu6D,EAAAG,KAaAxvC,EAAApsE,UAAA87G,aAAA,SAAA33G,EAAA43G,GACA,IAAAN,EAAAC,EAAAC,EAAAC,EACAjzE,EAEA,GAAAxkC,MAAAA,GAAA,IAAApE,KAAAs5G,MAAAx7G,OACA,OAAAsG,EACA,GAAApE,KAAAy7G,aAAA,CAIA,IAAAn5G,EAAA8B,EACAwkC,EAAAyjC,EAAAyvC,oBAAA5qB,EAAA9sF,IAEA,IAAA,IAAAhH,EAAA,EAAAA,EAAA4C,KAAAs5G,MAAAx7G,OAAAV,IACAs+G,EAAA9yE,EAAA5oC,KAAAs5G,MAAAl8G,GAAAo6D,KAAApzD,OACAy3G,EAAAjzE,EAAA5oC,KAAAs5G,MAAAl8G,GAAA6tD,OAAA7mD,OACAw3G,EAAAhzE,EAAA5oC,KAAAs5G,MAAAl8G,GAAAs8G,OACAp3G,EAAAwH,EAAAxH,EAAA9B,EAAA2gD,EAAAu6D,EAAAG,GAAAD,IAGA,OAAAt5G,EASA,OAJAo5G,GAFA9yE,EAAAyjC,EAAAyvC,oBAAA5qB,EAAA9sF,KAEApE,KAAAs5G,MAAA,GAAA9hD,KAAApzD,OACAy3G,EAAAjzE,EAAA5oC,KAAAs5G,MAAA,GAAAruD,OAAA7mD,OACAu3G,EAAA/yE,EAAA5oC,KAAAs5G,MAAA,GAAA9hD,KAAA7tC,QAGAxZ,EAAArG,EAAAA,EAAA1F,EAAAs3G,GADAM,MAAAA,EACAH,EAEAG,GAFAL,IA2DAtvC,EAAAD,gBAAA,SAAA7lE,GACA,OAAA,OAAA+zG,EAAA/zG,IAUA8lE,EAAApsE,UAAAqwG,QAAA,SAAA3jG,GAKA,GAJA,iBAAAA,IACAA,EAAA4jG,EAAA5jG,KAGAA,EACA,OAAA,EAIA,IAAA,IAAAvP,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IACA,GAAA,MAAAgB,KAAAQ,KAAAoB,KAAAinE,WAAA7pE,IAAA,IAAAuP,EAAAs6D,WAAA7pE,IAAA,IACA,OAAA,EAIA,OAAA,GAWAivE,EAAApsE,UAAAiwF,UAAA,SAAA/oD,GAEA,IAAA,IAAA/pC,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IACA,GAAA,MAAAgB,KAAAQ,KAAAoB,KAAAinE,WAAA7pE,IAAA,IAAA+pC,EAAA8/B,WAAA7pE,IAAA,IACA,OAAA,EAIA,OAAA,GAUAivE,EAAApsE,UAAAsD,OAAA,SAAA4jC,GACA,OAAAnnC,KAAAkwF,UAAA/oD,IAAAglC,EAAAnsE,KAAAoE,MAAA+iC,EAAA/iC,QAUAioE,EAAApsE,UAAAkhD,SAAA,SAAAha,GAGA,IAFA,IAAA7kC,EAAAtC,KAAAwD,QAEApG,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IAEAkF,EAAA2kE,WAAA7pE,IAAA4C,KAAAinE,WAAA7pE,IAAA,IAAA+pC,EAAA8/B,WAAA7pE,IAAA,GAIA,IAAA,IAAAmkF,EAAA,EAAAA,EAAAp6C,EAAAmyE,MAAAx7G,OAAAyjF,IAAA,CAEA,IAAA06B,EAAA,GAEA,IAAA,IAAA3mG,KAAA6xB,EAAAmyE,MAAA/3B,GACA06B,EAAA3mG,GAAA6xB,EAAAmyE,MAAA/3B,GAAAjsE,GAGAhT,EAAAg3G,MAAAlsG,KAAA6uG,GAIA,GAAA,OAAAj8G,KAAAoE,OAAA,OAAA+iC,EAAA/iC,MAAA,CACA,IAAA83G,EAAA,OAAAl8G,KAAAoE,MAAApE,KAAAoxF,WAAA,GAAApxF,KAAAoE,MACA+3G,EAAA,OAAAh1E,EAAA/iC,MAAA+iC,EAAAiqD,WAAA,GAAAjqD,EAAA/iC,MACA9B,EAAA8B,MAAA+8C,EAAA+6D,EAAAC,QAEA75G,EAAA8B,MAAA,KAIA,OADA9B,EAAAs3G,6BAAA,EACAiB,EAAAv4G,IAUA+pE,EAAApsE,UAAA6J,OAAA,SAAAq9B,GAGA,IAFA,IAAA7kC,EAAAtC,KAAAwD,QAEApG,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IAEAkF,EAAA2kE,WAAA7pE,IAAA4C,KAAAinE,WAAA7pE,IAAA,IAAA+pC,EAAA8/B,WAAA7pE,IAAA,GAIA,IAAA,IAAAqkF,EAAA,EAAAA,EAAAt6C,EAAAmyE,MAAAx7G,OAAA2jF,IAAA,CAEA,IAAAw6B,EAAA,GAEA,IAAA,IAAA3mG,KAAA6xB,EAAAmyE,MAAA73B,GACAw6B,EAAA3mG,GAAA6xB,EAAAmyE,MAAA73B,GAAAnsE,GAGA2mG,EAAAvC,OAAAuC,EAAAvC,MACAp3G,EAAAg3G,MAAAlsG,KAAA6uG,GAIA,GAAA,OAAAj8G,KAAAoE,OAAA,OAAA+iC,EAAA/iC,MAAA,CACA,IAAA83G,EAAA,OAAAl8G,KAAAoE,MAAApE,KAAAoxF,WAAA,GAAApxF,KAAAoE,MACA+3G,EAAA,OAAAh1E,EAAA/iC,MAAA+iC,EAAAiqD,WAAA,GAAAjqD,EAAA/iC,MACA9B,EAAA8B,MAAA0F,EAAAoyG,EAAAC,QAEA75G,EAAA8B,MAAA,KAIA,OADA9B,EAAAs3G,6BAAA,EACAiB,EAAAv4G,IAUA+pE,EAAApsE,UAAAO,IAAA,SAAA7C,GAGA,IAFA,IAAA2E,EAAAtC,KAAAwD,QAEApG,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IAEAkF,EAAA2kE,WAAA7pE,IAAA4C,KAAAinE,WAAA7pE,IAAA,GAAAO,EAIA,IAAA,IAAAgxG,EAAA,EAAAA,EAAArsG,EAAAg3G,MAAAx7G,OAAA6wG,IACArsG,EAAAg3G,MAAA3K,GAAA+K,OAAA/7G,EAcA,OAXA,OAAA2E,EAAA8B,MACA9B,EAAA8B,MAAA5D,EAAA8B,EAAA8B,MAAAzG,GAMA2E,EAAA8B,MAAA,KAGA9B,EAAAs3G,6BAAA,EACAiB,EAAAv4G,IAwBA+pE,EAAApsE,UAAArB,IAAA,WAGA,IAAA8E,EAAA1D,KAAAwD,QAGA,IAAA,IAAApG,KAFAsG,EAAAU,MAAA,OAAAV,EAAAU,MAAAxF,EAAA8E,EAAAU,OAAA,KAEAV,EAAA41G,MACA,OAAA51G,EAAA41G,MAAAl8G,GAAAo6D,KAAAjxD,MAAA,QAAA7C,EAAA41G,MAAAl8G,GAAAo6D,KAAAjxD,OACA7C,EAAA41G,MAAAl8G,GAAAo6D,KAAA+iD,EAAA,GAIA,OAAA72G,GAUA2oE,EAAApsE,UAAA60D,GAAA,SAAAikD,GACA,IAAA5xE,EACA/iC,EAAA,OAAApE,KAAAoE,MAAApE,KAAAoxF,WAAA,GAAApxF,KAAAoE,MAEA,GAAA,iBAAA20G,EAAA,CAIA,GAFA5xE,EAAAklC,EAAAptE,MAAA85G,IAEA/4G,KAAAkwF,UAAA/oD,GACA,MAAA,IAAA1pC,MAAA,wBAAAmkD,OAAAza,EAAA1jC,WAAA,UAAAm+C,OAAA5hD,KAAAyD,WAAA,OAGA,GAAA,OAAA0jC,EAAA/iC,MACA,MAAA,IAAA3G,MAAA,yCAMA,OAHA0pC,EAAA/iC,MAAAZ,EAAAY,GACA+iC,EAAAgpD,WAAA,EACAhpD,EAAAyyE,6BAAA,EACAzyE,EACA,GAAAkQ,EAAA2b,OAAA+lD,GAAA,CACA,IAAA/4G,KAAAkwF,UAAA6oB,GACA,MAAA,IAAAt7G,MAAA,wBAAAmkD,OAAAm3D,EAAAt1G,WAAA,UAAAm+C,OAAA5hD,KAAAyD,WAAA,OAGA,GAAA,OAAAs1G,EAAA30G,MACA,MAAA,IAAA3G,MAAA,yCAOA,OAJA0pC,EAAA4xE,EAAAv1G,SACAY,MAAAZ,EAAAY,GACA+iC,EAAAgpD,WAAA,EACAhpD,EAAAyyE,6BAAA,EACAzyE,EAEA,MAAA,IAAA1pC,MAAA,yCAYA4uE,EAAApsE,UAAAmP,SAAA,SAAA2pG,GACA,OAAA3pG,EAAApP,KAAAo8G,UAAArD,KAUA1sC,EAAApsE,UAAAm8G,UAAA,SAAArD,GACA,IAAA5xE,EASA,OALAA,EAFA4xE,EAEA/4G,KAAA80D,GAAAikD,GAEA/4G,KAAAwD,SAGAi4G,aACAt0E,EAAA40E,aAAA50E,EAAA/iC,OAEA+iC,EAAA40E,aAAA50E,EAAA/iC,MAAA+iC,EAAAmyE,MAAA,GAAAruD,OAAA7mD,QAUAioE,EAAApsE,UAAAwD,SAAA,WACA,OAAAzD,KAAAq2D,UAUAgW,EAAApsE,UAAA6P,OAAA,WACA,MAAA,CACAymD,OAAA,OACAnyD,MAAApE,KAAA+7G,aAAA/7G,KAAAoE,OACAozD,KAAAx3D,KAAAirG,cACA9a,UAAAnwF,KAAAmwF,YAYA9jB,EAAA7V,SAAA,SAAA1D,GACA,IAAA0E,EAAA,IAAA6U,EAAAvZ,EAAA1uD,MAAA0uD,EAAA0E,MAEA,OADAA,EAAA24B,UAAAr9B,EAAAq9B,YAAA,EACA34B,GASA6U,EAAApsE,UAAA2D,QAAAyoE,EAAApsE,UAAAwD,SAMA4oE,EAAApsE,UAAAyY,SAAA,WACA,IAGA2jG,EAYAC,EAfA54G,EAAA1D,KAAAwD,QACA+4G,EAAA,GAIA,IAAA,IAAAjnG,KAAAknG,EACA,GAAA94G,EAAA4sG,QAAAC,EAAAj7F,IAAA,CACA+mG,EAAA/mG,EACA,MAIA,GAAA,SAAA+mG,EACA34G,EAAA41G,MAAA,QAWA,GAPA+C,GAEAG,EAAA9nG,eAAA2nG,KACAC,EAAAE,EAAAH,IAIAC,EACA54G,EAAA41G,MAAA,CAAA,CACA9hD,KAAA8kD,EAAA9kD,KACAvM,OAAAqxD,EAAArxD,OACAyuD,MAAA,QAEA,CAMA,IAFA,IAAA+C,GAAA,EAEAr/G,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IAAA,CACA,IAAAi+G,EAAA1B,EAAAv8G,GAEA,MAAAgB,KAAAQ,IAAA8E,EAAAujE,WAAA7pE,IAAA,KACAo/G,EAAA9nG,eAAA2mG,GACAkB,EAAAnvG,KAAA,CACAoqD,KAAAglD,EAAAnB,GAAA7jD,KACAvM,OAAAuxD,EAAAnB,GAAApwD,OACAyuD,MAAAh2G,EAAAujE,WAAA7pE,IAAA,IAGAq/G,GAAA,GAMAF,EAAAz+G,OAAA4F,EAAA41G,MAAAx7G,SAAA2+G,IAEA/4G,EAAA41G,MAAAiD,GAKA,OAAA74G,GAOA2oE,EAAApsE,UAAAy8G,KAAA,WAMA,IALA,IAAAh5G,EAAA1D,KAAAwD,QACA+4G,EAAA,GAIAn/G,EAAA,EAAAA,EAAAu8G,EAAA77G,OAAAV,IAAA,CACA,IAAAi+G,EAAA1B,EAAAv8G,GAEA,GAAA,MAAAgB,KAAAQ,IAAA8E,EAAAujE,WAAA7pE,IAAA,GAAA,CACA,IAAAk+G,EAAA,GAAA5mG,eAAA2mG,GAOA,MAAA,IAAA59G,MAAA,8BAAA49G,EAAA,gBANAkB,EAAAnvG,KAAA,CACAoqD,KAAA8jD,EAAA,GAAAD,GAAA7jD,KACAvM,OAAAqwD,EAAA,GAAAD,GAAApwD,OACAyuD,MAAAh2G,EAAAujE,WAAA7pE,IAAA,KAYA,OAHAsG,EAAA41G,MAAAiD,EACA74G,EAAAysF,WAAA,EACAzsF,EAAAk2G,6BAAA,EACAl2G,GASA2oE,EAAApsE,UAAAgrG,YAAA,WAMA,IALA,IAAA0R,EAAA,GACAC,EAAA,GACAC,EAAA,EACAC,EAAA,EAEA1/G,EAAA,EAAAA,EAAA4C,KAAAs5G,MAAAx7G,OAAAV,IACA,EAAA4C,KAAAs5G,MAAAl8G,GAAAs8G,OACAmD,IACAF,GAAA,IAAA38G,KAAAs5G,MAAAl8G,GAAA6tD,OAAA1kD,KAAAvG,KAAAs5G,MAAAl8G,GAAAo6D,KAAAjxD,KAEA,MAAAnI,KAAAQ,IAAAoB,KAAAs5G,MAAAl8G,GAAAs8G,MAAA,KACAiD,GAAA,IAAA38G,KAAAs5G,MAAAl8G,GAAAs8G,QAEA15G,KAAAs5G,MAAAl8G,GAAAs8G,MAAA,GACAoD,IAIA,GAAA,EAAAA,EACA,IAAA,IAAA/F,EAAA,EAAAA,EAAA/2G,KAAAs5G,MAAAx7G,OAAAi5G,IACA/2G,KAAAs5G,MAAAvC,GAAA2C,MAAA,IACA,EAAAmD,GACAD,GAAA,IAAA58G,KAAAs5G,MAAAvC,GAAA9rD,OAAA1kD,KAAAvG,KAAAs5G,MAAAvC,GAAAv/C,KAAAjxD,KAEA,MAAAnI,KAAAQ,IAAAoB,KAAAs5G,MAAAvC,GAAA2C,MAAA,KACAkD,GAAA,KAAA58G,KAAAs5G,MAAAvC,GAAA2C,SAGAkD,GAAA,IAAA58G,KAAAs5G,MAAAvC,GAAA9rD,OAAA1kD,KAAAvG,KAAAs5G,MAAAvC,GAAAv/C,KAAAjxD,KACAq2G,GAAA,IAAA58G,KAAAs5G,MAAAvC,GAAA2C,QAOAiD,EAAAA,EAAA5qC,OAAA,GACA6qC,EAAAA,EAAA7qC,OAAA,GAEA,EAAA8qC,GAAA,EAAAC,IACAH,EAAA,IAAAA,EAAA,KAGA,EAAAG,GAAA,EAAAD,IACAD,EAAA,IAAAA,EAAA,KAGA,IAAAh2G,EAAA+1G,EAOA,OALA,EAAAE,GAAA,EAAAC,IACAl2G,GAAA,OAGAA,GAAAg2G,GAcAvwC,EAAApsE,UAAAo2D,OAAA,SAAA7a,GAGA,IAAAuhE,EAAA/8G,KAAA45G,6BAAA,OAAA55G,KAAAoE,MAAApE,KAAAwD,QAAAxD,KAAA0Y,WAEAskG,GAAA,EAOA,IAAA,IAAA5/G,UALA,IAAA2/G,EAAA34G,OAAA,OAAA24G,EAAA34G,OAAAizC,EAAA4b,UAAA8pD,EAAA34G,SAEA44G,EAAA5+G,KAAAQ,IAAAm+G,EAAA34G,MAAAjF,IAAA,OAGA49G,EAAAzD,MACAyD,EAAAzD,MAAAl8G,GAAAo6D,OACA,OAAAulD,EAAAzD,MAAAl8G,GAAAo6D,KAAAjxD,MAAAy2G,EACAD,EAAAzD,MAAAl8G,GAAAo6D,KAAA+iD,EAAA,IACA,QAAAwC,EAAAzD,MAAAl8G,GAAAo6D,KAAAjxD,MAAAy2G,IACAD,EAAAzD,MAAAl8G,GAAAo6D,KAAA+iD,EAAA,KAOA,IAAAwC,EAAAzD,MAAAx7G,QAAAi/G,EAAA5sB,WAGA/xF,KAAAQ,IAAAm+G,EAAAzD,MAAA,GAAAI,MAAAt7G,KAAAkF,MAAAy5G,EAAAzD,MAAA,GAAAI,QAAA,QAEAqD,EAAAzD,MAAA,GAAAruD,OAAA8xD,EAAAE,eAIA,IAAA74G,EAAA24G,EAAAhB,aAAAgB,EAAA34G,OAEAwC,EAAA,OAAAm2G,EAAA34G,MAAAiyD,EAAAjyD,EAAAo3C,GAAA,IAAA,GACA0hE,EAAAH,EAAA9R,cAWA,OATA8R,EAAA34G,OAAAizC,EAAA4b,UAAA8pD,EAAA34G,SACAwC,EAAA,IAAAA,EAAA,KAGA,EAAAs2G,EAAAp/G,QAAA,EAAA8I,EAAA9I,SACA8I,GAAA,KAGAA,GAAAs2G,GAWA7wC,EAAApsE,UAAAg9G,YAAA,WACA,GAAA,IAAAj9G,KAAAs5G,MAAAx7G,OACA,MAAA,IAAAL,MAAA,4GAGA,GAAA,OAAAW,KAAAQ,IAAAoB,KAAAs5G,MAAA,GAAAI,MAAAt7G,KAAAkF,MAAAtD,KAAAs5G,MAAA,GAAAI,QACA,MAAA,IAAAj8G,MAAA,4GAUA,IAAA0/G,EAAA,OAAAn9G,KAAAoE,MAAAxF,EAAAoB,KAAAoE,OAAA,EACAg5G,EAAAx+G,EAAAoB,KAAAs5G,MAAA,GAAA9hD,KAAApzD,OACAi5G,EAAAr9G,KAAAs5G,MAAA,GAAAruD,OAEA,GAAA,IAAAkyD,EACA,OAAAE,EAGA,IAAA3D,EAAA15G,KAAAs5G,MAAA,GAAAI,MACA4D,EAAAl/G,KAAAU,IAAAq+G,EAAA/+G,KAAAoC,IAAA68G,EAAAj5G,MAAAg5G,EAAA1D,IAAAt7G,KAAAyG,KAAA,IACA,IAAA,SAAAy4G,GAAAA,EAAA,SAAA,OAAAD,EAEAC,EAAAl/G,KAAAQ,IAAA0+G,GACA,IAAA9C,EAAAx6G,KAAAs5G,MAAA,GAAA9hD,KAAAgjD,SAEA,IAAA,IAAA78G,KAAA68G,EACA,GAAAA,EAAA9lG,eAAA/W,GAAA,CACA,IAAAstD,EAAAuvD,EAAA78G,GAEA,GAAAstD,EAAAsyD,WAAA,CACA,IAAA1N,EAAAzxG,KAAAQ,IAAAR,KAAAU,IAAAq+G,EAAA/+G,KAAAoC,IAAAyqD,EAAA7mD,MAAAg5G,EAAA1D,IAAAt7G,KAAAyG,KAAA,MAEAgrG,EAAAyN,GAAAzN,IAAAyN,GAAAryD,EAAA1kD,KAAAzI,OAAAu/G,EAAA92G,KAAAzI,UAGAu/G,EAAApyD,EACAqyD,EAAAzN,IAMA,OAAAwN,GA8DA,IAAA7D,EAAA,CACAC,KAAA,CACAr4C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,IAGAC,MAAA,CACAp8C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAE,GAAA,CACAl3G,KAAA,KACAnC,MAAA,GACAm5G,YA9DAlxC,EAAApsE,UAAAs3D,UAAA,SAAAmmD,GAIA,IAHA,IAAAv/G,EAAA6B,KAAAwD,QACAE,EAAA,GAEAtG,EAAA,EAAAA,EAAAsgH,EAAA5/G,SAEAK,EAAAA,EAAA22D,GAAA4oD,EAAAtgH,IACAA,IAAAsgH,EAAA5/G,OAAA,GAHAV,IAAA,CAKA,IAAAugH,EAAAx/G,EAAAi+G,YAGAwB,EAAAt6G,EAAAq6G,GAUAz8G,EAAA,IAAAmrE,EARAF,EAAAyxC,EAAAD,GAGAC,EAEA7hD,EAAA59D,EAAAi+G,aAGAsB,EAAAtgH,GAAAqG,YACAC,EAAA0J,KAAAlM,GACA/C,EAAAgS,EAAAhS,EAAA+C,GASA,IAFA,IAAA28G,EAAA,EAEA7G,EAAA,EAAAA,EAAAtzG,EAAA5F,OAAAk5G,IACA6G,EAAA19G,EAAA09G,EAAAn6G,EAAAszG,GAAA5yG,OAQA,OALA+nE,EAAA0xC,EAAA79G,KAAAoE,SACAjG,EAAAiG,MAAA,GAGAV,EAAA0J,KAAAjP,GACAuF,IAoBA,IAEAkmF,EAAA,CACArjF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEA92G,EAAA,CACAF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAplG,EAAA,CACA5R,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAO,EAAA,CACAv3G,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAQ,EAAA,CACAx3G,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAj3G,EAAA,CACAC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAx5G,EAAA,CACAwC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA3X,EAAA,CACAr/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA5X,EAAA,CACAp/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAh9G,EAAA,CACAgG,KAAA,IACAnC,MAAA,GACAm5G,YAAA,GAEAjgH,EAAA,CACAiJ,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEA/zG,EAAA,CACAjD,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAhgH,EAAA,CACAgJ,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAtgH,EAAA,CACAsJ,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA5/G,EAAA,CACA4I,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAlgH,EAAA,CACAkJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEA//G,EAAA,CACA+I,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAr+G,EAAA,CACAqH,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAr8G,EAAA,CACAqF,KAAA,IACAnC,MAAA,MACAm5G,YAAA,IAGAS,KAAA,CACA58C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAU,KAAA,CACA13G,KAAA,OACAnC,MAAA,GACAm5G,YAAA,GAEAW,MAAA,CACA33G,KAAA,QACAnC,MAAA,IACAm5G,YAAA,GAEAY,KAAA,CACA53G,KAAA,OACAnC,MAAA,IACAm5G,YAAA,GAEAa,KAAA,CACA73G,KAAA,OACAnC,MAAA,IACAm5G,YAAA,GAEAc,KAAA,CACA93G,KAAA,OACAnC,MAAA,IACAm5G,YAAA,GAEAe,KAAA,CACA/3G,KAAA,OACAnC,MAAA,KACAm5G,YAAA,GAEAgB,KAAA,CACAh4G,KAAA,OACAnC,MAAA,KACAm5G,YAAA,GAEAiB,IAAA,CACAj4G,KAAA,MACAnC,MAAA,KACAm5G,YAAA,GAEAkB,MAAA,CACAl4G,KAAA,QACAnC,MAAA,KACAm5G,YAAA,GAEAmB,MAAA,CACAn4G,KAAA,QACAnC,MAAA,KACAm5G,YAAA,GAEAoB,KAAA,CACAp4G,KAAA,OACAnC,MAAA,GACAm5G,YAAA,GAEAqB,MAAA,CACAr4G,KAAA,QACAnC,MAAA,IACAm5G,YAAA,GAEAsB,MAAA,CACAt4G,KAAA,QACAnC,MAAA,KACAm5G,YAAA,GAEAuB,MAAA,CACAv4G,KAAA,QACAnC,MAAA,KACAm5G,YAAA,GAEAwB,KAAA,CACAx4G,KAAA,OACAnC,MAAA,KACAm5G,YAAA,GAEAyB,KAAA,CACAz4G,KAAA,OACAnC,MAAA,MACAm5G,YAAA,GAEA0B,MAAA,CACA14G,KAAA,QACAnC,MAAA,MACAm5G,YAAA,GAEA2B,KAAA,CACA34G,KAAA,OACAnC,MAAA,MACAm5G,YAAA,GAEA4B,MAAA,CACA54G,KAAA,QACAnC,MAAA,MACAm5G,YAAA,GAEA6B,MAAA,CACA74G,KAAA,QACAnC,MAAA,MACAm5G,YAAA,IAGA8B,QAAA,CACAj+C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAE,GAAA,CACAl3G,KAAA,KACAnC,MAAA,IACAm5G,YAAA,GAEA3zB,EAAA,CACArjF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEA92G,EAAA,CACAF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAplG,EAAA,CACA5R,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAO,EAAA,CACAv3G,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAQ,EAAA,CACAx3G,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAj3G,EAAA,CACAC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAx5G,EAAA,CACAwC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA3X,EAAA,CACAr/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA5X,EAAA,CACAp/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAh9G,EAAA,CACAgG,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAjgH,EAAA,CACAiJ,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA/zG,EAAA,CACAjD,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAhgH,EAAA,CACAgJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAtgH,EAAA,CACAsJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEA5/G,EAAA,CACA4I,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAlgH,EAAA,CACAkJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEA//G,EAAA,CACA+I,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAr+G,EAAA,CACAqH,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAr8G,EAAA,CACAqF,KAAA,IACAnC,MAAA,MACAm5G,YAAA,IAGA+B,MAAA,CACAl+C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAE,GAAA,CACAl3G,KAAA,KACAnC,MAAA,IACAm5G,YAAA,GAEA3zB,EAAA,CACArjF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEA92G,EAAA,CACAF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAplG,EAAA,CACA5R,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAO,EAAA,CACAv3G,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAQ,EAAA,CACAx3G,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAj3G,EAAA,CACAC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAx5G,EAAA,CACAwC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA3X,EAAA,CACAr/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA5X,EAAA,CACAp/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAh9G,EAAA,CACAgG,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAjgH,EAAA,CACAiJ,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA/zG,EAAA,CACAjD,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAhgH,EAAA,CACAgJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAtgH,EAAA,CACAsJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEA5/G,EAAA,CACA4I,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAlgH,EAAA,CACAkJ,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEA//G,EAAA,CACA+I,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAr+G,EAAA,CACAqH,KAAA,IACAnC,MAAA,MACAm5G,YAAA,GAEAr8G,EAAA,CACAqF,KAAA,IACAnC,MAAA,MACAm5G,YAAA,IAGAgC,gBAAA,CACAn+C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEA92G,EAAA,CACAF,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAplG,EAAA,CACA5R,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAO,EAAA,CACAv3G,KAAA,IACAnC,MAAA,IACAm5G,YAAA,GAEAQ,EAAA,CACAx3G,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAj3G,EAAA,CACAC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEAx5G,EAAA,CACAwC,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA3X,EAAA,CACAr/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,GAEA5X,EAAA,CACAp/F,KAAA,IACAnC,MAAA,KACAm5G,YAAA,IAGAiC,iBAAA,CACAp+C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAkC,GAAA,CACAl5G,KAAA,KACAnC,MAAA,KACAm5G,YAAA,GAEAmC,GAAA,CACAn5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAoC,GAAA,CACAp5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAqC,GAAA,CACAr5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAsC,GAAA,CACAt5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAuC,GAAA,CACAv5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAwC,GAAA,CACAx5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAyC,GAAA,CACAz5G,KAAA,KACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,IAGA0C,eAAA,CACA7+C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAY,KAAA,CACA53G,KAAA,OACAnC,MAAA,IACAm5G,YAAA,GAEAa,KAAA,CACA73G,KAAA,OACAnC,MAAA,IACAm5G,YAAA,GAEAc,KAAA,CACA93G,KAAA,OACAnC,MAAA,IACAm5G,YAAA,GAEAe,KAAA,CACA/3G,KAAA,OACAnC,MAAA,KACAm5G,YAAA,GAEAgB,KAAA,CACAh4G,KAAA,OACAnC,MAAA,KACAm5G,YAAA,GAEAiB,IAAA,CACAj4G,KAAA,MACAnC,MAAA,KACAm5G,YAAA,GAEAkB,MAAA,CACAl4G,KAAA,QACAnC,MAAA,KACAm5G,YAAA,GAEAmB,MAAA,CACAn4G,KAAA,QACAnC,MAAA,KACAm5G,YAAA,IAGA2C,gBAAA,CACA9+C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEA4C,KAAA,CACA55G,KAAA,OACAnC,MAAA,KACAm5G,YAAA,GAEA6C,KAAA,CACA75G,KAAA,OACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEA8C,KAAA,CACA95G,KAAA,OACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEA+C,KAAA,CACA/5G,KAAA,OACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAgD,KAAA,CACAh6G,KAAA,OACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAiD,IAAA,CACAj6G,KAAA,MACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAkD,KAAA,CACAl6G,KAAA,OACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,GAEAmD,KAAA,CACAn6G,KAAA,OACAnC,MAAAhG,KAAAoC,IAAA,KAAA,GACA+8G,YAAA,IAGAoD,IAAA,CACAv/C,GAAA,CACA76D,KAAA,GACAnC,MAAA,EACAm5G,YAAA,GAEAqD,GAAA,CACAr6G,KAAA,KACAnC,MAAA,IACAm5G,YAAA,KAIA/D,EAAAqH,UAAA3rG,EAAAskG,EAAAgE,MAAAhE,EAAAwE,MACAxE,EAAAsH,aAAA5rG,EAAAskG,EAAA+F,gBAAA/F,EAAAgG,kBACAhG,EAAAuH,YAAA7rG,EAAAskG,EAAAyG,eAAAzG,EAAA0G,iBAiBA,IAAAvG,EAAA,CAAA,OAAA,SAAA,OAAA,UAAA,cAAA,qBAAA,sBAAA,QAAA,OACApJ,EAAA,CACAkJ,KAAA,CACAxyC,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA+5C,KAAA,CACA/5C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAg6C,OAAA,CACAh6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAi6C,KAAA,CACAj6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAk6C,QAAA,CACAl6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAm6C,YAAA,CACAn6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAo6C,mBAAA,CACAp6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAq6C,oBAAA,CACAr6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAs6C,MAAA,CACAt6C,WAAA,CAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAu6C,QAAA,CACAv6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAw6C,OAAA,CACAx6C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAy6C,OAAA,CACAz6C,WAAA,CAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA06C,MAAA,CACA16C,WAAA,CAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA26C,SAAA,CACA36C,WAAA,CAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA46C,gBAAA,CACA56C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA66C,qBAAA,CACA76C,WAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA86C,mBAAA,CACA96C,WAAA,CAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEA+6C,oBAAA,CACA/6C,WAAA,CAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAg7C,oBAAA,CACAh7C,WAAA,CAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAi7C,qBAAA,CACAj7C,WAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAk7C,cAAA,CACAl7C,WAAA,CAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAm7C,sBAAA,CACAn7C,WAAA,CAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAo7C,UAAA,CACAp7C,WAAA,CAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAupC,MAAA,CACAvpC,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAEAq7C,IAAA,CACAr7C,WAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,KAIA,IAAA,IAAA3xD,KAAAi7F,EACAA,EAAAj7F,GAAAA,IAAAA,EAGA,IACAikG,EAAA,CACAhzG,KAAA,GACAoG,KAHA,GAIAvI,MAAA,EACAulB,OAAA,EACAs9C,WAAA0yC,EAAAvhF,IAAA,SAAAj6B,GACA,OAAA,KAGAo8G,EAAA,CAEAgI,MAAA,CACAh8G,KAAA,QACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEA64F,KAAA,CACAj8G,KAAA,OACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEA84F,KAAA,CACAl8G,KAAA,OACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEA+4F,KAAA,CACAn8G,KAAA,OACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEAg5F,KAAA,CACAp8G,KAAA,OACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAEAi5F,KAAA,CACAr8G,KAAA,OACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAk5F,IAAA,CACAt8G,KAAA,MACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,OACAulB,OAAA,GAEA4wB,MAAA,CACAh0C,KAAA,QACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAm5F,SAAA,CACAv8G,KAAA,WACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEAngB,EAAA,CACAjD,KAAA,IACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEAynD,GAAA,CACA7qE,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEAo5F,GAAA,CACAx8G,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEAjhB,GAAA,CACAnC,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEAq5F,GAAA,CACAz8G,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAEAs5F,GAAA,CACA18G,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAriB,GAAA,CACAf,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAu5F,GAAA,CACA38G,KAAA,KACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAw5F,IAAA,CACA58G,KAAA,MACAoG,KAAA4jG,EAAA0Q,OACAzG,SAAAhB,EAAAC,KACAr1G,MAAA,OACAulB,OAAA,GAIA0kE,GAAA,CACA9nF,KAAA,KACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAA6F,QACAj7G,MAAA,EACAulB,OAAA,GAEAy5F,KAAA,CACA78G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAGA05F,KAAA,CACA98G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,UACAulB,OAAA,GAGA25F,KAAA,CACA/8G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,UACAulB,OAAA,GAGA45F,KAAA,CACAh9G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,eACAulB,OAAA,GAGA65F,KAAA,CACAj9G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAGA85F,KAAA,CACAl9G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAGA+5F,MAAA,CACAn9G,KAAA,QACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,WACAulB,OAAA,GAGAg6F,KAAA,CACAp9G,KAAA,OACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAGAi6F,QAAA,CACAr9G,KAAA,UACAoG,KAAA4jG,EAAAiR,QACAhH,SAAAhB,EAAAC,KACAr1G,MAAA,IACAulB,OAAA,GAIAk6F,GAAA,CACAt9G,KAAA,KACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAA8F,MACAl7G,MAAA,EACAulB,OAAA,GAEAkvD,EAAA,CACAtyE,KAAA,IACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAgE,MACAp5G,MAAA,KACAulB,OAAA,GAGAgvD,EAAA,CACApyE,KAAA,IACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAgE,MACAp5G,MAAA,KACAulB,OAAA,GAGAm6F,MAAA,CACAv9G,KAAA,QACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAwE,KACA55G,MAAA,KACAulB,OAAA,GAEAo6F,KAAA,CACAx9G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,aACAulB,OAAA,GAGAq6F,KAAA,CACAz9G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,cACAulB,OAAA,GAGAs6F,KAAA,CACA19G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,cACAulB,OAAA,GAGAu6F,SAAA,CACA39G,KAAA,WACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAGAw6F,WAAA,CACA59G,KAAA,aACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAIAu4B,KAAA,CACA37C,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAGAy6F,IAAA,CACA79G,KAAA,MACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAIA06F,MAAA,CACA99G,KAAA,QACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGA26F,UAAA,CACA/9G,KAAA,YACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,aACAulB,OAAA,GAGA46F,WAAA,CACAh+G,KAAA,aACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGA66F,KAAA,CACAj+G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGA86F,GAAA,CACAl+G,KAAA,KACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAGA+6F,IAAA,CACAn+G,KAAA,MACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGAg7F,KAAA,CACAp+G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGAi7F,MAAA,CACAr+G,KAAA,QACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGAk7F,OAAA,CACAt+G,KAAA,SACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,WACAulB,OAAA,GAGAm7F,WAAA,CACAv+G,KAAA,aACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAGAo7F,UAAA,CACAx+G,KAAA,YACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAGAq7F,SAAA,CACAz+G,KAAA,WACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAIAs7F,KAAA,CACA1+G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,aACAulB,OAAA,GAGAu7F,KAAA,CACA3+G,KAAA,OACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGAw7F,GAAA,CACA5+G,KAAA,KACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGAukE,GAAA,CACA3nF,KAAA,KACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGAy7F,GAAA,CACA7+G,KAAA,KACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGA07F,GAAA,CACA9+G,KAAA,KACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAGA27F,IAAA,CACA/+G,KAAA,MACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,WACAulB,OAAA,GAGA47F,IAAA,CACAh/G,KAAA,MACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAGA67F,IAAA,CACAj/G,KAAA,MACAoG,KAAA4jG,EAAAkR,OACAjH,SAAAhB,EAAAC,KACAr1G,MAAA,SACAulB,OAAA,GAKAvQ,EAAA,CACA7S,KAAA,IACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAgE,MACAp5G,MAAA,KACAulB,OAAA,GAEA87F,KAAA,CACAl/G,KAAA,OACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAwE,KACA55G,MAAA,KACAulB,OAAA,GAEA+7F,IAAA,CACAn/G,KAAA,MACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAgE,MACAp5G,MAAA,UACAulB,OAAA,GAEAg8F,MAAA,CACAp/G,KAAA,QACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAgE,MACAp5G,MAAA,IACAulB,OAAA,GAEAi8F,MAAA,CACAr/G,KAAA,QACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAEAk8F,KAAA,CACAt/G,KAAA,OACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,kBACAulB,OAAA,GAEAm8F,MAAA,CACAv/G,KAAA,QACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,cACAulB,OAAA,GAEAo8F,UAAA,CACAx/G,KAAA,YACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,UACAulB,OAAA,GAEAq8F,cAAA,CACAz/G,KAAA,gBACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,UACAulB,OAAA,GAEAs8F,MAAA,CACA1/G,KAAA,QACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAEAu8F,MAAA,CACA3/G,KAAA,QACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,WACAulB,OAAA,GAEAw8F,GAAA,CACA5/G,KAAA,KACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,YACAulB,OAAA,GAEAy8F,GAAA,CACA7/G,KAAA,KACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,kBACAulB,OAAA,GAEA08F,GAAA,CACA9/G,KAAA,KACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,cACAulB,OAAA,GAEA28F,IAAA,CACA//G,KAAA,MACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,UACAulB,OAAA,GAEA48F,IAAA,CACAhgH,KAAA,MACAoG,KAAA4jG,EAAAyQ,KACAxG,SAAAhB,EAAAC,KACAr1G,MAAA,UACAulB,OAAA,GAGAxhB,EAAA,CACA5B,KAAA,IACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEA3iB,IAAA,CACAT,KAAA,MACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,GACAulB,OAAA,GAEAigE,EAAA,CACArjF,KAAA,IACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAEA68F,OAAA,CACAjgH,KAAA,SACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEAroB,IAAA,CACAiF,KAAA,MACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEA88F,OAAA,CACAlgH,KAAA,SACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,GACAulB,OAAA,GAEA+8F,KAAA,CACAngH,KAAA,OACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAEAg9F,IAAA,CACApgH,KAAA,MACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,MACAulB,OAAA,GAEAi9F,KAAA,CACArgH,KAAA,OACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,OACAulB,OAAA,GAEAk9F,MAAA,CACAtgH,KAAA,QACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,QAEAulB,OAAA,GAEAm9F,KAAA,CACAvgH,KAAA,OACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,SAEAulB,OAAA,GAEAo9F,OAAA,CACAxgH,KAAA,SACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,SAEAulB,OAAA,GAEAq9F,QAAA,CACAzgH,KAAA,UACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,SAEAulB,OAAA,GAEAs9F,WAAA,CACA1gH,KAAA,aACAoG,KAAA4jG,EAAA2Q,KACA1G,SAAAhB,EAAAC,KACAr1G,MAAA,SAEAulB,OAAA,GAGAu9F,MAAA,CACA3gH,KAAA,QACAoG,KAAA4jG,EAAA8R,UACA7H,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,EACAw9F,YAAA,GAEAC,GAAA,CACA7gH,KAAA,KACAoG,KAAA4jG,EAAA8R,UACA7H,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,EACAw9F,YAAA,GAGAE,IAAA,CACA9gH,KAAA,MACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEA29F,OAAA,CACA/gH,KAAA,SACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAGA49F,IAAA,CACAhhH,KAAA,MACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAgE,MACAp5G,MAAA,KAEAulB,OAAA,GAEAugE,OAAA,CACA3jF,KAAA,SACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAwE,KACA55G,MAAA,KAEAulB,OAAA,GAGA69F,KAAA,CACAjhH,KAAA,OACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAgE,MACAp5G,MAAA,KAEAulB,OAAA,GAEA89F,QAAA,CACAlhH,KAAA,UACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAwE,KACA55G,MAAA,KAEAulB,OAAA,GAGA+9F,MAAA,CACAnhH,KAAA,QACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAC,KACAr1G,MAAA,KAEAulB,OAAA,GAGAg+F,OAAA,CACAphH,KAAA,SACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAC,KACAr1G,MAAA,KAEAulB,OAAA,GAGAi+F,OAAA,CACArhH,KAAA,SACAoG,KAAA4jG,EAAAC,MACAgK,SAAAhB,EAAAC,KACAr1G,MAAA,KAEAulB,OAAA,GAGAvR,EAAA,CACA7R,KAAA,IACAoG,KAAA4jG,EAAA4Q,QACA3G,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEAk+F,OAAA,CACAthH,KAAA,SACAoG,KAAA4jG,EAAA4Q,QACA3G,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAMAm+F,EAAA,CACAvhH,KAAA,IACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EACAulB,OAAA,GAEAo+F,KAAA,CACAxhH,KAAA,OACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EACAulB,OAAA,QAEAq+F,KAAA,CACAzhH,KAAA,OACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EAAA,IACAulB,OAAA,QAEAs+F,KAAA,CACA1hH,KAAA,OACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EAAA,IACAulB,OAAA,GAEAu+F,OAAA,CACA3hH,KAAA,SACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EACAulB,OAAA,GAEAw+F,QAAA,CACA5hH,KAAA,UACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EACAulB,OAAA,QAEAy+F,WAAA,CACA7hH,KAAA,aACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EAAA,IACAulB,OAAA,QAEA0+F,QAAA,CACA9hH,KAAA,UACAoG,KAAA4jG,EAAA6Q,YACA5G,SAAAhB,EAAAC,KACAr1G,MAAA,EAAA,IACAulB,OAAA,GAGA2+F,IAAA,CACA/hH,KAAA,MACAoG,KAAA4jG,EAAA+Q,oBACA9G,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEA4+F,KAAA,CACAhiH,KAAA,OACAoG,KAAA4jG,EAAA+Q,oBACA9G,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAGA6+F,GAAA,CACAjiH,KAAA,KACAoG,KAAA4jG,EAAA8Q,mBACA7G,SAAAhB,EAAAC,KACAr1G,MAAA,EACAulB,OAAA,GAEA8+F,QAAA,CACAliH,KAAA,UACAoG,KAAA4jG,EAAA8Q,mBACA7G,SAAAhB,EAAAC,KACAr1G,MAAA,EACAulB,OAAA,GAMAtQ,EAAA,CACA9S,KAAA,IACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEA++F,OAAA,CACAniH,KAAA,SACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEAg/F,IAAA,CACApiH,KAAA,MACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAgE,MACAp5G,MAAA,KACAulB,OAAA,GAEAi/F,KAAA,CACAriH,KAAA,OACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAwE,KACA55G,MAAA,KACAulB,OAAA,GAEAk/F,IAAA,CACAtiH,KAAA,MACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAC,KACAr1G,MAAA,gBACAulB,OAAA,GAEAm/F,WAAA,CACAviH,KAAA,aACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAC,KACAr1G,MAAA,gBACAulB,OAAA,GAEAo/F,IAAA,CACAxiH,KAAA,MACAoG,KAAA4jG,EAAAgR,MACA/G,SAAAhB,EAAAwE,KACA55G,MAAA,UACAulB,OAAA,GAGA4hE,EAAA,CACAhlF,KAAA,IACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEAq/F,MAAA,CACAziH,KAAA,QACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEAs/F,IAAA,CACA1iH,KAAA,MACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAC,KACAr1G,MAAA,KACAulB,OAAA,GAEAu/F,GAAA,CACA3iH,KAAA,KACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAgE,MACAp5G,MAAA,KACAulB,OAAA,GAEAg3F,IAAA,CACAp6G,KAAA,MACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAmH,IACAv8G,MAAA,cACAulB,OAAA,GAEAw/F,GAAA,CACA5iH,KAAA,KACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAgE,MACAp5G,MAAA,eACAulB,OAAA,GAEAy/F,aAAA,CACA7iH,KAAA,eACAoG,KAAA4jG,EAAAmR,OACAlH,SAAAhB,EAAAwE,KACA55G,MAAA,eACAulB,OAAA,GAGAo/D,EAAA,CACAxiF,KAAA,IACAoG,KAAA4jG,EAAAoR,MACAnH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEA0/F,KAAA,CACA9iH,KAAA,OACAoG,KAAA4jG,EAAAoR,MACAnH,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEA2/F,GAAA,CACA/iH,KAAA,KACAoG,KAAA4jG,EAAAoR,MACAnH,SAAAhB,EAAAC,KACAr1G,MAAA,eACAulB,OAAA,GAGA4/F,IAAA,CACAhjH,KAAA,MACAoG,KAAA4jG,EAAAoR,MACAnH,SAAAhB,EAAAgE,MACAp5G,MAAA5E,EAAA8/F,EACA31E,OAAA,GAEA6/F,GAAA,CACAjjH,KAAA,KACAoG,KAAA4jG,EAAAoR,MACAnH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGA8/F,GAAA,CACAljH,KAAA,KACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAEA+/F,IAAA,CACAnjH,KAAA,MACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAC,KACAr1G,MAAA,iBACAulB,OAAA,GAEAggG,IAAA,CACApjH,KAAA,MACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAC,KACAr1G,MAAA,OACAulB,OAAA,GAEAigG,IAAA,CACArjH,KAAA,MACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAqH,UACAz8G,MAAA,IACAulB,OAAA,GAEAkgG,KAAA,CACAtjH,KAAA,OACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAmgG,KAAA,CACAvjH,KAAA,OACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAogG,MAAA,CACAxjH,KAAA,QACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAEAqgG,MAAA,CACAzjH,KAAA,QACAoG,KAAA4jG,EAAAqR,SACApH,SAAAhB,EAAAC,KACAr1G,MAAA,QACAulB,OAAA,GAGA4uC,QAAA,CACAhyD,KAAA,UACAoG,KAAA4jG,EAAAsR,gBACArH,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEArR,EAAA,CACA/R,KAAA,IACAoG,KAAA4jG,EAAAsR,gBACArH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGAsgG,MAAA,CACA1jH,KAAA,QACAoG,KAAA4jG,EAAAuR,qBACAtH,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEAugG,EAAA,CACA3jH,KAAA,IACAoG,KAAA4jG,EAAAuR,qBACAtH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGAwgG,KAAA,CACA5jH,KAAA,OACAoG,KAAA4jG,EAAAwR,mBACAvH,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEAygG,EAAA,CACA7jH,KAAA,IACAoG,KAAA4jG,EAAAwR,mBACAvH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGA0gG,IAAA,CACA9jH,KAAA,MACAoG,KAAA4jG,EAAAyR,oBACAxH,SAAAhB,EAAAqH,UAEAz8G,MAAA,EACAulB,OAAA,GAcA2gG,MAAA,CACA/jH,KAAA,QACAoG,KAAA4jG,EAAA0R,oBACAzH,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEA4gG,EAAA,CACAhkH,KAAA,IACAoG,KAAA4jG,EAAA0R,oBACAzH,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGA6gG,QAAA,CACAjkH,KAAA,UACAoG,KAAA4jG,EAAA2R,qBACA1H,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEA8gG,EAAA,CACAlkH,KAAA,IACAoG,KAAA4jG,EAAA2R,qBACA1H,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGA+gG,MAAA,CACAnkH,KAAA,QACAoG,KAAA4jG,EAAA4R,cACA3H,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEAghG,GAAA,CACApkH,KAAA,KACAoG,KAAA4jG,EAAA4R,cACA3H,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGAihG,MAAA,CACArkH,KAAA,QACAoG,KAAA4jG,EAAA6R,sBACA5H,SAAAhB,EAAAwE,KACA55G,MAAA,EACAulB,OAAA,GAEAo0F,EAAA,CACAx3G,KAAA,IACAoG,KAAA4jG,EAAA6R,sBACA5H,SAAAhB,EAAAgE,MACAp5G,MAAA,EACAulB,OAAA,GAGAjrB,EAAA,CACA6H,KAAA,IACAoG,KAAA4jG,EAAA+R,IACA9H,SAAAhB,EAAAsH,aACA18G,MAAA,EACAulB,OAAA,GAEAkhG,KAAA,CACAtkH,KAAA,OACAoG,KAAA4jG,EAAA+R,IACA9H,SAAAhB,EAAAuH,YACA38G,MAAA,EACAulB,OAAA,GAEAtR,EAAA,CACA9R,KAAA,IACAoG,KAAA4jG,EAAA+R,IACA9H,SAAAhB,EAAAsH,aACA18G,MAAA,EACAulB,OAAA,GAEAmhG,MAAA,CACAvkH,KAAA,QACAoG,KAAA4jG,EAAA+R,IACA9H,SAAAhB,EAAAuH,YACA38G,MAAA,EACAulB,OAAA,IAIAohG,EAAA,CACAC,OAAA,QACAC,OAAA,OACAC,KAAA,OACAC,MAAA,OACAC,MAAA,OACAC,MAAA,OACAC,KAAA,MACAC,OAAA,QACAC,UAAA,WACAh/G,GAAA,IACAi/G,OAAA,QACAC,MAAA,QACAC,OAAA,QACAC,UAAA,WACAC,YAAA,aACAC,OAAA,QACAC,WAAA,YACAC,YAAA,aACAC,MAAA,OACAC,KAAA,MACAC,MAAA,OACAC,OAAA,QACAC,QAAA,SACAC,YAAA,aACAC,WAAA,YACAC,UAAA,WACAC,KAAA,MACAC,MAAA,OACAC,KAAA,MACAC,OAAA,QACAC,OAAA,QACAC,MAAA,OACAC,OAAA,QACAC,YAAA,YACAC,eAAA,gBACAC,OAAA,QACAC,GAAA,MACAC,IAAA,MACAC,KAAA,MACAC,MAAA,OACAC,SAAA,UACAC,OAAA,OACAC,OAAA,OACAC,OAAA,OACAC,QAAA,OACAC,KAAA,OACAC,MAAA,QACAC,MAAA,QACAC,QAAA,SACAC,KAAA,SACAC,QAAA,SACAC,KAAA,SACAC,MAAA,OACAC,GAAA,OACAC,IAAA,OACAC,KAAA,MACAC,MAAA,OACAC,OAAA,QACAC,MAAA,OACAC,QAAA,SACAC,UAAA,UACAC,UAAA,aACA1H,MAAA,QACA2H,QAAA,SACAC,QAAA,SACAC,SAAA,UACAC,OAAA,QACAC,UAAA,SACAC,WAAA,SACAC,UAAA,SACAC,WAAA,SACAC,KAAA,MACAC,MAAA,OACAC,OAAA,QACAC,QAAA,SACAC,SAAA,UACAC,MAAA,OACAC,KAAA,MACAC,OAAA,QACAC,OAAA,QACAC,OAAA,QACAC,cAAA,eACAC,MAAA,QASA,SAAAC,EAAAt9G,GACA,GAAA,cAAAA,EAAA+uB,OAAA,CACA,IAAAhvB,EAAA0mG,EAAA1mG,GAAA2kC,EAAA0d,WACAwlD,EAAA8M,IAAAjjH,MAAA,IAAAizC,EAAA0d,UAAA,GACAwlD,EAAAgN,IAAAnjH,MAAAsO,EAAApS,IAAA,KAEAi6G,EAAAiN,KAAApjH,MAAAsO,EAAApS,IAAA,KAEAi6G,EAAAmN,MAAAtjH,MAAAsO,EAAAvJ,MAAA,GAEAoxG,EAAAoN,OAAAvjH,MAAAsO,EAAApS,IAAA,OAEAi6G,EAAAqN,OAAAxjH,MAAAsO,EAAApS,IAAA,YAGAi6G,EAAA8M,IAAAjjH,MAAA,EACAm2G,EAAAgN,IAAAnjH,MAAAhG,KAAA2C,GAAA,IAEAw5G,EAAAiN,KAAApjH,MAAAhG,KAAA2C,GAAA,IAEAw5G,EAAAmN,MAAAtjH,MAAA,EAAAhG,KAAA2C,GAEAw5G,EAAAoN,OAAAvjH,MAAAhG,KAAA2C,GAAA,MAEAw5G,EAAAqN,OAAAxjH,MAAAhG,KAAA2C,GAAA,MAIAw5G,EAAA+M,OAAAljH,MAAAm2G,EAAA8M,IAAAjjH,MACAm2G,EAAArwB,OAAA9lF,MAAAm2G,EAAAgN,IAAAnjH,MACAm2G,EAAAkN,QAAArjH,MAAAm2G,EAAAiN,KAAApjH,MAIA6rH,EAAAt9G,GAEAw9C,EAAAsmC,GAAA,SAAA,SAAAllC,EAAAF,GACAE,EAAA7vB,SAAA2vB,EAAA3vB,QACAuuF,EAAA1+D,KASA,IAAA+pD,EAAA,CACA4U,GAAA,CAEAzW,KAAA,CACAjiD,KAAA+hD,EACAtuD,OAAAuuD,EAAAC,KAAA,KAEAwH,OAAA,CACAzpD,KAAA+iD,EAAA/wG,EACAyhD,OAAAuuD,EAAAgE,MAAA,KAEAwD,KAAA,CACAxpD,KAAA+iD,EAAAnhG,EACA6xC,OAAAuuD,EAAAgE,MAAA,GAEA0D,KAAA,CACA1pD,KAAA+iD,EAAApyG,EACA8iD,OAAAuuD,EAAAgE,MAAA,KAEA2D,QAAA,CACA3pD,KAAA+iD,EAAAniG,EACA6yC,OAAAuuD,EAAAgE,MAAA,KAEA4D,YAAA,CACA5pD,KAAA+iD,EAAAuN,EACA78D,OAAAuuD,EAAAgE,MAAA,KAEA6D,mBAAA,CACA7pD,KAAA+iD,EAAAiO,GACAv9D,OAAAuuD,EAAAgE,MAAA,KAEA8D,oBAAA,CACA9pD,KAAA+iD,EAAA+N,IACAr9D,OAAAuuD,EAAAgE,MAAA,KAEAhN,MAAA,CACAh5C,KAAA+iD,EAAA8M,IACAp8D,OAAAuuD,EAAAgE,MAAA,KAEA8E,IAAA,CACA9qD,KAAA+iD,EAAA4V,IACAllE,OAAAuuD,EAAAgE,MAAA,KAGA+D,MAAA,CACA/pD,KAAA+iD,EAAAlhG,EACA4xC,OAAAuuD,EAAAgE,MAAA,KAEAkE,OAAA,CACAlqD,KAAA+iD,EAAAhvB,EACAtgC,OAAAuuD,EAAAgE,MAAA,KAEAmE,MAAA,CACAnqD,KAAA+iD,EAAAxxB,EACA99B,OAAAuuD,EAAAgE,MAAA,KAEAoE,SAAA,CACApqD,KAAA+iD,EAAAkP,GACAx+D,OAAAuuD,EAAAgE,MAAA,KAEAqE,gBAAA,CACArqD,KAAA+iD,EAAAjiG,EACA2yC,OAAAuuD,EAAAgE,MAAA,KAEAsE,qBAAA,CACAtqD,KAAA+iD,EAAA2P,EACAj/D,OAAAuuD,EAAAgE,MAAA,KAEAuE,mBAAA,CACAvqD,KAAA+iD,EAAA6P,EACAn/D,OAAAuuD,EAAAgE,MAAA,KAEAwE,oBAAA,CACAxqD,KAAA+iD,EAAA8P,IACAp/D,OAAAuuD,EAAAgE,MAAA,KAEAyE,oBAAA,CACAzqD,KAAA+iD,EAAAgQ,EACAt/D,OAAAuuD,EAAAgE,MAAA,KAEA0E,qBAAA,CACA1qD,KAAA+iD,EAAAkQ,EACAx/D,OAAAuuD,EAAAgE,MAAA,KAEA2E,cAAA,CACA3qD,KAAA+iD,EAAAoQ,GACA1/D,OAAAuuD,EAAAgE,MAAA,KAEA4E,sBAAA,CACA5qD,KAAA+iD,EAAAwD,EACA9yD,OAAAuuD,EAAAgE,MAAA,KAEA6E,UAAA,CACA7qD,KAAA+iD,EAAA6M,GACAn8D,OAAAuuD,EAAAgE,MAAA,OAKAlC,EAAA8U,IAAAn/D,KAAAhyD,MAAAgyD,KAAAC,UAAAoqD,EAAA4U,KACA5U,EAAA8U,IAAAnP,OAAA,CACAzpD,KAAA+iD,EAAA/wG,EACAyhD,OAAAuuD,EAAAgE,MAAA,GAEAlC,EAAA8U,IAAApP,KAAA,CACAxpD,KAAA+iD,EAAAnhG,EACA6xC,OAAAuuD,EAAAgE,MAAA,KAEAlC,EAAA8U,IAAA7O,MAAA,CACA/pD,KAAA+iD,EAAAoO,IACA19D,OAAAuuD,EAAAgE,MAAA,KAEAlC,EAAA8U,IAAA1O,OAAA,CACAlqD,KAAA+iD,EAAA0O,IACAh+D,OAAAuuD,EAAAC,KAAA,KAIA6B,EAAA+U,GAAAp/D,KAAAhyD,MAAAgyD,KAAAC,UAAAoqD,EAAA4U,KACA5U,EAAA+U,GAAApP,OAAA,CACAzpD,KAAA+iD,EAAAwI,GACA93D,OAAAuuD,EAAAC,KAAA,KAEA6B,EAAA+U,GAAArP,KAAA,CACAxpD,KAAA+iD,EAAA+L,IACAr7D,OAAAuuD,EAAAC,KAAA,KAEA6B,EAAA+U,GAAAjP,YAAA,CACA5pD,KAAA+iD,EAAAyN,KACA/8D,OAAAuuD,EAAAC,KAAA,KAEA6B,EAAA+U,GAAA9O,MAAA,CACA/pD,KAAA+iD,EAAAsO,IACA59D,OAAAuuD,EAAAC,KAAA,KAEA6B,EAAA+U,GAAA3O,OAAA,CACAlqD,KAAA+iD,EAAAoG,IACA11D,OAAAuuD,EAAAmH,IAAA,KAEArF,EAAA+U,GAAA1O,MAAA,CACAnqD,KAAA+iD,EAAA+O,GACAr+D,OAAAuuD,EAAAC,KAAA,KAEA6B,EAAA+U,GAAAzO,SAAA,CACApqD,KAAA+iD,EAAAmP,IACAz+D,OAAAuuD,EAAAC,KAAA,KAIA6B,EAAAC,KAAAtqD,KAAAhyD,MAAAgyD,KAAAC,UAAAoqD,EAAA4U,KAEA,IAAA1T,EAAAlB,EAAAC,KAiEA,IAAA,IAAA+U,KA3DAjkD,EAAAkkD,cAAA,SAAAhqH,GACA,IAAA+0G,EAAA5mG,eAAAnO,GAGA,MAAA,IAAA9I,MAAA,eAAA8I,EAAA,iCAAArC,OAAAiT,KAAAmkG,GAAA51F,KAAA,OAFA82F,EAAAlB,EAAA/0G,IAWA8lE,EAAAmkD,cAAA,WACA,IAAA,IAAA7nD,KAAA2yC,EACA,GAAAA,EAAA3yC,KAAA6zC,EACA,OAAA7zC,GAUA0D,EAAAokD,eAAA,CACA17D,UAAA,SAAA52D,GACA,OAAA,IAAAk5C,EAAA0d,UAAA52D,EAAA,KAEA0Z,SAAA,SAAA1Z,GACA,OAAA,IAAAk5C,EAAAx/B,SAAA1Z,IAEAqB,QAAA,SAAArB,GACA,OAAAA,GAEAujC,OAAA,SAAAvjC,GACA,OAAAA,IAaAkuE,EAAAyvC,oBAAA,SAAAzkE,GACA,IAAAg1B,EAAAokD,eAAAp5E,GACA,MAAA,IAAA1d,UAAA,qBAAA0d,EAAA,KAGA,OAAAg1B,EAAAokD,eAAAp5E,IAIAkjE,EAAA,CACA,IAAA/iD,EAAA+iD,EAAA+V,GACA94D,EAAAyP,WAAAzP,EAAA7qD,KAAAs6D,WAIA,IAAA,IAAA1gE,KAAAwkH,EACA,GAAAA,EAAAr2G,eAAAnO,GAAA,CACA,IAAAmqH,EAAAnW,EAAAwQ,EAAAxkH,IACAoqH,EAAA,GAEA,IAAA,IAAAC,KAAAF,EACAA,EAAAh8G,eAAAk8G,KACAD,EAAAC,GAAAF,EAAAE,IAIAD,EAAApqH,KAAAA,EACAg0G,EAAAh0G,GAAAoqH,EA6RA,OAhPAtkD,EAAAjV,WAAA,SAAAxkD,EAAA4oC,GACA,GAAA,WAAAkW,EAAA9+C,GACA,MAAA,IAAA+mB,UAAA,6DAIA,GAAA6hB,GAAAA,EAAAyW,SACA,IAAA,IAAA4+D,KAAAj+G,EAKA,GAJAA,EAAA8B,eAAAm8G,IACAxkD,EAAAykD,WAAAD,GAGAj+G,EAAAi+G,GAAAE,QACA,IAAA,IAAA3zH,EAAA,EAAAA,EAAAwV,EAAAi+G,GAAAE,QAAAjzH,OAAAV,IACAivE,EAAAykD,WAAAl+G,EAAAi+G,GAAAE,QAAA3zH,IAOA,IAAA4zH,EAEA,IAAA,IAAAC,KAAAr+G,EACAA,EAAA8B,eAAAu8G,KACAD,EAAA3kD,EAAA6kD,iBAAAD,EAAAr+G,EAAAq+G,KAIA,OAAAD,GAmBA3kD,EAAA6kD,iBAAA,SAAA3qH,EAAAqM,EAAA4oC,GAKA,GAJA,MAAA5oC,IACAA,EAAA,IAGA,iBAAArM,EACA,MAAA,IAAAozB,UAAA,mEAIA,GAAA4gF,EAAA7lG,eAAAnO,GACA,MAAA,IAAA9I,MAAA,uBAAA8I,EAAA,4CApGA,SAAAA,GACA,IAAA,IAAAnJ,EAAA,EAAAA,EAAAmJ,EAAAzI,OAAAV,IAAA,CACA,IAAA+zH,EAAA5qH,EAAAwB,OAAA3K,GAEAg0H,EAAA,SAAAzzH,GACA,MAAA,aAAA+V,KAAA/V,IAOA,GAAA,IAAAP,IAAAg0H,EAAAD,GACA,MAAA,IAAA1zH,MAAA,yDAAA8I,EAAA,KAGA,GAAA,EAAAnJ,KAAAg0H,EAAAD,IAPA,MADA7zH,EAQA6zH,IAPA7zH,GAAA,KAQA,MAAA,IAAAG,MAAA,kEAAA8I,EAAA,KATA,IAAAjJ,EAgGA+zH,CAAA9qH,GACA,IAIAqmD,EACA4tD,EALA8W,EAAA,KAEAP,EAAA,GACApnG,EAAA,EAIA,GAAA/W,GAAA,SAAAA,EAAAykC,KACAi6E,EAAA1+G,EAAApP,aACA,GAAA,iBAAAoP,EACA,KAAAA,IACAg6C,EAAAh6C,OAEA,CAAA,GAAA,WAAA8+C,EAAA9+C,GASA,MAAA,IAAA+mB,UAAA,uBAAApzB,EAAA,WAAAqM,EAAAnP,WAAA,+CARAmpD,EAAAh6C,EAAAg6C,WACA4tD,EAAA5nG,EAAA4nG,SACA7wF,EAAA/W,EAAA+W,OAEA/W,EAAAm+G,UACAA,EAAAn+G,EAAAm+G,QAAAntH,WAMA,GAAAmtH,EACA,IAAA,IAAA3zH,EAAA,EAAAA,EAAA2zH,EAAAjzH,OAAAV,IACA,GAAAm9G,EAAA7lG,eAAAq8G,EAAA3zH,IACA,MAAA,IAAAK,MAAA,wBAAAszH,EAAA3zH,GAAA,2CAKA,GAAAwvD,GAAA,iBAAAA,IAAA0kE,EACA,IACAA,EAAAjlD,EAAAptE,MAAA2tD,EAAA,CACA4uD,cAAA,IAEA,MAAA/jB,GAEA,MADAA,EAAA9uD,QAAA,0BAAApiC,EAAA,WAAAqmD,EAAA,MAAA6qC,EAAA9uD,QACA8uD,OAEA7qC,GAAA,SAAAA,EAAAvV,OACAi6E,EAAA1kE,EAAAppD,SAGAutH,EAAAA,GAAA,GACApnG,EAAAA,GAAA,EAGA6wF,EADAA,GAAAA,EAAA16D,aACA05D,EAAAgB,EAAA16D,gBAEA05D,EAAAC,KAKA,IAAA8X,EAAA,GAEA,GAAAD,EAwCA,CASA,IAAAE,IARAD,EAAA,CACAhrH,KAAAA,EACAnC,MAAAktH,EAAAltH,MACA6iE,WAAAqqD,EAAArqD,WAAAp9D,MAAA,GACA2wG,SAAAA,EACA7wF,OAAAA,IAKA,IAAA,IAAAutF,KAAA3G,EACA,GAAAA,EAAA77F,eAAAwiG,GAAA,CAGA,IAFA,IAAAv3G,GAAA,EAEA+H,EAAA,EAAAA,EAAAiyG,EAAA77G,OAAA4J,IACA,GAAA,MAAAtJ,KAAAQ,KAAA2yH,EAAAtqD,WAAAv/D,IAAA,IAAA6oG,EAAA2G,GAAAjwC,WAAAv/D,IAAA,IAAA,CACA/H,GAAA,EACA,MAIA,GAAAA,EAAA,CACA6xH,GAAA,EACAD,EAAA5kH,KAAA4jG,EAAA2G,GACA,OAKA,IAAAsa,EAAA,CACA,IAAAC,EAAAlrH,EAAA,SAIAmrH,EAAA,CACAzqD,WAAAqqD,EAAArqD,WAAAp9D,MAAA,IAEA6nH,EAAAp8G,IAAAm8G,EACAlhB,EAAAkhB,GAAAC,EACAlV,EAAAiV,GAAA,CACAj6D,KAAA+5D,EACAtmE,OAAAuuD,EAAAC,KAAA,KAEA8X,EAAA5kH,KAAA4jG,EAAAkhB,QApFA,CAEA,IAAAE,EAAAprH,EAAA,SAEA,GAAA,GAAAozG,EAAA7xG,QAAA6pH,GACA,MAAA,IAAAl0H,MAAA,gCAAA8I,EAAA,2EAKA,IAAA,IAAA7H,KAFAi7G,EAAAvsG,KAAAukH,GAEAphB,EACAA,EAAA77F,eAAAhW,KACA6xG,EAAA7xG,GAAAuoE,WAAA0yC,EAAA77G,OAAA,GAAA,GASA,IAJA,IAAA8zH,EAAA,CACA3qD,WAAA,IAGA4qD,EAAA,EAAAA,EAAAlY,EAAA77G,OAAA+zH,IACAD,EAAA3qD,WAAA4qD,GAAA,EAGAD,EAAA3qD,WAAA0yC,EAAA77G,OAAA,GAAA,EACA8zH,EAAAt8G,IAAAq8G,EACAphB,EAAAohB,GAAAC,EACAL,EAAA,CACAhrH,KAAAA,EACAnC,MAAA,EACA6iE,WAAAspC,EAAAohB,GAAA1qD,WAAAp9D,MAAA,GACA2wG,SAAAA,EACA7wF,OAAAA,EACAhd,KAAA4jG,EAAAohB,IAEAnV,EAAAmV,GAAA,CACAn6D,KAAA+5D,EACAtmE,OAAAuuD,EAAAC,KAAA,KAkDAptC,EAAAkuC,MAAAh0G,GAAAgrH,EAEA,IAAA,IAAAO,EAAA,EAAAA,EAAAf,EAAAjzH,OAAAg0H,IAAA,CACA,IAAAC,EAAAhB,EAAAe,GACAE,EAAA,GAEA,IAAA,IAAAC,KAAAV,EACAA,EAAA78G,eAAAu9G,KACAD,EAAAC,GAAAV,EAAAU,IAIAD,EAAAzrH,KAAAwrH,EACA1lD,EAAAkuC,MAAAwX,GAAAC,EAGA,OAAA,IAAA3lD,EAAA,KAAA9lE,IAGA8lE,EAAAykD,WAAA,SAAAvqH,UACA8lE,EAAAkuC,MAAAh0G,IAIA8lE,EAAAmtC,SAAAA,EACAntC,EAAAstC,gBAAAA,EACAttC,EAAAkkC,WAAAA,EACAlkC,EAAAivC,aAAAA,EACAjvC,EAAAkuC,MAAAA,EACAluC,GAMAzuE,EAAAuyD,MAAA,6nBCj2HA,aA2EAvyD,EAAA2I,KAAA,aACA3I,EAAA8vD,QA1EA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAsEA,OA5BAA,EAAA,aAAA,CAEA+qC,iBAAA,SAAAzoF,EAAA4oC,GACA,OAAAnE,EAAAg1B,KAAAjV,WAAAxkD,EAAA4oC,IAGAt3C,OAAA,SAAA0O,GACA,OAAAykC,EAAAg1B,KAAAjV,WAAAxkD,EAAA,KAGAs/G,yCAAA,SAAA3rH,EAAA4rH,EAAA32E,GACA,IAAA5oC,EAAA,GAEA,OADAA,EAAArM,GAAA4rH,EACA96E,EAAAg1B,KAAAjV,WAAAxkD,EAAA4oC,IAGA42E,iCAAA,SAAA7rH,EAAA4rH,GACA,IAAAv/G,EAAA,GAEA,OADAA,EAAArM,GAAA4rH,EACA96E,EAAAg1B,KAAAjV,WAAAxkD,EAAA,KAGAslB,OAAA,SAAA3xB,GACA,IAAAqM,EAAA,GAEA,OADAA,EAAArM,GAAA,GACA8wC,EAAAg1B,KAAAjV,WAAAxkD,EAAA,kCCrEA,aA8BAhV,EAAA2I,KAAA,YACA3I,EAAA8vD,QA7BA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAyBA,OALAA,EAAA,YAAA,CACA+hE,cAAA,SAAA76D,EAAAkmD,GACA,OAAAlmD,EAAAD,UAAAmmD,iCCxBA,aAEA,IAAA78C,EAAA/jE,EAAA,qCAqDAc,EAAA2I,KAAA,OACA3I,EAAA8vD,QApDA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,GAwBA,IAAAkH,EAAAlH,EAAA,OAAA,CACA+b,KAAA,SAAAluE,GACA,OAAAA,EAAAqF,SAEA00B,OAAA,SAAA/5B,GACA,OAAAk5C,EAAAg1B,KAAAD,gBAAAjuE,GACA,IAAAk5C,EAAAg1B,KAAA,KAAAluE,GAGAk5C,EAAAg1B,KAAAptE,MAAAd,EAAA,CACAq9G,cAAA,KAGA8W,kDAAA,SAAAluH,EAAAozD,GACA,OAAA,IAAAngB,EAAAg1B,KAAAjoE,EAAAozD,IAEAsJ,iBAAA,SAAA3iE,GACA,OAAA0iE,EAAA1iE,EAAAq5D,MAOA,OAJAA,EAAA4K,MAAA,CACArkE,EAAA,4BACA6xF,EAAA,sDAEAp4B,oECpDA,aAEAx5D,EAAAJ,QAAA,CACAd,EAAA,UACAA,EAAA,mBACAA,EAAA,yBACAA,EAAA,wBACAA,EAAA,qKCPA,aAEA,IAAA60D,EAAA70D,EAAA,sBAAA60D,KA6KA,SAAA4gE,EAAApiE,EAAA5pD,EAAAy2C,GACA2U,EAAAxB,EAAA5pD,EAAAy2C,GACA2U,EAAAxB,EAAAC,WAAAC,kBAAA9pD,EAAAy2C,GAGAp/C,EAAA8vD,QAhLA,SAAArW,EAAA1kC,EAAAi+C,EAAAN,EAAAH,GAEA,SAAAqiE,EAAA5rH,GACA,IAAA4wD,EAAAngB,EAAAg1B,KAAAptE,MAAA2H,GAEA,OADA4wD,EAAA24B,WAAA,EACA34B,EAKA+6D,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,sBAEAD,EAAApiE,EAAA,sBAAA,WACA,OAAAqiE,EAAA,kCAEAD,EAAApiE,EAAA,iBAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,wBAAA,WACA,OAAAqiE,EAAA,2BAGAD,EAAApiE,EAAA,mBAAA,WACA,OAAAqiE,EAAA,4BAEAD,EAAApiE,EAAA,mBAAA,WACA,OAAAqiE,EAAA,4BAEAD,EAAApiE,EAAA,kBAAA,WACA,OAAAqiE,EAAA,uBAEAD,EAAApiE,EAAA,UAAA,WACA,OAAAqiE,EAAA,qCAEAD,EAAApiE,EAAA,mBAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,6BAEAD,EAAApiE,EAAA,qBAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,4BAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,sBAAA,WACA,OAAAqiE,EAAA,0BAEAD,EAAApiE,EAAA,kBAAA,WACA,OAAAqiE,EAAA,6BAEAD,EAAApiE,EAAA,WAAA,WACA,OAAAqiE,EAAA,yBAIAD,EAAApiE,EAAA,aAAA,WACA,OAAAqiE,EAAA,0BAEAD,EAAApiE,EAAA,0BAAA,WACA,OAAAqiE,EAAA,0BAEAD,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,gBAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,gBAAA,WACA,MAAA,mBAEAoiE,EAAApiE,EAAA,gBAAA,WACA,OAAAqiE,EAAA,wBAEAD,EAAApiE,EAAA,aAAA,WACA,OAAAqiE,EAAA,0BAEAD,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,cAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,uBAAA,WACA,OAAAqiE,EAAA,gCAEAD,EAAApiE,EAAA,UAAA,WACA,OAAAqiE,EAAA,4BAEAD,EAAApiE,EAAA,sBAAA,WACA,OAAAqiE,EAAA,2BAEAD,EAAApiE,EAAA,kBAAA,WACA,MAAA,UAEAoiE,EAAApiE,EAAA,eAAA,WACA,OAAA,OAGAoiE,EAAApiE,EAAA,aAAA,WACA,OAAAqiE,EAAA,0BAEAD,EAAApiE,EAAA,WAAA,WACA,OAAAqiE,EAAA,4BAEAD,EAAApiE,EAAA,YAAA,WACA,OAAAqiE,EAAA,4BAEAD,EAAApiE,EAAA,UAAA,WACA,OAAAqiE,EAAA,2BAEAD,EAAApiE,EAAA,iBAAA,WACA,OAAAqiE,EAAA,4BAGAD,EAAApiE,EAAA,YAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,cAAA,WACA,OAAAqiE,EAAA,+BAEAD,EAAApiE,EAAA,sBAAA,WACA,OAAAqiE,EAAA,mCAEAD,EAAApiE,EAAA,cAAA,WACA,OAAAqiE,EAAA,gCAEAD,EAAApiE,EAAA,gBAAA,WACA,OAAA,cAEAoiE,EAAApiE,EAAA,kBAAA,WACA,OAAAqiE,EAAA,wBAEAD,EAAApiE,EAAA,kBAAA,WACA,OAAAqiE,EAAA,+BAEAD,EAAApiE,EAAA,mBAAA,WACA,OAAAqiE,EAAA,wBAGAD,EAAApiE,EAAA,YAAA,WACA,OAAAqiE,EAAA,oBAEAD,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,sBAEAD,EAAApiE,EAAA,UAAA,WACA,OAAAqiE,EAAA,oBAIAD,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,sBAEAD,EAAApiE,EAAA,aAAA,WACA,OAAAqiE,EAAA,qBAEAD,EAAApiE,EAAA,aAAA,WACA,OAAAqiE,EAAA,qBAEAD,EAAApiE,EAAA,eAAA,WACA,OAAAqiE,EAAA,yBAEAD,EAAApiE,EAAA,oBAAA,WACA,OAAAqiE,EAAA,uBAWA50H,EAAA+zD,MAAA,EAEA/zD,EAAAuyD,MAAA,oDCvLA,aAEAjsD,OAAAC,eAAAvG,EAAA,aAAA,CACAwG,OAAA,IAEAxG,EAAAy6B,KAAAA,EACAz6B,EAAAuwG,SA4FA,SAAAzlF,EAAA2P,GAGA,GAFA,IAAAA,EAAAv6B,QAIA,GAAAqf,MAAA2gB,QAAApV,GACA,MAAA,IAAA+pG,EAAAp0G,QAAAqK,EAAA5qB,OAAA,QA7CA,SAAA4lG,EAAAh7E,EAAA2P,EAAA69C,GACA,IAAA94E,EACA,IAAA6L,EAAAyf,EAAA5qB,OAEA,GAAAmL,IAAAovB,EAAA69C,GACA,MAAA,IAAAu8C,EAAAp0G,QAAApV,EAAAovB,EAAA69C,IAGA,GAAAA,EAAA79C,EAAAv6B,OAAA,EAAA,CAEA,IAAA40H,EAAAx8C,EAAA,EAEA,IAAA94E,EAAA,EAAAA,EAAA6L,EAAA7L,IAAA,CACA,IAAA8qE,EAAAx/C,EAAAtrB,GAEA,IAAA+f,MAAA2gB,QAAAoqC,GACA,MAAA,IAAAuqD,EAAAp0G,QAAAga,EAAAv6B,OAAA,EAAAu6B,EAAAv6B,OAAA,KAGA4lG,EAAAh7E,EAAAtrB,GAAAi7B,EAAAq6F,SAIA,IAAAt1H,EAAA,EAAAA,EAAA6L,EAAA7L,IACA,GAAA+f,MAAA2gB,QAAApV,EAAAtrB,IACA,MAAA,IAAAq1H,EAAAp0G,QAAAga,EAAAv6B,OAAA,EAAAu6B,EAAAv6B,OAAA,KAwBA4lG,CAAAh7E,EAAA2P,EAAA,IArGAz6B,EAAAqoG,cAgHA,SAAA1uF,EAAAzZ,GACA,IAAA60H,EAAAt0G,QAAAs/B,SAAApmC,KAAAo7G,EAAAt0G,QAAAnS,UAAAqL,GACA,MAAA,IAAAoiB,UAAA,oCAAApiB,EAAA,KAGA,GAAAA,EAAA,GAAA,iBAAAzZ,GAAAA,GAAAyZ,EACA,MAAA,IAAAq7G,EAAAv0G,QAAA9G,EAAAzZ,IArHAF,EAAAsgE,OAoIA,SAAAx1C,EAAA2P,EAAA2c,GAGA,IAAA73B,MAAA2gB,QAAApV,KAAAvL,MAAA2gB,QAAAzF,GACA,MAAA,IAAAsB,UAAA,kBAGA,GAAA,IAAAtB,EAAAv6B,OACA,MAAA,IAAAL,MAAA,uCAIA46B,EAAA/gB,QAAA,SAAAlT,GACA,IAAAuuH,EAAAt0G,QAAAs/B,SAAAv5C,KAAAuuH,EAAAt0G,QAAAnS,UAAA9H,IAAAA,EAAA,EACA,MAAA,IAAAu1B,UAAA,uDAAAk5F,EAAAx0G,QAAAg4C,OAAAh+B,GAAA,OAIA,IAAAy6F,OAAAzzH,IAAA21C,EAAAA,EAAA,EAIA,OAaA,SAAAq9D,EAAA3pF,EAAA2P,EAAA69C,EAAAlhC,GACA,IAAA53C,EACA8xE,EACA6jD,EAAArqG,EAAA5qB,OACAk1H,EAAA36F,EAAA69C,GACA+8C,EAAA70H,KAAA4I,IAAA+rH,EAAAC,GAIA,GAFAtqG,EAAA5qB,OAAAk1H,EAEA98C,EAAA79C,EAAAv6B,OAAA,EAAA,CAEA,IAAA40H,EAAAx8C,EAAA,EAEA,IAAA94E,EAAA,EAAAA,EAAA61H,EAAA71H,IAEA8xE,EAAAxmD,EAAAtrB,GAEA+f,MAAA2gB,QAAAoxC,KACAA,EAAA,CAAAA,GAEAxmD,EAAAtrB,GAAA8xE,GAGAmjC,EAAAnjC,EAAA72C,EAAAq6F,EAAA19E,GAIA,IAAA53C,EAAA61H,EAAA71H,EAAA41H,EAAA51H,IAEA8xE,EAAA,GACAxmD,EAAAtrB,GAAA8xE,EAEAmjC,EAAAnjC,EAAA72C,EAAAq6F,EAAA19E,OAEA,CAGA,IAAA53C,EAAA,EAAAA,EAAA61H,EAAA71H,IACA,KAAA+f,MAAA2gB,QAAApV,EAAAtrB,KACAsrB,EAAAtrB,GAAAsrB,EAAAtrB,GAAA,GAKA,IAAAA,EAAA61H,EAAA71H,EAAA41H,EAAA51H,IACAsrB,EAAAtrB,GAAA43C,GA5DAq9D,CAAA3pF,EAAA2P,EAAA,EAAAy6F,GAEApqG,GAzJA9qB,EAAAugE,QAmOA,SAAAz1C,EAAAu8E,GACA,IACAiuB,EADAC,EAAAh8E,EAAAzuB,GAGA,SAAA03E,EAAAx4F,GACA,OAAAA,EAAAkhD,OAAA,SAAAuI,EAAAE,GACA,OAAAF,EAAAE,IAIA,IAAAp0C,MAAA2gB,QAAApV,KAAAvL,MAAA2gB,QAAAmnE,GACA,MAAA,IAAAtrE,UAAA,kBAGA,GAAA,IAAAsrE,EAAAnnG,OACA,MAAA,IAAA20H,EAAAp0G,QAAA,EAAA+hF,EAAA/nE,EAAA3P,IAAA,MAKA,IAFA,IAAA0qG,EAAA,EAEAC,EAAA,EAAAA,EAAApuB,EAAAnnG,OAAAu1H,IACAD,GAAAnuB,EAAAouB,GAGA,GAAAF,EAAAr1H,SAAAs1H,EACA,MAAA,IAAAX,EAAAp0G,QAAA+hF,EAAA6E,GAAA7E,EAAA/nE,EAAA3P,IAAA,MAGA,IACAwqG,EAoBA,SAAAxqG,EAAAu8E,GAKA,IAHA,IACAquB,EADAC,EAAA7qG,EAGA2qG,EAAApuB,EAAAnnG,OAAA,EAAA,EAAAu1H,EAAAA,IAAA,CACA,IAAAh7F,EAAA4sE,EAAAouB,GACAC,EAAA,GAIA,IAFA,IAAAx1H,EAAAy1H,EAAAz1H,OAAAu6B,EAEAj7B,EAAA,EAAAA,EAAAU,EAAAV,IACAk2H,EAAAlmH,KAAAmmH,EAAA1pH,MAAAzM,EAAAi7B,GAAAj7B,EAAA,GAAAi7B,IAIAk7F,EAAAD,EAGA,OAAAC,EAvCAC,CAAAL,EAAAluB,GACA,MAAAjoG,GACA,GAAAA,aAAAy1H,EAAAp0G,QACA,MAAA,IAAAo0G,EAAAp0G,QAAA+hF,EAAA6E,GAAA7E,EAAA/nE,EAAA3P,IAAA,MAGA,MAAA1rB,EAGA,OAAAk2H,GAxQAt1H,EAAAwgE,QAgTA,SAAA11C,EAAAw2E,GACA,IAAA/2F,EAAA+2F,GAAA7mE,EAAA3P,GAEA,KAAAvL,MAAA2gB,QAAApV,IAAA,IAAAA,EAAA5qB,QACA4qB,EAAAA,EAAA,GACAvgB,EAAAmF,QAIA,IAAAolG,EAAAvqG,EAAArK,OAEA,KAAA,IAAAqK,EAAAuqG,EAAA,IACAA,IAIAA,EAAAvqG,EAAArK,SACA4qB,EAgBA,SAAA+qG,EAAA/qG,EAAAgqF,EAAAx8B,GACA,IAAA94E,EAAA45E,EAEA,GAAAd,EAAAw8B,EAAA,CACA,IAAA70D,EAAAq4B,EAAA,EAEA,IAAA94E,EAAA,EAAA45E,EAAAtuD,EAAA5qB,OAAAV,EAAA45E,EAAA55E,IACAsrB,EAAAtrB,GAAAq2H,EAAA/qG,EAAAtrB,GAAAs1G,EAAA70D,QAGA,KAAA1gC,MAAA2gB,QAAApV,IACAA,EAAAA,EAAA,GAIA,OAAAA,EA/BA+qG,CAAA/qG,EAAAgqF,EAAA,GACAvqG,EAAArK,OAAA40G,GAGA,OAAAhqF,GApUA9qB,EAAAm1G,UA+WA,SAAArqF,EAAAgqF,EAAAluE,EAAA06D,GACA,IAAA/2F,EAAA+2F,GAAA7mE,EAAA3P,GAEA,GAAA8b,EACA,IAAA,IAAApnC,EAAA,EAAAA,EAAAonC,EAAApnC,IACAsrB,EAAA,CAAAA,GACAvgB,EAAA0F,QAAA,GAKA6a,EAkBA,SAAAgrG,EAAAhrG,EAAAgqF,EAAAx8B,GACA,IAAA94E,EAAA45E,EAEA,GAAA75D,MAAA2gB,QAAApV,GAAA,CACA,IAAAm1B,EAAAq4B,EAAA,EAEA,IAAA94E,EAAA,EAAA45E,EAAAtuD,EAAA5qB,OAAAV,EAAA45E,EAAA55E,IACAsrB,EAAAtrB,GAAAs2H,EAAAhrG,EAAAtrB,GAAAs1G,EAAA70D,QAGA,IAAA,IAAAt9C,EAAA21E,EAAA31E,EAAAmyG,EAAAnyG,IACAmoB,EAAA,CAAAA,GAIA,OAAAA,EAjCAgrG,CAAAhrG,EAAAgqF,EAAA,GAEA,KAAAvqG,EAAArK,OAAA40G,GACAvqG,EAAAiF,KAAA,GAGA,OAAAsb,GA/XA9qB,EAAAu5C,QAAAA,EACAv5C,EAAAw6B,IA0bA,SAAA1P,EAAArL,GACA,OAAAF,MAAAld,UAAAm4B,IAAAv6B,KAAA6qB,EAAArL,IA1bAzf,EAAA0Z,QAmcA,SAAAoR,EAAArL,GACAF,MAAAld,UAAAqX,QAAAzZ,KAAA6qB,EAAArL,IAncAzf,EAAA4kD,OA4cA,SAAA95B,EAAArL,GACA,GAAA,IAAAgb,EAAA3P,GAAA5qB,OAIA,OAAAqf,MAAAld,UAAAuiD,OAAA3kD,KAAA6qB,EAAArL,GAHA,MAAA,IAAA5f,MAAA,4CA7cAG,EAAAu4E,aA2dA,SAAAztD,EAAA8a,GACA,GAAA,IAAAnL,EAAA3P,GAAA5qB,OAIA,OAAAqf,MAAAld,UAAAuiD,OAAA3kD,KAAA6qB,EAAA,SAAA0W,GACA,OAAAoE,EAAA9vB,KAAA0rB,KAJA,MAAA,IAAA3hC,MAAA,4CA5dAG,EAAA8nB,KA0eA,SAAAgD,EAAA27B,GACA,OAAAlnC,MAAAld,UAAAylB,KAAA7nB,KAAA6qB,EAAA27B,IA1eAzmD,EAAAguG,SAmfA,SAAApuG,GACA,IAAA2f,MAAA2gB,QAAAtgC,GACA,MAAA,IAAAm8B,UAAA,wBAGA,GAAA,IAAAn8B,EAAAM,OACA,OAAAN,EAGA,IAAAkB,EAAA,GACA+e,EAAA,EACA/e,EAAA,GAAA,CACA0F,MAAA5G,EAAA,GACAixE,WAAA,GAGA,IAAA,IAAArxE,EAAA,EAAAA,EAAAI,EAAAM,OAAAV,IACAI,EAAAJ,KAAAI,EAAAJ,EAAA,GACAqgB,IAEAA,EAAA,EAGA/e,EAAA0O,KAAA,CACAhJ,MAAA5G,EAAAJ,GACAqxE,WAAAhxD,IAIA,OAAA/e,GA/gBAd,EAAAiuG,WAwhBA,SAAAruG,GACA,IAAA2f,MAAA2gB,QAAAtgC,GACA,MAAA,IAAAm8B,UAAA,wBAGA,GAAA,IAAAn8B,EAAAM,OACA,OAAAN,EAKA,IAFA,IAAAkB,EAAA,GAEAtB,EAAA,EAAAA,EAAAI,EAAAM,OAAAV,IACAsB,EAAA0O,KAAA5P,EAAAJ,GAAAgH,OAGA,OAAA1F,GAriBA,IAAAi0H,EAAAgB,EAAA72H,EAAA,aAEA+1H,EAAAc,EAAA72H,EAAA,aAEA21H,EAAAkB,EAAA72H,EAAA,4BAEA81H,EAAAe,EAAA72H,EAAA,wBAEA,SAAA62H,EAAA/gH,GAAA,OAAAA,GAAAA,EAAA0+F,WAAA1+F,EAAA,CAAAyL,QAAAzL,GASA,SAAAylB,EAAAl6B,GAGA,IAFA,IAAAgK,EAAA,GAEAgV,MAAA2gB,QAAA3/B,IACAgK,EAAAiF,KAAAjP,EAAAL,QACAK,EAAAA,EAAA,GAGA,OAAAgK,EAkYA,SAAAgvC,EAAAzuB,GACA,IAAAvL,MAAA2gB,QAAApV,GAEA,OAAAA,EAGA,IAAA45E,EAAA,GAQA,OAPA55E,EAAApR,QAAA,SAAA+F,EAAAjZ,GACA+Y,MAAA2gB,QAAA15B,GACAA,EAAAkT,QAAA+F,GAEAilF,EAAAl1F,KAAAhJ,KAGAk+F,gHC9bA,aAEA,IAAAsxB,EAAA92H,EAAA,aAwBAkB,EAAAJ,QAAA,SAAAO,EAAA+C,GACA,GAAA/C,EAAAoB,aAAApB,EAAA+N,aAAAhL,EAAA3B,aAAA2B,EAAAgL,YACA,MAAA,IAAAzO,MAAA,wCAGA,IAAAs3D,EAAA52D,EAAA+J,YAEA,GAAA/J,EAAA2B,SAAAoB,EAAApB,QACA,OAAA,IAAAi1D,EAAA/wD,KAGA,GAAA7F,EAAA0F,UAAA3C,EAAA6I,IAAA,IAAA5L,EAAA4L,GAAA7I,GACA,OAAA/C,EAGA,GAAA+C,EAAA2C,UAAA1F,EAAA4L,IAAA,GACA,OAAA7I,EAGA,IAAA/C,EAAAoB,aAAA2B,EAAA3B,WAAA,CACA,IAAApB,EAAAoB,aAAA2B,EAAA3B,WACA,OAAApB,EAAAiO,eAAAlL,EAAAkL,aACAjO,EAGA,IAAA42D,EAAA,GAGA,IAAA52D,EAAAoB,WACA,OAAA2B,EAAAkL,aACAjO,EAGAA,EAAAiO,aACA,IAAA2oD,EAAA,GAGA7zD,EAGA,IAAAA,EAAA3B,WACA,OAAApB,EAAAiO,aACAlL,EAGAA,EAAAkL,aACA,IAAA2oD,EAAA,GAGA52D,EAIA,OAAAy1H,EAAAz1H,EAAA+C,EAAA,SAAA1D,EAAAkB,GACA,OAAAlB,EAAAkB,8CChFA,aAQAV,EAAAJ,QAAA,SAAAO,GACA,GAAAA,EAAAoB,aAAApB,EAAA+N,YACA,MAAA,IAAAzO,MAAA,uCAGA,IAAAs3D,EAAA52D,EAAA+J,YACA2rH,EAAA9+D,EAAAhwD,UACAgwD,EAAApiD,OAAA,CACA5N,UAAA,MAEA,IAAAiS,EAAA7Y,EAAAyB,KAAA,IAAAm1D,EAAA,IAKA,OAJA/9C,EAAA7O,GAAA6O,EAAA7O,GAAA,KACA4sD,EAAApiD,OAAA,CACA5N,UAAA8uH,IAEA78G,6BCvBA,aAEA,IAAA48G,EAAA92H,EAAA,aAuBAkB,EAAAJ,QAAA,SAAAO,EAAA+C,GACA,GAAA/C,EAAAoB,aAAApB,EAAA+N,aAAAhL,EAAA3B,aAAA2B,EAAAgL,YACA,MAAA,IAAAzO,MAAA,uCAGA,IAAAs3D,EAAA52D,EAAA+J,YAEA,GAAA/J,EAAA2B,SAAAoB,EAAApB,QACA,OAAA,IAAAi1D,EAAA/wD,KAGA,IAAA8vH,EAAA,IAAA/+D,GAAA,GAEA,OAAA52D,EAAA0F,UAAA3C,EAAA6I,GAAA+pH,IAAA31H,EAAA4L,GAAA7I,GACAA,EAGAA,EAAA2C,UAAA1F,EAAA4L,GAAA+pH,GACA31H,EAGAA,EAAAoB,YAAA2B,EAAA3B,WAYAq0H,EAAAz1H,EAAA+C,EAAA,SAAA1D,EAAAkB,GACA,OAAAlB,EAAAkB,KAZAP,EAAAoB,aAAApB,EAAAiO,cAAAlL,EAAAkL,cAAAjO,EAAAiO,eAAAlL,EAAAkL,eAAAlL,EAAA3B,WACAu0H,EAGA31H,EAAAiO,cAAAlL,EAAAkL,aACAjO,EAAAoB,WAAApB,EAAA+C,EAGA/C,EAAAoB,WAAA2B,EAAA/C,4CCvDA,aAEA,IAAAy1H,EAAA92H,EAAA,aAEA4/D,EAAA5/D,EAAA,YAsBAkB,EAAAJ,QAAA,SAAAO,EAAA+C,GACA,GAAA/C,EAAAoB,aAAApB,EAAA+N,aAAAhL,EAAA3B,aAAA2B,EAAAgL,YACA,MAAA,IAAAzO,MAAA,wCAGA,IAAAs3D,EAAA52D,EAAA+J,YAEA,GAAA/J,EAAA2B,SAAAoB,EAAApB,QACA,OAAA,IAAAi1D,EAAA/wD,KAGA,GAAA7F,EAAA0F,SACA,OAAA3C,EAGA,GAAAA,EAAA2C,SACA,OAAA1F,EAGA,GAAAA,EAAA4L,GAAA7I,GACA,OAAA,IAAA6zD,EAAA,GAGA,IAAA++D,EAAA,IAAA/+D,GAAA,GAEA,OAAA52D,EAAA4L,GAAA+pH,GACAp3D,EAAAx7D,GAGAA,EAAA6I,GAAA+pH,GACAp3D,EAAAv+D,GAGAA,EAAAoB,YAAA2B,EAAA3B,WAQAq0H,EAAAz1H,EAAA+C,EAAA,SAAA1D,EAAAkB,GACA,OAAAlB,EAAAkB,IARAP,EAAAoB,YAAA2B,EAAA3B,WAIA,IAAAw1D,EAAA52D,EAAAiO,eAAAlL,EAAAkL,aAAAvK,EAAAA,GAAAA,EAAAA,GAHAiyH,2DC7DA,aAEA,IAAAp3D,EAAA5/D,EAAA,YAwFA,SAAAi3H,EAAA51H,GAMA,IAJA,IAAAX,EAAAW,EAAAoC,EAEAxD,EAAAS,EAAA,GAAA,GAEAJ,EAAA,EAAAA,EAAAI,EAAAM,SAAAV,EAAA,CAGA,IAFA,IAAA+K,EAAA3K,EAAAJ,GAAA,GAEA8B,EAAA,EAAAiJ,EAAArK,OAAAoB,KACAiJ,EAAA,IAAAA,EAGApL,GAAAoL,EAKA,IAFA,IAAAT,EAAA3K,EAAAe,OAEA,MAAAf,EAAAgL,OAAAL,IACAA,IAGA,IAAAwF,EAAA/O,EAAAnB,EACA4J,EAAA7J,EAAA8M,MAAA,EAAAnC,EAAA,GAAA,GACAG,EAAAjB,EAAA9I,OAEA,GAAA,EAAAoP,EACA,KAAAA,EAAArF,EAIA,IAFAqF,GAAArF,EAEAqF,KACAtG,GAAA,SAEAsG,EAAArF,IACAjB,EAAAA,EAAAiD,MAAA,EAAAqD,GAAA,IAAAtG,EAAAiD,MAAAqD,IAOA,IAFA,IAAAtF,EAAA,CAAA,GAEA65E,EAAA,EAAAA,EAAA76E,EAAA9I,QAAA,CAGA,IAFA,IAAA6J,EAAAC,EAAA9J,OAEA6J,KACAC,EAAAD,IAAA,GAGAC,EAAA,IAAAmQ,SAAAnR,EAAAmB,OAAA05E,MAEA,IAAA,IAAAg1B,EAAA,EAAAA,EAAA7uG,EAAA9J,SAAA24G,EACA,EAAA7uG,EAAA6uG,KACA,OAAA7uG,EAAA6uG,EAAA,SAAAp3G,IAAAuI,EAAA6uG,EAAA,KACA7uG,EAAA6uG,EAAA,GAAA,GAGA7uG,EAAA6uG,EAAA,IAAA7uG,EAAA6uG,IAAA,EACA7uG,EAAA6uG,IAAA,GAKA,OAAA7uG,EAAAI,UA7IAhK,EAAAJ,QAAA,SAAAO,EAAA+C,EAAAqnB,GACA,IACAyrG,EAAAC,EAwBAC,EAAAC,EAAAC,EAzBAr/D,EAAA52D,EAAA+J,YAEAmsH,IAAAl2H,EAAAgK,EAAA,GACAmsH,IAAApzH,EAAAiH,EAAA,GAEA,GAAAksH,EAAA,CACAL,EAAAD,EAAAr3D,EAAAv+D,IAEA,IAAA,IAAAf,EAAA,EAAAA,EAAA42H,EAAAl2H,SAAAV,EACA42H,EAAA52H,IAAA,OAGA42H,EAAAD,EAAA51H,GAGA,GAAAm2H,EAAA,CACAL,EAAAF,EAAAr3D,EAAAx7D,IAEA,IAAA,IAAAqgF,EAAA,EAAAA,EAAA0yC,EAAAn2H,SAAAyjF,EACA0yC,EAAA1yC,IAAA,OAGA0yC,EAAAF,EAAA7yH,GAQAkzH,EAHAJ,EAAAl2H,QAAAm2H,EAAAn2H,QACAo2H,EAAAF,EACAG,EAAAF,EACAI,IAEAH,EAAAD,EACAE,EAAAH,EACAM,GAGA,IAAAC,EAAAL,EAAAp2H,OACA02H,EAAAL,EAAAr2H,OACA22H,EAAA,EAAAlsG,EAAA8rG,EAAAC,GACAI,EAAA,IAAA3/D,EAAA,EAAA0/D,GACAE,EAAA,IAAA5/D,EAAA,GACA6/D,EAAA,IAAA7/D,EAAA,GACA8+D,EAAA9+D,EAAAhwD,UAKA,IAJAgwD,EAAApiD,OAAA,CACA5N,UAAA,MAGA,EAAAwvH,GACAhsG,EAAA2rG,IAAAK,GAAAJ,IAAAK,MAAAC,IACAC,EAAAA,EAAA90H,KAAA+0H,IAGAA,EAAAA,EAAAxrH,MAAAyrH,GAGA,KAAA,EAAAJ,GACAjsG,EAAA6rG,EAAAD,IAAAK,MAAAC,IACAC,EAAAA,EAAA90H,KAAA+0H,IAGAA,EAAAA,EAAAxrH,MAAAyrH,GAWA,OARA7/D,EAAApiD,OAAA,CACA5N,UAAA8uH,IAGA,GAAAY,IACAC,EAAAvsH,GAAAusH,EAAAvsH,GAGAusH,2CCrFA,aAEA,IAAA/7E,EAAA77C,EAAA,eAAA67C,QA+CA,SAAAk8E,EAAAjjH,GACA,OAAAA,EAAA,GAAA7M,UAxCAnH,EAAAZ,EAAA27C,EAAA,SAAAoc,GACA,OAAA,IAAAA,EAAA,GAAA12D,OACAw2H,GAOAj3H,EAAAg6D,IAAAjf,EAAA,SAAAoc,GACA,OAAA,IAAAA,EAAA,GAAAn1D,KAAA,IAAAm1D,EAAA,GAAAp0D,QAAAL,IAAA,IACAu0H,GAOAj3H,EAAA8U,GAAAimC,EAAA,SAAAoc,GACA,OAAAA,EAAApzD,MAAA,IACAkzH,GAOAj3H,EAAAm6D,IAAApf,EAAA,SAAAoc,GACA,OAAAn3D,EAAA8U,GAAAqiD,GAAA5rD,MAAA,IACA0rH,8CCvCA,aAEA,IAAAC,EAAAh4H,EAAA,aAsEAc,EAAAy4D,OAAA,SAAAjyD,EAAAo3C,GACA,GAAA,mBAAAA,EAEA,OAAAA,EAAAp3C,GAIA,IAAAA,EAAA7E,WACA,OAAA6E,EAAAtE,QAAA,MAAAsE,EAAAkG,GAAA,GAAA,WAAA,YAIA,IACAvF,EADAgwH,EAAA,OAkBA,YAfA11H,IAAAm8C,IAEAA,EAAAu5E,WACAA,EAAAv5E,EAAAu5E,UAIA,iBAAAv5E,EACAz2C,EAAAy2C,EACAA,EAAAz2C,YACAA,EAAAy2C,EAAAz2C,YAKAgwH,GACA,IAAA,QACA,OAAAn3H,EAAA6Q,QAAArK,EAAAW,GAEA,IAAA,cACA,OAAAnH,EAAAgM,cAAAxF,EAAAW,GAEA,IAAA,OAGA,GAAAy2C,GAAAA,EAAAw5E,mBAAA31H,IAAAm8C,EAAAw5E,YAAArzF,YAAAtiC,IAAAm8C,EAAAw5E,YAAApzF,OAAA,CACA,IAAAqzF,EAAAH,EAAA18F,IAAAojB,EAAA,SAAAr9C,GACA,OAAAA,IAaA,OAXA82H,EAAAD,iBAAA31H,KAEAm8C,EAAAw5E,YAAArzF,QACAszF,EAAAC,SAAA92H,KAAAkF,MAAAlF,KAAAU,IAAA08C,EAAAw5E,YAAArzF,OAAAvjC,KAAAyG,YAGAxF,IAAAm8C,EAAAw5E,YAAApzF,QACAqzF,EAAAE,SAAA/2H,KAAAkF,MAAAlF,KAAAU,IAAA08C,EAAAw5E,YAAApzF,OAAAxjC,KAAAyG,OAGAyoD,QAAA0D,KAAA,2OAAAC,KAAAC,UAAA1V,GAAA,SAAAyV,KAAAC,UAAA+jE,IACAr3H,EAAAy4D,OAAAjyD,EAAA6wH,GAKA,IAAAC,EAAA15E,QAAAn8C,IAAAm8C,EAAA05E,SAAA15E,EAAA05E,UAAA,EACAC,EAAA35E,QAAAn8C,IAAAm8C,EAAA25E,SAAA35E,EAAA25E,SAAA,EAEA,GAAA/wH,EAAAP,SAAA,MAAA,IAGA,IAAAxF,EAAA+F,EAAApH,EAWA,OATAk4H,GAAA72H,GAAAA,EAAA82H,EAEA/wH,EAAAsL,oBAAA3K,GAAA0J,UAGA7Q,EAAAgM,cAAAxF,EAAAW,IAIAsN,QAAA,sBAAA,WACA,IAAAnB,EAAAiC,UAAA,GACAnW,EAAAmW,UAAA,GACA,MAAA,MAAAjC,EAAAA,EAAAlU,EAAAA,IAGA,QACA,MAAA,IAAAS,MAAA,qBAAAs3H,EAAA,kDAaAn3H,EAAAgM,cAAA,SAAAxF,EAAAW,GACA,YAAA1F,IAAA0F,EACAX,EAAAwF,cAAA7E,EAAA,GAEAX,EAAAwF,iBAWAhM,EAAA6Q,QAAA,SAAArK,EAAAW,GACA,OAAAX,EAAAqK,QAAA1J,6CCzLA,aAOA/G,EAAAJ,QAAA,SAAAO,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAAizD,cAAA,6BCRA,aAoBAl1D,EAAAJ,QAAA,SAAAO,EAAA+C,GACA,GAAA/C,EAAAoB,aAAApB,EAAA+N,aAAAhL,EAAA3B,aAAA2B,EAAAgL,YACA,MAAA,IAAAzO,MAAA,2CAGA,IAAAs3D,EAAA52D,EAAA+J,YAEA,OAAA/J,EAAA2B,SAAAoB,EAAApB,SAAAoB,EAAAkL,eAAAlL,EAAA2C,SACA,IAAAkxD,EAAA/wD,KAGA7F,EAAA0F,UAAA3C,EAAA2C,SACA1F,EAGAA,EAAAoB,YAAA2B,EAAA3B,WAKA2B,EAAAsL,GAAA,IACArO,EAAAgL,MAAA/K,KAAAoC,IAAA,EAAAU,EAAAkO,YAAA,IAGAjR,EAAAgL,MAAA,IAAA4rD,EAAA,GAAAv0D,IAAAU,IARA,IAAA6zD,EAAA/wD,gCCpCA,aAWAhG,EAAAJ,QAAA,SAAAO,EAAA+C,EAAAsvD,GAEA,GAAAA,MAAAA,EACA,OAAAryD,EAAA4L,GAAA7I,GAIA,GAAA/C,EAAA4L,GAAA7I,GACA,OAAA,EAIA,GAAA/C,EAAA2B,SAAAoB,EAAApB,QACA,OAAA,EAIA,GAAA3B,EAAAoB,YAAA2B,EAAA3B,WAAA,CAEA,IAAAswG,EAAA1xG,EAAA0B,MAAAqB,GAAAtC,MAEA,GAAAixG,EAAAhsG,SACA,OAAA,EAGA,IAAAoD,EAAA9I,EAAA+J,YAAAjB,IAAA9I,EAAAS,MAAAsC,EAAAtC,OACA,OAAAixG,EAAArkG,IAAAvE,EAAAkC,MAAAqnD,IAKA,OAAA,6BC1CA,aAqBAxyD,EAAAJ,QAAA,SAAAO,EAAA+C,GACA,GAAA/C,EAAAoB,aAAApB,EAAA+N,aAAAhL,EAAA3B,aAAA2B,EAAAgL,YACA,MAAA,IAAAzO,MAAA,iDAGA,IAAAs3D,EAAA52D,EAAA+J,YAEA,OAAA/J,EAAA2B,SAAAoB,EAAApB,SAAAoB,EAAAkL,eAAAlL,EAAA2C,SACA,IAAAkxD,EAAA/wD,KAGA7F,EAAA0F,UAAA3C,EAAA2C,SACA1F,EAGA+C,EAAA3B,WAaA2B,EAAAsL,GAAA,IACArO,EAAAmC,IAAAlC,KAAAoC,IAAA,EAAAU,EAAAkO,YAAA,IAAA/L,QAGAlF,EAAAmC,IAAA,IAAAy0D,EAAA,GAAAv0D,IAAAU,IAAAmC,QAhBAlF,EAAAiO,aACA,IAAA2oD,GAAA,GAGA52D,EAAAoB,WAIA,IAAAw1D,EAAA,GAHA,IAAAA,EAAA/wD,gCC1CA,aAOApG,EAAAopD,UAAA,SAAA5iD,GACA,MAAA,kBAAAA,6BCRA,aAEA,IAAAizE,EAAAv6E,EAAA,kBASAkB,EAAAJ,QAAA,SAAA8qB,GACA,IAAA,IAAAtrB,EAAA,EAAAA,EAAAsrB,EAAA5qB,OAAAV,IACA,GAAAi6E,EAAA3uD,EAAAtrB,IACA,OAAA,EAIA,OAAA,iDClBA,aAEA,IAAAg2D,EAAAt2D,EAAA,cAUAkB,EAAAJ,QAAA,SAAAssG,EAAAxhF,EAAArL,GACA+1C,EAAA1qC,KACAA,EAAAA,EAAA9kB,WAGA,IAAA,IAAAxG,EAAA,EAAA45E,EAAAtuD,EAAA5qB,OAAAV,EAAA45E,EAAA55E,IAAA,CACA,IAAAgH,EAAAskB,EAAAtrB,GAEA+f,MAAA2gB,QAAA15B,GACA8lG,EAAA9lG,EAAAiZ,GAEAA,EAAAjZ,+CCvBA,aAcApG,EAAAJ,QAAA,SAAAijE,EAAAn4C,EAAArL,EAAAo3F,GACA,OAAA/rF,GAAA,mBAAAA,EAAA0P,IAEA1P,EAAA0P,IAAA,SAAAj6B,GACA,OAAA0iE,EAAA1iE,EAAAkf,EAAAo3F,KAGAp3F,EAAAqL,8BCrBA,aAEA,IAAA0qC,EAAAt2D,EAAA,cAQAkB,EAAAJ,QAAA,SAAAO,GACA,OAAAgf,MAAA2gB,QAAA3/B,IAAAi1D,EAAAj1D,8CCXA,aAQAH,EAAAJ,QAAA,SAAAO,GACA,OAAAA,GAAAA,EAAA+J,YAAAjI,UAAAmzD,WAAA,6BCTA,aAEA,IAAA8rC,EAAApiG,EAAA,YAAAu7B,KAEA+6B,EAAAt2D,EAAA,0BAEA24D,EAAA34D,EAAA,0BAoCA,SAAAs4H,EAAAh2B,EAAAlpB,EAAA74D,GACA,IAAAjgB,EAAAsG,EAAAoX,EAAAukF,EAEA,GAAAnpB,GAAA,EAAA,CACA,GAAA/4D,MAAA2gB,QAAAshE,EAAA,IAQA,CAIA,IAHAC,EA2BA,SAAAD,GACA,IAEAhiG,EAAAsK,EAFA43F,EAAAF,EAAAthG,OACAytF,EAAA6T,EAAA,GAAAthG,OAEA4F,EAAA,GAEA,IAAAgE,EAAA,EAAAA,EAAA6jF,EAAA7jF,IAAA,CACA,IAAA9G,EAAA,GAEA,IAAAxD,EAAA,EAAAA,EAAAkiG,EAAAliG,IACAwD,EAAAwM,KAAAgyF,EAAAhiG,GAAAsK,IAGAhE,EAAA0J,KAAAxM,GAGA,OAAA8C,EA3CA67F,CAAAH,GACA17F,EAAA,GAEAtG,EAAA,EAAAA,EAAAiiG,EAAAvhG,OAAAV,IACAsG,EAAAtG,GAAAg4H,EAAA/1B,EAAAjiG,GAAA84E,EAAA,EAAA74D,GAGA,OAAA3Z,EAbA,IAFAoX,EAAAskF,EAAA,GAEAhiG,EAAA,EAAAA,EAAAgiG,EAAAthG,OAAAV,IACA0d,EAAAuC,EAAAvC,EAAAskF,EAAAhiG,IAGA,OAAA0d,EAcA,IAFApX,EAAA,GAEAtG,EAAA,EAAAA,EAAAgiG,EAAAthG,OAAAV,IACAsG,EAAAtG,GAAAg4H,EAAAh2B,EAAAhiG,GAAA84E,EAAA,EAAA74D,GAGA,OAAA3Z,EArDA1F,EAAAJ,QAAA,SAAAwhG,EAAAlpB,EAAA74D,GACA,IAAAgb,EAAAlb,MAAA2gB,QAAAshE,GAAAF,EAAAE,GAAAA,EAAA/mE,OAEA,GAAA69C,EAAA,GAAAA,GAAA79C,EAAAv6B,OAEA,MAAA,IAAA23D,EAAAygB,EAAA79C,EAAAv6B,QAGA,OAAAs1D,EAAAgsC,GACAA,EAAArkE,OAAAq6F,EAAAh2B,EAAAx7F,UAAAsyE,EAAA74D,IAEA+3G,EAAAh2B,EAAAlpB,EAAA74D,qGC7BA,aAEArf,EAAAJ,QAAA,SAAAJ,EAAAkK,EAAAb,EAAA1I,EAAAZ,EAAAsrF,EAAAvrF,EAAAD,EAAA2F,EAAAqiD,EAAAjhD,GAEA,IAMAqC,EAAAkzE,EAAAC,EAAAx8E,EANAivF,EAAA7uF,EAAAu7E,QACAoT,EAAA3uF,EAAA8d,OACA8wE,EAAA5uF,EAAAy7E,KAEA4Q,EAAAvsF,EAAAge,OAIA,GAAAnd,EAEA,IAAAw7E,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAI,EAFAzJ,EAAA+uF,EAAA1lF,MAEAoiF,GAEAhiF,EAAAzJ,GAAAyrF,EAEAgB,EAAAz8E,KAAAhQ,GAEAioD,GAEAlnD,EAAAf,GAAA4F,EAAA3F,EAAAgvF,EAAA5lF,GAAArC,GAAA/G,EAAA+G,EAAAioF,EAAA5lF,IAEAlJ,EAAAH,GAAAyrF,GAGA1qF,EAAAf,GAAAivF,EAAA5lF,KAIAtI,EAAAf,GAAA4F,EAAA3F,EAAAgvF,EAAA5lF,GAAAtI,EAAAf,IAAAC,EAAAc,EAAAf,GAAAivF,EAAA5lF,IAEAlJ,EAAAH,GAAAyrF,QAKA,IAAAlP,EAAAyS,EAAA1kF,GAAAkyE,EAAAwS,EAAA1kF,EAAA,GAAAjB,EAAAkzE,EAAAlzE,EAAAmzE,EAAAnzE,IAIAI,EAFAzJ,EAAA+uF,EAAA1lF,MAEAoiF,GAEAhiF,EAAAzJ,GAAAyrF,EAEAgB,EAAAz8E,KAAAhQ,IAGAG,EAAAH,GAAAyrF,6BCrDA,aAEA,SAAAn3B,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAA8B,EAAA5X,EAAA,YAAA4X,eAoDA,SAAA4zD,EAAAz9C,EAAAjQ,GACA,SAAAiQ,GAAA,WAAA6mC,EAAA7mC,QAMAnW,EAAA2gH,EAAAz6G,MAMAA,KAAA1W,OAAAjE,cASA2a,KAAAqM,SAAAhnB,YAgCA,SAAA2oE,EAAA/9C,EAAAvQ,GACA,SAAAuQ,GAAA,mBAAAA,EAAAvQ,QAOA5F,EAAAmW,EAAAvQ,IAAApW,OAAA22B,gBAAAvgB,KAAApW,OAAA22B,eAAAhQ,QAMAnW,EAAA4gH,EAAAh7G,MAMAA,KAAApW,OAAAjE,cASAqa,KAAA2M,SAAAhnB,aAUA,SAAA2rC,EAAA/gB,GACA,MAAA,WAAA6mC,EAAA7mC,IAAAA,GAAAA,EAAA3iB,cAAAhE,OAGA,IAAAmxH,EAAA,CACAv3H,QAAA,EACAyI,MAAA,GAEA+uH,EAAA,CACA7xH,UAAA,EACAG,SAAA,EACA2xH,gBAAA,GAEA33H,EAAAm5D,gBAnJA,SAAAlsC,EAAAjQ,GAEA,GAAAgxB,EAAA/gB,IAAAy9C,EAAAz9C,EAAAjQ,GACA,OAAAiQ,EAAAjQ,GAGA,GAAA,mBAAAiQ,EAAAjQ,IAAAguD,EAAA/9C,EAAAjQ,GACA,MAAA,IAAAnd,MAAA,yBAAAmd,EAAA,mBAGA,MAAA,IAAAnd,MAAA,0BAAAmd,EAAA,MA0IAhd,EAAAo5D,gBA5HA,SAAAnsC,EAAAjQ,EAAAxW,GAEA,GAAAwnC,EAAA/gB,IAAAy9C,EAAAz9C,EAAAjQ,GAEA,OADAiQ,EAAAjQ,GAAAxW,EAIA,MAAA,IAAA3G,MAAA,0BAAAmd,EAAA,MAsHAhd,EAAA0qE,eAAAA,EACA1qE,EAAA0nE,mBArEA,SAAAz6C,EAAAvQ,GACA,IAAAsuD,EAAA/9C,EAAAvQ,GACA,MAAA,IAAA7c,MAAA,wBAAA6c,EAAA,MAoEA1c,EAAAgrE,aAAAA,EACAhrE,EAAAguC,cAAAA,0CCvKA,aAEA,IAAA4pF,EAAA14H,EAAA,gBAQAc,EAAA6iD,MAAA,SAAA7tC,GAEA,IAAAk9C,EAAA,IAAA0lE,EAMA,OAJA5iH,EAAA6jF,GAAA3mC,EAAA2mC,GAAAr7C,KAAA0U,GACAl9C,EAAA6iH,IAAA3lE,EAAA2lE,IAAAr6E,KAAA0U,GACAl9C,EAAA6wC,KAAAqM,EAAArM,KAAArI,KAAA0U,GACAl9C,EAAA6+C,KAAA3B,EAAA2B,KAAArW,KAAA0U,GACAl9C,+CClBA,aAcA,SAAA8+C,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEAhV,EAAA+6C,QAAA,SAAApE,EAAAsgF,GACA,OAAA,SAAAl8E,IACA,WAAA+Y,EAAA/Y,EAAArtB,SACAqtB,EAAArtB,MAAA,IAKA,IAFA,IAAA1Z,EAAA,GAEAxU,EAAA,EAAAA,EAAA+V,UAAArV,OAAAV,IACAwU,EAAAxU,GAAA+V,UAAA/V,GAGA,IAAA6nC,EAAA4vF,EAAAA,EAAAjjH,GAAAq/C,KAAAC,UAAAt/C,GAMA,OAJAqzB,KAAA0T,EAAArtB,QACAqtB,EAAArtB,MAAA2Z,GAAAsP,EAAA78B,MAAA68B,EAAA3iC,IAGA+mC,EAAArtB,MAAA2Z,KAWArnC,EAAAw4E,iBAAA,SAAA7hC,GACA,OAAArwC,OAAAiT,KAAAo9B,EAAA2d,YAAA,IAAApJ,OAAA,SAAAl3C,EAAAuzD,GACA,IAAA1nD,GAAA0nD,EAAAxlE,MAAA,OAAA,IAAA7B,OAAA,EACA,OAAAM,KAAA6I,IAAA2K,EAAA6L,KACA,IAUA7f,EAAA83H,2BAAA,SAAAnhF,EAAA3iC,EAAA+jH,GACA,OAAAzxH,OAAAiT,KAAAo9B,EAAA2d,YAAA,IAAApJ,OAAA,SAAAl3C,EAAAuzD,GACA,IAAA1nD,GAAA0nD,EAAAxlE,MAAA,OAAA,IAAA7B,OAAA,EACA,OAAAM,KAAA6I,IAAA2K,EAAA6L,KACA,8BC/DA,aAEA7f,EAAA8qB,MAAA5rB,EAAA,WACAc,EAAA,QAAAd,EAAA,aACAc,EAAA,SAAAd,EAAA,cACAc,EAAA8jC,OAAA5kC,EAAA,YACAc,EAAAitB,OAAA/tB,EAAA,YACAc,EAAAs6B,OAAAp7B,EAAA,YACAc,EAAAkyD,QAAAhzD,EAAA,kJCRA,aAEA,IAAA4nE,EAAA5nE,EAAA,gBAEAc,EAAAu0G,QAAA,CAEAyjB,MAAA,IACA76C,MAAA,UACA86C,KAAA,IACAC,KAAA,SACAC,MAAA,UACAp3D,MAAA,UACAq3D,MAAA,UACAC,MAAA,UACAC,QAAA,IACA1lE,QAAA,YACA2lE,WAAA,eACAC,KAAA,IACAC,KAAA,SACAC,IAAA,IACAC,IAAA,QACAC,MAAA,UACAC,MAAA,UACAC,SAAA,aACAC,KAAA,IACAC,KAAA,SACAC,MAAA,IACAC,MAAA,UACAC,SAAA,aACAC,OAAA,WACAC,OAAA,WACAC,GAAA,IACAC,GAAA,OACAC,GAAA,IACAC,GAAA,OACAC,GAAA,OACA1mH,GAAA,OACA2mH,QAAA,IACAC,QAAA,IACA3X,GAAA,OACAntG,GAAA,OACA+kH,MAAA,UACAC,IAAA,IACAC,IAAA,QACAC,OAAA,WACAC,MAAA,UACAC,MAAA,UACAC,SAAA,aACAC,IAAA,IACAjgE,IAAA,QACAkgE,QAAA,YACAC,QAAA,YACAC,IAAA,QACAvgE,IAAA,QACAwgE,OAAA,WACAC,IAAA,IACAC,IAAA,QACAC,IAAA,QACA7O,IAAA,QACA8O,MAAA,UACAC,MAAA,UAEAhnD,KAAA,iBACAC,MAAA,kBAEAt0E,EAAA,IAEA0P,IAAA,UACA4rH,IAAA,UACAC,SAAA,UACA92H,SAAA,UACA+2H,GAAA,UACAC,IAAA,QACAx5H,UAAA,eAEAzB,EAAA8kE,UAAA,CACAnE,UAAA,SACAd,WAAA,KACAiB,UAAA,IACAl+D,IAAA,IACAq7D,OAAA,YAEAU,UAAA,IACAD,WAAA,IACAI,OAAA,MAEA6U,IAAA,QACApwB,SAAA,SACAr3C,OAAA,SAEA8xD,YAAA,UAEAD,UAAA,KAEAnuD,IAAA,QACArN,IAAA,IACAgQ,SAAA,IACA2kD,GAAA,eACA+H,UAAA,KACAC,gBAAA,KACAC,cAAA,MACAoP,MAAA,IACA1M,QAAA,QACAF,QAAA,IACAF,OAAA,IACAG,UAAA,QACAF,SAAA,QACA7C,OAAA,MACAG,OAAA,iBACAD,MAAA,IACA0U,IAAA,UACAn3B,IAAA,WACAo3B,GAAA,SAEA1zE,EAAAipE,gBAAA,0CACA,IAAAyyC,EAAA,CACAiO,IAAA,WAGA3pH,EAAAgnC,OAAA,SAAA1M,GACA,OAAAwsC,EAAAxsC,EAAA,CACAthB,oBAAA,KAMAhZ,EAAAynE,SAAA,SAAA9+D,EAAAysD,GAGA,OAFAA,OAAA,IAAAA,GAAAA,GAGAsmD,EAAA5kG,eAAAnO,GACA+yG,EAAA/yG,GAGA,YAAA3I,EAAAgnC,OAAAr+B,GAAA,IAGA3I,EAAAu0G,QAAAz9F,eAAAnO,GACA3I,EAAAu0G,QAAA5rG,GAGA3I,EAAAgnC,OAAAr+B,8CC9IA,aAEA,IAAAuuH,EAAAh4H,EAAA,YAgcA,SAAA0hE,EAAA1gE,GAGA,IAFA,IAAA8J,EAAA,GAEAxK,EAAA,EAAAA,EAAAU,EAAAV,IACAwK,EAAAwF,KAAA,GAGA,OAAAxF,EA3bAhK,EAAA+/C,SAAA,SAAAv5C,GACA,MAAA,iBAAAA,GASAxG,EAAAsO,UAAA,SAAA9H,GACA,MAAA,kBAAAA,KAIA7E,SAAA6E,IAAAA,IAAAhG,KAAAkF,MAAAc,IASAxG,EAAAsC,KAAA9B,KAAA8B,MAAA,SAAA/B,GACA,OAAA,EAAAA,EACA,EACAA,EAAA,GACA,EAEA,GA2EAP,EAAAy4D,OAAA,SAAAjyD,EAAAo3C,GACA,GAAA,mBAAAA,EAEA,OAAAA,EAAAp3C,GAIA,GAAAA,IAAAvC,EAAAA,EACA,MAAA,WACA,GAAAuC,KAAAvC,EAAAA,EACA,MAAA,YACA,GAAA/B,MAAAsE,GACA,MAAA,MAIA,IACAW,EADAgwH,EAAA,OAkBA,OAfAv5E,IAEAA,EAAAu5E,WACAA,EAAAv5E,EAAAu5E,UAIAn3H,EAAA+/C,SAAAnC,GACAz2C,EAAAy2C,EACA59C,EAAA+/C,SAAAnC,EAAAz2C,aACAA,EAAAy2C,EAAAz2C,YAKAgwH,GACA,IAAA,QACA,OAAAn3H,EAAA6Q,QAAArK,EAAAW,GAEA,IAAA,cACA,OAAAnH,EAAAgM,cAAAxF,EAAAW,GAEA,IAAA,cACA,OAAAnH,EAAAk7H,cAAA10H,EAAAW,GAEA,IAAA,OAGA,IAAAy2C,IAAAA,EAAAw5E,kBAAA31H,IAAAm8C,EAAAw5E,YAAArzF,YAAAtiC,IAAAm8C,EAAAw5E,YAAApzF,MAkBA,OAAAhkC,EAAA6R,YAAArL,EAAAW,EAAAy2C,GAAAA,GACAnpC,QAAA,sBAAA,WACA,IAAAnB,EAAAiC,UAAA,GACAnW,EAAAmW,UAAA,GACA,MAAA,MAAAjC,EAAAA,EAAAlU,EAAAA,IArBA,IAAAi4H,EAAAH,EAAA18F,IAAAojB,EAAA,SAAAr9C,GACA,OAAAA,IAaA,OAXA82H,EAAAD,iBAAA31H,KAEAm8C,EAAAw5E,YAAArzF,QACAszF,EAAAC,SAAA92H,KAAAkF,MAAAlF,KAAAU,IAAA08C,EAAAw5E,YAAArzF,OAAAvjC,KAAAyG,YAGAxF,IAAAm8C,EAAAw5E,YAAApzF,QACAqzF,EAAAE,SAAA/2H,KAAAkF,MAAAlF,KAAAU,IAAA08C,EAAAw5E,YAAApzF,OAAAxjC,KAAAyG,OAGAyoD,QAAA0D,KAAA,2OAAAC,KAAAC,UAAA1V,GAAA,SAAAyV,KAAAC,UAAA+jE,IACAr3H,EAAA6R,YAAArL,EAAAW,EAAAkwH,GAUA,QACA,MAAA,IAAAx3H,MAAA,qBAAAs3H,EAAA,kDAWAn3H,EAAAm7H,YAAA,SAAA30H,GAEA,IAAAzE,EAAAwS,OAAA/N,GAAAyP,cAAAlU,MAAA,sCAEA,IAAAA,EACA,MAAA,IAAAnB,YAAA,kBAAA4F,GAGA,IAAAlE,EAAAP,EAAA,GACAuR,EAAAvR,EAAA,GACAq5H,EAAAj5H,WAAAJ,EAAA,IAAA,KACAi+D,EAAA1sD,EAAApJ,QAAA,KACAkxH,IAAA,IAAAp7D,EAAAA,EAAA,EAAA1sD,EAAApT,OAAA,EACA,IAAA+iF,EAAA3vE,EAAAmB,QAAA,IAAA,IACAA,QAAA,MAAA,SAAAmsD,GAGA,OADAw6D,GAAAx6D,EAAA1gE,OACA,KACAuU,QAAA,MAAA,IACA2M,MAAA,IAAAoZ,IAAA,SAAA73B,GACA,OAAAwX,SAAAxX,KAQA,OALA,IAAAsgF,EAAA/iF,SACA+iF,EAAAzzE,KAAA,GACA4rH,KAGA,CACA94H,KAAAA,EACA2gF,aAAAA,EACAm4C,SAAAA,IAUAp7H,EAAAk7H,cAAA,SAAA10H,EAAAW,GACA,GAAAjF,MAAAsE,KAAA7E,SAAA6E,GACA,OAAA+N,OAAA/N,GAGA,IAAA60H,EAAAr7H,EAAAs7H,YAAAt7H,EAAAm7H,YAAA30H,GAAAW,GACA/H,EAAAi8H,EAAAD,SACA17H,EAAA27H,EAAAp4C,aAEAs4C,EAAAn8H,EAAA,GAAA,EAAAA,EAAAA,EAAA,EAAAA,EAAA,EAAAA,EAAA,EAAAA,EAAAA,EAAA,EAEA,GAAAY,EAAA+/C,SAAA54C,GAEAA,EAAAzH,EAAAQ,SAAAR,EAAAA,EAAAskD,OAAA4c,EAAAz5D,EAAAzH,EAAAQ,cACA,CAEA,IAAAs7H,EAAA,GAAAp8H,EAAAA,EAAAoB,KAAAQ,IAAAu6H,GAEA77H,EAAAQ,OAAA,EAAAs7H,IAAA97H,EAAAA,EAAAskD,OAAA4c,EAAA46D,GAAA97H,EAAAQ,OAAA,MAOA,IAHA,IAAAu7H,EAAAj7H,KAAAQ,IAAA5B,EAAAm8H,GACAG,EAAA,EAEA,KAAAD,GACAC,IAKA,IAAA1hC,EAAAt6F,EAAAuM,MAAAyvH,GAAA5zG,KAAA,IACA6zG,EAAA37H,EAAA+/C,SAAA54C,IAAA6yF,EAAA95F,QAAA85F,EAAAj4F,MAAA,SAAA,IAAAi4F,EAAA,GACAhxF,EAAAtJ,EAAAuM,MAAA,EAAAyvH,GAAA5zG,KAAA,IAAA6zG,EAAA,KAAA,GAAAv8H,EAAA,IAAA,IAAAm8H,EAAA11H,WACA,OAAAw1H,EAAA/4H,KAAA0G,GAUAhJ,EAAA6Q,QAAA,SAAArK,EAAAW,GACA,GAAAjF,MAAAsE,KAAA7E,SAAA6E,GACA,OAAA+N,OAAA/N,GAGA,IAAAo1H,EAAA57H,EAAAm7H,YAAA30H,GACA60H,EAAA,iBAAAl0H,EAAAnH,EAAAs7H,YAAAM,EAAAA,EAAAR,SAAA,EAAAj0H,GAAAy0H,EACAl8H,EAAA27H,EAAAp4C,aACAljF,EAAAs7H,EAAAD,SAAA,EAGAS,EAAA97H,GAAAoH,GAAA,GAiBA,OAfAzH,EAAAQ,OAAA27H,IACAn8H,EAAAA,EAAAskD,OAAA4c,EAAAi7D,EAAAn8H,EAAAQ,UAIAH,EAAA,IACAL,EAAAkhE,EAAA,EAAA7gE,GAAAikD,OAAAtkD,GACAK,EAAA,GAIAA,EAAAL,EAAAQ,QACAR,EAAA29B,OAAAt9B,EAAA,EAAA,IAAAA,EAAA,KAAA,KAGAs7H,EAAA/4H,KAAA5C,EAAAooB,KAAA,KAWA9nB,EAAAgM,cAAA,SAAAxF,EAAAW,GACA,GAAAjF,MAAAsE,KAAA7E,SAAA6E,GACA,OAAA+N,OAAA/N,GAIA,IAAA4a,EAAAphB,EAAAm7H,YAAA30H,GACA60H,EAAAl0H,EAAAnH,EAAAs7H,YAAAl6G,EAAAja,GAAAia,EACA1hB,EAAA27H,EAAAp4C,aACA7jF,EAAAi8H,EAAAD,SAEA17H,EAAAQ,OAAAiH,IACAzH,EAAAA,EAAAskD,OAAA4c,EAAAz5D,EAAAzH,EAAAQ,UAIA,IAAAstD,EAAA9tD,EAAAgQ,QACA,OAAA2rH,EAAA/4H,KAAAkrD,GAAA,EAAA9tD,EAAAQ,OAAA,IAAAR,EAAAooB,KAAA,IAAA,IAAA,KAAA,GAAA1oB,EAAA,IAAA,IAAAA,GAcAY,EAAA6R,YAAA,SAAArL,EAAAW,EAAAy2C,GACA,GAAA17C,MAAAsE,KAAA7E,SAAA6E,GACA,OAAA+N,OAAA/N,GAIA,IAAA8wH,EAAA15E,QAAAn8C,IAAAm8C,EAAA05E,SAAA15E,EAAA05E,UAAA,EACAC,EAAA35E,QAAAn8C,IAAAm8C,EAAA25E,SAAA35E,EAAA25E,SAAA,EACAn2G,EAAAphB,EAAAm7H,YAAA30H,GAEA,GAAA4a,EAAAg6G,SAAA9D,GAAAl2G,EAAAg6G,UAAA7D,EAEA,OAAAv3H,EAAAgM,cAAAxF,EAAAW,GAEA,IAAAk0H,EAAAl0H,EAAAnH,EAAAs7H,YAAAl6G,EAAAja,GAAAia,EACA1hB,EAAA27H,EAAAp4C,aACA7jF,EAAAi8H,EAAAD,SAEA17H,EAAAQ,OAAAiH,IACAzH,EAAAA,EAAAskD,OAAA4c,EAAAz5D,EAAAzH,EAAAQ,UAKAR,EAAAA,EAAAskD,OAAA4c,EAAAxhE,EAAAM,EAAAQ,OAAA,GAAAR,EAAAQ,OAAAiH,EAAAA,EAAAzH,EAAAQ,OAAA,KAGA,IAAA8/D,EAAA,EAAA5gE,EAAAA,EAAA,EAMA,OAJA4gE,GAHAtgE,EAAAkhE,GAAAxhE,GAAA4kD,OAAAtkD,IAGAQ,OAAA,GACAR,EAAA29B,OAAA2iC,EAAA,EAAA,EAAA,KAGAq7D,EAAA/4H,KAAA5C,EAAAooB,KAAA,KAaA9nB,EAAAs7H,YAAA,SAAAl6G,EAAAja,GASA,IAPA,IAAAk0H,EAAA,CACA/4H,KAAA8e,EAAA9e,KACA2gF,aAAA7hE,EAAA6hE,aACAm4C,SAAAh6G,EAAAg6G,UAEA17H,EAAA27H,EAAAp4C,aAEA97E,GAAA,GACAzH,EAAAuQ,QAAA,GACAorH,EAAAD,WACAj0H,IAGA,GAAAzH,EAAAQ,OAAAiH,GAGA,GAFAzH,EAAA29B,OAAAl2B,EAAAzH,EAAAQ,OAAAiH,GAEA,GAAA,CACA,IAAA3H,EAAA2H,EAAA,EAGA,IAFAzH,EAAAF,KAEA,KAAAE,EAAAF,IACAE,EAAA+P,MAEA,IAAAjQ,IACAE,EAAAuQ,QAAA,GACAorH,EAAAD,WACA57H,KAIAE,IADAF,KAMA,OAAA67H,GA+BAr7H,EAAAsT,OAAA,SAAA9M,GACA,OAAAA,EAAAwF,gBAAAyI,QAAA,OAAA,IACAA,QAAA,aAAA,IACAvU,QAOAF,EAAA87H,YAAAp6H,OAAA4yG,SAAA,qBAWAt0G,EAAAizF,YAAA,SAAA1yF,EAAA+C,EAAAsvD,GAEA,GAAAA,MAAAA,EACA,OAAAryD,IAAA+C,EAGA,GAAA/C,IAAA+C,EACA,OAAA,EAIA,GAAApB,MAAA3B,IAAA2B,MAAAoB,GACA,OAAA,EAIA,GAAA3B,SAAApB,IAAAoB,SAAA2B,GAAA,CAEA,IAAA2uG,EAAAzxG,KAAAQ,IAAAT,EAAA+C,GAEA,OAAA2uG,EAAAjyG,EAAA87H,aAIA7pB,GAAAzxG,KAAA6I,IAAA7I,KAAAQ,IAAAT,GAAAC,KAAAQ,IAAAsC,IAAAsvD,EAKA,OAAA,2CC1gBA,aAEA,SAAAkB,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAAsgD,EAAAp2D,EAAA,2BAcAc,EAAA4F,MAAA,SAAAA,EAAArF,GACA,IAAAk5C,EAAAqa,EAAAvzD,GAGA,GAAA,WAAAk5C,GAAA,WAAAA,GAAA,YAAAA,GAAAA,MAAAl5C,EACA,OAAAA,EAIA,GAAA,mBAAAA,EAAAqF,MACA,OAAArF,EAAAqF,QAIA,GAAA2Z,MAAA2gB,QAAA3/B,GACA,OAAAA,EAAAi6B,IAAA,SAAAh0B,GACA,OAAAZ,EAAAY,KAIA,GAAAjG,aAAAghB,KAAA,OAAA,IAAAA,KAAAhhB,EAAAyF,WACA,GAAAsvD,EAAA/0D,GAAA,OAAAA,EAEA,GAAAA,aAAA6jB,OAAA,MAAA,IAAA2X,UAAA,gBAAAx7B,GAGA,OAAAP,EAAAw6B,IAAAj6B,EAAAqF,IAUA5F,EAAAw6B,IAAA,SAAAvN,EAAAxN,GACA,IAAA7Z,EAAA,GAEA,IAAA,IAAA8R,KAAAuV,EACAjtB,EAAA8W,eAAAmW,EAAAvV,KACA9R,EAAA8R,GAAA+H,EAAAwN,EAAAvV,KAIA,OAAA9R,GAUA5F,EAAAgoD,OAAA,SAAApoD,EAAAkB,GACA,IAAA,IAAAkc,KAAAlc,EACAd,EAAA8W,eAAAhW,EAAAkc,KACApd,EAAAod,GAAAlc,EAAAkc,IAIA,OAAApd,GAUAI,EAAA0zD,WAAA,SAAAA,EAAA9zD,EAAAkB,GAEA,GAAAye,MAAA2gB,QAAAp/B,GACA,MAAA,IAAAi7B,UAAA,0CAGA,IAAA,IAAA/e,KAAAlc,EACA,GAAAd,EAAA8W,eAAAhW,EAAAkc,GACA,GAAAlc,EAAAkc,IAAAlc,EAAAkc,GAAA1S,cAAAhE,YACA7E,IAAA7B,EAAAod,KACApd,EAAAod,GAAA,IAGApd,EAAAod,GAAA1S,cAAAhE,OACAotD,EAAA9zD,EAAAod,GAAAlc,EAAAkc,IAEApd,EAAAod,GAAAlc,EAAAkc,OAEA,CAAA,GAAAuC,MAAA2gB,QAAAp/B,EAAAkc,IACA,MAAA,IAAA+e,UAAA,0CAEAn8B,EAAAod,GAAAlc,EAAAkc,GAKA,OAAApd,GAUAI,EAAAuhE,UAAA,SAAA3hE,EAAAkB,GACA,IAAAkc,EAAAxd,EAAA6L,EAEA,GAAAkU,MAAA2gB,QAAAtgC,GAAA,CACA,IAAA2f,MAAA2gB,QAAAp/B,GACA,OAAA,EAGA,GAAAlB,EAAAM,SAAAY,EAAAZ,OACA,OAAA,EAGA,IAAAV,EAAA,EAAA6L,EAAAzL,EAAAM,OAAAV,EAAA6L,EAAA7L,IACA,IAAAQ,EAAAuhE,UAAA3hE,EAAAJ,GAAAsB,EAAAtB,IACA,OAAA,EAIA,OAAA,EACA,GAAAI,aAAA0G,OAAA,CACA,GAAAiZ,MAAA2gB,QAAAp/B,MAAAA,aAAAwF,QACA,OAAA,EAGA,IAAA0W,KAAApd,EAEA,IAAAI,EAAAuhE,UAAA3hE,EAAAod,GAAAlc,EAAAkc,IACA,OAAA,EAIA,IAAAA,KAAAlc,EAEA,IAAAd,EAAAuhE,UAAA3hE,EAAAod,GAAAlc,EAAAkc,IACA,OAAA,EAIA,OAAA,EAEA,OAAApd,IAAAkB,GASAd,EAAA+7H,kBAAA,WAEA,IACA,GAAAz1H,OAAAC,eAIA,OAHAD,OAAAC,eAAA,GAAA,IAAA,CACA0W,IAAA,gBAEA,EAEA,MAAA7d,IAEA,OAAA,GAcAY,EAAA+zD,KAAA,SAAA9mC,EAAAjQ,EAAA25B,GACA,GAAA32C,EAAA+7H,oBAAA,CACA,IAEAprB,EAFAqrB,GAAA,EAIA11H,OAAAC,eAAA0mB,EAAAjQ,EAAA,CACAC,IAAA,WAMA,OALA++G,IACArrB,EAAAh6D,IACAqlF,GAAA,GAGArrB,GAEA95F,IAAA,SAAArQ,GACAmqG,EAAAnqG,EACAw1H,GAAA,GAEAx4F,cAAA,EACAC,YAAA,SAIAxW,EAAAjQ,GAAA25B,KAYA32C,EAAAg0D,SAAA,SAAA/mC,EAAA0b,GACA,IAAA3zB,EAAAiY,EAEA,GAAA0b,EAGA,IAFA,IAAAszF,EAAAtzF,EAAAvnB,MAAA,KAEA5hB,EAAA,EAAAA,EAAAy8H,EAAA/7H,OAAAV,IAAA,CACA,IAAAmJ,EAAAszH,EAAAz8H,GAEAmJ,KAAAqM,IACAA,EAAArM,GAAA,IAGAqM,EAAAA,EAAArM,GAIA,OAAAqM,GASAhV,EAAA8W,eAAA,SAAAmW,EAAA0f,GACA,OAAA1f,GAAA3mB,OAAAwQ,eAAA7W,KAAAgtB,EAAA0f,IAgBA3sC,EAAAgyD,UAAA,SAAA/kC,GACA,OAAAA,GAAA,mBAAAA,EAAA6iC,gECxRA,aAKApuD,OAAAC,SAAAD,OAAAC,UAAA,SAAA6E,GACA,MAAA,iBAAAA,GAAA7E,SAAA6E,IAKA9E,OAAAQ,MAAAR,OAAAQ,OAAA,SAAAsE,GACA,OAAAA,GAAAA,6BCZA,aAEA,SAAAstD,EAAA9+C,GAAA,OAAA8+C,EAAA,mBAAA98C,QAAA,iBAAAA,OAAAC,SAAA,SAAAjC,GAAA,cAAAA,GAAA,SAAAA,GAAA,OAAAA,GAAA,mBAAAgC,QAAAhC,EAAA1K,cAAA0M,QAAAhC,IAAAgC,OAAA3U,UAAA,gBAAA2S,IAAAA,GAEA,IAAAknH,EAAAh9H,EAAA,YAAAu5D,OAEA0jE,EAAAj9H,EAAA,yBAAAu5D,OAEAnD,EAAAp2D,EAAA,2BAQAc,EAAAggD,SAAA,SAAAx5C,GACA,MAAA,iBAAAA,GASAxG,EAAAwoD,SAAA,SAAAizD,EAAA/mG,GACA,IAAAi7B,EAAA8rE,EAAAv7G,OAAAwU,EAAAxU,OACAowC,EAAAmrE,EAAAv7G,OACA,OAAAu7G,EAAA9mG,UAAAg7B,EAAAW,KAAA57B,GAuCA1U,EAAAy4D,OAAA,SAAAjyD,EAAAo3C,GACA,GAAA,iBAAAp3C,EACA,OAAA01H,EAAA11H,EAAAo3C,GAGA,GAAA0X,EAAA9uD,GACA,OAAA21H,EAAA31H,EAAAo3C,GAKA,GAkIA,SAAAp3C,GACA,OAAAA,GAAA,WAAAstD,EAAAttD,IAAA,iBAAAA,EAAA+D,GAAA,iBAAA/D,EAAAnH,GAAA,iBAAAmH,EAAA7D,IAAA,EAnIAy5H,CAAA51H,GACA,OAAAo3C,GAAA,YAAAA,EAAA6b,SAKAjzD,EAAAX,WAHAW,EAAA+D,EAAA/D,EAAAnH,EAAA,IAAAmH,EAAA7D,EAOA,GAAA4c,MAAA2gB,QAAA15B,GACA,OA6FA,SAAA61H,EAAAvxG,EAAA8yB,GACA,CAAA,GAAAr+B,MAAA2gB,QAAApV,GAAA,CAIA,IAHA,IAAA9hB,EAAA,IACAqC,EAAAyf,EAAA5qB,OAEAV,EAAA,EAAAA,EAAA6L,EAAA7L,IACA,IAAAA,IACAwJ,GAAA,MAGAA,GAAAqzH,EAAAvxG,EAAAtrB,GAAAo+C,GAIA,OADA50C,GAAA,IAGA,OAAAhJ,EAAAy4D,OAAA3tC,EAAA8yB,IA7GAy+E,CAAA71H,EAAAo3C,GAGA,GAAA59C,EAAAggD,SAAAx5C,GACA,MAAA,IAAAA,EAAA,IAGA,GAAA,mBAAAA,EACA,OAAAA,EAAA6xD,OAAA9jD,OAAA/N,EAAA6xD,QAAA,WAGA,GAAA7xD,GAAA,WAAAstD,EAAAttD,GAAA,CACA,GAAA,mBAAAA,EAAAiyD,OACA,OAAAjyD,EAAAiyD,OAAA7a,GACA,GAAAp3C,GAAAA,EAAAX,aAAA,GAAAA,WAEA,OAAAW,EAAAX,WAEA,IAAAy7B,EAAA,GAEA,IAAA,IAAA5pB,KAAAlR,EACAA,EAAAsQ,eAAAY,IACA4pB,EAAA9xB,KAAA,IAAAkI,EAAA,MAAA1X,EAAAy4D,OAAAjyD,EAAAkR,GAAAkmC,IAIA,MAAA,IAAAtc,EAAAxZ,KAAA,MAAA,IAIA,OAAAvT,OAAA/N,IAUAxG,EAAAszD,UAAA,SAAA9sD,GAKA,IAJA,IAAAi1G,EAAAlnG,OAAA/N,GACA81H,EAAA,GACA98H,EAAA,EAEAA,EAAAi8G,EAAAv7G,QAAA,CACA,IAAAR,EAAA+7G,EAAAtxG,OAAA3K,GAEA,OAAAE,GACA48H,GAAA58H,EACAF,IAGA,MAFAE,EAAA+7G,EAAAtxG,OAAA3K,MAEA,IAAA,aAAA0K,QAAAxK,KACA48H,GAAA,MAGAA,GAAA58H,GAEA48H,GADA,MAAA58H,EACA,MAEAA,EAGAF,IAGA,MAAA,IAAA88H,EAAA,KASAt8H,EAAAgnC,OAAA,SAAAxgC,GACA,IAAAi1G,EAAAlnG,OAAA/N,GAEA,OADAi1G,EAAAA,EAAAhnG,QAAA,KAAA,SAAAA,QAAA,KAAA,UAAAA,QAAA,KAAA,SAAAA,QAAA,KAAA,QAAAA,QAAA,KAAA,6OCxKA,IAAA8nH,EAAAr9H,EAAA,YACAs9H,EAAAt9H,EAAA,YACAu9H,EAAAv9H,EAAA,i7CAKaw9H,cAET,SAAAA,EAAYC,GAAQ,IAAAzuD,EAAA,OAAA0uD,EAAAx6H,KAAAs6H,IAChBxuD,EAAA2uD,EAAAz6H,KAAA06H,EAAAJ,GAAAz8H,KAAAmC,QAFJ26H,SAAW,OAGHJ,GACAJ,EAAAS,MAAMtpE,WAANupE,EAAA/uD,GAAuByuD,GAHXzuD,aAFsBuuD,EAAAS,iEAajCC,cAKT,SAAAA,EAAYpoH,EAAQ+sB,GAAK,IAAAqsC,EAGrB,GAHqByuD,EAAAx6H,KAAA+6H,IACrBhvD,EAAA0uD,EAAAz6H,KAAA06H,EAAAK,GAAAl9H,KAAAmC,KAAM2S,EAAQ+sB,KAJlB3Y,OAASozG,EAAAS,MAAMI,kBAGUjvD,EAFzBkvD,SAAWd,EAAAS,MAAMK,WAKVlvD,EAAKkvD,SAAU,CACdlvD,EAAKmvD,WAAWC,6BAA6B,CACzCC,UAAW,SAACC,GACRtvD,EAAKuvD,MAAM,YAAaD,EAAaE,WAGzCC,SAAU,SAACH,GACPtvD,EAAKuvD,MAAM,WAAYD,EAAaE,aAI5C,IAAI79G,EAAQm9G,EAAA9uD,GACZA,EAAK0vD,mBAAqB,CACtBC,OAAQ,SAASC,EAASC,EAAqBC,GAE3C,IAAIn8F,EAAO,IAAI06F,EAAA0B,UAAUD,GACzBn+G,EAASg+G,OAAOC,EAASC,EAAqBl8F,IAElDq8F,WAAY,SAASC,GACjBt+G,EAASw9G,WAAWe,QAAQD,GAAgBE,MAAM,SAAAl/H,GAC9C0gB,EAAS49G,MAAM,gBAAiBU,EAAgB7B,EAAAS,MAAMuB,YAAYn/H,OAG1Eo/H,UAAW,SAASP,EAASQ,EAAUC,EAAUC,GAC1CF,GACC3+G,EAAS8+G,sBAAsBC,qBAAqBJ,GAExD,IAAIK,GAAYL,EACZ38F,EAAO,IAAI06F,EAAA0B,UAAUD,GACzBn+G,EAASi/G,oCAAoCj9F,EAAMg9F,EAAUJ,EAAUC,GACvEv8H,KAAKs7H,MAAM,aAAc57F,EAAK67F,YAItCx0G,EAAO61G,UAAY,SAASC,GACpBA,EAAOn9F,gBAAgBx7B,QAAU24H,EAAOn9F,KAAKhrB,eAAe,gBAAkBmoH,EAAOn9F,KAAKhrB,eAAe,kBACzGgJ,EAAS+9G,mBAAmBoB,EAAOn9F,KAAKo9F,aAAaplH,MAAM1C,KAAM6nH,EAAOn9F,KAAKq9F,gBAE7Er/G,EAASs/G,aAAaH,EAAOn9F,OAzCpB,OAAAqsC,aALWsuD,EAAA4C,uGAsD1BtqH,GAMN,OALAggG,EAAA+nB,EAAAK,EAAA96H,WAAA,YAAAD,MAAAnC,KAAAmC,KAAgB2S,GACb3S,KAAK2S,OAAOgoH,UACX36H,KAAKk9H,YAAYl9H,KAAK2S,OAAOgoH,UAG1B36H,yCAGCitD,GACRktE,EAAAr7H,IAAI+vD,SAAS5B,wCAGJtkB,GACT3oC,KAAKs7H,MAAM,OAAQ3yF,mCAInB,GAAIx1B,UAAUrV,OAAS,EACnB,MAAM,IAAI67B,UAAU,gCAExB35B,KAAK+mB,OAAOo2G,YAAY,CACpBC,oBAAuBjqH,UAAU,GACjCkqH,qBAAwBlgH,MAAMld,UAAU4J,MAAMhM,KAAKsV,UAAW,gXCjG1E,IAAAmqH,EAAAxgI,EAAA,wBACAq9H,EAAAr9H,EAAA,YACAygI,EAAAzgI,EAAA,uCACA0gI,EAAA1gI,EAAA,+BACA2gI,EAAA3gI,EAAA,mCACA4gI,EAAA5gI,EAAA,uBACA6gI,EAAA7gI,EAAA,2BACA8gI,EAAA9gI,EAAA,+BACAs9H,EAAAt9H,EAAA,YACA+gI,EAAA/gI,EAAA,qBACAghI,EAAAhhI,EAAA,oTAKag+H,EAqCT,SAAAA,EAAYP,GAAQC,EAAAx6H,KAAA86H,GAAA96H,KAhCpB26H,SAAW,KAgCS36H,KA3BpBq8H,SAAW,KA2BSr8H,KAtBpB+9H,OAAS,CAILC,uBAAuB,EAKvBC,IAAK,MAaWj+H,KAPpBk+H,kBAAoB,MAOAl+H,KAFpBm+H,iBAAkB,EAGV5D,GACAJ,EAAAS,MAAMtpE,WAAWtxD,KAAMu6H,sCAStB0C,aAWT,SAAAA,EAAYtqH,GAAqB,IAAb+sB,EAAa,EAAAvsB,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAN,KAAMqnH,EAAAx6H,KAAAi9H,GAC7Bj9H,KAAK0/B,KAAOA,EACZ1/B,KAAKo+H,UAAUzrH,GACf3S,KAAKq+H,iBAAmB,IAAIf,EAAAgB,iBAC5Bt+H,KAAKu+H,qBAAuB,IAAIZ,EAAAa,qBAAqBx+H,KAAKq+H,kBAC1Dr+H,KAAKw8H,sBAAwB,IAAIe,EAAAkB,sBAAsBz+H,KAAKq+H,iBAAkBr+H,KAAK2S,OAAO0pH,UAC1Fr8H,KAAK0+H,kBAAoB,IAAIjB,EAAAkB,kBAAkB3+H,KAAK0/B,KAAM1/B,KAAKq+H,kBAC/Dr+H,KAAKk7H,WAAa,IAAIwC,EAAAkB,YAAY5+H,KAAKu+H,qBAAsBv+H,KAAKw8H,sBAAuB,CACrFqC,UAAW7+H,KAAK2S,OAAOorH,OAAOE,IAC9Ba,eAAgB9+H,KAAK2S,OAAOurH,kBAC5BC,gBAAiBn+H,KAAK2S,OAAOwrH,kBAEjCn+H,KAAK++H,cAAgB,IAAIvB,EAAAwB,cAAch/H,KAAKq+H,kBAC5Cr+H,KAAKi/H,yBAA2B,IAAInB,EAAAoB,kHAG9BvsH,GAEN,OADA3S,KAAK2S,OAAS,IAAImoH,EAA0BnoH,GACrC3S,qCAGH0/B,GACJ1/B,KAAK0/B,KAAOA,EACZ1/B,KAAK0+H,kBAAkB5oF,QAAQpW,uCAM/B,OAAO1/B,KAAKm/H,mCAALznH,MAAA1X,KAA2CmT,sEAUnBupH,GAAgD,IAAA5wD,EAAA9rE,KAAtCs8H,EAAsC,EAAAnpH,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAApBopH,IAAoB,EAAAppH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAC/E,OAAO4G,QAAQC,UAAUO,KAAK,WAC1B,GAAIuxD,EAAKn5D,OAAOorH,OAAOC,sBAAuB,CAC1C,IAAIh5D,EAAS,CACTs3D,SAAUA,EACVC,YAAaA,GAKjB,OAHKG,IACD13D,EAAOq3D,SAAWvwD,EAAKszD,iBAAiB74H,MAErCulE,EAAK4vD,OAAO,YAAa12D,EAAQ8G,EAAKpsC,MAAM,GAAOnlB,KAAK,SAAC8gH,GAC5D,IAAI96H,EAAI86H,EAAahoF,UACrBy4B,EAAKpsC,KAAK2/F,WAAW9+H,KAG7B,OAAOurE,EAAK6wD,oCAAoC7wD,EAAKpsC,KAAMg9F,EAAUJ,EAAUC,KAChFhiH,KAAK,WACJuxD,EAAKwzD,oBAAoBxzD,EAAKpsC,oEAKFA,EAAMg9F,GAAgD,IAAA3wD,EAAA/rE,KAAtCs8H,EAAsC,EAAAnpH,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAApBopH,IAAoB,EAAAppH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAEtFnT,KAAKw8H,sBAAsB+C,8BAA8B7/F,EAAK8/F,yBAC9D9/F,EAAK+/F,kBAAoB,IAErBnD,GAAYC,IACZv8H,KAAKu+H,qBAAqBmB,gBAAgBhgG,EAAM48F,EAAUC,GAG9D,IAAIoD,EAAc3/H,KAAKi/H,yBAAyB9wB,SAASzuE,EAAK8/F,yBAC1DI,EAAgB5/H,KAAKo/H,iBAAiBQ,cAG1ClgG,EAAKmgG,WAAWvoH,QAAQ,SAAArZ,GACpB,IAAI6hI,EAAK/zD,EAAKgzD,cAAc5wB,SAASzuE,EAAKqgG,qBAAqB9hI,IAC/DyhC,EAAK+/F,kBAAkBryH,KAAK0yH,IACxBA,EAAGE,WAAeJ,IAAiBD,GACnC5zD,EAAKywD,sBAAsByD,cAAchiI,EAAMy+H,8CASvD,OAAO18H,KAAKw8H,sBAAsB0D,yDAOjB7D,GAEjB,OADAr8H,KAAK2S,OAAO0pH,SAAWA,EAChBr8H,KAAKw8H,sBAAsBC,qBAAqBJ,wCAQ9CV,GACT,OAAO37H,KAAKk7H,WAAWiF,aAAaxE,+CAOpB9wG,GAChB,OAAO7qB,KAAK0+H,kBAAkB0B,oBAAoBv1G,mCAS9C6U,GAEJ,OADIA,EAAOA,GAAQ1/B,KAAK0/B,MACZ+/F,kBAAkBl5E,MAAM,SAAAu5E,GAAE,OAAEA,EAAGE,2CAUxCz5H,EAAM85H,EAAiB3gG,GAA+C,IAAzC4gG,IAAyC,EAAAntH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACzE,OAAOnT,KAAKk7H,WAAWqF,IAAIh6H,EAAM85H,EAAiB3gG,GAAQ1/B,KAAK0/B,KAAM4gG,qDAU/C/5H,EAAM85H,EAAiBG,GAA0B,IAAAC,EAAAzgI,KACvE,OAAOA,KAAK07H,OAAOn1H,EAAM85H,GAAiB9lH,KAAK,SAAAmmH,GAC3C,OAAO,IAAI9C,EAAA+C,mBAAmBF,EAAKvF,WAAYwF,EAAIF,iDAKvD,OAAOxgI,KAAKw8H,sBAAsB98C,qDAGf28C,GACnB,OAAOr8H,KAAKw8H,sBAAsBoE,uBAAuBvE,sCAGlDA,GACP,OAAOr8H,KAAKw8H,sBAAsBqE,WAAWxE,wCAIpC38F,IACTA,EAAOA,GAAQ1/B,KAAK0/B,MACfohG,iBACL,IAAIlgI,EAAM8+B,EAAKqhG,iBAKf,OAJArhG,EAAKqhG,iBAAmB/gI,KAAK8iD,KAAKpjB,EAAKshG,kBACvCthG,EAAKshG,iBAAmBhhI,KAAK8iD,KAAKliD,GAClC8+B,EAAK8/F,wBAA0Bx/H,KAAK8iD,KAAKpjB,EAAK8/F,yBAC9Cx/H,KAAKw8H,sBAAsByE,WACpBjhI,KAAKm/H,oCAAmC,gCAG9C3hI,GACD,OAAGA,GAAKqE,EAAAA,EACG,EAGH,GAALrE,EACQqE,EAAAA,EAGJ7B,KAAKq+H,iBAAiB6C,UAAU5D,EAAAgB,iBAAiBx0H,OAAO,EAAGtM,gDAGlDkiC,GAA8B,IAAAyhG,EAAAnhI,KAAxBohI,EAAwB,EAAAjuH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAN,KAExC,GADAusB,EAAOA,GAAQ1/B,KAAK0/B,KAChB0hG,EACA,OAAOphI,KAAKqhI,cAAc3hG,EAAM0hG,GAGpC1hG,EAAK0oC,MAAM9wD,QAAQ,SAAAra,GACfkkI,EAAKG,wBAAwBrkI,KAEjCyiC,EAAK6hG,MAAMjqH,QAAQ,SAAAta,GACfmkI,EAAKK,wBAAwBxkI,qDAIb2kE,GAAM,IAAA8/D,EAAAzhI,KAC1B2hE,EAAK+/D,qBAAqBpqH,QAAQ,SAAAra,GAAC,OAAE0kE,EAAKggE,aAAa1kI,EAAGwkI,EAAKjF,sBAAsBoF,oBAAoBjgE,EAAM1kE,sDAG3FD,GAAG,IAAA6kI,EAAA7hI,KACvBhD,EAAE0kI,qBAAqBpqH,QAAQ,SAAAra,GAAC,OAAED,EAAE2kI,aAAa1kI,EAAG4kI,EAAKrF,sBAAsBsF,oBAAoB9kI,EAAGC,4CAG5FmkI,EAAiB1hG,GAAM,IAAAqiG,EAAA/hI,MAGjC0/B,EAAOA,GAAQ1/B,KAAK0/B,MACf0oC,MAAM9wD,QAAQ,SAAAra,GACfA,EAAE+kI,uBAENtiG,EAAK6hG,MAAMjqH,QAAQ,SAAAta,GACfA,EAAEglI,uBAENtiG,EAAKmgG,WAAWvoH,QAAQ,SAACrZ,GAAD,OAAQ8jI,EAAKE,qBAAqBhkI,EAAMmjI,kDAG/Cz/D,EAAMugE,GAAQ,IAAAC,EAAAniI,KAC/B,GAAI2hE,aAAgBy4D,EAAAgI,OAAMC,aAA1B,CACI,IAAIC,EAAWzE,EAAA0E,OAAOC,YAAYN,EAAQvgE,GAE1C,GAAI2gE,EAAU,CACV3gE,EAAKggE,aAAa,WAAW,GAC7B,IAAIc,EAAY9gE,EAAK+gE,WAAWJ,EAASK,eAEzC,OADAF,EAAUd,aAAa,WAAW,GAC3B3hI,KAAKiiI,qBAAqBQ,EAAUhgE,UAAWy/D,SAGpDvgE,aAAgBy4D,EAAAgI,OAAMQ,YAC5BjhE,EAAKggE,aAAa,WAAW,GAC7BhgE,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpBA,EAAE2kI,aAAa,WAAW,GAC1BQ,EAAKF,qBAAqBjlI,EAAEylE,UAAWy/D,MAEtCvgE,aAAgBy4D,EAAAgI,OAAMS,cAC3BlhE,EAAKggE,aAAa,WAAW,8lBC1TzC,IAAArE,EAAAxgI,EAAA,kMACagmI,6NAEO97H,EAAKC,EAAKnJ,GACtB,IAAIilI,EAASzF,EAAAgB,iBAAiBnuH,SAASlJ,EAAKD,GACxCgQ,EAAS,CAAChQ,GAEd,KADYlJ,EAAS,GAEjB,OAAOkZ,EAIX,IAFA,IAAIu+B,EAAO+nF,EAAAgB,iBAAiBx0H,OAAOi5H,EAAOjlI,EAAS,GAC/CyzD,EAAOvqD,EACF5J,EAAI,EAAGA,EAAIU,EAAS,EAAGV,IAC5Bm0D,EAAO+rE,EAAAgB,iBAAiBn+H,IAAIoxD,EAAMhc,GAClCv+B,EAAO5J,KAAKkwH,EAAAgB,iBAAiB0E,QAAQzxE,IAGzC,OADAv6C,EAAO5J,KAAKnG,GACL+P,oMCjBf,IAAAsmH,EAAAxgI,EAAA,wBACAs9H,EAAAt9H,EAAA,YACAq9H,EAAAr9H,EAAA,sLAGa0hI,aAET,SAAAA,EAAYH,gGAAiB7D,CAAAx6H,KAAAw+H,GACzBx+H,KAAKq+H,iBAAmBA,uFAGtB3+F,GACFA,EAAK0oC,MAAM9wD,QAAQ,SAAAra,GACfA,EAAEgmI,wBAENvjG,EAAK6hG,MAAMjqH,QAAQ,SAAAta,GACfA,EAAEimI,0DAIAvjG,EAAMzhC,GACZyhC,EAAKqgG,qBAAqB9hI,GAAMqZ,QAAQ,SAAAra,GACpCA,EAAEgmI,sBACFhmI,EAAEylI,WAAWprH,QAAQ,SAAAta,GACjBA,EAAEimI,kEAKEvjG,GAAwD,IAAAosC,EAAA9rE,KAAlDs8H,IAAkD,EAAAnpH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAnCopH,IAAmC,EAAAppH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAjB+vH,EAAiB,EAAA/vH,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GACpEgnH,EAAAr7H,IAAIsuD,MAAM,4BAA4BkvE,EAAS,gBAAgBC,GAC5DD,GACCt8H,KAAKmjI,eAAezjG,GAGxBA,EAAKmgG,WAAWvoH,QAAQ,SAAAra,GACpB6uE,EAAKs3D,UAAU1jG,EAAMziC,GACrB6uE,EAAKu3D,uBAAuB3jG,EAAMziC,EAAGq/H,EAAUC,EAAY2G,4CAKpDxjG,GACXA,EAAK4jG,uBACL5jG,EAAK6jG,YAAa,EAClB,IACI7jG,EAAK8jG,WAAa,KAClBxjI,KAAKq+H,iBAAiBjoE,KAAK12B,EAAKhiC,MAAM,EAAOgiC,EAAK+jG,iBACrD,MAAOzmI,GACJ0iC,EAAK8jG,WAAaxmI,sCAIf0mI,GAAiB,IAAXnsH,EAAW,EAAApE,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EACrB,OAAImqH,EAAAgB,iBAAiBqF,wBAAwBD,EAAKE,OAAOrsH,IAC9C,KAEJvX,KAAKq+H,iBAAiBjoE,KAAKstE,EAAKE,OAAOrsH,IAAQ,EAAMmsH,EAAKG,WAAWJ,gEAGzD/jG,EAAMiiC,GAAwD,IAAAoK,EAAA/rE,KAAlDs8H,IAAkD,EAAAnpH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAnCopH,IAAmC,EAAAppH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAjB2wH,EAAiB,EAAA3wH,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAIjF,KAHIwuD,EAAK8hE,iBAAmBK,GAAaxH,IACrCt8H,KAAK+jI,iBAAiBrkG,EAAMiiC,GAE7B26D,IACC36D,EAAK4hE,YAAa,EACf5hE,EAAKjkE,MACJ,IACIikE,EAAK6hE,WAAa,KAClBxjI,KAAKq+H,iBAAiBjoE,KAAKuL,EAAKjkE,MAAM,EAAOikE,EAAK8hE,iBACrD,MAAOzmI,GACJ2kE,EAAK6hE,WAAaxmI,EAClBm9H,EAAAr7H,IAAIsuD,MAAMpwD,GAKtB,GAAGu/H,EAAY,CACX,IAAI3lE,EAAQ+K,EAAK8hE,gBACbO,EAAe1G,EAAAgB,iBAAiBlvH,SAAS,GACzC60H,EAAW,GACXC,GAAc,EA2ClB,GAzCAviE,EAAK+gE,WAAWprH,QAAQ,SAAAta,GAcpB,GAbAA,EAAE4mI,OAAOtsH,QAAQ,SAAC6sH,EAAWC,GACzB,IAAI79F,EAAO,UAAY69F,EAAc,IACrC,GAAGpnI,EAAEqnI,aAAa99F,GAAM,GAAM,GAC1B,IACIvpC,EAAEsnI,cAAc,KAAM/9F,EAAMwlC,EAAKw4D,WAAWvnI,EAAGonI,IAClD,MAAOpvE,OAQb2M,aAAgBy4D,EAAAgI,OAAMQ,WAAW,CAChC,GAAGtF,EAAAgB,iBAAiBkG,OAAOxnI,EAAEynI,aAEzB,YADAR,EAAU72H,KAAKpQ,GAInB,GAAGsgI,EAAAgB,iBAAiBqF,wBAAwB3mI,EAAEynI,aAE1C,OADAtK,EAAAr7H,IAAIkyD,KAAK,kDAAmDh0D,GACrD,KAGX,GAAGA,EAAEqnI,aAAa,eAAe,GAAM,GACnC,IACI,IAAIr2B,EAAOjiC,EAAKsyD,iBAAiBjoE,KAAKp5D,EAAEynI,aAAa,EAAM7tE,GAC3D55D,EAAEsnI,cAAc,KAAM,cAAet2B,GACrCg2B,EAAiB1G,EAAAgB,iBAAiBn+H,IAAI6jI,EAAgBh2B,GACzD,MAAOh5C,GACJkvE,GAAc,OAGlBA,GAAc,KAOvBviE,aAAgBy4D,EAAAgI,OAAMQ,WAGrB,GAFkBqB,EAAUnmI,SAAWomI,GAA6C,GAA7BF,EAAeh0H,QAAQ,IAAWg0H,EAAeh0H,QAAQ,IAAM,EAEtG,CACZ,IAAIi1B,EAAOq4F,EAAAgB,iBAAiBx0H,OAAOwzH,EAAAgB,iBAAiBnuH,SAAS,EAAG6zH,GAAiBC,EAAUnmI,QAC3FmmI,EAAU3sH,QAAQ,SAAAta,GACdA,EAAEsnI,cAAc,KAAM,cAAer/F,KAKjD08B,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpB+uE,EAAKs3D,uBAAuB3jG,EAAM1iC,EAAEylE,UAAW65D,EAAUC,EAAauH,+CAKjEpkG,EAAMiiC,GACnB,IAAI75B,EAAS65B,EAAK+iE,QACdC,EAAc78F,EAAOA,EAAO27F,gBAAkB/jG,EAAK+jG,gBACvD9hE,EAAK8hE,gBAAkBtJ,EAAAS,MAAM70E,UAAU4+E,sNChJ/C,IAAAC,EAAA9nI,EAAA,yBAAAoH,OAAAiT,KAAAytH,GAAAttH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA+pH,EAAAtvH,QACA,IAAA+kH,EAAAv9H,EAAA,0BAAAoH,OAAAiT,KAAAkjH,GAAA/iH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAw/G,EAAA/kH,QACA,IAAAqoH,EAAA7gI,EAAA,2BAAAoH,OAAAiT,KAAAwmH,GAAArmH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA8iH,EAAAroH,QACA,IAAAgG,EAAAxe,EAAA,gBAAAoH,OAAAiT,KAAAmE,GAAAhE,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAS,EAAAhG,2OCHA,IAAA6kH,EAAAr9H,EAAA,YACA+nI,EAAA/nI,EAAA,+BACAgoI,EAAAhoI,EAAA,o1BAEaioI,sZAAiCF,EAAAG,yGAGtChlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,KAAMJ,EAAAK,eAAeC,OAAQ,EAAG,GAAG,IACpFplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeC,SAC5EplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,4BAA6BJ,EAAAK,eAAeE,UAC7FrlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,mBAAoBJ,EAAAK,eAAeG,mBAAmB7wH,IAAI,uBAAwB,SAAC5B,EAAG0yH,GACnI,OAAY,GAAL1yH,GAAUA,GAAKiyH,EAAAI,uBAAuBM,wBAAwBD,EAAO,qBAEhFvlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,gBAAiBJ,EAAAK,eAAeG,mBAAmB7wH,IAAI,uBAAwB,SAAC5B,EAAG0yH,GAChI,OAAY,GAAL1yH,GAAUA,GAAKiyH,EAAAI,uBAAuBM,wBAAwBD,EAAO,mBAAyB1yH,GAAKiyH,EAAAI,uBAAuBM,wBAAwBD,EAAO,qBAEpKvlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,mBAAoBJ,EAAAK,eAAeG,mBAAmB7wH,IAAI,uBAAwB,SAAC5B,EAAG0yH,GACnI,OAAY,GAAL1yH,GAAUA,GAAKiyH,EAAAI,uBAAuBM,wBAAwBD,EAAO,iEAOhFvlI,KAAK0pB,OAAS,CACV+mB,GAAI0pF,EAAAS,MAAM6K,OACVC,iBAAkB,OAClBC,iBAAkB,SAClBC,2BAA2B,EAC3B7E,iBAAkB,EAClB8E,cAAe,EACf7E,iBAAkBn/H,EAAAA,mTC/B9B,IAAAikI,EAAAhpI,EAAA,2BACA+gI,EAAA/gI,EAAA,4BAEAipI,GADAjpI,EAAA,wBACAA,EAAA,2BACAkpI,EAAAlpI,EAAA,40BAGampI,cAET,SAAAA,EAAYC,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAAimI,IACpEn6D,EAAA2uD,EAAAz6H,KAAA06H,EAAAuL,GAAApoI,KAAAmC,KAAM,eAAgBkmI,EAAe3H,EAAsB/B,KACtD2J,YAF+Dr6D,8OAFxCg6D,EAAAM,+FAQ5BpmI,KAAKqmI,cAAgB,IAAIN,EAAAO,cAActmI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,uBAC3Fx8H,KAAKumI,QAAQvmI,KAAKqmI,2DAGF38G,GAChB,OAAO,IAAIs8G,EAAAjB,yBAAyBr7G,iDAIpC,MAAO,CACHykF,SAAU,SAACzuE,GAAD,OAAqC,IAA3BA,EAAKmgG,WAAW/hI,oDAIzB0oI,EAAWC,GAAmC,IAApBC,IAAoB,EAAAvzH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACzD6D,EAAS,GACb,GAAI0vH,EAAa,CACb,IAAIC,EAAU,CAAC,YAAa,SAAUH,EAAUI,YAAY,GAAIJ,EAAUI,YAAY,GAAI,eAAgB,wBAAyB,WAAY,UAAW,8BAC1J5vH,EAAO5J,KAAKu5H,GAoBhB,OAjBAH,EAAU9xD,KAAKp9D,QAAQ,SAAA69D,GACnBA,EAAI0xD,SAASvvH,QAAQ,SAAA4qH,GACjB,IAAI4E,EAAW,CACX3xD,EAAI1kC,GACJotF,EAAA0E,OAAOwE,eAAe7E,EAAQuE,EAAc/8G,OAAOk8G,2BACnDzwD,EAAI6xD,QAAQ,GACZ7xD,EAAI6xD,QAAQ,GACZ7xD,EAAI8xD,YACwB,OAA5B9xD,EAAI+xD,oBAA+B,KAAO/xD,EAAI+xD,oBAAoB,GAAK,KAAO/xD,EAAI+xD,oBAAoB,GACtG/xD,EAAIgyD,SACJhyD,EAAIiyD,QACJjyD,EAAIkyD,yBAERrwH,EAAO5J,KAAK05H,OAIb9vH,0VCrDf,IAAAswH,EAAAxqI,EAAA,wBACAyqI,EAAAzqI,EAAA,8BACA0qI,EAAA1qI,EAAA,2CACAwgI,EAAAxgI,EAAA,wBACA0gI,EAAA1gI,EAAA,yCACAA,EAAA,+pCAEawpI,cACT,SAAAA,EAAYJ,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAAsmI,IACpEx6D,EAAA2uD,EAAAz6H,KAAA06H,EAAA4L,GAAAzoI,KAAAmC,KAAM,iBAAkBkmI,KACnB3H,qBAAuBA,EAC5BzyD,EAAK0wD,sBAAwBA,EAC7B1wD,EAAKizD,cAAgB,IAAIvB,EAAAwB,cAJ2ClzD,8OADzCw7D,EAAAG,wFAQrBC,EAAelB,GAAW,IAAAz6D,EAAA/rE,KAC5B0/B,EAAOgoG,EAAcr0F,UACrB2xB,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YAC5BpE,KAAKw8H,sBAAsBC,qBAAqBJ,GAChD,IAAIz5C,EAAO5iF,KAAKw8H,sBAAsB0D,YAClC0H,EAAWloG,EAAKmgG,WAAW,GAG3BgH,EAFoB,IAAIW,EAAAK,kBAAkBD,GAEbf,SAG7BiB,EAAe9nI,KAAK8nI,aAAellD,EAAKklD,aAK5C,GAHA9nI,KAAKu+H,qBAAqBmB,gBAAgBhgG,IACjC1/B,KAAK++H,cAAc5wB,SAASzuE,EAAKqgG,qBAAqB6H,IAEvD5H,UACJ,OAAO0H,EAGX,IAAI13H,EAAU,SAACxS,EAAGkB,GAAJ,OAAUopI,EAAa,IAAOppI,EAAEsoI,QAAQ,GAAKxpI,EAAEwpI,QAAQ,MAAUc,EAAa,IAAOtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,KAExHtyD,EAAOmyD,EAASzuG,IAAI,SAAA8pG,GAEpB,OADAn2D,EAAKywD,sBAAsByD,cAAc2H,GAAU,EAAO1F,GACnD,CACH2E,SAAU,CAAC3E,GACX8E,QAASY,EAAStD,cAAcjI,EAAU,UAAUxyH,QACpDo9H,YAAa,KACbC,oBAAqB,KACrBC,SAAU,KACVC,SAAS,EACTC,yBAAyB,KAE9Bh7F,KAAKr8B,IAER0kE,EAAOA,EAAK5rB,OAAO,SAACi/E,EAAeC,EAAczwH,EAAOmR,GACpD,IAAIq/G,EAAcjqI,OACd,MAAO,CAACkqI,GAGZ,IACoCC,EADhC52E,EAAO02E,EAAcA,EAAcjqI,OAAO,GAC9C,OAAkC,GAA/BkS,EAAQqhD,EAAM22E,GAIVD,EAAcnmF,OAAOomF,KAHxBC,EAAA52E,EAAKw1E,UAASz5H,KAAdsK,MAAAuwH,EAAAC,EAAsBF,EAAanB,WAC5BkB,IAGZ,KAEE17F,KAAK,SAAC7uC,EAAGkB,GAAJ,OAASopI,EAAa,IAAOtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,MAAUc,EAAa,IAAQtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,MACxHtyD,EAAKp9D,QAAQ,SAACva,EAAGK,GACbL,EAAE0zC,GAAKrzC,EAAE,IAGbs3E,EAAKroC,KAAK,SAAC7uC,EAAGkB,GAAJ,OAAUopI,EAAa,IAAOtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,MAAUc,EAAa,IAAQtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,MAEzH,IAAImB,GAAYL,EAAa,IAAKjmI,EAAAA,GAC9BumI,EAAc,KAEd9/H,EAAK,SAAC9K,EAAGkB,GAAJ,OAAcA,EAAJlB,GAChBsqI,EAAa,GAAG,IACfx/H,EAAK,SAAC9K,EAAGkB,GAAJ,OAAUlB,EAAIkB,IAGvBg2E,EAAKp9D,QAAQ,SAACva,EAAGK,GACTkL,EAAIvL,EAAEiqI,QAAQ,GAAImB,IAClBA,EAAWprI,EAAEiqI,QAAQ,GACrBoB,EAAcrrI,GACRqrI,IACNrrI,EAAEkqI,YAAcmB,EAAY33F,MAIpCnoC,EAAK,SAAC9K,EAAGkB,GAAJ,OAAUlB,EAAIkB,GACE,EAAlBopI,EAAa,IAAUA,EAAa,GAAK,EACxCx/H,EAAK,SAAC9K,EAAGkB,GAAJ,OAAUlB,EAAIkB,GACdopI,EAAa,GAAK,GAAuB,EAAlBA,EAAa,GACzCx/H,EAAK,SAAC9K,EAAGkB,GAAJ,OAAUlB,EAAIkB,GACdopI,EAAa,GAAG,IACrBx/H,EAAK,SAAC9K,EAAGkB,GAAJ,OAAcA,EAAJlB,IAGnB,IAAI6qI,EAAoB,KAGxB3zD,EAAKlyB,OAAO,SAAAzlD,GAAC,OAAGA,EAAEkqI,cAAa56F,KAAK,SAAC7uC,EAAGkB,GAAJ,OAAWopI,EAAa,IAAMtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,MAAM1vH,QAAQ,SAACva,EAAGK,EAAGwK,GAC5G,GAAKxK,EAAL,CAKA,IAAIi0D,EAAOzpD,EAAIxK,EAAI,GAEnBL,EAAEoqI,SAAWp7D,EAAKu8D,YAAYvrI,EAAGs0D,GAC7Bj0D,EAAI,IAIJirI,IACAA,EAAoBzgI,EAAIxK,EAAI,IAG7BkL,EAAIvL,EAAEoqI,SAAS91E,EAAK81E,WACnB91E,EAAK81E,SAAW,KAChB91E,EAAK61E,oBAAsB,CAACmB,EAAkB53F,GAAI1zC,EAAE0zC,IACpD1zC,EAAEoqI,SAAWp7D,EAAKu8D,YAAYvrI,EAAGsrI,IAEjCA,EAAoBh3E,QApBpBt0D,EAAEoqI,SAAW,IAwBrB,IAAIpG,EAAmB/7D,EAAO5gE,MAAM,oBAChCyhI,EAAgB7gE,EAAO5gE,MAAM,iBAC7B48H,EAAmBh8D,EAAO5gE,MAAM,oBAGhCmkI,EAAc,KACdC,EAAiB,KAyCrB,OAxCA9zD,EAAK7qE,QAAQ24C,OAAO,SAAAzlD,GAAC,OAAGA,EAAEkqI,cAAgBlqI,EAAEmqI,sBAAqB76F,KAAK,SAAC7uC,EAAGkB,GACtE,IAAI0B,EAAM5C,EAAE2pI,SAAWzoI,EAAEyoI,SACzB,OAAO/mI,GAAY0nI,EAAa,IAAMtqI,EAAEwpI,QAAQ,GAAKtoI,EAAEsoI,QAAQ,MAChE1vH,QAAQ,SAAC69D,EAAK/3E,EAAGwK,GAEbutE,EAAIgyD,SAAWpG,IACdwH,EAAepzD,GAEhBA,EAAIgyD,SAAWtB,IACd2C,EAAkBrzD,GAGtBA,EAAIiyD,QAAUjyD,EAAIgyD,UAAYpG,GAAoB5rD,EAAIgyD,UAAYnG,EAClE7rD,EAAIkyD,wBAA0BlyD,EAAIgyD,UAAYtB,IAG/C0C,IACCA,EAAYnB,SAAU,GAGvBoB,IACCA,EAAenB,yBAA0B,GAG7C3yD,EAAKp9D,QAAQ,SAAA69D,GACTA,EAAI6xD,QAAQ,GAAM1J,EAAAgB,iBAAiB0E,QAAQ7tD,EAAI6xD,QAAQ,IACvD7xD,EAAI6xD,QAAQ,GAAM1J,EAAAgB,iBAAiB0E,QAAQ7tD,EAAI6xD,QAAQ,IACvD7xD,EAAIgyD,SAA4B,OAAjBhyD,EAAIgyD,SAAoB,KAAO7J,EAAAgB,iBAAiB0E,QAAQ7tD,EAAIgyD,YAG/EX,EAAU9mG,KAAO,CACbknG,YAAalnG,EAAKknG,YAAY/8H,QAC9Bi+H,aAAeA,EACfpzD,KAAMA,EAAKroC,KAAK,SAAC7uC,EAAGkB,GAAJ,OAASlB,EAAEizC,GAAK/xC,EAAE+xC,KAClCswF,iBAAkBzD,EAAAgB,iBAAiB0E,QAAQjC,GAC3C8E,cAAevI,EAAAgB,iBAAiB0E,QAAQ6C,GACxC7E,iBAAkB1D,EAAAgB,iBAAiB0E,QAAQhC,IAG/C0G,EAAce,WAAalB,EAAAmB,WAAWC,UAC/BjB,sCAGC3qI,EAAGs0D,GACX,IAAI9wD,EAAI+8H,EAAAgB,iBAAiBnuH,SAASpT,EAAEiqI,QAAQ,GAAI31E,EAAK21E,QAAQ,IACzD/pI,EAAIqgI,EAAAgB,iBAAiBnuH,SAASpT,EAAEiqI,QAAQ,GAAI31E,EAAK21E,QAAQ,IAC7D,OAAS,GAALzmI,EACGtD,EAAE,GACQ4E,EAAAA,EAENA,EAAAA,EAEJzD,KAAKQ,IAAI0+H,EAAAgB,iBAAiBx0H,OAAO7M,EAAGsD,8ZCzLnD,IAAA45H,EAAAr9H,EAAA,YACA+nI,EAAA/nI,EAAA,+BACAgoI,EAAAhoI,EAAA,o1BACa8rI,sZAA+B/D,EAAAG,yGAGpChlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,KAAMJ,EAAAK,eAAeC,OAAQ,EAAG,GAAG,IACpFplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeC,QAAQ3wH,IAAI,YAAY,IACpGzU,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeE,UAC5ErlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,cAAeJ,EAAAK,eAAeE,sDAI/ErlI,KAAK0pB,OAAS,CACV+mB,GAAI0pF,EAAAS,MAAM6K,OACVpJ,SAAU,KACVC,UAAU,EACVC,aAAa,+SCjBzBz/H,EAAA,2BACAA,EAAA,qBACAA,EAAA,2BAFA,IAGA0gI,EAAA1gI,EAAA,sCAEA+rI,GADA/rI,EAAA,iCACAA,EAAA,+BACAgsI,EAAAhsI,EAAA,+zBAEaisI,cAET,SAAAA,EAAY7C,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAA+oI,IACpEj9D,EAAA2uD,EAAAz6H,KAAA06H,EAAAqO,GAAAlrI,KAAAmC,KAAM,YAAakmI,KACd8C,eAAgB,EACrBl9D,EAAKyyD,qBAAuBA,EAC5BzyD,EAAK0wD,sBAAwBA,EAC7B1wD,EAAKizD,cAAgB,IAAIvB,EAAAwB,cAL2ClzD,8OAF1Cg9D,EAAAG,uFAUpBC,GACN,IAAIxpG,EAAOwpG,EAAU71F,UACjB2xB,EAASkkE,EAAUzC,cACnBpK,EAAWr3D,EAAO5gE,MAAM,YACxBs4H,GAAYL,EAKhB,OAJGA,GACCr8H,KAAKw8H,sBAAsBC,qBAAqBJ,GAEpDr8H,KAAKm/H,mCAAmCz/F,EAAMg9F,EAAU13D,EAAO5gE,MAAM,YAAa4gE,EAAO5gE,MAAM,gBACxF8kI,6DAGwBxpG,EAAMg9F,EAAUJ,EAAUC,GAAa,IAAAxwD,EAAA/rE,KACtE0/B,EAAK+/F,kBAAoB,IAEtBnD,GAAUC,IACTv8H,KAAKu+H,qBAAqBmB,gBAAgBhgG,EAAM48F,EAAUC,GAG9D78F,EAAKmgG,WAAWvoH,QAAQ,SAAArZ,GACpB,IAAI6hI,EAAK/zD,EAAKgzD,cAAc5wB,SAASzuE,EAAKqgG,qBAAqB9hI,IAC/DyhC,EAAK+/F,kBAAkBryH,KAAK0yH,GACxBA,EAAGE,WACHj0D,EAAKywD,sBAAsByD,cAAchiI,EAAMy+H,iDAKvChzG,GAChB,OAAO,IAAIm/G,EAAAD,uBAAuBl/G,uXC/C1C,IAAAywG,EAAAr9H,EAAA,YACA+nI,EAAA/nI,EAAA,kCACAgoI,EAAAhoI,EAAA,u1BACaqsI,sZAAyCtE,EAAAG,yGAG9ChlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,KAAMJ,EAAAK,eAAeC,OAAQ,EAAG,GAAG,IACpFplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeC,SAC5EplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,4BAA6BJ,EAAAK,eAAeE,UAC7FrlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,oBAAqBJ,EAAAK,eAAeE,UACrFrlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,YAAa,CACtD,IAAIJ,EAAAI,uBAAuB,OAAQJ,EAAAK,eAAeC,QAClD,IAAIN,EAAAI,uBAAuB,MAAOJ,EAAAK,eAAe/zE,QACjD,IAAI0zE,EAAAI,uBAAuB,MAAOJ,EAAAK,eAAe/zE,QACjD,IAAI0zE,EAAAI,uBAAuB,SAAUJ,EAAAK,eAAeiE,SAAS30H,IAAI,uBAAwB,SAAA5B,GAAC,OAAS,GAALA,KAC/F,EAAGhR,EAAAA,GAAU,EAChB,SAAAgR,GAAC,OAAIA,EAAC,IAAUA,EAAC,KACjB,SAAA6W,GAAM,OAAIywG,EAAAS,MAAMyO,SAAS3/G,EAAQ,SAAA7W,GAAC,OAAEA,EAAC,sDAKzC7S,KAAK0pB,OAAS,CACV+mB,GAAI0pF,EAAAS,MAAM6K,OACVG,2BAA2B,EAC3B0D,mBAAmB,yUCzB/B,IAAAxD,EAAAhpI,EAAA,8BACAysI,EAAAzsI,EAAA,yCACA0sI,EAAA1sI,EAAA,kCACA2sI,EAAA3sI,EAAA,8BACAipI,EAAAjpI,EAAA,0BACA+gI,EAAA/gI,EAAA,+BACAq9H,EAAAr9H,EAAA,YACAA,EAAA,m0BAGa4sI,cAET,SAAAA,EAAYxD,EAAe3H,EAAsB/B,GAAoC,IAAA1wD,EAAA,EAAA34D,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAAA,mGAAAqnH,CAAAx6H,KAAA0pI,IACjF59D,EAAA2uD,EAAAz6H,KAAA06H,EAAAgP,GAAA7rI,KAAAmC,KAAM,uBAAwBkmI,EAAe3H,EAAsB/B,KAC9DmN,UAAY,EACjB79D,EAAKq6D,YAH4Er6D,8OAF7Cg6D,EAAAM,+FASpCpmI,KAAKumI,QAAQ,IAAIiD,EAAAI,qBAAqB5pI,KAAKkmI,cAAelmI,KAAKu+H,qBAAqBF,mBACpFr+H,KAAKumI,QAAQ,IAAIkD,EAAAI,iBAAiB7pI,KAAKkmI,gBACvClmI,KAAKqmI,cAAgB,IAAIN,EAAAO,cAActmI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,sBAAuBx8H,KAAK2pI,WACvH3pI,KAAKumI,QAAQvmI,KAAKqmI,2DAGF38G,GAChB,OAAO,IAAI6/G,EAAAJ,iCAAiCz/G,iDAI5C,MAAO,CACHykF,SAAU,SAACzuE,GAAD,OAAqC,IAA3BA,EAAKmgG,WAAW/hI,8CAI/B6rI,GACT3pI,KAAK2pI,UAAYA,EACjB3pI,KAAKqmI,cAAcyD,UAAYH,6CAGhBnD,EAAWC,GAAgC,IAAjBC,IAAiB,EAAAvzH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACtD6D,EAAS,GACb,GAAG0vH,EAAY,CACX,IAAIC,EAAU,CAAC,gBAAiB,UAChCH,EAAUuD,cAAczyH,QAAQ,SAAAra,GAAC,OAAE0pI,EAAQv5H,KAAKnQ,KAChD0pI,EAAQv5H,KAAK,UACb4J,EAAO5J,KAAKu5H,GAqBhB,QAlBuBF,EAAc/8G,OAAOsgH,gBAExChqI,KAAKgqI,eAAexD,GAGxBA,EAAU9xD,KAAKp9D,QAAQ,SAAA69D,GACnB,IAAI+sD,EAASsE,EAAUK,SAAS1xD,EAAI80D,aAChCnD,EAAW,CAAC3xD,EAAI80D,YAAY,EAAGpM,EAAA0E,OAAOwE,eAAe7E,EAAQuE,EAAc/8G,OAAOk8G,4BACtFzwD,EAAIwK,UAAUroE,QAAQ,SAAAzE,GAAC,OAAGi0H,EAAS15H,KAAKyF,KACxCi0H,EAAS15H,KAAK+nE,EAAIyuD,QAClB5sH,EAAO5J,KAAK05H,GAET3xD,EAAI+0D,aACH/0D,EAAIwK,UAAYxK,EAAI+0D,kBACb/0D,EAAI+0D,cAIZlzH,yCAGIwvH,GACX,IAAI2D,EAAe3D,EAAUuD,cAAc3xG,IAAI,WAAA,OAAI,IAAI0E,MAEvD0pG,EAAU9xD,KAAKp9D,QAAQ,SAAA69D,GACnBA,EAAI+0D,WAAa/0D,EAAIwK,UAAU91E,QAC/BsrE,EAAIwK,UAAUroE,QAAQ,SAACzE,EAAEzV,GACrB+sI,EAAa/sI,GAAG+C,IAAI0S,OAQ5B,IAJA,IAAIu3H,EAAiBD,EAAa/xG,IAAI,SAACjwB,GAAD,OAAKA,EAAEkwB,OAEzCtzB,EAAY,EACZslI,EAA2B7D,EAAUuD,cAAc3xG,IAAI,SAACvlB,EAAEzV,GAAH,OAAOA,IAC5D2H,GAHa,IAGcslI,EAAyBvsI,QAAO,CAC7DqsI,EAAeE,EAAyBjyG,IAAI,WAAA,OAAI,IAAI0E,MACpD0pG,EAAU9xD,KAAKp9D,QAAQ,SAAA69D,GACnBk1D,EAAyB/yH,QAAQ,SAACgzH,EAAeC,GAE7C,IAAIzvH,EAAMq6D,EAAI+0D,WAAWI,GACzBxvH,EAAMq/G,EAAAS,MAAMt3H,MAAMwX,EAAK/V,GACvBolI,EAAaI,GAAepqI,IAAI2a,GAEhCq6D,EAAIwK,UAAU2qD,GAAiBxvH,MAIvC,IAAI0vH,EAAkB,GACtBL,EAAa7yH,QAAQ,SAACmzH,EAAYF,GACRH,EAAeC,EAAyBE,KAC1CE,EAAWpyG,MAC3BmyG,EAAgBp9H,KAAKm9H,KAG1BC,EAAgB1sI,SACf0sI,EAAgBxiI,UAChBwiI,EAAgBlzH,QAAQ,SAAAizH,GACpBF,EAAyBpvG,OAAOsvG,EAAe,MAGvDxlI,yCAOImkI,GAER,OAAIA,EAAUwB,eAAe5sI,QAAU,EAC5B,CACH6sI,MAAO,EACP3/G,QAAS,GAIVhrB,KAAK4qI,MAAM,GAAGC,YAAY3B,EAAUwB,eAAe,8cC9HlE,IAAAvQ,EAAAr9H,EAAA,YACAwgI,EAAAxgI,EAAA,wBACAguI,EAAAhuI,EAAA,uCACA0gI,EAAA1gI,EAAA,4CAEAiuI,GADAjuI,EAAA,kCACAA,EAAA,u2BAEawpI,cAET,SAAAA,EAAYJ,EAAe3H,EAAsB/B,EAAuBmN,GAAW,IAAA79D,EAAA,mGAAA0uD,CAAAx6H,KAAAsmI,IAC/Ex6D,EAAA2uD,EAAAz6H,KAAA06H,EAAA4L,GAAAzoI,KAAAmC,KAAM,iBAAkBkmI,EAAeyD,KAClCpL,qBAAuBA,EAC5BzyD,EAAK0wD,sBAAwBA,EAC7B1wD,EAAKizD,cAAgB,IAAIvB,EAAAwB,cAJsDlzD,8OAFpDg/D,EAAAE,wFAS1BtD,EAAelB,GACUkB,EAAcuD,yBAAxC,IACIjmE,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YAE5BpE,KAAKw8H,sBAAsBC,qBAAqBJ,GAChD,IAAI6O,EAAiB1E,EAAU9mG,KAAKwrG,eAChCnB,EAAgB/kE,EAAO5gE,MAAM,aAAag0B,IAAI,SAAAvlB,GAAC,OAAEA,EAAEtM,OASvD,OARAmhI,EAAcyD,iBAAiBC,IAAI,gBAAiBrB,GAG/CvD,EAAU9mG,KAAKg1C,OAChB8xD,EAAU9mG,KAAKg1C,KAAO,GACtB8xD,EAAU9mG,KAAKqqG,cAAgBA,GAG5BmB,EAAeptI,6CAIZ4pI,EAAe2D,EAAYvB,EAAWtD,GAEhD,OADqBA,EAAU9mG,KAAKwrG,eACdrhI,MAAMwhI,EAAYA,EAAavB,uCAI7CpC,EAAe52E,GAAM,IAAAib,EAAA/rE,KACzBglE,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YACxBklI,EAAoBtkE,EAAO5gE,MAAM,qBACjCs7B,EAAOgoG,EAAcr0F,UACrBu0F,EAAWloG,EAAKmgG,WAAW,GAC3BkK,EAAgBrC,EAAcyD,iBAAiBtwH,IAAI,iBACnDgsH,EAAWa,EAAcuD,yBAAyBpwH,IAAI,YAE1D7a,KAAKu+H,qBAAqBp/F,MAAMO,GAChC1/B,KAAKu+H,qBAAqB4E,eAAezjG,GACzCqqG,EAAczyH,QAAQ,SAACg0H,EAAcluI,GACjCsiC,EAAK+jG,gBAAgB6H,GAAgBx6E,EAAK1zD,KAG9C4C,KAAKu+H,qBAAqB8E,uBAAuB3jG,EAAMkoG,GACvD,IAEIt0D,EAFKtzE,KAAK++H,cAAc5wB,SAASzuE,EAAKqgG,qBAAqB6H,IAEhD5H,UAEf,IAAI1sD,GAASg2D,EAAkB,CAC3B,IAAIiC,EAAY,CACZ5rD,UAAW,IAKf,MAHAoqD,EAAczyH,QAAQ,SAACg0H,EAAcluI,GACjCmuI,EAAU5rD,UAAU2rD,GAAgBx6E,EAAK1zD,KAEvC,IAAI2tI,EAAAS,wBAAwB,eAAgBD,GAGtD,IAAIvE,EAAU,GAWd,OATAH,EAASvvH,QAAQ,SAAA4qH,GACb,IAAI0B,EAAS,MACTtwD,IACAvH,EAAKywD,sBAAsByD,cAAc2H,GAAU,EAAO1F,GAC1D0B,EAASgE,EAAStD,cAAcjI,EAAU,UAAU,IAExD2K,EAAQ55H,KAAKw2H,KAGV,CACHiD,SAAUA,EACVlnD,UAAW7uB,EACXk2E,QAASA,sCAINU,EAAe/pH,EAAO6oH,GAAW,IAAA/F,EAAAzgI,KAC3B0nI,EAAcC,mBACYvjI,MAAM,6BAE7CuZ,EAAMrG,QAAQ,SAAAw5C,GACLA,GAGLA,EAAK+1E,SAASvvH,QAAQ,SAAC4qH,EAAQ9kI,GAC3B,IAAIuiF,EAAY7uB,EAAK6uB,UAAUvnD,IAAI,SAAAvlB,GAAC,OAAI4tH,EAAKuC,QAAQnwH,KAEjD+wH,EAAS9yE,EAAKk2E,QAAQ5pI,GACtB+3E,EAAM,CACN80D,YAAa7sI,EACbuiF,UAAWA,EACXikD,OAAQzJ,EAAAS,MAAMh9E,SAASgmF,GAAUA,EAASnD,EAAKuC,QAAQY,IAE3D4C,EAAU9mG,KAAKg1C,KAAKtnE,KAAK+nE,2CAKzBuyD,EAAelB,UAChBA,EAAU9mG,KAAKwrG,+CAIlBr4H,GACJ,OAAOyqH,EAAAgB,iBAAiB0E,QAAQnwH,ibCtHxC,IAAAy0H,EAAAxqI,EAAA,2BACAyqI,EAAAzqI,EAAA,iCACA0qI,EAAA1qI,EAAA,y1BAEa+sI,cACT,SAAAA,EAAY3D,GAAe,mGAAA1L,CAAAx6H,KAAA6pI,GAAApP,EAAAz6H,KAAA06H,EAAAmP,GAAAhsI,KAAAmC,KACjB,gBAAiBkmI,gPAFOoB,EAAAG,wFAKxBC,EAAelB,GACrB,IACIoB,EADOF,EAAcr0F,UACLwsF,WAAW,GAG3BgH,EAFoB,IAAIW,EAAAK,kBAAkBD,GAEbf,SAUjC,OATAa,EAAcuD,yBAAyBG,IAAI,WAAYvE,GAEnDL,EAAU9mG,OACV8mG,EAAU9mG,KAAK,IAGnB8mG,EAAU9mG,KAAKmnG,SAAWA,EAE1Ba,EAAce,WAAalB,EAAAmB,WAAWC,UAC/BjB,wQCxBf,IAAAvN,EAAAr9H,EAAA,YACAwqI,EAAAxqI,EAAA,2BACAyqI,EAAAzqI,EAAA,iCACA2uI,EAAA3uI,EAAA,g1BAEa8sI,cACT,SAAAA,EAAY1D,EAAe7H,GAAkB,IAAAvyD,EAAA,mGAAA0uD,CAAAx6H,KAAA4pI,IACzC99D,EAAA2uD,EAAAz6H,KAAA06H,EAAAkP,GAAA/rI,KAAAmC,KAAM,oBAAqBkmI,KACtB7H,iBAAmBA,EAFiBvyD,8OADPw7D,EAAAG,wFAM5BC,EAAelB,GACrB,IACI7mD,EADS+nD,EAAcC,mBACJvjI,MAAM,aAEzB8mI,EAAiB,GASrB,OARAvrD,EAAUroE,QAAQ,SAAAzE,GACdq4H,EAAe99H,KAAKq+H,EAAA3I,kBAAkB4I,SAAS74H,EAAE7L,IAAK6L,EAAE5L,IAAK4L,EAAE/U,WAEnEotI,EAAiB/Q,EAAAS,MAAM+Q,mBAAmBT,GAC1C1E,EAAU9mG,KAAK,CACXwrG,eAAgBA,GAEpBxD,EAAce,WAAalB,EAAAmB,WAAWC,UAC/BjB,kTCxBf,IAAAvN,EAAAr9H,EAAA,YACA+nI,EAAA/nI,EAAA,kCACAgoI,EAAAhoI,EAAA,u1BACa8uI,sZAAsD/G,EAAAG,yGAG3DhlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,KAAMJ,EAAAK,eAAeC,OAAQ,EAAG,GAAG,IACpFplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeC,SAC5EplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,oBAAqBJ,EAAAK,eAAeE,UACrFrlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,4BAA6BJ,EAAAK,eAAeE,UAC7FrlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,eAAgBJ,EAAAK,eAAeiE,SAAS30H,IAAI,uBAAwB,SAAA5B,GAAC,OAAQ,EAAJA,KAE1H7S,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,YAAa,CACtD,IAAIJ,EAAAI,uBAAuB,OAAQJ,EAAAK,eAAeC,QAClD,IAAIN,EAAAI,uBAAuB,UAAWJ,EAAAK,eAAeG,oBACtD,EAAGzjI,EAAAA,GAAU,EAChB,KACA,SAAA6nB,GAAM,OAAIywG,EAAAS,MAAMyO,SAAS3/G,EAAQ,SAAA7W,GAAC,OAAEA,EAAC,sDAKzC7S,KAAK0pB,OAAS,CACV+mB,GAAI0pF,EAAAS,MAAM6K,OACVG,2BAA2B,EAC3B0D,mBAAmB,mWCzB/B,IAAAuC,EAAA/uI,EAAA,uDACA2sI,EAAA3sI,EAAA,qCACAgvI,EAAAhvI,EAAA,qCACAivI,EAAAjvI,EAAA,+BACAkvI,EAAAlvI,EAAA,g1BAEamvI,cAET,SAAAA,EAAY/F,EAAe3H,EAAsB/B,GAAoC,IAAA1wD,EAAb69D,EAAa,EAAAx2H,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAAG,mGAAAqnH,CAAAx6H,KAAAisI,IACjFngE,EAAA2uD,EAAAz6H,KAAA06H,EAAAuR,GAAApuI,KAAAmC,KAAMkmI,EAAe3H,EAAsB/B,EAAuBmN,KAC7DpjI,KAAO,qCAFqEulE,8OAFhCggE,EAAApC,4GAQjD1pI,KAAKumI,QAAQ,IAAIkD,EAAAI,iBAAiB7pI,KAAKkmI,gBACvClmI,KAAKqmI,cAAgB,IAAI0F,EAAAG,kBAAkBlsI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,sBAAuBx8H,KAAK2pI,WAC3H3pI,KAAKumI,QAAQvmI,KAAKqmI,eAClBrmI,KAAKumI,QAAQ,IAAIyF,EAAAG,uBAAuBnsI,KAAKu+H,qBAAqBF,iBAAkBr+H,KAAKw8H,sBAAuBx8H,KAAKkmI,4DAGrGx8G,GAChB,OAAO,IAAImiH,EAAAD,8CAA8CliH,uCAMjDw/G,GAER,OAAIA,EAAUwB,eAAe5sI,QAAU,EAC5B,CACH6sI,MAAO,EACP3/G,QAAS,GAIVhrB,KAAK4qI,MAAM,GAAGC,YAAY3B,EAAUwB,eAAe,gYCpClE,IAAAvQ,EAAAr9H,EAAA,YACAwqI,EAAAxqI,EAAA,2BACAyqI,EAAAzqI,EAAA,iCACAwgI,EAAAxgI,EAAA,m0BAEaqvI,cACT,SAAAA,EAAY9N,EAAkB7B,EAAuB0J,GAAe,IAAAp6D,EAAA,mGAAA0uD,CAAAx6H,KAAAmsI,IAChErgE,EAAA2uD,EAAAz6H,KAAA06H,EAAAyR,GAAAtuI,KAAAmC,KAAM,uBAAwBkmI,KACzB7H,iBAAmBA,EACxBvyD,EAAK0wD,sBAAwBA,EAHmC1wD,8OAD5Bw7D,EAAAG,wFAO9BC,EAAelB,GACrB,IAAIxhE,EAAS0iE,EAAcC,mBACvByE,EAAepnE,EAAO5gE,MAAM,gBAC5Bi4H,EAAWr3D,EAAO5gE,MAAM,YAExBw+E,EAAO5iF,KAAKw8H,sBAAsB6P,WAAWhQ,GAG7CiQ,EAAmB9F,EAAU9mG,KAAKmnG,SAASzuG,IAAI,WAAA,MAAI,KAsBvD,OApBAouG,EAAU9mG,KAAKg1C,KAAKp9D,QAAQ,SAAA69D,GACxBm3D,EAAiBn3D,EAAI80D,aAAa78H,KAAK+sH,EAAAS,MAAMh9E,SAASu3B,EAAIyuD,QAAU,EAAIzuD,EAAIyuD,UAGhFzJ,EAAAr7H,IAAIsuD,MAAM,mBAAoBk/E,EAAkB9F,EAAU9mG,KAAKg1C,KAAK52E,OAAQ8kF,EAAK2pD,cAEjF/F,EAAU9mG,KAAK8sG,QAAUF,EAAiBl0G,IAAI,SAAA4uG,GAAO,OAAE1J,EAAAgB,iBAAiBh+D,OAAO0mE,KAC/ER,EAAU9mG,KAAK+sG,mBAAqBH,EAAiBl0G,IAAI,SAAA4uG,GAAO,OAAE1J,EAAAgB,iBAAiB79D,IAAIumE,KAEnFpkD,EAAK2pD,aACL/F,EAAU9mG,KAAKgtG,0BAA4BlG,EAAU9mG,KAAKitG,2BAA2Bv0G,IAAI,SAAAvlB,GAAC,OAAEyqH,EAAAgB,iBAAiB0E,QAAQ1F,EAAAgB,iBAAiBx0H,OAAO+I,EAAGu5H,MAEhJ5F,EAAU9mG,KAAKgtG,0BAA4BlG,EAAU9mG,KAAKktG,0BAA0Bx0G,IAAI,SAAAvlB,GAAC,OAAEyqH,EAAAgB,iBAAiB0E,QAAQ1F,EAAAgB,iBAAiBx0H,OAAO+I,EAAGu5H,MAGnJ5F,EAAU9mG,KAAKitG,2BAA6BnG,EAAU9mG,KAAKitG,2BAA2Bv0G,IAAI,SAAAvlB,GAAC,OAAEyqH,EAAAgB,iBAAiB0E,QAAQnwH,KACtH2zH,EAAU9mG,KAAKktG,0BAA4BpG,EAAU9mG,KAAKktG,0BAA0Bx0G,IAAI,SAAAvlB,GAAC,OAAEyqH,EAAAgB,iBAAiB0E,QAAQnwH,KAGpH60H,EAAce,WAAalB,EAAAmB,WAAWC,UAC/BjB,8RC1Cf,IAAAvN,EAAAr9H,EAAA,YACAwgI,EAAAxgI,EAAA,wBACAipI,EAAAjpI,EAAA,oCACAiuI,EAAAjuI,EAAA,6oCAEaovI,sZAA0BnG,EAAAO,4FAE9BoB,EAAelB,GACUkB,EAAcuD,yBAAxC,IACIjmE,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YAE5BpE,KAAKw8H,sBAAsBC,qBAAqBJ,GAChD,IAAI0N,EAAgB/kE,EAAO5gE,MAAM,aAAag0B,IAAI,SAAAvlB,GAAC,OAAEA,EAAEtM,OAWvD,OAVAmhI,EAAcyD,iBAAiBC,IAAI,gBAAiBrB,GAEhDvD,EAAU9mG,KAAKg1C,OACf8xD,EAAU9mG,KAAKg1C,KAAO,GACtB8xD,EAAU9mG,KAAKqqG,cAAgBA,EAC/BvD,EAAU9mG,KAAKmtG,eAAiB1S,EAAAS,MAAMt4E,KAAK,IAAInlC,MAAMqpH,EAAU9mG,KAAKmnG,SAAS/oI,QAAS,GACtF0oI,EAAU9mG,KAAKitG,2BAA6BxS,EAAAS,MAAMt4E,KAAK,IAAInlC,MAAMqpH,EAAU9mG,KAAKmnG,SAAS/oI,QAAS,GAClG0oI,EAAU9mG,KAAKktG,0BAA4BzS,EAAAS,MAAMt4E,KAAK,IAAInlC,MAAMqpH,EAAU9mG,KAAKmnG,SAAS/oI,QAAS,IAG9FknE,EAAO5gE,MAAM,sDAGVsjI,EAAe2D,EAAYvB,EAAWtD,GAKhD,IAL2D,IAAA16D,EAAA9rE,KAEvD2/E,EADS+nD,EAAcC,mBACJvjI,MAAM,aACzBs7B,EAAOgoG,EAAcr0F,UACrB63F,EAAiB,GACb4B,EAAS,EAAGA,EAAShD,EAAWgD,IAAW,CAC/C,IAAIC,EAA0B,GAC1BC,EAAS,GAab,GAZArtD,EAAUroE,QAAQ,SAAAzE,GACd,IACI,IAAIo6H,EAAYnhE,EAAKyyD,qBAAqBF,iBAAiBjoE,KAAKvjD,EAAEq6H,SAAS,EAAM/S,EAAAS,MAAM70E,UAAUrmB,EAAK+jG,kBACtGsJ,EAAwB3/H,KAAKkwH,EAAAgB,iBAAiB0E,QAAQiK,IACzD,MAAMjwI,GACHgwI,EAAO5/H,KAAK,CACR23B,SAAUlyB,EACVuH,MAAOpd,OAKhBgwI,EAAOlvI,OAAQ,CACd,IAAIytI,EAAY,CAAC5rD,UAAW,IAI5B,MAHAqtD,EAAO11H,QAAQ,SAAAta,GACXuuI,EAAU5rD,UAAU3iF,EAAE+nC,SAASx+B,MAAQvJ,EAAEod,MAAMuuB,UAE7C,IAAIoiG,EAAAS,wBAAwB,oBAAqBD,GAE3DL,EAAe99H,KAAK2/H,GAGxB,OAAO7B,sCAGCxD,EAAe52E,EAAMq8E,EAAkB3G,GAC/C,IAAIzpI,EAAC41G,EAAA+nB,EAAAwR,EAAAjsI,WAAA,cAAAD,MAAAnC,KAAAmC,KAAqB0nI,EAAe52E,EAAM01E,GAG3C4F,EADS1E,EAAcC,mBACDvjI,MAAM,gBAC5ByiI,EAAWa,EAAcuD,yBAAyBpwH,IAAI,YAI1D,OAFA7a,KAAKotI,kBAAkBrwI,EAAG8pI,EAAUuF,EAAc5F,GAE3CzpI,4CAGOA,EAAG8pI,EAAUuF,EAAc5F,GACzC,IAAI6G,GAAiBxrI,EAAAA,EACjByrI,EAAezrI,EAAAA,EACf0rI,EAAoB,GACpBC,EAAqB,GAErBC,EAAUnQ,EAAAgB,iBAAiBlvH,SAAS,GAExCy3H,EAASvvH,QAAQ,SAAC4qH,EAAO9kI,GACrB,IAAIwmI,EAAS7mI,EAAEiqI,QAAQ5pI,GACpB+8H,EAAAS,MAAMh9E,SAASgmF,KACdA,EAAS6J,GAEV7J,EAAS0J,GACRA,EAAe1J,EACf4J,EAAqB,CAACpwI,IACjBwmI,EAAOrgI,OAAO+pI,IACnBE,EAAmBpgI,KAAKhQ,GAEhBiwI,EAATzJ,GACCyJ,EAAgBzJ,EAChB2J,EAAoB,CAACnwI,IAChBwmI,EAAOrgI,OAAO8pI,IACnBE,EAAkBngI,KAAKhQ,GAG3BopI,EAAU9mG,KAAKmtG,eAAezvI,GAAKkgI,EAAAgB,iBAAiBn+H,IAAIqmI,EAAU9mG,KAAKmtG,eAAezvI,GAAIkgI,EAAAgB,iBAAiBx0H,OAAO85H,EAAQwI,MAG9HmB,EAAkBj2H,QAAQ,SAAA2yH,GACtBzD,EAAU9mG,KAAKitG,2BAA2B1C,GAAe3M,EAAAgB,iBAAiBn+H,IAAIqmI,EAAU9mG,KAAKitG,2BAA2B1C,GAAc3M,EAAAgB,iBAAiBx0H,OAAO,EAAGyjI,EAAkBzvI,WAGvL0vI,EAAmBl2H,QAAQ,SAAA2yH,GACvBzD,EAAU9mG,KAAKktG,0BAA0B3C,GAAe3M,EAAAgB,iBAAiBn+H,IAAIqmI,EAAU9mG,KAAKktG,0BAA0B3C,GAAc3M,EAAAgB,iBAAiBx0H,OAAO,EAAG0jI,EAAmB1vI,+CAK9K4pI,EAAelB,GAAW,IAAAz6D,EAAA/rE,KAClCwmI,EAAU9mG,KAAKmtG,eAAiBrG,EAAU9mG,KAAKmtG,eAAez0G,IAAI,SAAAvlB,GAAC,OAAEk5D,EAAKi3D,QAAQnwH,qCAI9EA,GACJ,OAAOyqH,EAAAgB,iBAAiB0E,QAAQnwH,mUCrHxC,IAAAsnH,EAAAr9H,EAAA,YACA+nI,EAAA/nI,EAAA,kCACAgoI,EAAAhoI,EAAA,u1BACa4wI,sZAAgC7I,EAAAG,yGAGrChlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,KAAMJ,EAAAK,eAAeC,OAAQ,EAAG,GAAG,IACpFplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeC,SAC5EplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,wBAAyBJ,EAAAK,eAAe/zE,QAAQ38C,IAAI,uBAAwB,SAAA5B,GAAC,OAAQ,EAAJA,GAASA,GAAI,OAC/I7S,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,SAAUJ,EAAAK,eAAeiE,SAAS30H,IAAI,uBAAwB,SAAA5B,GAAC,OAAS,GAALA,KACpH7S,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,YAAa,CACtD,IAAIJ,EAAAI,uBAAuB,OAAQJ,EAAAK,eAAeC,SACnD,EAAGvjI,EAAAA,GAAU,EAChB,KACA,SAAA6nB,GAAM,OAAIywG,EAAAS,MAAMyO,SAAS3/G,EAAQ,SAAA7W,GAAC,OAAEA,EAAC,UAEzC7S,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,oBAAqBJ,EAAAK,eAAeE,sDAIrFrlI,KAAK0pB,OAAS,CACV+mB,GAAI0pF,EAAAS,MAAM6K,OACV6D,mBAAmB,uTCtB/B,IAAAxD,EAAAhpI,EAAA,8BACAipI,EAAAjpI,EAAA,0BACA6wI,EAAA7wI,EAAA,gqCAEa8wI,cAET,SAAAA,EAAY1H,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAA4tI,IACpE9hE,EAAA2uD,EAAAz6H,KAAA06H,EAAAkT,GAAA/vI,KAAAmC,KAAM,cAAekmI,KAChBK,QAAQ,IAAIR,EAAAO,cAAcJ,EAAe3H,EAAsB/B,IAFA1wD,8OAFzCg6D,EAAAM,uGAOX18G,GAChB,OAAO,IAAIikH,EAAAD,wBAAwBhkH,iDAInC,MAAO,CACHykF,SAAU,SAACzuE,GAAD,OAAqC,IAA3BA,EAAKmgG,WAAW/hI,6CAQhCorI,GACR,OAAIA,EAAUwB,eAAe5sI,OAAS,EAC3B,CACH6sI,MAAO,EACP3/G,QAAS,GAIVhrB,KAAK4qI,MAAM,GAAGC,YAAY3B,EAAUwB,eAAe,+CAG3ClE,EAAWC,GAAgC,IAAjBC,IAAiB,EAAAvzH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAEtD6D,EAAS,GAeb,OAdG0vH,GACC1vH,EAAO5J,KAAK,CAAC,gBAAiB,aAAaw0C,OAAO4kF,EAAUqH,wBAGhErH,EAAU9xD,KAAKp9D,QAAQ,SAAC69D,EAAK59D,GAEzBP,EAAO5J,KAAPsK,MAAAV,EAAMkxH,EAAS/yD,EAAI6xD,QAAQ5uG,IAAI,SAAC4uG,EAASiD,GAAV,MAAA,CAC3B90D,EAAIm2D,aACJrB,EAAY,GAFeroF,OAAAsmF,EAGxBlB,UAKJhwH,4OCrDf,IAAAmjH,EAAAr9H,EAAA,YACAwgI,EAAAxgI,EAAA,wBACAiuI,EAAAjuI,EAAA,2DACAguI,EAAAhuI,EAAA,uCACA0gI,EAAA1gI,EAAA,4CAEA0qI,GADA1qI,EAAA,kCACAA,EAAA,+CACA2uI,EAAA3uI,EAAA,qqCAEawpI,cAET,SAAAA,EAAYJ,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAAsmI,IACpEx6D,EAAA2uD,EAAAz6H,KAAA06H,EAAA4L,GAAAzoI,KAAAmC,KAAM,iBAAkBkmI,EAAe,KAClC3H,qBAAuBA,EAC5BzyD,EAAK0wD,sBAAwBA,EAC7B1wD,EAAKizD,cAAgB,IAAIvB,EAAAwB,cAJ2ClzD,8OAFzCg/D,EAAAE,wFAS1BtD,EAAelB,GAAW,IAAAz6D,EAAA/rE,KAEvBglE,GADsB0iE,EAAcuD,yBAC3BvD,EAAcC,oBACvBtL,EAAWr3D,EAAO5gE,MAAM,YACxB0pI,EAAwB9oE,EAAO5gE,MAAM,yBACrCtG,EAASknE,EAAO5gE,MAAM,UACtBu7E,EAAY3a,EAAO5gE,MAAM,aAE7BpE,KAAKw8H,sBAAsBC,qBAAqBJ,GAChD,IAAI0N,EAAgB/kE,EAAO5gE,MAAM,aAAag0B,IAAI,SAAAvlB,GAAC,OAAEA,EAAEtM,OACvDmhI,EAAcyD,iBAAiBC,IAAI,gBAAiBrB,GACpD,IAAIrqG,EAAOgoG,EAAcr0F,UAErBu0F,EAAWloG,EAAKmgG,WAAW,GAC3B+D,EAASgE,EAAStD,cAAcjI,EAAU,UAE9Cr8H,KAAKu+H,qBAAqBp/F,MAAMO,GAChC1/B,KAAKu+H,qBAAqBmB,gBAAgBhgG,GAE1C1/B,KAAKw8H,sBAAsByD,cAAc2H,GAAU,GAEnD,IAAImG,EAAoB,IAAIvG,EAAAK,kBAAkBD,EAAUvL,GAEpD2R,EAAgB,GACpB7T,EAAAS,MAAMh0E,OAAOlnB,EAAK+jG,gBAAiB,SAAC5wH,EAAEpM,GAClCunI,EAAcvnI,GAAGslE,EAAKi3D,QAAQnwH,KAIlC,IAAIg7H,EAAwBpC,EAAA3I,kBAAkB4I,UAAUoC,EAAuBA,EAAuB,EAAEhwI,EAAO,GAE3GotI,EAAiB,GAoBrB,OAlBAvrD,EAAUroE,QAAQ,SAAAzE,GACd,IAAIo7H,EAASD,EAAcn7H,EAAEtM,MAC7B2kI,EAAe99H,KAAKygI,EAAsBz1G,IAAI,SAAAz6B,GAAC,OAAGouE,EAAKi3D,QAAQ1F,EAAAgB,iBAAiBn+H,IAAI8tI,EAAQ3Q,EAAAgB,iBAAiBn9E,SAASm8E,EAAAgB,iBAAiBx0H,OAAOnM,EAAE,KAAMswI,UAItJzH,EAAU9mG,OACV8mG,EAAU9mG,KAAO,CACbqqG,cAAeA,EACfiE,cAAeA,EACfH,sBAAuBA,EACvBK,cAAeluI,KAAKgjI,QAAQY,GAAQ,GACpCiD,SAAUkH,EAAkBlH,SAC5BnyD,KAAM,KAIdgzD,EAAcuD,yBAAyBG,IAAI,iBAAkBF,GACtDA,EAAeptI,6CAIZ4pI,EAAe2D,EAAYvB,GAErC,OADqBpC,EAAcuD,yBAAyBpwH,IAAI,kBAC1ChR,MAAMwhI,EAAYA,EAAavB,uCAG7CpC,EAAe52E,EAAMq9E,EAAW3H,GAAW,IAAA/F,EAAAzgI,KAC/CglE,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YACxBklI,EAAoBtkE,EAAO5gE,MAAM,qBACjCs7B,EAAOgoG,EAAcr0F,UACrBu0F,EAAWloG,EAAKmgG,WAAW,GAE3ByL,EADgB5D,EAAcyD,iBAAiBtwH,IAAI,iBACtBszH,GAG7BnH,EAAUR,EAAU9mG,KAAKmnG,SAASzuG,IAAI,SAAA8pG,GAAM,MAAE,KA+BlD,OA7BAliI,KAAKu+H,qBAAqBp/F,MAAMO,GAChC1/B,KAAKu+H,qBAAqB4E,eAAezjG,GAGzCoxB,EAAKx5C,QAAQ,SAAA82H,GAQT,GANA1uG,EAAK+jG,gBAAgB6H,GAAgB8C,EAErC3N,EAAKlC,qBAAqB8E,uBAAuB3jG,EAAMkoG,IAC9CnH,EAAK1B,cAAc5wB,SAASzuE,EAAKqgG,qBAAqB6H,IAChD5H,WAEFsJ,EAAkB,CAC3B,IAAIiC,EAAY,CACZ5rD,UAAW,IAIf,MAFA4rD,EAAU5rD,UAAU2rD,GAAgB8C,EAE9B,IAAIrD,EAAAS,wBAAwB,eAAgBD,GAGtD/E,EAAU9mG,KAAKmnG,SAASvvH,QAAQ,SAAC4qH,EAAQ+H,GACrCxJ,EAAKjE,sBAAsByD,cAAc2H,GAAU,EAAO1F,GAC1D,IAAI0B,EAASgE,EAAStD,cAAcjI,EAAU,UAAU,GACxD2K,EAAQiD,GAAa78H,KAAKqzH,EAAKuC,QAAQY,QAKxC,CACH0H,aAAcA,EACdhB,cAAe6D,EACfjD,eAAgBp6E,EAChBk2E,QAASA,sCAKNU,EAAe/pH,EAAO6oH,GAAW,IAAA6H,GACxCA,EAAA7H,EAAU9mG,KAAKg1C,MAAKtnE,KAApBsK,MAAA22H,EAAAnG,EAA4BvqH,oCAIxB9K,GACJ,OAAOyqH,EAAAgB,iBAAiB0E,QAAQnwH,ugBCtIxC,IAAAsnH,EAAAr9H,EAAA,YACAwgI,EAAAxgI,EAAA,wBACAiuI,EAAAjuI,EAAA,2DACAguI,EAAAhuI,EAAA,uCACA0gI,EAAA1gI,EAAA,4CAEA0qI,GADA1qI,EAAA,kCACAA,EAAA,+qCAEawpI,cAET,SAAAA,EAAYJ,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAAsmI,IACpEx6D,EAAA2uD,EAAAz6H,KAAA06H,EAAA4L,GAAAzoI,KAAAmC,KAAM,iBAAkBkmI,EAAe,KAClC3H,qBAAuBA,EAC5BzyD,EAAK0wD,sBAAwBA,EAC7B1wD,EAAKizD,cAAgB,IAAIvB,EAAAwB,cAJ2ClzD,8OAFzCg/D,EAAAE,wFAS1BtD,EAAelB,GAAW,IAAAz6D,EAAA/rE,KACvBsuI,EAAsB5G,EAAcuD,yBACpCjmE,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YAE5BpE,KAAKw8H,sBAAsBC,qBAAqBJ,GAChD,IAAI6O,EAAiBoD,EAAoBzzH,IAAI,kBACzCkvH,EAAgB/kE,EAAO5gE,MAAM,aAAag0B,IAAI,SAAAvlB,GAAC,OAAEA,EAAEtM,OACvDmhI,EAAcyD,iBAAiBC,IAAI,gBAAiBrB,GACpD,IAAIrqG,EAAOgoG,EAAcr0F,UAErBu0F,EAAWloG,EAAKmgG,WAAW,GAC3B+D,EAASgE,EAAStD,cAAcjI,EAAU,UAE9Cr8H,KAAKu+H,qBAAqBp/F,MAAMO,GAChC1/B,KAAKu+H,qBAAqBmB,gBAAgBhgG,GAE1C1/B,KAAKw8H,sBAAsByD,cAAc2H,GAAU,GAInD,IAAImG,EAAoB,IAAIvG,EAAAK,kBAAkBD,EAAUvL,GAEpD2R,EAAgB,GAgBpB,OAfA7T,EAAAS,MAAMh0E,OAAOlnB,EAAK+jG,gBAAiB,SAAC5wH,EAAEpM,GAClCunI,EAAcvnI,GAAGslE,EAAKi3D,QAAQnwH,KAG9B2zH,EAAU9mG,OACV8mG,EAAU9mG,KAAO,CACbqqG,cAAeA,EACfiE,cAAeA,EACfO,gBAAiBrD,EAAe9yG,IAAI,SAAAvlB,GAAC,MAAE,CAACA,EAAE,GAAIA,EAAEA,EAAE/U,OAAO,MACzDowI,cAAeluI,KAAKgjI,QAAQY,GAAQ,GACpCiD,SAAUkH,EAAkBlH,SAC5BnyD,KAAM,KAIPw2D,EAAeptI,6CAIZ4pI,EAAe2D,EAAYvB,GAErC,OADqBpC,EAAcuD,yBAAyBpwH,IAAI,kBAC1ChR,MAAMwhI,EAAYA,EAAavB,uCAG7CpC,EAAe52E,EAAMq9E,EAAW3H,GAAW,IAAA/F,EAAAzgI,KAC/CglE,EAAS0iE,EAAcC,mBACvBtL,EAAWr3D,EAAO5gE,MAAM,YACxBklI,EAAoBtkE,EAAO5gE,MAAM,qBACjCs7B,EAAOgoG,EAAcr0F,UACrBu0F,EAAWloG,EAAKmgG,WAAW,GAE3ByL,EADgB5D,EAAcyD,iBAAiBtwH,IAAI,iBACtBszH,GAE7BK,EAAUhI,EAAU9mG,KAAKmnG,SAASzuG,IAAI,SAAA8pG,GACtC,MAAO,CACHl7H,IAAKnF,EAAAA,EACLoF,KAAMpF,EAAAA,KAIV6nB,EAAS88G,EAAU9mG,KAAKmnG,SAASzuG,IAAI,SAAA8pG,GACrC,MAAO,CACHl7H,IAAK,KACLC,IAAK,QA0Cb,OAtCAjH,KAAKu+H,qBAAqBp/F,MAAMO,GAChC1/B,KAAKu+H,qBAAqB4E,eAAezjG,GAGzCoxB,EAAKx5C,QAAQ,SAAA82H,GAQT,GANA1uG,EAAK+jG,gBAAgB6H,GAAgB8C,EAErC3N,EAAKlC,qBAAqB8E,uBAAuB3jG,EAAMkoG,IAC9CnH,EAAK1B,cAAc5wB,SAASzuE,EAAKqgG,qBAAqB6H,IAChD5H,WAEFsJ,EAAkB,CAC3B,IAAIiC,EAAY,CACZ5rD,UAAW,IAIf,MAFA4rD,EAAU5rD,UAAU2rD,GAAgB8C,EAE9B,IAAIrD,EAAAS,wBAAwB,eAAgBD,GAGtD/E,EAAU9mG,KAAKmnG,SAASvvH,QAAQ,SAAC4qH,EAAQ+H,GACrCxJ,EAAKjE,sBAAsByD,cAAc2H,GAAU,EAAO1F,GAC1D,IAAI0B,EAASgE,EAAStD,cAAcjI,EAAU,UAAU,GAErDuH,EAAS4K,EAAQvE,GAAajjI,MAC7BwnI,EAAQvE,GAAajjI,IAAM48H,EAC3Bl6G,EAAOugH,GAAajjI,IAAMonI,GAG3BxK,EAAS4K,EAAQvE,GAAahjI,MAC7BunI,EAAQvE,GAAahjI,IAAM28H,EAC3Bl6G,EAAOugH,GAAahjI,IAAMmnI,OAM/B,CACH9C,aAAcA,EACdhB,cAAe6D,EACfK,QAASA,EAAQp2G,IAAI,SAAAp7B,GAAC,MAAE,CAACyjI,EAAKuC,QAAQhmI,EAAEgK,KAAMy5H,EAAKuC,QAAQhmI,EAAEiK,QAC7DwnI,qBAAsB/kH,EAAO0O,IAAI,SAAAvlB,GAAC,MAAE,CAAC4tH,EAAKuC,QAAQnwH,EAAE7L,KAAMy5H,EAAKuC,QAAQnwH,EAAE5L,4CAKtEygI,EAAe/pH,EAAO6oH,GAAW,IAAA6H,GACxCA,EAAA7H,EAAU9mG,KAAKg1C,MAAKtnE,KAApBsK,MAAA22H,EAAAnG,EAA4BvqH,wCAGpB+pH,EAAelB,GACvBA,EAAU9mG,KAAKg1C,KAAKroC,KAAK,SAAC7uC,EAAGkB,GAAJ,OAASA,EAAE8vI,QAAQ,GAAG,GAAG9vI,EAAE8vI,QAAQ,GAAG,IAAKhxI,EAAEgxI,QAAQ,GAAG,GAAGhxI,EAAEgxI,QAAQ,GAAG,sCAK7F37H,GACJ,OAAOyqH,EAAAgB,iBAAiB0E,QAAQnwH,seClJxC/V,EAAA,YAAA,IACAwqI,EAAAxqI,EAAA,2BACAyqI,EAAAzqI,EAAA,iCAEA2uI,GADA3uI,EAAA,wBACAA,EAAA,i1BAEa8sI,cACT,SAAAA,EAAY1D,GAAe,mGAAA1L,CAAAx6H,KAAA4pI,GAAAnP,EAAAz6H,KAAA06H,EAAAkP,GAAA/rI,KAAAmC,KACjB,oBAAqBkmI,gPAFOoB,EAAAG,wFAK5BC,GACN,IACI/nD,EADS+nD,EAAcC,mBACJvjI,MAAM,aAEzB8mI,EAAiB,GAOrB,OANAvrD,EAAUroE,QAAQ,SAAAzE,GACdq4H,EAAe99H,KAAKq+H,EAAA3I,kBAAkB4I,SAAS74H,EAAE7L,IAAK6L,EAAE5L,IAAK4L,EAAE/U,WAEnE4pI,EAAcuD,yBAAyBG,IAAI,iBAAkBF,GAE7DxD,EAAce,WAAalB,EAAAmB,WAAWC,UAC/BjB,8UCtBf,IAAAvN,EAAAr9H,EAAA,YACA+nI,EAAA/nI,EAAA,kCACAgoI,EAAAhoI,EAAA,u1BACa4xI,sZAAoC7J,EAAAG,yGAGzChlI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,KAAMJ,EAAAK,eAAeC,OAAQ,EAAG,GAAG,IACpFplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,WAAYJ,EAAAK,eAAeC,SAC5EplI,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,YAAa,CACtD,IAAIJ,EAAAI,uBAAuB,OAAQJ,EAAAK,eAAeC,QAClD,IAAIN,EAAAI,uBAAuB,MAAOJ,EAAAK,eAAe/zE,QACjD,IAAI0zE,EAAAI,uBAAuB,MAAOJ,EAAAK,eAAe/zE,QACjD,IAAI0zE,EAAAI,uBAAuB,SAAUJ,EAAAK,eAAeiE,SAAS30H,IAAI,uBAAwB,SAAA5B,GAAC,OAAS,GAALA,KAC/F,EAAGhR,EAAAA,GAAU,EAChB,SAAAgR,GAAC,OAAIA,EAAC,KAAWA,EAAC,KAClB,SAAA6W,GAAM,OAAIywG,EAAAS,MAAMyO,SAAS3/G,EAAQ,SAAA7W,GAAC,OAAEA,EAAC,UAEzC7S,KAAKilI,YAAY73H,KAAK,IAAI03H,EAAAI,uBAAuB,oBAAqBJ,EAAAK,eAAeE,sDAIrFrlI,KAAK0pB,OAAS,CACV+mB,GAAI0pF,EAAAS,MAAM6K,OACV6D,mBAAmB,+TCvB/B,IAAAxD,EAAAhpI,EAAA,8BACA0sI,EAAA1sI,EAAA,kCACAipI,EAAAjpI,EAAA,0BACA6xI,EAAA7xI,EAAA,oqCAEa8xI,cAET,SAAAA,EAAY1I,EAAe3H,EAAsB/B,GAAuB,IAAA1wD,EAAA,mGAAA0uD,CAAAx6H,KAAA4uI,IACpE9iE,EAAA2uD,EAAAz6H,KAAA06H,EAAAkU,GAAA/wI,KAAAmC,KAAM,kBAAmBkmI,KACpBK,QAAQ,IAAIiD,EAAAI,qBAAqB1D,IACtCp6D,EAAKy6D,QAAQ,IAAIR,EAAAO,cAAcJ,EAAe3H,EAAsB/B,IAHA1wD,8OAFrCg6D,EAAAM,uGAQf18G,GAChB,OAAO,IAAIilH,EAAAD,4BAA4BhlH,iDAIvC,MAAO,CACHykF,SAAU,SAACzuE,GAAD,OAAqC,IAA3BA,EAAKmgG,WAAW/hI,6CAQhCorI,GAER,OAAIA,EAAUwB,eAAe5sI,QAAU,EAC5B,CACH6sI,MAAO,EACP3/G,QAAS,GAIVhrB,KAAK4qI,MAAM,GAAGC,YAAY3B,EAAUwB,eAAe,+CAG3ClE,EAAWC,GAAgC,IAAjBC,IAAiB,EAAAvzH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACtD6D,EAAS,GAsBb,OArBG0vH,GACC1vH,EAAO5J,KAAK,CAAC,gBAAiB,oBAAqB,gBAAiB,gBAAiB,iBAAkB,aAAc,aAAc,cAIvIo5H,EAAU9xD,KAAKp9D,QAAQ,SAAC69D,EAAK59D,GAEzBP,EAAO5J,KAAPsK,MAAAV,EAAMkxH,EAAS/yD,EAAIq5D,QAAQp2G,IAAI,SAAC2qG,EAAQkH,GAAT,MAAuB,CAClD90D,EAAIm2D,aACJ9E,EAAUwH,cAAc74D,EAAIm2D,cAC5Bn2D,EAAIs5D,qBAAqBxE,GAAa,GACtC90D,EAAIs5D,qBAAqBxE,GAAa,GACtCzD,EAAU0H,cACVnL,EAAO,GACPA,EAAO,GACPkH,EAAY,SAMbjzH,qRC9Df,IAAAuwH,EAAAzqI,EAAA,iBACAq9H,EAAAr9H,EAAA,YACAwqI,EAAAxqI,EAAA,WACA+xI,EAAA/xI,EAAA,s1BAGakuI,cAMT,SAAAA,EAAYzkI,EAAM2/H,EAAe4D,GAAW,IAAAh+D,EAAA,mGAAA0uD,CAAAx6H,KAAAgrI,IACxCl/D,EAAA2uD,EAAAz6H,KAAA06H,EAAAsQ,GAAAntI,KAAAmC,KAAMuG,EAAM2/H,KACP4D,UAAYA,EAFuBh+D,8OANjBw7D,EAAAG,mFActBC,EAAelB,GAChB,KAAM,qDAAuDxmI,KAAKuG,2CAMxDmhI,EAAe2D,EAAYvB,EAAWtD,GAChD,KAAM,8DAAgExmI,KAAKuG,yCAOnEmhI,EAAe52E,EAAMq8E,EAAkB3G,GAC/C,KAAM,4DAA8DxmI,KAAKuG,wCAMlEmhI,EAAe/pH,EAAO6oH,wCAMrBkB,EAAelB,8CAITkB,EAAejqH,GAC7BiqH,EAAcyD,iBAAiBC,IAAIJ,EAAU8D,sBAAuBrxH,6CAGtDiqH,GACd,OAAOA,EAAcyD,iBAAiBtwH,IAAImwH,EAAU8D,mEAGpCpH,EAAejqH,GAC/BiqH,EAAcyD,iBAAiBC,IAAIJ,EAAU+D,wBAAyBtxH,+CAGtDiqH,GAChB,OAAOA,EAAcyD,iBAAiBtwH,IAAImwH,EAAU+D,0BAA4B,oCAI1ErH,EAAelB,GAAW,IAAAz6D,EAAA/rE,KAChC,OAAO+Z,QAAQC,UAAUO,KAAK,WAC1B,OAAOwxD,EAAKijE,KAAKtH,EAAelB,KACjCtK,MAAM,SAAAl/H,GAEL,MADAm9H,EAAAr7H,IAAIsb,MAAM,oCAAsC2xD,EAAKxlE,KAAMvJ,GACrDA,IACPud,KAAK,SAAA00H,GACJ,OAAOl1H,QAAQC,UAAUO,KAAK,WAG1B,OAFAwxD,EAAKmjE,oBAAoBxH,EAAe37D,EAAKojE,oBAAoBzH,IACjE37D,EAAKqjE,kBAAkB1H,EAAeuH,GAC/BljE,EAAKsjE,gBAAgB3H,EAAelB,KAC5CtK,MAAM,SAAAl/H,GAIL,MAHKA,aAAa6xI,EAAAS,yBACdnV,EAAAr7H,IAAIsb,MAAM,gCAAkC2xD,EAAKxlE,KAAMvJ,GAErDA,MAEXud,KAAK,WACJ,OAAOR,QAAQC,UAAUO,KAAK,WAC1B,OAAOwxD,EAAKwjE,YAAY7H,EAAelB,KACxCtK,MAAM,SAAAl/H,GAEL,MADAm9H,EAAAr7H,IAAIsb,MAAM,qCAAuC2xD,EAAKxlE,KAAMvJ,GACtDA,MAEXud,KAAK,WAEJ,OADAmtH,EAAce,WAAalB,EAAAmB,WAAWC,UAC/BjB,4CAKCA,EAAelB,GAAW,IAAA/F,EAAAzgI,KAClCmtI,EAAmBntI,KAAKmvI,oBAAoBzH,GAC5CuH,EAAiBjvI,KAAKwvI,kBAAkB9H,GACxCoC,EAAY1rI,KAAK4I,IAAIhH,KAAK8pI,UAAWmF,EAAiB9B,GAC1D,OAAwB8B,GAApB9B,EACOzF,EAEJ1nI,KAAKyvI,uBAAuB/H,GAAentH,KAAK,WAEnD,GAAImtH,EAAcgI,cACd,MAAM,IAAIb,EAAAS,wBAAwB,6BAEtC,OAAO5H,IACRntH,KAAK,WACJ,OAAOR,QAAQC,UAAUO,KAAK,WAC1B,OAAOkmH,EAAKkP,cAAcjI,EAAeyF,EAAkBrD,EAAWtD,KACvEtK,MAAM,SAAAl/H,GAEL,MADAm9H,EAAAr7H,IAAIsb,MAAM,yBAA2B+yH,EAAmB,IAAMrD,EAAY,oBAAsBrJ,EAAKl6H,KAAMvJ,GACrGA,MAEXud,KAAK,SAAAmnC,GACJ,OAAO3nC,QAAQC,UAAUO,KAAK,WAC1B,OAAOkmH,EAAKmP,aAAalI,EAAehmF,EAAOyrF,EAAkB3G,KAClEtK,MAAM,SAAAl/H,GAEL,MADAm9H,EAAAr7H,IAAIsb,MAAM,4BAA8B+yH,EAAmB,IAAMrD,EAAY,oBAAsBrJ,EAAKl6H,KAAMvJ,GACxGA,MAEXud,KAAK,SAAAs1H,GACJ,OAAO91H,QAAQC,UAAUO,KAAK,WAC1B,OAAOkmH,EAAKqP,WAAWpI,EAAemI,EAAgBrJ,KACvDtK,MAAM,SAAAl/H,GAEL,MADAm9H,EAAAr7H,IAAIsb,MAAM,0BAA4B+yH,EAAmB,IAAMrD,EAAY,oBAAsBrJ,EAAKl6H,KAAMvJ,GACtGA,MAEXud,KAAK,SAACjY,GAGL,OAFA6qI,GAAoBrD,EACpBrJ,EAAKyO,oBAAoBxH,EAAeyF,GACjC1M,EAAKsP,kBAAkBrI,GAAentH,KAAK,WAC9C,OAAOkmH,EAAK4O,gBAAgB3H,EAAelB,4CAK1CkB,EAAehmF,EAAOyrF,EAAkB3G,GAAW,IAAArF,EAAAnhI,KAC5D,OAAO0hD,EAAMtpB,IAAI,SAAC04B,EAAM1zD,GAAP,OAAW+jI,EAAK6O,YAAYtI,EAAe52E,EAAMq8E,EAAiB/vI,EAAGopI,yCAM9EkB,GACR,MAAO,CACHiD,MAAO3qI,KAAKwvI,kBAAkB9H,GAC9B18G,QAAShrB,KAAKmvI,oBAAoBzH,8CAIxBA,GACd,IAAIuI,EAAWjwI,KAAKkmI,cAAc/F,aAAauH,EAAcrM,aAAa6U,YAAYvU,SAASkP,YAAYnD,EAAcrM,cACzH,OAAOr7H,KAAKkmI,cAAciK,2BAA2BzI,EAAcrM,aAAa5qF,GAAIw/F,kDAGjEvI,GACnB,OAAO1nI,KAAKkmI,cAAc/F,aAAauH,EAAcrM,aAAa6U,YAAYvU,SAASyU,oBAAoB1I,EAAcrM,uCA1JtH0T,wBAA0B,gCAHxB/D,EAIF8D,sBAAwB,sQCR/B,SAAAuB,EAAY1nG,EAASjJ,gGAAM86F,CAAAx6H,KAAAqwI,GACvBrwI,KAAK2oC,QAAUA,EACf3oC,KAAK0/B,KAAOA,EACZ1/B,KAAKuG,KAAOvG,KAAKkI,YAAY3B,8FCLrC,IAAA+pI,EAAAxzI,EAAA,sBAAAoH,OAAAiT,KAAAm5H,GAAAh5H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAy1H,EAAAh7H,QACA,IAAAi7H,EAAAzzI,EAAA,gCAAAoH,OAAAiT,KAAAo5H,GAAAj5H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA01H,EAAAj7H,QACA,IAAAk7H,EAAA1zI,EAAA,6CAAAoH,OAAAiT,KAAAq5H,GAAAl5H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA21H,EAAAl7H,QACA,IAAAm7H,EAAA3zI,EAAA,6CAAAoH,OAAAiT,KAAAs5H,GAAAn5H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA41H,EAAAn7H,QACA,IAAAu5H,EAAA/xI,EAAA,+BAAAoH,OAAAiT,KAAA03H,GAAAv3H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAg0H,EAAAv5H,QACA,IAAAo7H,EAAA5zI,EAAA,sCAAAoH,OAAAiT,KAAAu5H,GAAAp5H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA61H,EAAAp7H,QACA,IAAAq7H,EAAA7zI,EAAA,2BAAAoH,OAAAiT,KAAAw5H,GAAAr5H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA81H,EAAAr7H,qYCNA,IAAAg7H,EAAAxzI,EAAA,2pBACa0uI,sZAAgC8E,EAAAD,mMCD7C,IAAAC,EAAAxzI,EAAA,2pBACa8zI,sZAAgCN,EAAAD,+MCD7C,IAAAC,EAAAxzI,EAAA,2pBACa+zI,sZAA4CP,EAAAD,2NCDzD,IAAAC,EAAAxzI,EAAA,2pBACag0I,sZAA4CR,EAAAD,+MCDzD,IAAAC,EAAAxzI,EAAA,2pBACawyI,sZAAgCgB,EAAAD,yMCD7C,IAAAC,EAAAxzI,EAAA,2pBACai0I,sZAAsCT,EAAAD,qMCDnD,IAAAC,EAAAxzI,EAAA,2pBACak0I,sZAA4BV,EAAAD,wLCDzC,IAAAlW,EAAAr9H,EAAA,sLAEam0I,aAKT,SAAAA,EAAYz3G,gGAASghG,CAAAx6H,KAAAixI,GAAAjxI,KAHrBkxI,OAAQ,EAGalxI,KAFrBw5B,QAAU,GAGFA,IACAx5B,KAAKw5B,QAAU2gG,EAAAS,MAAMp3H,MAAMg2B,uFAI/BlkB,EAAKlR,GACL,IAAI+sI,EAAYnxI,KAAKw5B,QAAQlkB,GAC7B,GAAa,MAATlR,EAAe,CACFpE,KAAKw5B,QAAQlkB,GAAOlR,EACjCpE,KAAKkxI,MAAqB,MAAbC,GAAkC,MAAbA,GAAqBA,GAAa/sI,cAG7DpE,KAAKw5B,QAAQlkB,GACpBtV,KAAKkxI,MAAqB,MAAbC,8BAIjB77H,GACA,OAAOtV,KAAKw5B,QAAQlkB,uCAGZA,GACR,OAAOtV,KAAKw5B,QAAQ9kB,eAAeY,kCAGhCA,UACItV,KAAKw5B,QAAQlkB,mCAGhBoqB,GACJ,OAAO1/B,KAAKorI,IAAI,OAAQ1rG,qCAIxB,OAAO1/B,KAAK6a,IAAI,yCAIhB,IAAIu2H,EAAMjX,EAAAS,MAAM70E,UAAU/lD,MACtB0/B,EAAO1/B,KAAKqzC,UAKhB,OAJI3T,IACAA,EAAOA,EAAK67F,SACZ6V,EAAI53G,QAAJ,KAAsBkG,GAEnB0xG,uLCpDf,IAAAC,2SAAAC,CAAAx0I,EAAA,gCAGA,IAAAy0I,EAAAz0I,EAAA,uBAAAoH,OAAAiT,KAAAo6H,GAAAj6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA02H,EAAAj8H,SACA,IAAAwzH,EAAAhsI,EAAA,SAAAoH,OAAAiT,KAAA2xH,GAAAxxH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAiuH,EAAAxzH,SACA,IAAAm8H,EAAA30I,EAAA,mBAAAoH,OAAAiT,KAAAs6H,GAAAn6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA42H,EAAAn8H,SACA,IAAAo8H,EAAA50I,EAAA,wBAAAoH,OAAAiT,KAAAu6H,GAAAp6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA62H,EAAAp8H,SACA,IAAAq8H,EAAA70I,EAAA,4BAAAoH,OAAAiT,KAAAw6H,GAAAr6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA82H,EAAAr8H,SACA,IAAAs8H,EAAA90I,EAAA,kBAAAoH,OAAAiT,KAAAy6H,GAAAt6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA+2H,EAAAt8H,SACA,IAAAu8H,EAAA/0I,EAAA,uBAAAoH,OAAAiT,KAAA06H,GAAAv6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAg3H,EAAAv8H,SACA,IAAAw8H,EAAAh1I,EAAA,kBAAAoH,OAAAiT,KAAA26H,GAAAx6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAi3H,EAAAx8H,SACA,IAAAwvH,EAAAhoI,EAAA,8BAAAoH,OAAAiT,KAAA2tH,GAAAxtH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAiqH,EAAAxvH,SACA,IAAAuvH,EAAA/nI,EAAA,oBAAAoH,OAAAiT,KAAA0tH,GAAAvtH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAgqH,EAAAvvH,SACA,IAAAiyH,EAAAzqI,EAAA,gBAAAoH,OAAAiT,KAAAowH,GAAAjwH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA0sH,EAAAjyH,SACA,IAAAwwH,EAAAhpI,EAAA,gBAAAoH,OAAAiT,KAAA2uH,GAAAxuH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAirH,EAAAxwH,SACA,IAAAgyH,EAAAxqI,EAAA,UAAAoH,OAAAiT,KAAAmwH,GAAAhwH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAysH,EAAAhyH,SACA,IAAAy8H,EAAAj1I,EAAA,oBAAAoH,OAAAiT,KAAA46H,GAAAz6H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAk3H,EAAAz8H,SACA,IAAA08H,EAAAl1I,EAAA,6BAAAoH,OAAAiT,KAAA66H,GAAA16H,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAm3H,EAAA18H,ujBCjBkC,CAC9B28H,KAAM,wSCDGC,yNAEC7W,qCAKDA,oJCPb,IAAAkM,EAAAzqI,EAAA,gBACAi1I,EAAAj1I,EAAA,oBACAq9H,EAAAr9H,EAAA,YACAy0I,EAAAz0I,EAAA,iMAGaq1I,aAgBT,SAAAA,EAAYjC,EAAazJ,EAAeh2F,gGAAI+pF,CAAAx6H,KAAAmyI,GAAAnyI,KAZ5C0qI,eAAiB,GAY2B1qI,KAX5CoyI,OAAS7K,EAAAmB,WAAW2J,SAWwBryI,KAV5CyoI,WAAalB,EAAAmB,WAAWn5D,QAUoBvvE,KAT5CmrI,iBAAmB,IAAIoG,EAAAN,iBASqBjxI,KAP5CsyI,UAAY,KAOgCtyI,KAN5CuyI,WAAa,IAAIpzH,KAM2Bnf,KAL5CwyI,QAAU,KAKkCxyI,KAJ5CyyI,YAAc,KAI8BzyI,KAF5C0yI,kBAAoB,GAIZ1yI,KAAKywC,GADNA,MAAAA,EACW0pF,EAAAS,MAAM6K,OAENh1F,EAGdzwC,KAAKkwI,YAAcA,EACnBlwI,KAAKymI,cAAgBA,qGAOLkM,GAChB,IAAIjL,EAAgB,IAAIqK,EAAAa,cAAcD,EAAU3yI,MAEhD,OADAA,KAAK0qI,eAAet9H,KAAKs6H,GAClBA,sCAIP,OAAQ1nI,KAAKwyI,6CAQb,OAAOxyI,KAAKoyI,SAAW7K,EAAAmB,WAAWmK,wCAOlC7yI,KAAK0qI,eAAepzH,QAAQ,SAAAw7H,GACxBA,EAAGpD,eAAgB,IAEvB1vI,KAAKoyI,OAAS7K,EAAAmB,WAAWmK,2CAIzB,OAAO7yI,KAAKmrI,iBAAiB93F,2CAGiB,IAA3C0/F,EAA2C,EAAA5/H,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAtB,GAAI6/H,IAAkB,EAAA7/H,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAC1C8/H,EAAc9Y,EAAAS,MAAM50E,cAKxB,OAJKgtF,IACDC,EAAc9Y,EAAAS,MAAM30E,WAGjBk0E,EAAAS,MAAMzlH,OAAO,GAAI89H,EAAYjzI,KAAM,SAACoE,EAAOkR,EAAKuV,EAAQmX,GAC3D,OAAuC,EAAnC+wG,EAAmBjrI,QAAQwN,GACpB,MAG+C,EAAtD,CAAC,gBAAiB,oBAAoBxN,QAAQwN,GACvClR,EAAMm3H,SAEbn3H,aAAiB3G,MACV08H,EAAAS,MAAMuB,YAAY/3H,GAGzBA,aAAiB2tI,EAAAa,cACVxuI,EAAMm3H,OAAO,CAAC,gBAAiByX,QAD1C,mPClFR,SAAAE,EAAYziG,EAAIkrF,gGAAQnB,CAAAx6H,KAAAkzI,GACpBlzI,KAAKywC,GAAKA,EACVzwC,KAAK27H,QAAUA,8RCNVwX,gOAEU1M,GACf,IAAIzvH,EAAS,GAMb,OALAyvH,EAAcxB,YAAY3tH,QAAQ,SAAC/W,EAAGnD,GAC/BmD,EAAE6yI,cACDp8H,GAAUzW,EAAEgG,KAAO,IAAMkgI,EAAc/8G,OAAOnpB,EAAEgG,MAAQ,OAGzDyQ,4ICVf,IAAA25H,EAAA7zI,EAAA,sCACAyqI,EAAAzqI,EAAA,gBACAq9H,EAAAr9H,EAAA,YACA4zI,EAAA5zI,EAAA,iDACAyzI,EAAAzzI,EAAA,qNAEau2I,aAKT,SAAAA,EAAYnN,EAAeoN,EAAWC,gGAAqB/Y,CAAAx6H,KAAAqzI,GACvDrzI,KAAKkmI,cAAgBA,EACrBlmI,KAAKszI,UAAYA,EACjBtzI,KAAKuzI,oBAAsBA,qFAI3BC,EAAW5X,EAAqBl8F,GAA+C,IAC3E+zG,EACAhN,EAF2E36D,EAAA9rE,KAAzCsgI,IAAyC,EAAAntH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAI/E,OAAO4G,QAAQC,UAAUO,KAAK,WAM1B,KAJIk5H,EADAtZ,EAAAS,MAAMh9E,SAAS41F,GACT1nE,EAAKo6D,cAAc/F,aAAaqT,GAEhCA,GAGN,MAAM,IAAI7C,EAAAK,oBAAoB,gBAAkBwC,GAKpD,OAFA/M,EAAgBgN,EAAIC,oBAAoB9X,GAEjC9vD,EAAKqiC,SAASslC,EAAKhN,EAAe/mG,KAC1CnlB,KAAK,SAAA+4D,GACJ,OAAOxH,EAAKo6D,cAAcyN,mBAAmBF,EAAIltI,KAAMkgI,EAAe/mG,GAAMnlB,KAAK,SAAA8gH,GAG7E,GAAGvvD,EAAKwnE,UAGJ,OAFAnZ,EAAAr7H,IAAIsuD,MAAM,SAAWqmF,EAAIltI,KAAO,gBAAgB80H,EAAa5qF,GAAG,yBAChEq7B,EAAKwnE,UAAUvX,WAAWV,EAAa5qF,IAChC4qF,EAGX,IAAIuY,EAAmB9nE,EAAK+nE,SAASJ,EAAKpY,GAC1C,OAAGiF,EACQjF,EAEJuY,uCAKVH,EAAKhN,EAAe/mG,GACzB,OAAO1/B,KAAKkmI,cAAc4N,oBAAoBL,EAAIltI,KAAMkgI,GAAelsH,KAAK,SAAAw5H,GACxE,GAAqB,MAAjBA,EAAuB,CACvB,IAAKN,EAAIzK,cACL,MAAM,IAAI2H,EAAAK,oBAAoB,qDAGlC+C,EAAcrJ,eAAepzH,QAAQ,SAAA4xH,GACjC,GAAIA,EAAUkJ,QAAU7K,EAAAmB,WAAWn5D,QAC/B,MAAM,IAAIohE,EAAAK,oBAAoB,SAAW9H,EAAUyJ,SAAW,4BAI1E,GAAIc,EAAIO,yBAA2BP,EAAIO,uBAAuB7lC,SAASs4B,GACnE,MAAM,IAAIiK,EAAAK,8BAA8B,sDAAsD0C,EAAIltI,MAGtG,GAAGktI,EAAIQ,mBAAqBR,EAAIQ,iBAAiB9lC,SAASzuE,GACtD,MAAM,IAAI6wG,EAAAK,wBAAwB,gDAAgD6C,EAAIltI,MAG1F,OAAO,oCAKP2tI,GAAiB,IAAAnoE,EAAA/rE,KAErB,OAAO+Z,QAAQC,UAAUO,KAAK,WAC1B,OAAG4/G,EAAAS,MAAMh9E,SAASs2F,GACPnoE,EAAKm6D,cAAciO,oBAAoBD,GAE3CA,IACR35H,KAAK,SAAA8gH,GACJ,IAAIA,EACA,MAAM,IAAIsV,EAAAK,oBAAoB,iBAAmBkD,EAAmB,kBAGxE,GAAI7Y,EAAa+W,SAAW7K,EAAAmB,WAAW2J,SACnC,MAAM,IAAI1B,EAAAK,oBAAoB,iBAAmB3V,EAAa5qF,GAAK,qBAGvE,IAAIkrF,EAAUN,EAAa6U,YAAYvU,QACnC8X,EAAM1nE,EAAKm6D,cAAc/F,aAAaxE,GAC1C,IAAI8X,EACA,MAAM,IAAI9C,EAAAK,oBAAoB,gBAAkBrV,GAGpD,OAAQ5vD,EAAK8nE,SAASJ,EAAKpY,sCAI1BoY,EAAKpY,GACV,IAAIM,EAAU8X,EAAIltI,KAElB,OADA4zH,EAAAr7H,IAAIs1I,KAAK,SAAWzY,EAAU,8CAAgDN,EAAaoL,cAAgB,IAAKpL,EAAahoF,WACtHogG,EAAIxX,QAAQZ,GAAc9gH,KAAK,SAAA8gH,GAElC,OADAlB,EAAAr7H,IAAIs1I,KAAK,SAAWzY,EAAU,+CAAiDN,EAAaoL,cAAgB,gCAAkCpL,EAAa+W,OAAS,KAC7J/W,IACRa,MAAM,SAAAl/H,GAEL,MADAm9H,EAAAr7H,IAAIsb,MAAM,SAAWuhH,EAAU,qEAAuEN,EAAaoL,cAAgB,IAAKzpI,GAClIA,+TClHlBF,EAAA,8BAAA,IACAq9H,EAAAr9H,EAAA,sLAEakoI,aAIT,SAAAA,EAAYt7G,gGAAO8wG,CAAAx6H,KAAAglI,GAAAhlI,KAHnBilI,YAAc,GAGKjlI,KAFnB0pB,OAAO,GAGH1pB,KAAKq0I,kBACLr0I,KAAKs0I,oBACD5qH,GACAywG,EAAAS,MAAMtpE,WAAWtxD,KAAK0pB,OAAQA,qLAY5B,IAAAoiD,EAAA9rE,KACN,OAAOA,KAAKilI,YAAY1+E,MAAM,SAAC4rE,EAAK/0H,GAAN,OAAU+0H,EAAIhkB,SAASriC,EAAKpiD,OAAOyoG,EAAI5rH,MAAOulE,EAAKpiD,gDAGvE6c,GACV,IAAIguG,EAAMv0I,KAAKilI,YACX9S,EAAM,KACV,OAAI5rF,EAAKvnB,QAAQunC,MAAM,SAAAhgD,GAEf,SADA4rH,EAAMgI,EAAAS,MAAMjgF,KAAK45F,EAAM,SAAAh0I,GAAC,OAAEA,EAAEgG,MAAQA,OAIpCguI,EAAOpiB,EAAIqiB,kBACJ,KAIRriB,EAFI,mCAMT5rF,EAAMgoE,GACR,GAAyB,IAArBp7F,UAAUrV,OASd,OADAq8H,EAAAS,MAAMnmH,IAAIzU,KAAK0pB,OAAQ6c,EAAMgoE,GACtBA,EARH,IAAI4jB,EAAMnyH,KAAKy0I,cAAcluG,GACzBzrB,EAAMq/G,EAAAS,MAAM//G,IAAI7a,KAAK0pB,OAAQ6c,EAAM,MACvC,OAAG4rF,EACQA,EAAI/tH,MAAM0W,GAEbA,qCAMN,IAAAixD,EAAA/rE,KACFgX,EAAS,iBAiBb,OAfAhX,KAAKilI,YAAY3tH,QAAQ,SAAC/W,EAAGnD,GAEzB,IAAI0d,EAAMixD,EAAKriD,OAAOnpB,EAAEgG,MAUxByQ,GAAUzW,EAAEgG,KAAO,IAAIuU,EAAM,MAEjC9D,GAAQ,qCAKR,MAAO,CACH0S,OAAQ1pB,KAAK0pB,kQChFzB,MAAAgrH,EAAA53I,EAAA,oBACA63I,KAAA73I,EAAA,oCACAq9H,EAAAr9H,EAAA,YACA20I,EAAA30I,EAAA,oBACA80I,EAAA90I,EAAA,mBACAi1I,EAAAj1I,EAAA,qBACAy0I,EAAAz0I,EAAA,wBACAs9H,EAAAt9H,EAAA,88BAIa83I,cAUT,SAAAA,EAAYC,GAAoE,IAAA/oE,EAAhDgpE,EAAgD,EAAA3hI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAvC,oBAAqB4hI,EAAkB,EAAA5hI,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAAA,OAAAqnH,EAAAx6H,KAAA40I,IAC5E9oE,EAAA2uD,EAAAz6H,KAAA06H,EAAAka,GAAA/2I,KAAAmC,QACK80I,OAASA,EACdhpE,EAAK+oE,mBAAqBA,EACtBE,EACAjpE,EAAKipE,WAAWx6H,KAAK,WACjBuxD,EAAKkpE,WACN9Y,MAAM,SAAAl/H,GACLm9H,EAAAr7H,IAAIsb,MAAMpd,GACV8uE,EAAKkpE,WAGTlpE,EAAKkpE,SAZmElpE,8OAV9C4oE,EAAAO,mDA2B9Bj1I,KAAKk1I,UAAYP,EAAAt2H,QAAIP,KAAK9d,KAAK80I,OAAQ,EAAG,SAAAK,GAGtC,OAAQA,EAAU94H,YACd,KAAK,EACD84H,EAAUn4H,kBAAkB,iBAC5B,IAAIo4H,EAAkBD,EAAUn4H,kBAAkB,kBAClDo4H,EAAgBx4H,YAAY,gBAAiB,iBAAkB,CAACsoE,QAAQ,IACxEkwD,EAAgBx4H,YAAY,aAAc,aAAc,CAACsoE,QAAQ,IACjEkwD,EAAgBx4H,YAAY,SAAU,SAAU,CAACsoE,QAAQ,IACzDiwD,EAAUn4H,kBAAkB,0BAC5Bm4H,EAAUn4H,kBAAkB,uBACLm4H,EAAUn4H,kBAAkB,mBAClCJ,YAAY,iBAAkB,iBAAkB,CAACsoE,QAAQ,IAExDiwD,EAAUn4H,kBAAkB,eAClCJ,YAAY,gBAAiB,iBAAkB,CAACsoE,QAAQ,IACxE,KAAK,EACDiwD,EAAU74H,YAAYQ,YAAY,iBAAiBF,YAAY,KAAM,KAAM,CAACsoE,QAAQ,OAKhGllF,KAAKq1I,eAAiB,IAAIC,EAAe,gBAAiBt1I,KAAKk1I,WAC/Dl1I,KAAKu1I,gBAAkB,IAAID,EAAe,iBAAkBt1I,KAAKk1I,WACjEl1I,KAAKw1I,wBAA0B,IAAIF,EAAe,yBAA0Bt1I,KAAKk1I,WACjFl1I,KAAKy1I,oBAAsB,IAAIH,EAAe,sBAAuBt1I,KAAKk1I,WAC1El1I,KAAK01I,iBAAmB,IAAIJ,EAAe,kBAAmBt1I,KAAKk1I,WACnEl1I,KAAK21I,aAAe,IAAIL,EAAe,cAAet1I,KAAKk1I,8CAGpD,IAAAnpE,EAAA/rE,KACP,OAAO+Z,QAAQC,UAAUO,KAAK,SAAAvE,GAAC,OAAE2+H,EAAAt2H,QAAID,OAAO2tD,EAAK+oE,oDAInC5E,EAAazJ,GAAc,IAAAhG,EAAAzgI,KACrCsV,EAAMtV,KAAK41I,uBAAuB1F,EAAYvU,QAAS8K,GAC3D,OAAOzmI,KAAKq1I,eAAevxF,OAAOxuC,GAAKiF,KAAK,WACxCkmH,EAAKoV,kBAAkB3F,GAAa,GAAO31H,KAAK,SAAAu7H,GAC5CA,EAAcx+H,QAAQmpH,EAAKsV,mBAAoBtV,KAGnDA,EAAKuV,uBAAuB9F,GAAa31H,KAAK,SAAAisH,GAC1C,OAAO/F,EAAKwV,gBAAgBzP,kDAKrBnL,GAAa,IAAA8F,EAAAnhI,KAC5B,OAAOA,KAAKu1I,gBAAgBzxF,OAAOu3E,EAAa5qF,IAAIl2B,KAAK,WACrD,OAAO4mH,EAAK+U,mBAAmB7a,EAAa5qF,IAAI,GAAOl2B,KAAK,SAAAmwH,GACxDA,EAAepzH,QAAQ6pH,EAAKgV,oBAAqBhV,mDAKzCuG,GAChB,OAAO1nI,KAAK01I,iBAAiB5xF,OAAO4jF,EAAcj3F,4CAGtC+1F,GACZ,OAAOxmI,KAAK21I,aAAa7xF,OAAO0iF,EAAU/1F,yCAMjC2lG,GACT,OAAOp2I,KAAK21I,aAAa96H,IAAIu7H,kDAGVlG,GACnB,OAAOlwI,KAAK21I,aAAaU,WAAW,gBAAiBnG,EAAYz/F,0CAGvD+1F,GACV,OAAOxmI,KAAK21I,aAAalhI,IAAI+xH,EAAU/1F,GAAI+1F,GAAWjsH,KAAK,SAAAxd,GAAC,OAAEypI,2CAInD7K,EAAS8K,GAAe,IAAAhF,EAAAzhI,KAC/BsV,EAAMtV,KAAK41I,uBAAuBja,EAAS8K,GAC/C,OAAOzmI,KAAKq1I,eAAex6H,IAAIvF,GAAKiF,KAAK,SAAA62H,GAAG,OAAEA,EAAM3P,EAAK6U,kBAAkBlF,GAAOA,4CAItElB,EAAazJ,GACzB,IAAInxH,EAAMtV,KAAK41I,uBAAuB1F,EAAYvU,QAAS8K,GAC3D,OAAOzmI,KAAKq1I,eAAe5gI,IAAIa,EAAK46H,GAAa31H,KAAK,SAAAxd,GAAC,OAAEmzI,6CAI5C7U,GAAc,IAAAwG,EAAA7hI,KACvBoxI,EAAM/V,EAAaE,SACnBgb,EAAqBnF,EAAI1G,eAE7B,OADA0G,EAAI1G,eAAiB,KACd1qI,KAAKu1I,gBAAgB9gI,IAAI4mH,EAAa5qF,GAAI2gG,GAAK72H,KAAK,SAAAxd,GAAC,OAAE8kI,EAAK2U,uBAAuBD,KAAqBh8H,KAAK,SAAAxd,GAAC,OAAEs+H,uDAGhGW,EAAgBiU,GACvC,OAAOjwI,KAAKw1I,wBAAwB/gI,IAAIunH,EAAgBiU,mDAGpCjU,GACpB,OAAOh8H,KAAKw1I,wBAAwB36H,IAAImhH,gDAGvBA,EAAgBya,GACjC,OAAOz2I,KAAKy1I,oBAAoBhhI,IAAIunH,EAAgBya,+CAGpCza,GAChB,OAAOh8H,KAAKy1I,oBAAoB56H,IAAImhH,6CAItB0L,GACd,IAAI0J,EAAM1J,EAAcnM,OAAO,CAAC,iBAChC,OAAOv7H,KAAK01I,iBAAiBjhI,IAAIizH,EAAcj3F,GAAI2gG,GAAK72H,KAAK,SAAAxd,GAAC,OAAE2qI,mDAG7CgD,GAAsC,IAAA3I,EAAA/hI,KAAtB02I,EAAsB,EAAAvjI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAJ,GACrD,GAAIu3H,EAAe5sI,QAAU44I,EAAgB54I,OACzC,OAAOic,QAAQC,QAAQ08H,GAE3B,IAAIC,EAAmBjM,EAAegM,EAAgB54I,QACtD,OAAOkC,KAAK01I,iBAAiBjhI,IAAIkiI,EAAiBlmG,GAAIkmG,GAAkBp8H,KAAK,WAEzE,OADAm8H,EAAgBtpI,KAAKupI,GACd5U,EAAKyU,uBAAuB9L,EAAgBgM,iDAIvCjmG,GAAI,IAAA0xF,EAAAniI,KACpB,OAAOA,KAAKu1I,gBAAgB16H,IAAI41B,GAAIl2B,KAAK,SAAA62H,GACrC,OAAOjP,EAAKyU,2BAA2BxF,wDAIpByF,GAAgC,IAAAC,EAAA92I,KAAf+2I,IAAe,EAAA5jI,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACvD,OAAK0jI,EAGE72I,KAAKk2I,mBAAmBW,EAAgBpmG,IAAI,GAAOl2B,KAAK,SAAAqwH,GAE3D,OADAiM,EAAgBnM,eAAiBE,EAC5BmM,EAGED,EAAKE,mBAAmBH,GAFpBA,IALJ98H,QAAQC,QAAQ,0DAWHi9H,GAAkD,IAAAC,EAAAl3I,KAA7B+2I,IAA6B,EAAA5jI,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAdgkI,EAAc,EAAAhkI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAJ,GACtE,OAAI8jI,EAAoBn5I,QAAUq5I,EAAQr5I,OAC/Bic,QAAQC,QAAQm9H,GAEpBn3I,KAAK42I,2BAA2BK,EAAoBE,EAAQr5I,QAASi5I,GAAQx8H,KAAK,SAAC8gH,GAGtF,OAFA8b,EAAQ/pI,KAAKiuH,GAEN6b,EAAKE,4BAA4BH,EAAqBF,EAAQI,gDAI1Dnb,GAA+B,IAAAqb,EAAAr3I,KAAf+2I,IAAe,EAAA5jI,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAC9C,OAAOnT,KAAK01I,iBAAiB4B,cAAc,iBAAkBtb,GAAgBzhH,KAAK,SAAAg9H,GAC9E,OAAKR,EAGEQ,EAAKn/G,IAAI,SAAAg5G,GAAG,OAAEiG,EAAKG,oBAAoBpG,KAFnCmG,8CAQDrH,GAA6C,IAAAuH,EAAAz3I,KAAhC03I,IAAgC,EAAAvkI,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAC3D,OAAOnT,KAAKu1I,gBAAgB+B,cAAc,gBAAiBpH,EAAYz/F,IAAIl2B,KAAK,SAAAmP,GAC5E,IAAIukF,EAASvkF,EAAO2iB,KAAK,SAAU7uC,EAAGkB,GAClC,OAAOlB,EAAE+0I,WAAWoF,UAAYj5I,EAAE6zI,WAAWoF,YAGjD,OAAKD,EAIED,EAAKL,4BAA4BnpC,GAAQ,GAHrCA,0DAOWiiC,GAAa,IAAA0H,EAAA53I,KACvC,OAAOA,KAAK61I,kBAAkB3F,GAAa,GAAO31H,KAAK,SAAAs9H,GAAU,OAAED,EAAKhB,2BAA2BiB,EAAWA,EAAW/5I,OAAS,mDAGjHoyI,EAAayC,GAC9B,OAAO3yI,KAAK61I,kBAAkB3F,GAAa31H,KAAK,SAAAu7H,GAC5C,IAAIpL,EAAiB,GACrBoL,EAAcx+H,QAAQ,SAAA+jH,GAAY,OAAEA,EAAaqP,eAAeloF,OAAO,SAAAr6C,GAAC,OAAEA,EAAEwqI,WAAaA,IAAUr7H,QAAQ,SAACnP,GAAD,OAAKuiI,EAAet9H,KAAKjF,OACpI,IAAI2vI,EAAS,KAMb,OALApN,EAAepzH,QAAQ,SAAAnP,IACL,MAAV2vI,GAAkBA,EAAOxF,UAAUqF,UAAYxvI,EAAEmqI,UAAUqF,aAC3DG,EAAS3vI,KAGV2vI,8CAIG1G,GACd,OAAO,IAAIQ,EAAAsB,YAAY9B,EAAI3gG,GAAI2gG,EAAIzV,wDAGhByV,GACnB,IAAIjG,EAAmB,IAAIoG,EAAAN,iBAC3B9F,EAAiB3xG,QAAU43G,EAAI53G,QAC/B,IAAIkG,EAAOyrG,EAAiB93F,UAC5B,GAAI3T,EAAM,CACN,IAAIq4G,EAAY,IAAI3d,EAAA0B,UACpBic,EAAUC,YAAYt4G,EAAM1/B,KAAK60I,oBACjC1J,EAAiBr1F,QAAQiiG,GAE7B,OAAO5M,6CAGQiG,GAAK,IAAA6G,EAAAj4I,KAEhByzI,EAAMzzI,KAAKmgI,aAAaiR,EAAIlB,YAAYvU,SACxCuU,EAAclwI,KAAKs2I,kBAAkBlF,EAAIlB,aACzCzJ,EAAgBgN,EAAIC,oBAAoBtC,EAAI3K,cAAc/8G,QAC1D2xG,EAAe,IAAIoW,EAAAU,aAAajC,EAAazJ,EAAe2K,EAAI3gG,IAChE06F,EAAmBnrI,KAAKk4I,uBAAuB9G,EAAIjG,kBACvD,OAAOhR,EAAAS,MAAMn8E,UAAU48E,EAAc+V,EAAK,SAACtwG,EAAUiJ,EAAUz0B,EAAKuV,EAAQxV,EAAQ2sB,GAChF,MAAY,gBAAR1sB,EACO46H,EAEC,qBAAR56H,EACO61H,EAEC,kBAAR71H,EACOmxH,EAEC,iBAARnxH,EACO+lH,EAGC,mBAAR/lH,EACOy0B,EAAS3R,IAAI,SAAA+/G,GAAO,OAAIF,EAAKT,oBAAoBW,EAAS9c,UADrE,gDAMY+V,EAAK/V,GACrB,IAAIqM,EAAgB,IAAIqK,EAAAa,cAAcxB,EAAIuB,SAAUtX,EAAc+V,EAAI3gG,IAClE06F,EAAmBnrI,KAAKk4I,uBAAuB9G,EAAIjG,kBACvD,OAAOhR,EAAAS,MAAMn8E,UAAUipF,EAAe0J,EAAK,SAACtwG,EAAUiJ,EAAUz0B,EAAKuV,EAAQxV,EAAQ2sB,GACjF,MAAY,iBAAR1sB,EACO+lH,EAEC,qBAAR/lH,EACO61H,OADX,sCAQNmK,aAKF,SAAAA,EAAY/uI,EAAM2uI,GAAW1a,EAAAx6H,KAAAs1I,GACzBt1I,KAAKuG,KAAOA,EACZvG,KAAKk1I,UAAYA,wCAGjB5/H,GAAK,IAAA8iI,EAAAp4I,KACL,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,OAAOA,EAAGE,YAAY87H,EAAK7xI,MACtBuW,YAAYs7H,EAAK7xI,MAAMsU,IAAIvF,2CAI1B+iI,EAAW/iI,GAAK,IAAAgjI,EAAAt4I,KAC1B,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,OAAOA,EAAGE,YAAYg8H,EAAK/xI,MACtBuW,YAAYw7H,EAAK/xI,MAAMgR,MAAM8gI,GAAW96H,OAAOjI,wCAIjD+iI,EAAW/iI,GAAK,IAAAijI,EAAAv4I,KACvB,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,OAAOA,EAAGE,YAAYi8H,EAAKhyI,MACtBuW,YAAYy7H,EAAKhyI,MAAMgR,MAAM8gI,GAAWx9H,IAAIvF,iCAIrDA,EAAKwF,GAAK,IAAA09H,EAAAx4I,KACV,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,IAAMq8H,EAAKr8H,EAAGE,YAAYk8H,EAAKjyI,KAAM,aAErC,OADAkyI,EAAG37H,YAAY07H,EAAKjyI,MAAM6kI,IAAItwH,EAAKxF,GAC5BmjI,EAAGz8H,0CAIX1G,GAAK,IAAAojI,EAAA14I,KACR,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,IAAMq8H,EAAKr8H,EAAGE,YAAYo8H,EAAKnyI,KAAM,aAErC,OADAkyI,EAAG37H,YAAY47H,EAAKnyI,MAAM6X,OAAO9I,GAC1BmjI,EAAGz8H,2CAIV,IAAA28H,EAAA34I,KACJ,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,IAAMq8H,EAAKr8H,EAAGE,YAAYq8H,EAAKpyI,KAAM,aAErC,OADAkyI,EAAG37H,YAAY67H,EAAKpyI,MAAM44B,QACnBs5G,EAAGz8H,0CAIX,IAAA48H,EAAA54I,KACH,OAAOA,KAAKk1I,UAAU36H,KAAK,SAAA6B,GACvB,IAAMq8H,EAAKr8H,EAAGE,YAAYs8H,EAAKryI,MACzB4Q,EAAO,GACPwE,EAAQ88H,EAAG37H,YAAY87H,EAAKryI,MAUlC,OANCoV,EAAMk9H,kBAAoBl9H,EAAMiC,eAAe/f,KAAK8d,EAAO,SAAAJ,GACnDA,IACLpE,EAAK/J,KAAKmO,EAAOjG,KACjBiG,EAAOsC,cAGJ46H,EAAGz8H,SAASzB,KAAK,WAAA,OAAMpD,sSCnX1C,IAAA06H,EAAA/0I,EAAA,wBACA80I,EAAA90I,EAAA,mBACAq9H,EAAAr9H,EAAA,YACA20I,EAAA30I,EAAA,oBACA0zI,EAAA1zI,EAAA,yDACAyqI,EAAAzqI,EAAA,iBACA2zI,EAAA3zI,EAAA,yDACAy0I,EAAAz0I,EAAA,wBACAi1I,EAAAj1I,EAAA,qBACAs9H,EAAAt9H,EAAA,YACAg8I,EAAAh8I,EAAA,2LAEam4I,qIAET8D,UAAY,8FAEAtF,GACRzzI,KAAK+4I,UAAUtF,EAAIltI,MAAQktI,uCAGlBltI,GACT,OAAOvG,KAAK+4I,UAAUxyI,0CAKXo1H,EAAS8K,GACrB,KAAM,iGAIOnxH,EAAK46H,GACjB,KAAM,sGAGUz/F,GAChB,KAAM,uGAIO4qF,GACb,KAAM,6GAGiBW,EAAgBiU,GACvC,KAAM,0GAGcjU,GACpB,KAAM,+GAGWA,EAAgBya,GACjC,KAAM,2GAGUza,GAChB,KAAM,wGAKQ0L,GACd,KAAM,sGAIQwI,GACd,KAAM,iGAGGkG,GACT,KAAM,sGAGalG,GACnB,KAAM,uGAGI1J,GACV,KAAM,iGAIQ0J,EAAazJ,GAC3B,KAAM,uGAGSpL,GACf,KAAM,yGAGUqM,GAChB,KAAM,sGAGMlB,GACZ,KAAM,oGAIQ7K,EAAS8K,GACvB,IAAIyJ,EAAc,IAAI0B,EAAAsB,YAAY/Y,EAAAS,MAAM6K,OAAQ9J,GAChD,OAAO37H,KAAKg5I,gBAAgB9I,EAAazJ,+CAIzB9K,EAAS8K,GACzB,OAAOzmI,KAAKi5I,eAAetd,EAAS8K,GAAelsH,KAAK,SAAAvD,GAAM,QAAMA,IAAQklH,MAAM,SAAA9hH,GAAK,OAAE,mDAGtEuhH,EAAS8K,GAC5B,OAAO9K,EAAU,IAAMkW,EAAAsB,gBAAgB+F,YAAYzS,8CAOpC9K,EAAS8K,EAAe/mG,GAAM,IAAAosC,EAAA9rE,KAC7C,OAAOA,KAAKi5I,eAAetd,EAAS8K,GAAelsH,KAAK,SAAA21H,GACpD,GAAmB,MAAfA,EACA,OAAOpkE,EAAK+pE,kBAAkB3F,GAAa31H,KAAK,SAAAs9H,GAC5CA,EAAWvgI,QAAQ,SAAA4xH,GACf,GAAIA,EAAUiQ,YACV,MAAM,IAAI3I,EAAAK,oCAAoC,oDAAsDX,EAAYvU,SAEpH,GAAIuN,EAAUkJ,QAAU7K,EAAAmB,WAAWC,WAAaO,EAAUkJ,QAAU7K,EAAAmB,WAAW0Q,UAC3E,MAAM,IAAI3I,EAAAK,oCACN,gEAAkErK,EAChE,kEAId,IAAI0E,EAAmB0M,EAAWA,EAAW/5I,OAAS,GAAGqtI,iBAEzD,MAAO,CAAC+E,EAAa/E,KAK7B+E,EAAcpkE,EAAKutE,kBAAkB1d,EAAS8K,GAC9C,IAAI0E,EAAmB,IAAIoG,EAAAN,iBACvB8G,EAAY,IAAI3d,EAAA0B,UAGpB,OAFAic,EAAUuB,aAAa55G,EAAK65G,uBAC5BpO,EAAiBr1F,QAAQiiG,GAClBh+H,QAAQ62E,IAAI,CAACs/C,EAAa/E,MAClC5wH,KAAK,SAAAi/H,GACJ,IAAIne,EAAe,IAAIoW,EAAAU,aAAaqH,EAA4B,GAAI/S,GAGpE,OAFApL,EAAa8P,iBAAmBqO,EAA4B,GAC5Dne,EAAaoX,YAAc,IAAItzH,KACxB2sD,EAAK2tE,iBAAiBpe,KAC9Ba,MAAM,SAAAl/H,GACL,MAAMA,gDAIM2+H,EAAS8K,GAAe,IAAA16D,EAAA/rE,KACxC,OAAOA,KAAKi5I,eAAetd,EAAS8K,GAAelsH,KAAK,SAAC21H,GACrD,OAAIA,EAGGnkE,EAAK2tE,8BAA8BxJ,GAF/B,6DAMWA,GAC1B,OAAOlwI,KAAK61I,kBAAkB3F,GAAa31H,KAAK,SAAAs9H,GAAU,OAAEA,EAAWA,EAAW/5I,OAAQ,kDAGzEoyI,EAAayC,GAC9B,OAAO3yI,KAAK61I,kBAAkB3F,GAAa31H,KAAK,SAAAu7H,GAC5C,IAAIpL,EAAe,GACnBoL,EAAcx+H,QAAQ,SAAA+jH,GAAY,OAAEA,EAAaqP,eAAeloF,OAAO,SAAAr6C,GAAC,OAAEA,EAAEwqI,WAAaA,IAAUr7H,QAAQ,SAACnP,GAAD,OAAKuiI,EAAet9H,KAAKjF,OACpI,IAAI2vI,EAAS,KAMb,OALApN,EAAepzH,QAAQ,SAAAnP,IACL,MAAV2vI,GAAkBA,EAAOxF,UAAUqF,UAAYxvI,EAAEmqI,UAAUqF,aAC3DG,EAAS3vI,KAGV2vI,6CAIEpQ,GAEb,OADAA,EAAc+K,YAAc,IAAItzH,KACzBnf,KAAK25I,kBAAkBjS,kCAG3BvqI,GAGH,GAFAA,EAAEs1I,YAAc,IAAItzH,KAEjBhiB,aAAas0I,EAAAU,aACZ,OAAOnyI,KAAKy5I,iBAAiBt8I,GAGjC,GAAGA,aAAa40I,EAAAa,cACZ,OAAO5yI,KAAK25I,kBAAkBx8I,GAGlC,KAAM,yBAAyBA,iCAG5BA,GAEH,OAAGA,aAAas0I,EAAAU,aACLnyI,KAAK+1I,mBAAmB54I,GAGhCA,aAAa40I,EAAAa,cACL5yI,KAAKm2I,oBAAoBh5I,GAGjCA,aAAa27I,EAAAc,UACL55I,KAAKi2I,kBAGTl8H,QAAQE,OAAO,yBAAyB9c,6CAIjCi0I,GACd,OAAOA,iDAGYA,GACnB,OAAOA,6CAGQA,GACf,OAAOA,8CAGSA,EAAK/V,GACrB,OAAO+V,wdC1Of,IAAAsD,EAAA53I,EAAA,oBACAq9H,EAAAr9H,EAAA,uzBAEa+8I,qRACTC,kBAAoB,KACpBhE,cAAgB,KAChBpL,eAAiB,KACjBqP,kBAAoB,KACpBC,eAAiB,KACjBC,WAAa,mPANwBvF,EAAAO,yGAQnB/E,GAAY,IAAAnkE,EAAA/rE,KAU1B,OATAm6H,EAAAS,MAAMh0E,OAAO5mD,KAAK85I,kBAAoB,SAACI,EAAI5kI,GACpC4kI,IAAKhK,UACGnkE,EAAK+tE,kBAAkBxkI,KAItCtV,KAAK81I,cAActzF,OAAO,SAAA64E,GAAY,OAAEA,EAAa6U,YAAYz/F,IAAMy/F,EAAYz/F,KAAIzoC,UAAUsP,QAAQtX,KAAK+1I,mBAAoB/1I,MAClIA,KAAKi6I,WAAWz3F,OAAO,SAAAgkF,GAAS,OAAEA,EAAU0J,YAAYz/F,IAAMy/F,EAAYz/F,KAAIzoC,UAAUsP,QAAQtX,KAAKi2I,gBAAiBj2I,MAE/G+Z,QAAQC,qDAGAqhH,GACf,IAAI9jH,EAAQvX,KAAK81I,cAAchuI,QAAQuzH,GAMvC,OALU,EAAP9jH,GACCvX,KAAK81I,cAAc76G,OAAO1jB,EAAO,GAGrCvX,KAAK0qI,eAAeloF,OAAO,SAAAklF,GAAa,OAAEA,EAAcrM,aAAa5qF,KAAO4qF,EAAa5qF,KAAIzoC,UAAUsP,QAAQtX,KAAKm2I,oBAAqBn2I,MAClI+Z,QAAQC,sDAGC0tH,GAChB,IAAInwH,EAAQvX,KAAK0qI,eAAe5iI,QAAQ4/H,GAIxC,OAHU,EAAPnwH,GACCvX,KAAK0qI,eAAezvG,OAAO1jB,EAAO,GAE/BwC,QAAQC,kDAGHwsH,GACZ,IAAIjvH,EAAQvX,KAAKi6I,WAAWnyI,QAAQ0+H,GAIpC,OAHU,EAAPjvH,GACCvX,KAAKi6I,WAAWh/G,OAAO1jB,EAAO,GAE3BwC,QAAQC,iDAKJ2hH,EAAS8K,GACpB,IAAInxH,EAAMtV,KAAK41I,uBAAuBja,EAAS8K,GAC/C,OAAO1sH,QAAQC,QAAQha,KAAK85I,kBAAkBxkI,4CAIlC46H,EAAazJ,GACzB,IAAInxH,EAAMtV,KAAK41I,uBAAuB1F,EAAYvU,QAAS8K,GAE3D,OADAzmI,KAAK85I,kBAAkBxkI,GAAO46H,EACvBn2H,QAAQC,QAAQk2H,wCAGdkG,GACT,OAAOr8H,QAAQC,QAAQmgH,EAAAS,MAAMjgF,KAAK36C,KAAKi6I,WAAY,SAAAl9I,GAAC,OAAEA,EAAE0zC,KAAK2lG,oDAG1ClG,GACnB,OAAOn2H,QAAQC,QAAQmgH,EAAAS,MAAMjgF,KAAK36C,KAAKi6I,WAAY,SAAAl9I,GAAC,OAAEA,EAAEmzI,YAAYz/F,KAAKy/F,EAAYz/F,4CAG3E+1F,GAEV,OADAxmI,KAAKi6I,WAAW7sI,KAAKo5H,GACdzsH,QAAQC,QAAQwsH,+CAGP/1F,GAChB,OAAO12B,QAAQC,QAAQmgH,EAAAS,MAAMjgF,KAAK36C,KAAK81I,cAAe,SAAAr+C,GAAE,OAAEA,EAAGhnD,KAAKA,8CAIrD4qF,GAEb,OADAr7H,KAAK81I,cAAc1oI,KAAKiuH,GACjBthH,QAAQC,QAAQqhH,sDAGAW,EAAgBiU,GAEvC,OADAjwI,KAAK+5I,kBAAkB/d,GAAkBiU,EAClCl2H,QAAQC,QAAQi2H,mDAGHjU,GACpB,OAAOjiH,QAAQC,QAAQha,KAAK+5I,kBAAkB/d,iDAG7BA,EAAgBya,GAEjC,OADAz2I,KAAKg6I,eAAehe,GAAkBya,EAC/B18H,QAAQC,QAAQy8H,+CAGPza,GAChB,OAAOjiH,QAAQC,QAAQha,KAAKg6I,eAAehe,8CAI7B0L,GAEd,OADA1nI,KAAK0qI,eAAet9H,KAAKs6H,GAClB3tH,QAAQC,QAAQ0tH,6CAITwI,GACd,OAAOn2H,QAAQC,QAAQha,KAAK81I,cAActzF,OAAO,SAAAxlD,GAAC,OAAEA,EAAEkzI,YAAYz/F,IAAMy/F,EAAYz/F,KAAIpE,KAAK,SAAU7uC,EAAGkB,GACtG,OAAOlB,EAAE+0I,WAAWoF,UAAYj5I,EAAE6zI,WAAWoF,gNClHzD76I,EAAA,oBAAA,IACAq9H,EAAAr9H,EAAA,YACAq9I,EAAAr9I,EAAA,s0BAIas9I,sZAA6BD,EAAAN,kHAEjBQ,GAAwB,IAARt9F,EAAQ,EAAA5pC,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAF,EACvC,OAAO,IAAI4G,QAAQ,SAAAC,GACf4hB,WAAW,WACP5hB,EAAQqgI,IACTt9F,4CAKI4+E,EAAS8K,GACpB,IAAInxH,EAAMtV,KAAK41I,uBAAuBja,EAAS8K,GAC/C,OAAOzmI,KAAKs6I,qBAAqBt6I,KAAK85I,kBAAkBxkI,4CAI5C46H,EAAazJ,GACzB,IAAInxH,EAAMtV,KAAK41I,uBAAuB1F,EAAYvU,QAAS8K,GAE3D,OADAzmI,KAAK85I,kBAAkBxkI,GAAO46H,EACvBlwI,KAAKs6I,qBAAqBpK,wCAGxBkG,GACT,OAAOp2I,KAAKs6I,qBAAqBngB,EAAAS,MAAMjgF,KAAK36C,KAAKi6I,WAAY,SAAAl9I,GAAC,OAAEA,EAAE0zC,KAAK2lG,oDAGpDlG,GACnB,OAAOlwI,KAAKs6I,qBAAqBngB,EAAAS,MAAMjgF,KAAK36C,KAAKi6I,WAAY,SAAAl9I,GAAC,OAAEA,EAAEmzI,YAAYz/F,KAAKy/F,EAAYz/F,4CAGrF+1F,GAEV,OADAxmI,KAAKi6I,WAAW7sI,KAAKo5H,GACdxmI,KAAKs6I,qBAAqB9T,+CAGjB/1F,GAChB,OAAOzwC,KAAKs6I,qBAAqBngB,EAAAS,MAAMjgF,KAAK36C,KAAK81I,cAAe,SAAAr+C,GAAE,OAAEA,EAAGhnD,KAAKA,8CAI/D4qF,GAEb,OADAr7H,KAAK81I,cAAc1oI,KAAKiuH,GACjBr7H,KAAKs6I,qBAAqBjf,sDAGVW,EAAgBiU,GAEvC,OADAjwI,KAAK+5I,kBAAkB/d,GAAkBiU,EAClCjwI,KAAKs6I,qBAAqBrK,mDAGbjU,GACpB,OAAOh8H,KAAKs6I,qBAAqBt6I,KAAK+5I,kBAAkB/d,iDAGvCA,EAAgBya,GAEjC,OADAz2I,KAAKg6I,eAAehe,GAAkBya,EAC/Bz2I,KAAKs6I,qBAAqB7D,+CAGjBza,GAChB,OAAOh8H,KAAKs6I,qBAAqBt6I,KAAKg6I,eAAehe,8CAIvC0L,GAEd,OADA1nI,KAAK0qI,eAAet9H,KAAKs6H,GAClB1nI,KAAKs6I,qBAAqB5S,6CAInBwI,GACd,OAAOlwI,KAAKs6I,qBAAqBt6I,KAAK81I,cAActzF,OAAO,SAAAxlD,GAAC,OAAEA,EAAEkzI,YAAYz/F,IAAMy/F,EAAYz/F,KAAIpE,KAAK,SAAU7uC,EAAGkB,GAChH,OAAOlB,EAAE+0I,WAAWoF,UAAYj5I,EAAE6zI,WAAWoF,4CAI9C9sH,2NCnFX/tB,EAAA,gBACAA,EAAA,oBADA,IAEAq9H,EAAAr9H,EAAA,YACAA,EAAA,mCAUI,SAAA88I,EAAY1J,EAAaz/F,gGAAI+pF,CAAAx6H,KAAA45I,GAAA55I,KAJ7ByyI,YAAc,KAMNzyI,KAAKywC,GADNA,MAAAA,EACW0pF,EAAAS,MAAM6K,OAENh1F,EAGdzwC,KAAKkwI,YAAcA,qNCpBD,CACtBvH,UAAW,YACX0J,SAAU,WACVkI,QAAS,UACT1H,SAAU,WACV2H,QAAS,UACTC,OAAQ,SACRlrE,QAAS,UACT6pE,UAAW,YACXsB,UAAW,kHCTf,IAAAvgB,EAAAr9H,EAAA,YACAyqI,EAAAzqI,EAAA,gBACA+xI,EAAA/xI,EAAA,0CACA4zI,EAAA5zI,EAAA,iDACAyzI,EAAAzzI,EAAA,2CACA40I,EAAA50I,EAAA,wBACAg8I,EAAAh8I,EAAA,0LAOamsI,aAYT,SAAAA,EAAY1iI,EAAM2/H,EAAe3H,EAAsB/B,gGAAuBhC,CAAAx6H,KAAAipI,GAAAjpI,KAR9E4qI,MAAQ,GAQsE5qI,KAN9EgpI,eAAc,EAMgEhpI,KAL9E26I,mBAAqB,GAMjB36I,KAAKuG,KAAOA,EACZvG,KAAKg0I,uBAAyBh0I,KAAK46I,4BACnC56I,KAAKi0I,iBAAmBj0I,KAAK66I,sBAC7B76I,KAAKkmI,cAAgBA,EACrBlmI,KAAKu+H,qBAAuBA,EAC5Bv+H,KAAKw8H,sBAAwBA,kGAGhB0J,GACblmI,KAAKkmI,cAAgBA,kCAGjBgD,GAAW,IAEX1C,EAFW16D,EAAA9rE,KAGf,OAFAm6H,EAAAr7H,IAAIsuD,MAAM,2BAA4B87E,GAE/BlpI,KAAKowI,oBAAoBlH,GAAW3uH,KAAK,SAAA2uH,GAE5C,GAAIA,EAAUkJ,SAAW7K,EAAAmB,WAAWmK,SAKhC,OAHA3J,EAAUkJ,OAAS7K,EAAAmB,WAAW8R,QAC9BtR,EAAUT,WAAalB,EAAAmB,WAAWC,UAClCxO,EAAAr7H,IAAIsuD,MAAM,8BAAgC87E,GACnCA,EAGX,GAAIp9D,EAAKkoE,yBAA2BloE,EAAKkoE,uBAAuB7lC,SAAS+6B,EAAUzC,eAC/E,MAAM,IAAIiK,EAAAK,8BAA8B,yCAG5C,GAAGjlE,EAAKmoE,mBAAqBnoE,EAAKmoE,iBAAiB9lC,SAAS+6B,EAAU71F,WAClE,MAAM,IAAIk9F,EAAAK,wBAAwB,mCAKtC,OADA1H,EAAUoJ,UAAY,IAAInzH,KACnBpF,QAAQ62E,IAAI,CAAC9kB,EAAKgvE,aAAa5R,EAAW3B,EAAAmB,WAAW6R,SAAUzuE,EAAKivE,UAAU7R,GAAYp9D,EAAKkvE,eAAe9R,KAAa3uH,KAAK,SAAAjY,GAQnI,OAPA4mI,EAAU5mI,EAAI,IACdkkI,EAAYlkI,EAAI,MAEZkkI,EAAY,IAAIsS,EAAAc,UAAU1Q,EAAUgH,cAExCpkE,EAAK6uE,mBAAmBrjI,QAAQ,SAAA2jI,GAAQ,OAAEA,EAAS7f,UAAU8N,KAEtDp9D,EAAKovE,UAAUhS,EAAW1C,OAGtCjsH,KAAK,SAAA2uH,GAEJ,OADA/O,EAAAr7H,IAAIsuD,MAAM,2BAA2B87E,GAC9BA,IACRhN,MAAM,SAAAl/H,GAWL,OAVIA,aAAa6xI,EAAAS,yBACbnV,EAAAr7H,IAAIs1I,KAAK,yCAA0Cp3I,GACnDksI,EAAUkJ,OAAS7K,EAAAmB,WAAW8R,QAC9BtR,EAAUT,WAAalB,EAAAmB,WAAW8R,UAElCrgB,EAAAr7H,IAAIsb,MAAM,wCAAyCpd,GACnDksI,EAAUkJ,OAAS7K,EAAAmB,WAAW+R,OAC9BvR,EAAUT,WAAalB,EAAAmB,WAAW+R,QAEtCvR,EAAUwJ,kBAAkBtlI,KAAKpQ,GAC1BksI,IACR3uH,KAAK,SAAA2uH,GACJ,OAAG1C,EACQ16D,EAAKo6D,cAAciV,cAAc3U,GAAWjsH,KAAK,WAAA,OAAI2uH,IAEzDA,IACRhN,MAAM,SAAAl/H,GAOL,OANAm9H,EAAAr7H,IAAIsb,MAAM,6CAA8Cpd,GACrDA,GACCksI,EAAUwJ,kBAAkBtlI,KAAKpQ,GAErCksI,EAAUkJ,OAAS7K,EAAAmB,WAAW+R,OAC9BvR,EAAUT,WAAalB,EAAAmB,WAAW+R,OAC3BvR,IACR3uH,KAAK,SAAA2uH,GAEJ,OADAA,EAAUsJ,QAAU,IAAIrzH,KACjBpF,QAAQ62E,IAAI,CAAC9kB,EAAKo6D,cAAc7gF,OAAO6jF,GAAYp9D,EAAKkvE,eAAe9R,KAAa3uH,KAAK,SAAAjY,GAAG,OAAEA,EAAI,OAC1GiY,KAAK,SAAA2uH,GACJ,IACIp9D,EAAK6uE,mBAAmBrjI,QAAQ,SAAA2jI,GAAQ,OAAEA,EAASzf,SAAS0N,KAC9D,MAAOlsI,GACLm9H,EAAAr7H,IAAIsb,MAAM,8CAA+Cpd,GAE7D,OAAOksI,yCAKF7N,EAAc+W,GAEvB,OADA/W,EAAa+W,OAAOA,EACbpyI,KAAKkmI,cAAc7gF,OAAOg2E,0CAGtBA,GACX,OAAOr7H,KAAKkmI,cAAciK,2BAA2B9U,EAAa5qF,GAAIzwC,KAAK6qI,YAAYxP,sCAIjF6N,EAAW1C,GACjB,KAAM,+CAAiDxmI,KAAKuG,yDAI5D,MAAO,CACH4nG,SAAU,SAACnpC,GAAD,OAAYA,EAAOmpC,2DAKjC,MAAO,CACHA,SAAU,SAACzuE,GAAD,OAAU,oCAIpB6V,GACJv1C,KAAK4qI,MAAMx9H,KAAKmoC,+CAIA7rB,GAChB,KAAM,yDAA2D1pB,KAAKuG,yCAM9D2iI,GACR,MAAO,CACHyB,MAAO,EACP3/G,QAASk+G,EAAUkJ,SAAW7K,EAAAmB,WAAWC,UAAY,EAAI,qDAIvCsS,GACtBj7I,KAAK26I,mBAAmBvtI,KAAK6tI,+CAGb/R,GAChB,OAAOlpI,KAAKkmI,cAAckV,oBAAoBlS,EAAUz4F,IAAIl2B,KAAK,SAAAk8H,GAI7D,OAHG/E,EAAA2J,mBAAmBpJ,OAASwE,GAC3BvN,EAAUoS,OAEPpS,sCAILA,GACN,OAAOlpI,KAAKkmI,cAAc8P,uBAAuB9M,EAAUgH,wDAG5C1J,EAAWC,GAC1B,KAAM,wDAA0DzmI,KAAKuG,sWCjL7E,IAAA4zH,EAAAr9H,EAAA,YACAyqI,EAAAzqI,EAAA,gBACAgsI,EAAAhsI,EAAA,SAEAy0I,EAAAz0I,EAAA,uBACAwqI,EAAAxqI,EAAA,UACA+xI,EAAA/xI,EAAA,0CACA6zI,EAAA7zI,EAAA,sCACAA,EAAA,+7CAKaspI,cAET,SAAAA,EAAY7/H,EAAM2/H,EAAe3H,EAAsB/B,GAAuB,mGAAAhC,CAAAx6H,KAAAomI,GAAA3L,EAAAz6H,KAAA06H,EAAA0L,GAAAvoI,KAAAmC,KACpEuG,EAAM2/H,EAAe3H,EAAsB/B,gPAH1BsM,EAAAG,qFAMnB0J,GACJ,OAAOxY,EAAAS,MAAMjgF,KAAK36C,KAAK4qI,MAAO,SAAAziI,GAAC,OAAEA,EAAE5B,MAAQosI,sCAGrCzJ,EAAW1C,GAEjB,OAAOxmI,KAAKu7I,eAAerS,EAAW1C,GAAWjsH,KAAK,SAAAihI,GACX,IAAAC,EAAN,MAA7BD,IACArhB,EAAAr7H,IAAIsuD,MAAM,iCAAkCouF,GAC5CtS,EAAUkJ,OAASoJ,EAA0BpJ,OAC7ClJ,EAAUT,WAAa+S,EAA0B/S,YACjDgT,EAAAvS,EAAUwJ,mBAAkBtlI,KAA5BsK,MAAA+jI,EAAAvT,EAAoCsT,EAA0B9I,qBAElE,OAAOxJ,2CAIA7N,EAAcmL,GAAiD,IAAA16D,EAAA9rE,KAAtC07I,EAAsC,EAAAvoI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAA7B,KAAMwoI,EAAuB,EAAAxoI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAL,KACjEyoI,EAAY,EAIhB,GAHGF,IACCE,EAAY57I,KAAK4qI,MAAM9iI,QAAQ4zI,GAAU,GAE1CE,GAAW57I,KAAK4qI,MAAM9sI,OACrB,OAAOic,QAAQC,QAAQ2hI,GAE3B,IAAIpmG,EAAOv1C,KAAK4qI,MAAMgR,GACtB,OAAO57I,KAAK67I,WAAWtmG,EAAM8lF,EAAcmL,GAAWjsH,KAAK,SAAAmtH,GACvD,OAAGA,EAAc0K,SAAW7K,EAAAmB,WAAWC,UAC5BjB,EAEJ57D,EAAKyvE,eAAelgB,EAAcmL,EAAWjxF,EAAMmyF,wCAIvDnyF,EAAM8lF,EAAcmL,GAAW,IAAAz6D,EAAA/rE,KAClCkwI,EAAc7U,EAAa6U,YAC/B,OAAOlwI,KAAKowI,oBAAoB/U,GAAc9gH,KAAK,SAAA8gH,GAC/C,GAAIA,EAAaygB,aACb,MAAM,IAAIjN,EAAAS,wBAAwB,6BAEtC,OAAOvjE,EAAKm6D,cAAc6V,qBAAqB7L,EAAa36F,EAAKhvC,QAElEgU,KAAK,SAAAyhI,GACAjwE,EAAKkwE,wCAAwC5gB,EAAc2gB,KAE3D7hB,EAAAr7H,IAAIs1I,KAAK,sDAAwD7+F,EAAKhvC,KAAO,aAAc2pI,EAAYvU,SACvGqgB,EAAoB,MAGxB,IAAIE,EAAuBF,EAE3B,IAAKjwE,EAAKowE,YAAYD,EAAsB7gB,EAAc9lF,GACtD,OAAO2mG,EAGXA,EAAuB7gB,EAAa+gB,oBAAoB7mG,EAAKhvC,MAE7D,IAAI81I,EAAmC,MAArBL,GAA6BA,EAAkB5J,SAAW7K,EAAAmB,WAAWC,UACnF2T,EAAiC,MAArBN,IAA8BK,EAC1CE,EAAgBF,GAAe9mG,EAAKinG,yBAkBxC,OAhBIF,GACAJ,EAAqB/Q,iBAAmB6Q,EAAkB7Q,iBACtD6Q,EAAkB7Q,iBAAiBsR,YAAY,aAC/CP,EAAqB/Q,iBAAiBrnF,OAAO,aAKjDo4F,EAAqB/Q,iBAAmB,IAAIoG,EAAAN,iBAE7CsL,IACCL,EAAqBzT,WAAalB,EAAAmB,WAAWC,UAC7CuT,EAAqB9J,OAAS7K,EAAAmB,WAAWC,UACzCuT,EAAqB/Q,iBAAiBC,IAAI,WAAW,IAGlDr/D,EAAKm6D,cAAcwW,iBAAiBR,GAAsB3hI,KAAK,SAACoiI,GAEnE,OADAT,EAAqBS,EAClBJ,GACCpiB,EAAAr7H,IAAIs1I,KAAK,uCAAyC7+F,EAAKhvC,KAAO,KACvD21I,IAEX/hB,EAAAr7H,IAAIs1I,KAAK,oBAAsB7+F,EAAKhvC,KAAO,KACpCgvC,EAAK0mF,QAAQigB,EAAsB1V,MAC3CjsH,KAAK,WAEJ,OADA2hI,EAAqB/Q,iBAAiBC,IAAI,YAAY,GAC/C8Q,IACRhgB,MAAO,SAAAl/H,GAEN,OADAq+H,EAAa+W,OAAS7K,EAAAmB,WAAW+R,OAC1B1uE,EAAKm6D,cAAc7gF,OAAOg2E,GAAc9gH,KAAK,SAAA8gH,GAAe,MAAMr+H,QAG9Eud,KAAK,SAAC2hI,GAOL,OANIA,EAAqB9J,QAAU7K,EAAAmB,WAAWmK,UACvCqJ,EAAqB9J,QAAU7K,EAAAmB,WAAW8R,UAE7Cnf,EAAa+W,OAAS7K,EAAAmB,WAAWmK,UAG9B9mE,EAAKivE,eAAe3f,GAAc9gH,KAAK,WAAA,OAAI2hI,sEAKlB7gB,EAAcqM,GAClD,OAAwB,MAAjBA,GAAyBA,EAAcrM,aAAa5qF,IAAM4qF,EAAa5qF,uCAGtEurG,EAAmB9S,EAAW3zF,GACtC,IAAIqnG,EAQJ,IANIA,EADqB,MAArBZ,EACazU,EAAAmB,WAAW2J,SAGX2J,EAAkB5J,SAGjB7K,EAAAmB,WAAWn5D,QACzB,MAAM,IAAIohE,EAAAK,oBAAoB,2CAGlC,OAAO4L,GAAcrV,EAAAmB,WAAWC,WAAapzF,EAAKyzF,kDAG1CE,GACR,IAAI2T,EAAiB3T,EAAUwB,eAAe5sI,OAC1CmyI,EAAW,CACXtF,MAAO3qI,KAAK4qI,MAAM9sI,OAClBktB,QAAS6xH,GAEb,OAAIA,GAGDtV,EAAAmB,WAAWC,YAAcO,EAAUwB,eAAexB,EAAUwB,eAAe5sI,OAAO,GAAGs0I,QACpFnC,EAASjlH,UAGNilH,oCAIP,GAAsB,IAAnB98H,UAAUrV,OACT,OAAA60G,EAAA+nB,EAAA0L,EAAAnmI,WAAA,UAAAD,MAAAnC,KAAAmC,KAAqBmT,UAAU,IAEnC,IAAIoiC,EAAO,IAAI+xF,EAAAG,KAAKt0H,UAAU,GAAInT,KAAKkmI,eAEvC,OADA3wF,EAAK2lG,UAAY/nI,UAAU,GAC3Bw/F,EAAA+nB,EAAA0L,EAAAnmI,WAAA,UAAAD,MAAAnC,KAAAmC,KAAqBu1C,ugBCtKhBunG,0NAEEzhB,sCAKDA,sJCPd,IAAAlB,EAAAr9H,EAAA,YACAy0I,EAAAz0I,EAAA,uBACAyqI,EAAAzqI,EAAA,gBACA20I,EAAA30I,EAAA,6LAKa81I,aAgBT,SAAAA,EAAYD,EAAUtX,EAAc5qF,gGAAI+pF,CAAAx6H,KAAA4yI,GAAA5yI,KAXxCoyI,OAAS7K,EAAAmB,WAAW2J,SAWoBryI,KAVxCyoI,WAAalB,EAAAmB,WAAWgS,UAUgB16I,KATxCmrI,iBAAmB,IAAIoG,EAAAN,iBASiBjxI,KAPxCsyI,UAAY,IAAInzH,KAOwBnf,KANxCwyI,QAAU,KAM8BxyI,KALxCyyI,YAAc,KAK0BzyI,KAHxC0vI,eAAgB,EAGwB1vI,KAFxC0yI,kBAAoB,GAIZ1yI,KAAKywC,GADNA,MAAAA,EACW0pF,EAAAS,MAAM6K,OAENh1F,EAGdzwC,KAAK2yI,SAAWA,EAChB3yI,KAAKq7H,aAAeA,EACpBr7H,KAAKg8H,eAAiBX,EAAa5qF,qGAInC,OAAOzwC,KAAKq7H,aAAaoL,+DAIzB,OAAOzmI,KAAKq7H,aAAa8P,mDAIzB,OAAOnrI,KAAKq7H,aAAahoF,2CAGkB,IAAxC0/F,EAAwC,EAAA5/H,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAArB,GAAI6/H,IAAiB,EAAA7/H,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAEvC8/H,EAAc9Y,EAAAS,MAAM50E,cAKxB,OAJIgtF,IACAC,EAAc9Y,EAAAS,MAAM30E,WAGjBk0E,EAAAS,MAAMzlH,OAAO,GAAI89H,EAAYjzI,KAAM,SAACoE,EAAOkR,EAAKuV,EAAQmX,GAC3D,OAAoC,EAAjC+wG,EAAmBjrI,QAAQwN,GACnB,MAE2B,EAAnC,CAAC,oBAAoBxN,QAAQwN,GACrBlR,EAAMm3H,SAEdn3H,aAAiB3G,MACT08H,EAAAS,MAAMuB,YAAY/3H,GAGzBA,aAAiBqtI,EAAAU,aACV/tI,EAAMm3H,OAAO,CAAC,kBAAmByX,QAD5C,8NClEZ,IAAAzL,EAAAzqI,EAAA,gBACAq9H,EAAAr9H,EAAA,YAEA+xI,EAAA/xI,EAAA,oNAEa2qI,aAWT,SAAAA,EAAYlhI,EAAM2/H,gGAAe1L,CAAAx6H,KAAAynI,GAAAznI,KAPjCgpI,eAAgB,EAOiBhpI,KANjCw8I,0BAAyB,EAMQx8I,KALjC4qI,MAAQ,GAKyB5qI,KAJjC26I,mBAAqB,GAKjB36I,KAAKuG,KAAOA,EACZvG,KAAKkmI,cAAgBA,kGAGRA,GACblmI,KAAKkmI,cAAgBA,kCAIjBwB,EAAelB,GAAW,IAI1BiC,EAJ0B38D,EAAA9rE,KAK9B,OAJAm6H,EAAAr7H,IAAIsuD,MAAM,wBAA0BptD,KAAKuG,MACzCmhI,EAAc4K,UAAY,IAAInzH,KAC9BuoH,EAAc0K,OAAS7K,EAAAmB,WAAW6R,QAE3Bv6I,KAAKkmI,cAAc7gF,OAAOqiF,GAAentH,KAAK,SAAAmtH,GAMjD,OALAe,EAAalB,EAAAmB,WAAWgS,UAExB5uE,EAAK6uE,mBAAmBrjI,QAAQ,SAAA2jI,GAAQ,OAAEA,EAAS8B,WAAWrV,KAC9D57D,EAAKhuD,KAAK4pH,EAAcyD,kBAEjBr/D,EAAKovE,UAAUxT,EAAelB,KACtCjsH,KAAK,SAAAw3H,GAKJ,GAHAtJ,GADAf,EAAgBqK,GACWtJ,WAGvBf,EAAcgI,cACd,MAAM,IAAIb,EAAAS,wBAAwB,6BAKtC,OAFA5H,EAAc0K,OAAS7K,EAAAmB,WAAWC,UAClCxO,EAAAr7H,IAAIsuD,MAAM,gCAAkC0e,EAAKvlE,MAC1CmhI,IACRxL,MAAM,SAAAl/H,GAWL,OAVA0qI,EAAc0K,OAAStmE,EAAKkxE,mBAAmBhgJ,GAC/CyrI,EAAaf,EAAc0K,OAC3B1K,EAAcgL,kBAAkBtlI,KAAKpQ,GAEjC0qI,EAAc0K,QAAU7K,EAAAmB,WAAW8R,QACnCrgB,EAAAr7H,IAAIs1I,KAAK,4CAA8CtoE,EAAKvlE,KAAO,YAAcmhI,EAAcrM,aAAa6U,YAAYvU,QAAS3+H,GAGjIm9H,EAAAr7H,IAAIsb,MAAM,wCAA0C0xD,EAAKvlE,KAAO,YAAcmhI,EAAcrM,aAAa6U,YAAYvU,QAAS3+H,GAE3H0qI,IACRntH,KAAK,SAAAmtH,GACJ,IACIA,EAAce,WAAaA,EAC3B38D,EAAK6uE,mBAAmBrjI,QAAQ,SAAA2jI,GAAQ,OAAEA,EAASgC,UAAUvV,KAEjE,MAAO1qI,GACHm9H,EAAAr7H,IAAIsb,MAAM,2CAA6C0xD,EAAKvlE,KAAO,YAAcmhI,EAAcrM,aAAa6U,YAAYvU,QAAS3+H,GAOrI,OAJA0qI,EAAc8K,QAAU,IAAIrzH,KAC5BuoH,EAAce,WAAaA,EAGpB38D,EAAKo6D,cAAc7gF,OAAOqiF,KAClCntH,KAAK,SAAAmtH,GACJ,IACI57D,EAAKoxE,MAAMxV,EAAcyD,kBAE7B,MAAOnuI,GACHm9H,EAAAr7H,IAAIsb,MAAM,6DAA+D0xD,EAAKvlE,KAAO,YAAcmhI,EAAcrM,aAAa6U,YAAYvU,QAAS3+H,GACnJ0qI,EAAcgL,kBAAkBtlI,KAAKpQ,GAGzC,IACI8uE,EAAKoxE,MAAMxV,EAAcyD,kBAE7B,MAAOnuI,GACHm9H,EAAAr7H,IAAIsb,MAAM,6DAA+D0xD,EAAKvlE,KAAO,YAAcmhI,EAAcrM,aAAa6U,YAAYvU,QAAS3+H,GACnJ0qI,EAAcgL,kBAAkBtlI,KAAKpQ,GAMzC,OADAm9H,EAAAr7H,IAAIsuD,MAAM,4BAA8Bs6E,EAAcj3F,IAC/Ci3F,+CAKI1qI,GACf,OAAIA,aAAa6xI,EAAAS,wBACN/H,EAAAmB,WAAW8R,QAGXjT,EAAAmB,WAAW+R,yCAQhB/S,EAAelB,iCAOpB2E,kCAOCA,wCAOMzD,GACR,MAAO,CACHiD,MAAO,EACP3/G,QAAS08G,EAAc0K,SAAW7K,EAAAmB,WAAWC,UAAY,EAAI,oOC1IzE,IAAAwU,2SAAA7L,CAAAx0I,EAAA,8BAGA,IAAA4gI,EAAA5gI,EAAA,kBAAAoH,OAAAiT,KAAAumH,GAAApmH,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA6iH,EAAApoH,SACA,IAAA8nI,EAAAtgJ,EAAA,gBAAAoH,OAAAiT,KAAAimI,GAAA9lI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAuiI,EAAA9nI,oNCJA,IAAAq8H,EAAA70I,EAAA,mCACAyqI,EAAAzqI,EAAA,uBACA80I,EAAA90I,EAAA,yBACAq9H,EAAAr9H,EAAA,w5BAGaugJ,EAUT,SAAAA,EAAY9iB,GAAQC,EAAAx6H,KAAAq9I,GAAAr9I,KATpBs9I,aAAe,aASKt9I,KARpBu9I,eAAiB,SAAAvmI,KAQGhX,KAPpBw9I,YAAc,SAAAxQ,KAOMhtI,KANpBy9I,aAAe,aAMKz9I,KALpB09I,gBAAkB,aAKE19I,KAJpB29I,WAAa,SAAC1N,KAIMjwI,KAFpB49I,eAAiB,IAGTrjB,GACAJ,EAAAS,MAAMtpE,WAAWtxD,KAAMu6H,qCAMtBoG,cAUT,SAAAA,EAAYzF,EAAY2iB,EAAwBlrI,GAAQ,IAAAm5D,EAcpD,OAdoD0uD,EAAAx6H,KAAA2gI,IACpD70D,EAAA2uD,EAAAz6H,KAAA06H,EAAAiG,GAAA9iI,KAAAmC,QAHJiwI,SAAW,KAIPnkE,EAAKn5D,OAAS,IAAI0qI,EAAyB1qI,GAC3Cm5D,EAAKovD,WAAaA,EACd2iB,aAAkCjM,EAAAsB,aAClCpnE,EAAKokE,YAAc2N,EACnB/xE,EAAKgoE,sBAAsBv5H,KAAK,SAAAmmH,GAC5B50D,EAAKgyE,oBAGThyE,EAAKiyE,iBAAmBF,EACxB/xE,EAAKokE,YAAcpkE,EAAKiyE,iBAAiB7N,YACzCpkE,EAAKgyE,iBAELhyE,EAAKiyE,mBAAqBjyE,EAAKiyE,iBAAiB5E,aAChDrtE,EAAK0vD,SAAS1vD,EAAKiyE,kBACnBtjB,EAAA3uD,KAEJovD,EAAWC,6BAAXN,EAAA/uD,IAlBoDA,+OAVpB6lE,EAAAO,8GA+BpB,IAAAnmE,EAAA/rE,KAERgV,EAAOhV,MACPA,KAAKg+I,YAAeh+I,KAAK+9I,iBAAiB5E,aAA2D,MAA5Cn5I,KAAKi+I,oBAAoBj+I,KAAKiwI,WAG3FjwI,KAAKk7H,WAAW2P,YAAY7qI,KAAK+9I,kBAAkBxjI,KAAK,SAAA01H,GACpDlkE,EAAKmyE,eAAiB,IAAI/+H,KACtB8wH,IACAlkE,EAAKkkE,SAAWA,EAChBlkE,EAAKp5D,OAAOgrI,WAAW9/I,KAAKkuE,EAAKp5D,OAAOwrI,kBAAoBpyE,EAAMkkE,IAGtEr0G,WAAW,WACP5mB,EAAK8oI,iBACN/xE,EAAKp5D,OAAOirI,oDAIbviB,GACFA,EAAa6U,YAAYz/F,KAAOzwC,KAAKkwI,YAAYz/F,KAIrDzwC,KAAK+9I,iBAAmB1iB,EACxBr7H,KAAK2S,OAAO2qI,aAAaz/I,KAAKmC,KAAK2S,OAAOwrI,kBAAoBn+I,mDAG9CiwI,GAChB,OAAKA,EAGqB,IAAnBA,EAASjlH,QAAgBilH,EAAStF,MAF9B,mDAKUtP,GAErB,OADUr7H,KAAKk7H,WAAWiF,aAAa9E,EAAa6U,YAAYvU,SACrDkP,YAAYxP,oCAGlBA,GAAc,IAAAoF,EAAAzgI,KACfq7H,EAAa6U,YAAYz/F,KAAOzwC,KAAKkwI,YAAYz/F,KAGrDzwC,KAAK+9I,iBAAmB1iB,EACpBkM,EAAAmB,WAAWC,YAActN,EAAa+W,QACtCpyI,KAAKk7H,WAAWkjB,+BAA+Bp+I,MAC/CA,KAAKiwI,SAAWjwI,KAAKq+I,yBAAyBhjB,GAC9Cr7H,KAAK2S,OAAOgrI,WAAW9/I,KAAKmC,KAAK2S,OAAOwrI,kBAAoBn+I,KAAMA,KAAKiwI,UACvEjwI,KAAKk7H,WAAW6f,UAAU1f,EAAa6U,aAAa31H,KAAK,SAAAvD,GACrDypH,EAAK9tH,OAAO4qI,eAAe1/I,KAAK4iI,EAAK9tH,OAAOwrI,kBAAoB1d,EAAMzpH,EAAO0oB,QAC9Ew8F,MAAM,SAAAl/H,GACLm9H,EAAAr7H,IAAIsb,MAAMpd,MAIPuqI,EAAAmB,WAAW+R,SAAWpf,EAAa+W,OAC1CpyI,KAAK2S,OAAO6qI,YAAY3/I,KAAKmC,KAAK2S,OAAOwrI,kBAAoBn+I,KAAMq7H,EAAaqX,mBAEzEnL,EAAAmB,WAAW8R,UAAYnf,EAAa+W,QAC3CpyI,KAAK2S,OAAO8qI,aAAa5/I,KAAKmC,KAAK2S,OAAOwrI,kBAAoBn+I,qDAI7B,IAAAmhI,EAAAnhI,KAArBs+I,EAAqB,EAAAnrI,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GACrC,OAAKnT,KAAK+9I,kBAAoBO,EACnBt+I,KAAKk7H,WAAWgL,cAAcwT,8BAA8B15I,KAAKkwI,aAAa31H,KAAK,SAAAmmH,GAEtF,OADAS,EAAK4c,iBAAmBrd,IAIzB3mH,QAAQC,QAAQha,KAAK+9I,iDAGzB,IAAAtc,EAAAzhI,KACH,OAAOA,KAAK8zI,sBAAsBv5H,KAAK,WACnC,OAAOknH,EAAKvG,WAAWogB,KAAK7Z,EAAKsc,qDAIhC,IAAAlc,EAAA7hI,KACL,OAAOA,KAAK8zI,sBAAsBv5H,KAAK,WACnC,OAAOsnH,EAAK3G,WAAWqF,IAAIsB,EAAKqO,YAAYvU,QAASkG,EAAKkc,iBAAiBtX,cAAc/8G,OAAQm4G,EAAKkc,iBAAiB1qG,WAAW94B,KAAK,SAAAmmH,GAGnI,OAFAmB,EAAKkc,iBAAmBrd,EACxBmB,EAAKic,iBACE,IACR5hB,MAAM,SAAAl/H,GAEL,OADAm9H,EAAAr7H,IAAIsb,MAAMpd,IACH,0CAKP,IAAA+kI,EAAA/hI,KACR,OAAOA,KAAK8zI,sBAAsBv5H,KAAK,WACnC,OAAOwnH,EAAK7G,WAAWqjB,UAAUxc,EAAKmO,aAAa31H,KAAK,WAKpD,OAJAwnH,EAAKic,YAAa,EAClBjc,EAAKpvH,OAAO+qI,gBAAgB7/I,KAAKkkI,EAAKpvH,OAAOwrI,kBAAoBpc,EAAMA,EAAKgc,kBAC5Ehc,EAAK7G,WAAWkjB,+BAA+Brc,GAExCA,EAAKgc,qBAEjB7hB,MAAM,SAAAl/H,GAEL,OADAm9H,EAAAr7H,IAAIsb,MAAMpd,IACH,0aC/JNwhJ,aAMT,SAAAA,EAAYvgB,EAAKwgB,EAAiBC,gGAAQlkB,CAAAx6H,KAAAw+I,GAAAx+I,KAH1C2+I,UAAY,GAIR,IAAIjhI,EAAW1d,KACfA,KAAK+9H,OAAS,IAAI6gB,OAAO3gB,GACzBj+H,KAAKy+I,gBAAkBA,GAAmB,aACtCC,IAAU1+I,KAAK+9H,OAAO5jH,QAAUukI,GAEpC1+I,KAAK+9H,OAAOnB,UAAY,SAASz+G,GAC7B,GAAIA,EAAMuhB,gBAAgBx7B,QACtBia,EAAMuhB,KAAKhrB,eAAe,wBAA0ByJ,EAAMuhB,KAAKhrB,eAAe,wBAAyB,CACvG,IAAIumI,EAAWv9H,EAASihI,UAAUxgI,EAAMuhB,KAAK09F,qBACzCxrH,EAAOuM,EAAMuhB,KAAK29F,qBACnB4d,EAAS4D,eACRjtI,EAAOqpI,EAAS4D,aAAajtI,IAEjCqpI,EAAS1mG,GAAG78B,MAAMujI,EAASzyH,QAAS5W,QAEpC5R,KAAKy+I,gBAAgB5gJ,KAAK6f,EAAUS,EAAMuhB,kGAOlD,GAAIvsB,UAAUrV,OAAS,EACnB,MAAM,IAAI67B,UAAU,mDAExB35B,KAAK+9H,OAAOZ,YAAY,CACpBL,YAAe3pH,UAAU,GACzB4pH,eAAkB5/G,MAAMld,UAAU4J,MAAMhM,KAAKsV,UAAW,oCAIzDwoH,EAASC,EAAqBC,GACjC77H,KAAK8+I,UAAU,SAAUnjB,EAASC,EAAqBC,sCAGhDG,GACPh8H,KAAK8+I,UAAU,aAAc9iB,qCAGvBH,EAASkjB,EAAWziB,EAAUC,GACpCv8H,KAAK8+I,UAAU,YAAajjB,EAASkjB,EAAWziB,EAAUC,uCAGlD5zF,GACR3oC,KAAK+9H,OAAOZ,YAAYx0F,uCAIxB3oC,KAAK+9H,OAAOwgB,gDAGJh4I,EAAM00I,EAAUzyH,EAASq2H,GACjC7+I,KAAK2+I,UAAUp4I,GAAQ,CACnBguC,GAAI0mG,EACJzyH,QAASA,GAAWxoB,KACpB6+I,aAAcA,0CAIPt4I,UACJvG,KAAK2+I,UAAUp4I,2JCnE9B,IAAA4zH,EAAAr9H,EAAA,YACAgvI,EAAAhvI,EAAA,wEACAg1I,EAAAh1I,EAAA,yBACAsgJ,EAAAtgJ,EAAA,gBACA60I,EAAA70I,EAAA,mCACA+nI,EAAA/nI,EAAA,2BACAkiJ,EAAAliJ,EAAA,8CACA40I,EAAA50I,EAAA,+BACAmiJ,EAAAniJ,EAAA,4CACAoiJ,EAAApiJ,EAAA,8FACAqiJ,EAAAriJ,EAAA,kDACAsiJ,EAAAtiJ,EAAA,6EACAyqI,EAAAzqI,EAAA,uBACAq9I,EAAAr9I,EAAA,iDACAuiJ,EAAAviJ,EAAA,kDACAwiJ,EAAAxiJ,EAAA,88BAGayiJ,EAMT,SAAAA,EAAYhlB,GAAQC,EAAAx6H,KAAAu/I,GAAAv/I,KAJpB6+H,UAAY,KAIQ7+H,KAHpB8+H,eAAiB,MAGG9+H,KAFpBm+H,iBAAkB,EAGV5D,GACAJ,EAAAS,MAAMtpE,WAAWtxD,KAAMu6H,8BAKtBqE,cAgBT,SAAAA,EAAYL,EAAsB/B,EAAuB7pH,GAAQ,IAAAm5D,EAAA,OAAA0uD,EAAAx6H,KAAA4+H,IAC7D9yD,EAAA2uD,EAAAz6H,KAAA06H,EAAAkE,GAAA/gI,KAAAmC,QANJw/I,sBAAwB,GAKyC1zE,EAHjE2zE,iCAAmC,GAG8B3zE,EAFjE4zE,wBAA0B,GAItB5zE,EAAKsyD,UAAUzrH,GACfm5D,EAAKuyD,iBAAmBE,EAAqBF,iBAC7CvyD,EAAKyyD,qBAAuBA,EAC5BzyD,EAAK0wD,sBAAwBA,EAG7B1wD,EAAK6zE,YAAc7zE,EAAKn5D,OAAOksH,UAC3B/yD,EAAK6zE,WACL7zE,EAAK8zE,WAAW9zE,EAAKn5D,OAAOksH,WAGhC/yD,EAAK+zE,iBAEL/zE,EAAKg0E,eAILh0E,EAAKi0E,YAAc,IAAIjO,EAAAuB,YAAYvnE,EAAKo6D,cAAep6D,EAAKwnE,UAAW,SAAC5zG,GAAD,OAAQosC,EAAKk0E,cAActgH,KAnBrCosC,8OAhBpC6lE,EAAAO,wGAsCnBv/H,GAEN,OADA3S,KAAK2S,OAAS,IAAI4sI,EAAkB5sI,GAC7B3S,8CAIP,OAAQA,KAAK2S,OAAOmsH,gBAChB,IAAK,MACD9+H,KAAKkmI,cAAgB,IAAI8Y,EAAApK,iBAAiB50I,KAAKq+H,iBAAiB4hB,iBAAkB,oBAAqBjgJ,KAAK2S,OAAOwrH,iBACnH,MACJ,IAAK,UACDn+H,KAAKkmI,cAAgB,IAAIiZ,EAAA/E,qBAAqBp6I,KAAKq+H,iBAAiB4hB,kBACpE,MACJ,IAAK,SACDjgJ,KAAKkmI,cAAgB,IAAIiU,EAAAN,oBAAoB75I,KAAKq+H,iBAAiB4hB,kBACnE,MACJ,QACI9lB,EAAAr7H,IAAIsb,MAAM,6DAA6Dpa,KAAK2S,OAAOmsH,eAAe,wBAClG9+H,KAAK2S,OAAOmsH,eAAiB,MAC7B9+H,KAAK6/I,wDAIHngH,GACV,OAAOA,EAAKwhG,WAAU,GAAM,GAAO,EAAOlhI,KAAKq+H,iBAAiB6hB,uDAGxDhM,GACR,IAAIzjG,EAAKyjG,EAIT,OAHK/Z,EAAAS,MAAMh9E,SAASs2F,KAChBzjG,EAAKyjG,EAAiBzjG,IAEnBzwC,KAAKkmI,cAAcia,wBAAwB1vG,qCAG5Cy/F,GACN,OAAOlwI,KAAKkmI,cAAc8P,uBAAuB9F,+BAGjDvU,EAASC,EAAqBl8F,GAA+C,IAAAqsC,EAAA/rE,KAAzCsgI,IAAyC,EAAAntH,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAC7E,OAAOnT,KAAK+/I,YAAYxf,IAAI5E,EAASC,EAAqBl8F,EAAM4gG,GAAkC/lH,KAAK,SAAA8gH,GACnG,OAAIiF,IAAqCjF,EAAa8d,YAC3C9d,EAIJ,IAAIthH,QAAQ,SAACC,EAASC,GACzB8xD,EAAK0zE,iCAAiCpkB,EAAa5qF,IAAMz2B,sCAK7Dk6H,GACJ,OAAOl0I,KAAK+/I,YAAY9jB,QAAQiY,gCAG/BA,GAAkB,IAAAzT,EAAAzgI,KACfywC,EAAKyjG,EAKT,OAJK/Z,EAAAS,MAAMh9E,SAASs2F,KAChBzjG,EAAKyjG,EAAiBzjG,IAGnBzwC,KAAKkmI,cAAciO,oBAAoB1jG,GAAIl2B,KAAK,SAAA8gH,GACnD,OAAKA,EAIAA,EAAa8d,YAKX1Y,EAAKyF,cAAcka,qBAAqB/kB,EAAa5qF,GAAIihG,EAAA2J,mBAAmBpJ,MAAM13H,KAAK,WAAA,OAAI8gH,KAJ9FlB,EAAAr7H,IAAIkyD,KAAK,sCAAwCqqE,EAAa+W,OAAS,cAAgB/W,EAAamX,SAC7FnX,IALPlB,EAAAr7H,IAAIsb,MAAM,4BAA8B85H,GACjC,0CAYThE,GAAa,IAAA/O,EAAAnhI,KACnB,OAAOA,KAAKkmI,cAAcwT,8BAA8BxJ,GAAa31H,KAAK,SAAA8gH,GACtE,GAAIA,EACA,OAAGA,EAAa8d,YACLhY,EAAK+E,cAAcka,qBAAqB/kB,EAAa5qF,GAAIihG,EAAA2J,mBAAmBpJ,MAAM13H,KAAK,WAAA,OAAI8gH,IAE3F8F,EAAK+E,cAAcma,kBAAkBnQ,EAAa7U,EAAaoL,iBAG/ElsH,KAAK,WACJ4mH,EAAKue,wBAAwBxP,EAAYz/F,IAAIy/F,yCAIxCvU,GACT,OAAO37H,KAAKkmI,cAAc/F,aAAaxE,+CAIvBA,EAASC,GAEzB,OADU57H,KAAKkmI,cAAc/F,aAAaxE,GAC/B+X,oBAAoB9X,+CAKfD,EAAS8K,GACzB,OAAIzmI,KAAK2/I,UACE3/I,KAAKszI,WAEV7M,aAAyB5B,EAAAG,gBAC3ByB,EAAgBzmI,KAAK0zI,oBAAoBjN,IAEtCzmI,KAAKkmI,cAAc4N,oBAAoBnY,EAAS8K,uCAGhD5H,GAAW,IAAAyhB,EAAAntI,UAAAsuH,EAAAzhI,KAClBA,KAAKszI,UAAY,IAAI8J,EAAAoB,UAAU3f,EAAW,WACtC1E,EAAAr7H,IAAIsb,MAAM,kBAAmBkmI,KAEjC,IAAIC,EAAmB,SAAC3uI,GACpB,MAAO,CAAC6vH,EAAKyE,cAAc8Q,mBAAmBplI,EAAK,MAGvD5R,KAAKszI,UAAUkN,YAAY,YAAaxgJ,KAAKo7H,UAAWp7H,KAAMugJ,GAC9DvgJ,KAAKszI,UAAUkN,YAAY,WAAYxgJ,KAAKw7H,SAAUx7H,KAAMugJ,GAC5DvgJ,KAAKszI,UAAUkN,YAAY,gBAAiBxgJ,KAAKygJ,gBAAiBzgJ,6CAKlE,IAAI0gJ,EAAyB,IAAI5U,EAAApC,uBAAuB1pI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,uBACxGmkB,EAAsC,IAAIzB,EAAAjT,oCAAoCjsI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,uBAClIrC,EAAAS,MAAMK,aACNylB,EAAuBE,aAAa,GACpCD,EAAoCC,aAAa,IAGrD5gJ,KAAK6gJ,YAAYH,GACjB1gJ,KAAK6gJ,YAAY,IAAIzB,EAAAxQ,kBAAkB5uI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,wBAC3Fx8H,KAAK6gJ,YAAYF,GACjB3gJ,KAAK6gJ,YAAY,IAAI5B,EAAAlW,aAAa/oI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,wBACtFx8H,KAAK6gJ,YAAY,IAAIxB,EAAApZ,eAAejmI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,wBACxFx8H,KAAK6gJ,YAAY,IAAIvB,EAAA1R,cAAc5tI,KAAKkmI,cAAelmI,KAAKu+H,qBAAsBv+H,KAAKw8H,4DAG/EiX,GACRzzI,KAAKkmI,cAAc2a,YAAYpN,GAC/BA,EAAIqN,0BAA0B9gJ,2DAGLi7I,GACzBj7I,KAAKw/I,sBAAsBpyI,KAAK6tI,0DAGLA,GAC3B,IAAI1jI,EAAQvX,KAAKw/I,sBAAsB13I,QAAQmzI,IAClC,EAAT1jI,GACAvX,KAAKw/I,sBAAsBvkH,OAAO1jB,EAAO,qCAIvC8jH,GACNlB,EAAAr7H,IAAIsuD,MAAM,YAAaptD,KAAK2/I,UAAWtkB,GACvCr7H,KAAKw/I,sBAAsBloI,QAAQ,SAAAqhE,GAAC,OAAEA,EAAEyiD,UAAUC,sCAG7CA,GACLlB,EAAAr7H,IAAIsuD,MAAM,WAAYptD,KAAK2/I,UAAWtkB,GACtCr7H,KAAKw/I,sBAAsBloI,QAAQ,SAAAqhE,GAAC,OAAEA,EAAE6iD,SAASH,KACjD,IAAI0lB,EAAiB/gJ,KAAKy/I,iCAAiCpkB,EAAa5qF,IACpEswG,GACAA,EAAe1lB,GAGhBr7H,KAAK0/I,wBAAwBrkB,EAAa6U,YAAYz/F,KACrDzwC,KAAKkmI,cAAcma,kBAAkBhlB,EAAa6U,YAAa7U,EAAaoL,uDAIpEzK,EAAgB5hH,GAAM,IAAAynH,EAAA7hI,KAC9B+gJ,EAAiB/gJ,KAAKy/I,iCAAiCzjB,GACvD+kB,GACA/gJ,KAAKkmI,cAAciO,oBAAoBnY,GAAgBzhH,KAAK,SAAA8gH,GAMxD,OALAA,EAAa+W,OAAS7K,EAAAmB,WAAW+R,OAC9BrgI,GACCihH,EAAaqX,kBAAkBtlI,KAAKgN,GAGjCynH,EAAKqE,cAAcuT,iBAAiBpe,GAAc9gH,KAAK,WAC1DwmI,EAAe1lB,OAEpBa,MAAM,SAAAl/H,GACLm9H,EAAAr7H,IAAIsb,MAAMpd,KAIlBm9H,EAAAr7H,IAAIsuD,MAAM,kBAAmB4uE,EAAgB5hH,y5BCvQrD,IAAA4mI,EAAAlkJ,EAAA,WAQAq9H,EAAAr9H,EAAA,YACAmkJ,2SAAA3P,CAAAx0I,EAAA,aACAokJ,EAAApkJ,EAAA,wBACAqkJ,EAAArkJ,EAAA,wBACAskJ,EAAAtkJ,EAAA,wBACAukJ,EAAAvkJ,EAAA,kMAEa2hI,aAWT,SAAAA,EAAYJ,EAAkBijB,gGAAiB9mB,CAAAx6H,KAAAy+H,GAAAz+H,KAP/CqsI,WAAa,GAOkCrsI,KAN/C0/E,MAAQ,GAMuC1/E,KAH/CuhJ,SAAW,GAGoCvhJ,KAF/CokI,YAAc,EAGVpkI,KAAKq+H,iBAAmBA,EACxBr+H,KAAKwhJ,QAAQ,IAAIR,EAAAS,8BAA8BpjB,IAC/Cr+H,KAAKwhJ,QAAQ,IAAIR,EAAAU,8BAA8BrjB,IAC/Cr+H,KAAKwhJ,QAAQ,IAAIR,EAAAW,YAAYtjB,IAC7Br+H,KAAKwhJ,QAAQ,IAAIR,EAAAY,YAAYvjB,IAC7Br+H,KAAKwhJ,QAAQ,IAAIR,EAAAa,YAAYxjB,IAC7Br+H,KAAKwhJ,QAAQ,IAAIR,EAAAc,YAAYzjB,IAE7B,IAAI0jB,EAAS,IAAIb,EAAAc,WAAW3jB,GAC5Br+H,KAAKwhJ,QAAQO,GACb,IAAIE,EAAS,IAAId,EAAAe,WAAW7jB,GAC5Br+H,KAAKwhJ,QAAQS,GACbjiJ,KAAKmiJ,YAAYJ,EAAQE,GAEzB,IAAIG,EAAS,IAAIhB,EAAAiB,WAAWhkB,GAC5Br+H,KAAKwhJ,QAAQY,GACb,IAAIE,EAAS,IAAIjB,EAAAkB,WAAWlkB,GAC5Br+H,KAAKwhJ,QAAQc,GAITtiJ,KAAKkgI,YADLohB,EACmBthJ,KAAKqsI,WAAWiV,GAEhBthJ,KAAK0/E,MAAM,iGAMvB0kD,GACXpkI,KAAKokI,YAAcA,GAAe,kCAG9BxhD,GACJ5iF,KAAKqsI,WAAWzpD,EAAKr8E,MAAMq8E,EAC3B5iF,KAAK0/E,MAAMtyE,KAAKw1E,sCAGTy5C,GACN,QAASr8H,KAAKqsI,WAAWhQ,gDAGTA,GACjBr8H,KAAKkgI,YAAclgI,KAAKqsI,WAAWhQ,kDAGhBA,GACnB,OAAOr8H,KAAKqsI,WAAWhQ,sCAIvB,IAAImmB,EAAUxiJ,KAAKuhJ,SAASvhJ,KAAKkgI,YAAY35H,MAC1Ci8I,IACCxiJ,KAAKkgI,YAAcsiB,yDAIGhjB,GAC1Bx/H,KAAK0/E,MAAMl9B,OAAO,SAAAzlD,GAAC,OAAEA,EAAE6iI,gBAAetoH,QAAQ,SAAAva,GAAC,OAAEA,EAAE0lJ,2BAA2BjjB,uCAGxEuY,EAAWrb,GAA8B,IAAA5wD,EAAA9rE,KAApB0iJ,EAAoB,EAAAvvI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAL,KAEtCm/H,GAAY,IAAInzH,MAAOw4H,UAC3Bxd,EAAAr7H,IAAIw/D,MAAM,2BAA2Bo+D,GAErCqb,EAAUlY,WAAWvoH,QAAQ,SAAAra,GACzB6uE,EAAKm0D,cAAchjI,EAAGy/H,EAAUgmB,KAGpC,IAAIxmG,GAAS,IAAI/8B,MAAOw4H,UAAYrF,EAAU,IAG9C,OAFAnY,EAAAr7H,IAAIw/D,MAAM,sBAAsBpiB,EAAK,KAE9Bl8C,2CAGG/B,EAAMy+H,GAA8B,IAAA3wD,EAAA/rE,KAApB0iJ,EAAoB,EAAAvvI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAL,KACzCgnH,EAAAr7H,IAAIw/D,MAAM,iCAAkCrgE,GAE5C,IAAIq0I,GAAY,IAAInzH,MAAOw4H,UAEvBj4D,EAAS,CAAC1/E,KAAKkgI,aAChBxD,IACCh9C,EAAQ1/E,KAAK0/E,OAGjBA,EAAMpoE,QAAQ,SAAAsrE,GACVA,EAAK+/D,eAAe52E,EAAKq4D,aACzBxhD,EAAKggE,kBAAkBF,GACvB9/D,EAAKigE,cAAc5kJ,GACnB2kF,EAAKkgE,eAAe7kJ,GACpB2kF,EAAKmgE,wBAGT,IAAI7mG,IAAS,IAAI/8B,MAAOw4H,UAAYrF,GAAW,IAG/C,OAFAnY,EAAAr7H,IAAIw/D,MAAM,sBAAsBpiB,EAAK,KAE9Bl8C,iDAIS2hE,EAAMp7D,GACtB,OAAOo7D,EAAK2iE,cAActkI,KAAKkgI,YAAY35H,KAAMA,+CAIjCvJ,EAAGuJ,GACnB,MAAU,gBAAPA,EACIvJ,EAAE6mI,sBAAsBod,EAAM7e,OAAOC,aAC7BrlI,EAAEsnI,cAActkI,KAAKkgI,YAAY35H,KAAM,eAE/CvJ,EAAE6mI,sBAAsBod,EAAM7e,OAAOQ,WAC7B5lI,EAAEgmJ,0BAEN,KAED,WAAPz8I,EACIvG,KAAKkgI,YAAYN,cACT5iI,EAAEsnI,cAAc,KAAM,UAEtBtnI,EAAEsnI,cAAc,KAAM,UAAWtkI,KAAKokI,YAAc,KAIzD,YAAP79H,EACQvJ,EAAEsnI,cAActkI,KAAKkgI,YAAY35H,KAAM,gBADlD,sCAKQ08I,EAAOC,GACfljJ,KAAKuhJ,SAAS0B,EAAM18I,MAAQ28I,EAC5BljJ,KAAKuhJ,SAAS2B,EAAM38I,MAAQ08I,yUC9JpC,IAAA7oB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACAA,EAAA,uzBAGa2kJ,cAIT,SAAAA,EAAYpjB,GAAiB,mGAAA7D,CAAAx6H,KAAAyhJ,GAAAhnB,EAAAz6H,KAAA06H,EAAA+mB,GAAA5jJ,KAAAmC,KACnByhJ,EAA8B2B,MAAM,EAAM/kB,gPALL8kB,EAAAE,sGAShC1hF,GAAqC,IAAAmK,EAAA9rE,KAA/B4jI,EAA+B,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAxB,EAAGmwI,EAAqB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAF,EAC9CnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GAC1BA,aAAgBy4D,EAAAgI,OAAMS,cACrB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C3hF,EAAK+gE,WAAWprH,QAAQ,SAAAta,IACf8uE,EAAK37D,SAAS27D,EAAK03E,eAAe7hF,GAAMiiE,GAAQrgI,OAAOuoE,EAAK03E,eAAexmJ,EAAEylE,aAAiBd,aAAgBy4D,EAAAgI,OAAMC,aAIrHv2D,EAAKy3E,OAAOvmJ,EAAG,WAAW,IAH1B8uE,EAAKy3E,OAAOvmJ,EAAG,WAAW,GAC1B8uE,EAAKg3E,eAAe9lJ,EAAEylE,UAAWqJ,EAAK23E,WAAWzmJ,GAAI8uE,EAAK3qB,SAASmiG,EAAoBx3E,EAAKy3E,OAAOvmJ,EAAE,iEAhB1GomJ,KAAO,+NCPlB,IAAAhpB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACAA,EAAA,uzBAGa4kJ,cAIT,SAAAA,EAAYrjB,GAAiB,mGAAA7D,CAAAx6H,KAAA0hJ,GAAAjnB,EAAAz6H,KAAA06H,EAAAgnB,GAAA7jJ,KAAAmC,KACnB0hJ,EAA8B0B,MAAM,EAAO/kB,gPALN8kB,EAAAE,sGAShC1hF,GAAqC,IAAAmK,EAAA9rE,KAA/B4jI,EAA+B,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAxB,EAAGmwI,EAAqB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAF,EAC9CnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GAC1BA,aAAgBy4D,EAAAgI,OAAMS,cACrB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C3hF,EAAK+gE,WAAWprH,QAAQ,SAAAta,IACf8uE,EAAK37D,SAAS27D,EAAK03E,eAAe7hF,GAAMiiE,GAAQrgI,OAAOuoE,EAAK03E,eAAexmJ,EAAEylE,aAAiBd,aAAgBy4D,EAAAgI,OAAMC,aAIrHv2D,EAAKy3E,OAAOvmJ,EAAG,WAAW,IAH1B8uE,EAAKy3E,OAAOvmJ,EAAG,WAAW,GAC1B8uE,EAAKg3E,eAAe9lJ,EAAEylE,UAAWqJ,EAAK23E,WAAWzmJ,GAAI8uE,EAAK3qB,SAASmiG,EAAoBx3E,EAAKy3E,OAAOvmJ,EAAE,iEAhB1GomJ,KAAO,wLCPlB,IAAAD,EAAArmJ,EAAA,oBAAAoH,OAAAiT,KAAAgsI,GAAA7rI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAsoI,EAAA7tI,QACA,IAAAouI,EAAA5mJ,EAAA,sCAAAoH,OAAAiT,KAAAusI,GAAApsI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA6oI,EAAApuI,QACA,IAAAquI,EAAA7mJ,EAAA,sCAAAoH,OAAAiT,KAAAwsI,GAAArsI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA8oI,EAAAruI,QACA,IAAAsuI,EAAA9mJ,EAAA,mBAAAoH,OAAAiT,KAAAysI,GAAAtsI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA+oI,EAAAtuI,QACA,IAAAuuI,EAAA/mJ,EAAA,mBAAAoH,OAAAiT,KAAA0sI,GAAAvsI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAgpI,EAAAvuI,QACA,IAAAwuI,EAAAhnJ,EAAA,mBAAAoH,OAAAiT,KAAA2sI,GAAAxsI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAipI,EAAAxuI,QACA,IAAAyuI,EAAAjnJ,EAAA,mBAAAoH,OAAAiT,KAAA4sI,GAAAzsI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAkpI,EAAAzuI,oTCNA,IAAA0uI,EAAAlnJ,EAAA,8pBAGaylJ,cAIT,SAAAA,EAAYlkB,GAAiB,mGAAA7D,CAAAx6H,KAAAuiJ,GAAA9nB,EAAAz6H,KAAA06H,EAAA6nB,GAAA1kJ,KAAAmC,KACnBuiJ,EAAWa,KAAM,CAAC,EAAG,GAAI/kB,gPALP2lB,EAAAC,yCAErBb,KAAO,iJCLlB,IAAAY,EAAAlnJ,EAAA,8pBAGaolJ,cAIT,SAAAA,EAAY7jB,GAAiB,mGAAA7D,CAAAx6H,KAAAkiJ,GAAAznB,EAAAz6H,KAAA06H,EAAAwnB,GAAArkJ,KAAAmC,KACnBkiJ,EAAWkB,KAAM,CAAC,GAAI,GAAI/kB,gPALR2lB,EAAAC,yCAErBb,KAAO,kJCLlB,IAAAhpB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACAq9H,EAAAr9H,EAAA,uzBAGa8kJ,cAIT,SAAAA,EAAYvjB,GAAiB,mGAAA7D,CAAAx6H,KAAA4hJ,GAAAnnB,EAAAz6H,KAAA06H,EAAAknB,GAAA/jJ,KAAAmC,KACnB4hJ,EAAYwB,MAAM,EAAM/kB,gPALL8kB,EAAAE,+GASL9hB,EAAO2iB,EAAiBC,EAAWC,EAAkBC,GAAW,IAAAv4E,EAAA9rE,KACpFuhI,EAAMjqH,QAAQ,SAAAta,GACV8uE,EAAKm3D,oBAAoBjmI,GACzB8uE,EAAKy3E,OAAOvmJ,EAAG,cAAe8uE,EAAK03E,eAAexmJ,EAAEylE,WAAWyhF,EAAkB,EAAO,EAAIC,4CAKrFxiF,GAA0C,IAAAoK,EAAA/rE,KAApC4jI,EAAoC,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAA3B,EAAGmwI,EAAwB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAClDnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GACzBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C,IAAIgB,EAAc,KACd3iF,aAAgBy4D,EAAAgI,OAAMQ,aACtB0hB,EAAcnqB,EAAAS,MAAM5yE,MAAM2Z,EAAK+gE,WAAY,SAAA1lI,GAAC,OAAE+uE,EAAKy3E,eAAexmJ,EAAEylE,cAGxEd,EAAK+gE,WAAWprH,QAAQ,SAAAta,IAEhBsnJ,EACYv4E,EAAKy3E,eAAec,EAAY7hF,WAAWl/D,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,eAClEsJ,EAAK57D,SAAS47D,EAAKy3E,eAAe7hF,GAAOiiE,GAAQrgI,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,aAAiBd,aAAgBy4D,EAAAgI,OAAMC,gBAGvIt2D,EAAKw3E,OAAOvmJ,EAAG,WAAW,GAC1B+uE,EAAK+2E,eAAe9lJ,EAAEylE,UAAWsJ,EAAK03E,WAAWzmJ,GAAI+uE,EAAK5qB,SAASmiG,EAAoBv3E,EAAKw3E,OAAOvmJ,EAAG,kBAEtG+uE,EAAKw3E,OAAOvmJ,EAAG,WAAW,gCApC/BomJ,KAAO,0LCPlB,IAAAhpB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACAq9H,EAAAr9H,EAAA,uzBAGa6kJ,cAIT,SAAAA,EAAYtjB,GAAiB,mGAAA7D,CAAAx6H,KAAA2hJ,GAAAlnB,EAAAz6H,KAAA06H,EAAAinB,GAAA9jJ,KAAAmC,KACnB2hJ,EAAYyB,MAAM,EAAM/kB,gPALL8kB,EAAAE,+GAQL9hB,EAAO2iB,EAAiBC,EAAWC,EAAkBC,GAAW,IAAAv4E,EAAA9rE,KACpFuhI,EAAMjqH,QAAQ,SAAAta,GACV8uE,EAAKm3D,oBAAoBjmI,GACzB8uE,EAAKy3E,OAAOvmJ,EAAG,cAAe8uE,EAAK03E,eAAexmJ,EAAEylE,WAAW2hF,EAAmB,EAAO,EAAIC,4CAKtF1iF,GAA0C,IAAAoK,EAAA/rE,KAApC4jI,EAAoC,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAA3B,EAAGmwI,EAAwB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAClDnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GACzBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C,IAAIgB,EAAc,KACd3iF,aAAgBy4D,EAAAgI,OAAMQ,aACtB0hB,EAAcnqB,EAAAS,MAAMzyE,MAAMwZ,EAAK+gE,WAAY,SAAA1lI,GAAC,OAAE+uE,EAAKy3E,eAAexmJ,EAAEylE,cAGxEd,EAAK+gE,WAAWprH,QAAQ,SAAAta,IAEhBsnJ,EACYv4E,EAAKy3E,eAAec,EAAY7hF,WAAWl/D,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,eAClEsJ,EAAK57D,SAAS47D,EAAKy3E,eAAe7hF,GAAOiiE,GAAQrgI,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,aAAiBd,aAAgBy4D,EAAAgI,OAAMC,gBAGvIt2D,EAAKw3E,OAAOvmJ,EAAG,WAAW,GAC1B+uE,EAAK+2E,eAAe9lJ,EAAEylE,UAAWsJ,EAAK03E,WAAWzmJ,GAAI+uE,EAAK5qB,SAASmiG,EAAoBv3E,EAAKw3E,OAAOvmJ,EAAG,kBAEtG+uE,EAAKw3E,OAAOvmJ,EAAG,WAAW,gCAnC/BomJ,KAAO,yLCPlB,IAAAY,EAAAlnJ,EAAA,8pBAGaklJ,cAIT,SAAAA,EAAY3jB,GAAiB,mGAAA7D,CAAAx6H,KAAAgiJ,GAAAvnB,EAAAz6H,KAAA06H,EAAAsnB,GAAAnkJ,KAAAmC,KACnBgiJ,EAAWoB,KAAM,EAAE,EAAG,GAAI/kB,gPALR2lB,EAAAC,yCAErBb,KAAO,iJCLlB,IAAAY,EAAAlnJ,EAAA,8pBAGaulJ,cAIT,SAAAA,EAAYhkB,GAAiB,mGAAA7D,CAAAx6H,KAAAqiJ,GAAA5nB,EAAAz6H,KAAA06H,EAAA2nB,GAAAxkJ,KAAAmC,KACnBqiJ,EAAWe,KAAM,EAAE,GAAI,GAAI/kB,gPALT2lB,EAAAC,yCAErBb,KAAO,kJCLlB,IAAAhpB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACAq9H,EAAAr9H,EAAA,uzBAGaglJ,cAIT,SAAAA,EAAYzjB,GAAiB,mGAAA7D,CAAAx6H,KAAA8hJ,GAAArnB,EAAAz6H,KAAA06H,EAAAonB,GAAAjkJ,KAAAmC,KACnB8hJ,EAAYsB,MAAM,EAAO/kB,gPALN8kB,EAAAE,+GAQL9hB,EAAO2iB,EAAiBC,EAAWC,EAAkBC,GAAW,IAAAv4E,EAAA9rE,KACpFuhI,EAAMjqH,QAAQ,SAAAta,GACV8uE,EAAKm3D,oBAAoBjmI,GACzB8uE,EAAKy3E,OAAOvmJ,EAAG,cAAe8uE,EAAK03E,eAAexmJ,EAAEylE,WAAWyhF,EAAkB,EAAO,EAAIC,4CAKrFxiF,GAA0C,IAAAoK,EAAA/rE,KAApC4jI,EAAoC,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAA3B,EAAGmwI,EAAwB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAClDnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GACzBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C,IAAIgB,EAAc,KACd3iF,aAAgBy4D,EAAAgI,OAAMQ,aACtB0hB,EAAcnqB,EAAAS,MAAM5yE,MAAM2Z,EAAK+gE,WAAY,SAAA1lI,GAAC,OAAE+uE,EAAKy3E,eAAexmJ,EAAEylE,cAGxEd,EAAK+gE,WAAWprH,QAAQ,SAAAta,IAEhBsnJ,EACYv4E,EAAKy3E,eAAec,EAAY7hF,WAAWl/D,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,eAClEsJ,EAAK57D,SAAS47D,EAAKy3E,eAAe7hF,GAAOiiE,GAAQrgI,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,aAAiBd,aAAgBy4D,EAAAgI,OAAMC,gBAGvIt2D,EAAKw3E,OAAOvmJ,EAAG,WAAW,GAC1B+uE,EAAK+2E,eAAe9lJ,EAAEylE,UAAWsJ,EAAK03E,WAAWzmJ,GAAI+uE,EAAK5qB,SAASmiG,EAAoBv3E,EAAKw3E,OAAOvmJ,EAAG,kBAEtG+uE,EAAKw3E,OAAOvmJ,EAAG,WAAW,gCAnC/BomJ,KAAO,0LCPlB,IAAAhpB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACAq9H,EAAAr9H,EAAA,uzBAGa+kJ,cAIT,SAAAA,EAAYxjB,GAAiB,mGAAA7D,CAAAx6H,KAAA6hJ,GAAApnB,EAAAz6H,KAAA06H,EAAAmnB,GAAAhkJ,KAAAmC,KACnB6hJ,EAAYuB,MAAM,EAAO/kB,gPALN8kB,EAAAE,+GAQL9hB,EAAO2iB,EAAiBC,EAAWC,EAAkBC,GAAW,IAAAv4E,EAAA9rE,KACpFuhI,EAAMjqH,QAAQ,SAAAta,GACV8uE,EAAKm3D,oBAAoBjmI,GACzB8uE,EAAKy3E,OAAOvmJ,EAAG,cAAe8uE,EAAK03E,eAAexmJ,EAAEylE,WAAW2hF,EAAmB,EAAO,EAAIC,4CAKtF1iF,GAA0C,IAAAoK,EAAA/rE,KAApC4jI,EAAoC,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAA3B,EAAGmwI,EAAwB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAClDnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GACzBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C,IAAIgB,EAAc,KACd3iF,aAAgBy4D,EAAAgI,OAAMQ,aACtB0hB,EAAcnqB,EAAAS,MAAMzyE,MAAMwZ,EAAK+gE,WAAY,SAAA1lI,GAAC,OAAE+uE,EAAKy3E,eAAexmJ,EAAEylE,cAGxEd,EAAK+gE,WAAWprH,QAAQ,SAAAta,IAEhBsnJ,EACYv4E,EAAKy3E,eAAec,EAAY7hF,WAAWl/D,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,eAClEsJ,EAAK57D,SAAS47D,EAAKy3E,eAAe7hF,GAAOiiE,GAAQrgI,OAAOwoE,EAAKy3E,eAAexmJ,EAAEylE,aAAiBd,aAAgBy4D,EAAAgI,OAAMC,gBAGvIt2D,EAAKw3E,OAAOvmJ,EAAG,WAAW,GAC1B+uE,EAAK+2E,eAAe9lJ,EAAEylE,UAAWsJ,EAAK03E,WAAWzmJ,GAAI+uE,EAAK5qB,SAASmiG,EAAoBv3E,EAAKw3E,OAAOvmJ,EAAG,kBAEtG+uE,EAAKw3E,OAAOvmJ,EAAG,WAAW,gCAnC/BomJ,KAAO,gMCPlB,IAAAhpB,EAAAt9H,EAAA,YACAqmJ,EAAArmJ,EAAA,oBACA+gI,EAAA/gI,EAAA,o0BAGamnJ,cAKT,SAAAA,EAAY19I,EAAMuhI,EAAczJ,GAAkB,IAAAvyD,EAAA,mGAAA0uD,CAAAx6H,KAAAikJ,IAC9Cn4E,EAAA2uD,EAAAz6H,KAAA06H,EAAAupB,GAAApmJ,KAAAmC,KAAMuG,GAAM,EAAM83H,GAAkB,KAJxCkmB,iBAAmB,EAG+Bz4E,EAFlDg8D,aAAe,CAAC,GAAI,GAIhBh8D,EAAKg8D,aAAeA,EAF0Bh8D,8OALfq3E,EAAAE,kHAWRkB,GACvBvkJ,KAAKukJ,iBAAmBA,wCAId5iF,GAAkD,IAAAoK,EAAA/rE,KAA5C4jI,EAA4C,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAnC,CAAC,EAAG,GAAIqxI,EAA2B,EAAArxI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAR,CAAC,EAAG,GACpDsxI,EAAiB,CAAC,EAAG,GACzB,GAAI9iF,EAAK+gE,WAAW5kI,OAAQ,CACxB,GAAI6jE,aAAgBy4D,EAAAgI,OAAMC,aAAc,CAEpC,IAAIqiB,EAAkB,GAClBC,GAAa9iJ,EAAAA,EAcjB,GAZA8/D,EAAK+gE,WAAWprH,QAAQ,SAACta,EAAGI,GACxB,IAAIwnJ,EAAc,CAAC74E,EAAK03E,WAAWzmJ,EAAG,GAAI+uE,EAAK03E,WAAWzmJ,EAAG,IAEzD6nJ,GADc94E,EAAK82E,cAAc7lJ,EAAEylE,UAAWmiF,EAAa,CAAC74E,EAAK5rE,IAAIykJ,EAAY,GAAIJ,EAAiB,IAAKz4E,EAAK5rE,IAAIykJ,EAAY,GAAIJ,EAAiB,MAC/Hz4E,EAAKw3E,OAAOvmJ,EAAEylE,UAAW,mBACzBkiF,EAAtBE,GACAF,EAAYE,EACZH,EAAkB,CAACtnJ,IACZunJ,EAAUphJ,OAAOshJ,IACxBH,EAAgBt3I,KAAKhQ,KAIzB4C,KAAK0iJ,eAAgB,CACrBgC,EAAkB,GAClB,IAAIpiB,EAAWzE,EAAA0E,OAAOC,YAAYxiI,KAAK0iJ,eAAgB/gF,GACnD2gE,IACAoiB,EAAkB,CAACpiB,EAASK,gBAKpChhE,EAAK+gE,WAAWprH,QAAQ,SAACta,EAAGI,GACxB2uE,EAAKk3D,oBAAoBjmI,GACzB+uE,EAAKw3E,OAAOvmJ,EAAG,cAAe0nJ,EAAgB58I,QAAQ1K,GAAK,EAAI,EAAM,UAGzEukE,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpB,IAAI4nJ,EAAc,CAAC74E,EAAK03E,WAAWzmJ,EAAG,GAAI+uE,EAAK03E,WAAWzmJ,EAAG,IAC7D+uE,EAAK82E,cAAc7lJ,EAAEylE,UAAWmiF,EAAa,CAAC74E,EAAK5rE,IAAIykJ,EAAY,GAAIJ,EAAiB,IAAKz4E,EAAK5rE,IAAIykJ,EAAY,GAAIJ,EAAiB,MACvIz4E,EAAKk3D,oBAAoBjmI,GACzB+uE,EAAKw3E,OAAOvmJ,EAAG,cAAe+uE,EAAK+4E,gBAAgB9nJ,MAI3D,IAAI+nJ,EAAY,EAChBpjF,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpB+nJ,EAAYh5E,EAAK5rE,IAAI4kJ,EAAWh5E,EAAKw3E,OAAOvmJ,EAAG,kBAGnC,EAAZ+nJ,GACApjF,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpBynJ,EAAentI,QAAQ,SAAC3Z,EAAGP,GACvB,IAAI4nJ,EAAKj5E,EAAKw3E,OAAOvmJ,EAAEylE,UAAW,UAAYrlE,EAAI,KAClDqnJ,EAAernJ,GAAK2uE,EAAK5rE,IAAIxC,EAAGouE,EAAK5qB,SAAS4qB,EAAKw3E,OAAOvmJ,EAAG,eAAgBgoJ,GAAI1kJ,IAAIykJ,QAsBrG,OAfAnhB,EAAOtsH,QAAQ,SAAC3Z,EAAGP,GACfwmI,EAAOxmI,GAAK2uE,EAAK5rE,IAAIxC,EAAG8mJ,EAAernJ,MAG3C4C,KAAKijI,oBAAoBthE,GAErBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,mBAAoB6iF,GACtCxkJ,KAAKujJ,OAAO5hF,EAAM,qBAAsB,IAExC3hE,KAAKujJ,OAAO5hF,EAAM,iBAAkB8iF,GAGxCzkJ,KAAKujJ,OAAO5hF,EAAM,iBAAkB3hE,KAAKilJ,sBAAsBrhB,IAExD5jI,KAAKujJ,OAAO5hF,EAAM,SAAUiiE,iDAGjBA,GAElB,OAAI5jI,KAAKukJ,mBAAqB1iJ,EAAAA,EACnB7B,KAAKmhD,SAASnhD,KAAK8nI,aAAa,GAAIlE,EAAO,IAE/C5jI,KAAKG,IAAIH,KAAKmhD,SAASnhD,KAAK8nI,aAAa,GAAI9nI,KAAKmhD,SAASnhD,KAAKukJ,iBAAkB3gB,EAAO,KAAM5jI,KAAKmhD,SAASnhD,KAAK8nI,aAAa,GAAIlE,EAAO,4CAItIjiE,GAAkD,IAAA8+D,EAAAzgI,KAA5CklJ,EAA4C,EAAA/xI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAA3B,EAAGmwI,EAAwB,EAAAnwI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAC1DnT,KAAKujJ,OAAO5hF,EAAM,WAAW,GACzBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,qBAAsB2hF,GAG5C3hF,EAAK+gE,WAAWprH,QAAQ,SAAAta,IAChByjI,EAAKtwH,SAASswH,EAAK8iB,OAAO5hF,EAAM,kBAAmBujF,GAAgB3hJ,OAAOk9H,EAAK8iB,OAAOvmJ,EAAEylE,UAAW,oBAAwBd,aAAgBy4D,EAAAgI,OAAMC,aAIjJ5B,EAAK8iB,OAAOvmJ,EAAG,WAAW,IAH1ByjI,EAAK8iB,OAAOvmJ,EAAG,WAAW,GAC1ByjI,EAAKqiB,eAAe9lJ,EAAEylE,UAAWg+D,EAAKwkB,sBAAsB,CAACxkB,EAAKgjB,WAAWzmJ,EAAG,GAAIyjI,EAAKgjB,WAAWzmJ,EAAG,KAAMyjI,EAAKt/E,SAASmiG,EAAoB7iB,EAAK8iB,OAAOvmJ,EAAG,4QCnH9K,IAAAsgI,EAAAxgI,EAAA,wBACAs9H,EAAAt9H,EAAA,YACA+gI,EAAA/gI,EAAA,whBAGaumJ,aAUT,SAAAA,EAAY98I,EAAMgmI,EAAclO,GAAuC,IAArBuB,EAAqB,EAAAzsH,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,gGAAAqnH,CAAAx6H,KAAAqjJ,GAAArjJ,KAHvEokI,YAAc,EAGyDpkI,KAFvE4/H,eAAgB,EAGZ5/H,KAAKuG,KAAOA,EACZvG,KAAKusI,aAAeA,EACpBvsI,KAAKq+H,iBAAmBA,EACxBr+H,KAAK4/H,cAAgBA,mGAGP8iB,GACd1iJ,KAAK0iJ,eAAiBA,yCAGXte,GACXpkI,KAAKokI,YAAcA,gDAInBpkI,KAAK0iJ,eAAiB,0CAIbyC,EAAcC,GACvB,IAAIC,EAEAA,EADArlJ,KAAKusI,aACEvsI,KAAKiH,IAALyQ,MAAA1X,KAAAkoI,EAAYkd,IAEZplJ,KAAKgH,IAAL0Q,MAAA1X,KAAAkoI,EAAYkd,IAEvB,IAAIV,EAAkB,GAMtB,OALAU,EAAgB9tI,QAAQ,SAAC3Z,EAAGP,GACiB,GAArCkgI,EAAAgB,iBAAiBtuH,QAAQq1I,EAAM1nJ,IAC/B+mJ,EAAgBt3I,KAAKhQ,KAGtBsnJ,wCAGGS,EAAcC,GACxB,GAAIplJ,KAAK0iJ,eAAgB,CACrB,IAAIpgB,EAAWzE,EAAA0E,OAAOC,YAAYxiI,KAAK0iJ,eAAgByC,GACvD,OAAI7iB,EACO,CAACA,EAASK,eAEd,GAEX,OAAO3iI,KAAKslJ,aAAaH,EAAcC,mDAInB7jB,EAAO2iB,EAAiBC,EAAWC,EAAkBC,0CAK/D1iF,GAAwC,IAAAmK,EAAA9rE,KAAlC4jI,EAAkC,EAAAzwH,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAzB,EAAGqxI,EAAsB,EAAArxI,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAC3CsxI,EAAiB,EACrB,GAAI9iF,EAAK+gE,WAAW5kI,OAAQ,CACxB,GAAI6jE,aAAgBy4D,EAAAgI,OAAMC,aAAc,CAEpC,IAAIqiB,EAAkB1kJ,KAAKulJ,cAAc5jF,EAAMA,EAAK+gE,WAAWtqG,IAAI,SAAAp7B,GAAC,OAAE8uE,EAAK+2E,cAAc7lJ,EAAEylE,UAAWqJ,EAAK23E,WAAWzmJ,GAAI8uE,EAAK3rE,IAAI2rE,EAAK23E,WAAWzmJ,GAAIwnJ,OACvJ7iF,EAAK+gE,WAAWprH,QAAQ,SAACta,EAAGI,GACxB0uE,EAAKm3D,oBAAoBjmI,GACzB8uE,EAAKy3E,OAAOvmJ,EAAG,cAAe0nJ,EAAgB58I,QAAQ1K,GAAK,EAAI,EAAM,SAGtE,CACH,IAAIunJ,GAAa9iJ,EAAAA,EACbsiJ,EAAY,EACZqB,EAAa3jJ,EAAAA,EACbwiJ,EAAa,EAEjB1iF,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpB,IAAIyoJ,EAAc35E,EAAK+2E,cAAc7lJ,EAAEylE,UAAWqJ,EAAK23E,WAAWzmJ,GAAI8uE,EAAK3rE,IAAI2rE,EAAK23E,WAAWzmJ,GAAIwnJ,IAC/FiB,EAAcD,GACdA,EAAaC,EACbpB,EAAa,GACNoB,EAAYliJ,OAAOiiJ,IAC1BnB,IAEcM,EAAdc,GACAd,EAAYc,EACZtB,EAAY,GACLsB,EAAYliJ,OAAOohJ,IAC1BR,IAGJr4E,EAAKm3D,oBAAoBjmI,GACzB8uE,EAAKy3E,OAAOvmJ,EAAG,cAAe8uE,EAAKg5E,gBAAgB9nJ,MAEvDgD,KAAK0lJ,wBAAwB/jF,EAAK+gE,WAAYiiB,EAAWR,EAAWqB,EAAYnB,GAGpF,IAAIU,EAAY,EAChBpjF,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpB+nJ,EAAYj5E,EAAK3rE,IAAI4kJ,EAAWj5E,EAAKy3E,OAAOvmJ,EAAG,kBAInC,EAAZ+nJ,GACApjF,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpBynJ,EAAiB34E,EAAK3rE,IAAIskJ,EAAgB34E,EAAK3qB,SAAS2qB,EAAKy3E,OAAOvmJ,EAAG,eAAgB8uE,EAAK03E,eAAexmJ,EAAEylE,YAAYniE,IAAIykJ,MAiBzI,OAVAnhB,EAAS5jI,KAAKG,IAAIyjI,EAAQ6gB,GAC1BzkJ,KAAKijI,oBAAoBthE,GAErBA,aAAgBy4D,EAAAgI,OAAMS,cACtB7iI,KAAKujJ,OAAO5hF,EAAM,oBAA0B3hE,KAAKokI,YAAc,IAAKogB,GACpExkJ,KAAKujJ,OAAO5hF,EAAM,qBAAsB,IAExC3hE,KAAKujJ,OAAO5hF,EAAM,kBAAyB3hE,KAAKokI,YAAc,IAAKqgB,GAGhEzkJ,KAAKwjJ,eAAe7hF,EAAMiiE,0CAItBjiE,GACX,KAAM,qDAAuD3hE,KAAKuG,4CAIvDo7D,EAAMv9D,GACjB,OAAOpE,KAAKujJ,OAAO5hF,EAAM,UAAY3hE,KAAKokI,YAAc,IAAKhgI,kCAI1DymB,EAAQ86H,EAAWvhJ,GAKtB,OAAOymB,EAAOy5G,cAActkI,KAAKuG,KAAMo/I,EAAWvhJ,2CAGtCs/H,GACZ,OAAOA,EAAKsf,6DAGLtf,EAAMU,GACb,OAAOV,EAAKkiB,wBAAmBvmJ,EAAW+kI,GAAepkI,KAAKokI,yDAG9Cv5G,GAChBA,EAAOo4G,oBAAoBjjI,KAAKuG,kCAGhC/I,EAAGkB,GACH,OAAO4+H,EAAAgB,iBAAiBn+H,IAAI3C,EAAGkB,oCAG1BlB,EAAGkB,GACR,OAAO4+H,EAAAgB,iBAAiBnuH,SAAS3S,EAAGkB,kCAGjClB,EAAGkB,GACN,OAAO4+H,EAAAgB,iBAAiBx0H,OAAOtM,EAAGkB,oCAG7BlB,EAAGkB,GACR,OAAO4+H,EAAAgB,iBAAiBn9E,SAAS3jD,EAAGkB,iCAIpC,OAAO4+H,EAAAgB,iBAAiBr3H,IAAjByQ,MAAA4lH,EAAAgB,iBAAwBnrH,yCAI/B,OAAOmqH,EAAAgB,iBAAiBt3H,IAAjB0Q,MAAA4lH,EAAAgB,iBAAwBnrH,oRC1LvC,IAAAinH,EAAAt9H,EAAA,YACAwgI,EAAAxgI,EAAA,wBACAq9H,EAAAr9H,EAAA,YACA+oJ,EAAA/oJ,EAAA,eACA0gI,EAAA1gI,EAAA,20BAGagpJ,cAMT,SAAAA,EAAYpmH,EAAM2+F,GAAkB,IAAAvyD,EAAA,mGAAA0uD,CAAAx6H,KAAA8lJ,IAChCh6E,EAAA2uD,EAAAz6H,KAAA06H,EAAAorB,GAAAjoJ,KAAAmC,KAAM8lJ,EAAYC,SACbrmH,KAAOA,EACZosC,EAAKuyD,iBAAmBA,EACxBvyD,EAAKizD,cAAgB,IAAIvB,EAAAwB,cAAcX,GAJPvyD,8OANP+5E,EAAAG,gGAahBn7H,GACT,OAAOA,aAAkBuvG,EAAAgI,OAAMQ,8CAGxBjhE,GACP,IAAK3hE,KAAKimJ,aAAatkF,GACnB,OAAO,EAGX,IAAK3hE,KAAK++H,cAAc5wB,SAASnuG,KAAK0/B,KAAKqgG,qBAAqBp+D,IAAOq+D,UACnE,OAAO,EAGX,GAAIr+D,EAAK+gE,WAAW5kI,OAAS,EACzB,OAAO,EAIX,IAAIooJ,EAAsB,KACtBC,EAA0B,GAC1BC,EAAwB,IAAItpH,IAEhC,QAAK6kC,EAAK+gE,WAAWn8E,MAAM,SAAAvpD,GAEnB,IAAIkrE,EAAQlrE,EAAEylE,UACd,OAAMyF,aAAiBkyD,EAAAgI,OAAMQ,cAIzBwjB,EAAsB76H,IAAIvuB,EAAEuJ,KAAKmkD,UAGrC07F,EAAsBjmJ,IAAInD,EAAEuJ,KAAKmkD,QAEL,OAAxBw7F,KACAA,EAAsBh+E,EAAMw6D,WAAW5kI,QACb,KAG1BoqE,EAAMw6D,WAAWprH,QAAQ,SAAA+uI,GACrBF,EAAwB/4I,KAAKi5I,EAAG9/I,KAAKmkD,UAGZ,IAAI5tB,IAAIqpH,GAEN9tH,OAAS8tH,EAAwBroJ,QAOhEoqE,EAAMw6D,WAAW5kI,QAAUooJ,KAI1Bh+E,EAAMw6D,WAAWn8E,MAAM,SAAC8/F,EAAIjpJ,GAAL,OAAS+oJ,EAAwB/oJ,KAAOipJ,EAAG9/I,KAAKmkD,6CAchFzsD,GAAM,IAAA8tE,EAAA/rE,KAENsmJ,EAAYtmJ,KAAK0/B,KAAK6mH,aAAatoJ,GAAM,GACzCuoJ,EAAoBvoJ,EAAKykI,WAAW5kI,OACpC2oJ,EAAyBxoJ,EAAKykI,WAAW,GAAGjgE,UAAUigE,WAAW5kI,OAEjE4oJ,EAAiBD,EACjBE,EAAsBH,EAEtBI,EAAoB5mJ,KAAK0/B,KAAKknH,kBAClC5mJ,KAAK0/B,KAAKknH,mBAAoB,EAG9B,IAAIC,EAAS5oJ,EAAKykI,WAAW,GAAGjgE,UAAUtU,SAAShwD,EAC/C2oJ,EAAO7oJ,EAAKykI,WAAW,GAAGjgE,UAAUigE,WAAW,GAAGjgE,UAAUtU,SAASjtD,EAIrE6lJ,GAHU9oJ,EAAKykI,WAAW8jB,EAAoB,GAAG/jF,UAAUigE,WAAW+jB,EAAyB,GAAGhkF,UAAUtU,SAASjtD,EAEjG4lJ,IACDJ,EAAiB,GAExCzoJ,EAAKykI,WAAW74H,QAAQyN,QAAQ,SAAAta,GAAC,OAAG+uE,EAAKrsC,KAAKsnH,WAAWhqJ,EAAEylE,aAG3D,IAAK,IAAIrlE,EAAI,EAAGA,EAAIspJ,EAAgBtpJ,IAAK,CACrC,IAAI8qE,EAAQ,IAAIkyD,EAAAgI,OAAMQ,WAAW,IAAIxI,EAAAgI,OAAM6kB,MAAMJ,EAAQC,GAAQ1pJ,EAAI,GAAK2pJ,IACtErjB,EAAO1jI,KAAK0/B,KAAKwnH,QAAQh/E,EAAOjqE,GACpCylI,EAAKn9H,KAAO+/I,EAAU5jB,WAAW,GAAGjgE,UAAUigE,WAAWtlI,GAAGmJ,KAI5D,IAAK,IAAImB,EAFTg8H,EAAKe,YAAc,EAEH/8H,EAAIi/I,EAAqBj/I,IAAK,CAC1C,IAAIy/I,EAAab,EAAU5jB,WAAWh7H,GAAG+6D,UAAUigE,WAAWtlI,GAAGqlE,UAG7D2kF,EAAiBpnJ,KAAK0/B,KAAK2nH,cAAcF,EAAYj/E,GACzDk/E,EAAe7gJ,KAAO+/I,EAAU5jB,WAAWh7H,GAAGnB,KAC9C6gJ,EAAexjB,OAAS,CACpBtG,EAAAgB,iBAAiBn+H,IAAImmJ,EAAU5jB,WAAWh7H,GAAGk+I,wBAAmBvmJ,EAAW,GAAIinJ,EAAU5jB,WAAWh7H,GAAG+6D,UAAUigE,WAAWtlI,GAAGwoJ,wBAAmBvmJ,EAAW,IAC7Ji+H,EAAAgB,iBAAiBn+H,IAAImmJ,EAAU5jB,WAAWh7H,GAAGk+I,wBAAmBvmJ,EAAW,GAAIinJ,EAAU5jB,WAAWh7H,GAAG+6D,UAAUigE,WAAWtlI,GAAGwoJ,wBAAmBvmJ,EAAW,KAGjK+nJ,EAAe3iB,YAAcnH,EAAAgB,iBAAiBn9E,SAASmlG,EAAU5jB,WAAWh7H,GAAGs7I,0BAA2BsD,EAAU5jB,WAAWh7H,GAAG+6D,UAAUigE,WAAWtlI,GAAG4lJ,2BAC1Jtf,EAAKe,YAAcnH,EAAAgB,iBAAiBn+H,IAAIujI,EAAKe,YAAa2iB,EAAe3iB,aAG7E,IAAI6iB,EAAkC,SAAA3pJ,GAAC,OAAI2/H,EAAAgB,iBAAiBx0H,OAAOnM,EAAG+lI,EAAKe,cAC3E,GAAIf,EAAKe,YAAYlhI,OAAO,GAAI,CAC5B,IAAIyqG,EAAOsvB,EAAAgB,iBAAiBx0H,OAAO,EAAG68I,GACtCW,EAAkC,SAAA3pJ,GAAC,OAAIqwG,GAG3C,IAAIg2B,EAAiB,EACrB97D,EAAMw6D,WAAWprH,QAAQ,SAAA8vI,GACrBA,EAAe3iB,YAAc6iB,EAAgCF,EAAe3iB,aAC5ET,EAAiB1G,EAAAgB,iBAAiBn+H,IAAI6jI,EAAgBojB,EAAe3iB,aACrE2iB,EAAe3iB,YAAc14D,EAAKsyD,iBAAiB6C,UAAUkmB,EAAe3iB,eAGhFzkI,KAAKunJ,iCAAiCr/E,EAAMw6D,WAAYsB,GACxDN,EAAKe,YAAczkI,KAAKq+H,iBAAiB6C,UAAUwC,EAAKe,aAE5DzkI,KAAKunJ,iCAAiCtpJ,EAAKykI,YAG3C1iI,KAAK0/B,KAAKknH,kBAAoBA,EAC9B5mJ,KAAK0/B,KAAK8nH,kFAGmB9kB,EAAYsB,GAAe,IAAAvD,EAAAzgI,KAOxD,GANIgkI,IACAA,EAAiB,EACjBtB,EAAWprH,QAAQ,SAAAta,GACfgnI,EAAiB1G,EAAAgB,iBAAiBn+H,IAAI6jI,EAAgBhnI,EAAEynI,iBAG3DT,EAAezgI,OAAO,GAAI,CAC3B42H,EAAAr7H,IAAIs1I,KAAK,+DAAgEpQ,GACzE,IAAIyjB,EAAoB,EAGxB/kB,EAAWprH,QAAQ,SAAAta,GACfA,EAAEynI,YAAc1sH,SAHX,KAGoBulH,EAAAgB,iBAAiBh7H,MAAMtG,EAAEynI,YAF3C,KAGPgjB,GAAwCzqJ,EAAEynI,cAE9C,IAAI1gF,EANK,KAMO0jG,EAChBttB,EAAAr7H,IAAIs1I,KAAK,6CAAmDrwF,GAC5D2+E,EAAW,GAAG+B,YAAcnH,EAAAgB,iBAAiBn+H,IAAI4jD,EAAM2+E,EAAW,GAAG+B,aACrEgjB,EAAoB,EACpB/kB,EAAWprH,QAAQ,SAAAta,GACfA,EAAEynI,YAAchE,EAAKpC,iBAAiB6C,UAAU5D,EAAAgB,iBAAiBx0H,OAAOiO,SAAS/a,EAAEynI,aAX9E,qCA/JVshB,MAAQ,ibCPNC,aAIT,SAAAA,EAAYz/I,gGAAKi0H,CAAAx6H,KAAAgmJ,GACbhmJ,KAAKuG,KAAOA,gGAKZ,KAAM,wDAAwDvG,KAAKuG,wCAI5DskB,GACP,KAAM,sDAAsD7qB,KAAKuG,qCAG7DskB,GACJ,KAAM,mDAAmD7qB,KAAKuG,+ICrBtE,IAAAmhJ,EAAA5qJ,EAAA,4LAGa6hI,aAKT,SAAAA,EAAYj/F,EAAM2+F,gGAAiB7D,CAAAx6H,KAAA2+H,GAAA3+H,KAHnC2nJ,WAAa,GAGsB3nJ,KAFnC4nJ,gBAAkB,GAGd5nJ,KAAK0/B,KAAOA,EACZ1/B,KAAKq+H,iBAAmBA,EACxBr+H,KAAK6nJ,kBAAkB,IAAIH,EAAA5B,YAAYpmH,EAAM2+F,qGAG/BypB,GACd9nJ,KAAK2nJ,WAAWv6I,KAAK06I,GACrB9nJ,KAAK4nJ,gBAAgBE,EAAUvhJ,MAAQuhJ,6CAIxBvhJ,GACf,OAAOvG,KAAK4nJ,gBAAgBrhJ,+CAGZskB,GAChB,OAAO7qB,KAAK2nJ,WAAWnlG,OAAO,SAAAsmB,GAAE,OAAEA,EAAGm9E,aAAap7H,qCAG9C6U,GACJ1/B,KAAK0/B,KAAOA,EACZ1/B,KAAK2nJ,WAAWrwI,QAAQ,SAAAna,GAAC,OAAIA,EAAEuiC,KAAOA,2UC7BjCqoH,aAMT,SAAAA,EAAYpmF,EAAMghE,gGAAenI,CAAAx6H,KAAA+nJ,GAAA/nJ,KAHjCgnF,SAAW,GAIPhnF,KAAK2hE,KAAOA,EACZ3hE,KAAK2iI,cAAgBA,EACrB3iI,KAAKsV,IAAMyyI,EAAS7O,YAAYl5I,iGASxB2hE,EAAMghE,GACd,IAAIL,EAAW,IAAIylB,EAASpmF,EAAMghE,GAGlC,OAFA3iI,KAAKgnF,SAAS55E,KAAKk1H,GACnBtiI,KAAKsV,IAAMyyI,EAAS7O,YAAYl5I,MACzBsiI,sCAGC6iB,GACR,OAAO4C,EAASvlB,YAAYxiI,KAAMmlJ,8CA6CR,IAAb6C,EAAa,EAAA70I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAC1B,OAAO40I,EAASE,iBAAiBjoJ,KAAMgoJ,yCA5DxB1lB,GAA4B,IAAlB4lB,EAAkB,EAAA/0I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAN,MACjCnW,EAAIslI,EAAS3gE,KAAK+gE,WAAWJ,EAASK,eAE1C,OADUL,EAAS3gE,KAAKumF,GAAa,KAAKlrJ,EAAEkrJ,GAAclrJ,EAAEkrJ,GAAe5lB,EAASK,cAAc,IACvFtwH,QAAQ,MAAO,yCAcXiwH,EAAU6iB,GACzB,GAAG7iB,EAAS3gE,OAAOwjF,GAAgB7iB,EAAS3gE,KAAKwmF,MAAQhD,EAAagD,IAClE,OAAO7lB,EAEX,IAAI,IAAIllI,EAAE,EAAGA,EAAEklI,EAASt7C,SAASlpF,OAAQV,IAAI,CACzC,IAAImD,EAAIwnJ,EAASvlB,YAAYF,EAASt7C,SAAS5pF,GAAI+nJ,GACnD,GAAG5kJ,EACC,OAAOA,4CAKK+hI,GAA0D,IAAhD7iD,EAAgD,EAAAtsE,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAAhC+0I,EAAgC,EAAA/0I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAApB,OAAQ60I,EAAY,EAAA70I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,GAEvE7Q,EAAMylJ,EAAS7O,YAAY5W,EAAU4lB,GACrCE,EAAc,GAwBlB,OAtBA9lB,EAASt7C,SAAS1vE,QAAQ,SAAA/W,GACnB6nJ,IAEKA,GADD3oE,EACgB,KAAKuoE,EAEL,MAIvBI,GAAeL,EAASE,iBAAiB1nJ,EAAEk/E,EAASyoE,EAAaF,EAAO,QAEzE1lB,EAASt7C,SAASlpF,SAEbsqJ,EADD3oE,EACgB,KAAKuoE,EAAQI,EAEd,OAASA,EAAc,KAOtC9lJ,EAAI8lJ,2ICrEnB,IAAAvqB,EAAA/gI,EAAA,YACAs9H,EAAAt9H,EAAA,YACAq9H,EAAAr9H,EAAA,YACAurJ,EAAAvrJ,EAAA,wLAEa+qI,aAIT,SAAAA,EAAY5pI,EAAMqqJ,GAAmB,IAAAx8E,EAAA9rE,kGAAAw6H,CAAAx6H,KAAA6nI,GAAA7nI,KAHrC6mI,SAAW,GAG0B7mI,KAFrCq8H,UAAS,EAGLr8H,KAAKq8H,SAAWisB,EAChBtoJ,KAAKuoJ,QAAQtqJ,GAAMqZ,QAAQ,SAACkxI,EAAUprJ,GAClC0uE,EAAK+6D,SAASz5H,KAAK,IAAIywH,EAAA0E,OAAO,KAAKnlI,EAAE,GAAIorJ,MAEnB,IAAvBxoJ,KAAK6mI,SAAS/oI,SACbkC,KAAK6mI,SAAS,GAAGp2F,GAAK,kGAItBxyC,GAIJ,IAJS,IAEL0jE,EAFKoK,EAAA/rE,KACLyoJ,EAAY,CAACxqJ,GAEbyqJ,EAAgB,GACdD,EAAU3qJ,QACZ6jE,EAAO8mF,EAAUn7I,QAEdtN,KAAKq8H,WAAa16D,EAAK2iE,cAActkI,KAAKq8H,SAAU,aAIpD16D,aAAgBy4D,EAAAgI,OAAMC,aACrBqmB,EAAct7I,KAAKu0D,GAIvBA,EAAK+gE,WAAWprH,QAAQ,SAACosH,EAAMtmI,GAC3BqrJ,EAAUr7I,KAAKs2H,EAAKjhE,cAI5B,OAAO03D,EAAAS,MAAM+Q,mBAAmB+c,EAActwH,IAAI,SAAC+sH,GAC/C,IAAIqD,EAAW,GAef,OAdArD,EAAaziB,WAAWprH,QAAQ,SAACosH,EAAMtmI,GAEhC2uE,EAAKswD,WAAaqH,EAAKY,cAAcv4D,EAAKswD,SAAU,YAIlCtwD,EAAKw8E,QAAQ7kB,EAAKjhE,WACxBnrD,QAAQ,SAAAkxG,GACnB,IAAI8Z,EAAW,IAAI+lB,EAAAN,SAAS5C,EAAc/nJ,GAC1CorJ,EAAUp7I,KAAKk1H,GACfA,EAASt7C,SAAWwhC,MAIrBggC,uQCxDnB,IAAAlrB,EAAAxgI,EAAA,wBACAA,EAAA,sLAGa6rJ,aAET,SAAAA,EAAYtqB,gGAAiB7D,CAAAx6H,KAAA2oJ,GACzB3oJ,KAAKq+H,iBAAiBA,0FAGjBj6H,GAGL,GAAGA,MAAAA,EACC,OAAO,EAGXA,EAAQk5H,EAAAgB,iBAAiBlvH,SAAShL,GAClC,IAAIwkJ,EAAiBtpJ,OAAOqgB,kBAAoB,iBAChD,OAA2D,GAApD29G,EAAAgB,iBAAiBtuH,QAAQ5L,GAAQwkJ,IAAwBtrB,EAAAgB,iBAAiBtuH,QAAQ5L,EAAOwkJ,IAAmB,kOCnB3H,IAAAtrB,EAAAxgI,EAAA,wBACAA,EAAA,sLAGa+rJ,aAET,SAAAA,EAAYxqB,gGAAiB7D,CAAAx6H,KAAA6oJ,GACzB7oJ,KAAKq+H,iBAAiBA,0FAGjBj6H,EAAOs/H,GACZ,OAAGt/H,MAAAA,IAKwB,IADvBA,EAAQk5H,EAAAgB,iBAAiBlvH,SAAShL,IACzB4L,QAAQ,IAAW5L,EAAM4L,QAAQ,IAAM,4NChB5D,IAAAoqH,EAAAt9H,EAAA,YACAwgI,EAAAxgI,EAAA,wBACAgsJ,EAAAhsJ,EAAA,iCACAisJ,EAAAjsJ,EAAA,sMAEakiI,aAIT,SAAAA,EAAYX,gGAAkB7D,CAAAx6H,KAAAg/H,GAC1Bh/H,KAAKq+H,iBAAmBA,EACxBr+H,KAAKgpJ,0BAA4B,IAAIF,EAAAD,0BAA0BxqB,GAC/Dr+H,KAAKipJ,qBAAuB,IAAIF,EAAAJ,qBAAqBtqB,2FAGhDj2D,GAAO,IAAA0D,EAAA9rE,KAERkpJ,EAAmB,IAAI9uB,EAAA+uB,iBAM3B,OAJA/gF,EAAM9wD,QAAQ,SAAAra,GACV6uE,EAAKs9E,aAAansJ,EAAGisJ,KAGlBA,uCAGEvnF,GAAiD,IAAAoK,EAAA/rE,KAA3CkpJ,EAA2C,EAAA/1I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAxB,IAAIinH,EAAA+uB,iBAEtC,KAAIxnF,aAAgBy4D,EAAAgI,OAAMS,cAA1B,CAGKlhE,EAAK+gE,WAAW5kI,QACjBorJ,EAAiBG,SAAS,iBAAkB1nF,GAGhD,IAAIqiE,EAAiB1G,EAAAgB,iBAAiBlvH,SAAS,GAqC/C,OAnCAuyD,EAAK+gE,WAAWprH,QAAQ,SAACta,EAAGI,GAGxB,GAFAJ,EAAEssJ,iBAAiB,eAAe,GAE9B3nF,aAAgBy4D,EAAAgI,OAAMQ,WAAY,CAClC,IAAI6B,EAAcznI,EAAEgmJ,0BACfj3E,EAAKi9E,0BAA0B76C,SAASs2B,GAOzCT,EAAiB1G,EAAAgB,iBAAiBn+H,IAAI6jI,EAAgBS,GANjDnH,EAAAgB,iBAAiBkG,OAAOxnI,EAAEynI,eAC3BykB,EAAiBG,SAAS,CAAC9iJ,KAAM,qBAAsBm5B,KAAM,CAACgC,OAAUtkC,EAAI,IAAKukE,GACjF3kE,EAAEssJ,iBAAiB,eAAe,IAQ9CtsJ,EAAE4mI,OAAOtsH,QAAQ,SAAC6sH,EAAWC,GACzB,IAAI79F,EAAO,UAAY69F,EAAc,IACrCpnI,EAAEssJ,iBAAiB/iH,GAAM,GACzB,IAAIq9F,EAAS5mI,EAAE4oJ,wBAAmBvmJ,EAAW+kI,GACxCr4D,EAAKk9E,qBAAqB96C,SAASy1B,KACpCslB,EAAiBG,SAAS,CAAC9iJ,KAAM,gBAAiBm5B,KAAM,CAACgC,OAAUtkC,EAAI,IAAKukE,GAC5E3kE,EAAEssJ,iBAAiB/iH,GAAM,QAMjCo7B,aAAgBy4D,EAAAgI,OAAMQ,cAClB9iI,MAAMkkI,IAAoBA,EAAezgI,OAAO,IAChD2lJ,EAAiBG,SAAS,2BAA4B1nF,IAKvDunF,sRCxEf,IAAA/uB,EAAAr9H,EAAA,YACAqzD,EAAAmhF,EAAAx0I,EAAA,aACAysJ,EAAAjY,EAAAx0I,EAAA,6dAGAysJ,EAASC,iBAAiBlyI,QAAQ,SAAAm4F,GAC9B,IAAIg6C,EAAW,GACfA,EAASh6C,GAAU85C,EAAS95C,GAC5B,IACIt/C,EAAKu5F,OAAOD,GACf,MAAOzsJ,GACJm9H,EAAAr7H,IAAIsb,MAAMpd,UAKLshI,aAIT,SAAAA,iGAAc9D,CAAAx6H,KAAAs+H,GACVt+H,KAAK21D,OAASxF,EAAKwF,iGAIdiB,GACL52D,KAAK21D,OAAOiB,MAAQA,+BAGnBT,GAA8B,IAAxBwzF,IAAwB,EAAAx2I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAPyjD,EAAO,EAAAzjD,UAAArV,OAAAqV,UAAA,QAAA9T,EAC/B,OAAOi/H,EAAiBsrB,OAAOzzF,EAAMwzF,EAAU/yF,EAAO52D,KAAK21D,yCAqHtDQ,EAAMS,GAA2B,IAApBizF,IAAoB,EAAA12I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAItC,OAHKyjD,IACDA,EAAQ52D,KAAK21D,OAAOiB,OAEjB0nE,EAAiBnwB,SAASh4C,EAAMS,EAAOizF,qCA4BxCh3I,GACN,OAAOyrH,EAAiBlvH,SAASyD,GAAGnE,YAAW,4CAI/C,OAAOyhD,EAAK2C,KAAKg3F,kDAIjB,IAAI90I,EAAOhV,KACX,OAAO,SAAUyG,EAAGoM,GAChB,GAAIA,MAAAA,GAAiCyrH,EAAiByrB,mBAAmBl3I,GACrE,IACI,OAAOmC,EAAKksH,UAAUruH,GACxB,MAAO7V,GACL,OAAO6V,EAGf,OAAOA,kCApKHsjD,GAA8B,IAAxBwzF,IAAwB,EAAAx2I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAPyjD,EAAO,EAAAzjD,UAAArV,OAAAqV,UAAA,QAAA9T,EACtC,OAAOi/H,EAAiBsrB,OAAOzzF,EAAMwzF,EAAU/yF,EAAO0nE,EAAiB0rB,6CAG7D7zF,EAAMwzF,EAAU/yF,EAAOjB,GAIjC,GAHAwkE,EAAAr7H,IAAIw/D,MAAM,SAAWnI,GAErBA,GADAA,GAAQ,IACIzL,OACRi/F,EACA,IACI,OAAOrrB,EAAiBlvH,SAAS+mD,GACnC,MAAOn5D,IAKb,IAAIitJ,EAAYt0F,EAAOiB,MAEvBjB,EAAOiB,MAAQA,GAAS,GAExB,IAAIszF,EAAKv0F,EAAOS,KAAKD,EAAO,IAE5B,OADAR,EAAOiB,MAAQqzF,EACVN,EAGErrB,EAAiBlvH,SAAS86I,GAFtBA,iCAKD/zF,GACV,OAAOA,GAAQgkE,EAAAS,MAAMh9E,SAASuY,IAAyB,MAAhBA,EAAKzL,uDAGjByL,GAC3B,OAAOgkE,EAAAS,MAAMh9E,SAASuY,KAAgC,IAAvBA,EAAKruD,QAAQ,iCAGrCtK,EAAGkB,GACV,OAAOyxD,EAAKhwD,IAAIm+H,EAAiBlvH,SAAS5R,GAAI8gI,EAAiBlvH,SAAS1Q,qCAG5DlB,EAAGkB,GACf,OAAOyxD,EAAKhgD,SAASmuH,EAAiBlvH,SAAS5R,GAAI8gI,EAAiBlvH,SAAS1Q,mCAGnElB,EAAGkB,GACb,OAAOyxD,EAAKrmD,OAAOw0H,EAAiBlvH,SAAS5R,GAAI8gI,EAAiBlvH,SAAS1Q,qCAG/DlB,EAAGkB,GACf,OAAOyxD,EAAKhP,SAASm9E,EAAiBlvH,SAAS5R,GAAI8gI,EAAiBlvH,SAAS1Q,kCAGpElB,EAAG4F,GACZ,OAAOk7H,EAAiBlvH,SAAS5R,GAAG8F,MAAMF,oCAG9B5F,GACZ,IAAI2sJ,EAASpqJ,WAAWvC,GACxB,OAAG2sJ,IAAWtoJ,EAAAA,GAAYsoJ,KAAYtoJ,EAAAA,EAC3BsoJ,EAGJh6F,EAAKkH,SAAS75D,iCAIrB,OAAO2yD,EAAKlpD,IAALyQ,MAAAy4C,EAAYh9C,yCAInB,OAAOg9C,EAAKnpD,IAAL0Q,MAAAy4C,EAAYh9C,yCAInB,OAAOg9C,EAAKkQ,IAAL3oD,MAAAy4C,EAAYh9C,0CAInB,OAAOg9C,EAAKlI,KAALvwC,MAAAy4C,EAAah9C,4CAIpB,OAAOg9C,EAAKmQ,OAAL5oD,MAAAy4C,EAAeh9C,yCAItB,OAAOg9C,EAAKsQ,IAAL/oD,MAAAy4C,EAAYh9C,2CAIR3V,EAAGkB,GAGd,OAFAlB,EAAI8gI,EAAiBlvH,SAAS5R,MAC9BkB,EAAI4/H,EAAiBlvH,SAAS1Q,IAenB,EAbJlB,IAAMqE,EAAAA,GACG,EAETrE,GAAKqE,EAAAA,EACG,EAERnD,IAAMmD,EAAAA,EACE,EAERnD,GAAKmD,EAAAA,GACI,EAMTsuD,EAAKngD,QAAQxS,EAAGkB,oCAWXy3D,EAAMS,GAA0B,IAAnBizF,IAAmB,EAAA12I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAC5C,GAAIgjD,MAAAA,EACA,OAAO,EAGX,IAEIA,GADAA,GAAQ,IACIzL,OACZ,IAAIptD,EAAI6yD,EAAK2G,QAAQX,GAErB,GAAI0zF,EACA,OAAO,EAGX,IAAI7sJ,EAAIM,EAAE84D,KAAKQ,GACf,OAAOujE,EAAAS,MAAMl6D,UAAU1jE,GACzB,MAAOA,GACL,OAAO,8CAIW6V,GACtB,OAAOA,KAAOA,EAAE0jD,uCAyBL70B,GACX,OAAOyuB,EAAKzuB,OAAOA,kCAGT5mB,GACV,OAAOq1C,EAAKkG,OAAOv7C,mCA5LhBkvI,aAAe75F,EAAKwF,SAFlB2oE,EAiMF8rB,eAAiBb,EAASc,SAASxgJ,4JCjN9C,IAAAygJ,EAAAxtJ,EAAA,uBAAAoH,OAAAiT,KAAAmzI,GAAAhzI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAyvI,EAAAh1I,wECAA,IAII66C,EAJOrzD,EAAQ,eAIHi+B,SAChBo1B,EAAKx9C,OAAO,CACR+uB,OAAQ,WAKRyuB,EAAKu5F,OAAO5sJ,EAAQ,oBAexBqzD,EAAKu5F,OAAO5sJ,EAAQ,wBASpBqzD,EAAKu5F,OAAO5sJ,EAAQ,0BACpBqzD,EAAKu5F,OAAO5sJ,EAAQ,oBAGpBkB,EAAOJ,QAAUuyD,8NCvCjB,IAAAgqE,EAAAr9H,EAAA,YACAslI,2SAAAkP,CAAAx0I,EAAA,aACAytJ,EAAAztJ,EAAA,shBAKag/H,aAiCT,SAAAA,EAAYp8F,gGAAM86F,CAAAx6H,KAAA87H,GAAA97H,KA/BlBooE,MAAQ,GA+BUpoE,KA9BlBuhI,MAAQ,GA8BUvhI,KA5BlBwqJ,MAAQ,GA4BUxqJ,KA3BlB4mI,YAAc,GA2BI5mI,KA1BlBw/H,wBAA0B,EA0BRx/H,KAzBlB+gI,iBAAmB,EAyBD/gI,KAxBlBghI,iBAAmBn/H,EAAAA,EAwBD7B,KArBlByjI,gBAAkB,GAqBAzjI,KApBlBtC,KAAO,GAoBWsC,KAnBlBwjI,WAAa,KAmBKxjI,KAlBlBujI,YAAa,EAkBKvjI,KAjBlByqJ,SAAS,EAiBSzqJ,KAflBy/H,kBAAoB,GAeFz/H,KAZlB0qJ,aAAe,EAYG1qJ,KAXlB2qJ,UAAY,GAWM3qJ,KAVlB4qJ,UAAY,GAUM5qJ,KATlB6qJ,6BAA+B,KASb7qJ,KARlB8qJ,kBAAoB,KAQF9qJ,KAPlB+qJ,oBAAsB,KAOJ/qJ,KALlBgrJ,kBAAoB,KAKFhrJ,KAJlBirJ,oBAAsB,KAIJjrJ,KAFlB4mJ,mBAAoB,EAGblnH,GACC1/B,KAAK4wD,KAAKlxB,oGAIwE,IAA1EwrH,EAA0E,EAAA/3I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAApDg4I,EAAoD,EAAAh4I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAA9Bi4I,EAA8B,EAAAj4I,UAAArV,OAAAqV,UAAA,QAAA9T,EAApBgsJ,IAAoB,EAAAl4I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACtF,OAAO,SAAU1M,EAAGoM,GAEhB,KAAKw4I,GAAiBlxB,EAAAS,MAAMnxE,WAAWhjD,EAAG,MAAc,cAALA,GAG/CykJ,GAAuB,YAALzkJ,GAGlB0kJ,GAAuB,YAAL1kJ,GAItB,OAAI2kJ,EACOA,EAAS3kJ,EAAGoM,GAGhBA,iDAKX7S,KAAKooE,MAAM9wD,QAAQ,SAAAqqD,UACRA,EAAKomC,eAEhB/nG,KAAKuhI,MAAMjqH,QAAQ,SAAAosH,UACRA,EAAK37B,mDAKgF,IAA1F72C,IAA0F,EAAA/9C,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAA1E+3I,EAA0E,EAAA/3I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAApDg4I,EAAoD,EAAAh4I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAA9Bi4I,EAA8B,EAAAj4I,UAAArV,OAAAqV,UAAA,QAAA9T,EAApBgsJ,IAAoB,EAAAl4I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAChGnT,KAAKsrJ,sBACL,IAAI5rH,EAAQ,CACRhiC,KAAMsC,KAAKtC,KACX+lI,gBAAiBzjI,KAAKyjI,gBACtB8nB,MAAOvrJ,KAAK6/H,WACZ2qB,MAAOxqJ,KAAKwqJ,MACZ5jB,YAAa5mI,KAAK4mI,YAAY/8H,QAC9B21H,wBAAyBx/H,KAAKw/H,wBAC9BuB,iBAAkB/gI,KAAK+gI,iBACvBC,iBAAkBhhI,KAAKghI,kBAG3B,OAAI9vE,EAIGipE,EAAAS,MAAM1pE,UAAUxxB,EAAM1/B,KAAKkgJ,gBAAgBgL,EAAgBC,EAAgBC,EAAUC,GAAgB,IAHjG3rH,+BAQVA,GAAM,IAAAosC,EAAA9rE,KAEH4mJ,EAAoB5mJ,KAAK4mJ,kBAC7B5mJ,KAAK4mJ,mBAAoB,EAEzB5mJ,KAAKm/B,QAGLO,EAAK6rH,MAAMj0I,QAAQ,SAAAk0I,GACJ1/E,EAAK2/E,mBAAmBD,KAGnC9rH,EAAK8qH,OACL9qH,EAAK8qH,MAAMlzI,QAAQ,SAAAo0I,GACf,IAAIv9F,EAAW,IAAIi0E,EAAO6kB,MAAMyE,EAASv9F,SAAShwD,EAAGutJ,EAASv9F,SAASjtD,GACnEm4G,EAAO,IAAI+oB,EAAOupB,KAAKx9F,EAAUu9F,EAAStnJ,OAC9C0nE,EAAK0+E,MAAMp9I,KAAKisG,KAIxBr5G,KAAKsjI,uBACLtjI,KAAKtC,KAAOgiC,EAAKhiC,MAAQ,GAErBgiC,EAAK+jG,iBACLtJ,EAAAS,MAAMh1E,OAAO5lD,KAAKyjI,gBAAiB/jG,EAAK+jG,sBAGnBpkI,IAArBqgC,EAAKknG,aAAkD,OAArBlnG,EAAKknG,cACvC5mI,KAAK4mI,YAAclnG,EAAKknG,kBAGSvnI,IAAjCqgC,EAAK8/F,yBAA0E,OAAjC9/F,EAAK8/F,0BACnDx/H,KAAKw/H,wBAA0B9/F,EAAK8/F,8BAGVngI,IAA1BqgC,EAAKqhG,kBAA4D,OAA1BrhG,EAAKqhG,mBAC5C/gI,KAAK+gI,iBAAmBrhG,EAAKqhG,uBAGH1hI,IAA1BqgC,EAAKshG,kBAA4D,OAA1BthG,EAAKshG,mBAC5ChhI,KAAKghI,iBAAmBthG,EAAKshG,kBAIjChhI,KAAK4mJ,kBAAoBA,mCAG2C,IAAjEsE,EAAiE,EAAA/3I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAA3Cg4I,EAA2C,EAAAh4I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAArBk4I,EAAqB,EAAAl4I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAQpE,MAPU,CACNy4I,eAAgB5rJ,KAAKkhI,WAAU,EAAMgqB,EAAgBC,EAAgB,KAAME,GAC3E7nB,WAAYxjI,KAAKwjI,WACjBD,WAAYvjI,KAAKujI,WACjB9D,kBAAmBz/H,KAAKy/H,kBAAkB51H,6CAMtCunI,EAAKya,GAAY,IAAA9/E,EAAA/rE,KACzBA,KAAK4wD,KAAKK,KAAKhyD,MAAMmyI,EAAIwa,eAAgBC,IACzC7rJ,KAAKwjI,WAAa4N,EAAI5N,WACtBxjI,KAAKujI,WAAa6N,EAAI7N,WACtBvjI,KAAKy/H,kBAAkB3hI,OAAO,EAC9BszI,EAAI3R,kBAAkBnoH,QAAQ,SAAAzE,GAC1Bk5D,EAAK0zD,kBAAkBryH,KAAKm9I,EAAApB,iBAAiB2C,cAAcj5I,yCAKxDklI,GACP,GAAG/3I,KAAKyqJ,SAAS1S,EAAU0S,SACvBtwB,EAAAr7H,IAAIkyD,KAAK,0EADb,CAIA,IAAI+6F,EAAO,GACXhU,EAAU3vE,MAAM9wD,QAAQ,SAAAra,GACpB8uJ,EAAK9uJ,EAAEkrJ,KAAOlrJ,IAElB+C,KAAKooE,MAAM9wD,QAAQ,SAACra,EAAEG,GACf2uJ,EAAK9uJ,EAAEkrJ,MACNlrJ,EAAE+uJ,mBAAmBD,EAAK9uJ,EAAEkrJ,KAAK1jH,YAGzCszG,EAAUxW,MAAMjqH,QAAQ,SAAAta,GACpB+uJ,EAAK/uJ,EAAEmrJ,KAAOnrJ,IAElBgD,KAAKuhI,MAAMjqH,QAAQ,SAACta,EAAEI,GACf2uJ,EAAK/uJ,EAAEmrJ,MACNnrJ,EAAEgvJ,mBAAmBD,EAAK/uJ,EAAEmrJ,KAAK1jH,YAGzCzkC,KAAKyjI,gBAAkBsU,EAAUtU,gBACjCzjI,KAAKwjI,WAAauU,EAAUvU,WAC5BxjI,KAAKujI,WAAawU,EAAUxU,WAC5BvjI,KAAKy/H,kBAAqBsY,EAAUtY,oEAGK,IAAtBwsB,IAAsB,EAAA94I,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACrC7Q,EAAM,GAOV,OANA63H,EAAAS,MAAMh0E,OAAO5mD,KAAKyjI,gBAAiB,SAACr/H,EAAOkR,GACpC22I,GAAkB9xB,EAAAS,MAAMv0F,WAAWjiC,IAGtC9B,EAAI8K,KAAKkI,KAENhT,6CAIQo9B,EAAMoI,GAAQ,IACzB65B,EAAMxT,EADmBsyE,EAAAzgI,KAIzBmuD,EADDzuB,EAAKyuB,SACO,IAAIi0E,EAAO6kB,MAAMvnH,EAAKyuB,SAAShwD,EAAGuhC,EAAKyuB,SAASjtD,GAEhD,IAAIkhI,EAAO6kB,MAAM,EAAE,GAG9B7kB,EAAOC,aAAa6pB,OAASxsH,EAAK2X,KAClCsqB,EAAO,IAAIygE,EAAOC,aAAal0E,EAAUzuB,EAAKysH,WACvC/pB,EAAOQ,WAAWspB,OAASxsH,EAAK2X,KACvCsqB,EAAO,IAAIygE,EAAOQ,WAAWz0E,EAAUzuB,EAAKysH,WACrC/pB,EAAOS,aAAaqpB,OAASxsH,EAAK2X,OACzCsqB,EAAO,IAAIygE,EAAOS,aAAa10E,EAAUzuB,EAAKysH,YAE/CzsH,EAAKyoH,MACJxmF,EAAKwmF,IAAMzoH,EAAKyoH,KAEjBzoH,EAAK0sH,eACJzqF,EAAKyqF,aAAe1sH,EAAK0sH,cAE7BzqF,EAAKp7D,KAAOm5B,EAAKn5B,KAEdm5B,EAAKhiC,OACJikE,EAAKjkE,KAAOgiC,EAAKhiC,MAEjBgiC,EAAK+jG,kBACL9hE,EAAK8hE,gBAAkB/jG,EAAK+jG,iBAE7B/jG,EAAK+E,UACJk9B,EAAKqqF,mBAAmBtsH,EAAK+E,UAGjCk9B,EAAK0qF,SAAW3sH,EAAK2sH,OAErB,IAAIC,EAAatsJ,KAAKknJ,QAAQvlF,EAAM75B,GAsBpC,OArBApI,EAAKgjG,WAAWprH,QAAQ,SAAAi1I,GACpB,IAAI7oB,EAAOjD,EAAKgrB,mBAAmBc,EAAG9pF,UAAWd,GAC9Cw4D,EAAAS,MAAM98F,QAAQyuH,EAAG3oB,QAChBF,EAAKE,OAAS2oB,EAAG3oB,OAEjBF,EAAKE,OAAS,CAAC2oB,EAAG3oB,OAAQ,GAG9BF,EAAKe,YAAc8nB,EAAG9nB,YACtBf,EAAKn9H,KAAOgmJ,EAAGhmJ,KACZgmJ,EAAG9nH,UACFi/F,EAAKsoB,mBAAmBO,EAAG9nH,UAE5B8nH,EAAGpE,MACFzkB,EAAKykB,IAAMoE,EAAGpE,KAEfoE,EAAGH,eACF1oB,EAAK0oB,aAAeG,EAAGH,gBAIxBE,kCAIH3qF,EAAM75B,GAGV,GAFW9nC,KACNooE,MAAMh7D,KAAKu0D,GACZ75B,EAAQ,CACR,IAAI47F,EAHG1jI,KAGSwsJ,UAAU1kH,EAAQ65B,GAElC,OADA3hE,KAAKwnJ,uBAAuB7lF,GACrB+hE,EAIX,OADA1jI,KAAKwnJ,uBAAuB7lF,GACrBA,qCAIAA,EAAM+hE,GACb,IAAI57F,EAAS47F,EAAKG,WACd37D,EAAQw7D,EAAKjhE,UACjBziE,KAAKooE,MAAMh7D,KAAKu0D,GAChBA,EAAK+iE,QAAU58F,EACf47F,EAAKjhE,UAAYd,EACjB3hE,KAAKwsJ,UAAU7qF,EAAMuG,GACrBloE,KAAKwnJ,uBAAuB7lF,qCAGtB75B,EAAQogC,GACd,IACIw7D,EAAO,IAAItB,EAAOqqB,KAAK3kH,EAAQogC,GAMnC,OAPWloE,KAEN0sJ,2BAA2BhpB,GAFrB1jI,KAGNuhI,MAAMn0H,KAAKs2H,GAEhB57F,EAAO46F,WAAWt1H,KAAKs2H,GACvBx7D,EAAMw8D,QAAU58F,EACT47F,qDAGgBA,GACnBA,EAAKG,sBAAsBzB,EAAOQ,WAClCc,EAAKe,YAAc,IAEnBf,EAAKe,iBAAcplI,qCAMhBsiE,GAAc,IAARgrF,EAAQ,EAAAx5I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAEd6B,EAAOhV,KACX2hE,EAAK+gE,WAAWprH,QAAQ,SAAAta,GAAC,OAAEgY,EAAKgyI,WAAWhqJ,EAAEylE,UAAWkqF,EAAK,KAE7D33I,EAAK43I,YAAYjrF,GACjB,IAAI75B,EAAS65B,EAAK+iE,QAClB,GAAI58F,EAAQ,CACR,IAAI+kH,EAAa1yB,EAAAS,MAAMjgF,KAAK7S,EAAO46F,WAAY,SAAC1lI,EAAGI,GAAJ,OAASJ,EAAEylE,YAAcd,IAC9D,GAANgrF,EACA33I,EAAK83I,WAAWD,GAEhB73I,EAAK+3I,YAAYF,GAGzB7sJ,KAAKgtJ,yBAAyBrrF,uCAItByG,GAAO,IAAA+4D,EAAAnhI,KAEHA,KAAKitJ,iBAAiB7kF,GAC5B9wD,QAAQ,SAAAra,GAAC,OAAEkkI,EAAK6lB,WAAW/pJ,EAAG,IAAI+C,0CAGhC2hE,EAAMurF,GAAgB,IAC1BC,EAD0B1rB,EAAAzhI,MAE1B2hE,EAAK+gE,WAAW5kI,QAAU6jE,EAAK+iE,QAC/ByoB,EAAUntJ,KAAKotJ,iBAAiBF,EAAiBvrF,EAAKxT,UAEnDwT,aAAgBygE,EAAOC,cAAgB6qB,GAAiB9qB,EAAOQ,WAAWspB,MACzEiB,EAAUntJ,KAAKotJ,iBAAiBF,EAAiBvrF,EAAKxT,UACjD++F,GAAiB9qB,EAAOC,aAAa6pB,QAC1CiB,EAAUntJ,KAAKotJ,iBAAiBF,EAAiBvrF,EAAKxT,WAI3Dg/F,IACCA,EAAQ5mJ,KAAKo7D,EAAKp7D,KAClBvG,KAAKqtJ,YAAYF,EAASxrF,GAC1BwrF,EAAQzqB,WAAWprH,QAAQ,SAAAta,GAAC,OAAEykI,EAAKirB,2BAA2B1vJ,KAC9DgD,KAAKwnJ,uBAAuB2F,6CAKnB91G,EAAM8W,GACnB,OAAG9W,GAAM+qF,EAAOC,aAAa6pB,MAClB,IAAI9pB,EAAOC,aAAal0E,GAC1B9W,GAAM+qF,EAAOQ,WAAWspB,MACtB,IAAI9pB,EAAOQ,WAAWz0E,GACxB9W,GAAM+qF,EAAOS,aAAaqpB,MACxB,IAAI9pB,EAAOS,aAAa10E,QAD7B,sCAKEg/F,EAASG,GACjB,IAAIxlH,EAASwlH,EAAQ5oB,SACrByoB,EAAQzoB,QAAU58F,KAGGqyF,EAAAS,MAAMjgF,KAAKwyG,EAAQzoB,QAAQhC,WAAY,SAAA1lI,GAAC,OAAEA,EAAEylE,YAAY6qF,IAC9D7qF,UAAY0qF,GAE3BA,EAAQhB,UAAYmB,EAAQnB,UAC5BgB,EAAQzqB,WAAa4qB,EAAQ5qB,WAC7ByqB,EAAQzqB,WAAWprH,QAAQ,SAAAta,GACvBA,EAAE6mI,WAAWspB,EACbnwJ,EAAEylE,UAAUiiE,QAAQyoB,IAGxB,IAAI51I,EAAQvX,KAAKooE,MAAMtgE,QAAQwlJ,IAC3B/1I,IACAvX,KAAKooE,MAAM7wD,GAAO41I,sCAKtB,OAAOntJ,KAAKooE,MAAM5lB,OAAO,SAAAvlD,GAAC,OAAGA,EAAEynI,mDAGlBt8D,GACb,OAAOA,EAAM5lB,OAAO,SAAAvlD,GAAC,OAAGA,EAAEynI,UAAyC,IAA9Bt8D,EAAMtgE,QAAQ7K,EAAEynI,gDAI5C6oB,EAAYC,GACrB,IAAIx4I,EAAOhV,KACPwD,EAAQxD,KAAKytJ,UAAUF,GAsB3B,cArBO/pJ,EAAMkqJ,OAGbH,EAAW7qB,WAAWprH,QAAQ,SAAAta,GAC1B,IAAI2wJ,EAAa34I,EAAKuxI,aAAavpJ,EAAEylE,UAAW+qF,GAChDG,EAAWjpB,QAAUlhI,EACrB,IAAIkgI,EAAOvJ,EAAAS,MAAMp3H,MAAMxG,GACvB0mI,EAAKykB,IAAMhuB,EAAAS,MAAM6K,OACjB/B,EAAKG,WAAargI,EAClBkgI,EAAKjhE,UAAYkrF,EACjBjqB,EAAKE,OAASzJ,EAAAS,MAAM70E,UAAU/oD,EAAE4mI,QAChCF,EAAKj/F,SAAW,GACZ+oH,IACA9pB,EAAKj/F,SAAW01F,EAAAS,MAAM70E,UAAU/oD,EAAEynC,UAClCkpH,EAAWlpH,SAAW01F,EAAAS,MAAM70E,UAAU/oD,EAAEylE,UAAUh+B,WAEtDjhC,EAAMk/H,WAAWt1H,KAAKs2H,KAEtB8pB,IACAhqJ,EAAMihC,SAAW01F,EAAAS,MAAM70E,UAAUwnG,EAAW9oH,WAEzCjhC,wCAIGoqJ,EAAc9lH,GACxB,IAAI9yB,EAAOhV,KACP6tJ,EAAa74I,EAAKkyI,QAAQ0G,EAAc9lH,GAW5C,OATA8lH,EAAanqB,gBAAkB,KAEdzuH,EAAK84I,sBAAsBF,GACjCt2I,QAAQ,SAAAta,GACfgY,EAAKusH,MAAMn0H,KAAKpQ,GAChBgY,EAAKozD,MAAMh7D,KAAKpQ,EAAEylE,WAClBzlE,EAAEylE,UAAUghE,gBAAkB,OAG3BoqB,qCAGAzlF,sCAMDzG,GACN,IAAIn+D,EAAQ22H,EAAAS,MAAMp3H,MAAMm+D,GAMxB,OALAn+D,EAAM2kJ,IAAMhuB,EAAAS,MAAM6K,OAClBjiI,EAAM2qD,SAAWgsE,EAAAS,MAAMp3H,MAAMm+D,EAAKxT,UAClC3qD,EAAMihC,SAAW01F,EAAAS,MAAMp3H,MAAMm+D,EAAKl9B,UAClCjhC,EAAMkhI,QAAU,KAChBlhI,EAAMk/H,WAAa,GACZl/H,uCAGEitC,GACT,OAAO0pF,EAAAS,MAAMjgF,KAAK36C,KAAKooE,MAAO,SAAAnrE,GAAC,OAAEA,EAAEkrJ,KAAO13G,yCAGjCA,GACT,OAAO0pF,EAAAS,MAAMjgF,KAAK36C,KAAKuhI,MAAO,SAAAvkI,GAAC,OAAEA,EAAEmrJ,KAAO13G,qCAGrCA,GACL,IAAIkxB,EAAO3hE,KAAK+tJ,aAAat9G,GAC7B,OAAIkxB,GAGG3hE,KAAKguJ,aAAav9G,uCAGjBkxB,GACR,IAAIpqD,EAAQvX,KAAKooE,MAAMtgE,QAAQ65D,IAClB,EAATpqD,GACAvX,KAAKooE,MAAMntC,OAAO1jB,EAAO,sCAItBmsH,GACP,IAAInsH,EAAQmsH,EAAKG,WAAWnB,WAAW56H,QAAQ47H,IAClC,EAATnsH,GACAmsH,EAAKG,WAAWnB,WAAWznG,OAAO1jB,EAAO,GAE7CvX,KAAK+sJ,YAAYrpB,uCAGTA,GACR,IAAInsH,EAAQvX,KAAKuhI,MAAMz5H,QAAQ47H,IAClB,EAATnsH,GACAvX,KAAKuhI,MAAMtmG,OAAO1jB,EAAO,wCAIpB02I,GACTjuJ,KAAKooE,MAAQpoE,KAAKooE,MAAM5lB,OAAO,SAAAvlD,GAAC,OAAgC,IAA9BgxJ,EAAcnmJ,QAAQ7K,0CAG/CixJ,GACTluJ,KAAKuhI,MAAQvhI,KAAKuhI,MAAM/+E,OAAO,SAAAxlD,GAAC,OAAgC,IAA9BkxJ,EAAcpmJ,QAAQ9K,mDAGtC2kE,GAClB,IAAI3sD,EAAOhV,KACPgX,EAAS,GASb,OAPA2qD,EAAK+gE,WAAWprH,QAAQ,SAAAta,GACpBga,EAAO5J,KAAKpQ,GACRA,EAAEylE,WACFzrD,EAAO5J,KAAPsK,MAAAV,EAAMkxH,EAASlzH,EAAK84I,sBAAsB9wJ,EAAEylE,eAI7CzrD,gDAGW2qD,GAClB,IAAI3sD,EAAOhV,KACPgX,EAAS,GASb,OAPA2qD,EAAK+gE,WAAWprH,QAAQ,SAAAta,GAChBA,EAAEylE,YACFzrD,EAAO5J,KAAKpQ,EAAEylE,WACdzrD,EAAO5J,KAAPsK,MAAAV,EAAMkxH,EAASlzH,EAAKm5I,sBAAsBnxJ,EAAEylE,gBAI7CzrD,+CAGU2qD,GACjB,IAAIysF,EAAcpuJ,KAAKmuJ,sBAAsBxsF,GAE7C,OADAysF,EAAYvgJ,QAAQ8zD,GACbysF,4CAIP,QAASpuJ,KAAK2qJ,UAAU7sJ,iDAIxB,QAASkC,KAAK4qJ,UAAU9sJ,mDAGRuwJ,GAChB,MAAO,CACHA,WAAYA,EACZjmF,MAAO+xD,EAAAS,MAAM70E,UAAU/lD,KAAKooE,OAC5Bm5D,MAAOpH,EAAAS,MAAM70E,UAAU/lD,KAAKuhI,OAC5BipB,MAAOrwB,EAAAS,MAAM70E,UAAU/lD,KAAKwqJ,OAC5B5jB,YAAazM,EAAAS,MAAM70E,UAAU/lD,KAAK4mI,aAClCpH,wBAAyBrF,EAAAS,MAAM70E,UAAU/lD,KAAKw/H,yBAC9CuB,iBAAkB5G,EAAAS,MAAM70E,UAAU/lD,KAAK+gI,kBACvCC,iBAAkB7G,EAAAS,MAAM70E,UAAU/lD,KAAKghI,kBACvCyC,gBAAiBtJ,EAAAS,MAAM70E,UAAU/lD,KAAKyjI,iBACtC/lI,KAAMsC,KAAKtC,KACX8lI,WAAYxjI,KAAKwjI,0DAKH1xD,GAOlB,OANA9xE,KAAK4qJ,UAAU9sJ,OAAS,EAExBkC,KAAKsuJ,aAAatuJ,KAAK2qJ,UAAW74E,GAElC9xE,KAAKuuJ,wBAEEvuJ,uCAGDquJ,GAEN,OADAruJ,KAAKwuJ,sBAAsBxuJ,KAAKu5I,oBAAoB8U,IAC7CruJ,oCAIP,IAAIgV,EAAOhV,KACPyuJ,EAAWzuJ,KAAK2qJ,UAAUt9I,MAC9B,GAAKohJ,EAuBL,OAnBAzuJ,KAAKsuJ,aAAatuJ,KAAK4qJ,UAAW,CAC9ByD,WAAYI,EAASJ,WACrBjmF,MAAOpzD,EAAKozD,MACZm5D,MAAOvsH,EAAKusH,MACZipB,MAAOx1I,EAAKw1I,MACZ5jB,YAAa5xH,EAAK4xH,YAClBpH,wBAAyBxqH,EAAKwqH,wBAC9BuB,iBAAkB/rH,EAAK+rH,iBACvBC,iBAAkBhsH,EAAKgsH,iBACvByC,gBAAiBzuH,EAAKyuH,gBACtB/lI,KAAMsX,EAAKtX,KACX8lI,WAAYxuH,EAAKwuH,aAIrBxjI,KAAKs5I,aAAamV,GAElBzuJ,KAAKuuJ,wBAEEvuJ,oCAIP,IAAIgV,EAAOhV,KACPyuJ,EAAWzuJ,KAAK4qJ,UAAUv9I,MAC9B,GAAKohJ,EAsBL,OAlBAzuJ,KAAKsuJ,aAAatuJ,KAAK2qJ,UAAW,CAC9B0D,WAAYI,EAASJ,WACrBjmF,MAAOpzD,EAAKozD,MACZm5D,MAAOvsH,EAAKusH,MACZipB,MAAOx1I,EAAKw1I,MACZ5jB,YAAa5xH,EAAK4xH,YAClBpH,wBAAyBxqH,EAAKwqH,wBAC9BuB,iBAAkB/rH,EAAK+rH,iBACvBC,iBAAkBhsH,EAAKgsH,iBACvByC,gBAAiBzuH,EAAKyuH,gBACtB/lI,KAAMsX,EAAKtX,KACX8lI,WAAYxuH,EAAKwuH,aAGrBxjI,KAAKs5I,aAAamV,GAAU,GAE5BzuJ,KAAKuuJ,wBAEEvuJ,qCAIPA,KAAKooE,MAAMtqE,OAAS,EACpBkC,KAAKuhI,MAAMzjI,OAAS,EACpBkC,KAAK2qJ,UAAU7sJ,OAAS,EACxBkC,KAAK4qJ,UAAU9sJ,OAAS,EACxBkC,KAAKwqJ,MAAM1sJ,OAAS,EACpBkC,KAAKsjI,uBACLtjI,KAAKtC,KAAO,GACZsC,KAAKwjI,WAAa,KAClBxjI,KAAKujI,YAAa,EAElBvjI,KAAK4mI,YAAc,GACnB5mI,KAAKw/H,wBAA0B,EAC/Bx/H,KAAK+gI,iBAAmB,EACxB/gI,KAAKghI,iBAAmBn/H,EAAAA,gDAIxB7B,KAAKooE,MAAM9wD,QAAQ,SAAAra,GAAC,OAAEA,EAAEgmI,wBACxBjjI,KAAKuhI,MAAMjqH,QAAQ,SAAAta,GAAC,OAAEA,EAAEimI,wDAGpB5pB,GACJr5G,KAAKwqJ,MAAMp9I,KAAKisG,GAEhBr5G,KAAK0uJ,uBAAuBr1C,uCAGpBmxC,GAAO,IAAA3oB,EAAA7hI,KACfwqJ,EAAMlzI,QAAQ,SAAApa,GAAC,OAAE2kI,EAAK8sB,WAAWzxJ,wCAG1Bm8G,GACP,IAAI9hG,EAAQvX,KAAKwqJ,MAAM1iJ,QAAQuxG,IAClB,EAAT9hG,IACAvX,KAAKwqJ,MAAMvvH,OAAO1jB,EAAO,GACzBvX,KAAK4uJ,yBAAyBv1C,mDAIf,IAAA0oB,EAAA/hI,KACnBm6H,EAAAS,MAAMh0E,OAAO5mD,KAAKyjI,gBAAiB,SAACr/H,EAAOkR,UAChCysH,EAAK0B,gBAAgBnuH,8CAKhCtV,KAAK4mI,YAAY5+H,UACjBhI,KAAKuhI,MAAMjqH,QAAQ,SAAAta,GAAC,OAAEA,EAAE4mI,OAAO57H,iDAGtBymJ,EAAUI,GACnB,IAAIC,EAAW30B,EAAAS,MAAMm0B,iBAAiBN,EAASrmF,OAC3C4mF,EAAW70B,EAAAS,MAAMm0B,iBAAiBN,EAASltB,OAC/CvhI,KAAKooE,MAAQqmF,EAASrmF,MACtBpoE,KAAKuhI,MAAQktB,EAASltB,MACtBvhI,KAAKwqJ,MAAQiE,EAASjE,MACtBxqJ,KAAK4mI,YAAc6nB,EAAS7nB,YAC5B5mI,KAAKw/H,wBAA0BivB,EAASjvB,wBACxCx/H,KAAK+gI,iBAAmB0tB,EAAS1tB,iBACjC/gI,KAAKghI,iBAAmBytB,EAASztB,iBACjChhI,KAAKyjI,gBAAkBgrB,EAAShrB,gBAChCzjI,KAAKtC,KAAO+wJ,EAAS/wJ,KACrBsC,KAAKwjI,WAAcirB,EAASjrB,WAE5BxjI,KAAKooE,MAAM9wD,QAAQ,SAAAra,GACf,IAAK,IAAIG,EAAI,EAAGA,EAAIH,EAAEylI,WAAW5kI,OAAQV,IAAK,CAC1C,IAAIsmI,EAAOsrB,EAAS/xJ,EAAEylI,WAAWtlI,GAAG+qJ,MACpClrJ,EAAEylI,WAAWtlI,GAAKsmI,GACbG,WAAa5mI,EAClBymI,EAAKjhE,UAAYqsF,EAASprB,EAAKjhE,UAAU0lF,QAK7CsG,EAASJ,cACJQ,GAAQJ,EAASJ,WAAWY,QAC7BR,EAASJ,WAAWY,OAAOR,EAASJ,WAAW3uH,MAE/CmvH,GAAQJ,EAASJ,WAAWa,QAC5BT,EAASJ,WAAWa,OAAOT,EAASJ,WAAW3uH,OAKvD1/B,KAAKquJ,WAAaI,EAASJ,gDAIlBrsH,EAAOpvB,GACZovB,EAAMlkC,QAAUkC,KAAK0qJ,cACrB1oH,EAAM10B,QAEV00B,EAAM50B,KAAKwF,oDAIN5S,KAAK4mJ,mBAAqB5mJ,KAAK6qJ,8BAChC7qJ,KAAK6qJ,8EAIUlpF,IACd3hE,KAAK4mJ,mBAAqB5mJ,KAAK8qJ,mBAChC9qJ,KAAK8qJ,kBAAkBnpF,oDAINA,IAChB3hE,KAAK4mJ,mBAAqB5mJ,KAAK+qJ,qBAChC/qJ,KAAK+qJ,oBAAoBppF,kDAIV03C,IACdr5G,KAAK4mJ,mBAAqB5mJ,KAAKgrJ,mBAChChrJ,KAAKgrJ,kBAAkB3xC,oDAINA,IAChBr5G,KAAK4mJ,mBAAqB5mJ,KAAKirJ,qBAChCjrJ,KAAKirJ,oBAAoB5xC,8LCxvBrC,IAAA81C,EAAAryJ,EAAA,40BAEa2vJ,cAUT,SAAAA,EAAY5oB,EAAYphE,EAAWl8D,EAAMq9H,EAAQa,GAAc,IAAA34D,EAAA,mGAAA0uD,CAAAx6H,KAAAysJ,IAC3D3gF,EAAA2uD,EAAAz6H,KAAA06H,EAAA+xB,GAAA5uJ,KAAAmC,QAPJuG,KAAO,GAMwDulE,EAL/D24D,iBAAcplI,EAKiDysE,EAJ/D83D,OAAS,CAAC,EAAG,GAIkD93D,EAF/D41D,qBAAuB,CAAC,cAAe,SAAU,WAI7C51D,EAAK+3D,WAAaA,EAClB/3D,EAAKrJ,UAAYA,OAEJpjE,IAATkH,IACAulE,EAAKvlE,KAAOA,QAEIlH,IAAhBolI,IACA34D,EAAK24D,YAAcA,QAERplI,IAAXukI,IACA93D,EAAK83D,OAASA,GAZyC93D,8OAVzCqjF,EAAAC,0GA2Bd7oJ,GAEJ,OADAvG,KAAKuG,KAAOA,EACLvG,4CAGIykI,GAEX,OADAzkI,KAAKykI,YAAcA,EACZzkI,uCAGD4jI,GAAmB,IAAXrsH,EAAW,EAAApE,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAEtB,OADAnT,KAAK4jI,OAAOrsH,GAASqsH,EACd5jI,qDAGa8a,GACpB,OAAO9a,KAAKskI,cAAc,KAAM,cAAexpH,8CAGhCA,GAAgB,IAAXvD,EAAW,EAAApE,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EAC5B,OAAOnT,KAAKskI,cAAc,KAAM,UAAY/sH,EAAQ,IAAKuD,8CAG1CA,GACf,OAAO9a,KAAK2hI,aAAa,cAAe7mH,yCAG9BA,GAAgB,IAAXvD,EAAW,EAAApE,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,EACvB,OAAOnT,KAAK2hI,aAAa,UAAYpqH,EAAQ,IAAKuD,gJCzD1D,IAAA0zD,EAAA1xE,EAAA,eAAAoH,OAAAiT,KAAAq3D,GAAAl3D,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA2zD,EAAAl5D,QACA,IAAA+5I,EAAAvyJ,EAAA,wBAAAoH,OAAAiT,KAAAk4I,GAAA/3I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAw0I,EAAA/5I,QACA,IAAAg6I,EAAAxyJ,EAAA,sBAAAoH,OAAAiT,KAAAm4I,GAAAh4I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAy0I,EAAAh6I,QACA,IAAAi6I,EAAAzyJ,EAAA,wBAAAoH,OAAAiT,KAAAo4I,GAAAj4I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA00I,EAAAj6I,QACA,IAAAk6I,EAAA1yJ,EAAA,UAAAoH,OAAAiT,KAAAq4I,GAAAl4I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA20I,EAAAl6I,QACA,IAAAm6I,EAAA3yJ,EAAA,WAAAoH,OAAAiT,KAAAs4I,GAAAn4I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA40I,EAAAn6I,QACA,IAAAo6I,EAAA5yJ,EAAA,UAAAoH,OAAAiT,KAAAu4I,GAAAp4I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA60I,EAAAp6I,4PCNA,IAAAk5D,EAAA1xE,EAAA,+oBAEa8lI,cAIT,SAAAA,EAAYz0E,GAA8B,IAApBg+F,EAAoB,EAAAh5I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,QAAV9T,EAAU,mGAAAm7H,CAAAx6H,KAAA4iI,GAAAnI,EAAAz6H,KAAA06H,EAAAkI,GAAA/kI,KAAAmC,KAChC4iI,EAAWspB,MAAO/9F,EAAUg+F,gPALV39E,EAAAnN,4BAErB6qF,MAAQ,mICJnB,IAAA19E,EAAA1xE,EAAA,+oBAEaulI,cAIT,SAAAA,EAAYl0E,GAA8B,IAApBg+F,EAAoB,EAAAh5I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,QAAV9T,EAAU,mGAAAm7H,CAAAx6H,KAAAqiI,GAAA5H,EAAAz6H,KAAA06H,EAAA2H,GAAAxkI,KAAAmC,KAChCqiI,EAAa6pB,MAAO/9F,EAAUg+F,gPALV39E,EAAAnN,8BAEvB6qF,MAAQ,6HCJnB,IAAAuD,EAAA3yJ,EAAA,YACAqyJ,EAAAryJ,EAAA,60BAEaukE,cAmBT,SAAAA,EAAYhqB,EAAM8W,EAAUg+F,GAAU,IAAArgF,EAAA,mGAAA0uD,CAAAx6H,KAAAqhE,IAClCyK,EAAA2uD,EAAAz6H,KAAA06H,EAAAr5D,GAAAxjE,KAAAmC,QAjBJ0iI,WAAW,GAgB2B52D,EAftCvlE,KAAK,GAeiCulE,EAVtCpuE,KAAK,GAUiCouE,EATtCy3D,YAAa,EASyBz3D,EARtC03D,WAAa,KAQyB13D,EANtC23D,gBAAgB,KAMsB33D,EAJtCugF,QAAS,EAI6BvgF,EAFtC41D,qBAAuB,CAAC,iBAAkB,mBAAoB,qBAAsB,YAIhF51D,EAAK3d,SAASA,KAEV2d,EAAK3d,SAAW,IAAIshG,EAAAxI,MAAM,EAAE,IAEhCn7E,EAAKz0B,KAAKA,EACVy0B,EAAKqgF,UAAUA,EAPmBrgF,8OAnBhBqjF,EAAAC,0GA6Bd7oJ,GAEJ,OADAvG,KAAKuG,KAAOA,EACLvG,oCAGJ7B,EAAE+C,EAAGyuJ,GACR,GAAGA,EAAa,CACZ,IAAIC,EAAKzxJ,EAAE6B,KAAKmuD,SAAShwD,EACrB0xJ,EAAK3uJ,EAAElB,KAAKmuD,SAASjtD,EACzBlB,KAAK0iI,WAAWprH,QAAQ,SAAAta,GAAC,OAAEA,EAAEylE,UAAUqtF,KAAKF,EAAIC,GAAI,KAIxD,OADA7vJ,KAAKmuD,SAAS4hG,OAAO5xJ,EAAE+C,GAChBlB,kCAGN4vJ,EAAIC,EAAIF,GAKT,OAJGA,GACC3vJ,KAAK0iI,WAAWprH,QAAQ,SAAAta,GAAC,OAAEA,EAAEylE,UAAUqtF,KAAKF,EAAIC,GAAI,KAExD7vJ,KAAKmuD,SAAS2hG,KAAKF,EAAIC,GAChB7vJ,0CAGEmsJ,GACTnsJ,KAAKmsJ,UAAYA,yCAIjB,OAAOnsJ,KAAKmsJ,6LC7DpB,IAAA39E,EAAA1xE,EAAA,+oBAEa+lI,cAIT,SAAAA,EAAY10E,GAA8B,IAApBg+F,EAAoB,EAAAh5I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,QAAV9T,EAAU,mGAAAm7H,CAAAx6H,KAAA6iI,GAAApI,EAAAz6H,KAAA06H,EAAAmI,GAAAhlI,KAAAmC,KAChC6iI,EAAaqpB,MAAO/9F,EAAUg+F,gPALV39E,EAAAnN,8BAEvB6qF,MAAQ,iJCJnB,IAAA/xB,EAAAr9H,EAAA,YAEAkzJ,EAAAlzJ,EAAA,m1BAEasyJ,qRAET3qH,SAAS,mPAFiCurH,EAAAC,qHAK5B5zB,EAAUspB,EAAWvhJ,GAC/B,IAAImiC,EAAO,YAKX,OAJG81F,IACC91F,GAAM81F,EAAS,KAEnB91F,GAAMo/G,OACKtmJ,IAAR+E,EACS+1H,EAAAS,MAAM//G,IAAI7a,KAAMumC,EAAM,OAElC4zF,EAAAS,MAAMnmH,IAAIzU,KAAMumC,EAAMniC,GACfA,+CAGSi4H,GAAS,IAAAtwD,EAAA/rE,KACZX,MAAVg9H,EAIAlC,EAAAS,MAAM98F,QAAQu+F,GACbA,EAAS/kH,QAAQ,SAAAra,GACb8uE,EAAKtnC,SAASxnC,GAAG,KAIzB+C,KAAKykC,SAAS43F,GAAU,GATpBr8H,KAAKykC,SAAS,gDAalBzkC,KAAKykC,SAAL,eAAgC,wCAGvBkhH,EAAWvhJ,GACpB,OAAOpE,KAAKskI,cAAc,KAAM,kBAAkBqhB,EAAWvhJ,8CAG9CqgC,GACfzkC,KAAKykC,SAAW01F,EAAAS,MAAM70E,UAAUthB,wOC7CxC,IAAA01F,EAAAr9H,EAAA,sLAEamzJ,qIAET9H,IAAMhuB,EAAAS,MAAM6K,YACZ2mB,aAAa,iGAEEzG,GASX,OARIxrB,EAAAS,MAAM//G,IAAI7a,KAAKosJ,aAAczG,EAAW,OACxCxrB,EAAAS,MAAMnmH,IAAIzU,KAAKosJ,aAAczG,EAAW,CACpCryE,MAAO,CACHrd,QAAQ,EACR7xD,OAAO,KAIZ+1H,EAAAS,MAAM//G,IAAI7a,KAAKosJ,aAAczG,6CAGtBA,EAAWryE,GACPtzE,KAAKkwJ,eAAevK,GAC1BryE,MAAMrd,OAASqd,2CAGdqyE,EAAWryE,GACNtzE,KAAKkwJ,eAAevK,GAC1BryE,MAAMlvE,MAAQkvE,uCAGjBqyE,GAAmC,IAAxB1vF,IAAwB,EAAA9iD,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GAAX/O,IAAW,EAAA+O,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACxCg9I,EAAcnwJ,KAAKkwJ,eAAevK,GACtC,OAAG1vF,GAAU7xD,EACF+rJ,EAAY78E,MAAMrd,QAAUk6F,EAAY78E,MAAMlvE,MAEtD6xD,EACQk6F,EAAY78E,MAAMrd,OAEtBk6F,EAAY78E,MAAMlvE,uVCrCpB6iJ,aAGT,SAAAA,EAAY9oJ,EAAE+C,gGAAEs5H,CAAAx6H,KAAAinJ,GACT9oJ,aAAa8oJ,GACZ/lJ,EAAE/C,EAAE+C,EACJ/C,EAAEA,EAAEA,GACCgf,MAAM2gB,QAAQ3/B,KACnB+C,EAAE/C,EAAE,GACJA,EAAEA,EAAE,IAER6B,KAAK7B,EAAEA,EACP6B,KAAKkB,EAAEA,wFAGJ/C,EAAE+C,GAOL,OANGic,MAAM2gB,QAAQ3/B,KACb+C,EAAE/C,EAAE,GACJA,EAAEA,EAAE,IAER6B,KAAK7B,EAAEA,EACP6B,KAAKkB,EAAEA,EACAlB,kCAGN4vJ,EAAGC,GAOJ,OANG1yI,MAAM2gB,QAAQ8xH,KACbC,EAAGD,EAAG,GACNA,EAAGA,EAAG,IAEV5vJ,KAAK7B,GAAGyxJ,EACR5vJ,KAAKkB,GAAG2uJ,EACD7vJ,8HChCf,IAAAyvJ,EAAA3yJ,EAAA,WAEAkzJ,GADAlzJ,EAAA,YACAA,EAAA,o1BAEa6uJ,cAKT,SAAAA,EAAYx9F,EAAU/pD,GAAM,IAAA0nE,EAAA,mGAAA0uD,CAAAx6H,KAAA2rJ,IACxB7/E,EAAA2uD,EAAAz6H,KAAA06H,EAAAixB,GAAA9tJ,KAAAmC,QAJJoE,MAAM,IAKF0nE,EAAK3d,SAASA,KAEV2d,EAAK3d,SAAW,IAAIshG,EAAAxI,MAAM,EAAE,IAG7B7iJ,IACC0nE,EAAK1nE,MAAQA,GARO0nE,8OALNkkF,EAAAC,8GAiBf9xJ,EAAE+C,GAEL,OADAlB,KAAKmuD,SAAS4hG,OAAO5xJ,EAAE+C,GAChBlB,kCAGN4vJ,EAAIC,GAEL,OADA7vJ,KAAKmuD,SAAS2hG,KAAKF,EAAIC,GAChB7vJ,+NC5Bf,IAAAoiI,2SAAAkP,CAAAx0I,EAAA,wBAEA,IAAAszJ,EAAAtzJ,EAAA,gBAAAoH,OAAAiT,KAAAi5I,GAAA94I,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAu1I,EAAA96I,SACA,IAAAi1I,EAAAztJ,EAAA,uBAAAoH,OAAAiT,KAAAozI,GAAAjzI,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA0vI,EAAAj1I,sLCHA,IAAA6kH,EAAAr9H,EAAA,sLAEaqsJ,qIAGTnc,OAAS,QACTqjB,SAAW,QACXC,gBAAgB,2FAEPl2I,EAAOxH,GACTunH,EAAAS,MAAMh9E,SAASxjC,KACdA,EAAQ,CAAC7T,KAAM6T,IAEnB,IAAI7T,EAAO6T,EAAM7T,KACbgqJ,EAAevwJ,KAAKgtI,OAAOzmI,GAC3BgqJ,IACAA,EAAa,GACbvwJ,KAAKgtI,OAAOzmI,GAAMgqJ,GAEtB,IAAIC,EAAOxwJ,KAAKswJ,gBAAgB19I,EAAIu1I,KAChCqI,IACAA,EAAK,GACLxwJ,KAAKswJ,gBAAgB19I,EAAIu1I,KAAMqI,GAEnCD,EAAanjJ,KAAKwF,GAClB49I,EAAKpjJ,KAAKgN,sCAGH7T,EAAMqM,GACb,IAAI5V,EAAIgD,KAAKqwJ,SAAS9pJ,GAClBvJ,IACAA,EAAE,GACFgD,KAAKqwJ,SAAS9pJ,GAAMvJ,GAExBA,EAAEoQ,KAAKwF,qCAIP,OAA0D,IAAnD1O,OAAOusJ,oBAAoBzwJ,KAAKgtI,QAAQlvI,+CAG9BszI,GACjB,IAAIv+H,EAAI,IAAIs2I,EAIZ,OAHAt2I,EAAEm6H,OAASoE,EAAIpE,OACfn6H,EAAEw9I,SAAWjf,EAAIif,SACjBx9I,EAAEy9I,gBAAkBlf,EAAIkf,gBACjBz9I,uJClBR,SAAiBrV,EAAGkB,GACd,MAALlB,IAAWA,EAAI,GACV,MAALkB,IAAWA,EAAI,GACtB,OAAIA,EAAIlB,EAAUwG,IACRxG,GAAKkB,EAAIlB,GAAGY,KAAKmV,wBAQrB,SAAqBuiH,GAE3B,OAAIA,GAAM,EAAU9xH,KACT8xH,EAAO13H,KAAKU,IAAIV,KAAKmV,+BA2B1B,SAAgBwnE,EAAO8nB,GAChB,MAAT9nB,IAAeA,EAAQ,GACZ,MAAX8nB,IAAiBA,EAAU,GAC/B,OAAI9nB,GAAS,GAAK8nB,GAAW,EAAU7+F,IAC7B6+F,EAAUzkG,KAAKoC,IAAIpC,KAAKmV,SAAU,EAAMwnE,kBAU5C,SAAqBA,EAAO+6C,GACrB,MAAT/6C,IAAeA,EAAQ,GACf,MAAR+6C,IAAcA,EAAO,GACzB,GAAIA,GAAQ,GAAK/6C,GAAS,EAAG,OAAO/2E,IACpC,IAAIzG,EAAIa,KAAKmV,SACb,OAAOuiH,EAAO13H,KAAKoC,IAAIjD,GAAG,EAAEA,GAAI,EAAEw9E,cAU5B,SAAiBA,EAAO+6C,GACjB,MAAT/6C,IAAeA,EAAQ,GACf,MAAR+6C,IAAcA,EAAO,GACzB,OAAIA,GAAQ,GAAK/6C,GAAS,EAAU/2E,IAC1B8xH,EAAO13H,KAAKoC,KAAKpC,KAAKU,IAAI,EAAMV,KAAKmV,UAAW,EAAMwnE,aAU1D,SAAgBt0E,EAAGqvH,GAChB,MAALrvH,IAAWA,EAAI,GACP,MAARqvH,IAAcA,EAAO,GACzB,IAAItsH,EAAQ,EAAJ/C,EACR,GAAIqvH,GAAQ,GAAKtsH,GAAK,EAAG,OAAOxF,IAEhC,IADA,IAAI0sJ,EAAO,EACFtzJ,EAAE,EAAEA,EAAEoM,EAAEpM,IAChBszJ,GAAQtyJ,KAAKmV,SAEX,OAAQuiH,EAAKtsH,EAAEpL,KAAKU,IAAI4xJ,iBAWrB,SAAoBlzJ,EAAGkB,EAAG8K,GACpB,MAALhM,IAAWA,EAAI,GACV,MAALkB,IAAWA,EAAI,GACV,MAAL8K,IAAWA,EAAI,IACnB,GAAM9K,EAAFlB,GAAOgM,EAAIhM,GAASkB,EAAJ8K,EAAO,OAAOxF,IACrC,GAAIxG,GAAGkB,EAAG,OAAOlB,EACd,IAAIF,GAAKkM,EAAIhM,IAAMkB,EAAIlB,GACnBG,EAAIS,KAAKmV,SACb,OAAI5V,GAAKL,EACEE,EAAIY,KAAKuC,KAAKhD,GAAKe,EAAIlB,IAAMgM,EAAIhM,IAEjCkB,EAAIN,KAAKuC,MAAM,EAAIhD,IAAMe,EAAIlB,IAAMkB,EAAI8K,mBAa/C,SAAqBhM,EAAGkB,EAAGpB,EAAGiD,GACxB,MAAL/C,IAAWA,EAAI,GACV,MAALkB,IAAWA,EAAI,GACV,MAALpB,IAAWA,EAAI,KACV,MAALiD,IAAWA,EAAI,KACnB,GAAQ7B,EAAJlB,GAASF,EAAIE,GAAS+C,EAAJjD,GAAaoB,EAAJ6B,EAAO,OAAOyD,IAChD,GAAIxG,GAAGkB,EAAG,OAAOlB,EACd,IAAIya,GAAM3a,EAAIE,IAAQkB,EAAIlB,GAAI+C,EAAIjD,IAC9B4a,GAAMxZ,EAAI6B,IAAQ7B,EAAIlB,GAAI+C,EAAIjD,IAC9BK,EAAIS,KAAKmV,SAEb,OAAI5V,GAAKsa,EACEza,EAAIY,KAAKuC,KAAKhD,GAAMe,EAAIlB,GAAI+C,EAAIjD,KAAOA,EAAIE,IACvC,EAAE0a,EAANva,EACAe,EAAIN,KAAKuC,MAAM,EAAIhD,IAAOe,EAAIlB,GAAI+C,EAAIjD,KAAOoB,EAAI6B,IAEpDjD,GAAKiD,EAAEjD,IAAIK,EAAEsa,IAAK,EAAMA,EAAKC,gBAUlC,SAAmB+vC,EAAMwY,GAChB,MAARxY,IAAcA,EAAO,GACd,MAAPwY,IAAaA,EAAM,GACvB,OAAIA,EAAM,EAAUz8D,IACb5F,KAAKC,IAAIsyJ,EAAO1oG,EAAMwY,8BA0B1B,SAAkBxjE,EAAEU,GACnB,MAAHV,IAASA,EAAI,GACV,MAAHU,IAASA,EAAI,IACjB,IAAIT,EAAQ,EAAJD,EACR,GAAKU,EAAI,EAAU,EAAJA,EAAUT,GAAK,EAAG,OAAO8G,IAExC,IADA,IAAI+N,EAAM,EACD3U,EAAE,EAAEA,EAAEF,EAAEE,IAChB2U,GAAO6+I,EAAUjzJ,GAEf,OAAOoU,eAQJ,SAAmBpU,GAClB,MAAHA,IAASA,EAAI,IACjB,OAAKA,GAAK,EAAW,GAALA,EAAkBqG,IAC6B,EAArD5F,KAAKiF,MAAMjF,KAAKU,IAAIV,KAAKmV,UAAUnV,KAAKU,IAAI,EAAEnB,eAQlD,SAAiBs5H,GACX,MAARA,IAAcA,EAAS,GAC3B,GAAKA,GAAU,EAAM,OAAOjzH,IAC5B,IAAIxG,EAAIY,KAAKC,KAAK44H,GACdv4H,EAAI,EACJtB,EAAI,EACR,OAAa,CACZ,IAAIG,EAAIa,KAAKmV,SAEb,IADA7U,GAAKnB,GACGC,EAAG,OAAOJ,EAClBA,GAAK,YAaA,SAAe29E,EAAO+6C,GACf,MAAT/6C,IAAeA,EAAQ,GACf,MAAR+6C,IAAcA,EAAO,GACtB,CAAA,KAAY,EAAR/6C,GAoBG,CAAA,GAAa,GAATA,EAAc,CAErB,IADA,IAAI81E,EAAIt9I,IACDs9I,GAAK,MACRA,EAAIt9I,IAER,OAAQnV,KAAKU,IAAI+xJ,GAAK/6B,EAGtB,IADA,IAAIg7B,IACS,CACT,IAAIC,EAAIx9I,IACJ7U,GAAKN,KAAK2F,EAAIg3E,GAAS38E,KAAK2F,EAC5BpG,EAAIe,EAAIqyJ,EAERD,EADAnzJ,GAAK,EACDS,KAAKoC,IAAI7C,EAAG,EAAMo9E,IAEjB38E,KAAKU,KAAKJ,EAAIf,GAAKo9E,GAE5B,IAAMi2E,EAAKz9I,IAEX,GAAQ,EAAJ5V,GACA,GAAIqzJ,GAAM5yJ,KAAKoC,IAAIswJ,EAAI/1E,EAAQ,GAC3B,WAED,GAAIi2E,GAAM5yJ,KAAKC,KAAKyyJ,GACvB,MAGR,OAAOA,EAAIh7B,EA1CX,IAJA,IAAIm7B,EAAO7yJ,KAAKuC,KAAK,EAAMo6E,EAAQ,GAC/Bm2E,EAAMn2E,EAAQ38E,KAAKU,IAAI,GACvBqyJ,EAAMp2E,EAAQk2E,IAEL,CACT,IAAIj2E,EAAKznE,IAET,KAAKynE,EAAK,MAAc,SAAJz9E,GAApB,CAGA,IAAI6rG,EAAK,EAAM71F,IACXV,EAAIzU,KAAKU,IAAIk8E,GAAM,EAAMA,IAAOi2E,EAChC9yJ,EAAI48E,EAAQ38E,KAAKC,IAAIwU,GACrB3T,EAAI87E,EAAKA,EAAKouB,EACdrsG,EAAIm0J,EAAMC,EAAMt+I,EAAI1U,EACxB,GAAoC,GAA/BpB,EAAIqB,KAAKU,IAAI,KAAO,IAAMI,GAAcnC,GAAKqB,KAAKU,IAAII,GACvD,OAAOf,EAAI23H,+DA5RH,CAAC,mBAAoB,mBACpB,kBAAmB,kBACnB,mBAAoB,0BACpB,iCACA,qBAAsB,iBACtB,uBAAuB,gBACvB,iBAAiB,kBACjB,iBAAkB,mCAEX,CAAC,UAAW,cACX,SAAU,SACV,UAAW,aACX,cACA,YAAa,QACb,cAAc,SACd,YAAY,WACZ,YAAa,WAGvC,IAAMviH,EAASnV,KAAKmV,OAmCpB,SAASo9I,EAAO1oG,EAAMwY,GAGzB,OAFY,MAARxY,IAAcA,EAAO,GACd,MAAPwY,IAAaA,EAAM,GACnBA,EAAM,EAAUz8D,IAEZ5F,KAAKuC,MAAM,EAAMvC,KAAKU,IAAIV,KAAKmV,WAAanV,KAAKW,IAAI,EAAMX,KAAK2C,GAAK3C,KAAKmV,UACvEktD,EAAMxY,EAyId,SAAS2oG,EAAUjzJ,GAEzB,OADO,MAAHA,IAASA,EAAI,IACbA,EAAE,EAAU,EAAJA,EAAgBqG,IACrB5F,KAAKmV,UAAU5V,EACX,EAEA,iIC3MZ,IAAAqY,2SAAAs7H,CAAAx0I,EAAA,iuBAEa89H,+NAGSvpH,IAMTA,GAA0B,EAAnB8B,UAAUrV,QAAcqf,MAAM2gB,QAAQ3qB,UAAU,MACxD9B,EAAM,IAEVA,EAAMA,GAAO,GAEb,IAAK,IAAIjU,EAAI,EAAGA,EAAI+V,UAAUrV,OAAQV,IAAK,CACvC,IAAIiY,EAASlC,UAAU/V,GACvB,GAAKiY,EAGL,IAAK,IAAIC,KAAOD,EACZ,GAAKA,EAAOX,eAAeY,GAA3B,CAGA,IAAIwoB,EAAU3gB,MAAM2gB,QAAQzsB,EAAIiE,IAC5B8oB,EAnBAp+B,KAmBiBo+B,SAAS/sB,EAAIiE,IAC9B87I,EApBApxJ,KAoBeo+B,SAAS/oB,EAAOC,IAE/B8oB,IAAaN,GAAWszH,EAtBxBpxJ,KAuBMsxD,WAAWjgD,EAAIiE,GAAMD,EAAOC,IAElCjE,EAAIiE,GAAOD,EAAOC,IAK9B,OAAOjE,iCAGI7T,EAAGkB,GACd,IAAIzB,EAIJ,IAAKA,KAHAO,IACDA,EAAI,IAEEkB,EACNlB,EAAEP,GAAKyB,EAAEzB,GAEb,OAAOO,oCAGM4X,EAAQC,GACrB,IAAIg8I,EAASn8I,EAAc,GAAIE,GAa/B,OAZIwlH,EAAM02B,iBAAiBl8I,IAAWwlH,EAAM02B,iBAAiBj8I,IACzDnR,OAAOiT,KAAK9B,GAAQiC,QAAQ,SAAAhC,GACpBslH,EAAM02B,iBAAiBj8I,EAAOC,KACxBA,KAAOF,EAGTi8I,EAAO/7I,GAAOslH,EAAM22B,UAAUn8I,EAAOE,GAAMD,EAAOC,IAEtDJ,EAAcm8I,EAAdG,EAAA,GAAwBl8I,EAAMD,EAAOC,OAI1C+7I,6CAGez6F,GACtB,IAAI5/C,EAAS,GAab,OAZAhB,EAAE4wC,OAAOgQ,EAAO,SAASxyD,EAAOkR,GACzBslH,EAAMv0F,WAAWjiC,IAIpB4S,EAAO5J,KAAK,CACRkI,IAAKA,EACLlR,MAAOA,MAKR4S,gCAGExZ,EAAGkB,GACZ,IAAwCtB,EAAGsK,EAAvCpK,EAAI,GAAIL,EAAIO,EAAEM,OAAQ0L,EAAI9K,EAAEZ,OAChC,IAAKV,GAAK,IAAKA,EAAIH,GAAI,IAAKyK,GAAK,IAAKA,EAAI8B,GAAIlM,EAAE8P,KAAK,CAACjP,EAAGX,EAAEJ,GAAIA,EAAGA,EAAG8D,EAAGxC,EAAEgJ,GAAIA,EAAGA,IACjF,OAAOpK,2CAGawzD,GACpB,OAAQA,GAAwB,WAAhBY,EAAOZ,KAAsB3zC,MAAM2gB,QAAQgzB,IAAkB,OAATA,kCAGzDA,GACX,OAAO3zC,MAAM2gB,QAAQgzB,oCAGTtzD,GACZ,OAAa,OAANA,GAA2B,WAAbk0D,EAAOl0D,oCAGhBA,GACZ,OAAQsC,MAAMtC,IAAmB,iBAANA,oCAGbP,GACd,OAAQ6C,MAAMC,WAAW9C,KAAOsC,SAAStC,iCAGhCA,GACT,OAAO29H,EAAMj9E,SAAS1gD,IAAMA,EAAI,GAAM,qCAGxBO,GACd,MAAoB,mBAANA,iCAGJA,GACV,MAA6C,kBAAtC0G,OAAOjE,UAAUwD,SAAS5F,KAAKL,oCAG1BA,GACZ,MAAoB,iBAANA,GAAkBA,aAAa2U,sCAI7C,SAASs/I,IACL,OAAOrzJ,KAAKiF,MAA4B,OAArB,EAAIjF,KAAKmV,WACvB9P,SAAS,IACT8O,UAAU,GAGnB,OAAOk/I,IAAOA,IAAO,IAAMA,IAAO,IAAMA,IAAO,IAC3CA,IAAO,IAAMA,IAAOA,IAAOA,kDAINv5H,GACzB,OAAOA,EAAOnwB,OAAO,GAAG+3C,cAAgB5nB,EAAOruB,MAAM,4CAGjC6nJ,EAAYC,GAAiC,IAAtBC,EAAsB,EAAAz+I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAP,MACtD0+I,EAAa,GACjB,OAAKH,GAGLA,EAAWp6I,QAAQ,SAAU1E,GACzB,IAAIkI,EAAMlI,EACN++I,IACA72I,EAAM62I,EAAU/+I,IAEpBi/I,EAAWj/I,EAAIg/I,IAAmB92I,IAE/B+2I,4CAKcx0I,EAAU2tC,GAAiB,IAAPi2C,EAAO,EAAA9tF,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAJ,GAS5C,OARK63C,IACDA,EAAW,4CAEX4vE,EAAMk3B,OAAO9mG,IACbxvB,aAAco/F,EAAMk3B,OAAO9mG,IAE/B4vE,EAAMk3B,OAAO9mG,GAAYpvB,WAAWve,EAAU4jF,GAEvC,WAAA,OAAMzlE,aAAco/F,EAAMk3B,OAAO9mG,wCAQxC,IAAI+mG,EAAK98I,OAAO+8I,UAAUC,UACtBC,EAAOH,EAAGjqJ,QAAQ,SACtB,GAAW,EAAPoqJ,EAEA,OAAOn6I,SAASg6I,EAAGx/I,UAAU2/I,EAAO,EAAGH,EAAGjqJ,QAAQ,IAAKoqJ,IAAQ,IAInE,GAAc,EADAH,EAAGjqJ,QAAQ,YACR,CAEb,IAAIqqJ,EAAKJ,EAAGjqJ,QAAQ,OACpB,OAAOiQ,SAASg6I,EAAGx/I,UAAU4/I,EAAK,EAAGJ,EAAGjqJ,QAAQ,IAAKqqJ,IAAM,IAI/D,OAAO,uCAIP,IAAIJ,EAAK98I,OAAO+8I,UAAUC,UACtBvuB,EAAOquB,EAAGjqJ,QAAQ,SACtB,OAAW,EAAP47H,GAEO3rH,SAASg6I,EAAGx/I,UAAUmxH,EAAO,EAAGquB,EAAGjqJ,QAAQ,IAAK47H,IAAQ,8CAK9C32H,GAAa,IAARqlJ,EAAQ,EAAAj/I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAH,GAC/B,OAAOpT,WAAWA,WAAWgN,GAAK0C,YAAY2iJ,8CAI9C,MACwB,oBAATp9I,KAA+BA,KACpB,oBAAXC,OAAiCA,YACtB,IAAX8R,EAAiCA,EAGrC,sCAKX,IAAIA,EAAS6zG,EAAMI,kBACnB,OAAQj0G,EAAOmnC,YAAcnnC,EAAOo2G,8CAGvBvqH,EAAKw4I,GAAmC,IAAzBiH,EAAyB,EAAAl/I,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAN,CAAC,KAC5CmY,EAAQ,GACZ,OAAO2lC,KAAKC,UAAUt+C,EAAK,SAAUnM,EAAGoM,GACpC,GAAGA,IAAMhR,EAAAA,EACL,MAAO,WAEX,GAAGgR,KAAOhR,EAAAA,EACN,MAAO,YAGX,IAAGwwJ,IACIA,EAAiBnpG,KAAK,SAAA+B,GAAM,OAAEj1C,EAAEyzC,WAAWhjD,EAAGwkD,KADrD,CAMA,GAAiB,WAAbyG,EAAO7+C,IAAwB,OAANA,EAAY,CACrC,IAA0B,IAAtByY,EAAMxjB,QAAQ+K,GAEd,OAEJyY,EAAMle,KAAKyF,GAGf,GAAGu4I,EAAS,CACR,IAAIxwB,EAAM98F,QAAQstH,GACd,OAAOA,EAAS3kJ,EAAGoM,GAGvBu4I,EAAS9zI,QAAQ,SAAAva,GACb8V,EAAI9V,EAAE0J,EAAEoM,KAIhB,OAAOA,IAER,iDAIuBy/I,EAAIC,GAC9B,IAAIC,EAAUF,EAAGtzI,MAAM,KACnByzI,EAAUF,EAAGvzI,MAAM,KAEvB,SAAS0zI,EAAch1C,GACnB,IAAK,IAAItgH,EAAI,EAAGA,EAAIsgH,EAAM5/G,SAAUV,EAChC,IAAKw9H,EAAMhzB,kBAAkB8V,EAAMtgH,IAC/B,OAAO,EAGf,OAAO,EAGX,IAAKs1J,EAAcF,KAAaE,EAAcD,GAC1C,OAAOzuJ,IAGX,IAAK,IAAI5G,EAAI,EAAGA,EAAIo1J,EAAQ10J,SAAUV,EAAG,CACrC,GAAIq1J,EAAQ30J,SAAWV,EACnB,OAAO,EAGX,GAAIo1J,EAAQp1J,KAAOq1J,EAAQr1J,GAG3B,OAAIo1J,EAAQp1J,GAAKq1J,EAAQr1J,GACd,GAEH,EAGZ,OAAIo1J,EAAQ10J,QAAU20J,EAAQ30J,QAClB,EAGL,4CAGcK,GACrB,MAAO,QAAQuV,KAAKvV,gDAKIw0J,GACxB,QAAK/3B,EAAMh9E,SAAS+0G,IAGb/3B,EAAMg4B,cAAcl/I,KAAKi/I,wCAGhBjqI,GAChB,IAAImqI,EAAY,EAEhB,MAAO,CACHh1G,KAAM,WACF,OAAOg1G,EAAYnqI,EAAM5qB,OACzB,CAACsG,MAAOskB,EAAMmqI,KAAc/0G,MAAM,GAClC,CAACA,MAAM,sCAKHp1B,EAAOoqI,GACnB,OAAOpqI,EAAM5qB,SAAW,IAAIg/B,IAAIpU,EAAM0P,IAAI06H,IAAUz6H,yCAGrCr7B,GACf,OAAIA,EAGG,CACHuJ,KAAMvJ,EAAEkL,YAAY3B,KACpBoiC,QAAS3rC,EAAE2rC,QACXjJ,KAAM1iC,EAAE0iC,MALD1iC,6CASWuqC,GACtB,OAAOqzF,EAAM9xE,OAAOvhB,EAAQ,SAAU/pC,EAAGkB,GACrC,OAAOk8H,EAAMzjF,QAAQyjF,EAAMxiG,IAAI56B,EAAG,SAAUW,GACxC,OAAOy8H,EAAMxiG,IAAI15B,EAAG,SAAUwC,GAC1B,OAAO/C,EAAEyjD,OAAO,CAAC1gD,SAErB,IACL,CAAC,uCAGSwnB,EAAOtkB,GACpB,OAAOskB,EAAMogC,OAAO,SAACtrD,EAAGR,EAAGI,GAAP,OAAcJ,IAAMoH,EAAS5G,EAAEokD,OAAOxkD,GAAKI,GAAG,yCAMlE,OAAOwY,EAAEyzC,WAAW/xC,MAAM1B,EAAG7C,+CAI7B,OAAO6C,EAAEgxC,UAAUtvC,MAAM1B,EAAG7C,0CAI5B,OAAO6C,EAAE2kC,KAAKjjC,MAAM1B,EAAG7C,0CAIvB,OAAO6C,EAAEssC,KAAK5qC,MAAM1B,EAAG7C,4CAIvB,OAAO6C,EAAEb,OAAOuC,MAAM1B,EAAG7C,+CAIzB,OAAO6C,EAAE+vC,UAAUruC,MAAM1B,EAAG7C,2CAI5B,OAAO6C,EAAExS,MAAMkU,MAAM1B,EAAG7C,mDAIxB,OAAO6C,EAAEgwC,cAActuC,MAAM1B,EAAG7C,+CAIhC,OAAO6C,EAAEiwC,UAAUvuC,MAAM1B,EAAG7C,+CAI5B,OAAO6C,EAAEyoC,UAAU/mC,MAAM1B,EAAG7C,4CAI5B,OAAO6C,EAAE4wC,OAAOlvC,MAAM1B,EAAG7C,yCAIzB,OAAO6C,EAAE6E,IAAInD,MAAM1B,EAAG7C,yCAItB,OAAO6C,EAAEvB,IAAIiD,MAAM1B,EAAG7C,4CAItB,OAAO6C,EAAE8yC,OAAOpxC,MAAM1B,EAAG7C,6CAIzB,OAAO6C,EAAEmhC,QAAQz/B,MAAM1B,EAAG7C,yCAI1B,OAAO6C,EAAEoiB,IAAI1gB,MAAM1B,EAAG7C,2CAKtB,OAAO6C,EAAEgyC,MAAMtwC,MAAM1B,EAAG7C,2CAIxB,OAAO6C,EAAEmyC,MAAMzwC,MAAM1B,EAAG7C,8CAIxB,OAAO6C,EAAEulC,SAAS7jC,MAAM1B,EAAG7C,8CAI3B,OAAO6C,EAAE2zC,SAASjyC,MAAM1B,EAAG7C,2CAI3B,OAAO6C,EAAE1S,MAAMoU,MAAM1B,EAAG7C,4CAIxB,OAAO6C,EAAEklC,OAAOxjC,MAAM1B,EAAG7C,gCA1btB4/I,OAAS,cADPn4B,EA6JFk3B,OAAS,GA7JPl3B,EAiTFg4B,cAAgB,kMCnT3B,aAEA,IAGAI,EAAA,GACAC,OAAA,IAAAlsI,EAAA9R,OAAA8R,EAKAmsI,EAAA90J,KAAAoC,IATA,IACA,GASA2yJ,EAAA/0J,KAAAoC,IAAA,EARA,IASA4yJ,EAAA,EAAAD,EAIAE,EAAAj1J,KAAAmV,OAiEA,SAAA+/I,EAAAh+I,GACA,IAAApY,EAAAq2J,EAAAj+I,EAAAxX,OACAu1G,EAAArzG,KAAA5C,EAAA,EAAAsK,EAAA2rG,EAAAj2G,EAAAi2G,EAAA3rG,EAAA,EAAAS,EAAAkrG,EAAAoX,EAAA,GAMA,IAHA8oC,IAAAj+I,EAAA,CAAAi+I,MAGAn2J,EAxFA,KAyFA+K,EAAA/K,GAAAA,IAEA,IAAAA,EAAA,EAAAA,EA3FA,IA2FAA,IACA+K,EAAA/K,GAAA+K,EAAAT,EAhFA8rJ,IAgFA9rJ,EAAA4N,EAAAlY,EAAAm2J,IAAAr2J,EAAAiL,EAAA/K,KACA+K,EAAAT,GAAAxK,GAIAm2G,EAAAj6F,EAAA,SAAAqE,GAIA,IAFA,IAAAvgB,EAAAH,EAAA,EACAK,EAAAi2G,EAAAj2G,EAAAsK,EAAA2rG,EAAA3rG,EAAAS,EAAAkrG,EAAAoX,EACAhtG,KACAvgB,EAAAiL,EAAA/K,EA1FAo2J,IA0FAp2J,EAAA,GACAL,EAvGA,IAuGAA,EAAAoL,EA3FAqrJ,KA2FArrJ,EAAA/K,GAAA+K,EAAAT,EA3FA8rJ,IA2FA9rJ,EAAAxK,KAAAiL,EAAAT,GAAAxK,IAGA,OADAm2G,EAAAj2G,EAAAA,EAAAi2G,EAAA3rG,EAAAA,EACA3K,IA1GA,KAmIA,SAAA02J,EAAAhpD,EAAAn1F,GAEA,IADA,IAAAo+I,EAAAC,EAAAlpD,EAAA,GAAA/iG,EAAA,EACAA,EAAAisJ,EAAA71J,QACAwX,EA1HAk+I,IA0HA9rJ,GA1HA8rJ,KA2HAE,GAAA,GAAAp+I,EA3HAk+I,IA2HA9rJ,IAAAisJ,EAAAnhJ,WAAA9K,KAEA,OAAAksJ,EAAAt+I,GAsBA,SAAAs+I,EAAAp2J,GACA,OAAA2U,OAAA0hJ,aAAAn8I,MAAA,EAAAla,GA3IAQ,EAAAJ,QAAA,SAAA6sG,EAAAjvD,GACA,GAAAA,IAAA,IAAAA,EAAAz0B,OAIA,OAHAy0B,EAAAz0B,QAAA,EACA3oB,KAAAmV,OAAAvV,EAAAJ,QAAA6sG,EAAAjvD,GACAA,EAAAz0B,QAAA,EACA3oB,KAAAmV,OAEA,IACA+B,EAAA,GAQAw+I,GALAL,EAoFA,SAAAt8G,EAAAvkC,EAAAkzB,GACA,IAAAlrB,EAAA5D,EAAA,GAAA+8I,UAAAnhJ,GAAA,GACA,GAAAkzB,GAAA,KAAAiuH,EACA,IAAAn5I,KAAAhI,EACA,IAAAoE,EAAA5J,KAAA+pC,EAAAvkC,EAAAgI,GAAAkrB,EAAA,IAAA,MAAA9oC,IAGA,OAAAga,EAAAlZ,OAAAkZ,EAAA,KAAA+8I,EAAAnhJ,EAAAA,EAAA,KA3FAukC,CAJAqE,GAAAA,EAAAw4G,UAAA,EAKA,CAAAvpD,EAAAmpD,EAAAZ,IACA,KAAA7/I,UAAAs3F,EA+GA,SAAAA,GACA,IAEA,OADAwoD,EAAA3tJ,OAAA2N,gBAAAw3F,EAAA,IAAA/vE,WAnJA,MAoJAk5H,EAAAnpD,GACA,MAAAztG,GACA,MAAA,EAAA,IAAAmiB,KAAA8zI,EAAAA,EAAAjB,WAAAiB,EAAAjB,UAAAiC,QACAhB,EAAAiB,OAAAN,EAAAZ,KArHAmB,GAAA,GAAA7+I,GAGA,IAAAg+I,EAAAh+I,IAUA,OAPAm+I,EAAAG,EAAAE,EAAArpC,GAAAuoC,GAOA,WAIA,IAHA,IAAA/1J,EAAA62J,EAAA16I,EA/CA,GAgDA7Y,EAAA2yJ,EACA/0J,EAAA,EACAlB,EAAAk2J,GACAl2J,EApDA,KAoDAA,EAAAkB,GACAoC,GArDA,IAsDApC,EAAA21J,EAAA16I,EAAA,GAEA,KAAAg6I,GAAAn2J,GACAA,GAAA,EACAsD,GAAA,EACApC,KAAA,EAEA,OAAAlB,EAAAkB,GAAAoC,IAIAvC,EAAAJ,QAAAw2J,YAAA,WACAh2J,KAAAmV,OAAA8/I,GAwGAI,EAAAr1J,KAAAmV,SAAAy/I,+IC5KA,SAAAjvJ,KAKAA,EAAA9D,UAAA,CACAw2F,GAAA,SAAAlwF,EAAA8W,EAAAg3I,GACA,IAAAr3J,EAAAgD,KAAAhD,IAAAgD,KAAAhD,EAAA,IAOA,OALAA,EAAAuJ,KAAAvJ,EAAAuJ,GAAA,KAAA6G,KAAA,CACAmnC,GAAAl3B,EACAg3I,IAAAA,IAGAr0J,MAGAyjD,KAAA,SAAAl9C,EAAA8W,EAAAg3I,GACA,IAAAr/I,EAAAhV,KACA,SAAAi7I,IACAjmI,EAAAygH,IAAAlvH,EAAA00I,GACA59H,EAAA3F,MAAA28I,EAAAlhJ,WAIA,OADA8nI,EAAAjlI,EAAAqH,EACArd,KAAAy2F,GAAAlwF,EAAA00I,EAAAoZ,IAGA5iG,KAAA,SAAAlrD,GAMA,IALA,IAAAm5B,EAAA,GAAA71B,MAAAhM,KAAAsV,UAAA,GACAmhJ,IAAAt0J,KAAAhD,IAAAgD,KAAAhD,EAAA,KAAAuJ,IAAA,IAAAsD,QACAzM,EAAA,EACA6L,EAAAqrJ,EAAAx2J,OAEAV,EAAA6L,EAAA7L,IACAk3J,EAAAl3J,GAAAm3C,GAAA78B,MAAA48I,EAAAl3J,GAAAi3J,IAAA30H,GAGA,OAAA1/B,MAGAy1H,IAAA,SAAAlvH,EAAA8W,GACA,IAAArgB,EAAAgD,KAAAhD,IAAAgD,KAAAhD,EAAA,IACAu3J,EAAAv3J,EAAAuJ,GACAiuJ,EAAA,GAEA,GAAAD,GAAAl3I,EACA,IAAA,IAAAjgB,EAAA,EAAA6L,EAAAsrJ,EAAAz2J,OAAAV,EAAA6L,EAAA7L,IACAm3J,EAAAn3J,GAAAm3C,KAAAl3B,GAAAk3I,EAAAn3J,GAAAm3C,GAAAv+B,IAAAqH,GACAm3I,EAAApnJ,KAAAmnJ,EAAAn3J,IAYA,OAJAo3J,EAAA,OACAx3J,EAAAuJ,GAAAiuJ,SACAx3J,EAAAuJ,GAEAvG,OAIAhC,EAAAJ,QAAAmG,EACA/F,EAAAJ,QAAA62J,YAAA1wJ,4BC3DA,aAEA,IAAA9F,EAAAyvD,EAAAzvD,EAaA+B,KAbA0tD,EAaA,WAEA,SAAAy9B,IACA,OAAA,EAGA,SAAAupE,KACA,OAAA,EAGA,SAAApoF,MA60CA,OAzyCA,SAAAvxC,IAEA,IAAA45H,EAAA,CACA,CAAApuJ,KAAA,SAAAmN,KAAA,SAAAvV,GAAA,MAAA,iBAAAA,IACA,CAAAoI,KAAA,SAAAmN,KAAA,SAAAvV,GAAA,MAAA,iBAAAA,IACA,CAAAoI,KAAA,UAAAmN,KAAA,SAAAvV,GAAA,MAAA,kBAAAA,IACA,CAAAoI,KAAA,WAAAmN,KAAA,SAAAvV,GAAA,MAAA,mBAAAA,IACA,CAAAoI,KAAA,QAAAmN,KAAAyJ,MAAA2gB,SACA,CAAAv3B,KAAA,OAAAmN,KAAA,SAAAvV,GAAA,OAAAA,aAAAghB,OACA,CAAA5Y,KAAA,SAAAmN,KAAA,SAAAvV,GAAA,OAAAA,aAAA6jB,SACA,CAAAzb,KAAA,SAAAmN,KAAA,SAAAvV,GACA,MAAA,iBAAAA,GAAAA,EAAA+J,cAAAhE,SAEA,CAAAqC,KAAA,OAAAmN,KAAA,SAAAvV,GAAA,OAAA,OAAAA,IACA,CAAAoI,KAAA,YAAAmN,KAAA,SAAAvV,GAAA,YAAAkB,IAAAlB,KAGAy2J,EAAA,CACAruJ,KAAA,MACAmN,KAAAy3E,GAIA0pE,EAAA,GAGAC,EAAA,GAGAxkG,EAAA,CACA7oC,MAAAktI,EACA//F,YAAAkgG,EACA9mG,OAAA6mG,GASA,SAAAE,EAAAC,GACA,IAAA51H,EAAA61H,GAAA3kG,EAAA7oC,MAAA,SAAA2X,GACA,OAAAA,EAAA74B,OAAAyuJ,IAGA,GAAA51H,EACA,OAAAA,EAGA,GAAA,QAAA41H,EACA,OAAAJ,EAGA,IAAAM,EAAAD,GAAA3kG,EAAA7oC,MAAA,SAAA2X,GACA,OAAAA,EAAA74B,KAAAsN,gBAAAmhJ,EAAAnhJ,gBAGA,MAAA,IAAA8lB,UAAA,iBAAAq7H,EAAA,KACAE,EAAA,mBAAAA,EAAA3uJ,KAAA,KAAA,KAQA,SAAA4uJ,EAAA99G,GACA,OAAAA,IAAAu9G,EACA,IAGAtkG,EAAA7oC,MAAA3f,QAAAuvC,GASA,SAAA+9G,EAAAhxJ,GACA,IAAAg7B,EAAA61H,GAAA3kG,EAAA7oC,MAAA,SAAA2X,GACA,OAAAA,EAAA1rB,KAAAtP,KAGA,GAAAg7B,EACA,OAAAA,EAAA74B,KAGA,MAAA,IAAAozB,UAAA,kCAAAv1B,GA+EA,SAAAixJ,EAAArwF,GACA,OAAAA,EACA5sC,IAAA,SAAAyrC,GACA,IAAAyxF,EAAAzxF,EAAAp8C,MAAA2Q,IAAAm9H,GAEA,OAAA1xF,EAAA2xF,UAAA,MAAA,IAAAF,EAAA5vI,KAAA,OAEAA,KAAA,KASA,SAAA+vI,EAAA5xF,EAAAjP,GACA,IAAA4gG,EAAA,IAAA3xF,EAAA/7D,QAAA,OAOAwtJ,GANAE,EAEA,EAAA3xF,EAAA/lE,OACA+lE,EAAAh6D,MAAA,GACA,MAHAg6D,GAKA7kD,MAAA,KAAAoZ,IAAAsyB,IACAlI,OAAAkzG,GACAlzG,OAAAmzG,GAEAC,EA+cA,SAAAhhG,EAAA0gG,GACA,IAAAjyG,EAAA,GAUA,OARAuR,EAAAt9C,QAAA,SAAAu+I,IACA,IAAAP,EAAAxtJ,QAAA+tJ,EAAAhhG,QACA,IAAAygG,EAAAxtJ,QAAA+tJ,EAAA/gG,KACAzR,EAAAwyG,EAAAhhG,QACAxR,EAAAwyG,EAAAhhG,MAAAghG,KAIA3xJ,OAAAiT,KAAAksC,GAAAjrB,IAAA,SAAAy8B,GACA,OAAAxR,EAAAwR,KA3dAihG,CAAAlhG,EAAA0gG,GAEAS,EAAAT,EAAAl9H,IAAA,SAAA48H,GACA,IAAA39G,EAAA09G,EAAAC,GAEA,MAAA,CACAzuJ,KAAAyuJ,EACAgB,UAAAb,EAAA99G,GACA3jC,KAAA2jC,EAAA3jC,KACAmiJ,WAAA,KACAI,iBAAA,KAIAC,EAAAN,EAAAx9H,IAAA,SAAAy9H,GACA,IAAAx+G,EAAA09G,EAAAc,EAAAhhG,MAEA,MAAA,CACAtuD,KAAAsvJ,EAAAhhG,KACAmhG,UAAAb,EAAA99G,GACA3jC,KAAA2jC,EAAA3jC,KACAmiJ,WAAAA,EACAI,gBAAArhG,EAAA9sD,QAAA+tJ,MAIA,MAAA,CACApuI,MAAAsuI,EAAAn0G,OAAAs0G,GACAV,UAAAA,GAgDA,SAAAW,EAAAnxF,GACA,IAAAnB,EAAA97B,EAAAi9B,GACA,QAAAnB,GAAAA,EAAA2xF,UASA,SAAAY,EAAAvyF,GACA,OAAAA,EAAAp8C,MAAAyhC,KAAA,SAAA7R,GACA,OAAA,MAAAA,EAAAw+G,aAUA,SAAAQ,EAAAxyF,GACA,GAAAA,GAAA,IAAAA,EAAAp8C,MAAA3pB,OAIA,CAAA,GAAA,IAAA+lE,EAAAp8C,MAAA3pB,OACA,OAAAi3J,EAAAlxF,EAAAp8C,MAAA,GAAAlhB,MAAAmN,KAEA,GAAA,IAAAmwD,EAAAp8C,MAAA3pB,OAAA,CACA,IAAAw4J,EAAAvB,EAAAlxF,EAAAp8C,MAAA,GAAAlhB,MAAAmN,KACA6iJ,EAAAxB,EAAAlxF,EAAAp8C,MAAA,GAAAlhB,MAAAmN,KACA,OAAA,SAAAvV,GACA,OAAAm4J,EAAAn4J,IAAAo4J,EAAAp4J,IAIA,IAAAq4J,EAAA3yF,EAAAp8C,MAAA2Q,IAAA,SAAAif,GACA,OAAA09G,EAAA19G,EAAA9wC,MAAAmN,OAEA,OAAA,SAAAvV,GACA,IAAA,IAAAf,EAAA,EAAAA,EAAAo5J,EAAA14J,OAAAV,IACA,GAAAo5J,EAAAp5J,GAAAe,GACA,OAAA,EAGA,OAAA,GAtBA,OAAAgtF,EAgCA,SAAAsrE,EAAAzxF,GACA,IAAAwxF,EAAAF,EAAAC,EAEA,GAAAJ,EAAAnxF,GAAA,CAGA,IAAA0xF,GADAF,EAovBA,SAAA5uJ,GACA,OAAAA,EAAAiC,MAAA,EAAAjC,EAAA9J,OAAA,GArvBAolD,CAAA8hB,GAAA5sC,IAAAi+H,IACAv4J,OACA64J,EAAAN,EAAAtuH,EAAAi9B,IAUA,OAAA,SAAApzD,GACA,IAAA,IAAAxU,EAAA,EAAAA,EAAAo5J,EAAA14J,OAAAV,IACA,IAAAo5J,EAAAp5J,GAAAwU,EAAAxU,IACA,OAAA,EAGA,OAfA,SAAAwU,GACA,IAAA,IAAAxU,EAAAs5J,EAAAt5J,EAAAwU,EAAA9T,OAAAV,IACA,IAAAu5J,EAAA/kJ,EAAAxU,IACA,OAAA,EAGA,OAAA,EASAw5J,CAAAhlJ,IAAAA,EAAA9T,QAAA44J,EAAA,GAKA,OAAA,IAAA1xF,EAAAlnE,OACA,SAAA8T,GACA,OAAA,IAAAA,EAAA9T,QAGA,IAAAknE,EAAAlnE,QACAw4J,EAAAD,EAAArxF,EAAA,IACA,SAAApzD,GACA,OAAA0kJ,EAAA1kJ,EAAA,KAAA,IAAAA,EAAA9T,SAGA,IAAAknE,EAAAlnE,QACAw4J,EAAAD,EAAArxF,EAAA,IACAuxF,EAAAF,EAAArxF,EAAA,IACA,SAAApzD,GACA,OAAA0kJ,EAAA1kJ,EAAA,KAAA2kJ,EAAA3kJ,EAAA,KAAA,IAAAA,EAAA9T,UAIA04J,EAAAxxF,EAAA5sC,IAAAi+H,GACA,SAAAzkJ,GACA,IAAA,IAAAxU,EAAA,EAAAA,EAAAo5J,EAAA14J,OAAAV,IACA,IAAAo5J,EAAAp5J,GAAAwU,EAAAxU,IACA,OAAA,EAGA,OAAAwU,EAAA9T,SAAA04J,EAAA14J,SAcA,SAAA+4J,EAAA1xF,EAAA5tD,GACA,OAAAA,EAAA4tD,EAAAH,OAAAlnE,OACAqnE,EAAAH,OAAAztD,GACA4+I,EAAAhxF,EAAAH,QACAj9B,EAAAo9B,EAAAH,QACA,KAUA,SAAA8xF,EAAA3xF,EAAA5tD,EAAAw/I,GACA,IAAAlzF,EAAAgzF,EAAA1xF,EAAA5tD,GAOA,OANAssD,EACAkzF,EACAlzF,EAAAp8C,MAAA+6B,OAAAw0G,GACAnzF,EAAAp8C,MACA,IAEA2Q,IAAAm9H,GAQA,SAAAA,EAAAl+G,GACA,OAAAA,EAAA9wC,KAQA,SAAAywJ,EAAA3/G,GACA,OAAA,OAAAA,EAAAw+G,iBAAAx2J,IAAAg4C,EAAAw+G,WAUA,SAAAoB,EAAA/kG,EAAA36C,GACA,IAAA+9I,EAwsBA,SAAA1tJ,GAEA,IADA,IAAAs3B,EAAA,GACA9hC,EAAA,EAAAA,EAAAwK,EAAA9J,OAAAV,IACA8hC,EAAAt3B,EAAAxK,KAAA,EAEA,OAAA8G,OAAAiT,KAAA+nB,GA7sBA+lB,CAAAxC,GAAAyP,EAAA,SAAAiT,GACA,OAAA2xF,EAAA3xF,EAAA5tD,GAAA,MAGA,OAAA,IAAA+9I,EAAAxtJ,QAAA,OAAA,CAAA,OAAAwtJ,EA+FA,SAAA4B,EAAArzF,GAGA,IAFA,IAAA78D,EAAA,IAEA5J,EAAA,EAAAA,EAAAymE,EAAAp8C,MAAA3pB,OAAAV,IACA45J,EAAAnzF,EAAAp8C,MAAArqB,MACA4J,EAAA5I,KAAA4I,IAAAA,EAAA68D,EAAAp8C,MAAArqB,GAAA44J,YAIA,OAAAhvJ,EASA,SAAAmwJ,EAAAtzF,GAGA,IAFA,IAAA78D,EAAA,IAEA5J,EAAA,EAAAA,EAAAymE,EAAAp8C,MAAA3pB,OAAAV,IACA45J,EAAAnzF,EAAAp8C,MAAArqB,MACA4J,EAAA5I,KAAA4I,IAAAA,EAAA68D,EAAAp8C,MAAArqB,GAAA64J,kBAIA,OAAAjvJ,EA4CA,SAAAowJ,EAAAC,EAAAC,GACA,IACAl6J,EACAE,EApCAi6J,EAAAC,EACAl6J,EAiCA2L,EAAA7K,KAAA4I,IAAAqwJ,EAAAryF,OAAAlnE,OAAAw5J,EAAAtyF,OAAAlnE,QAMA,GAAA,IADAR,EAAA+5J,EAAAryF,OAAA9b,KAAAktG,GAAAkB,EAAAtyF,OAAA9b,KAAAktG,IAEA,OAAA94J,EAIA,IAAAF,EAAA,EAAAA,EAAA6L,EAAA7L,IAEA,GAAA,IADAE,EAAA84J,EAAAiB,EAAAryF,OAAA5nE,IAAAg5J,EAAAkB,EAAAtyF,OAAA5nE,KAEA,OAAAE,EAKA,IAAAF,EAAA,EAAAA,EAAA6L,EAAA7L,IAEA,GAvDAm6J,EAsDAF,EAAAryF,OAAA5nE,GAtDAo6J,EAsDAF,EAAAtyF,OAAA5nE,GArDAE,OAAAA,EAsDA,KADAA,EAjDA,IADAA,EAAAi6J,EAAA/B,UAAAgC,EAAAhC,WAEAl4J,EAKA,IADAA,EAAA84J,EAAAmB,GAAAnB,EAAAoB,IAEAl6J,EAKA,IADAA,EAAA45J,EAAAK,GAAAL,EAAAM,IAEAl6J,EAIA65J,EAAAI,GAAAJ,EAAAK,IAkCA,OAAAl6J,EAKA,OAAA+5J,EAAAryF,OAAAlnE,OAAAw5J,EAAAtyF,OAAAlnE,OA6EA,SAAA25J,EAAA5zF,GACA,IAAAyyF,EAAAC,EAAAmB,EAAAC,EACAnB,EAAA,GACA5hG,EAAA,GAUA,OARAiP,EAAAp8C,MAAAnQ,QAAA,SAAA+/B,GACAA,EAAAw+G,aACAW,EAAAppJ,KAAA2nJ,EAAA19G,EAAAw+G,WAAAhhG,MAAAnhD,MACAkhD,EAAAxnD,KAAAiqC,EAAAw+G,WAAAjtH,YAKAgsB,EAAA92D,QACA,KAAA,EACA,OAAA,SAAA2C,GACA,OAAAA,GAGA,KAAA,EAGA,OAFA61J,EAAAE,EAAA,GACAkB,EAAA9iG,EAAA,GACA,SAAAn0D,GACA,OAAA61J,EAAA71J,GACAi3J,EAAAj3J,GAEAA,GAGA,KAAA,EAKA,OAJA61J,EAAAE,EAAA,GACAD,EAAAC,EAAA,GACAkB,EAAA9iG,EAAA,GACA+iG,EAAA/iG,EAAA,GACA,SAAAn0D,GACA,OAAA61J,EAAA71J,GACAi3J,EAAAj3J,GAEA81J,EAAA91J,GACAk3J,EAAAl3J,GAEAA,GAGA,QACA,OAAA,SAAAA,GACA,IAAA,IAAArD,EAAA,EAAAA,EAAAw3D,EAAA92D,OAAAV,IACA,GAAAo5J,EAAAp5J,GAAAqD,GACA,OAAAm0D,EAAAx3D,GAAAqD,GAGA,OAAAA,IA+CA,SAAAm3J,GAAA5yF,EAAA6yF,GA4CA,OA3CA,SAAAC,EAAA9yF,EAAAztD,EAAAkQ,GACA,GAAAlQ,EAAAytD,EAAAlnE,OAAA,CACA,IAIAi6J,EAJAl0F,EAAAmB,EAAAztD,GACAygJ,EAAAH,EACAh0F,EAAAp8C,MAAA+6B,OAAAw0G,GACAnzF,EAAAp8C,MAGA,GAAAo8C,EAAA2xF,UAAA,CAGA,IAAAO,EAAAiC,EAAAx1G,OAAAw0G,GACAe,EAAAhC,EAAAj4J,OAAAk6J,EAAAl6J,OACA,CAAAi4J,EAAAiC,GACA,CAAAA,QAKAD,EAAAC,EAAA5/H,IAAA,SAAAif,GACA,MAAA,CAAAA,KAKA,OAAAoL,GAAAs1G,EAAA,SAAAE,GACA,OAAAH,EAAA9yF,EAAAztD,EAAA,EAAAkQ,EAAAm6B,OAAA,CAAAq2G,OAaA,MAAA,CAPAxwI,EAAA2Q,IAAA,SAAAif,EAAA2+G,GACA,MAAA,CACAvuI,MAAA4vB,EACAm+G,UAAAQ,IAAAhxF,EAAAlnE,OAAA,GAAAq4J,EAAAnxF,OAQA8yF,CAAA9yF,EAAA,EAAA,IAyCA,SAAAkzF,EAAA3xJ,EAAA4xJ,GACA,GAAA,IAAAj0J,OAAAiT,KAAAghJ,GAAAr6J,OACA,MAAA,IAAAU,YAAA,0BAIA,IAAA45J,EAAA,GACAl0J,OAAAiT,KAAAghJ,GACA//H,IAAA,SAAA+sC,GACA,OAzqBA,SAAAA,EAAA5wB,EAAAqgB,GACA,IAAAoQ,EAAA,GAkBA,MAhBA,KAAAG,EAAAza,SACAsa,EAAAG,EACAnmD,MAAA,KACAoZ,IAAAsyB,IACAtyB,IAAA,SAAAyrC,EAAAtsD,EAAAmR,GACA,IAAA2vI,EAAA5C,EAAA5xF,EAAAjP,GAEA,GAAAyjG,EAAA7C,WAAAj+I,IAAAmR,EAAA5qB,OAAA,EACA,MAAA,IAAAU,YAAA,8BAAAqlE,EAAA,0CAIA,OAAAw0F,KAIArzF,EAAA9b,KAAAovG,IAGA,KAGA,CACAtzF,OAAAA,EACAzwB,GAAAA,GA8oBAgkH,CAAApzF,EAAAgzF,EAAAhzF,GAAA7U,EAAAsE,eAEApS,OAAAg2G,IACAlhJ,QAAA,SAAAmhJ,GAEA,IAAAC,EAAAzD,GAAAmD,EAAA,SAAAjwJ,GACA,OA/CA,SAAAkvJ,EAAAC,GAGA,IAFA,IAAAtgF,EAAA54E,KAAA6I,IAAAowJ,EAAAryF,OAAAlnE,OAAAw5J,EAAAtyF,OAAAlnE,QAEAV,EAAA,EAAAA,EAAA45E,EAAA55E,IAIA,IAAAu7J,GAHA7B,EAAAO,EAAAj6J,GAAA,GACA05J,EAAAQ,EAAAl6J,GAAA,IAGA,OAAA,EAIA,IAAAw7J,EAAAvB,EAAAryF,OAAAlnE,OACA+6J,EAAAvB,EAAAtyF,OAAAlnE,OACAg7J,EAAA3C,EAAAkB,EAAAryF,QACA+zF,EAAA5C,EAAAmB,EAAAtyF,QAEA,OAAA8zF,EACAC,EAAAH,IAAAC,EAAAD,GAAAC,EACAE,EAAAF,GAAAD,EAAAA,IAAAC,EA4BAG,CAAA7wJ,EAAAswJ,KAEA,GAAAC,EACA,MAAA,IAAA/+H,UAAA,2BACA07H,EAAAqD,EAAA1zF,QAAA,UACAqwF,EAAAoD,EAAAzzF,QAAA,MAGAozF,EAAAhrJ,KAAAqrJ,KAIA,IAAAvmG,EAAAzP,GAAA21G,EAAA,SAAAK,GAGA,OAFAA,EAAAb,GAAAa,EAAAzzF,QAAA,GAAA,IAEA5sC,IAAA,SAAA4sC,GACA,MAAA,CACAA,OAAAA,EACAzwB,GAAAkkH,EAAAlkH,QAGAiO,OAAAg2G,IAEAtmG,EAAA7lB,KAAA+qH,GAGA,IAAA6B,EAAA/mG,EAAA,IAAAA,EAAA,GAAA8S,OAAAlnE,QAAA,IAAAq4J,EAAAjkG,EAAA,GAAA8S,QACAk0F,EAAAhnG,EAAA,IAAAA,EAAA,GAAA8S,OAAAlnE,QAAA,IAAAq4J,EAAAjkG,EAAA,GAAA8S,QACAm0F,EAAAjnG,EAAA,IAAAA,EAAA,GAAA8S,OAAAlnE,QAAA,IAAAq4J,EAAAjkG,EAAA,GAAA8S,QACAo0F,EAAAlnG,EAAA,IAAAA,EAAA,GAAA8S,OAAAlnE,QAAA,IAAAq4J,EAAAjkG,EAAA,GAAA8S,QACAq0F,EAAAnnG,EAAA,IAAAA,EAAA,GAAA8S,OAAAlnE,QAAA,IAAAq4J,EAAAjkG,EAAA,GAAA8S,QACAs0F,EAAApnG,EAAA,IAAAA,EAAA,GAAA8S,OAAAlnE,QAAA,IAAAq4J,EAAAjkG,EAAA,GAAA8S,QACAu0F,EAAAN,GAAAC,GAAAC,GAAAC,GAAAC,GAAAC,EAGA9C,EAAAtkG,EAAA95B,IAAA,SAAA+sC,GACA,OAAAsxF,EAAAtxF,EAAAH,UAGAw0F,EAAAP,EAAA5C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACA+E,EAAAP,EAAA7C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAgF,EAAAP,EAAA9C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAiF,EAAAP,EAAA/C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAkF,EAAAP,EAAAhD,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAmF,EAAAP,EAAAjD,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GAEAoF,EAAAb,EAAA5C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAqF,EAAAb,EAAA7C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAsF,EAAAb,EAAA9C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAuF,EAAAb,EAAA/C,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAwF,EAAAb,EAAAhD,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GACAyF,EAAAb,EAAAjD,EAAAnkG,EAAA,GAAA8S,OAAA,IAAA0vF,GAGA0F,EAAAloG,EAAA95B,IAAA,SAAA+sC,GACA,OAvSA,SAAAH,EAAAzwB,GACA,IAAA8lH,EAAA9lH,EAIA,GAAAywB,EAAA9b,KAAAktG,GAAA,CACA,IAAAZ,EAAAW,EAAAnxF,GACAs1F,EAAAt1F,EAAA5sC,IAAAq/H,GAEA4C,EAAA,WAGA,IAFA,IAAAzoJ,EAAA,GACAm2B,EAAAytH,EAAAriJ,UAAArV,OAAA,EAAAqV,UAAArV,OACAV,EAAA,EAAAA,EAAA2qC,EAAA3qC,IACAwU,EAAAxU,GAAAk9J,EAAAl9J,GAAA+V,UAAA/V,IAMA,OAJAo4J,IACA5jJ,EAAAm2B,GAAA50B,UAAA40B,GAAA3P,IAAAkiI,EAAAvyH,KAGAwM,EAAA78B,MAAA,KAAA9F,IAIA,IAAA2oJ,EAAAF,EACA,GAAAlE,EAAAnxF,GAAA,CACA,IAAAr7C,EAAAq7C,EAAAlnE,OAAA,EAEAy8J,EAAA,WACA,OAAAF,EAAA3iJ,MAAA,KACA7N,GAAAsJ,UAAA,EAAAwW,GAAAi4B,OAAA,CAAA/3C,GAAAsJ,UAAAwW,OAIA,OAAA4wI,EAsQAC,CAAAr1F,EAAAH,OAAAG,EAAA5wB,MAGAkmH,EAAAxB,EAAAmB,EAAA,GAAA9tF,GACAouF,EAAAxB,EAAAkB,EAAA,GAAA9tF,GACAquF,EAAAxB,EAAAiB,EAAA,GAAA9tF,GACAsuF,EAAAxB,EAAAgB,EAAA,GAAA9tF,GACAuuF,EAAAxB,EAAAe,EAAA,GAAA9tF,GACAwuF,EAAAxB,EAAAc,EAAA,GAAA9tF,GAEAyuF,EAAA9B,EAAA/mG,EAAA,GAAA8S,OAAAlnE,QAAA,EACA86J,EAAAM,EAAAhnG,EAAA,GAAA8S,OAAAlnE,QAAA,EACA+6J,EAAAM,EAAAjnG,EAAA,GAAA8S,OAAAlnE,QAAA,EACAk9J,EAAA5B,EAAAlnG,EAAA,GAAA8S,OAAAlnE,QAAA,EACAm9J,EAAA5B,EAAAnnG,EAAA,GAAA8S,OAAAlnE,QAAA,EACAo9J,EAAA5B,EAAApnG,EAAA,GAAA8S,OAAAlnE,QAAA,EAGAq9J,EAAA5B,EAAA,EAAA,EACA6B,EAAAlpG,EAAAp0D,OACAu9J,EAAA,WAGA,IAAA,IAAAj+J,EAAA+9J,EAAA/9J,EAAAg+J,EAAAh+J,IACA,GAAAo5J,EAAAp5J,GAAA+V,WACA,OAAAinJ,EAAAh9J,GAAAsa,MAAA,KAAAvE,WAIA,MA9hBA,SAAA5M,EAAAqL,EAAAsgD,GACA,IAAA8C,EAAAK,EAKA99C,EAJA+jJ,EAAA/0J,GAAA,UAGAg1J,EAAArpG,EAEA,IAAA36C,EAAA,EAAAA,EAAA3F,EAAA9T,OAAAyZ,IAAA,CACA,IAAAikJ,EAAAD,EAAA/4G,OAAA,SAAA2iB,GACA,IAAAzxD,EAAA2iJ,EAAAQ,EAAA1xF,EAAA5tD,IACA,OAAAA,EAAA4tD,EAAAH,OAAAlnE,QAAAq4J,EAAAhxF,EAAAH,UACAtxD,EAAA9B,EAAA2F,MAGA,GAAA,IAAAikJ,EAAA19J,QAGA,GAAA,GADAu3D,EAAA4hG,EAAAsE,EAAAhkJ,IACAzZ,OAAA,CACA,IAAA29J,EAAArG,EAAAxjJ,EAAA2F,IAYA,OAVAy9C,EAAA,IAAAr7B,UAAA,2CAAA2hI,EACA,eAAAjmG,EAAA3vC,KAAA,QACA,aAAA+1I,EAAA,YAAAlkJ,EAAA,MACAmoB,KAAA,CACAq2B,SAAA,YACAxhB,GAAA+mH,EACA/jJ,MAAAA,EACA69C,OAAAqmG,EACApmG,SAAAA,GAEAL,QAIAumG,EAAAC,EAKA,IAAAE,EAAAH,EAAAnjI,IAAA,SAAA+sC,GACA,OAAAgxF,EAAAhxF,EAAAH,QAAAnjE,EAAAA,EAAAsjE,EAAAH,OAAAlnE,SAEA,GAAA8T,EAAA9T,OAAAM,KAAA4I,IAAA0Q,MAAA,KAAAgkJ,GAWA,OAVArmG,EAAA4hG,EAAAsE,EAAAhkJ,IACAy9C,EAAA,IAAAr7B,UAAA,iCAAA2hI,EACA,eAAAjmG,EAAA3vC,KAAA,QACA,YAAA9T,EAAA9T,OAAA,MACA4hC,KAAA,CACAq2B,SAAA,aACAxhB,GAAA+mH,EACA/jJ,MAAA3F,EAAA9T,OACAu3D,SAAAA,GAEAL,EAIA,IAAArtB,EAAAvpC,KAAA6I,IAAAyQ,MAAA,KAAAgkJ,GACA,OAAA9pJ,EAAA9T,OAAA6pC,GACAqtB,EAAA,IAAAr7B,UAAA,kCAAA2hI,EACA,eAAA3zH,EAAA,aAAA/1B,EAAA9T,OAAA,MACA4hC,KAAA,CACAq2B,SAAA,cACAxhB,GAAA+mH,EACA/jJ,MAAA3F,EAAA9T,OACA69J,eAAAh0H,IAKAqtB,EAAA,IAAAr7B,UAAA,sBAAA/nB,EAAA8T,KAAA,MACA,4DAAA41I,EAAA,MACA57H,KAAA,CACAq2B,SAAA,WACAX,OAAAxjD,EAAAwmB,IAAAg9H,IAPApgG,EA2dAx9C,CAAAjR,EAAA4M,UAAA++C,IAKA3d,EAAA,SAAAipC,EAAAF,GAGA,OAAAnqE,UAAArV,SAAAi9J,GAAAvB,EAAAh8E,IAAAs8E,EAAAx8E,GAAAm9E,EAAA/iJ,MAAA,KAAAvE,WACAA,UAAArV,SAAA86J,GAAAa,EAAAj8E,IAAAu8E,EAAAz8E,GAAAo9E,EAAAhjJ,MAAA,KAAAvE,WACAA,UAAArV,SAAA+6J,GAAAa,EAAAl8E,IAAAw8E,EAAA18E,GAAAq9E,EAAAjjJ,MAAA,KAAAvE,WACAA,UAAArV,SAAAk9J,GAAArB,EAAAn8E,IAAAy8E,EAAA38E,GAAAs9E,EAAAljJ,MAAA,KAAAvE,WACAA,UAAArV,SAAAm9J,GAAArB,EAAAp8E,IAAA08E,EAAA58E,GAAAu9E,EAAAnjJ,MAAA,KAAAvE,WACAA,UAAArV,SAAAo9J,GAAArB,EAAAr8E,IAAA28E,EAAA78E,GAAAw9E,EAAApjJ,MAAA,KAAAvE,WAEAkoJ,EAAA3jJ,MAAA,KAAAvE,YAIA,IACAjP,OAAAC,eAAAowC,EAAA,OAAA,CAAAnwC,MAAAmC,IAEA,MAAAyuD,IASA,OAFAzgB,EAAA2d,WApPA,SAAAA,GACA,IAAAimG,EAAA,GASA,OARAjmG,EAAA56C,QAAA,SAAA6tD,GACAA,EAAAH,OAAA9b,KAAAktG,IACAwB,GAAAzyF,EAAAH,QAAA,GAAA1tD,QAAA,SAAA0tD,GACAmzF,EAAA9C,EAAArwF,IAAAG,EAAA5wB,OAKA4jH,EA0OAyD,CAAA1pG,GAEA3d,EAQA,SAAAohH,EAAAX,GACA,OAAA,IAAA1kG,EAAAtC,OAAAlmD,QAAAktJ,GAQA,SAAAtqG,GAAA9jD,GACA,OAAAA,EAAA8jD,OAQA,SAAAgrG,EAAA9uJ,GACA,QAAAA,EAQA,SAAA4xJ,GAAAp0J,GACA,OAAA,OAAAA,EAQA,SAAAk0J,GAAAz0F,GACA,OAAA,IAAAA,EAAAp8C,MAAA3pB,OAiBA,SAAAiqC,EAAAngC,GACA,OAAAA,EAAAA,EAAA9J,OAAA,GAUA,SAAA+L,GAAAjC,EAAA2lC,EAAAW,GACA,OAAA/wB,MAAAld,UAAA4J,MAAAhM,KAAA+J,EAAA2lC,EAAAW,GAmBA,SAAAyqH,GAAAkD,EAAAC,GACA,IAAA,IAAA1+J,EAAA,EAAAA,EAAAy+J,EAAA/9J,OAAAV,IACA,GAZAsrB,EAYAozI,EAZAhrG,EAYA+qG,EAAAz+J,IAXA,IAAAsrB,EAAA5gB,QAAAgpD,GAYA,OAAA,EAbA,IAAApoC,EAAAooC,EAiBA,OAAA,EAUA,SAAAmkG,GAAArtJ,EAAA8L,GACA,IAAA,IAAAtW,EAAA,EAAAA,EAAAwK,EAAA9J,OAAAV,IACA,GAAAsW,EAAA9L,EAAAxK,IACA,OAAAwK,EAAAxK,GA0BA,SAAAqlD,GAAA76C,EAAAyV,GACA,OAAAF,MAAAld,UAAA2hD,OAAAlqC,MAAA,GAAA9P,EAAAwwB,IAAA/a,IAQA,SAAA0+I,EAAA3B,GAGA,IAFA,IAAA7zJ,EAAA,GAEAnJ,EAAA,EAAAA,EAAAg9J,EAAAt8J,OAAAV,IAAA,CACA,IAAAm3C,EAAA6lH,EAAAh9J,GAGA,IAAA,iBAAAm3C,EAAA2d,YAAA,iBAAA3d,EAAA4wB,YAAA,KAAA5wB,EAAAhuC,KACA,GAAA,KAAAA,EACAA,EAAAguC,EAAAhuC,UAEA,GAAAA,IAAAguC,EAAAhuC,KAAA,CACA,IAAAyuD,EAAA,IAAAv3D,MAAA,0CAAA8I,EAAA,aAAAguC,EAAAhuC,KAAA,KAKA,MAJAyuD,EAAAt1B,KAAA,CACA01B,OAAA7gB,EAAAhuC,KACA8uD,SAAA9uD,GAEAyuD,GAKA,OAAAzuD,EAIA,SAAAy1J,EAAA5B,GACA,IAAAplG,EACAmjG,EAAA,GAEA,SAAA8D,EAAAC,EAAAC,GACA,GAAAhE,EAAAzjJ,eAAAwnJ,IAAAC,IAAAhE,EAAA+D,GAGA,MAFAlnG,EAAA,IAAAv3D,MAAA,cAAAy+J,EAAA,uBACAx8H,KAAA,CAAAylC,UAAA+2F,GACAlnG,EAKA,IAAA,IAAA53D,EAAA,EAAAA,EAAAg9J,EAAAt8J,OAAAV,IAAA,CACA,IAAAm3C,EAAA6lH,EAAAh9J,GAGA,GAAA,iBAAAm3C,EAAA2d,WAEA,IAAA,IAAAiT,KAAA5wB,EAAA2d,WACA3d,EAAA2d,WAAAx9C,eAAAywD,KACA82F,EAAA92F,EAAA5wB,EAAA2d,WAAAiT,IACAgzF,EAAAhzF,GAAA5wB,EAAA2d,WAAAiT,QAIA,CAAA,GAAA,iBAAA5wB,EAAA4wB,UAOA,MAFAnQ,EAAA,IAAAr7B,UAAA,yCAAAv8B,EAAA,MACAsiC,KAAA,CAAAnoB,MAAAna,GACA43D,EANAinG,EAAA1nH,EAAA4wB,UAAA5wB,GACA4jH,EAAA5jH,EAAA4wB,WAAA5wB,GASA,OAAA4jH,EAoEA,OAjEA7nG,EAAA4nG,EAAA,QAAA,CACAn3F,iBAAAm3F,EACAh0J,OAAA,SAAAi0J,GAEA,IAAAiC,EAAA,GACA,IAAA,IAAAj1F,KAAAgzF,EACAA,EAAAzjJ,eAAAywD,IACAi1F,EAAAhtJ,KAAA+qJ,EAAAhzF,IAIA,OAAA+yF,EADA6D,EAAA3B,GACAjC,IAEAiE,cAAA,SAAAhC,GACA,OAAAlC,EAAA6D,EAAA3B,GAAA4B,EAAA5B,KAEAiC,sBAAA,SAAA91J,EAAA6zJ,GACA,OAAAlC,EAAA3xJ,EAAAy1J,EAAA5B,QAIAr/H,OAAAA,EACAu1B,EAAA7oC,MAAAktI,EACArkG,EAAAsE,YAAAkgG,EACAxkG,EAAAtC,OAAA6mG,EACAvkG,EAAA1nB,QA5mCA,SAAAxkC,EAAAizC,GACA,IAAAwd,EAAAugG,EAAAhxJ,GAGA,GAAAizC,IAAAwd,EACA,OAAAzwD,EAGA,IAAA,IAAAhH,EAAA,EAAAA,EAAAkzD,EAAAsE,YAAA92D,OAAAV,IAAA,CACA,IAAAy4J,EAAAvlG,EAAAsE,YAAAx3D,GACA,GAAAy4J,EAAAhhG,OAAAA,GAAAghG,EAAA/gG,KAAAzd,EACA,OAAAw+G,EAAAjtH,QAAAxkC,GAIA,MAAA,IAAA3G,MAAA,uBAAAo3D,EAAA,OAAAxd,IA8lCAiZ,EAAA3V,KAnpCA,SAAApG,EAAA4wB,GACA,IAAA5wB,EAAA2d,WACA,MAAA,IAAAv4B,UAAA,iCAIA,IAAA/xB,EACA,GAAA,iBAAAu9D,EAAA,CACAv9D,EAAAu9D,EAAAnmD,MAAA,KACA,IAAA,IAAA5hB,EAAA,EAAAA,EAAAwK,EAAA9J,OAAAV,IACAwK,EAAAxK,GAAAwK,EAAAxK,GAAAstD,WAGA,CAAA,IAAAvtC,MAAA2gB,QAAAqnC,GAIA,MAAA,IAAAxrC,UAAA,qDAHA/xB,EAAAu9D,EAMA,IAAAv+D,EAAAgB,EAAA8d,KAAA,KAGA/lB,EAAA40C,EAAA2d,WAAAtrD,GACA,GAAAjH,EACA,OAAAA,EAKA,MAAA,IAAAg6B,UAAA,oCAAA4a,EAAAhuC,MAAA,WAAA,IAAAqB,EAAA8d,KAAA,MAAA,OA+nCA4qC,EAAAgsG,QAAA,SAAAjlH,EAAAklH,GACA,IAAAllH,GAAA,iBAAAA,EAAA9wC,MAAA,mBAAA8wC,EAAA3jC,KACA,MAAA,IAAAimB,UAAA,kEAGA,IAAA,IAAA4iI,EACA,IAAA,IAAAn/J,EAAA,EAAAA,EAAAkzD,EAAA7oC,MAAA3pB,OAAAV,IACA,GAAA,WAAAkzD,EAAA7oC,MAAArqB,GAAAmJ,KAEA,YADA+pD,EAAA7oC,MAAAwT,OAAA79B,EAAA,EAAAi6C,GAMAiZ,EAAA7oC,MAAAra,KAAAiqC,IAIAiZ,EAAAksG,cAAA,SAAA3G,GACA,IAAAA,GACA,iBAAAA,EAAAhhG,MACA,iBAAAghG,EAAA/gG,IACA,mBAAA+gG,EAAAjtH,QACA,MAAA,IAAAjP,UAAA,iFAGA22B,EAAAsE,YAAAxnD,KAAAyoJ,IAGAvlG,EAGAv1B,IAn2CA,mBAAA92B,QAAAA,OAAA0Q,IAEA1Q,OAAA,GAAAypD,GACA,iBAAA9vD,EAIAI,EAAAJ,QAAA8vD,IAGAzvD,EAAAqyD,MAAA5C,oMCpBA,IAAAysE,EAAAr9H,EAAA,YACAwgI,EAAAxgI,EAAA,8LAEO,IAAMqoI,EAAiB,CAC1BC,OAAQ,SACRq3B,KAAM,OACNrzB,QAAS,UACTh4E,OAAQ,QACRi0E,QAAS,UACTC,kBAAmB,oBACnBo3B,UAAW,oCAGFx3B,aAYT,SAAAA,EAAY3+H,EAAMo2J,GAAqI,IAAlGC,EAAkG,EAAAzpJ,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAtF,EAAG0pJ,EAAmF,EAAA1pJ,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAvE,EAAGigI,EAAoE,EAAAjgI,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAA/C2pJ,EAA+C,EAAA3pJ,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAxB,KAAM4pJ,EAAkB,EAAA5pJ,UAAArV,aAAAuB,IAAA8T,UAAA,GAAAA,UAAA,GAAN,kGAAMqnH,CAAAx6H,KAAAklI,GAAAllI,KATvJw0I,iBAAmB,GASoIx0I,KANvJg9J,UAAW,EAOPh9J,KAAKuG,KAAOA,EACR4zH,EAAAS,MAAM98F,QAAQ6+H,IACd38J,KAAKq3C,KAAO8tF,EAAeu3B,UAC3B18J,KAAKw0I,iBAAmBmoB,GAExB38J,KAAKq3C,KAAOslH,EAEhB38J,KAAK+8J,UAAYA,EACjB/8J,KAAK88J,qBAAuBA,EAC5B98J,KAAKozI,YAAcA,EACnBpzI,KAAK48J,UAAYA,EACjB58J,KAAK68J,UAAYA,qFAGjBvnJ,EAAKwF,GAEL,OADA9a,KAAKsV,GAAOwF,EACL9a,sCAGFoE,EAAO64J,GAAW,IAAAnxF,EAAA9rE,KACnB89B,EAAUq8F,EAAAS,MAAM98F,QAAQ15B,GAE5B,QAAqB,EAAjBpE,KAAK68J,YAAkB/+H,KAItBA,IAID15B,EAAMtG,OAASkC,KAAK48J,WAAax4J,EAAMtG,OAASkC,KAAK68J,eAIpDz4J,EAAMmiD,MAAM,SAAA1zC,GAAC,OAAEi5D,EAAKoxF,oBAAoBrqJ,EAAGzO,QAI5CpE,KAAK+8J,WACE/8J,KAAK+8J,UAAU34J,EAAO64J,KAZtBj9J,KAAKk9J,oBAAoB94J,EAAO64J,gDAgC3B74J,EAAO64J,GAEvB,IAAM74J,GAAmB,IAAVA,IAAyB,IAAVA,GAAqC,EAAjBpE,KAAK48J,UACnD,OAAQ58J,KAAKg9J,SAGjB,GAAI73B,EAAeC,SAAWplI,KAAKq3C,OAAS8iF,EAAAS,MAAMh9E,SAASx5C,GACvD,OAAO,EAEX,GAAI+gI,EAAes3B,OAASz8J,KAAKq3C,OAAS8iF,EAAAS,MAAM9yG,OAAO1jB,GACnD,OAAO,EAEX,GAAI+gI,EAAeiE,UAAYppI,KAAKq3C,OAAS8iF,EAAAS,MAAMzuH,MAAM/H,GACrD,OAAO,EAEX,GAAI+gI,EAAe/zE,SAAWpxD,KAAKq3C,OAAS8iF,EAAAS,MAAMj9E,SAASv5C,GACvD,OAAO,EAGX,GAAI+gI,EAAeE,UAAYrlI,KAAKq3C,OAAS8iF,EAAAS,MAAM5zE,UAAU5iD,GACzD,OAAO,EAIX,GAAI+gI,EAAeG,oBAAsBtlI,KAAKq3C,MAE7B,QADbjzC,EAAQ8gI,EAAuBM,wBAAwBphI,IAEnD,OAAO,EAIf,GAAI+gI,EAAeu3B,YAAc18J,KAAKq3C,KAAM,CACxC,IAAK8iF,EAAAS,MAAMx8F,SAASh6B,GAChB,OAAO,EAEX,IAAKpE,KAAKw0I,iBAAiBjuF,MAAM,SAAC42G,EAAW//J,GAAZ,OAAgB+/J,EAAUhvD,SAAS/pG,EAAM+4J,EAAU52J,SAChF,OAAO,EAIf,OAAIvG,KAAK88J,sBACE98J,KAAK88J,qBAAqB14J,EAAO64J,iCAM1C1uD,GACF,OAAG42B,EAAeG,oBAAsBtlI,KAAKq3C,KAClC6tF,EAAuBM,wBAAwBj3B,GAGnDA,oDAlEoBzzF,GAC3B,IAAIqvI,EAASpqJ,WAAW+a,GACxB,OAAGqvI,IAAWtoJ,EAAAA,GAAYsoJ,KAAYtoJ,EAAAA,EAC3BsoJ,EAGP7sB,EAAAgB,iBAAiBnwB,SAASrzF,EAAK,IAAI,GAIhCwiH,EAAAgB,iBAAiBloE,KAAKt7C,GAAK,GAHvB,sPC9EnB,IAAAutI,EAAAvrJ,EAAA,wLAEaylI,aAIT,SAAAA,EAAY9xF,EAAI+3G,gGAAUhuB,CAAAx6H,KAAAuiI,GAAAviI,KAF1BwoJ,UAAY,GAGRxoJ,KAAKywC,GAAKA,EACVzwC,KAAKwoJ,UAAYA,GAAa,GAC9BxoJ,KAAKsV,IAAMitH,EAAO2W,YAAYl5I,iGAGtB2hE,EAAMghE,GACd,IAAIL,EAAW,IAAI+lB,EAAAN,SAASpmF,EAAMghE,GAGlC,OAFA3iI,KAAKwoJ,UAAWp7I,KAAKk1H,GACrBtiI,KAAKsV,IAAMitH,EAAO2W,YAAYl5I,MACvBsiI,iCASJJ,GAAsB,IAAdk7B,IAAc,EAAAjqJ,UAAArV,aAAAuB,IAAA8T,UAAA,KAAAA,UAAA,GACzB,OAAGnT,KAAKsV,KAAO4sH,EAAO5sH,MAIf8nJ,GAAYp9J,KAAKywC,KAAOyxF,EAAOzxF,wCAG9B00G,GACR,OAAO5iB,EAAOC,YAAYxiI,KAAMmlJ,4CAmCR,IAAb6C,EAAa,EAAA70I,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GACxB,OAAOovH,EAAOwE,eAAe/mI,KAAMgoJ,yCAnDpB9lB,GACf,IAAI5sH,EAAM,GAEV,OADA4sH,EAAOsmB,UAAUlxI,QAAQ,SAAA/W,GAAC,OAAE+U,IAAMA,EAAK,IAAK,IAAI/U,EAAE+U,MAC3CA,sCAeQ4sH,EAAQijB,GACvB,IAAI,IAAI/nJ,EAAE,EAAGA,EAAE8kI,EAAOsmB,UAAU1qJ,OAAQV,IAAI,CACxC,IAAIklI,EAAW+lB,EAAAN,SAASvlB,YAAYN,EAAOsmB,UAAUprJ,GAAI+nJ,GACzD,GAAG7iB,EACC,OAAOA,EAGf,OAAO,4CAGWJ,GAAwC,IAAhCziD,EAAgC,EAAAtsE,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAAhBkqJ,EAAgB,EAAAlqJ,UAAArV,aAAAuB,IAAA8T,UAAA,IAAAA,UAAA,GAEtD7Q,EAAM,GAaV,OAZA4/H,EAAOsmB,UAAUlxI,QAAQ,SAAA/W,GAClB+B,IAEKA,GADDm9E,EACQ,KAEA,MAKfn9E,GAAO+lJ,EAAAN,SAASE,iBAAiB1nJ,EAAGk/E,EAAU,OAAQ,QAEvD49E,QAAyBh+J,IAAZ6iI,EAAOzxF,GACZyxF,EAAOzxF,GAAG,IAAInuC,EAElBA,yNCjEf,IAAAg7H,EAAAxgI,EAAA,wBACAA,EAAA,sLAGaoiI,aAIT,SAAAA,EAAYo+B,gGAAoB9iC,CAAAx6H,KAAAk/H,GAAAl/H,KAFhCs9J,oBAAsB,KAGlBt9J,KAAKs9J,oBAAsBA,0FAGtBl5J,GACL,GAAGA,MAAAA,EACC,OAAO,EAIX,GADarE,WAAWqE,KACVvC,EAAAA,IAAay7H,EAAAgB,iBAAiBnwB,SAAS/pG,EAAO,IAAI,GAC5D,OAAO,EAGXA,EAAQk5H,EAAAgB,iBAAiBlvH,SAAShL,GAClC,IAAIwkJ,EAAiBtpJ,OAAOqgB,kBAAoB,iBAChD,QAAG29G,EAAAgB,iBAAiBtuH,QAAQ5L,EAAO,GAAK,GAAMA,IAAUvC,EAAAA,GAA6D,EAAjDy7H,EAAAgB,iBAAiBtuH,QAAQ5L,EAAOwkJ,OAIjG5oJ,KAAKs9J,qBACGt9J,KAAKs9J,oBAAoBhgC,EAAAgB,iBAAiBlvH,SAAShL,oNC7BtE,IAAAkX,EAAAxe,EAAA,eAAAoH,OAAAiT,KAAAmE,GAAAhE,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAAS,EAAAhG,oIAAA,IAAAioJ,EAAAzgK,EAAA,SAAAoH,OAAAiT,KAAAomJ,GAAAjmJ,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA0iJ,EAAAjoJ,iPAAA,IAAAkoJ,EAAA1gK,EAAA,mBAAAoH,OAAAiT,KAAAqmJ,GAAAlmJ,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,GAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA2iJ,EAAAloJ,2NAAA,MAAAmoJ,KAAA3gK,EAAA,yCACA4gK,EAAA5gK,EAAA,eAAAoH,OAAAiT,KAAAumJ,GAAApmJ,QAAA,SAAAhC,GAAA,YAAAA,GAAA,eAAAA,IAAApR,OAAAjE,UAAAyU,eAAA7W,KAAA2zI,EAAAl8H,IAAApR,OAAAC,eAAAvG,EAAA0X,EAAA,CAAA+rB,YAAA,EAAAxmB,IAAA,WAAA,OAAA6iJ,EAAApoJ","file":"silver-decisions-core.min.js","sourcesContent":["(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()","/**\n * @license Complex.js v2.0.11 11/02/2016\n *\n * Copyright (c) 2016, Robert Eisele (robert@xarg.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * var c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n(function(root) {\n\n  'use strict';\n\n  var cosh = function(x) {\n    return (Math.exp(x) + Math.exp(-x)) * 0.5;\n  };\n\n  var sinh = function(x) {\n    return (Math.exp(x) - Math.exp(-x)) * 0.5;\n  };\n\n  /**\n   * Calculates cos(x) - 1 using Taylor series if x is small.\n   *\n   * @param {number} x\n   * @returns {number} cos(x) - 1\n   */\n\n  var cosm1 = function(x) {\n    var limit = Math.PI/4;\n    if (x < -limit || x > limit) {\n      return (Math.cos(x) - 1.0);\n    }\n\n    var xx = x * x;\n    return xx *\n      (-0.5 + xx *\n        (1/24 + xx *\n          (-1/720 + xx *\n            (1/40320 + xx *\n              (-1/3628800 + xx *\n                (1/4790014600 + xx *\n                  (-1/87178291200 + xx *\n                    (1/20922789888000)\n                  )\n                )\n              )\n            )\n          )\n        )\n      )\n  };\n\n  var hypot = function(x, y) {\n\n    var a = Math.abs(x);\n    var b = Math.abs(y);\n\n    if (a < 3000 && b < 3000) {\n      return Math.sqrt(a * a + b * b);\n    }\n\n    if (a < b) {\n      a = b;\n      b = x / y;\n    } else {\n      b = y / x;\n    }\n    return a * Math.sqrt(1 + b * b);\n  };\n\n  var parser_exit = function() {\n    throw SyntaxError('Invalid Param');\n  };\n\n  /**\n   * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n   *\n   * @param {number} a\n   * @param {number} b\n   * @returns {number}\n   */\n  function logHypot(a, b) {\n\n    var _a = Math.abs(a);\n    var _b = Math.abs(b);\n\n    if (a === 0) {\n      return Math.log(_b);\n    }\n\n    if (b === 0) {\n      return Math.log(_a);\n    }\n\n    if (_a < 3000 && _b < 3000) {\n      return Math.log(a * a + b * b) * 0.5;\n    }\n\n    /* I got 4 ideas to compute this property without overflow:\n     *\n     * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate\n     *\n     * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n     Math.log(a * a + b * b) / 2\n\n     *\n     *\n     * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n     var fn = function(a, b) {\n     a = Math.abs(a);\n     b = Math.abs(b);\n     var t = Math.min(a, b);\n     a = Math.max(a, b);\n     t = t / a;\n\n     return Math.log(a) + Math.log(1 + t * t) / 2;\n     };\n\n     * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n     Math.log(a / Math.cos(Math.atan2(b, a)))\n\n     * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n     Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n     */\n\n    return Math.log(a / Math.cos(Math.atan2(b, a)));\n  }\n\n  var parse = function(a, b) {\n\n    var z = {'re': 0, 'im': 0};\n\n    if (a === undefined || a === null) {\n      z['re'] =\n              z['im'] = 0;\n    } else if (b !== undefined) {\n      z['re'] = a;\n      z['im'] = b;\n    } else\n      switch (typeof a) {\n\n        case 'object':\n\n          if ('im' in a && 're' in a) {\n            z['re'] = a['re'];\n            z['im'] = a['im'];\n          } else if ('abs' in a && 'arg' in a) {\n            if (!Number.isFinite(a['abs']) && Number.isFinite(a['arg'])) {\n              return Complex['INFINITY'];\n            }\n            z['re'] = a['abs'] * Math.cos(a['arg']);\n            z['im'] = a['abs'] * Math.sin(a['arg']);\n          } else if ('r' in a && 'phi' in a) {\n            if (!Number.isFinite(a['r']) && Number.isFinite(a['phi'])) {\n              return Complex['INFINITY'];\n            }\n            z['re'] = a['r'] * Math.cos(a['phi']);\n            z['im'] = a['r'] * Math.sin(a['phi']);\n          } else if (a.length === 2) { // Quick array check\n            z['re'] = a[0];\n            z['im'] = a[1];\n          } else {\n            parser_exit();\n          }\n          break;\n\n        case 'string':\n\n          z['im'] = /* void */\n                  z['re'] = 0;\n\n          var tokens = a.match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n          var plus = 1;\n          var minus = 0;\n\n          if (tokens === null) {\n            parser_exit();\n          }\n\n          for (var i = 0; i < tokens.length; i++) {\n\n            var c = tokens[i];\n\n            if (c === ' ' || c === '\\t' || c === '\\n') {\n              /* void */\n            } else if (c === '+') {\n              plus++;\n            } else if (c === '-') {\n              minus++;\n            } else if (c === 'i' || c === 'I') {\n\n              if (plus + minus === 0) {\n                parser_exit();\n              }\n\n              if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n                z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n                i++;\n              } else {\n                z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n              }\n              plus = minus = 0;\n\n            } else {\n\n              if (plus + minus === 0 || isNaN(c)) {\n                parser_exit();\n              }\n\n              if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n                z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n                i++;\n              } else {\n                z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n              }\n              plus = minus = 0;\n            }\n          }\n\n          // Still something on the stack\n          if (plus + minus > 0) {\n            parser_exit();\n          }\n          break;\n\n        case 'number':\n          z['im'] = 0;\n          z['re'] = a;\n          break;\n\n        default:\n          parser_exit();\n      }\n\n    if (isNaN(z['re']) || isNaN(z['im'])) {\n      // If a calculation is NaN, we treat it as NaN and don't throw\n      //parser_exit();\n    }\n\n    return z;\n  };\n\n  /**\n   * @constructor\n   * @returns {Complex}\n   */\n  function Complex(a, b) {\n\n    if (!(this instanceof Complex)) {\n      return new Complex(a, b);\n    }\n\n    var z = parse(a, b);\n\n    this['re'] = z['re'];\n    this['im'] = z['im'];\n  }\n\n  Complex.prototype = {\n\n    're': 0,\n    'im': 0,\n\n    /**\n     * Calculates the sign of a complex number, which is a normalized complex\n     *\n     * @returns {Complex}\n     */\n    'sign': function() {\n\n      var abs = this['abs']();\n\n      return new Complex(\n              this['re'] / abs,\n              this['im'] / abs);\n    },\n\n    /**\n     * Adds two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'add': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // Infinity + Infinity = NaN\n      if (this['isInfinite']() && z['isInfinite']()) {\n        return Complex['NAN'];\n      }\n\n      // Infinity + z = Infinity { where z != Infinity }\n      if (this['isInfinite']() || z['isInfinite']()) {\n        return Complex['INFINITY'];\n      }\n\n      return new Complex(\n              this['re'] + z['re'],\n              this['im'] + z['im']);\n    },\n\n    /**\n     * Subtracts two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'sub': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // Infinity - Infinity = NaN\n      if (this['isInfinite']() && z['isInfinite']()) {\n        return Complex['NAN'];\n      }\n\n      // Infinity - z = Infinity { where z != Infinity }\n      if (this['isInfinite']() || z['isInfinite']()) {\n        return Complex['INFINITY'];\n      }\n\n      return new Complex(\n              this['re'] - z['re'],\n              this['im'] - z['im']);\n    },\n\n    /**\n     * Multiplies two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'mul': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // Infinity * 0 = NaN\n      if ((this['isInfinite']() && z['isZero']()) || (this['isZero']() && z['isInfinite']())) {\n        return Complex['NAN'];\n      }\n\n      // Infinity * z = Infinity { where z != 0 }\n      if (this['isInfinite']() || z['isInfinite']()) {\n        return Complex['INFINITY'];\n      }\n\n      // Short circuit for real values\n      if (z['im'] === 0 && this['im'] === 0) {\n        return new Complex(this['re'] * z['re'], 0);\n      }\n\n      return new Complex(\n              this['re'] * z['re'] - this['im'] * z['im'],\n              this['re'] * z['im'] + this['im'] * z['re']);\n    },\n\n    /**\n     * Divides two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'div': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      // 0 / 0 = NaN and Infinity / Infinity = NaN\n      if ((this['isZero']() && z['isZero']()) || (this['isInfinite']() && z['isInfinite']())) {\n        return Complex['NAN'];\n      }\n\n      // Infinity / 0 = Infinity\n      if (this['isInfinite']() || z['isZero']()) {\n        return Complex['INFINITY'];\n      }\n\n      // 0 / Infinity = 0\n      if (this['isZero']() || z['isInfinite']()) {\n        return Complex['ZERO'];\n      }\n\n      a = this['re'];\n      b = this['im'];\n\n      var c = z['re'];\n      var d = z['im'];\n      var t, x;\n\n      if (0 === d) {\n        // Divisor is real\n        return new Complex(a / c, b / c);\n      }\n\n      if (Math.abs(c) < Math.abs(d)) {\n\n        x = c / d;\n        t = c * x + d;\n\n        return new Complex(\n                (a * x + b) / t,\n                (b * x - a) / t);\n\n      } else {\n\n        x = d / c;\n        t = d * x + c;\n\n        return new Complex(\n                (a + b * x) / t,\n                (b - a * x) / t);\n      }\n    },\n\n    /**\n     * Calculate the power of two complex numbers\n     *\n     * @returns {Complex}\n     */\n    'pow': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      a = this['re'];\n      b = this['im'];\n\n      if (z['isZero']()) {\n        return Complex['ONE'];\n      }\n\n      // If the exponent is real\n      if (z['im'] === 0) {\n\n        if (b === 0 && a >= 0) {\n\n          return new Complex(Math.pow(a, z['re']), 0);\n\n        } else if (a === 0) { // If base is fully imaginary\n\n          switch ((z['re'] % 4 + 4) % 4) {\n            case 0:\n              return new Complex(Math.pow(b, z['re']), 0);\n            case 1:\n              return new Complex(0, Math.pow(b, z['re']));\n            case 2:\n              return new Complex(-Math.pow(b, z['re']), 0);\n            case 3:\n              return new Complex(0, -Math.pow(b, z['re']));\n          }\n        }\n      }\n\n      /* I couldn't find a good formula, so here is a derivation and optimization\n       *\n       * z_1^z_2 = (a + bi)^(c + di)\n       *         = exp((c + di) * log(a + bi)\n       *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n       * =>...\n       * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n       * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n       *\n       * =>...\n       * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n       * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n       *\n       * =>\n       * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n       * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n       *\n       */\n\n      if (a === 0 && b === 0 && z['re'] > 0 && z['im'] >= 0) {\n        return Complex['ZERO'];\n      }\n\n      var arg = Math.atan2(b, a);\n      var loh = logHypot(a, b);\n\n      a = Math.exp(z['re'] * loh - z['im'] * arg);\n      b = z['im'] * loh + z['re'] * arg;\n      return new Complex(\n              a * Math.cos(b),\n              a * Math.sin(b));\n    },\n\n    /**\n     * Calculate the complex square root\n     *\n     * @returns {Complex}\n     */\n    'sqrt': function() {\n\n      var a = this['re'];\n      var b = this['im'];\n      var r = this['abs']();\n\n      var re, im;\n\n      if (a >= 0) {\n\n        if (b === 0) {\n          return new Complex(Math.sqrt(a), 0);\n        }\n\n        re = 0.5 * Math.sqrt(2.0 * (r + a));\n      } else {\n        re = Math.abs(b) / Math.sqrt(2 * (r - a));\n      }\n\n      if (a <= 0) {\n        im = 0.5 * Math.sqrt(2.0 * (r - a));\n      } else {\n        im = Math.abs(b) / Math.sqrt(2 * (r + a));\n      }\n\n      return new Complex(re, b < 0 ? -im : im);\n    },\n\n    /**\n     * Calculate the complex exponent\n     *\n     * @returns {Complex}\n     */\n    'exp': function() {\n\n      var tmp = Math.exp(this['re']);\n\n      if (this['im'] === 0) {\n        //return new Complex(tmp, 0);\n      }\n      return new Complex(\n              tmp * Math.cos(this['im']),\n              tmp * Math.sin(this['im']));\n    },\n\n    /**\n     * Calculate the complex exponent and subtracts one.\n     *\n     * This may be more accurate than `Complex(x).exp().sub(1)` if\n     * `x` is small.\n     *\n     * @returns {Complex}\n     */\n    'expm1': function() {\n\n      /**\n       * exp(a + i*b) - 1\n       = exp(a) * (cos(b) + j*sin(b)) - 1\n       = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n       */\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n              Math.expm1(a) * Math.cos(b) + cosm1(b),\n              Math.exp(a) * Math.sin(b));\n    },\n\n    /**\n     * Calculate the natural log\n     *\n     * @returns {Complex}\n     */\n    'log': function() {\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (b === 0 && a > 0) {\n        //return new Complex(Math.log(a), 0);\n      }\n\n      return new Complex(\n              logHypot(a, b),\n              Math.atan2(b, a));\n    },\n\n    /**\n     * Calculate the magnitude of the complex number\n     *\n     * @returns {number}\n     */\n    'abs': function() {\n\n      return hypot(this['re'], this['im']);\n    },\n\n    /**\n     * Calculate the angle of the complex number\n     *\n     * @returns {number}\n     */\n    'arg': function() {\n\n      return Math.atan2(this['im'], this['re']);\n    },\n\n    /**\n     * Calculate the sine of the complex number\n     *\n     * @returns {Complex}\n     */\n    'sin': function() {\n\n      // sin(c) = (e^b - e^(-b)) / (2i)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n              Math.sin(a) * cosh(b),\n              Math.cos(a) * sinh(b));\n    },\n\n    /**\n     * Calculate the cosine\n     *\n     * @returns {Complex}\n     */\n    'cos': function() {\n\n      // cos(z) = (e^b + e^(-b)) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n              Math.cos(a) * cosh(b),\n              -Math.sin(a) * sinh(b));\n    },\n\n    /**\n     * Calculate the tangent\n     *\n     * @returns {Complex}\n     */\n    'tan': function() {\n\n      // tan(c) = (e^(ci) - e^(-ci)) / (i(e^(ci) + e^(-ci)))\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = Math.cos(a) + cosh(b);\n\n      return new Complex(\n              Math.sin(a) / d,\n              sinh(b) / d);\n    },\n\n    /**\n     * Calculate the cotangent\n     *\n     * @returns {Complex}\n     */\n    'cot': function() {\n\n      // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = Math.cos(a) - cosh(b);\n\n      return new Complex(\n              -Math.sin(a) / d,\n              sinh(b) / d);\n    },\n\n    /**\n     * Calculate the secant\n     *\n     * @returns {Complex}\n     */\n    'sec': function() {\n\n      // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n      return new Complex(\n              Math.cos(a) * cosh(b) / d,\n              Math.sin(a) * sinh(b) / d);\n    },\n\n    /**\n     * Calculate the cosecans\n     *\n     * @returns {Complex}\n     */\n    'csc': function() {\n\n      // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n      return new Complex(\n              Math.sin(a) * cosh(b) / d,\n              -Math.cos(a) * sinh(b) / d);\n    },\n\n    /**\n     * Calculate the complex arcus sinus\n     *\n     * @returns {Complex}\n     */\n    'asin': function() {\n\n      // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var t1 = new Complex(\n              b * b - a * a + 1,\n              -2 * a * b)['sqrt']();\n\n      var t2 = new Complex(\n              t1['re'] - b,\n              t1['im'] + a)['log']();\n\n      return new Complex(t2['im'], -t2['re']);\n    },\n\n    /**\n     * Calculate the complex arcus cosinus\n     *\n     * @returns {Complex}\n     */\n    'acos': function() {\n\n      // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var t1 = new Complex(\n              b * b - a * a + 1,\n              -2 * a * b)['sqrt']();\n\n      var t2 = new Complex(\n              t1['re'] - b,\n              t1['im'] + a)['log']();\n\n      return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n    },\n\n    /**\n     * Calculate the complex arcus tangent\n     *\n     * @returns {Complex}\n     */\n    'atan': function() {\n\n      // atan(c) = i / 2 log((i + x) / (i - x))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0) {\n\n        if (b === 1) {\n          return new Complex(0, Infinity);\n        }\n\n        if (b === -1) {\n          return new Complex(0, -Infinity);\n        }\n      }\n\n      var d = a * a + (1.0 - b) * (1.0 - b);\n\n      var t1 = new Complex(\n              (1 - b * b - a * a) / d,\n              -2 * a / d).log();\n\n      return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n    },\n\n    /**\n     * Calculate the complex arcus cotangent\n     *\n     * @returns {Complex}\n     */\n    'acot': function() {\n\n      // acot(c) = i / 2 log((c - i) / (c + i))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (b === 0) {\n        return new Complex(Math.atan2(1, a), 0);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n              ? new Complex(\n                      a / d,\n                      -b / d).atan()\n              : new Complex(\n                      (a !== 0) ? a / 0 : 0,\n                      (b !== 0) ? -b / 0 : 0).atan();\n    },\n\n    /**\n     * Calculate the complex arcus secant\n     *\n     * @returns {Complex}\n     */\n    'asec': function() {\n\n      // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0 && b === 0) {\n        return new Complex(0, Infinity);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n              ? new Complex(\n                      a / d,\n                      -b / d).acos()\n              : new Complex(\n                      (a !== 0) ? a / 0 : 0,\n                      (b !== 0) ? -b / 0 : 0).acos();\n    },\n\n    /**\n     * Calculate the complex arcus cosecans\n     *\n     * @returns {Complex}\n     */\n    'acsc': function() {\n\n      // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0 && b === 0) {\n        return new Complex(Math.PI / 2, Infinity);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n              ? new Complex(\n                      a / d,\n                      -b / d).asin()\n              : new Complex(\n                      (a !== 0) ? a / 0 : 0,\n                      (b !== 0) ? -b / 0 : 0).asin();\n    },\n\n    /**\n     * Calculate the complex sinh\n     *\n     * @returns {Complex}\n     */\n    'sinh': function() {\n\n      // sinh(c) = (e^c - e^-c) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n              sinh(a) * Math.cos(b),\n              cosh(a) * Math.sin(b));\n    },\n\n    /**\n     * Calculate the complex cosh\n     *\n     * @returns {Complex}\n     */\n    'cosh': function() {\n\n      // cosh(c) = (e^c + e^-c) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      return new Complex(\n              cosh(a) * Math.cos(b),\n              sinh(a) * Math.sin(b));\n    },\n\n    /**\n     * Calculate the complex tanh\n     *\n     * @returns {Complex}\n     */\n    'tanh': function() {\n\n      // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = cosh(a) + Math.cos(b);\n\n      return new Complex(\n              sinh(a) / d,\n              Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex coth\n     *\n     * @returns {Complex}\n     */\n    'coth': function() {\n\n      // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n      var a = 2 * this['re'];\n      var b = 2 * this['im'];\n      var d = cosh(a) - Math.cos(b);\n\n      return new Complex(\n              sinh(a) / d,\n              -Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex coth\n     *\n     * @returns {Complex}\n     */\n    'csch': function() {\n\n      // csch(c) = 2 / (e^c - e^-c)\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = Math.cos(2 * b) - cosh(2 * a);\n\n      return new Complex(\n              -2 * sinh(a) * Math.cos(b) / d,\n              2 * cosh(a) * Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex sech\n     *\n     * @returns {Complex}\n     */\n    'sech': function() {\n\n      // sech(c) = 2 / (e^c + e^-c)\n\n      var a = this['re'];\n      var b = this['im'];\n      var d = Math.cos(2 * b) + cosh(2 * a);\n\n      return new Complex(\n              2 * cosh(a) * Math.cos(b) / d,\n              -2 * sinh(a) * Math.sin(b) / d);\n    },\n\n    /**\n     * Calculate the complex asinh\n     *\n     * @returns {Complex}\n     */\n    'asinh': function() {\n\n      // asinh(c) = log(c + sqrt(c^2 + 1))\n\n      var tmp = this['im'];\n      this['im'] = -this['re'];\n      this['re'] = tmp;\n      var res = this['asin']();\n\n      this['re'] = -this['im'];\n      this['im'] = tmp;\n      tmp = res['re'];\n\n      res['re'] = -res['im'];\n      res['im'] = tmp;\n      return res;\n    },\n\n    /**\n     * Calculate the complex asinh\n     *\n     * @returns {Complex}\n     */\n    'acosh': function() {\n\n      // acosh(c) = log(c + sqrt(c^2 - 1))\n\n      var res = this['acos']();\n      if (res['im'] <= 0) {\n        var tmp = res['re'];\n        res['re'] = -res['im'];\n        res['im'] = tmp;\n      } else {\n        var tmp = res['im'];\n        res['im'] = -res['re'];\n        res['re'] = tmp;\n      }\n      return res;\n    },\n\n    /**\n     * Calculate the complex atanh\n     *\n     * @returns {Complex}\n     */\n    'atanh': function() {\n\n      // atanh(c) = log((1+c) / (1-c)) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var noIM = a > 1 && b === 0;\n      var oneMinus = 1 - a;\n      var onePlus = 1 + a;\n      var d = oneMinus * oneMinus + b * b;\n\n      var x = (d !== 0)\n              ? new Complex(\n                      (onePlus * oneMinus - b * b) / d,\n                      (b * oneMinus + onePlus * b) / d)\n              : new Complex(\n                      (a !== -1) ? (a / 0) : 0,\n                      (b !== 0) ? (b / 0) : 0);\n\n      var temp = x['re'];\n      x['re'] = logHypot(x['re'], x['im']) / 2;\n      x['im'] = Math.atan2(x['im'], temp) / 2;\n      if (noIM) {\n        x['im'] = -x['im'];\n      }\n      return x;\n    },\n\n    /**\n     * Calculate the complex acoth\n     *\n     * @returns {Complex}\n     */\n    'acoth': function() {\n\n      // acoth(c) = log((c+1) / (c-1)) / 2\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (a === 0 && b === 0) {\n        return new Complex(0, Math.PI / 2);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n              ? new Complex(\n                      a / d,\n                      -b / d).atanh()\n              : new Complex(\n                      (a !== 0) ? a / 0 : 0,\n                      (b !== 0) ? -b / 0 : 0).atanh();\n    },\n\n    /**\n     * Calculate the complex acsch\n     *\n     * @returns {Complex}\n     */\n    'acsch': function() {\n\n      // acsch(c) = log((1+sqrt(1+c^2))/c)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (b === 0) {\n\n        return new Complex(\n                (a !== 0)\n                ? Math.log(a + Math.sqrt(a * a + 1))\n                : Infinity, 0);\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n              ? new Complex(\n                      a / d,\n                      -b / d).asinh()\n              : new Complex(\n                      (a !== 0) ? a / 0 : 0,\n                      (b !== 0) ? -b / 0 : 0).asinh();\n    },\n\n    /**\n     * Calculate the complex asech\n     *\n     * @returns {Complex}\n     */\n    'asech': function() {\n\n      // asech(c) = log((1+sqrt(1-c^2))/c)\n\n      var a = this['re'];\n      var b = this['im'];\n\n      if (this['isZero']()) {\n        return Complex['INFINITY'];\n      }\n\n      var d = a * a + b * b;\n      return (d !== 0)\n              ? new Complex(\n                      a / d,\n                      -b / d).acosh()\n              : new Complex(\n                      (a !== 0) ? a / 0 : 0,\n                      (b !== 0) ? -b / 0 : 0).acosh();\n    },\n\n    /**\n     * Calculate the complex inverse 1/z\n     *\n     * @returns {Complex}\n     */\n    'inverse': function() {\n\n      // 1 / 0 = Infinity and 1 / Infinity = 0\n      if (this['isZero']()) {\n        return Complex['INFINITY'];\n      }\n\n      if (this['isInfinite']()) {\n        return Complex['ZERO'];\n      }\n\n      var a = this['re'];\n      var b = this['im'];\n\n      var d = a * a + b * b;\n\n      return new Complex(a / d, -b / d);\n    },\n\n    /**\n     * Returns the complex conjugate\n     *\n     * @returns {Complex}\n     */\n    'conjugate': function() {\n\n      return new Complex(this['re'], -this['im']);\n    },\n\n    /**\n     * Gets the negated complex number\n     *\n     * @returns {Complex}\n     */\n    'neg': function() {\n\n      return new Complex(-this['re'], -this['im']);\n    },\n\n    /**\n     * Ceils the actual complex number\n     *\n     * @returns {Complex}\n     */\n    'ceil': function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      return new Complex(\n              Math.ceil(this['re'] * places) / places,\n              Math.ceil(this['im'] * places) / places);\n    },\n\n    /**\n     * Floors the actual complex number\n     *\n     * @returns {Complex}\n     */\n    'floor': function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      return new Complex(\n              Math.floor(this['re'] * places) / places,\n              Math.floor(this['im'] * places) / places);\n    },\n\n    /**\n     * Ceils the actual complex number\n     *\n     * @returns {Complex}\n     */\n    'round': function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      return new Complex(\n              Math.round(this['re'] * places) / places,\n              Math.round(this['im'] * places) / places);\n    },\n\n    /**\n     * Compares two complex numbers\n     *\n     * **Note:** new Complex(Infinity).equals(Infinity) === false\n     *\n     * @returns {boolean}\n     */\n    'equals': function(a, b) {\n\n      var z = new Complex(a, b);\n\n      return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n              Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n    },\n\n    /**\n     * Clones the actual object\n     *\n     * @returns {Complex}\n     */\n    'clone': function() {\n\n      return new Complex(this['re'], this['im']);\n    },\n\n    /**\n     * Gets a string of the actual complex number\n     *\n     * @returns {string}\n     */\n    'toString': function() {\n\n      var a = this['re'];\n      var b = this['im'];\n      var ret = '';\n\n      if (this['isNaN']()) {\n        return 'NaN';\n      }\n\n      if (this['isZero']()) {\n        return '0';\n      }\n\n      if (this['isInfinite']()) {\n        return 'Infinity';\n      }\n\n      if (a !== 0) {\n        ret += a;\n      }\n\n      if (b !== 0) {\n\n        if (a !== 0) {\n          ret += b < 0 ? ' - ' : ' + ';\n        } else if (b < 0) {\n          ret += '-';\n        }\n\n        b = Math.abs(b);\n\n        if (1 !== b) {\n          ret += b;\n        }\n        ret += 'i';\n      }\n\n      if (!ret)\n        return '0';\n\n      return ret;\n    },\n\n    /**\n     * Returns the actual number as a vector\n     *\n     * @returns {Array}\n     */\n    'toVector': function() {\n\n      return [this['re'], this['im']];\n    },\n\n    /**\n     * Returns the actual real value of the current object\n     *\n     * @returns {number|null}\n     */\n    'valueOf': function() {\n\n      if (this['im'] === 0) {\n        return this['re'];\n      }\n      return null;\n    },\n\n    /**\n     * Determines whether a complex number is not on the Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isNaN': function() {\n      return isNaN(this['re']) || isNaN(this['im']);\n    },\n\n    /**\n     * Determines whether or not a complex number is at the zero pole of the\n     * Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isZero': function() {\n      return (\n              (this['re'] === 0 || this['re'] === -0) &&\n              (this['im'] === 0 || this['im'] === -0)\n              );\n    },\n\n    /**\n     * Determines whether a complex number is not at the infinity pole of the\n     * Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isFinite': function() {\n      return isFinite(this['re']) && isFinite(this['im']);\n    },\n\n    /**\n     * Determines whether or not a complex number is at the infinity pole of the\n     * Riemann sphere.\n     *\n     * @returns {boolean}\n     */\n    'isInfinite': function() {\n      return !(this['isNaN']() || this['isFinite']());\n    }\n  };\n\n  Complex['ZERO'] = new Complex(0, 0);\n  Complex['ONE'] = new Complex(1, 0);\n  Complex['I'] = new Complex(0, 1);\n  Complex['PI'] = new Complex(Math.PI, 0);\n  Complex['E'] = new Complex(Math.E, 0);\n  Complex['INFINITY'] = new Complex(Infinity, Infinity);\n  Complex['NAN'] = new Complex(NaN, NaN);\n  Complex['EPSILON'] = 1e-16;\n\n  if (typeof define === 'function' && define['amd']) {\n    define([], function() {\n      return Complex;\n    });\n  } else if (typeof exports === 'object') {\n    Object.defineProperty(exports, \"__esModule\", {'value': true});\n    Complex['default'] = Complex;\n    Complex['Complex'] = Complex;\n    module['exports'] = Complex;\n  } else {\n    root['Complex'] = Complex;\n  }\n\n})(this);\n",";(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*\r\n   *  decimal.js v10.1.1\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2019 Michael Mclaughlin <M8ch88l@gmail.com>\r\n   *  MIT Licence\r\n   */\r\n\r\n\r\n  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n    // The maximum exponent magnitude.\r\n    // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\n  var EXP_LIMIT = 9e15,                      // 0 to 9e15\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    MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n    // Base conversion alphabet.\r\n    NUMERALS = '0123456789abcdef',\r\n\r\n    // The natural logarithm of 10 (1025 digits).\r\n    LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n    // Pi (1025 digits).\r\n    PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n    // The initial configuration properties of the Decimal constructor.\r\n    DEFAULTS = {\r\n\r\n      // These values must be integers within the stated ranges (inclusive).\r\n      // Most of these values can be changed at run-time using the `Decimal.config` method.\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 when rounding to `precision`.\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 modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n      // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN  6 The IEEE 754 remainder function.\r\n      // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n      //\r\n      // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n      // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n      // be used, but they may not give useful results.\r\n      modulo: 1,                             // 0 to 9\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 -EXP_LIMIT\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 EXP_LIMIT\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // JavaScript numbers: -324  (5e-324)\r\n      minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n      maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      crypto: false                          // true/false\r\n    },\r\n\r\n\r\n  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n    Decimal, inexact, noConflict, quadrant,\r\n    external = true,\r\n\r\n    decimalError = '[DecimalError] ',\r\n    invalidArgument = decimalError + 'Invalid argument: ',\r\n    precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n    cryptoUnavailable = decimalError + 'crypto unavailable',\r\n\r\n    mathfloor = Math.floor,\r\n    mathpow = Math.pow,\r\n\r\n    isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n    isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n    isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n    isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n    BASE = 1e7,\r\n    LOG_BASE = 7,\r\n    MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n    LN10_PRECISION = LN10.length - 1,\r\n    PI_PRECISION = PI.length - 1,\r\n\r\n    // Decimal.prototype object\r\n    P = { name: '[object Decimal]' };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\r\n   *  comparedTo                cmp\r\n   *  cosine                    cos\r\n   *  cubeRoot                  cbrt\r\n   *  decimalPlaces             dp\r\n   *  dividedBy                 div\r\n   *  dividedToIntegerBy        divToInt\r\n   *  equals                    eq\r\n   *  floor\r\n   *  greaterThan               gt\r\n   *  greaterThanOrEqualTo      gte\r\n   *  hyperbolicCosine          cosh\r\n   *  hyperbolicSine            sinh\r\n   *  hyperbolicTangent         tanh\r\n   *  inverseCosine             acos\r\n   *  inverseHyperbolicCosine   acosh\r\n   *  inverseHyperbolicSine     asinh\r\n   *  inverseHyperbolicTangent  atanh\r\n   *  inverseSine               asin\r\n   *  inverseTangent            atan\r\n   *  isFinite\r\n   *  isInteger                 isInt\r\n   *  isNaN\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   *  [maximum]                 [max]\r\n   *  [minimum]                 [min]\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   *  round\r\n   *  sine                      sin\r\n   *  squareRoot                sqrt\r\n   *  tangent                   tan\r\n   *  times                     mul\r\n   *  toBinary\r\n   *  toDecimalPlaces           toDP\r\n   *  toExponential\r\n   *  toFixed\r\n   *  toFraction\r\n   *  toHexadecimal             toHex\r\n   *  toNearest\r\n   *  toNumber\r\n   *  toOctal\r\n   *  toPower                   pow\r\n   *  toPrecision\r\n   *  toSignificantDigits       toSD\r\n   *  toString\r\n   *  truncated                 trunc\r\n   *  valueOf                   toJSON\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 < 0) x.s = 1;\r\n    return finalise(x);\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 in the\r\n   * direction of positive Infinity.\r\n   *\r\n   */\r\n  P.ceil = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 2);\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   *   NaN  if the value of either Decimal is NaN.\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      xd = x.d,\r\n      yd = (y = new x.constructor(y)).d,\r\n      xs = x.s,\r\n      ys = y.s;\r\n\r\n    // Either NaN or ±Infinity?\r\n    if (!xd || !yd) {\r\n      return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Either zero?\r\n    if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n    // Signs differ?\r\n    if (xs !== ys) return xs;\r\n\r\n    // Compare exponents.\r\n    if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n    xdL = xd.length;\r\n    ydL = yd.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 (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n    }\r\n\r\n    // Compare lengths.\r\n    return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * cos(0)         = 1\r\n   * cos(-0)        = 1\r\n   * cos(Infinity)  = NaN\r\n   * cos(-Infinity) = NaN\r\n   * cos(NaN)       = NaN\r\n   *\r\n   */\r\n  P.cosine = P.cos = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.d) return new Ctor(NaN);\r\n\r\n    // cos(0) = cos(-0) = 1\r\n    if (!x.d[0]) return new Ctor(1);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *\r\n   * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   *  cbrt(0)  =  0\r\n   *  cbrt(-0) = -0\r\n   *  cbrt(1)  =  1\r\n   *  cbrt(-1) = -1\r\n   *  cbrt(N)  =  N\r\n   *  cbrt(-I) = -I\r\n   *  cbrt(I)  =  I\r\n   *\r\n   * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n   *\r\n   */\r\n  P.cubeRoot = P.cbrt = function () {\r\n    var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n    external = false;\r\n\r\n    // Initial estimate.\r\n    s = x.s * Math.pow(x.s * x, 1 / 3);\r\n\r\n     // Math.cbrt underflow/overflow?\r\n     // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n    if (!s || Math.abs(s) == 1 / 0) {\r\n      n = digitsToString(x.d);\r\n      e = x.e;\r\n\r\n      // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n      if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n      s = Math.pow(n, 1 / 3);\r\n\r\n      // Rarely, e may be one less than the result exponent value.\r\n      e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + 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      r.s = x.s;\r\n    } else {\r\n      r = new Ctor(s.toString());\r\n    }\r\n\r\n    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Halley's method.\r\n    // TODO? Compare Newton's method.\r\n    for (;;) {\r\n      t = r;\r\n      t3 = t.times(t).times(t);\r\n      t3plusx = t3.plus(x);\r\n      r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 1);\r\n\r\n        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n        // , i.e. approaching a rounding boundary, continue the iteration.\r\n        if (n == '9999' || !rep && 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          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\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 w,\r\n      d = this.d,\r\n      n = NaN;\r\n\r\n    if (d) {\r\n      w = d.length - 1;\r\n      n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last word.\r\n      w = d[w];\r\n      if (w) for (; w % 10 == 0; w /= 10) n--;\r\n      if (n < 0) n = 0;\r\n    }\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n / 0 = I\r\n   *  n / N = N\r\n   *  n / I = 0\r\n   *  0 / n = 0\r\n   *  0 / 0 = N\r\n   *  0 / N = N\r\n   *  0 / I = 0\r\n   *  N / n = N\r\n   *  N / 0 = N\r\n   *  N / N = N\r\n   *  N / I = N\r\n   *  I / n = I\r\n   *  I / 0 = I\r\n   *  I / N = N\r\n   *  I / I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\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`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.dividedToIntegerBy = P.divToInt = function (y) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n    return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\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) === 0;\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 in the\r\n   * direction of negative Infinity.\r\n   *\r\n   */\r\n  P.floor = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 3);\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    var k = this.cmp(y);\r\n    return k == 1 || k === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [1, Infinity]\r\n   *\r\n   * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n   *\r\n   * cosh(0)         = 1\r\n   * cosh(-0)        = 1\r\n   * cosh(Infinity)  = Infinity\r\n   * cosh(-Infinity) = Infinity\r\n   * cosh(NaN)       = NaN\r\n   *\r\n   *  x        time taken (ms)   result\r\n   * 1000      9                 9.8503555700852349694e+433\r\n   * 10000     25                4.4034091128314607936e+4342\r\n   * 100000    171               1.4033316802130615897e+43429\r\n   * 1000000   3817              1.5166076984010437725e+434294\r\n   * 10000000  abandoned after 2 minute wait\r\n   *\r\n   * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicCosine = P.cosh = function () {\r\n    var k, n, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      one = new Ctor(1);\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n    if (x.isZero()) return one;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n    // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    // TODO? Estimation reused from cosine() and may not be optimal here.\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      n = Math.pow(4, -k).toString();\r\n    } else {\r\n      k = 16;\r\n      n = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n    // Reverse argument reduction\r\n    var cosh2_x,\r\n      i = k,\r\n      d8 = new Ctor(8);\r\n    for (; i--;) {\r\n      cosh2_x = x.times(x);\r\n      x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n    }\r\n\r\n    return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n   *\r\n   * sinh(0)         = 0\r\n   * sinh(-0)        = -0\r\n   * sinh(Infinity)  = Infinity\r\n   * sinh(-Infinity) = -Infinity\r\n   * sinh(NaN)       = NaN\r\n   *\r\n   * x        time taken (ms)\r\n   * 10       2 ms\r\n   * 100      5 ms\r\n   * 1000     14 ms\r\n   * 10000    82 ms\r\n   * 100000   886 ms            1.4033316802130615897e+43429\r\n   * 200000   2613 ms\r\n   * 300000   5407 ms\r\n   * 400000   8824 ms\r\n   * 500000   13026 ms          8.7080643612718084129e+217146\r\n   * 1000000  48543 ms\r\n   *\r\n   * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n   *\r\n   */\r\n  P.hyperbolicSine = P.sinh = function () {\r\n    var k, pr, rm, len,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    len = x.d.length;\r\n\r\n    if (len < 3) {\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n    } else {\r\n\r\n      // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n      // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n      // 3 multiplications and 1 addition\r\n\r\n      // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n      // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n      // 4 multiplications and 2 additions\r\n\r\n      // Estimate the optimum number of times to use the argument reduction.\r\n      k = 1.4 * Math.sqrt(len);\r\n      k = k > 16 ? 16 : k | 0;\r\n\r\n      x = x.times(Math.pow(5, -k));\r\n\r\n      x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n      // Reverse argument reduction\r\n      var sinh2_x,\r\n        d5 = new Ctor(5),\r\n        d16 = new Ctor(16),\r\n        d20 = new Ctor(20);\r\n      for (; k--;) {\r\n        sinh2_x = x.times(x);\r\n        x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n      }\r\n    }\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * tanh(x) = sinh(x) / cosh(x)\r\n   *\r\n   * tanh(0)         = 0\r\n   * tanh(-0)        = -0\r\n   * tanh(Infinity)  = 1\r\n   * tanh(-Infinity) = -1\r\n   * tanh(NaN)       = NaN\r\n   *\r\n   */\r\n  P.hyperbolicTangent = P.tanh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(x.s);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 7;\r\n    Ctor.rounding = 1;\r\n\r\n    return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n   * this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [0, pi]\r\n   *\r\n   * acos(x) = pi/2 - asin(x)\r\n   *\r\n   * acos(0)       = pi/2\r\n   * acos(-0)      = pi/2\r\n   * acos(1)       = 0\r\n   * acos(-1)      = pi\r\n   * acos(1/2)     = pi/3\r\n   * acos(-1/2)    = 2*pi/3\r\n   * acos(|x| > 1) = NaN\r\n   * acos(NaN)     = NaN\r\n   *\r\n   */\r\n  P.inverseCosine = P.acos = function () {\r\n    var halfPi,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      k = x.abs().cmp(1),\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n      return k === 0\r\n        // |x| is 1\r\n        ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n        // |x| > 1 or x is NaN\r\n        : new Ctor(NaN);\r\n    }\r\n\r\n    if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.asin();\r\n    halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return halfPi.minus(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [1, Infinity]\r\n   * Range: [0, Infinity]\r\n   *\r\n   * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n   *\r\n   * acosh(x < 1)     = NaN\r\n   * acosh(NaN)       = NaN\r\n   * acosh(Infinity)  = Infinity\r\n   * acosh(-Infinity) = NaN\r\n   * acosh(0)         = NaN\r\n   * acosh(-0)        = NaN\r\n   * acosh(1)         = 0\r\n   * acosh(-1)        = NaN\r\n   *\r\n   */\r\n  P.inverseHyperbolicCosine = P.acosh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n    if (!x.isFinite()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n   *\r\n   * asinh(NaN)       = NaN\r\n   * asinh(Infinity)  = Infinity\r\n   * asinh(-Infinity) = -Infinity\r\n   * asinh(0)         = 0\r\n   * asinh(-0)        = -0\r\n   *\r\n   */\r\n  P.inverseHyperbolicSine = P.asinh = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n    Ctor.rounding = 1;\r\n    external = false;\r\n\r\n    x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n    external = true;\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.ln();\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n   * value of this Decimal.\r\n   *\r\n   * Domain: [-1, 1]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n   *\r\n   * atanh(|x| > 1)   = NaN\r\n   * atanh(NaN)       = NaN\r\n   * atanh(Infinity)  = NaN\r\n   * atanh(-Infinity) = NaN\r\n   * atanh(0)         = 0\r\n   * atanh(-0)        = -0\r\n   * atanh(1)         = Infinity\r\n   * atanh(-1)        = -Infinity\r\n   *\r\n   */\r\n  P.inverseHyperbolicTangent = P.atanh = function () {\r\n    var pr, rm, wpr, xsd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    xsd = x.sd();\r\n\r\n    if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n    Ctor.precision = wpr = xsd - x.e;\r\n\r\n    x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n    Ctor.precision = pr + 4;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.ln();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(0.5);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n   * Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n   *\r\n   * asin(0)       = 0\r\n   * asin(-0)      = -0\r\n   * asin(1/2)     = pi/6\r\n   * asin(-1/2)    = -pi/6\r\n   * asin(1)       = pi/2\r\n   * asin(-1)      = -pi/2\r\n   * asin(|x| > 1) = NaN\r\n   * asin(NaN)     = NaN\r\n   *\r\n   * TODO? Compare performance of Taylor series.\r\n   *\r\n   */\r\n  P.inverseSine = P.asin = function () {\r\n    var halfPi, k,\r\n      pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    k = x.abs().cmp(1);\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (k !== -1) {\r\n\r\n      // |x| is 1\r\n      if (k === 0) {\r\n        halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        halfPi.s = x.s;\r\n        return halfPi;\r\n      }\r\n\r\n      // |x| > 1 or x is NaN\r\n      return new Ctor(NaN);\r\n    }\r\n\r\n    // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n    Ctor.precision = pr + 6;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return x.times(2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n   * of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi/2, pi/2]\r\n   *\r\n   * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n   *\r\n   * atan(0)         = 0\r\n   * atan(-0)        = -0\r\n   * atan(1)         = pi/4\r\n   * atan(-1)        = -pi/4\r\n   * atan(Infinity)  = pi/2\r\n   * atan(-Infinity) = -pi/2\r\n   * atan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.inverseTangent = P.atan = function () {\r\n    var i, j, k, n, px, t, r, wpr, x2,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding;\r\n\r\n    if (!x.isFinite()) {\r\n      if (!x.s) return new Ctor(NaN);\r\n      if (pr + 4 <= PI_PRECISION) {\r\n        r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n        r.s = x.s;\r\n        return r;\r\n      }\r\n    } else if (x.isZero()) {\r\n      return new Ctor(x);\r\n    } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n\r\n    Ctor.precision = wpr = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n    // Argument reduction\r\n    // Ensure |x| < 0.42\r\n    // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n    k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n    for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n    external = false;\r\n\r\n    j = Math.ceil(wpr / LOG_BASE);\r\n    n = 1;\r\n    x2 = x.times(x);\r\n    r = new Ctor(x);\r\n    px = x;\r\n\r\n    // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n    for (; i !== -1;) {\r\n      px = px.times(x2);\r\n      t = r.minus(px.div(n += 2));\r\n\r\n      px = px.times(x2);\r\n      r = t.plus(px.div(n += 2));\r\n\r\n      if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n    }\r\n\r\n    if (k) r = r.times(2 << (k - 1));\r\n\r\n    external = true;\r\n\r\n    return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n   *\r\n   */\r\n  P.isFinite = function () {\r\n    return !!this.d;\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.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this Decimal is NaN, otherwise return false.\r\n   *\r\n   */\r\n  P.isNaN = function () {\r\n    return !this.s;\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 or -0, otherwise return false.\r\n   *\r\n   */\r\n  P.isZero = function () {\r\n    return !!this.d && this.d[0] === 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, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * If no base is specified, return log[10](arg).\r\n   *\r\n   * log[base](arg) = ln(arg) / ln(base)\r\n   *\r\n   * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n   * otherwise:\r\n   *\r\n   * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n   * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n   * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n   *\r\n   * log[-b](a)       = NaN\r\n   * log[0](a)        = NaN\r\n   * log[1](a)        = NaN\r\n   * log[NaN](a)      = NaN\r\n   * log[Infinity](a) = NaN\r\n   * log[b](0)        = -Infinity\r\n   * log[b](-0)       = -Infinity\r\n   * log[b](-a)       = NaN\r\n   * log[b](1)        = 0\r\n   * log[b](Infinity) = Infinity\r\n   * log[b](NaN)      = NaN\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 isBase10, d, denominator, k, inf, num, sd, r,\r\n      arg = this,\r\n      Ctor = arg.constructor,\r\n      pr = Ctor.precision,\r\n      rm = Ctor.rounding,\r\n      guard = 5;\r\n\r\n    // Default base is 10.\r\n    if (base == null) {\r\n      base = new Ctor(10);\r\n      isBase10 = true;\r\n    } else {\r\n      base = new Ctor(base);\r\n      d = base.d;\r\n\r\n      // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n      if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n      isBase10 = base.eq(10);\r\n    }\r\n\r\n    d = arg.d;\r\n\r\n    // Is arg negative, non-finite, 0 or 1?\r\n    if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n      return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n    }\r\n\r\n    // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n    // integer power of 10.\r\n    if (isBase10) {\r\n      if (d.length > 1) {\r\n        inf = true;\r\n      } else {\r\n        for (k = d[0]; k % 10 === 0;) k /= 10;\r\n        inf = k !== 1;\r\n      }\r\n    }\r\n\r\n    external = false;\r\n    sd = pr + guard;\r\n    num = naturalLogarithm(arg, sd);\r\n    denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n    // The result will have 5 rounding digits.\r\n    r = divide(num, denominator, sd, 1);\r\n\r\n    // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n    // calculate 10 further digits.\r\n    //\r\n    // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n    // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n    // further digits, the last 14 are nines, round up and assume the result is exact.\r\n    // Also assume the result is exact if the last 14 are zero.\r\n    //\r\n    // Example of a result that will be incorrectly rounded:\r\n    // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n    // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n    // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n    // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n    // place is still 2.6.\r\n    if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n      do {\r\n        sd += 10;\r\n        num = naturalLogarithm(arg, sd);\r\n        denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n        r = divide(num, denominator, sd, 1);\r\n\r\n        if (!inf) {\r\n\r\n          // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n          if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n            r = finalise(r, pr + 1, 0);\r\n          }\r\n\r\n          break;\r\n        }\r\n      } while (checkRoundingDigits(r.d, k += 10, rm));\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, pr, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.max = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'lt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n  P.min = function () {\r\n    Array.prototype.push.call(arguments, this);\r\n    return maxOrMin(this.constructor, arguments, 'gt');\r\n  };\r\n   */\r\n\r\n\r\n  /*\r\n   *  n - 0 = n\r\n   *  n - N = N\r\n   *  n - I = -I\r\n   *  0 - n = -n\r\n   *  0 - 0 = 0\r\n   *  0 - N = N\r\n   *  0 - I = -I\r\n   *  N - n = N\r\n   *  N - 0 = N\r\n   *  N - N = N\r\n   *  N - I = N\r\n   *  I - n = I\r\n   *  I - 0 = I\r\n   *  I - N = N\r\n   *  I - I = N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.minus = P.sub = function (y) {\r\n    var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return y negated if x is finite and y is ±Infinity.\r\n      else if (x.d) y.s = -y.s;\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with different signs.\r\n      // Return NaN if both are ±Infinity with the same sign.\r\n      else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n    // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.plus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return y negated if x is zero and y is non-zero.\r\n      if (yd[0]) y.s = -y.s;\r\n\r\n      // Return x if y is zero and x is non-zero.\r\n      else if (xd[0]) y = new Ctor(x);\r\n\r\n      // Return zero if both are zero.\r\n      // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n      else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    e = mathfloor(y.e / LOG_BASE);\r\n    xe = mathfloor(x.e / LOG_BASE);\r\n\r\n    xd = xd.slice();\r\n    k = xe - e;\r\n\r\n    // If base 1e7 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\r\n      // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n      // rounding by 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\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(rm === 3 ? -0 : 0);\r\n\r\n    y.d = xd;\r\n    y.e = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   *   n % 0 =  N\r\n   *   n % N =  N\r\n   *   n % I =  n\r\n   *   0 % n =  0\r\n   *  -0 % n = -0\r\n   *   0 % 0 =  N\r\n   *   0 % N =  N\r\n   *   0 % I =  0\r\n   *   N % n =  N\r\n   *   N % 0 =  N\r\n   *   N % N =  N\r\n   *   N % I =  N\r\n   *   I % n =  N\r\n   *   I % 0 =  N\r\n   *   I % N =  N\r\n   *   I % I =  N\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * The result depends on the modulo mode.\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\r\n    y = new Ctor(y);\r\n\r\n    // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n    if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n    // Return x if y is ±Infinity or x is ±0.\r\n    if (!y.d || x.d && !x.d[0]) {\r\n      return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n    }\r\n\r\n    // Prevent rounding of intermediate calculations.\r\n    external = false;\r\n\r\n    if (Ctor.modulo == 9) {\r\n\r\n      // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n      // result = x - q * y    where  0 <= result < abs(y)\r\n      q = divide(x, y.abs(), 0, 3, 1);\r\n      q.s *= y.s;\r\n    } else {\r\n      q = divide(x, y, 0, Ctor.modulo, 1);\r\n    }\r\n\r\n    q = q.times(y);\r\n\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, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalExponential = P.exp = function () {\r\n    return naturalExponential(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   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.naturalLogarithm = P.ln = function () {\r\n    return naturalLogarithm(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;\r\n    return finalise(x);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n + 0 = n\r\n   *  n + N = N\r\n   *  n + I = I\r\n   *  0 + n = n\r\n   *  0 + 0 = 0\r\n   *  0 + N = N\r\n   *  0 + I = I\r\n   *  N + n = N\r\n   *  N + 0 = N\r\n   *  N + N = N\r\n   *  N + I = N\r\n   *  I + n = I\r\n   *  I + 0 = I\r\n   *  I + N = N\r\n   *  I + I = I\r\n   *\r\n   * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   */\r\n  P.plus = P.add = function (y) {\r\n    var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    y = new Ctor(y);\r\n\r\n    // If either is not finite...\r\n    if (!x.d || !y.d) {\r\n\r\n      // Return NaN if either is NaN.\r\n      if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n      // Return x if y is finite and x is ±Infinity.\r\n      // Return x if both are ±Infinity with the same sign.\r\n      // Return NaN if both are ±Infinity with different signs.\r\n      // Return y if x is finite and y is ±Infinity.\r\n      else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n      return y;\r\n    }\r\n\r\n     // If signs differ...\r\n    if (x.s != y.s) {\r\n      y.s = -y.s;\r\n      return x.minus(y);\r\n    }\r\n\r\n    xd = x.d;\r\n    yd = y.d;\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    // If either is zero...\r\n    if (!xd[0] || !yd[0]) {\r\n\r\n      // Return x if y is zero.\r\n      // Return y if y is non-zero.\r\n      if (!yd[0]) y = new Ctor(x);\r\n\r\n      return external ? finalise(y, pr, rm) : y;\r\n    }\r\n\r\n    // x and y are finite, non-zero numbers with the same sign.\r\n\r\n    // Calculate base 1e7 exponents.\r\n    k = mathfloor(x.e / LOG_BASE);\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\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\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 = getBase10Exponent(xd, e);\r\n\r\n    return external ? finalise(y, pr, rm) : 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 k,\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    if (x.d) {\r\n      k = getPrecision(x.d);\r\n      if (z && x.e + 1 > k) k = x.e + 1;\r\n    } else {\r\n      k = NaN;\r\n    }\r\n\r\n    return k;\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.round = function () {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-1, 1]\r\n   *\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   *\r\n   * sin(0)         = 0\r\n   * sin(-0)        = -0\r\n   * sin(Infinity)  = NaN\r\n   * sin(-Infinity) = NaN\r\n   * sin(NaN)       = NaN\r\n   *\r\n   */\r\n  P.sine = P.sin = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n    Ctor.rounding = 1;\r\n\r\n    x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   *  sqrt(-n) =  N\r\n   *  sqrt(N)  =  N\r\n   *  sqrt(-I) =  N\r\n   *  sqrt(I)  =  I\r\n   *  sqrt(0)  =  0\r\n   *  sqrt(-0) = -0\r\n   *\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var m, n, sd, r, rep, t,\r\n      x = this,\r\n      d = x.d,\r\n      e = x.e,\r\n      s = x.s,\r\n      Ctor = x.constructor;\r\n\r\n    // Negative/NaN/Infinity/zero?\r\n    if (s !== 1 || !d || !d[0]) {\r\n      return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n    }\r\n\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(d);\r\n\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    sd = (e = Ctor.precision) + 3;\r\n\r\n    // Newton-Raphson iteration.\r\n    for (;;) {\r\n      t = r;\r\n      r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n      // TODO? Replace with for-loop and checkRoundingDigits.\r\n      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n        n = n.slice(sd - 3, sd + 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 (n == '9999' || !rep && 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          if (!rep) {\r\n            finalise(t, e + 1, 0);\r\n\r\n            if (t.times(t).eq(x)) {\r\n              r = t;\r\n              break;\r\n            }\r\n          }\r\n\r\n          sd += 4;\r\n          rep = 1;\r\n        } else {\r\n\r\n          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n          // If not, then there are further digits and m will be truthy.\r\n          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n            // Truncate to the first rounding digit.\r\n            finalise(r, e + 1, 1);\r\n            m = !r.times(r).eq(x);\r\n          }\r\n\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return finalise(r, e, Ctor.rounding, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-Infinity, Infinity]\r\n   *\r\n   * tan(0)         = 0\r\n   * tan(-0)        = -0\r\n   * tan(Infinity)  = NaN\r\n   * tan(-Infinity) = NaN\r\n   * tan(NaN)       = NaN\r\n   *\r\n   */\r\n  P.tangent = P.tan = function () {\r\n    var pr, rm,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (!x.isFinite()) return new Ctor(NaN);\r\n    if (x.isZero()) return new Ctor(x);\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n    Ctor.precision = pr + 10;\r\n    Ctor.rounding = 1;\r\n\r\n    x = x.sin();\r\n    x.s = 1;\r\n    x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n    Ctor.precision = pr;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n  };\r\n\r\n\r\n  /*\r\n   *  n * 0 = 0\r\n   *  n * N = N\r\n   *  n * I = I\r\n   *  0 * n = 0\r\n   *  0 * 0 = 0\r\n   *  0 * N = N\r\n   *  0 * I = N\r\n   *  N * n = N\r\n   *  N * 0 = N\r\n   *  N * N = N\r\n   *  N * I = N\r\n   *  I * n = I\r\n   *  I * 0 = N\r\n   *  I * N = N\r\n   *  I * I = I\r\n   *\r\n   * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\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    y.s *= x.s;\r\n\r\n     // If either is NaN, ±Infinity or ±0...\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n        // Return NaN if either is NaN.\r\n        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n        ? NaN\r\n\r\n        // Return ±Infinity if either is ±Infinity.\r\n        // Return ±0 if either is ±0.\r\n        : !xd || !yd ? y.s / 0 : y.s * 0);\r\n    }\r\n\r\n    e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\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 = getBase10Exponent(r, e);\r\n\r\n    return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential 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.toBinary = function (sd, rm) {\r\n    return toStringBinary(this, 2, sd, rm);\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 finalise(x, dp + x.e + 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 = finiteToString(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 = finalise(new Ctor(x), dp + 1, rm);\r\n      str = finiteToString(x, true, dp + 1);\r\n    }\r\n\r\n    return x.isNeg() && !x.isZero() ? '-' + str : 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) {\r\n      str = finiteToString(x);\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      y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n      str = finiteToString(y, false, dp + y.e + 1);\r\n    }\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 an array representing the value of this Decimal as a simple fraction with an integer\r\n   * numerator and an integer denominator.\r\n   *\r\n   * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n   * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n   * value necessary to represent the number exactly.\r\n   *\r\n   * [maxD] {number|string|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n   *\r\n   */\r\n  P.toFraction = function (maxD) {\r\n    var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n      x = this,\r\n      xd = x.d,\r\n      Ctor = x.constructor;\r\n\r\n    if (!xd) return new Ctor(x);\r\n\r\n    n1 = d0 = new Ctor(1);\r\n    d1 = n0 = new Ctor(0);\r\n\r\n    d = new Ctor(d1);\r\n    e = d.e = getPrecision(xd) - x.e - 1;\r\n    k = e % LOG_BASE;\r\n    d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n    if (maxD == null) {\r\n\r\n      // d is 10**e, the minimum max-denominator needed.\r\n      maxD = e > 0 ? d : n1;\r\n    } else {\r\n      n = new Ctor(maxD);\r\n      if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n      maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n    }\r\n\r\n    external = false;\r\n    n = new Ctor(digitsToString(xd));\r\n    pr = Ctor.precision;\r\n    Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n    for (;;)  {\r\n      q = divide(n, d, 0, 1, 1);\r\n      d2 = d0.plus(q.times(d1));\r\n      if (d2.cmp(maxD) == 1) break;\r\n      d0 = d1;\r\n      d1 = d2;\r\n      d2 = n1;\r\n      n1 = n0.plus(q.times(d2));\r\n      n0 = d2;\r\n      d2 = d;\r\n      d = n.minus(q.times(d2));\r\n      n = d2;\r\n    }\r\n\r\n    d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n    n0 = n0.plus(d2.times(n1));\r\n    d0 = d0.plus(d2.times(d1));\r\n    n0.s = n1.s = x.s;\r\n\r\n    // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n    r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n        ? [n1, d1] : [n0, d0];\r\n\r\n    Ctor.precision = pr;\r\n    external = true;\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 in base 16, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential 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.toHexadecimal = P.toHex = function (sd, rm) {\r\n    return toStringBinary(this, 16, sd, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n   * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n   *\r\n   * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n   * or `y` is NaN, in which case the return value will be also be NaN.\r\n   *\r\n   * The return value is not affected by the value of `precision`.\r\n   *\r\n   * y {number|string|Decimal} The magnitude to round to a multiple of.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * 'toNearest() rounding mode not an integer: {rm}'\r\n   * 'toNearest() rounding mode out of range: {rm}'\r\n   *\r\n   */\r\n  P.toNearest = function (y, rm) {\r\n    var x = this,\r\n      Ctor = x.constructor;\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (y == null) {\r\n\r\n      // If x is not finite, return x.\r\n      if (!x.d) return x;\r\n\r\n      y = new Ctor(1);\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      y = new Ctor(y);\r\n      if (rm === void 0) {\r\n        rm = Ctor.rounding;\r\n      } else {\r\n        checkInt32(rm, 0, 8);\r\n      }\r\n\r\n      // If x is not finite, return x if y is not NaN, else NaN.\r\n      if (!x.d) return y.s ? x : y;\r\n\r\n      // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n      if (!y.d) {\r\n        if (y.s) y.s = x.s;\r\n        return y;\r\n      }\r\n    }\r\n\r\n    // If y is not zero, calculate the nearest multiple of y to x.\r\n    if (y.d[0]) {\r\n      external = false;\r\n      x = divide(x, y, 0, rm, 1).times(y);\r\n      external = true;\r\n      finalise(x);\r\n\r\n    // If y is zero, return zero with the sign of x.\r\n    } else {\r\n      y.s = x.s;\r\n      x = y;\r\n    }\r\n\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this Decimal converted to a number primitive.\r\n   * Zero keeps its sign.\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 string representing the value of this Decimal in base 8, round to `sd` significant\r\n   * digits using rounding mode `rm`.\r\n   *\r\n   * If the optional `sd` argument is present then return binary exponential 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.toOctal = function (sd, rm) {\r\n    return toStringBinary(this, 8, sd, rm);\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`, rounded\r\n   * to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * ECMAScript compliant.\r\n   *\r\n   *   pow(x, NaN)                           = NaN\r\n   *   pow(x, ±0)                            = 1\r\n\r\n   *   pow(NaN, non-zero)                    = NaN\r\n   *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n   *   pow(abs(x) > 1, -Infinity)            = +0\r\n   *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n   *   pow(abs(x) < 1, +Infinity)            = +0\r\n   *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n   *   pow(+Infinity, y > 0)                 = +Infinity\r\n   *   pow(+Infinity, y < 0)                 = +0\r\n   *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n   *   pow(-Infinity, even integer > 0)      = +Infinity\r\n   *   pow(-Infinity, odd integer < 0)       = -0\r\n   *   pow(-Infinity, even integer < 0)      = +0\r\n   *   pow(+0, y > 0)                        = +0\r\n   *   pow(+0, y < 0)                        = +Infinity\r\n   *   pow(-0, odd integer > 0)              = -0\r\n   *   pow(-0, even integer > 0)             = +0\r\n   *   pow(-0, odd integer < 0)              = -Infinity\r\n   *   pow(-0, even integer < 0)             = +Infinity\r\n   *   pow(finite x < 0, finite non-integer) = NaN\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   * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n   * probability of an incorrectly rounded result\r\n   * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n   * i.e. 1 in 250,000,000,000,000\r\n   *\r\n   * If a result is incorrectly rounded the maximum error will be 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, rm, s,\r\n      x = this,\r\n      Ctor = x.constructor,\r\n      yn = +(y = new Ctor(y));\r\n\r\n    // Either ±Infinity, NaN or ±0?\r\n    if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n    x = new Ctor(x);\r\n\r\n    if (x.eq(1)) return x;\r\n\r\n    pr = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n\r\n    if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n    // y exponent\r\n    e = mathfloor(y.e / LOG_BASE);\r\n\r\n    // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n    if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n      r = intPow(Ctor, x, k, pr);\r\n      return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n    }\r\n\r\n    s = x.s;\r\n\r\n    // if x is negative\r\n    if (s < 0) {\r\n\r\n      // if y is not an integer\r\n      if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n      // Result is positive if x is negative and the last digit of integer y is even.\r\n      if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n      // if x.eq(-1)\r\n      if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n        x.s = s;\r\n        return x;\r\n      }\r\n    }\r\n\r\n    // Estimate result exponent.\r\n    // x^y = 10^e,  where e = y * log10(x)\r\n    // log10(x) = log10(x_significand) + x_exponent\r\n    // log10(x_significand) = ln(x_significand) / ln(10)\r\n    k = mathpow(+x, yn);\r\n    e = k == 0 || !isFinite(k)\r\n      ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n      : new Ctor(k + '').e;\r\n\r\n    // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n    // Overflow/underflow?\r\n    if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n    external = false;\r\n    Ctor.rounding = x.s = 1;\r\n\r\n    // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n    // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n    // new Decimal(2.32456).pow('2087987436534566.46411')\r\n    // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n    k = Math.min(12, (e + '').length);\r\n\r\n    // r = x^y = exp(y*ln(x))\r\n    r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n    // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n    if (r.d) {\r\n\r\n      // Truncate to the required precision plus five rounding digits.\r\n      r = finalise(r, pr + 5, 1);\r\n\r\n      // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n      // the result.\r\n      if (checkRoundingDigits(r.d, pr, rm)) {\r\n        e = pr + 10;\r\n\r\n        // Truncate to the increased precision plus five rounding digits.\r\n        r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n        // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n        if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n      }\r\n    }\r\n\r\n    r.s = s;\r\n    external = true;\r\n    Ctor.rounding = rm;\r\n\r\n    return finalise(r, pr, rm);\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 str,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n\r\n    if (sd === void 0) {\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.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 = finalise(new Ctor(x), sd, rm);\r\n      str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n    }\r\n\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 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   * 'toSD() digits out of range: {sd}'\r\n   * 'toSD() digits not an integer: {sd}'\r\n   * 'toSD() rounding mode not an integer: {rm}'\r\n   * 'toSD() rounding mode out of range: {rm}'\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 finalise(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 = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\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 truncated to a whole number.\r\n   *\r\n   */\r\n  P.truncated = P.trunc = function () {\r\n    return finalise(new this.constructor(this), this.e + 1, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this Decimal.\r\n   * Unlike `toString`, negative zero will include the minus sign.\r\n   *\r\n   */\r\n  P.valueOf = P.toJSON = function () {\r\n    var x = this,\r\n      Ctor = x.constructor,\r\n      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n    return x.isNeg() ? '-' + str : str;\r\n  };\r\n\r\n\r\n  /*\r\n  // Add aliases to match BigDecimal method names.\r\n  // P.add = P.plus;\r\n  P.subtract = P.minus;\r\n  P.multiply = P.times;\r\n  P.divide = P.div;\r\n  P.remainder = P.mod;\r\n  P.compareTo = P.cmp;\r\n  P.negate = P.neg;\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   *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n   *                           finiteToString, naturalExponential, naturalLogarithm\r\n   *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n   *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n   *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n   *  convertBase              toStringBinary, parseOther\r\n   *  cos                      P.cos\r\n   *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n   *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n   *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n   *                           taylorSeries, atan2, parseOther\r\n   *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n   *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n   *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n   *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n   *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n   *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n   *                           naturalLogarithm, ceil, floor, round, trunc\r\n   *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n   *                           toStringBinary\r\n   *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n   *  getLn10                  P.logarithm, naturalLogarithm\r\n   *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n   *  getPrecision             P.precision, P.toFraction\r\n   *  getZeroString            digitsToString, finiteToString\r\n   *  intPow                   P.toPower, parseOther\r\n   *  isOdd                    toLessThanHalfPi\r\n   *  maxOrMin                 max, min\r\n   *  naturalExponential       P.naturalExponential, P.toPower\r\n   *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n   *                           P.toPower, naturalExponential\r\n   *  nonFiniteToString        finiteToString, toStringBinary\r\n   *  parseDecimal             Decimal\r\n   *  parseOther               Decimal\r\n   *  sin                      P.sin\r\n   *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n   *  toLessThanHalfPi         P.cos, P.sin\r\n   *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n   *  truncate                 intPow\r\n   *\r\n   *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n   *                           naturalLogarithm, config, parseOther, random, Decimal\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  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  /*\r\n   * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n   * `repeating == null` if caller is `log` or `pow`,\r\n   * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n   */\r\n  function checkRoundingDigits(d, i, rm, repeating) {\r\n    var di, k, r, rd;\r\n\r\n    // Get the length of the first word of the array d.\r\n    for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n    // Is the rounding digit in the first word of d?\r\n    if (--i < 0) {\r\n      i += LOG_BASE;\r\n      di = 0;\r\n    } else {\r\n      di = Math.ceil((i + 1) / LOG_BASE);\r\n      i %= LOG_BASE;\r\n    }\r\n\r\n    // i is the index (0 - 6) of the rounding digit.\r\n    // E.g. if within the word 3487563 the first rounding digit is 5,\r\n    // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n    k = mathpow(10, LOG_BASE - i);\r\n    rd = d[di] % k | 0;\r\n\r\n    if (repeating == null) {\r\n      if (i < 3) {\r\n        if (i == 0) rd = rd / 100 | 0;\r\n        else if (i == 1) rd = rd / 10 | 0;\r\n        r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n      } else {\r\n        r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n            (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n      }\r\n    } else {\r\n      if (i < 4) {\r\n        if (i == 0) rd = rd / 1000 | 0;\r\n        else if (i == 1) rd = rd / 100 | 0;\r\n        else if (i == 2) rd = rd / 10 | 0;\r\n        r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n      } else {\r\n        r = ((repeating || rm < 4) && rd + 1 == k ||\r\n        (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n          (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  // Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n  // Eg. convertBase('255', 10, 16) returns [15, 15].\r\n  // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\n  function convertBase(str, baseIn, baseOut) {\r\n    var j,\r\n      arr = [0],\r\n      arrL,\r\n      i = 0,\r\n      strL = str.length;\r\n\r\n    for (; i < strL;) {\r\n      for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n      arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n      for (j = 0; j < arr.length; j++) {\r\n        if (arr[j] > baseOut - 1) {\r\n          if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n          arr[j + 1] += arr[j] / baseOut | 0;\r\n          arr[j] %= baseOut;\r\n        }\r\n      }\r\n    }\r\n\r\n    return arr.reverse();\r\n  }\r\n\r\n\r\n  /*\r\n   * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function cosine(Ctor, x) {\r\n    var k, y,\r\n      len = x.d.length;\r\n\r\n    // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n    // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      y = Math.pow(4, -k).toString();\r\n    } else {\r\n      k = 16;\r\n      y = '2.3283064365386962890625e-10';\r\n    }\r\n\r\n    Ctor.precision += k;\r\n\r\n    x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n    // Reverse argument reduction\r\n    for (var i = k; i--;) {\r\n      var cos2x = x.times(x);\r\n      x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n    }\r\n\r\n    Ctor.precision -= k;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Perform division in the specified base.\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, base) {\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, base) {\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, rm, dp, base) {\r\n      var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n        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 NaN, Infinity or 0?\r\n      if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n        return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n          !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n          xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n      }\r\n\r\n      if (base) {\r\n        logBase = 1;\r\n        e = x.e - y.e;\r\n      } else {\r\n        base = BASE;\r\n        logBase = LOG_BASE;\r\n        e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n      }\r\n\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      // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n      for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n      if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n      if (pr == null) {\r\n        sd = pr = Ctor.precision;\r\n        rm = Ctor.rounding;\r\n      } else if (dp) {\r\n        sd = pr + (x.e - y.e) + 1;\r\n      } else {\r\n        sd = pr;\r\n      }\r\n\r\n      if (sd < 0) {\r\n        qd.push(1);\r\n        more = true;\r\n      } else {\r\n\r\n        // Convert precision in number of base 10 digits to base 1e7 digits.\r\n        sd = sd / logBase + 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          more = k || i < xL;\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, base);\r\n            xd = multiplyInteger(xd, k, base);\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, base);\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, base);\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, base);\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, base);\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          more = rem[0] !== void 0;\r\n        }\r\n\r\n        // Leading zero?\r\n        if (!qd[0]) qd.shift();\r\n      }\r\n\r\n      // logBase is 1 when divide is being used for base conversion.\r\n      if (logBase == 1) {\r\n        q.e = e;\r\n        inexact = more;\r\n      } else {\r\n\r\n        // To calculate q.e, first get the number of digits of qd[0].\r\n        for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n        q.e = i + e * logBase - 1;\r\n\r\n        finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n      }\r\n\r\n      return q;\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n   * Check for over/under-flow.\r\n   */\r\n   function finalise(x, sd, rm, isTruncated) {\r\n    var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n      Ctor = x.constructor;\r\n\r\n    // Don't round if sd is null or undefined.\r\n    out: if (sd != null) {\r\n      xd = x.d;\r\n\r\n      // Infinity/NaN.\r\n      if (!xd) return x;\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 containing rd, a base 1e7 number.\r\n      // xdi: the index of w within xd.\r\n      // digits: 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 (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n      i = sd - digits;\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\r\n        // Get the rounding digit at index j of w.\r\n        rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      } else {\r\n        xdi = Math.ceil((i + 1) / LOG_BASE);\r\n        k = xd.length;\r\n        if (xdi >= k) {\r\n          if (isTruncated) {\r\n\r\n            // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n            for (; k++ <= xdi;) xd.push(0);\r\n            w = rd = 0;\r\n            digits = 1;\r\n            i %= LOG_BASE;\r\n            j = i - LOG_BASE + 1;\r\n          } else {\r\n            break out;\r\n          }\r\n        } else {\r\n          w = k = xd[xdi];\r\n\r\n          // Get the number of digits of w.\r\n          for (digits = 1; k >= 10; k /= 10) digits++;\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 - digits.\r\n          j = i - LOG_BASE + digits;\r\n\r\n          // Get the rounding digit at index j of w.\r\n          rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n        }\r\n      }\r\n\r\n      // Are there any non-zero digits after the rounding digit?\r\n      isTruncated = isTruncated || sd < 0 ||\r\n        xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n      // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n      // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n      // will give 714.\r\n\r\n      roundUp = rm < 4\r\n        ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n        : rd > 5 || rd == 5 && (rm == 4 || isTruncated || 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, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n            rm == (x.s < 0 ? 8 : 7));\r\n\r\n      if (sd < 1 || !xd[0]) {\r\n        xd.length = 0;\r\n        if (roundUp) {\r\n\r\n          // Convert sd to decimal places.\r\n          sd -= x.e + 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 = -sd || 0;\r\n        } else {\r\n\r\n          // Zero.\r\n          xd[0] = x.e = 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, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n      }\r\n\r\n      if (roundUp) {\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\r\n            // i will be the length of xd[0] before k is added.\r\n            for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n            j = xd[0] += k;\r\n            for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n            // if i != k the length has increased.\r\n            if (i != k) {\r\n              x.e++;\r\n              if (xd[0] == BASE) xd[0] = 1;\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\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > Ctor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < Ctor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // Ctor.underflow = true;\r\n      } // else Ctor.underflow = false;\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function finiteToString(x, isExp, sd) {\r\n    if (!x.isFinite()) return nonFiniteToString(x);\r\n    var k,\r\n      e = x.e,\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 + (x.e < 0 ? 'e' : 'e+') + x.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 str;\r\n  }\r\n\r\n\r\n  // Calculate the base 10 exponent from the base 1e7 exponent.\r\n  function getBase10Exponent(digits, e) {\r\n    var w = digits[0];\r\n\r\n    // Add the number of digits of the first word of the digits array.\r\n    for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n    return e;\r\n  }\r\n\r\n\r\n  function getLn10(Ctor, sd, pr) {\r\n    if (sd > LN10_PRECISION) {\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(precisionLimitExceeded);\r\n    }\r\n    return finalise(new Ctor(LN10), sd, 1, true);\r\n  }\r\n\r\n\r\n  function getPi(Ctor, sd, rm) {\r\n    if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n    return finalise(new Ctor(PI), sd, rm, true);\r\n  }\r\n\r\n\r\n  function getPrecision(digits) {\r\n    var w = digits.length - 1,\r\n      len = w * LOG_BASE + 1;\r\n\r\n    w = digits[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) len--;\r\n\r\n      // Add the number of digits of the first word.\r\n      for (w = digits[0]; w >= 10; w /= 10) len++;\r\n    }\r\n\r\n    return len;\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 value of Decimal `x` to the power `n`, where `n` is an\r\n   * integer of type number.\r\n   *\r\n   * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n   *\r\n   */\r\n  function intPow(Ctor, x, n, pr) {\r\n    var isTruncated,\r\n      r = new Ctor(1),\r\n\r\n      // Max n of 9007199254740991 takes 53 loop iterations.\r\n      // Maximum digits array length; leaves [28, 34] guard digits.\r\n      k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n    external = false;\r\n\r\n    for (;;) {\r\n      if (n % 2) {\r\n        r = r.times(x);\r\n        if (truncate(r.d, k)) isTruncated = true;\r\n      }\r\n\r\n      n = mathfloor(n / 2);\r\n      if (n === 0) {\r\n\r\n        // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n        n = r.d.length - 1;\r\n        if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n        break;\r\n      }\r\n\r\n      x = x.times(x);\r\n      truncate(x.d, k);\r\n    }\r\n\r\n    external = true;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  function isOdd(n) {\r\n    return n.d[n.d.length - 1] & 1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n   */\r\n  function maxOrMin(Ctor, args, ltgt) {\r\n    var y,\r\n      x = new Ctor(args[0]),\r\n      i = 0;\r\n\r\n    for (; ++i < args.length;) {\r\n      y = new Ctor(args[i]);\r\n      if (!y.s) {\r\n        x = y;\r\n        break;\r\n      } else if (x[ltgt](y)) {\r\n        x = y;\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n   * 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   * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n   * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n   *\r\n   *  exp(Infinity)  = Infinity\r\n   *  exp(-Infinity) = 0\r\n   *  exp(NaN)       = NaN\r\n   *  exp(±0)        = 1\r\n   *\r\n   *  exp(x) is non-terminating for any finite, non-zero x.\r\n   *\r\n   *  The result will always be correctly rounded.\r\n   *\r\n   */\r\n  function naturalExponential(x, sd) {\r\n    var denominator, guard, j, pow, sum, t, wpr,\r\n      rep = 0,\r\n      i = 0,\r\n      k = 0,\r\n      Ctor = x.constructor,\r\n      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // 0/NaN/Infinity?\r\n    if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n      return new Ctor(x.d\r\n        ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n        : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n    }\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 abs(x) >= 0.1\r\n    while (x.e > -2) {\r\n\r\n      // x = x / 2^5\r\n      x = x.times(t);\r\n      k += 5;\r\n    }\r\n\r\n    // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n    // 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(1);\r\n    Ctor.precision = wpr;\r\n\r\n    for (;;) {\r\n      pow = finalise(pow.times(x), wpr, 1);\r\n      denominator = denominator.times(++i);\r\n      t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n        j = k;\r\n        while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n        // Check to see if the first 4 rounding digits are [49]999.\r\n        // If so, repeat the summation with a higher precision, otherwise\r\n        // e.g. with precision: 18, rounding: 1\r\n        // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n\r\n          if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += 10;\r\n            denominator = pow = t = new Ctor(1);\r\n            i = 0;\r\n            rep++;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n    }\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n   * digits.\r\n   *\r\n   *  ln(-n)        = NaN\r\n   *  ln(0)         = -Infinity\r\n   *  ln(-0)        = -Infinity\r\n   *  ln(1)         = 0\r\n   *  ln(Infinity)  = Infinity\r\n   *  ln(-Infinity) = NaN\r\n   *  ln(NaN)       = NaN\r\n   *\r\n   *  ln(n) (n != 1) is non-terminating.\r\n   *\r\n   */\r\n  function naturalLogarithm(y, sd) {\r\n    var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, 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      rm = Ctor.rounding,\r\n      pr = Ctor.precision;\r\n\r\n    // Is x negative or Infinity, NaN, 0 or 1?\r\n    if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n      return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n    }\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    Ctor.precision = wpr += guard;\r\n    c = digitsToString(xd);\r\n    c0 = c.charAt(0);\r\n\r\n    if (Math.abs(e = x.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 = x.e;\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 = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n      Ctor.precision = pr;\r\n\r\n      return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n    }\r\n\r\n    // x1 is x reduced to a value near 1.\r\n    x1 = x;\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(1), x.plus(1), wpr, 1);\r\n    x2 = finalise(x.times(x), wpr, 1);\r\n    denominator = 3;\r\n\r\n    for (;;) {\r\n      numerator = finalise(numerator.times(x2), wpr, 1);\r\n      t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\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. Check that e is not 0 because, besides preventing an\r\n        // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n        sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n        // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n        // been repeated previously) and the first 4 rounding digits 9999?\r\n        // If so, restart the summation with a higher precision, otherwise\r\n        // e.g. with precision: 12, rounding: 1\r\n        // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n        // `wpr - guard` is the index of first rounding digit.\r\n        if (sd == null) {\r\n          if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n            Ctor.precision = wpr += guard;\r\n            t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n            x2 = finalise(x.times(x), wpr, 1);\r\n            denominator = rep = 1;\r\n          } else {\r\n            return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n          }\r\n        } else {\r\n          Ctor.precision = pr;\r\n          return sum;\r\n        }\r\n      }\r\n\r\n      sum = t;\r\n      denominator += 2;\r\n    }\r\n  }\r\n\r\n\r\n  // ±Infinity, NaN.\r\n  function nonFiniteToString(x) {\r\n    // Unsigned.\r\n    return String(x.s * x.s / 0);\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      x.e = e = e - i - 1;\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) {\r\n\r\n        // Overflow?\r\n        if (x.e > x.constructor.maxE) {\r\n\r\n          // Infinity.\r\n          x.d = null;\r\n          x.e = NaN;\r\n\r\n        // Underflow?\r\n        } else if (x.e < x.constructor.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n          // x.constructor.underflow = true;\r\n        } // else x.constructor.underflow = false;\r\n      }\r\n    } else {\r\n\r\n      // Zero.\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   * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n   */\r\n  function parseOther(x, str) {\r\n    var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n    if (str === 'Infinity' || str === 'NaN') {\r\n      if (!+str) x.s = NaN;\r\n      x.e = NaN;\r\n      x.d = null;\r\n      return x;\r\n    }\r\n\r\n    if (isHex.test(str))  {\r\n      base = 16;\r\n      str = str.toLowerCase();\r\n    } else if (isBinary.test(str))  {\r\n      base = 2;\r\n    } else if (isOctal.test(str))  {\r\n      base = 8;\r\n    } else {\r\n      throw Error(invalidArgument + str);\r\n    }\r\n\r\n    // Is there a binary exponent part?\r\n    i = str.search(/p/i);\r\n\r\n    if (i > 0) {\r\n      p = +str.slice(i + 1);\r\n      str = str.substring(2, i);\r\n    } else {\r\n      str = str.slice(2);\r\n    }\r\n\r\n    // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n    // fraction part will be restored.\r\n    i = str.indexOf('.');\r\n    isFloat = i >= 0;\r\n    Ctor = x.constructor;\r\n\r\n    if (isFloat) {\r\n      str = str.replace('.', '');\r\n      len = str.length;\r\n      i = len - i;\r\n\r\n      // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n      divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n    }\r\n\r\n    xd = convertBase(str, base, BASE);\r\n    xe = xd.length - 1;\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xe; xd[i] === 0; --i) xd.pop();\r\n    if (i < 0) return new Ctor(x.s * 0);\r\n    x.e = getBase10Exponent(xd, xe);\r\n    x.d = xd;\r\n    external = false;\r\n\r\n    // At what precision to perform the division to ensure exact conversion?\r\n    // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n    // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n    // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n    // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n    // Therefore using 4 * the number of digits of str will always be enough.\r\n    if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n    // Multiply by the binary exponent part if present.\r\n    if (p) x = x.times(Math.abs(p) < 54 ? Math.pow(2, p) : Decimal.pow(2, p));\r\n    external = true;\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * sin(x) = x - x^3/3! + x^5/5! - ...\r\n   * |x| < pi/2\r\n   *\r\n   */\r\n  function sine(Ctor, x) {\r\n    var k,\r\n      len = x.d.length;\r\n\r\n    if (len < 3) return taylorSeries(Ctor, 2, x, x);\r\n\r\n    // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n    // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n    // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    // Max k before Math.pow precision loss is 22\r\n    x = x.times(Math.pow(5, -k));\r\n    x = taylorSeries(Ctor, 2, x, x);\r\n\r\n    // Reverse argument reduction\r\n    var sin2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sin2_x = x.times(x);\r\n      x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\n  function taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n    var j, t, u, x2,\r\n      i = 1,\r\n      pr = Ctor.precision,\r\n      k = Math.ceil(pr / LOG_BASE);\r\n\r\n    external = false;\r\n    x2 = x.times(x);\r\n    u = new Ctor(y);\r\n\r\n    for (;;) {\r\n      t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n      y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n      t = u.plus(y);\r\n\r\n      if (t.d[k] !== void 0) {\r\n        for (j = k; t.d[j] === u.d[j] && j--;);\r\n        if (j == -1) break;\r\n      }\r\n\r\n      j = u;\r\n      u = y;\r\n      y = t;\r\n      t = j;\r\n      i++;\r\n    }\r\n\r\n    external = true;\r\n    t.d.length = k + 1;\r\n\r\n    return t;\r\n  }\r\n\r\n\r\n  // Return the absolute value of `x` reduced to less than or equal to half pi.\r\n  function toLessThanHalfPi(Ctor, x) {\r\n    var t,\r\n      isNeg = x.s < 0,\r\n      pi = getPi(Ctor, Ctor.precision, 1),\r\n      halfPi = pi.times(0.5);\r\n\r\n    x = x.abs();\r\n\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isNeg ? 4 : 1;\r\n      return x;\r\n    }\r\n\r\n    t = x.divToInt(pi);\r\n\r\n    if (t.isZero()) {\r\n      quadrant = isNeg ? 3 : 2;\r\n    } else {\r\n      x = x.minus(t.times(pi));\r\n\r\n      // 0 <= x < pi\r\n      if (x.lte(halfPi)) {\r\n        quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n        return x;\r\n      }\r\n\r\n      quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n    }\r\n\r\n    return x.minus(pi).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return the value of Decimal `x` as a string in base `baseOut`.\r\n   *\r\n   * If the optional `sd` argument is present include a binary exponent suffix.\r\n   */\r\n  function toStringBinary(x, baseOut, sd, rm) {\r\n    var base, e, i, k, len, roundUp, str, xd, y,\r\n      Ctor = x.constructor,\r\n      isExp = sd !== void 0;\r\n\r\n    if (isExp) {\r\n      checkInt32(sd, 1, MAX_DIGITS);\r\n      if (rm === void 0) rm = Ctor.rounding;\r\n      else checkInt32(rm, 0, 8);\r\n    } else {\r\n      sd = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    }\r\n\r\n    if (!x.isFinite()) {\r\n      str = nonFiniteToString(x);\r\n    } else {\r\n      str = finiteToString(x);\r\n      i = str.indexOf('.');\r\n\r\n      // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n      // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n      // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n      // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n      if (isExp) {\r\n        base = 2;\r\n        if (baseOut == 16) {\r\n          sd = sd * 4 - 3;\r\n        } else if (baseOut == 8) {\r\n          sd = sd * 3 - 2;\r\n        }\r\n      } else {\r\n        base = baseOut;\r\n      }\r\n\r\n      // Convert the number as an integer then divide the result by its base raised to a power such\r\n      // that the fraction part will be restored.\r\n\r\n      // Non-integer.\r\n      if (i >= 0) {\r\n        str = str.replace('.', '');\r\n        y = new Ctor(1);\r\n        y.e = str.length - i;\r\n        y.d = convertBase(finiteToString(y), 10, base);\r\n        y.e = y.d.length;\r\n      }\r\n\r\n      xd = convertBase(str, 10, base);\r\n      e = len = xd.length;\r\n\r\n      // Remove trailing zeros.\r\n      for (; xd[--len] == 0;) xd.pop();\r\n\r\n      if (!xd[0]) {\r\n        str = isExp ? '0p+0' : '0';\r\n      } else {\r\n        if (i < 0) {\r\n          e--;\r\n        } else {\r\n          x = new Ctor(x);\r\n          x.d = xd;\r\n          x.e = e;\r\n          x = divide(x, y, sd, rm, 0, base);\r\n          xd = x.d;\r\n          e = x.e;\r\n          roundUp = inexact;\r\n        }\r\n\r\n        // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        i = xd[sd];\r\n        k = base / 2;\r\n        roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n        roundUp = rm < 4\r\n          ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n          : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n            rm === (x.s < 0 ? 8 : 7));\r\n\r\n        xd.length = sd;\r\n\r\n        if (roundUp) {\r\n\r\n          // Rounding up may mean the previous digit has to be rounded up and so on.\r\n          for (; ++xd[--sd] > base - 1;) {\r\n            xd[sd] = 0;\r\n            if (!sd) {\r\n              ++e;\r\n              xd.unshift(1);\r\n            }\r\n          }\r\n        }\r\n\r\n        // Determine trailing zeros.\r\n        for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n        // E.g. [4, 11, 15] becomes 4bf.\r\n        for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n        // Add binary exponent suffix?\r\n        if (isExp) {\r\n          if (len > 1) {\r\n            if (baseOut == 16 || baseOut == 8) {\r\n              i = baseOut == 16 ? 4 : 3;\r\n              for (--len; len % i; len++) str += '0';\r\n              xd = convertBase(str, base, baseOut);\r\n              for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n              // xd[0] will always be be 1\r\n              for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n            } else {\r\n              str = str.charAt(0) + '.' + str.slice(1);\r\n            }\r\n          }\r\n\r\n          str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n        } else if (e < 0) {\r\n          for (; ++e;) str = '0' + str;\r\n          str = '0.' + str;\r\n        } else {\r\n          if (++e > len) for (e -= len; e-- ;) str += '0';\r\n          else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n        }\r\n      }\r\n\r\n      str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\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   *  abs\r\n   *  acos\r\n   *  acosh\r\n   *  add\r\n   *  asin\r\n   *  asinh\r\n   *  atan\r\n   *  atanh\r\n   *  atan2\r\n   *  cbrt\r\n   *  ceil\r\n   *  clone\r\n   *  config\r\n   *  cos\r\n   *  cosh\r\n   *  div\r\n   *  exp\r\n   *  floor\r\n   *  hypot\r\n   *  ln\r\n   *  log\r\n   *  log2\r\n   *  log10\r\n   *  max\r\n   *  min\r\n   *  mod\r\n   *  mul\r\n   *  pow\r\n   *  random\r\n   *  round\r\n   *  set\r\n   *  sign\r\n   *  sin\r\n   *  sinh\r\n   *  sqrt\r\n   *  sub\r\n   *  tan\r\n   *  tanh\r\n   *  trunc\r\n   */\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the absolute value of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function abs(x) {\r\n    return new this(x).abs();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function acos(x) {\r\n    return new this(x).acos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function acosh(x) {\r\n    return new this(x).acosh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function add(x, y) {\r\n    return new this(x).plus(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function asin(x) {\r\n    return new this(x).asin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function asinh(x) {\r\n    return new this(x).asinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function atan(x) {\r\n    return new this(x).atan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n   * `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function atanh(x) {\r\n    return new this(x).atanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n   * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * Domain: [-Infinity, Infinity]\r\n   * Range: [-pi, pi]\r\n   *\r\n   * y {number|string|Decimal} The y-coordinate.\r\n   * x {number|string|Decimal} The x-coordinate.\r\n   *\r\n   * atan2(±0, -0)               = ±pi\r\n   * atan2(±0, +0)               = ±0\r\n   * atan2(±0, -x)               = ±pi for x > 0\r\n   * atan2(±0, x)                = ±0 for x > 0\r\n   * atan2(-y, ±0)               = -pi/2 for y > 0\r\n   * atan2(y, ±0)                = pi/2 for y > 0\r\n   * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n   * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n   * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n   * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n   * atan2(±Infinity, +Infinity) = ±pi/4\r\n   * atan2(NaN, x) = NaN\r\n   * atan2(y, NaN) = NaN\r\n   *\r\n   */\r\n  function atan2(y, x) {\r\n    y = new this(y);\r\n    x = new this(x);\r\n    var r,\r\n      pr = this.precision,\r\n      rm = this.rounding,\r\n      wpr = pr + 4;\r\n\r\n    // Either NaN\r\n    if (!y.s || !x.s) {\r\n      r = new this(NaN);\r\n\r\n    // Both ±Infinity\r\n    } else if (!y.d && !x.d) {\r\n      r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n      r.s = y.s;\r\n\r\n    // x is ±Infinity or y is ±0\r\n    } else if (!x.d || y.isZero()) {\r\n      r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n      r.s = y.s;\r\n\r\n    // y is ±Infinity or x is ±0\r\n    } else if (!y.d || x.isZero()) {\r\n      r = getPi(this, wpr, 1).times(0.5);\r\n      r.s = y.s;\r\n\r\n    // Both non-zero and finite\r\n    } else if (x.s < 0) {\r\n      this.precision = wpr;\r\n      this.rounding = 1;\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n      x = getPi(this, wpr, 1);\r\n      this.precision = pr;\r\n      this.rounding = rm;\r\n      r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n    } else {\r\n      r = this.atan(divide(y, x, wpr, 1));\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function cbrt(x) {\r\n    return new this(x).cbrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ceil(x) {\r\n    return finalise(x = new this(x), x.e + 1, 2);\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   *   maxE       {number}\r\n   *   minE       {number}\r\n   *   modulo     {number}\r\n   *   crypto     {boolean|number}\r\n   *   defaults   {true}\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') throw Error(decimalError + 'Object expected');\r\n    var i, p, v,\r\n      useDefaults = obj.defaults === true,\r\n      ps = [\r\n        'precision', 1, MAX_DIGITS,\r\n        'rounding', 0, 8,\r\n        'toExpNeg', -EXP_LIMIT, 0,\r\n        'toExpPos', 0, EXP_LIMIT,\r\n        'maxE', 0, EXP_LIMIT,\r\n        'minE', -EXP_LIMIT, 0,\r\n        'modulo', 0, 9\r\n      ];\r\n\r\n    for (i = 0; i < ps.length; i += 3) {\r\n      if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n      if ((v = obj[p]) !== 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 (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (v === true || v === false || v === 0 || v === 1) {\r\n        if (v) {\r\n          if (typeof crypto != 'undefined' && crypto &&\r\n            (crypto.getRandomValues || crypto.randomBytes)) {\r\n            this[p] = true;\r\n          } else {\r\n            throw Error(cryptoUnavailable);\r\n          }\r\n        } else {\r\n          this[p] = false;\r\n        }\r\n      } else {\r\n        throw Error(invalidArgument + p + ': ' + v);\r\n      }\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cos(x) {\r\n    return new this(x).cos();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function cosh(x) {\r\n    return new this(x).cosh();\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     * v {number|string|Decimal} A numeric value.\r\n     *\r\n     */\r\n    function Decimal(v) {\r\n      var e, i, t,\r\n        x = this;\r\n\r\n      // Decimal called without new.\r\n      if (!(x instanceof Decimal)) return new Decimal(v);\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 (v instanceof Decimal) {\r\n        x.s = v.s;\r\n\r\n        if (external) {\r\n          if (!v.d || v.e > Decimal.maxE) {\r\n\r\n            // Infinity.\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (v.e < Decimal.minE) {\r\n\r\n            // Zero.\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.d = v.d.slice();\r\n          }\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d ? v.d.slice() : v.d;\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      t = typeof v;\r\n\r\n      if (t === 'number') {\r\n        if (v === 0) {\r\n          x.s = 1 / v < 0 ? -1 : 1;\r\n          x.e = 0;\r\n          x.d = [0];\r\n          return;\r\n        }\r\n\r\n        if (v < 0) {\r\n          v = -v;\r\n          x.s = -1;\r\n        } else {\r\n          x.s = 1;\r\n        }\r\n\r\n        // Fast path for small integers.\r\n        if (v === ~~v && v < 1e7) {\r\n          for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n          if (external) {\r\n            if (e > Decimal.maxE) {\r\n              x.e = NaN;\r\n              x.d = null;\r\n            } else if (e < Decimal.minE) {\r\n              x.e = 0;\r\n              x.d = [0];\r\n            } else {\r\n              x.e = e;\r\n              x.d = [v];\r\n            }\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n\r\n          return;\r\n\r\n        // Infinity, NaN.\r\n        } else if (v * 0 !== 0) {\r\n          if (!v) x.s = NaN;\r\n          x.e = NaN;\r\n          x.d = null;\r\n          return;\r\n        }\r\n\r\n        return parseDecimal(x, v.toString());\r\n\r\n      } else if (t !== 'string') {\r\n        throw Error(invalidArgument + v);\r\n      }\r\n\r\n      // Minus sign?\r\n      if (v.charCodeAt(0) === 45) {\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\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    Decimal.EUCLID = 9;\r\n\r\n    Decimal.config = Decimal.set = config;\r\n    Decimal.clone = clone;\r\n    Decimal.isDecimal = isDecimalInstance;\r\n\r\n    Decimal.abs = abs;\r\n    Decimal.acos = acos;\r\n    Decimal.acosh = acosh;        // ES6\r\n    Decimal.add = add;\r\n    Decimal.asin = asin;\r\n    Decimal.asinh = asinh;        // ES6\r\n    Decimal.atan = atan;\r\n    Decimal.atanh = atanh;        // ES6\r\n    Decimal.atan2 = atan2;\r\n    Decimal.cbrt = cbrt;          // ES6\r\n    Decimal.ceil = ceil;\r\n    Decimal.cos = cos;\r\n    Decimal.cosh = cosh;          // ES6\r\n    Decimal.div = div;\r\n    Decimal.exp = exp;\r\n    Decimal.floor = floor;\r\n    Decimal.hypot = hypot;        // ES6\r\n    Decimal.ln = ln;\r\n    Decimal.log = log;\r\n    Decimal.log10 = log10;        // ES6\r\n    Decimal.log2 = log2;          // ES6\r\n    Decimal.max = max;\r\n    Decimal.min = min;\r\n    Decimal.mod = mod;\r\n    Decimal.mul = mul;\r\n    Decimal.pow = pow;\r\n    Decimal.random = random;\r\n    Decimal.round = round;\r\n    Decimal.sign = sign;          // ES6\r\n    Decimal.sin = sin;\r\n    Decimal.sinh = sinh;          // ES6\r\n    Decimal.sqrt = sqrt;\r\n    Decimal.sub = sub;\r\n    Decimal.tan = tan;\r\n    Decimal.tanh = tanh;          // ES6\r\n    Decimal.trunc = trunc;        // ES6\r\n\r\n    if (obj === void 0) obj = {};\r\n    if (obj) {\r\n      if (obj.defaults !== true) {\r\n        ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n        for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n      }\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   * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function div(x, y) {\r\n    return new this(x).div(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The power to which to raise the base of the natural log.\r\n   *\r\n   */\r\n  function exp(x) {\r\n    return new this(x).exp();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function floor(x) {\r\n    return finalise(x = new this(x), x.e + 1, 3);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n   * rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n   *\r\n   */\r\n  function hypot() {\r\n    var i, n,\r\n      t = new this(0);\r\n\r\n    external = false;\r\n\r\n    for (i = 0; i < arguments.length;) {\r\n      n = new this(arguments[i++]);\r\n      if (!n.d) {\r\n        if (n.s) {\r\n          external = true;\r\n          return new this(1 / 0);\r\n        }\r\n        t = n;\r\n      } else if (t.d) {\r\n        t = t.plus(n.times(n));\r\n      }\r\n    }\r\n\r\n    external = true;\r\n\r\n    return t.sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n   * otherwise return false.\r\n   *\r\n   */\r\n  function isDecimalInstance(obj) {\r\n    return obj instanceof Decimal || obj && obj.name === '[object Decimal]' || false;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function ln(x) {\r\n    return new this(x).ln();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n   * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n   *\r\n   * log[y](x)\r\n   *\r\n   * x {number|string|Decimal} The argument of the logarithm.\r\n   * y {number|string|Decimal} The base of the logarithm.\r\n   *\r\n   */\r\n  function log(x, y) {\r\n    return new this(x).log(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log2(x) {\r\n    return new this(x).log(2);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function log10(x) {\r\n    return new this(x).log(10);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the maximum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function max() {\r\n    return maxOrMin(this, arguments, 'lt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the minimum of the arguments.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function min() {\r\n    return maxOrMin(this, arguments, 'gt');\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mod(x, y) {\r\n    return new this(x).mod(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function mul(x, y) {\r\n    return new this(x).mul(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} The base.\r\n   * y {number|string|Decimal} The exponent.\r\n   *\r\n   */\r\n  function pow(x, y) {\r\n    return new this(x).pow(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n   * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n   * are produced).\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n   *\r\n   */\r\n  function random(sd) {\r\n    var d, e, k, n,\r\n      i = 0,\r\n      r = new this(1),\r\n      rd = [];\r\n\r\n    if (sd === void 0) sd = this.precision;\r\n    else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    k = Math.ceil(sd / LOG_BASE);\r\n\r\n    if (!this.crypto) {\r\n      for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n    // Browsers supporting crypto.getRandomValues.\r\n    } else if (crypto.getRandomValues) {\r\n      d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n      for (; i < k;) {\r\n        n = d[i];\r\n\r\n        // 0 <= n < 4294967296\r\n        // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n        if (n >= 4.29e9) {\r\n          d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n        } else {\r\n\r\n          // 0 <= n <= 4289999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd[i++] = n % 1e7;\r\n        }\r\n      }\r\n\r\n    // Node.js supporting crypto.randomBytes.\r\n    } else if (crypto.randomBytes) {\r\n\r\n      // buffer\r\n      d = crypto.randomBytes(k *= 4);\r\n\r\n      for (; i < k;) {\r\n\r\n        // 0 <= n < 2147483648\r\n        n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n        // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n        if (n >= 2.14e9) {\r\n          crypto.randomBytes(4).copy(d, i);\r\n        } else {\r\n\r\n          // 0 <= n <= 2139999999\r\n          // 0 <= (n % 1e7) <= 9999999\r\n          rd.push(n % 1e7);\r\n          i += 4;\r\n        }\r\n      }\r\n\r\n      i = k / 4;\r\n    } else {\r\n      throw Error(cryptoUnavailable);\r\n    }\r\n\r\n    k = rd[--i];\r\n    sd %= LOG_BASE;\r\n\r\n    // Convert trailing digits to zeros according to sd.\r\n    if (k && sd) {\r\n      n = mathpow(10, LOG_BASE - sd);\r\n      rd[i] = (k / n | 0) * n;\r\n    }\r\n\r\n    // Remove trailing words which are zero.\r\n    for (; rd[i] === 0; i--) rd.pop();\r\n\r\n    // Zero?\r\n    if (i < 0) {\r\n      e = 0;\r\n      rd = [0];\r\n    } else {\r\n      e = -1;\r\n\r\n      // Remove leading words which are zero and adjust exponent accordingly.\r\n      for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n      // Count the digits of the first word of rd to determine leading zeros.\r\n      for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n      // Adjust the exponent for leading zeros of the first word of rd.\r\n      if (k < LOG_BASE) e -= LOG_BASE - k;\r\n    }\r\n\r\n    r.e = e;\r\n    r.d = rd;\r\n\r\n    return r;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n   *\r\n   * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function round(x) {\r\n    return finalise(x = new this(x), x.e + 1, this.rounding);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if x > 0,\r\n   *  -1    if x < 0,\r\n   *   0    if x is 0,\r\n   *  -0    if x is -0,\r\n   *   NaN  otherwise\r\n   *\r\n   */\r\n  function sign(x) {\r\n    x = new this(x);\r\n    return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sin(x) {\r\n    return new this(x).sin();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function sinh(x) {\r\n    return new this(x).sinh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function sqrt(x) {\r\n    return new this(x).sqrt();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n   * using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * y {number|string|Decimal}\r\n   *\r\n   */\r\n  function sub(x, y) {\r\n    return new this(x).sub(y);\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n   * digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tan(x) {\r\n    return new this(x).tan();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * x {number|string|Decimal} A value in radians.\r\n   *\r\n   */\r\n  function tanh(x) {\r\n    return new this(x).tanh();\r\n  }\r\n\r\n\r\n  /*\r\n   * Return a new Decimal whose value is `x` truncated to an integer.\r\n   *\r\n   * x {number|string|Decimal}\r\n   *\r\n   */\r\n  function trunc(x) {\r\n    return finalise(x = new this(x), x.e + 1, 1);\r\n  }\r\n\r\n\r\n  // Create and configure initial Decimal constructor.\r\n  Decimal = clone(DEFAULTS);\r\n\r\n  Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n  // Create the internal constants from their string values.\r\n  LN10 = new Decimal(LN10);\r\n  PI = new Decimal(PI);\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    if (typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol') {\r\n      P[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\n      P[Symbol.toStringTag] = 'Decimal';\r\n    }\r\n\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 ? self : window;\r\n    }\r\n\r\n    noConflict = globalScope.Decimal;\r\n    Decimal.noConflict = function () {\r\n      globalScope.Decimal = noConflict;\r\n      return Decimal;\r\n    };\r\n\r\n    globalScope.Decimal = Decimal;\r\n  }\r\n})(this);\r\n","\"use strict\";\n\n// Map the characters to escape to their escaped values. The list is derived\n// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters\n\nvar _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; };\n\nvar defaultEscapes = {\n  \"{\": \"\\\\{\",\n  \"}\": \"\\\\}\",\n  \"\\\\\": \"\\\\textbackslash{}\",\n  \"#\": \"\\\\#\",\n  $: \"\\\\$\",\n  \"%\": \"\\\\%\",\n  \"&\": \"\\\\&\",\n  \"^\": \"\\\\textasciicircum{}\",\n  _: \"\\\\_\",\n  \"~\": \"\\\\textasciitilde{}\"\n};\nvar formatEscapes = {\n  \"\\u2013\": \"\\\\--\",\n  \"\\u2014\": \"\\\\---\",\n  \" \": \"~\",\n  \"\\t\": \"\\\\qquad{}\",\n  \"\\r\\n\": \"\\\\newline{}\",\n  \"\\n\": \"\\\\newline{}\"\n};\n\nvar defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {\n  return _extends({}, defaultEscapes, formatEscapes);\n};\n\n/**\n * Escape a string to be used in LaTeX documents.\n * @param {string} str the string to be escaped.\n * @param {boolean} params.preserveFormatting whether formatting escapes should\n *  be performed (default: false).\n * @param {function} params.escapeMapFn the function to modify the escape maps.\n * @return {string} the escaped string, ready to be used in LaTeX.\n */\nmodule.exports = function (str) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n      _ref$preserveFormatti = _ref.preserveFormatting,\n      preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,\n      _ref$escapeMapFn = _ref.escapeMapFn,\n      escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;\n\n  var runningStr = String(str);\n  var result = \"\";\n\n  var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});\n  var escapeKeys = Object.keys(escapes); // as it is reused later on\n\n  // Algorithm: Go through the string character by character, if it matches\n  // with one of the special characters then we'll replace it with the escaped\n  // version.\n\n  var _loop = function _loop() {\n    var specialCharFound = false;\n    escapeKeys.forEach(function (key, index) {\n      if (specialCharFound) {\n        return;\n      }\n      if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {\n        result += escapes[escapeKeys[index]];\n        runningStr = runningStr.slice(key.length, runningStr.length);\n        specialCharFound = true;\n      }\n    });\n    if (!specialCharFound) {\n      result += runningStr.slice(0, 1);\n      runningStr = runningStr.slice(1, runningStr.length);\n    }\n  };\n\n  while (runningStr) {\n    _loop();\n  }\n  return result;\n};","/**\n * @license Fraction.js v4.0.12 09/09/2015\n * http://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2015, Robert Eisele (robert@xarg.org)\n * Dual licensed under the MIT or GPL Version 2 licenses.\n **/\n\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <nominator>, 1 => <denominator> ]\n * [ n => <nominator>, d => <denominator> ]\n *\n * Integer form\n * - Single integer value\n *\n * Double form\n * - Single double value\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n *\n * var f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n(function(root) {\n\n  \"use strict\";\n\n  // Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n  // Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n  // If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\n  var MAX_CYCLE_LEN = 2000;\n\n  // Parsed data to avoid calling \"new\" all the time\n  var P = {\n    \"s\": 1,\n    \"n\": 0,\n    \"d\": 1\n  };\n\n  function createError(name) {\n\n    function errorConstructor() {\n      var temp = Error.apply(this, arguments);\n      temp['name'] = this['name'] = name;\n      this['stack'] = temp['stack'];\n      this['message'] = temp['message'];\n    }\n\n    /**\n     * Error constructor\n     *\n     * @constructor\n     */\n    function IntermediateInheritor() {}\n    IntermediateInheritor.prototype = Error.prototype;\n    errorConstructor.prototype = new IntermediateInheritor();\n\n    return errorConstructor;\n  }\n\n  var DivisionByZero = Fraction['DivisionByZero'] = createError('DivisionByZero');\n  var InvalidParameter = Fraction['InvalidParameter'] = createError('InvalidParameter');\n\n  function assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throwInvalidParam();\n    }\n    return n * s;\n  }\n\n  function throwInvalidParam() {\n    throw new InvalidParameter();\n  }\n\n  var parse = function(p1, p2) {\n\n    var n = 0, d = 1, s = 1;\n    var v = 0, w = 0, x = 0, y = 1, z = 1;\n\n    var A = 0, B = 1;\n    var C = 1, D = 1;\n\n    var N = 10000000;\n    var M;\n\n    if (p1 === undefined || p1 === null) {\n      /* void */\n    } else if (p2 !== undefined) {\n      n = p1;\n      d = p2;\n      s = n * d;\n    } else\n      switch (typeof p1) {\n\n        case \"object\":\n        {\n          if (\"d\" in p1 && \"n\" in p1) {\n            n = p1[\"n\"];\n            d = p1[\"d\"];\n            if (\"s\" in p1)\n              n *= p1[\"s\"];\n          } else if (0 in p1) {\n            n = p1[0];\n            if (1 in p1)\n              d = p1[1];\n          } else {\n            throwInvalidParam();\n          }\n          s = n * d;\n          break;\n        }\n        case \"number\":\n        {\n          if (p1 < 0) {\n            s = p1;\n            p1 = -p1;\n          }\n\n          if (p1 % 1 === 0) {\n            n = p1;\n          } else if (p1 > 0) { // check for != 0, scale would become NaN (log(0)), which converges really slow\n\n            if (p1 >= 1) {\n              z = Math.pow(10, Math.floor(1 + Math.log(p1) / Math.LN10));\n              p1 /= z;\n            }\n\n            // Using Farey Sequences\n            // http://www.johndcook.com/blog/2010/10/20/best-rational-approximation/\n\n            while (B <= N && D <= N) {\n              M = (A + C) / (B + D);\n\n              if (p1 === M) {\n                if (B + D <= N) {\n                  n = A + C;\n                  d = B + D;\n                } else if (D > B) {\n                  n = C;\n                  d = D;\n                } else {\n                  n = A;\n                  d = B;\n                }\n                break;\n\n              } else {\n\n                if (p1 > M) {\n                  A += C;\n                  B += D;\n                } else {\n                  C += A;\n                  D += B;\n                }\n\n                if (B > N) {\n                  n = C;\n                  d = D;\n                } else {\n                  n = A;\n                  d = B;\n                }\n              }\n            }\n            n *= z;\n          } else if (isNaN(p1) || isNaN(p2)) {\n            d = n = NaN;\n          }\n          break;\n        }\n        case \"string\":\n        {\n          B = p1.match(/\\d+|./g);\n\n          if (B === null)\n            throwInvalidParam();\n\n          if (B[A] === '-') {// Check for minus sign at the beginning\n            s = -1;\n            A++;\n          } else if (B[A] === '+') {// Check for plus sign at the beginning\n            A++;\n          }\n\n          if (B.length === A + 1) { // Check if it's just a simple number \"1234\"\n            w = assign(B[A++], s);\n          } else if (B[A + 1] === '.' || B[A] === '.') { // Check if it's a decimal number\n\n            if (B[A] !== '.') { // Handle 0.5 and .5\n              v = assign(B[A++], s);\n            }\n            A++;\n\n            // Check for decimal places\n            if (A + 1 === B.length || B[A + 1] === '(' && B[A + 3] === ')' || B[A + 1] === \"'\" && B[A + 3] === \"'\") {\n              w = assign(B[A], s);\n              y = Math.pow(10, B[A].length);\n              A++;\n            }\n\n            // Check for repeating places\n            if (B[A] === '(' && B[A + 2] === ')' || B[A] === \"'\" && B[A + 2] === \"'\") {\n              x = assign(B[A + 1], s);\n              z = Math.pow(10, B[A + 1].length) - 1;\n              A += 3;\n            }\n\n          } else if (B[A + 1] === '/' || B[A + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n            w = assign(B[A], s);\n            y = assign(B[A + 2], 1);\n            A += 3;\n          } else if (B[A + 3] === '/' && B[A + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n            v = assign(B[A], s);\n            w = assign(B[A + 2], s);\n            y = assign(B[A + 4], 1);\n            A += 5;\n          }\n\n          if (B.length <= A) { // Check for more tokens on the stack\n            d = y * z;\n            s = /* void */\n                    n = x + d * v + z * w;\n            break;\n          }\n\n          /* Fall through on error */\n        }\n        default:\n          throwInvalidParam();\n      }\n\n    if (d === 0) {\n      throw new DivisionByZero();\n    }\n\n    P[\"s\"] = s < 0 ? -1 : 1;\n    P[\"n\"] = Math.abs(n);\n    P[\"d\"] = Math.abs(d);\n  };\n\n  function modpow(b, e, m) {\n\n    var r = 1;\n    for (; e > 0; b = (b * b) % m, e >>= 1) {\n\n      if (e & 1) {\n        r = (r * b) % m;\n      }\n    }\n    return r;\n  }\n\n\n  function cycleLen(n, d) {\n\n    for (; d % 2 === 0;\n            d /= 2) {\n    }\n\n    for (; d % 5 === 0;\n            d /= 5) {\n    }\n\n    if (d === 1) // Catch non-cyclic numbers\n      return 0;\n\n    // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n    // 10^(d-1) % d == 1\n    // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n    // as we want to translate the numbers to strings.\n\n    var rem = 10 % d;\n    var t = 1;\n\n    for (; rem !== 1; t++) {\n      rem = rem * 10 % d;\n\n      if (t > MAX_CYCLE_LEN)\n        return 0; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n    }\n    return t;\n  }\n\n\n     function cycleStart(n, d, len) {\n\n    var rem1 = 1;\n    var rem2 = modpow(10, len, d);\n\n    for (var t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n      // Solve 10^s == 10^(s+t) (mod d)\n\n      if (rem1 === rem2)\n        return t;\n\n      rem1 = rem1 * 10 % d;\n      rem2 = rem2 * 10 % d;\n    }\n    return 0;\n  }\n\n  function gcd(a, b) {\n\n    if (!a)\n      return b;\n    if (!b)\n      return a;\n\n    while (1) {\n      a %= b;\n      if (!a)\n        return b;\n      b %= a;\n      if (!b)\n        return a;\n    }\n  };\n\n  /**\n   * Module constructor\n   *\n   * @constructor\n   * @param {number|Fraction=} a\n   * @param {number=} b\n   */\n  function Fraction(a, b) {\n\n    if (!(this instanceof Fraction)) {\n      return new Fraction(a, b);\n    }\n\n    parse(a, b);\n\n    if (Fraction['REDUCE']) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse a\n    } else {\n      a = 1;\n    }\n\n    this[\"s\"] = P[\"s\"];\n    this[\"n\"] = P[\"n\"] / a;\n    this[\"d\"] = P[\"d\"] / a;\n  }\n\n  /**\n   * Boolean global variable to be able to disable automatic reduction of the fraction\n   *\n   */\n  Fraction['REDUCE'] = 1;\n\n  Fraction.prototype = {\n\n    \"s\": 1,\n    \"n\": 0,\n    \"d\": 1,\n\n    /**\n     * Calculates the absolute value\n     *\n     * Ex: new Fraction(-4).abs() => 4\n     **/\n    \"abs\": function() {\n\n      return new Fraction(this[\"n\"], this[\"d\"]);\n    },\n\n    /**\n     * Inverts the sign of the current fraction\n     *\n     * Ex: new Fraction(-4).neg() => 4\n     **/\n    \"neg\": function() {\n\n      return new Fraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n    },\n\n    /**\n     * Adds two rational numbers\n     *\n     * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n     **/\n    \"add\": function(a, b) {\n\n      parse(a, b);\n      return new Fraction(\n              this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n              this[\"d\"] * P[\"d\"]\n              );\n    },\n\n    /**\n     * Subtracts two rational numbers\n     *\n     * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n     **/\n    \"sub\": function(a, b) {\n\n      parse(a, b);\n      return new Fraction(\n              this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n              this[\"d\"] * P[\"d\"]\n              );\n    },\n\n    /**\n     * Multiplies two rational numbers\n     *\n     * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n     **/\n    \"mul\": function(a, b) {\n\n      parse(a, b);\n      return new Fraction(\n              this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n              this[\"d\"] * P[\"d\"]\n              );\n    },\n\n    /**\n     * Divides two rational numbers\n     *\n     * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n     **/\n    \"div\": function(a, b) {\n\n      parse(a, b);\n      return new Fraction(\n              this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n              this[\"d\"] * P[\"n\"]\n              );\n    },\n\n    /**\n     * Clones the actual object\n     *\n     * Ex: new Fraction(\"-17.(345)\").clone()\n     **/\n    \"clone\": function() {\n      return new Fraction(this);\n    },\n\n    /**\n     * Calculates the modulo of two rational numbers - a more precise fmod\n     *\n     * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n     **/\n    \"mod\": function(a, b) {\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return new Fraction(NaN);\n      }\n\n      if (a === undefined) {\n        return new Fraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        Fraction(0, 0); // Throw DivisionByZero\n      }\n\n      /*\n       * First silly attempt, kinda slow\n       *\n       return that[\"sub\"]({\n       \"n\": num[\"n\"] * Math.floor((this.n / this.d) / (num.n / num.d)),\n       \"d\": num[\"d\"],\n       \"s\": this[\"s\"]\n       });*/\n\n      /*\n       * New attempt: a1 / b1 = a2 / b2 * q + r\n       * => b2 * a1 = a2 * b1 * q + b1 * b2 * r\n       * => (b2 * a1 % a2 * b1) / (b1 * b2)\n       */\n      return new Fraction(\n              this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n              P[\"d\"] * this[\"d\"]\n              );\n    },\n\n    /**\n     * Calculates the fractional gcd of two rational numbers\n     *\n     * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n     */\n    \"gcd\": function(a, b) {\n\n      parse(a, b);\n\n      // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n      return new Fraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n    },\n\n    /**\n     * Calculates the fractional lcm of two rational numbers\n     *\n     * Ex: new Fraction(5,8).lcm(3,7) => 15\n     */\n    \"lcm\": function(a, b) {\n\n      parse(a, b);\n\n      // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n      if (P[\"n\"] === 0 && this[\"n\"] === 0) {\n        return new Fraction;\n      }\n      return new Fraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n    },\n\n    /**\n     * Calculates the ceil of a rational number\n     *\n     * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n     **/\n    \"ceil\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return new Fraction(Math.ceil(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Calculates the floor of a rational number\n     *\n     * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n     **/\n    \"floor\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return new Fraction(Math.floor(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Rounds a rational numbers\n     *\n     * Ex: new Fraction('4.(3)').round() => (4 / 1)\n     **/\n    \"round\": function(places) {\n\n      places = Math.pow(10, places || 0);\n\n      if (isNaN(this[\"n\"]) || isNaN(this[\"d\"])) {\n        return new Fraction(NaN);\n      }\n      return new Fraction(Math.round(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Gets the inverse of the fraction, means numerator and denumerator are exchanged\n     *\n     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n     **/\n    \"inverse\": function() {\n\n      return new Fraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n    },\n\n    /**\n     * Calculates the fraction to some integer exponent\n     *\n     * Ex: new Fraction(-1,2).pow(-3) => -8\n     */\n    \"pow\": function(m) {\n\n      if (m < 0) {\n        return new Fraction(Math.pow(this['s'] * this[\"d\"], -m), Math.pow(this[\"n\"], -m));\n      } else {\n        return new Fraction(Math.pow(this['s'] * this[\"n\"], m), Math.pow(this[\"d\"], m));\n      }\n    },\n\n    /**\n     * Check if two rational numbers are the same\n     *\n     * Ex: new Fraction(19.6).equals([98, 5]);\n     **/\n    \"equals\": function(a, b) {\n\n      parse(a, b);\n      return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"]; // Same as compare() === 0\n    },\n\n    /**\n     * Check if two rational numbers are the same\n     *\n     * Ex: new Fraction(19.6).equals([98, 5]);\n     **/\n    \"compare\": function(a, b) {\n\n      parse(a, b);\n      var t = (this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"]);\n      return (0 < t) - (t < 0);\n    },\n\n    \"simplify\": function(eps) {\n\n      // First naive implementation, needs improvement\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      var cont = this['abs']()['toContinued']();\n\n      eps = eps || 0.001;\n\n      function rec(a) {\n        if (a.length === 1)\n          return new Fraction(a[0]);\n        return rec(a.slice(1))['inverse']()['add'](a[0]);\n      }\n\n      for (var i = 0; i < cont.length; i++) {\n        var tmp = rec(cont.slice(0, i + 1));\n        if (tmp['sub'](this['abs']())['abs']().valueOf() < eps) {\n          return tmp['mul'](this['s']);\n        }\n      }\n      return this;\n    },\n\n    /**\n     * Check if two rational numbers are divisible\n     *\n     * Ex: new Fraction(19.6).divisible(1.5);\n     */\n    \"divisible\": function(a, b) {\n\n      parse(a, b);\n      return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n    },\n\n    /**\n     * Returns a decimal representation of the fraction\n     *\n     * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n     **/\n    'valueOf': function() {\n\n      return this[\"s\"] * this[\"n\"] / this[\"d\"];\n    },\n\n    /**\n     * Returns a string-fraction representation of a Fraction object\n     *\n     * Ex: new Fraction(\"1.'3'\").toFraction() => \"4 1/3\"\n     **/\n    'toFraction': function(excludeWhole) {\n\n      var whole, str = \"\";\n      var n = this[\"n\"];\n      var d = this[\"d\"];\n      if (this[\"s\"] < 0) {\n        str += '-';\n      }\n\n      if (d === 1) {\n        str += n;\n      } else {\n\n        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n          str += whole;\n          str += \" \";\n          n %= d;\n        }\n\n        str += n;\n        str += '/';\n        str += d;\n      }\n      return str;\n    },\n\n    /**\n     * Returns a latex representation of a Fraction object\n     *\n     * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n     **/\n    'toLatex': function(excludeWhole) {\n\n      var whole, str = \"\";\n      var n = this[\"n\"];\n      var d = this[\"d\"];\n      if (this[\"s\"] < 0) {\n        str += '-';\n      }\n\n      if (d === 1) {\n        str += n;\n      } else {\n\n        if (excludeWhole && (whole = Math.floor(n / d)) > 0) {\n          str += whole;\n          n %= d;\n        }\n\n        str += \"\\\\frac{\";\n        str += n;\n        str += '}{';\n        str += d;\n        str += '}';\n      }\n      return str;\n    },\n\n    /**\n     * Returns an array of continued fraction elements\n     *\n     * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n     */\n    'toContinued': function() {\n\n      var t;\n      var a = this['n'];\n      var b = this['d'];\n      var res = [];\n\n      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return res;\n      }\n\n      do {\n        res.push(Math.floor(a / b));\n        t = a % b;\n        a = b;\n        b = t;\n      } while (a !== 1);\n\n      return res;\n    },\n\n    /**\n     * Creates a string representation of a fraction with all digits\n     *\n     * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n     **/\n    'toString': function(dec) {\n\n      var g;\n      var N = this[\"n\"];\n      var D = this[\"d\"];\n\n      if (isNaN(N) || isNaN(D)) {\n        return \"NaN\";\n      }\n\n      if (!Fraction['REDUCE']) {\n        g = gcd(N, D);\n        N /= g;\n        D /= g;\n      }\n\n      dec = dec || 15; // 15 = decimal places when no repitation\n\n      var cycLen = cycleLen(N, D); // Cycle length\n      var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n      var str = this['s'] === -1 ? \"-\" : \"\";\n\n      str += N / D | 0;\n\n      N %= D;\n      N *= 10;\n\n      if (N)\n        str += \".\";\n\n      if (cycLen) {\n\n        for (var i = cycOff; i--; ) {\n          str += N / D | 0;\n          N %= D;\n          N *= 10;\n        }\n        str += \"(\";\n        for (var i = cycLen; i--; ) {\n          str += N / D | 0;\n          N %= D;\n          N *= 10;\n        }\n        str += \")\";\n      } else {\n        for (var i = dec; N && i--; ) {\n          str += N / D | 0;\n          N %= D;\n          N *= 10;\n        }\n      }\n      return str;\n    }\n  };\n\n  if (typeof define === \"function\" && define[\"amd\"]) {\n    define([], function() {\n      return Fraction;\n    });\n  } else if (typeof exports === \"object\") {\n    Object.defineProperty(exports, \"__esModule\", {'value': true});\n    Fraction['default'] = Fraction;\n    Fraction['Fraction'] = Fraction;\n    module['exports'] = Fraction;\n  } else {\n    root['Fraction'] = Fraction;\n  }\n\n})(this);\n","'use strict';\n\n(function() {\n  function toArray(arr) {\n    return Array.prototype.slice.call(arr);\n  }\n\n  function promisifyRequest(request) {\n    return new Promise(function(resolve, reject) {\n      request.onsuccess = function() {\n        resolve(request.result);\n      };\n\n      request.onerror = function() {\n        reject(request.error);\n      };\n    });\n  }\n\n  function promisifyRequestCall(obj, method, args) {\n    var request;\n    var p = new Promise(function(resolve, reject) {\n      request = obj[method].apply(obj, args);\n      promisifyRequest(request).then(resolve, reject);\n    });\n\n    p.request = request;\n    return p;\n  }\n\n  function promisifyCursorRequestCall(obj, method, args) {\n    var p = promisifyRequestCall(obj, method, args);\n    return p.then(function(value) {\n      if (!value) return;\n      return new Cursor(value, p.request);\n    });\n  }\n\n  function proxyProperties(ProxyClass, targetProp, properties) {\n    properties.forEach(function(prop) {\n      Object.defineProperty(ProxyClass.prototype, prop, {\n        get: function() {\n          return this[targetProp][prop];\n        },\n        set: function(val) {\n          this[targetProp][prop] = val;\n        }\n      });\n    });\n  }\n\n  function proxyRequestMethods(ProxyClass, targetProp, Constructor, properties) {\n    properties.forEach(function(prop) {\n      if (!(prop in Constructor.prototype)) return;\n      ProxyClass.prototype[prop] = function() {\n        return promisifyRequestCall(this[targetProp], prop, arguments);\n      };\n    });\n  }\n\n  function proxyMethods(ProxyClass, targetProp, Constructor, properties) {\n    properties.forEach(function(prop) {\n      if (!(prop in Constructor.prototype)) return;\n      ProxyClass.prototype[prop] = function() {\n        return this[targetProp][prop].apply(this[targetProp], arguments);\n      };\n    });\n  }\n\n  function proxyCursorRequestMethods(ProxyClass, targetProp, Constructor, properties) {\n    properties.forEach(function(prop) {\n      if (!(prop in Constructor.prototype)) return;\n      ProxyClass.prototype[prop] = function() {\n        return promisifyCursorRequestCall(this[targetProp], prop, arguments);\n      };\n    });\n  }\n\n  function Index(index) {\n    this._index = index;\n  }\n\n  proxyProperties(Index, '_index', [\n    'name',\n    'keyPath',\n    'multiEntry',\n    'unique'\n  ]);\n\n  proxyRequestMethods(Index, '_index', IDBIndex, [\n    'get',\n    'getKey',\n    'getAll',\n    'getAllKeys',\n    'count'\n  ]);\n\n  proxyCursorRequestMethods(Index, '_index', IDBIndex, [\n    'openCursor',\n    'openKeyCursor'\n  ]);\n\n  function Cursor(cursor, request) {\n    this._cursor = cursor;\n    this._request = request;\n  }\n\n  proxyProperties(Cursor, '_cursor', [\n    'direction',\n    'key',\n    'primaryKey',\n    'value'\n  ]);\n\n  proxyRequestMethods(Cursor, '_cursor', IDBCursor, [\n    'update',\n    'delete'\n  ]);\n\n  // proxy 'next' methods\n  ['advance', 'continue', 'continuePrimaryKey'].forEach(function(methodName) {\n    if (!(methodName in IDBCursor.prototype)) return;\n    Cursor.prototype[methodName] = function() {\n      var cursor = this;\n      var args = arguments;\n      return Promise.resolve().then(function() {\n        cursor._cursor[methodName].apply(cursor._cursor, args);\n        return promisifyRequest(cursor._request).then(function(value) {\n          if (!value) return;\n          return new Cursor(value, cursor._request);\n        });\n      });\n    };\n  });\n\n  function ObjectStore(store) {\n    this._store = store;\n  }\n\n  ObjectStore.prototype.createIndex = function() {\n    return new Index(this._store.createIndex.apply(this._store, arguments));\n  };\n\n  ObjectStore.prototype.index = function() {\n    return new Index(this._store.index.apply(this._store, arguments));\n  };\n\n  proxyProperties(ObjectStore, '_store', [\n    'name',\n    'keyPath',\n    'indexNames',\n    'autoIncrement'\n  ]);\n\n  proxyRequestMethods(ObjectStore, '_store', IDBObjectStore, [\n    'put',\n    'add',\n    'delete',\n    'clear',\n    'get',\n    'getAll',\n    'getKey',\n    'getAllKeys',\n    'count'\n  ]);\n\n  proxyCursorRequestMethods(ObjectStore, '_store', IDBObjectStore, [\n    'openCursor',\n    'openKeyCursor'\n  ]);\n\n  proxyMethods(ObjectStore, '_store', IDBObjectStore, [\n    'deleteIndex'\n  ]);\n\n  function Transaction(idbTransaction) {\n    this._tx = idbTransaction;\n    this.complete = new Promise(function(resolve, reject) {\n      idbTransaction.oncomplete = function() {\n        resolve();\n      };\n      idbTransaction.onerror = function() {\n        reject(idbTransaction.error);\n      };\n      idbTransaction.onabort = function() {\n        reject(idbTransaction.error);\n      };\n    });\n  }\n\n  Transaction.prototype.objectStore = function() {\n    return new ObjectStore(this._tx.objectStore.apply(this._tx, arguments));\n  };\n\n  proxyProperties(Transaction, '_tx', [\n    'objectStoreNames',\n    'mode'\n  ]);\n\n  proxyMethods(Transaction, '_tx', IDBTransaction, [\n    'abort'\n  ]);\n\n  function UpgradeDB(db, oldVersion, transaction) {\n    this._db = db;\n    this.oldVersion = oldVersion;\n    this.transaction = new Transaction(transaction);\n  }\n\n  UpgradeDB.prototype.createObjectStore = function() {\n    return new ObjectStore(this._db.createObjectStore.apply(this._db, arguments));\n  };\n\n  proxyProperties(UpgradeDB, '_db', [\n    'name',\n    'version',\n    'objectStoreNames'\n  ]);\n\n  proxyMethods(UpgradeDB, '_db', IDBDatabase, [\n    'deleteObjectStore',\n    'close'\n  ]);\n\n  function DB(db) {\n    this._db = db;\n  }\n\n  DB.prototype.transaction = function() {\n    return new Transaction(this._db.transaction.apply(this._db, arguments));\n  };\n\n  proxyProperties(DB, '_db', [\n    'name',\n    'version',\n    'objectStoreNames'\n  ]);\n\n  proxyMethods(DB, '_db', IDBDatabase, [\n    'close'\n  ]);\n\n  // Add cursor iterators\n  // TODO: remove this once browsers do the right thing with promises\n  ['openCursor', 'openKeyCursor'].forEach(function(funcName) {\n    [ObjectStore, Index].forEach(function(Constructor) {\n      // Don't create iterateKeyCursor if openKeyCursor doesn't exist.\n      if (!(funcName in Constructor.prototype)) return;\n\n      Constructor.prototype[funcName.replace('open', 'iterate')] = function() {\n        var args = toArray(arguments);\n        var callback = args[args.length - 1];\n        var nativeObject = this._store || this._index;\n        var request = nativeObject[funcName].apply(nativeObject, args.slice(0, -1));\n        request.onsuccess = function() {\n          callback(request.result);\n        };\n      };\n    });\n  });\n\n  // polyfill getAll\n  [Index, ObjectStore].forEach(function(Constructor) {\n    if (Constructor.prototype.getAll) return;\n    Constructor.prototype.getAll = function(query, count) {\n      var instance = this;\n      var items = [];\n\n      return new Promise(function(resolve) {\n        instance.iterateCursor(query, function(cursor) {\n          if (!cursor) {\n            resolve(items);\n            return;\n          }\n          items.push(cursor.value);\n\n          if (count !== undefined && items.length == count) {\n            resolve(items);\n            return;\n          }\n          cursor.continue();\n        });\n      });\n    };\n  });\n\n  var exp = {\n    open: function(name, version, upgradeCallback) {\n      var p = promisifyRequestCall(indexedDB, 'open', [name, version]);\n      var request = p.request;\n\n      if (request) {\n        request.onupgradeneeded = function(event) {\n          if (upgradeCallback) {\n            upgradeCallback(new UpgradeDB(request.result, event.oldVersion, request.transaction));\n          }\n        };\n      }\n\n      return p.then(function(db) {\n        return new DB(db);\n      });\n    },\n    delete: function(name) {\n      return promisifyRequestCall(indexedDB, 'deleteDatabase', [name]);\n    }\n  };\n\n  if (typeof module !== 'undefined') {\n    module.exports = exp;\n    module.exports.default = module.exports;\n  }\n  else {\n    self.idb = exp;\n  }\n}());\n","/*\r\n * Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license\r\n * Author: Jim Palmer (based on chunking idea from Dave Koelle)\r\n */\r\n/*jshint unused:false */\r\nmodule.exports = function naturalSort (a, b) {\r\n\t\"use strict\";\r\n\tvar re = /(^([+\\-]?(?:0|[1-9]\\d*)(?:\\.\\d*)?(?:[eE][+\\-]?\\d+)?)?$|^0x[0-9a-f]+$|\\d+)/gi,\r\n\t\tsre = /(^[ ]*|[ ]*$)/g,\r\n\t\tdre = /(^([\\w ]+,?[\\w ]+)?[\\w ]+,?[\\w ]+\\d+:\\d+(:\\d+)?[\\w ]?|^\\d{1,4}[\\/\\-]\\d{1,4}[\\/\\-]\\d{1,4}|^\\w+, \\w+ \\d+, \\d{4})/,\r\n\t\thre = /^0x[0-9a-f]+$/i,\r\n\t\tore = /^0/,\r\n\t\ti = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },\r\n\t\t// convert all to strings strip whitespace\r\n\t\tx = i(a).replace(sre, '') || '',\r\n\t\ty = i(b).replace(sre, '') || '',\r\n\t\t// chunk/tokenize\r\n\t\txN = x.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\tyN = y.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\t// numeric, hex or date detection\r\n\t\txD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),\r\n\t\tyD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,\r\n\t\toFxNcL, oFyNcL;\r\n\t// first try and sort Hex codes or Dates\r\n\tif (yD) {\r\n\t\tif ( xD < yD ) { return -1; }\r\n\t\telse if ( xD > yD ) { return 1; }\r\n\t}\r\n\t// natural sorting through split numeric strings and default strings\r\n\tfor(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {\r\n\t\t// find floats not starting with '0', string or 0 if not defined (Clint Priest)\r\n\t\toFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;\r\n\t\toFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;\r\n\t\t// handle numeric vs string comparison - number < string - (Kyle Adams)\r\n\t\tif (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }\r\n\t\t// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'\r\n\t\telse if (typeof oFxNcL !== typeof oFyNcL) {\r\n\t\t\toFxNcL += '';\r\n\t\t\toFyNcL += '';\r\n\t\t}\r\n\t\tif (oFxNcL < oFyNcL) { return -1; }\r\n\t\tif (oFxNcL > oFyNcL) { return 1; }\r\n\t}\r\n\treturn 0;\r\n};\r\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright JS Foundation and other contributors <https://js.foundation/>\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.11';\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\n        return result;\n      }\n\n      if (isMap(value)) {\n        value.forEach(function(subValue, key) {\n          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n        });\n\n        return result;\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        if (isObject(srcValue)) {\n          stack || (stack = new Stack);\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) {\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__\".\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 == '__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            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      var sourceURL = '//# sourceURL=' +\n        ('sourceURL' in options\n          ? options.sourceURL\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      var 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            names = realNames[key] || (realNames[key] = []);\n\n        names.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","/*\n* loglevel - https://github.com/pimterry/loglevel\n*\n* Copyright (c) 2013 Tim Perry\n* Licensed under the MIT license.\n*/\n(function (root, definition) {\n    \"use strict\";\n    if (typeof define === 'function' && define.amd) {\n        define(definition);\n    } else if (typeof module === 'object' && module.exports) {\n        module.exports = definition();\n    } else {\n        root.log = definition();\n    }\n}(this, function () {\n    \"use strict\";\n\n    // Slightly dubious tricks to cut down minimized file size\n    var noop = function() {};\n    var undefinedType = \"undefined\";\n\n    var logMethods = [\n        \"trace\",\n        \"debug\",\n        \"info\",\n        \"warn\",\n        \"error\"\n    ];\n\n    // Cross-browser bind equivalent that works at least back to IE6\n    function bindMethod(obj, methodName) {\n        var method = obj[methodName];\n        if (typeof method.bind === 'function') {\n            return method.bind(obj);\n        } else {\n            try {\n                return Function.prototype.bind.call(method, obj);\n            } catch (e) {\n                // Missing bind shim or IE8 + Modernizr, fallback to wrapping\n                return function() {\n                    return Function.prototype.apply.apply(method, [obj, arguments]);\n                };\n            }\n        }\n    }\n\n    // Build the best logging method possible for this env\n    // Wherever possible we want to bind, not wrap, to preserve stack traces\n    function realMethod(methodName) {\n        if (methodName === 'debug') {\n            methodName = 'log';\n        }\n\n        if (typeof console === undefinedType) {\n            return false; // No method possible, for now - fixed later by enableLoggingWhenConsoleArrives\n        } else if (console[methodName] !== undefined) {\n            return bindMethod(console, methodName);\n        } else if (console.log !== undefined) {\n            return bindMethod(console, 'log');\n        } else {\n            return noop;\n        }\n    }\n\n    // These private functions always need `this` to be set properly\n\n    function replaceLoggingMethods(level, loggerName) {\n        /*jshint validthis:true */\n        for (var i = 0; i < logMethods.length; i++) {\n            var methodName = logMethods[i];\n            this[methodName] = (i < level) ?\n                noop :\n                this.methodFactory(methodName, level, loggerName);\n        }\n\n        // Define log.log as an alias for log.debug\n        this.log = this.debug;\n    }\n\n    // In old IE versions, the console isn't present until you first open it.\n    // We build realMethod() replacements here that regenerate logging methods\n    function enableLoggingWhenConsoleArrives(methodName, level, loggerName) {\n        return function () {\n            if (typeof console !== undefinedType) {\n                replaceLoggingMethods.call(this, level, loggerName);\n                this[methodName].apply(this, arguments);\n            }\n        };\n    }\n\n    // By default, we use closely bound real methods wherever possible, and\n    // otherwise we wait for a console to appear, and then try again.\n    function defaultMethodFactory(methodName, level, loggerName) {\n        /*jshint validthis:true */\n        return realMethod(methodName) ||\n               enableLoggingWhenConsoleArrives.apply(this, arguments);\n    }\n\n    function Logger(name, defaultLevel, factory) {\n      var self = this;\n      var currentLevel;\n      var storageKey = \"loglevel\";\n      if (name) {\n        storageKey += \":\" + name;\n      }\n\n      function persistLevelIfPossible(levelNum) {\n          var levelName = (logMethods[levelNum] || 'silent').toUpperCase();\n\n          if (typeof window === undefinedType) return;\n\n          // Use localStorage if available\n          try {\n              window.localStorage[storageKey] = levelName;\n              return;\n          } catch (ignore) {}\n\n          // Use session cookie as fallback\n          try {\n              window.document.cookie =\n                encodeURIComponent(storageKey) + \"=\" + levelName + \";\";\n          } catch (ignore) {}\n      }\n\n      function getPersistedLevel() {\n          var storedLevel;\n\n          if (typeof window === undefinedType) return;\n\n          try {\n              storedLevel = window.localStorage[storageKey];\n          } catch (ignore) {}\n\n          // Fallback to cookies if local storage gives us nothing\n          if (typeof storedLevel === undefinedType) {\n              try {\n                  var cookie = window.document.cookie;\n                  var location = cookie.indexOf(\n                      encodeURIComponent(storageKey) + \"=\");\n                  if (location !== -1) {\n                      storedLevel = /^([^;]+)/.exec(cookie.slice(location))[1];\n                  }\n              } catch (ignore) {}\n          }\n\n          // If the stored level is not valid, treat it as if nothing was stored.\n          if (self.levels[storedLevel] === undefined) {\n              storedLevel = undefined;\n          }\n\n          return storedLevel;\n      }\n\n      /*\n       *\n       * Public logger API - see https://github.com/pimterry/loglevel for details\n       *\n       */\n\n      self.name = name;\n\n      self.levels = { \"TRACE\": 0, \"DEBUG\": 1, \"INFO\": 2, \"WARN\": 3,\n          \"ERROR\": 4, \"SILENT\": 5};\n\n      self.methodFactory = factory || defaultMethodFactory;\n\n      self.getLevel = function () {\n          return currentLevel;\n      };\n\n      self.setLevel = function (level, persist) {\n          if (typeof level === \"string\" && self.levels[level.toUpperCase()] !== undefined) {\n              level = self.levels[level.toUpperCase()];\n          }\n          if (typeof level === \"number\" && level >= 0 && level <= self.levels.SILENT) {\n              currentLevel = level;\n              if (persist !== false) {  // defaults to true\n                  persistLevelIfPossible(level);\n              }\n              replaceLoggingMethods.call(self, level, name);\n              if (typeof console === undefinedType && level < self.levels.SILENT) {\n                  return \"No console available for logging\";\n              }\n          } else {\n              throw \"log.setLevel() called with invalid level: \" + level;\n          }\n      };\n\n      self.setDefaultLevel = function (level) {\n          if (!getPersistedLevel()) {\n              self.setLevel(level, false);\n          }\n      };\n\n      self.enableAll = function(persist) {\n          self.setLevel(self.levels.TRACE, persist);\n      };\n\n      self.disableAll = function(persist) {\n          self.setLevel(self.levels.SILENT, persist);\n      };\n\n      // Initialize with the right level\n      var initialLevel = getPersistedLevel();\n      if (initialLevel == null) {\n          initialLevel = defaultLevel == null ? \"WARN\" : defaultLevel;\n      }\n      self.setLevel(initialLevel, false);\n    }\n\n    /*\n     *\n     * Top-level API\n     *\n     */\n\n    var defaultLogger = new Logger();\n\n    var _loggersByName = {};\n    defaultLogger.getLogger = function getLogger(name) {\n        if (typeof name !== \"string\" || name === \"\") {\n          throw new TypeError(\"You must supply a name when creating a logger.\");\n        }\n\n        var logger = _loggersByName[name];\n        if (!logger) {\n          logger = _loggersByName[name] = new Logger(\n            name, defaultLogger.getLevel(), defaultLogger.methodFactory);\n        }\n        return logger;\n    };\n\n    // Grab the current global log variable in case of overwrite\n    var _log = (typeof window !== undefinedType) ? window.log : undefined;\n    defaultLogger.noConflict = function() {\n        if (typeof window !== undefinedType &&\n               window.log === defaultLogger) {\n            window.log = _log;\n        }\n\n        return defaultLogger;\n    };\n\n    defaultLogger.getLoggers = function getLoggers() {\n        return _loggersByName;\n    };\n\n    return defaultLogger;\n}));\n","module.exports = require('./lib/core/core')\n","'use strict';\n\nrequire('./../utils/polyfills');\n\nvar isFactory = require('./../utils/object').isFactory;\n\nvar typedFactory = require('./typed');\n\nvar emitter = require('./../utils/emitter');\n\nvar importFactory = require('./function/import');\n\nvar configFactory = require('./function/config');\n/**\n * Math.js core. Creates a new, empty math.js instance\n * @param {Object} [options] Available options:\n *                            {number} epsilon\n *                              Minimum relative difference between two\n *                              compared values, used by all comparison functions.\n *                            {string} matrix\n *                              A string 'Matrix' (default) or 'Array'.\n *                            {string} number\n *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n *                            {number} precision\n *                              The number of significant digits for BigNumbers.\n *                              Not applicable for Numbers.\n *                            {boolean} predictable\n *                              Predictable output type of functions. When true,\n *                              output type depends only on the input types. When\n *                              false (default), output type can vary depending\n *                              on input values. For example `math.sqrt(-4)`\n *                              returns `complex('2i')` when predictable is false, and\n *                              returns `NaN` when true.\n *                            {string} randomSeed\n *                              Random seed for seeded pseudo random number generator.\n *                              Set to null to randomly seed.\n * @returns {Object} Returns a bare-bone math.js instance containing\n *                   functions:\n *                   - `import` to add new functions\n *                   - `config` to change configuration\n *                   - `on`, `off`, `once`, `emit` for events\n */\n\n\nexports.create = function create(options) {\n  // simple test for ES5 support\n  if (typeof Object.create !== 'function') {\n    throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');\n  } // cached factories and instances\n\n\n  var factories = [];\n  var instances = []; // create a namespace for the mathjs instance, and attach emitter functions\n\n  var math = emitter.mixin({});\n  math.type = {};\n  math.expression = {\n    transform: {},\n    mathWithTransform: {} // create a new typed instance\n\n  };\n  math.typed = typedFactory.create(math.type); // create configuration options. These are private\n\n  var _config = {\n    // minimum relative difference between two compared values,\n    // used by all comparison functions\n    epsilon: 1e-12,\n    // type of default matrix output. Choose 'matrix' (default) or 'array'\n    matrix: 'Matrix',\n    // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n    number: 'number',\n    // number of significant digits in BigNumbers\n    precision: 64,\n    // predictable output type of functions. When true, output type depends only\n    // on the input types. When false (default), output type can vary depending\n    // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n    // predictable is false, and returns `NaN` when true.\n    predictable: false,\n    // random seed for seeded pseudo random number generation\n    // null = randomly seed\n    randomSeed: null\n    /**\n     * Load a function or data type from a factory.\n     * If the function or data type already exists, the existing instance is\n     * returned.\n     * @param {{type: string, name: string, factory: Function}} factory\n     * @returns {*}\n     */\n\n  };\n\n  function load(factory) {\n    if (!isFactory(factory)) {\n      throw new Error('Factory object with properties `type`, `name`, and `factory` expected');\n    }\n\n    var index = factories.indexOf(factory);\n    var instance;\n\n    if (index === -1) {\n      // doesn't yet exist\n      if (factory.math === true) {\n        // pass with math namespace\n        instance = factory.factory(math.type, _config, load, math.typed, math);\n      } else {\n        instance = factory.factory(math.type, _config, load, math.typed);\n      } // append to the cache\n\n\n      factories.push(factory);\n      instances.push(instance);\n    } else {\n      // already existing function, return the cached instance\n      instance = instances[index];\n    }\n\n    return instance;\n  } // load the import and config functions\n\n\n  math['import'] = load(importFactory);\n  math['config'] = load(configFactory);\n  math.expression.mathWithTransform['config'] = math['config']; // apply options\n\n  if (options) {\n    math.config(options);\n  }\n\n  return math;\n};","'use strict';\n\nvar object = require('../../utils/object');\n\nfunction factory(type, config, load, typed, math) {\n  var MATRIX = ['Matrix', 'Array']; // valid values for option matrix\n\n  var NUMBER = ['number', 'BigNumber', 'Fraction']; // valid values for option number\n\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.eval('0.4')                    // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.eval('0.4')                    // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} epsilon\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n\n  function _config(options) {\n    if (options) {\n      var prev = object.map(config, object.clone); // validate some of the options\n\n      validateOption(options, 'matrix', MATRIX);\n      validateOption(options, 'number', NUMBER); // merge options\n\n      object.deepExtend(config, options);\n      var curr = object.map(config, object.clone);\n      var changes = object.map(options, object.clone); // emit 'config' event\n\n      math.emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return object.map(config, object.clone);\n    }\n  } // attach the valid options to the function so they can be extended\n\n\n  _config.MATRIX = MATRIX;\n  _config.NUMBER = NUMBER;\n  return _config;\n}\n/**\n * Test whether an Array contains a specific item.\n * @param {Array.<string>} array\n * @param {string} item\n * @return {boolean}\n */\n\n\nfunction contains(array, item) {\n  return array.indexOf(item) !== -1;\n}\n/**\n * Find a string in an array. Case insensitive search\n * @param {Array.<string>} array\n * @param {string} item\n * @return {number} Returns the index when found. Returns -1 when not found\n */\n\n\nfunction findIndex(array, item) {\n  return array.map(function (i) {\n    return i.toLowerCase();\n  }).indexOf(item.toLowerCase());\n}\n/**\n * Validate an option\n * @param {Object} options         Object with options\n * @param {string} name            Name of the option to validate\n * @param {Array.<string>} values  Array with valid values for this option\n */\n\n\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !contains(values, options[name])) {\n    var index = findIndex(values, options[name]);\n\n    if (index !== -1) {\n      // right value, wrong casing\n      // TODO: lower case values are deprecated since v3, remove this warning some day.\n      console.warn('Warning: Wrong casing for configuration option \"' + name + '\", should be \"' + values[index] + '\" instead of \"' + options[name] + '\".');\n      options[name] = values[index]; // change the option to the right casing\n    } else {\n      // unknown value\n      console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". Available options: ' + values.map(JSON.stringify).join(', ') + '.');\n    }\n  }\n}\n\nexports.name = 'config';\nexports.math = true; // request the math namespace as fifth argument\n\nexports.factory = factory;","'use strict';\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\nvar lazy = require('../../utils/object').lazy;\n\nvar isFactory = require('../../utils/object').isFactory;\n\nvar traverse = require('../../utils/object').traverse;\n\nvar ArgumentsError = require('../../error/ArgumentsError');\n\nfunction factory(type, config, load, typed, math) {\n  /**\n   * Import functions from an object or a module\n   *\n   * Syntax:\n   *\n   *    math.import(object)\n   *    math.import(object, options)\n   *\n   * Where:\n   *\n   * - `object: Object`\n   *   An object with functions to be imported.\n   * - `options: Object` An object with import options. Available options:\n   *   - `override: boolean`\n   *     If true, existing functions will be overwritten. False by default.\n   *   - `silent: boolean`\n   *     If true, the function will not throw errors on duplicates or invalid\n   *     types. False by default.\n   *   - `wrap: boolean`\n   *     If true, the functions will be wrapped in a wrapper function\n   *     which converts data types like Matrix to primitive data types like Array.\n   *     The wrapper is needed when extending math.js with libraries which do not\n   *     support these data type. False by default.\n   *\n   * Examples:\n   *\n   *    // define new functions and variables\n   *    math.import({\n   *      myvalue: 42,\n   *      hello: function (name) {\n   *        return 'hello, ' + name + '!'\n   *      }\n   *    })\n   *\n   *    // use the imported function and variable\n   *    math.myvalue * 2               // 84\n   *    math.hello('user')             // 'hello, user!'\n   *\n   *    // import the npm module 'numbers'\n   *    // (must be installed first with `npm install numbers`)\n   *    math.import(require('numbers'), {wrap: true})\n   *\n   *    math.fibonacci(7) // returns 13\n   *\n   * @param {Object | Array} object   Object with functions to be imported.\n   * @param {Object} [options]        Import options.\n   */\n  function mathImport(object, options) {\n    var num = arguments.length;\n\n    if (num !== 1 && num !== 2) {\n      throw new ArgumentsError('import', num, 1, 2);\n    }\n\n    if (!options) {\n      options = {};\n    } // TODO: allow a typed-function with name too\n\n\n    if (isFactory(object)) {\n      _importFactory(object, options);\n    } else if (Array.isArray(object)) {\n      object.forEach(function (entry) {\n        mathImport(entry, options);\n      });\n    } else if (_typeof(object) === 'object') {\n      // a map with functions\n      for (var name in object) {\n        if (object.hasOwnProperty(name)) {\n          var value = object[name];\n\n          if (isSupportedType(value)) {\n            _import(name, value, options);\n          } else if (isFactory(object)) {\n            _importFactory(object, options);\n          } else {\n            mathImport(value, options);\n          }\n        }\n      }\n    } else {\n      if (!options.silent) {\n        throw new TypeError('Factory, Object, or Array expected');\n      }\n    }\n  }\n  /**\n   * Add a property to the math namespace and create a chain proxy for it.\n   * @param {string} name\n   * @param {*} value\n   * @param {Object} options  See import for a description of the options\n   * @private\n   */\n\n\n  function _import(name, value, options) {\n    // TODO: refactor this function, it's to complicated and contains duplicate code\n    if (options.wrap && typeof value === 'function') {\n      // create a wrapper around the function\n      value = _wrap(value);\n    }\n\n    if (isTypedFunction(math[name]) && isTypedFunction(value)) {\n      if (options.override) {\n        // give the typed function the right name\n        value = typed(name, value.signatures);\n      } else {\n        // merge the existing and typed function\n        value = typed(math[name], value);\n      }\n\n      math[name] = value;\n\n      _importTransform(name, value);\n\n      math.emit('import', name, function resolver() {\n        return value;\n      });\n      return;\n    }\n\n    if (math[name] === undefined || options.override) {\n      math[name] = value;\n\n      _importTransform(name, value);\n\n      math.emit('import', name, function resolver() {\n        return value;\n      });\n      return;\n    }\n\n    if (!options.silent) {\n      throw new Error('Cannot import \"' + name + '\": already exists');\n    }\n  }\n\n  function _importTransform(name, value) {\n    if (value && typeof value.transform === 'function') {\n      math.expression.transform[name] = value.transform;\n\n      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value.transform;\n      }\n    } else {\n      // remove existing transform\n      delete math.expression.transform[name];\n\n      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value;\n      }\n    }\n  }\n\n  function _deleteTransform(name) {\n    delete math.expression.transform[name];\n\n    if (allowedInExpressions(name)) {\n      math.expression.mathWithTransform[name] = math[name];\n    } else {\n      delete math.expression.mathWithTransform[name];\n    }\n  }\n  /**\n   * Create a wrapper a round an function which converts the arguments\n   * to their primitive values (like convert a Matrix to Array)\n   * @param {Function} fn\n   * @return {Function} Returns the wrapped function\n   * @private\n   */\n\n\n  function _wrap(fn) {\n    var wrapper = function wrapper() {\n      var args = [];\n\n      for (var i = 0, len = arguments.length; i < len; i++) {\n        var arg = arguments[i];\n        args[i] = arg && arg.valueOf();\n      }\n\n      return fn.apply(math, args);\n    };\n\n    if (fn.transform) {\n      wrapper.transform = fn.transform;\n    }\n\n    return wrapper;\n  }\n  /**\n   * Import an instance of a factory into math.js\n   * @param {{factory: Function, name: string, path: string, math: boolean}} factory\n   * @param {Object} options  See import for a description of the options\n   * @private\n   */\n\n\n  function _importFactory(factory, options) {\n    if (typeof factory.name === 'string') {\n      var name = factory.name;\n      var existingTransform = name in math.expression.transform;\n      var namespace = factory.path ? traverse(math, factory.path) : math;\n      var existing = namespace.hasOwnProperty(name) ? namespace[name] : undefined;\n\n      var resolver = function resolver() {\n        var instance = load(factory);\n\n        if (instance && typeof instance.transform === 'function') {\n          throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with exports.path=\"expression.transform\"');\n        }\n\n        if (isTypedFunction(existing) && isTypedFunction(instance)) {\n          if (options.override) {// replace the existing typed function (nothing to do)\n          } else {\n            // merge the existing and new typed function\n            instance = typed(existing, instance);\n          }\n\n          return instance;\n        }\n\n        if (existing === undefined || options.override) {\n          return instance;\n        }\n\n        if (!options.silent) {\n          throw new Error('Cannot import \"' + name + '\": already exists');\n        }\n      };\n\n      if (factory.lazy !== false) {\n        lazy(namespace, name, resolver);\n\n        if (existingTransform) {\n          _deleteTransform(name);\n        } else {\n          if (factory.path === 'expression.transform' || factoryAllowedInExpressions(factory)) {\n            lazy(math.expression.mathWithTransform, name, resolver);\n          }\n        }\n      } else {\n        namespace[name] = resolver();\n\n        if (existingTransform) {\n          _deleteTransform(name);\n        } else {\n          if (factory.path === 'expression.transform' || factoryAllowedInExpressions(factory)) {\n            math.expression.mathWithTransform[name] = resolver();\n          }\n        }\n      }\n\n      math.emit('import', name, resolver, factory.path);\n    } else {\n      // unnamed factory.\n      // no lazy loading\n      load(factory);\n    }\n  }\n  /**\n   * Check whether given object is a type which can be imported\n   * @param {Function | number | string | boolean | null | Unit | Complex} object\n   * @return {boolean}\n   * @private\n   */\n\n\n  function isSupportedType(object) {\n    return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || object && type.isUnit(object) || object && type.isComplex(object) || object && type.isBigNumber(object) || object && type.isFraction(object) || object && type.isMatrix(object) || object && Array.isArray(object);\n  }\n  /**\n   * Test whether a given thing is a typed-function\n   * @param {*} fn\n   * @return {boolean} Returns true when `fn` is a typed-function\n   */\n\n\n  function isTypedFunction(fn) {\n    return typeof fn === 'function' && _typeof(fn.signatures) === 'object';\n  }\n\n  function allowedInExpressions(name) {\n    return !unsafe.hasOwnProperty(name);\n  }\n\n  function factoryAllowedInExpressions(factory) {\n    return factory.path === undefined && !unsafe.hasOwnProperty(factory.name);\n  } // namespaces and functions not available in the parser for safety reasons\n\n\n  var unsafe = {\n    'expression': true,\n    'type': true,\n    'docs': true,\n    'error': true,\n    'json': true,\n    'chain': true // chain method not supported. Note that there is a unit chain too.\n\n  };\n  return mathImport;\n}\n\nexports.math = true; // request access to the math namespace as 5th argument of the factory function\n\nexports.name = 'import';\nexports.factory = factory;\nexports.lazy = true;","'use strict';\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\nvar typedFunction = require('typed-function');\n\nvar digits = require('./../utils/number').digits;\n\nvar isBigNumber = require('./../utils/bignumber/isBigNumber');\n\nvar isMatrix = require('./../utils/collection/isMatrix'); // returns a new instance of typed-function\n\n\nvar _createTyped = function createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped = typedFunction.create;\n  return typedFunction;\n};\n/**\n * Factory function for creating a new typed instance\n * @param {Object} type   Object with data types like Complex and BigNumber\n * @returns {Function}\n */\n\n\nexports.create = function create(type) {\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n  // type checks for all known types\n  //\n  // note that:\n  //\n  // - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n  //   instanceof cannot be used because that would not allow to pass data from\n  //   one instance of math.js to another since each has it's own instance of Unit.\n  // - check the `isUnit` property via the constructor, so there will be no\n  //   matches for \"fake\" instances like plain objects with a property `isUnit`.\n  //   That is important for security reasons.\n  // - It must not be possible to override the type checks used internally,\n  //   for security reasons, so these functions are not exposed in the expression\n  //   parser.\n  type.isNumber = function (x) {\n    return typeof x === 'number';\n  };\n\n  type.isComplex = function (x) {\n    return type.Complex && x instanceof type.Complex || false;\n  };\n\n  type.isBigNumber = isBigNumber;\n\n  type.isFraction = function (x) {\n    return type.Fraction && x instanceof type.Fraction || false;\n  };\n\n  type.isUnit = function (x) {\n    return x && x.constructor.prototype.isUnit || false;\n  };\n\n  type.isString = function (x) {\n    return typeof x === 'string';\n  };\n\n  type.isArray = Array.isArray;\n  type.isMatrix = isMatrix;\n\n  type.isDenseMatrix = function (x) {\n    return x && x.isDenseMatrix && x.constructor.prototype.isMatrix || false;\n  };\n\n  type.isSparseMatrix = function (x) {\n    return x && x.isSparseMatrix && x.constructor.prototype.isMatrix || false;\n  };\n\n  type.isRange = function (x) {\n    return x && x.constructor.prototype.isRange || false;\n  };\n\n  type.isIndex = function (x) {\n    return x && x.constructor.prototype.isIndex || false;\n  };\n\n  type.isBoolean = function (x) {\n    return typeof x === 'boolean';\n  };\n\n  type.isResultSet = function (x) {\n    return x && x.constructor.prototype.isResultSet || false;\n  };\n\n  type.isHelp = function (x) {\n    return x && x.constructor.prototype.isHelp || false;\n  };\n\n  type.isFunction = function (x) {\n    return typeof x === 'function';\n  };\n\n  type.isDate = function (x) {\n    return x instanceof Date;\n  };\n\n  type.isRegExp = function (x) {\n    return x instanceof RegExp;\n  };\n\n  type.isObject = function (x) {\n    return _typeof(x) === 'object' && x.constructor === Object && !type.isComplex(x) && !type.isFraction(x);\n  };\n\n  type.isNull = function (x) {\n    return x === null;\n  };\n\n  type.isUndefined = function (x) {\n    return x === undefined;\n  };\n\n  type.isAccessorNode = function (x) {\n    return x && x.isAccessorNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isArrayNode = function (x) {\n    return x && x.isArrayNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isAssignmentNode = function (x) {\n    return x && x.isAssignmentNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isBlockNode = function (x) {\n    return x && x.isBlockNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isConditionalNode = function (x) {\n    return x && x.isConditionalNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isConstantNode = function (x) {\n    return x && x.isConstantNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isFunctionAssignmentNode = function (x) {\n    return x && x.isFunctionAssignmentNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isFunctionNode = function (x) {\n    return x && x.isFunctionNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isIndexNode = function (x) {\n    return x && x.isIndexNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isNode = function (x) {\n    return x && x.isNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isObjectNode = function (x) {\n    return x && x.isObjectNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isOperatorNode = function (x) {\n    return x && x.isOperatorNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isParenthesisNode = function (x) {\n    return x && x.isParenthesisNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isRangeNode = function (x) {\n    return x && x.isRangeNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isSymbolNode = function (x) {\n    return x && x.isSymbolNode && x.constructor.prototype.isNode || false;\n  };\n\n  type.isChain = function (x) {\n    return x && x.constructor.prototype.isChain || false;\n  }; // get a new instance of typed-function\n\n\n  var typed = _createTyped(); // define all types. The order of the types determines in which order function\n  // arguments are type-checked (so for performance it's important to put the\n  // most used types first).\n\n\n  typed.types = [{\n    name: 'number',\n    test: type.isNumber\n  }, {\n    name: 'Complex',\n    test: type.isComplex\n  }, {\n    name: 'BigNumber',\n    test: type.isBigNumber\n  }, {\n    name: 'Fraction',\n    test: type.isFraction\n  }, {\n    name: 'Unit',\n    test: type.isUnit\n  }, {\n    name: 'string',\n    test: type.isString\n  }, {\n    name: 'Array',\n    test: type.isArray\n  }, {\n    name: 'Matrix',\n    test: type.isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: type.isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: type.isSparseMatrix\n  }, {\n    name: 'Range',\n    test: type.isRange\n  }, {\n    name: 'Index',\n    test: type.isIndex\n  }, {\n    name: 'boolean',\n    test: type.isBoolean\n  }, {\n    name: 'ResultSet',\n    test: type.isResultSet\n  }, {\n    name: 'Help',\n    test: type.isHelp\n  }, {\n    name: 'function',\n    test: type.isFunction\n  }, {\n    name: 'Date',\n    test: type.isDate\n  }, {\n    name: 'RegExp',\n    test: type.isRegExp\n  }, {\n    name: 'null',\n    test: type.isNull\n  }, {\n    name: 'undefined',\n    test: type.isUndefined\n  }, {\n    name: 'OperatorNode',\n    test: type.isOperatorNode\n  }, {\n    name: 'ConstantNode',\n    test: type.isConstantNode\n  }, {\n    name: 'SymbolNode',\n    test: type.isSymbolNode\n  }, {\n    name: 'ParenthesisNode',\n    test: type.isParenthesisNode\n  }, {\n    name: 'FunctionNode',\n    test: type.isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: type.isFunctionAssignmentNode\n  }, {\n    name: 'ArrayNode',\n    test: type.isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: type.isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: type.isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: type.isConditionalNode\n  }, {\n    name: 'IndexNode',\n    test: type.isIndexNode\n  }, {\n    name: 'RangeNode',\n    test: type.isRangeNode\n  }, {\n    name: 'Node',\n    test: type.isNode\n  }, {\n    name: 'Object',\n    test: type.isObject // order 'Object' last, it matches on other classes too\n\n  }]; // TODO: add conversion from BigNumber to number?\n\n  typed.conversions = [{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      // note: conversion from number to BigNumber can fail if x has >15 digits\n      if (digits(x) > 15) {\n        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n      }\n\n      return new type.BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      return new type.Complex(x, 0);\n    }\n  }, {\n    from: 'number',\n    to: 'string',\n    convert: function convert(x) {\n      return x + '';\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(x) {\n      return new type.Complex(x.toNumber(), 0);\n    }\n  }, {\n    from: 'Fraction',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n    }\n  }, {\n    from: 'Fraction',\n    to: 'Complex',\n    convert: function convert(x) {\n      return new type.Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      var f = new type.Fraction(x);\n\n      if (f.valueOf() !== x) {\n        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n      }\n\n      return new type.Fraction(x);\n    }\n  }, {\n    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n    //  from: 'Fraction',\n    //  to: 'number',\n    //  convert: function (x) {\n    //    return x.valueOf()\n    //  }\n    // }, {\n    from: 'string',\n    to: 'number',\n    convert: function convert(x) {\n      var n = Number(x);\n\n      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      try {\n        return new type.BigNumber(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Fraction',\n    convert: function convert(x) {\n      try {\n        return new type.Fraction(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Fraction');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Complex',\n    convert: function convert(x) {\n      try {\n        return new type.Complex(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Complex');\n      }\n    }\n  }, {\n    from: 'boolean',\n    to: 'number',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'boolean',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      return new type.BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      return new type.Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      return new type.DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }];\n  return typed;\n};","'use strict';\n/**\n * Create a syntax error with the message:\n *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'\n * @param {string} fn     Function name\n * @param {number} count  Actual argument count\n * @param {number} min    Minimum required argument count\n * @param {number} [max]  Maximum required argument count\n * @extends Error\n */\n\nfunction ArgumentsError(fn, count, min, max) {\n  if (!(this instanceof ArgumentsError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n\n  this.fn = fn;\n  this.count = count;\n  this.min = min;\n  this.max = max;\n  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';\n  this.stack = new Error().stack;\n}\n\nArgumentsError.prototype = new Error();\nArgumentsError.prototype.constructor = Error;\nArgumentsError.prototype.name = 'ArgumentsError';\nArgumentsError.prototype.isArgumentsError = true;\nmodule.exports = ArgumentsError;","'use strict';\n/**\n * Create a range error with the message:\n *     'Dimension mismatch (<actual size> != <expected size>)'\n * @param {number | number[]} actual        The actual size\n * @param {number | number[]} expected      The expected size\n * @param {string} [relation='!=']          Optional relation between actual\n *                                          and expected size: '!=', '<', etc.\n * @extends RangeError\n */\n\nfunction DimensionError(actual, expected, relation) {\n  if (!(this instanceof DimensionError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n\n  this.actual = actual;\n  this.expected = expected;\n  this.relation = relation;\n  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n  this.stack = new Error().stack;\n}\n\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;\nmodule.exports = DimensionError;","'use strict';\n/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\n\nfunction IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n\n  this.index = index;\n\n  if (arguments.length < 3) {\n    this.min = 0;\n    this.max = min;\n  } else {\n    this.min = min;\n    this.max = max;\n  }\n\n  if (this.min !== undefined && this.index < this.min) {\n    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n  } else if (this.max !== undefined && this.index >= this.max) {\n    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n  } else {\n    this.message = 'Index out of range (' + this.index + ')';\n  }\n\n  this.stack = new Error().stack;\n}\n\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;\nmodule.exports = IndexError;","'use strict';\n\nvar object = require('../utils/object');\n\nvar string = require('../utils/string');\n\nfunction factory(type, config, load, typed) {\n  var parser = load(require('./function/parser'))();\n  /**\n   * Documentation object\n   * @param {Object} doc  Object containing properties:\n   *                      {string} name\n   *                      {string} category\n   *                      {string} description\n   *                      {string[]} syntax\n   *                      {string[]} examples\n   *                      {string[]} seealso\n   * @constructor\n   */\n\n  function Help(doc) {\n    if (!(this instanceof Help)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (!doc) throw new Error('Argument \"doc\" missing');\n    this.doc = doc;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Help.prototype.type = 'Help';\n  Help.prototype.isHelp = true;\n  /**\n   * Generate a string representation of the Help object\n   * @return {string} Returns a string\n   * @private\n   */\n\n  Help.prototype.toString = function () {\n    var doc = this.doc || {};\n    var desc = '\\n';\n\n    if (doc.name) {\n      desc += 'Name: ' + doc.name + '\\n\\n';\n    }\n\n    if (doc.category) {\n      desc += 'Category: ' + doc.category + '\\n\\n';\n    }\n\n    if (doc.description) {\n      desc += 'Description:\\n    ' + doc.description + '\\n\\n';\n    }\n\n    if (doc.syntax) {\n      desc += 'Syntax:\\n    ' + doc.syntax.join('\\n    ') + '\\n\\n';\n    }\n\n    if (doc.examples) {\n      desc += 'Examples:\\n';\n\n      for (var i = 0; i < doc.examples.length; i++) {\n        var expr = doc.examples[i];\n        desc += '    ' + expr + '\\n';\n        var res = void 0;\n\n        try {\n          // note: res can be undefined when `expr` is an empty string\n          res = parser.eval(expr);\n        } catch (e) {\n          res = e;\n        }\n\n        if (res !== undefined && !type.isHelp(res)) {\n          desc += '        ' + string.format(res, {\n            precision: 14\n          }) + '\\n';\n        }\n      }\n\n      desc += '\\n';\n    }\n\n    if (doc.seealso && doc.seealso.length) {\n      desc += 'See also: ' + doc.seealso.join(', ') + '\\n';\n    }\n\n    return desc;\n  };\n  /**\n   * Export the help object to JSON\n   */\n\n\n  Help.prototype.toJSON = function () {\n    var obj = object.clone(this.doc);\n    obj.mathjs = 'Help';\n    return obj;\n  };\n  /**\n   * Instantiate a Help object from a JSON object\n   * @param {Object} json\n   * @returns {Help} Returns a new Help object\n   */\n\n\n  Help.fromJSON = function (json) {\n    var doc = {};\n\n    for (var prop in json) {\n      if (prop !== 'mathjs') {\n        // ignore mathjs field\n        doc[prop] = json[prop];\n      }\n    }\n\n    return new Help(doc);\n  };\n  /**\n   * Returns a string representation of the Help object\n   */\n\n\n  Help.prototype.valueOf = Help.prototype.toString;\n  return Help;\n}\n\nexports.name = 'Help';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar extend = require('../utils/object').extend;\n\nvar customs = require('../utils/customs');\n\nfunction factory(type, config, load, typed, math) {\n  var _parse = load(require('./parse'));\n  /**\n   * @constructor Parser\n   * Parser contains methods to evaluate or parse expressions, and has a number\n   * of convenience methods to get, set, and remove variables from memory. Parser\n   * keeps a scope containing variables in memory, which is used for all\n   * evaluations.\n   *\n   * Methods:\n   *    const result = parser.eval(expr)  // evaluate an expression\n   *    const value = parser.get(name)    // retrieve a variable from the parser\n   *    const values = parser.getAll()    // retrieve all defined variables\n   *    parser.set(name, value)           // set a variable in the parser\n   *    parser.remove(name)               // clear a variable from the\n   *                                      // parsers scope\n   *    parser.clear()                    // clear the parsers scope\n   *\n   * Example usage:\n   *    const parser = new Parser()\n   *    // Note: there is a convenience method which can be used instead:\n   *    // const parser = new math.parser()\n   *\n   *    // evaluate expressions\n   *    parser.eval('sqrt(3^2 + 4^2)')         // 5\n   *    parser.eval('sqrt(-4)')                // 2i\n   *    parser.eval('2 inch in cm')            // 5.08 cm\n   *    parser.eval('cos(45 deg)')             // 0.7071067811865476\n   *\n   *    // define variables and functions\n   *    parser.eval('x = 7 / 2')               // 3.5\n   *    parser.eval('x + 3')                   // 6.5\n   *    parser.eval('function f(x, y) = x^y')  // f(x, y)\n   *    parser.eval('f(2, 3)')                 // 8\n   *\n   *    // get and set variables and functions\n   *    const x = parser.get('x')              // 7\n   *    const f = parser.get('f')              // function\n   *    const g = f(3, 2)                      // 9\n   *    parser.set('h', 500)\n   *    const i = parser.eval('h / 2')         // 250\n   *    parser.set('hello', function (name) {\n   *        return 'hello, ' + name + '!'\n   *    })\n   *    parser.eval('hello(\"user\")')           // \"hello, user!\"\n   *\n   *    // clear defined functions and variables\n   *    parser.clear()\n   *\n   */\n\n\n  function Parser() {\n    if (!(this instanceof Parser)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this.scope = {};\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Parser.prototype.type = 'Parser';\n  Parser.prototype.isParser = true;\n  /**\n   * Parse an expression and return the parsed function node.\n   * The node tree can be compiled via `code = node.compile(math)`,\n   * and the compiled code can be executed as `code.eval([scope])`\n   * @param {string} expr\n   * @return {Node} node\n   * @throws {Error}\n   */\n\n  Parser.prototype.parse = function (expr) {\n    throw new Error('Parser.parse is deprecated. Use math.parse instead.');\n  };\n  /**\n   * Parse and compile an expression, return the compiled javascript code.\n   * The node can be evaluated via code.eval([scope])\n   * @param {string} expr\n   * @return {{eval: function}} code\n   * @throws {Error}\n   */\n\n\n  Parser.prototype.compile = function (expr) {\n    throw new Error('Parser.compile is deprecated. Use math.compile instead.');\n  };\n  /**\n   * Parse and evaluate the given expression\n   * @param {string} expr   A string containing an expression, for example \"2+3\"\n   * @return {*} result     The result, or undefined when the expression was empty\n   * @throws {Error}\n   */\n\n\n  Parser.prototype.eval = function (expr) {\n    // TODO: validate arguments\n    return _parse(expr).compile().eval(this.scope);\n  };\n  /**\n   * Get a variable (a function or variable) by name from the parsers scope.\n   * Returns undefined when not found\n   * @param {string} name\n   * @return {* | undefined} value\n   */\n\n\n  Parser.prototype.get = function (name) {\n    // TODO: validate arguments\n    return name in this.scope ? customs.getSafeProperty(this.scope, name) : undefined;\n  };\n  /**\n   * Get a map with all defined variables\n   * @return {Object} values\n   */\n\n\n  Parser.prototype.getAll = function () {\n    return extend({}, this.scope);\n  };\n  /**\n   * Set a symbol (a function or variable) by name from the parsers scope.\n   * @param {string} name\n   * @param {* | undefined} value\n   */\n\n\n  Parser.prototype.set = function (name, value) {\n    // TODO: validate arguments\n    return customs.setSafeProperty(this.scope, name, value);\n  };\n  /**\n   * Remove a variable from the parsers scope\n   * @param {string} name\n   */\n\n\n  Parser.prototype.remove = function (name) {\n    // TODO: validate arguments\n    delete this.scope[name];\n  };\n  /**\n   * Clear the scope with variables and functions\n   */\n\n\n  Parser.prototype.clear = function () {\n    for (var name in this.scope) {\n      if (this.scope.hasOwnProperty(name)) {\n        delete this.scope[name];\n      }\n    }\n  };\n\n  return Parser;\n}\n\nexports.name = 'Parser';\nexports.path = 'expression';\nexports.factory = factory;\nexports.math = true; // requires the math namespace as 5th argument","\"use strict\";\n\nmodule.exports = {\n  'name': 'Infinity',\n  'category': 'Constants',\n  'syntax': ['Infinity'],\n  'description': 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',\n  'examples': ['Infinity', '1 / 0'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'LN10',\n  'category': 'Constants',\n  'syntax': ['LN10'],\n  'description': 'Returns the natural logarithm of 10, approximately equal to 2.302',\n  'examples': ['LN10', 'log(10)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'LN2',\n  'category': 'Constants',\n  'syntax': ['LN2'],\n  'description': 'Returns the natural logarithm of 2, approximately equal to 0.693',\n  'examples': ['LN2', 'log(2)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'LOG10E',\n  'category': 'Constants',\n  'syntax': ['LOG10E'],\n  'description': 'Returns the base-10 logarithm of E, approximately equal to 0.434',\n  'examples': ['LOG10E', 'log(e, 10)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'LOG2E',\n  'category': 'Constants',\n  'syntax': ['LOG2E'],\n  'description': 'Returns the base-2 logarithm of E, approximately equal to 1.442',\n  'examples': ['LOG2E', 'log(e, 2)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'NaN',\n  'category': 'Constants',\n  'syntax': ['NaN'],\n  'description': 'Not a number',\n  'examples': ['NaN', '0 / 0'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'SQRT1_2',\n  'category': 'Constants',\n  'syntax': ['SQRT1_2'],\n  'description': 'Returns the square root of 1/2, approximately equal to 0.707',\n  'examples': ['SQRT1_2', 'sqrt(1/2)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'SQRT2',\n  'category': 'Constants',\n  'syntax': ['SQRT2'],\n  'description': 'Returns the square root of 2, approximately equal to 1.414',\n  'examples': ['SQRT2', 'sqrt(2)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'e',\n  'category': 'Constants',\n  'syntax': ['e'],\n  'description': 'Euler\\'s number, the base of the natural logarithm. Approximately equal to 2.71828',\n  'examples': ['e', 'e ^ 2', 'exp(2)', 'log(e)'],\n  'seealso': ['exp']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'false',\n  'category': 'Constants',\n  'syntax': ['false'],\n  'description': 'Boolean value false',\n  'examples': ['false'],\n  'seealso': ['true']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'i',\n  'category': 'Constants',\n  'syntax': ['i'],\n  'description': 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',\n  'examples': ['i', 'i * i', 'sqrt(-1)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'null',\n  'category': 'Constants',\n  'syntax': ['null'],\n  'description': 'Value null',\n  'examples': ['null'],\n  'seealso': ['true', 'false']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'phi',\n  'category': 'Constants',\n  'syntax': ['phi'],\n  'description': 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',\n  'examples': ['phi'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'pi',\n  'category': 'Constants',\n  'syntax': ['pi'],\n  'description': 'The number pi is a mathematical constant that is the ratio of a circle\\'s circumference to its diameter, and is approximately equal to 3.14159',\n  'examples': ['pi', 'sin(pi/2)'],\n  'seealso': ['tau']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'tau',\n  'category': 'Constants',\n  'syntax': ['tau'],\n  'description': 'Tau is the ratio constant of a circle\\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',\n  'examples': ['tau', '2 * pi'],\n  'seealso': ['pi']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'true',\n  'category': 'Constants',\n  'syntax': ['true'],\n  'description': 'Boolean value true',\n  'examples': ['true'],\n  'seealso': ['false']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'version',\n  'category': 'Constants',\n  'syntax': ['version'],\n  'description': 'A string with the version number of math.js',\n  'examples': ['version'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'bignumber',\n  'category': 'Construction',\n  'syntax': ['bignumber(x)'],\n  'description': 'Create a big number from a number or string.',\n  'examples': ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber(\"7.2\")', 'bignumber(\"7.2e500\")', 'bignumber([0.1, 0.2, 0.3])'],\n  'seealso': ['boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'boolean',\n  'category': 'Construction',\n  'syntax': ['x', 'boolean(x)'],\n  'description': 'Convert a string or number into a boolean.',\n  'examples': ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean(\"true\")', 'boolean(\"false\")', 'boolean([1, 0, 1, 1])'],\n  'seealso': ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'complex',\n  'category': 'Construction',\n  'syntax': ['complex()', 'complex(re, im)', 'complex(string)'],\n  'description': 'Create a complex number.',\n  'examples': ['complex()', 'complex(2, 3)', 'complex(\"7 - 2i\")'],\n  'seealso': ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'createUnit',\n  'category': 'Construction',\n  'syntax': ['createUnit(definitions)', 'createUnit(name, definition)'],\n  'description': 'Create a user-defined unit and register it with the Unit type.',\n  'examples': ['createUnit(\"foo\")', 'createUnit(\"knot\", {definition: \"0.514444444 m/s\", aliases: [\"knots\", \"kt\", \"kts\"]})', 'createUnit(\"mph\", \"1 mile/hour\")'],\n  'seealso': ['unit', 'splitUnit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'fraction',\n  'category': 'Construction',\n  'syntax': ['fraction(num)', 'fraction(num,den)'],\n  'description': 'Create a fraction from a number or from a numerator and denominator.',\n  'examples': ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'index',\n  'category': 'Construction',\n  'syntax': ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],\n  'description': 'Create an index to get or replace a subset of a matrix',\n  'examples': ['[]', '[1, 2, 3]', 'A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[0:2, 0:2] = ones(2, 2)'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'matrix',\n  'category': 'Construction',\n  'syntax': ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix(\"dense\")', 'matrix([...])'],\n  'description': 'Create a matrix.',\n  'examples': ['[]', '[1, 2, 3]', '[1, 2, 3; 4, 5, 6]', 'matrix()', 'matrix([3, 4])', 'matrix([3, 4; 5, 6], \"sparse\")', 'matrix([3, 4; 5, 6], \"sparse\", \"number\")'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'number',\n  'category': 'Construction',\n  'syntax': ['x', 'number(x)', 'number(unit, valuelessUnit)'],\n  'description': 'Create a number or convert a string or boolean into a number.',\n  'examples': ['2', '2e3', '4.05', 'number(2)', 'number(\"7.2\")', 'number(true)', 'number([true, false, true, true])', 'number(unit(\"52cm\"), \"m\")'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sparse',\n  'category': 'Construction',\n  'syntax': ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], \"number\")'],\n  'description': 'Create a sparse matrix.',\n  'examples': ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], \"number\")'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'splitUnit',\n  'category': 'Construction',\n  'syntax': ['splitUnit(unit: Unit, parts: Unit[])'],\n  'description': 'Split a unit in an array of units whose sum is equal to the original unit.',\n  'examples': ['splitUnit(1 m, [\"feet\", \"inch\"])'],\n  'seealso': ['unit', 'createUnit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'string',\n  'category': 'Construction',\n  'syntax': ['\"text\"', 'string(x)'],\n  'description': 'Create a string or convert a value to a string',\n  'examples': ['\"Hello World!\"', 'string(4.2)', 'string(3 + 2i)'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'unit',\n  'category': 'Construction',\n  'syntax': ['value unit', 'unit(value, unit)', 'unit(string)'],\n  'description': 'Create a unit.',\n  'examples': ['5.5 mm', '3 inch', 'unit(7.1, \"kilogram\")', 'unit(\"23 deg\")'],\n  'seealso': ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'config',\n  'category': 'Core',\n  'syntax': ['config()', 'config(options)'],\n  'description': 'Get configuration or change configuration.',\n  'examples': ['config()', '1/3 + 1/4', 'config({number: \"Fraction\"})', '1/3 + 1/4'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'import',\n  'category': 'Core',\n  'syntax': ['import(functions)', 'import(functions, options)'],\n  'description': 'Import functions or constants from an object.',\n  'examples': ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'typed',\n  'category': 'Core',\n  'syntax': ['typed(signatures)', 'typed(name, signatures)'],\n  'description': 'Create a typed function.',\n  'examples': ['double = typed({ \"number, number\": f(x)=x+x })', 'double(2)', 'double(\"hello\")'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'derivative',\n  'category': 'Algebra',\n  'syntax': ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],\n  'description': 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',\n  'examples': ['derivative(\"2x^3\", \"x\")', 'derivative(\"2x^3\", \"x\", {simplify: false})', 'derivative(\"2x^2 + 3x + 4\", \"x\")', 'derivative(\"sin(2x)\", \"x\")', 'f = parse(\"x^2 + x\")', 'x = parse(\"x\")', 'df = derivative(f, x)', 'df.eval({x: 3})'],\n  'seealso': ['simplify', 'parse', 'eval']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'lsolve',\n  'category': 'Algebra',\n  'syntax': ['x=lsolve(L, b)'],\n  'description': 'Solves the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',\n  'examples': ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],\n  'seealso': ['lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'lup',\n  'category': 'Algebra',\n  'syntax': ['lup(m)'],\n  'description': 'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',\n  'examples': ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],\n  'seealso': ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'lusolve',\n  'category': 'Algebra',\n  'syntax': ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],\n  'description': 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',\n  'examples': ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],\n  'seealso': ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'qr',\n  'category': 'Algebra',\n  'syntax': ['qr(A)'],\n  'description': 'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',\n  'examples': ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],\n  'seealso': ['lup', 'slu', 'matrix']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'rationalize',\n  'category': 'Algebra',\n  'syntax': ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],\n  'description': 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',\n  'examples': ['rationalize(\"2x/y - y/(x+1)\")', 'rationalize(\"2x/y - y/(x+1)\", true)'],\n  'seealso': ['simplify']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'simplify',\n  'category': 'Algebra',\n  'syntax': ['simplify(expr)', 'simplify(expr, rules)'],\n  'description': 'Simplify an expression tree.',\n  'examples': ['simplify(\"3 + 2 / 4\")', 'simplify(\"2x + x\")', 'f = parse(\"x * (x + 2 + x)\")', 'simplified = simplify(f)', 'simplified.eval({x: 2})'],\n  'seealso': ['derivative', 'parse', 'eval']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'slu',\n  'category': 'Algebra',\n  'syntax': ['slu(A, order, threshold)'],\n  'description': 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',\n  'examples': ['slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'],\n  'seealso': ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'usolve',\n  'category': 'Algebra',\n  'syntax': ['x=usolve(U, b)'],\n  'description': 'Solves the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',\n  'examples': ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],\n  'seealso': ['lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'abs',\n  'category': 'Arithmetic',\n  'syntax': ['abs(x)'],\n  'description': 'Compute the absolute value.',\n  'examples': ['abs(3.5)', 'abs(-4.2)'],\n  'seealso': ['sign']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'add',\n  'category': 'Operators',\n  'syntax': ['x + y', 'add(x, y)'],\n  'description': 'Add two values.',\n  'examples': ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '\"2.3\" + \"4\"'],\n  'seealso': ['subtract']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'cbrt',\n  'category': 'Arithmetic',\n  'syntax': ['cbrt(x)', 'cbrt(x, allRoots)'],\n  'description': 'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',\n  'examples': ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],\n  'seealso': ['square', 'sqrt', 'cube', 'multiply']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'ceil',\n  'category': 'Arithmetic',\n  'syntax': ['ceil(x)'],\n  'description': 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',\n  'examples': ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)'],\n  'seealso': ['floor', 'fix', 'round']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'cube',\n  'category': 'Arithmetic',\n  'syntax': ['cube(x)'],\n  'description': 'Compute the cube of a value. The cube of x is x * x * x.',\n  'examples': ['cube(2)', '2^3', '2 * 2 * 2'],\n  'seealso': ['multiply', 'square', 'pow']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'divide',\n  'category': 'Operators',\n  'syntax': ['x / y', 'divide(x, y)'],\n  'description': 'Divide two values.',\n  'examples': ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],\n  'seealso': ['multiply']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'dotDivide',\n  'category': 'Operators',\n  'syntax': ['x ./ y', 'dotDivide(x, y)'],\n  'description': 'Divide two values element wise.',\n  'examples': ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],\n  'seealso': ['multiply', 'dotMultiply', 'divide']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'dotMultiply',\n  'category': 'Operators',\n  'syntax': ['x .* y', 'dotMultiply(x, y)'],\n  'description': 'Multiply two values element wise.',\n  'examples': ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],\n  'seealso': ['multiply', 'divide', 'dotDivide']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'dotpow',\n  'category': 'Operators',\n  'syntax': ['x .^ y', 'dotpow(x, y)'],\n  'description': 'Calculates the power of x to y element wise.',\n  'examples': ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],\n  'seealso': ['pow']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'exp',\n  'category': 'Arithmetic',\n  'syntax': ['exp(x)'],\n  'description': 'Calculate the exponent of a value.',\n  'examples': ['exp(1.3)', 'e ^ 1.3', 'log(exp(1.3))', 'x = 2.4', '(exp(i*x) == cos(x) + i*sin(x))   # Euler\\'s formula'],\n  'seealso': ['expm', 'expm1', 'pow', 'log']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'expm',\n  'category': 'Arithmetic',\n  'syntax': ['exp(x)'],\n  'description': 'Compute the matrix exponential, expm(A) = e^A. ' + 'The matrix must be square. ' + 'Not to be confused with exp(a), which performs element-wise exponentiation.',\n  'examples': ['expm([[0,2],[0,0]])'],\n  'seealso': ['exp']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'expm1',\n  'category': 'Arithmetic',\n  'syntax': ['expm1(x)'],\n  'description': 'Calculate the value of subtracting 1 from the exponential value.',\n  'examples': ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],\n  'seealso': ['exp', 'pow', 'log']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'fix',\n  'category': 'Arithmetic',\n  'syntax': ['fix(x)'],\n  'description': 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',\n  'examples': ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)'],\n  'seealso': ['ceil', 'floor', 'round']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'floor',\n  'category': 'Arithmetic',\n  'syntax': ['floor(x)'],\n  'description': 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',\n  'examples': ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)'],\n  'seealso': ['ceil', 'fix', 'round']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'gcd',\n  'category': 'Arithmetic',\n  'syntax': ['gcd(a, b)', 'gcd(a, b, c, ...)'],\n  'description': 'Compute the greatest common divisor.',\n  'examples': ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],\n  'seealso': ['lcm', 'xgcd']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'hypot',\n  'category': 'Arithmetic',\n  'syntax': ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],\n  'description': 'Calculate the hypotenusa of a list with values. ',\n  'examples': ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],\n  'seealso': ['abs', 'norm']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'lcm',\n  'category': 'Arithmetic',\n  'syntax': ['lcm(x, y)'],\n  'description': 'Compute the least common multiple.',\n  'examples': ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],\n  'seealso': ['gcd']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'log',\n  'category': 'Arithmetic',\n  'syntax': ['log(x)', 'log(x, base)'],\n  'description': 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',\n  'examples': ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],\n  'seealso': ['exp', 'log1p', 'log2', 'log10']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'log10',\n  'category': 'Arithmetic',\n  'syntax': ['log10(x)'],\n  'description': 'Compute the 10-base logarithm of a value.',\n  'examples': ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],\n  'seealso': ['exp', 'log']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'log1p',\n  'category': 'Arithmetic',\n  'syntax': ['log1p(x)', 'log1p(x, base)'],\n  'description': 'Calculate the logarithm of a `value+1`',\n  'examples': ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],\n  'seealso': ['exp', 'log', 'log2', 'log10']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'log2',\n  'category': 'Arithmetic',\n  'syntax': ['log2(x)'],\n  'description': 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',\n  'examples': ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],\n  'seealso': ['exp', 'log1p', 'log', 'log10']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'mod',\n  'category': 'Operators',\n  'syntax': ['x % y', 'x mod y', 'mod(x, y)'],\n  'description': 'Calculates the modulus, the remainder of an integer division.',\n  'examples': ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],\n  'seealso': ['divide']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'multiply',\n  'category': 'Operators',\n  'syntax': ['x * y', 'multiply(x, y)'],\n  'description': 'multiply two values.',\n  'examples': ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],\n  'seealso': ['divide']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'norm',\n  'category': 'Arithmetic',\n  'syntax': ['norm(x)', 'norm(x, p)'],\n  'description': 'Calculate the norm of a number, vector or matrix.',\n  'examples': ['abs(-3.5)', 'norm(-3.5)', 'norm(3 - 4i)', 'norm([1, 2, -3], Infinity)', 'norm([1, 2, -3], -Infinity)', 'norm([3, 4], 2)', 'norm([[1, 2], [3, 4]], 1)', 'norm([[1, 2], [3, 4]], \"inf\")', 'norm([[1, 2], [3, 4]], \"fro\")']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'nthRoot',\n  'category': 'Arithmetic',\n  'syntax': ['nthRoot(a)', 'nthRoot(a, root)'],\n  'description': 'Calculate the nth root of a value. ' + 'The principal nth root of a positive real number A, ' + 'is the positive real solution of the equation \"x^root = A\".',\n  'examples': ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],\n  'seealso': ['nthRoots', 'pow', 'sqrt']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'nthRoots',\n  'category': 'Arithmetic',\n  'syntax': ['nthRoots(A)', 'nthRoots(A, root)'],\n  'description': '' + 'Calculate the nth roots of a value. ' + 'An nth root of a positive real number A, ' + 'is a positive real solution of the equation \"x^root = A\". ' + 'This function returns an array of complex values.',\n  'examples': ['nthRoots(1)', 'nthRoots(1, 3)'],\n  'seealso': ['sqrt', 'pow', 'nthRoot']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'pow',\n  'category': 'Operators',\n  'syntax': ['x ^ y', 'pow(x, y)'],\n  'description': 'Calculates the power of x to y, x^y.',\n  'examples': ['2^3', '2*2*2', '1 + e ^ (pi * i)'],\n  'seealso': ['multiply', 'nthRoot', 'nthRoots', 'sqrt']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'round',\n  'category': 'Arithmetic',\n  'syntax': ['round(x)', 'round(x, n)'],\n  'description': 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',\n  'examples': ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)'],\n  'seealso': ['ceil', 'floor', 'fix']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sign',\n  'category': 'Arithmetic',\n  'syntax': ['sign(x)'],\n  'description': 'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.',\n  'examples': ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],\n  'seealso': ['abs']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sqrt',\n  'category': 'Arithmetic',\n  'syntax': ['sqrt(x)'],\n  'description': 'Compute the square root value. If x = y * y, then y is the square root of x.',\n  'examples': ['sqrt(25)', '5 * 5', 'sqrt(-1)'],\n  'seealso': ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sqrtm',\n  'category': 'Arithmetic',\n  'syntax': ['sqrtm(x)'],\n  'description': 'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',\n  'examples': ['sqrtm([[1, 2], [3, 4]])'],\n  'seealso': ['sqrt', 'abs', 'square', 'multiply']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'square',\n  'category': 'Arithmetic',\n  'syntax': ['square(x)'],\n  'description': 'Compute the square of a value. The square of x is x * x.',\n  'examples': ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],\n  'seealso': ['multiply', 'pow', 'sqrt', 'cube']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'subtract',\n  'category': 'Operators',\n  'syntax': ['x - y', 'subtract(x, y)'],\n  'description': 'subtract two values.',\n  'examples': ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],\n  'seealso': ['add']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'unaryMinus',\n  'category': 'Operators',\n  'syntax': ['-x', 'unaryMinus(x)'],\n  'description': 'Inverse the sign of a value. Converts booleans and strings to numbers.',\n  'examples': ['-4.5', '-(-5.6)', '-\"22\"'],\n  'seealso': ['add', 'subtract', 'unaryPlus']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'unaryPlus',\n  'category': 'Operators',\n  'syntax': ['+x', 'unaryPlus(x)'],\n  'description': 'Converts booleans and strings to numbers.',\n  'examples': ['+true', '+\"2\"'],\n  'seealso': ['add', 'subtract', 'unaryMinus']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'xgcd',\n  'category': 'Arithmetic',\n  'syntax': ['xgcd(a, b)'],\n  'description': 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',\n  'examples': ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],\n  'seealso': ['gcd', 'lcm']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'bitAnd',\n  'category': 'Bitwise',\n  'syntax': ['x & y', 'bitAnd(x, y)'],\n  'description': 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',\n  'examples': ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],\n  'seealso': ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'bitNot',\n  'category': 'Bitwise',\n  'syntax': ['~x', 'bitNot(x)'],\n  'description': 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',\n  'examples': ['~1', '~2', 'bitNot([2, -3, 4])'],\n  'seealso': ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'bitOr',\n  'category': 'Bitwise',\n  'syntax': ['x | y', 'bitOr(x, y)'],\n  'description': 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',\n  'examples': ['5 | 3', 'bitOr([1, 2, 3], 4)'],\n  'seealso': ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'bitXor',\n  'category': 'Bitwise',\n  'syntax': ['bitXor(x, y)'],\n  'description': 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',\n  'examples': ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],\n  'seealso': ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'leftShift',\n  'category': 'Bitwise',\n  'syntax': ['x << y', 'leftShift(x, y)'],\n  'description': 'Bitwise left logical shift of a value x by y number of bits.',\n  'examples': ['4 << 1', '8 >> 1'],\n  'seealso': ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'rightArithShift',\n  'category': 'Bitwise',\n  'syntax': ['x >> y', 'rightArithShift(x, y)'],\n  'description': 'Bitwise right arithmetic shift of a value x by y number of bits.',\n  'examples': ['8 >> 1', '4 << 1', '-12 >> 2'],\n  'seealso': ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'rightLogShift',\n  'category': 'Bitwise',\n  'syntax': ['x >>> y', 'rightLogShift(x, y)'],\n  'description': 'Bitwise right logical shift of a value x by y number of bits.',\n  'examples': ['8 >>> 1', '4 << 1', '-12 >>> 2'],\n  'seealso': ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'bellNumbers',\n  'category': 'Combinatorics',\n  'syntax': ['bellNumbers(n)'],\n  'description': 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',\n  'examples': ['bellNumbers(3)', 'bellNumbers(8)'],\n  'seealso': ['stirlingS2']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'catalan',\n  'category': 'Combinatorics',\n  'syntax': ['catalan(n)'],\n  'description': 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',\n  'examples': ['catalan(3)', 'catalan(8)'],\n  'seealso': ['bellNumbers']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'composition',\n  'category': 'Combinatorics',\n  'syntax': ['composition(n, k)'],\n  'description': 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',\n  'examples': ['composition(5, 3)'],\n  'seealso': ['combinations']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'stirlingS2',\n  'category': 'Combinatorics',\n  'syntax': ['stirlingS2(n, k)'],\n  'description': 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',\n  'examples': ['stirlingS2(5, 3)'],\n  'seealso': ['bellNumbers']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'arg',\n  'category': 'Complex',\n  'syntax': ['arg(x)'],\n  'description': 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',\n  'examples': ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],\n  'seealso': ['re', 'im', 'conj', 'abs']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'conj',\n  'category': 'Complex',\n  'syntax': ['conj(x)'],\n  'description': 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',\n  'examples': ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],\n  'seealso': ['re', 'im', 'abs', 'arg']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'im',\n  'category': 'Complex',\n  'syntax': ['im(x)'],\n  'description': 'Get the imaginary part of a complex number.',\n  'examples': ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],\n  'seealso': ['re', 'conj', 'abs', 'arg']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 're',\n  'category': 'Complex',\n  'syntax': ['re(x)'],\n  'description': 'Get the real part of a complex number.',\n  'examples': ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],\n  'seealso': ['im', 'conj', 'abs', 'arg']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'eval',\n  'category': 'Expression',\n  'syntax': ['eval(expression)', 'eval([expr1, expr2, expr3, ...])'],\n  'description': 'Evaluate an expression or an array with expressions.',\n  'examples': ['eval(\"2 + 3\")', 'eval(\"sqrt(\" + 4 + \")\")'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'help',\n  'category': 'Expression',\n  'syntax': ['help(object)', 'help(string)'],\n  'description': 'Display documentation on a function or data type.',\n  'examples': ['help(sqrt)', 'help(\"complex\")'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'distance',\n  'category': 'Geometry',\n  'syntax': ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2])'],\n  'description': 'Calculates the Euclidean distance between two points.',\n  'examples': ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'intersect',\n  'category': 'Geometry',\n  'syntax': ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],\n  'description': 'Computes the intersection point of lines and/or planes.',\n  'examples': ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'and',\n  'category': 'Logical',\n  'syntax': ['x and y', 'and(x, y)'],\n  'description': 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',\n  'examples': ['true and false', 'true and true', '2 and 4'],\n  'seealso': ['not', 'or', 'xor']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'not',\n  'category': 'Logical',\n  'syntax': ['not x', 'not(x)'],\n  'description': 'Logical not. Flips the boolean value of given argument.',\n  'examples': ['not true', 'not false', 'not 2', 'not 0'],\n  'seealso': ['and', 'or', 'xor']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'or',\n  'category': 'Logical',\n  'syntax': ['x or y', 'or(x, y)'],\n  'description': 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',\n  'examples': ['true or false', 'false or false', '0 or 4'],\n  'seealso': ['not', 'and', 'xor']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'xor',\n  'category': 'Logical',\n  'syntax': ['x xor y', 'xor(x, y)'],\n  'description': 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',\n  'examples': ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],\n  'seealso': ['not', 'and', 'or']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'concat',\n  'category': 'Matrix',\n  'syntax': ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],\n  'description': 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',\n  'examples': ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],\n  'seealso': ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'cross',\n  'category': 'Matrix',\n  'syntax': ['cross(A, B)'],\n  'description': 'Calculate the cross product for two vectors in three dimensional space.',\n  'examples': ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],\n  'seealso': ['multiply', 'dot']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'transpose',\n  'category': 'Matrix',\n  'syntax': ['x\\'', 'ctranspose(x)'],\n  'description': 'Complex Conjugate and Transpose a matrix',\n  'examples': ['a = [1, 2, 3; 4, 5, 6]', 'a\\'', 'ctranspose(a)'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'det',\n  'category': 'Matrix',\n  'syntax': ['det(x)'],\n  'description': 'Calculate the determinant of a matrix',\n  'examples': ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],\n  'seealso': ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'diag',\n  'category': 'Matrix',\n  'syntax': ['diag(x)', 'diag(x, k)'],\n  'description': 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',\n  'examples': ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],\n  'seealso': ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'dot',\n  'category': 'Matrix',\n  'syntax': ['dot(A, B)', 'A * B'],\n  'description': 'Calculate the dot product of two vectors. ' + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',\n  'examples': ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],\n  'seealso': ['multiply', 'cross']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'filter',\n  'category': 'Matrix',\n  'syntax': ['filter(x, test)'],\n  'description': 'Filter items in a matrix.',\n  'examples': ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],\n  'seealso': ['sort', 'map', 'forEach']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'flatten',\n  'category': 'Matrix',\n  'syntax': ['flatten(x)'],\n  'description': 'Flatten a multi dimensional matrix into a single dimensional matrix.',\n  'examples': ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],\n  'seealso': ['concat', 'resize', 'size', 'squeeze']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'forEach',\n  'category': 'Matrix',\n  'syntax': ['forEach(x, callback)'],\n  'description': 'Iterates over all elements of a matrix/array, and executes the given callback function.',\n  'examples': ['forEach([1, 2, 3], function(val) { console.log(val) })'],\n  'seealso': ['map', 'sort', 'filter']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'getMatrixDataType',\n  'category': 'Matrix',\n  'syntax': ['getMatrixDataType(x)'],\n  'description': 'Find the data type of all elements in a matrix or array, ' + 'for example \"number\" if all items are a number ' + 'and \"Complex\" if all values are complex numbers. ' + 'If a matrix contains more than one data type, it will return \"mixed\".',\n  'examples': ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, \"text\"])', 'getMatrixDataType([1, bignumber(4)])'],\n  'seealso': ['matrix', 'sparse', 'typeof']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'identity',\n  'category': 'Matrix',\n  'syntax': ['identity(n)', 'identity(m, n)', 'identity([m, n])'],\n  'description': 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',\n  'examples': ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],\n  'seealso': ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'inv',\n  'category': 'Matrix',\n  'syntax': ['inv(x)'],\n  'description': 'Calculate the inverse of a matrix',\n  'examples': ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'kron',\n  'category': 'Matrix',\n  'syntax': ['kron(x, y)'],\n  'description': 'Calculates the kronecker product of 2 matrices or vectors.',\n  'examples': ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],\n  'seealso': ['multiply', 'dot', 'cross']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'map',\n  'category': 'Matrix',\n  'syntax': ['map(x, callback)'],\n  'description': 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.',\n  'examples': ['map([1, 2, 3], square)'],\n  'seealso': ['filter', 'forEach']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'ones',\n  'category': 'Matrix',\n  'syntax': ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],\n  'description': 'Create a matrix containing ones.',\n  'examples': ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'partitionSelect',\n  'category': 'Matrix',\n  'syntax': ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],\n  'description': 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',\n  'examples': ['partitionSelect([5, 10, 1], 2)', 'partitionSelect([\"C\", \"B\", \"A\", \"D\"], 1)'],\n  'seealso': ['sort']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'range',\n  'category': 'Type',\n  'syntax': ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],\n  'description': 'Create a range. Lower bound of the range is included, upper bound is excluded.',\n  'examples': ['1:5', '3:-1:-3', 'range(3, 7)', 'range(0, 12, 2)', 'range(\"4:10\")', 'a = [1, 2, 3, 4; 5, 6, 7, 8]', 'a[1:2, 1:2]'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'reshape',\n  'category': 'Matrix',\n  'syntax': ['reshape(x, sizes)'],\n  'description': 'Reshape a multi dimensional array to fit the specified dimensions.',\n  'examples': ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])'],\n  'seealso': ['size', 'squeeze', 'resize']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'resize',\n  'category': 'Matrix',\n  'syntax': ['resize(x, size)', 'resize(x, size, defaultValue)'],\n  'description': 'Resize a matrix.',\n  'examples': ['resize([1,2,3,4,5], [3])', 'resize([1,2,3], [5])', 'resize([1,2,3], [5], -1)', 'resize(2, [2, 3])', 'resize(\"hello\", [8], \"!\")'],\n  'seealso': ['size', 'subset', 'squeeze', 'reshape']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'size',\n  'category': 'Matrix',\n  'syntax': ['size(x)'],\n  'description': 'Calculate the size of a matrix.',\n  'examples': ['size(2.3)', 'size(\"hello world\")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sort',\n  'category': 'Matrix',\n  'syntax': ['sort(x)', 'sort(x, compare)'],\n  'description': 'Sort the items in a matrix. Compare can be a string \"asc\", \"desc\", \"natural\", or a custom sort function.',\n  'examples': ['sort([5, 10, 1])', 'sort([\"C\", \"B\", \"A\", \"D\"])', 'sortByLength(a, b) = size(a)[1] - size(b)[1]', 'sort([\"Langdon\", \"Tom\", \"Sara\"], sortByLength)', 'sort([\"10\", \"1\", \"2\"], \"natural\")'],\n  'seealso': ['map', 'filter', 'forEach']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'squeeze',\n  'category': 'Matrix',\n  'syntax': ['squeeze(x)'],\n  'description': 'Remove inner and outer singleton dimensions from a matrix.',\n  'examples': ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'subset',\n  'category': 'Matrix',\n  'syntax': ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],\n  'description': 'Get or set a subset of a matrix or string. ' + 'Indexes are one-based. ' + 'Both the ranges lower-bound and upper-bound are included.',\n  'examples': ['d = [1, 2; 3, 4]', 'e = []', 'e[1, 1:2] = [5, 6]', 'e[2, :] = [7, 8]', 'f = d * e', 'f[2, 1]', 'f[:, 1]'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'trace',\n  'category': 'Matrix',\n  'syntax': ['trace(A)'],\n  'description': 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',\n  'examples': ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'transpose',\n  'category': 'Matrix',\n  'syntax': ['x\\'', 'transpose(x)'],\n  'description': 'Transpose a matrix',\n  'examples': ['a = [1, 2, 3; 4, 5, 6]', 'a\\'', 'transpose(a)'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'zeros',\n  'category': 'Matrix',\n  'syntax': ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],\n  'description': 'Create a matrix containing zeros.',\n  'examples': ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],\n  'seealso': ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'combinations',\n  'category': 'Probability',\n  'syntax': ['combinations(n, k)'],\n  'description': 'Compute the number of combinations of n items taken k at a time',\n  'examples': ['combinations(7, 5)'],\n  'seealso': ['permutations', 'factorial']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'factorial',\n  'category': 'Probability',\n  'syntax': ['n!', 'factorial(n)'],\n  'description': 'Compute the factorial of a value',\n  'examples': ['5!', '5 * 4 * 3 * 2 * 1', '3!'],\n  'seealso': ['combinations', 'permutations', 'gamma']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'gamma',\n  'category': 'Probability',\n  'syntax': ['gamma(n)'],\n  'description': 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',\n  'examples': ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],\n  'seealso': ['factorial']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'kldivergence',\n  'category': 'Probability',\n  'syntax': ['kldivergence(x, y)'],\n  'description': 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',\n  'examples': ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'multinomial',\n  'category': 'Probability',\n  'syntax': ['multinomial(A)'],\n  'description': 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',\n  'examples': ['multinomial([1, 2, 1])'],\n  'seealso': ['combinations', 'factorial']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'permutations',\n  'category': 'Probability',\n  'syntax': ['permutations(n)', 'permutations(n, k)'],\n  'description': 'Compute the number of permutations of n items taken k at a time',\n  'examples': ['permutations(5)', 'permutations(5, 3)'],\n  'seealso': ['combinations', 'factorial']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'pickRandom',\n  'category': 'Probability',\n  'syntax': ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],\n  'description': 'Pick a random entry from a given array.',\n  'examples': ['pickRandom(0:10)', 'pickRandom([1, 3, 1, 6])', 'pickRandom([1, 3, 1, 6], 2)', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'],\n  'seealso': ['random', 'randomInt']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'random',\n  'category': 'Probability',\n  'syntax': ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],\n  'description': 'Return a random number.',\n  'examples': ['random()', 'random(10, 20)', 'random([2, 3])'],\n  'seealso': ['pickRandom', 'randomInt']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'randomInt',\n  'category': 'Probability',\n  'syntax': ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],\n  'description': 'Return a random integer number',\n  'examples': ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],\n  'seealso': ['pickRandom', 'random']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'compare',\n  'category': 'Relational',\n  'syntax': ['compare(x, y)'],\n  'description': 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  'examples': ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],\n  'seealso': ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'compareNatural',\n  'category': 'Relational',\n  'syntax': ['compareNatural(x, y)'],\n  'description': 'Compare two values of any type in a deterministic, natural way. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  'examples': ['compareNatural(2, 3)', 'compareNatural(3, 2)', 'compareNatural(2, 2)', 'compareNatural(5cm, 40mm)', 'compareNatural(\"2\", \"10\")', 'compareNatural(2 + 3i, 2 + 4i)', 'compareNatural([1, 2, 4], [1, 2, 3])', 'compareNatural([1, 5], [1, 2, 3])', 'compareNatural([1, 2], [1, 2])', 'compareNatural({a: 2}, {a: 4})'],\n  'seealso': ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'compareText',\n  'category': 'Relational',\n  'syntax': ['compareText(x, y)'],\n  'description': 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  'examples': ['compareText(\"B\", \"A\")', 'compareText(\"A\", \"B\")', 'compareText(\"A\", \"A\")', 'compareText(\"2\", \"10\")', 'compare(\"2\", \"10\")', 'compare(2, 10)', 'compareNatural(\"2\", \"10\")', 'compareText(\"B\", [\"A\", \"B\", \"C\"])'],\n  'seealso': ['compare', 'compareNatural']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'deepEqual',\n  'category': 'Relational',\n  'syntax': ['deepEqual(x, y)'],\n  'description': 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',\n  'examples': ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],\n  'seealso': ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'equal',\n  'category': 'Relational',\n  'syntax': ['x == y', 'equal(x, y)'],\n  'description': 'Check equality of two values. Returns true if the values are equal, and false if not.',\n  'examples': ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],\n  'seealso': ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'equalText',\n  'category': 'Relational',\n  'syntax': ['equalText(x, y)'],\n  'description': 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',\n  'examples': ['equalText(\"Hello\", \"Hello\")', 'equalText(\"a\", \"A\")', 'equal(\"2e3\", \"2000\")', 'equalText(\"2e3\", \"2000\")', 'equalText(\"B\", [\"A\", \"B\", \"C\"])'],\n  'seealso': ['compare', 'compareNatural', 'compareText', 'equal']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'larger',\n  'category': 'Relational',\n  'syntax': ['x > y', 'larger(x, y)'],\n  'description': 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.',\n  'examples': ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],\n  'seealso': ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'largerEq',\n  'category': 'Relational',\n  'syntax': ['x >= y', 'largerEq(x, y)'],\n  'description': 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',\n  'examples': ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],\n  'seealso': ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'smaller',\n  'category': 'Relational',\n  'syntax': ['x < y', 'smaller(x, y)'],\n  'description': 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.',\n  'examples': ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],\n  'seealso': ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'smallerEq',\n  'category': 'Relational',\n  'syntax': ['x <= y', 'smallerEq(x, y)'],\n  'description': 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',\n  'examples': ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],\n  'seealso': ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'unequal',\n  'category': 'Relational',\n  'syntax': ['x != y', 'unequal(x, y)'],\n  'description': 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',\n  'examples': ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],\n  'seealso': ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setCartesian',\n  'category': 'Set',\n  'syntax': ['setCartesian(set1, set2)'],\n  'description': 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  'examples': ['setCartesian([1, 2], [3, 4])'],\n  'seealso': ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setDifference',\n  'category': 'Set',\n  'syntax': ['setDifference(set1, set2)'],\n  'description': 'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  'examples': ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  'seealso': ['setUnion', 'setIntersect', 'setSymDifference']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setDistinct',\n  'category': 'Set',\n  'syntax': ['setDistinct(set)'],\n  'description': 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  'examples': ['setDistinct([1, 1, 1, 2, 2, 3])'],\n  'seealso': ['setMultiplicity']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setIntersect',\n  'category': 'Set',\n  'syntax': ['setIntersect(set1, set2)'],\n  'description': 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  'examples': ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  'seealso': ['setUnion', 'setDifference']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setIsSubset',\n  'category': 'Set',\n  'syntax': ['setIsSubset(set1, set2)'],\n  'description': 'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  'examples': ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],\n  'seealso': ['setUnion', 'setIntersect', 'setDifference']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setMultiplicity',\n  'category': 'Set',\n  'syntax': ['setMultiplicity(element, set)'],\n  'description': 'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  'examples': ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],\n  'seealso': ['setDistinct', 'setSize']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setPowerset',\n  'category': 'Set',\n  'syntax': ['setPowerset(set)'],\n  'description': 'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  'examples': ['setPowerset([1, 2, 3])'],\n  'seealso': ['setCartesian']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setSize',\n  'category': 'Set',\n  'syntax': ['setSize(set)', 'setSize(set, unique)'],\n  'description': 'Count the number of elements of a (multi)set. When the second parameter \"unique\" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  'examples': ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],\n  'seealso': ['setUnion', 'setIntersect', 'setDifference']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setSymDifference',\n  'category': 'Set',\n  'syntax': ['setSymDifference(set1, set2)'],\n  'description': 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  'examples': ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  'seealso': ['setUnion', 'setIntersect', 'setDifference']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'setUnion',\n  'category': 'Set',\n  'syntax': ['setUnion(set1, set2)'],\n  'description': 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  'examples': ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],\n  'seealso': ['setIntersect', 'setDifference']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'erf',\n  'category': 'Special',\n  'syntax': ['erf(x)'],\n  'description': 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',\n  'examples': ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'mad',\n  'category': 'Statistics',\n  'syntax': ['mad(a, b, c, ...)', 'mad(A)'],\n  'description': 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',\n  'examples': ['mad(10, 20, 30)', 'mad([1, 2, 3])'],\n  'seealso': ['mean', 'median', 'std', 'abs']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'max',\n  'category': 'Statistics',\n  'syntax': ['max(a, b, c, ...)', 'max(A)', 'max(A, dim)'],\n  'description': 'Compute the maximum value of a list of values.',\n  'examples': ['max(2, 3, 4, 1)', 'max([2, 3, 4, 1])', 'max([2, 5; 4, 3])', 'max([2, 5; 4, 3], 1)', 'max([2, 5; 4, 3], 2)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)'],\n  'seealso': ['mean', 'median', 'min', 'prod', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'mean',\n  'category': 'Statistics',\n  'syntax': ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dim)'],\n  'description': 'Compute the arithmetic mean of a list of values.',\n  'examples': ['mean(2, 3, 4, 1)', 'mean([2, 3, 4, 1])', 'mean([2, 5; 4, 3])', 'mean([2, 5; 4, 3], 1)', 'mean([2, 5; 4, 3], 2)', 'mean([1.0, 2.7, 3.2, 4.0])'],\n  'seealso': ['max', 'median', 'min', 'prod', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'median',\n  'category': 'Statistics',\n  'syntax': ['median(a, b, c, ...)', 'median(A)'],\n  'description': 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',\n  'examples': ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],\n  'seealso': ['max', 'mean', 'min', 'prod', 'std', 'sum', 'var', 'quantileSeq']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'min',\n  'category': 'Statistics',\n  'syntax': ['min(a, b, c, ...)', 'min(A)', 'min(A, dim)'],\n  'description': 'Compute the minimum value of a list of values.',\n  'examples': ['min(2, 3, 4, 1)', 'min([2, 3, 4, 1])', 'min([2, 5; 4, 3])', 'min([2, 5; 4, 3], 1)', 'min([2, 5; 4, 3], 2)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)'],\n  'seealso': ['max', 'mean', 'median', 'prod', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'mode',\n  'category': 'Statistics',\n  'syntax': ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],\n  'description': 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',\n  'examples': ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],\n  'seealso': ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'prod',\n  'category': 'Statistics',\n  'syntax': ['prod(a, b, c, ...)', 'prod(A)'],\n  'description': 'Compute the product of all values.',\n  'examples': ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],\n  'seealso': ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'quantileSeq',\n  'category': 'Statistics',\n  'syntax': ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],\n  'description': 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probablity are: Number, BigNumber. \\n\\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',\n  'examples': ['quantileSeq([3, -1, 5, 7], 0.5)', 'quantileSeq([3, -1, 5, 7], [1/3, 2/3])', 'quantileSeq([3, -1, 5, 7], 2)', 'quantileSeq([-1, 3, 5, 7], 0.5, true)'],\n  'seealso': ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'std',\n  'category': 'Statistics',\n  'syntax': ['std(a, b, c, ...)', 'std(A)', 'std(A, normalization)'],\n  'description': 'Compute the standard deviation of all values, defined as std(A) = sqrt(var(A)). Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  'examples': ['std(2, 4, 6)', 'std([2, 4, 6, 8])', 'std([2, 4, 6, 8], \"uncorrected\")', 'std([2, 4, 6, 8], \"biased\")', 'std([1, 2, 3; 4, 5, 6])'],\n  'seealso': ['max', 'mean', 'min', 'median', 'min', 'prod', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sum',\n  'category': 'Statistics',\n  'syntax': ['sum(a, b, c, ...)', 'sum(A)'],\n  'description': 'Compute the sum of all values.',\n  'examples': ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],\n  'seealso': ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'var']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'var',\n  'category': 'Statistics',\n  'syntax': ['var(a, b, c, ...)', 'var(A)', 'var(A, normalization)'],\n  'description': 'Compute the variance of all values. Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  'examples': ['var(2, 4, 6)', 'var([2, 4, 6, 8])', 'var([2, 4, 6, 8], \"uncorrected\")', 'var([2, 4, 6, 8], \"biased\")', 'var([1, 2, 3; 4, 5, 6])'],\n  'seealso': ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'acos',\n  'category': 'Trigonometry',\n  'syntax': ['acos(x)'],\n  'description': 'Compute the inverse cosine of a value in radians.',\n  'examples': ['acos(0.5)', 'acos(cos(2.3))'],\n  'seealso': ['cos', 'atan', 'asin']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'acosh',\n  'category': 'Trigonometry',\n  'syntax': ['acosh(x)'],\n  'description': 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',\n  'examples': ['acosh(1.5)'],\n  'seealso': ['cosh', 'asinh', 'atanh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'acot',\n  'category': 'Trigonometry',\n  'syntax': ['acot(x)'],\n  'description': 'Calculate the inverse cotangent of a value.',\n  'examples': ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],\n  'seealso': ['cot', 'atan']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'acoth',\n  'category': 'Trigonometry',\n  'syntax': ['acoth(x)'],\n  'description': 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',\n  'examples': ['acoth(2)', 'acoth(0.5)'],\n  'seealso': ['acsch', 'asech']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'acsc',\n  'category': 'Trigonometry',\n  'syntax': ['acsc(x)'],\n  'description': 'Calculate the inverse cotangent of a value.',\n  'examples': ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],\n  'seealso': ['csc', 'asin', 'asec']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'acsch',\n  'category': 'Trigonometry',\n  'syntax': ['acsch(x)'],\n  'description': 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',\n  'examples': ['acsch(0.5)'],\n  'seealso': ['asech', 'acoth']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'asec',\n  'category': 'Trigonometry',\n  'syntax': ['asec(x)'],\n  'description': 'Calculate the inverse secant of a value.',\n  'examples': ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],\n  'seealso': ['acos', 'acot', 'acsc']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'asech',\n  'category': 'Trigonometry',\n  'syntax': ['asech(x)'],\n  'description': 'Calculate the inverse secant of a value.',\n  'examples': ['asech(0.5)'],\n  'seealso': ['acsch', 'acoth']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'asin',\n  'category': 'Trigonometry',\n  'syntax': ['asin(x)'],\n  'description': 'Compute the inverse sine of a value in radians.',\n  'examples': ['asin(0.5)', 'asin(sin(0.5))'],\n  'seealso': ['sin', 'acos', 'atan']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'asinh',\n  'category': 'Trigonometry',\n  'syntax': ['asinh(x)'],\n  'description': 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',\n  'examples': ['asinh(0.5)'],\n  'seealso': ['acosh', 'atanh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'atan',\n  'category': 'Trigonometry',\n  'syntax': ['atan(x)'],\n  'description': 'Compute the inverse tangent of a value in radians.',\n  'examples': ['atan(0.5)', 'atan(tan(0.5))'],\n  'seealso': ['tan', 'acos', 'asin']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'atan2',\n  'category': 'Trigonometry',\n  'syntax': ['atan2(y, x)'],\n  'description': 'Computes the principal value of the arc tangent of y/x in radians.',\n  'examples': ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],\n  'seealso': ['sin', 'cos', 'tan']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'atanh',\n  'category': 'Trigonometry',\n  'syntax': ['atanh(x)'],\n  'description': 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',\n  'examples': ['atanh(0.5)'],\n  'seealso': ['acosh', 'asinh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'cos',\n  'category': 'Trigonometry',\n  'syntax': ['cos(x)'],\n  'description': 'Compute the cosine of x in radians.',\n  'examples': ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],\n  'seealso': ['acos', 'sin', 'tan']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'cosh',\n  'category': 'Trigonometry',\n  'syntax': ['cosh(x)'],\n  'description': 'Compute the hyperbolic cosine of x in radians.',\n  'examples': ['cosh(0.5)'],\n  'seealso': ['sinh', 'tanh', 'coth']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'cot',\n  'category': 'Trigonometry',\n  'syntax': ['cot(x)'],\n  'description': 'Compute the cotangent of x in radians. Defined as 1/tan(x)',\n  'examples': ['cot(2)', '1 / tan(2)'],\n  'seealso': ['sec', 'csc', 'tan']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'coth',\n  'category': 'Trigonometry',\n  'syntax': ['coth(x)'],\n  'description': 'Compute the hyperbolic cotangent of x in radians.',\n  'examples': ['coth(2)', '1 / tanh(2)'],\n  'seealso': ['sech', 'csch', 'tanh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'csc',\n  'category': 'Trigonometry',\n  'syntax': ['csc(x)'],\n  'description': 'Compute the cosecant of x in radians. Defined as 1/sin(x)',\n  'examples': ['csc(2)', '1 / sin(2)'],\n  'seealso': ['sec', 'cot', 'sin']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'csch',\n  'category': 'Trigonometry',\n  'syntax': ['csch(x)'],\n  'description': 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',\n  'examples': ['csch(2)', '1 / sinh(2)'],\n  'seealso': ['sech', 'coth', 'sinh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sec',\n  'category': 'Trigonometry',\n  'syntax': ['sec(x)'],\n  'description': 'Compute the secant of x in radians. Defined as 1/cos(x)',\n  'examples': ['sec(2)', '1 / cos(2)'],\n  'seealso': ['cot', 'csc', 'cos']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sech',\n  'category': 'Trigonometry',\n  'syntax': ['sech(x)'],\n  'description': 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',\n  'examples': ['sech(2)', '1 / cosh(2)'],\n  'seealso': ['coth', 'csch', 'cosh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sin',\n  'category': 'Trigonometry',\n  'syntax': ['sin(x)'],\n  'description': 'Compute the sine of x in radians.',\n  'examples': ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],\n  'seealso': ['asin', 'cos', 'tan']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'sinh',\n  'category': 'Trigonometry',\n  'syntax': ['sinh(x)'],\n  'description': 'Compute the hyperbolic sine of x in radians.',\n  'examples': ['sinh(0.5)'],\n  'seealso': ['cosh', 'tanh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'tan',\n  'category': 'Trigonometry',\n  'syntax': ['tan(x)'],\n  'description': 'Compute the tangent of x in radians.',\n  'examples': ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],\n  'seealso': ['atan', 'sin', 'cos']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'tanh',\n  'category': 'Trigonometry',\n  'syntax': ['tanh(x)'],\n  'description': 'Compute the hyperbolic tangent of x in radians.',\n  'examples': ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],\n  'seealso': ['sinh', 'cosh']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'to',\n  'category': 'Units',\n  'syntax': ['x to unit', 'to(x, unit)'],\n  'description': 'Change the unit of a value.',\n  'examples': ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'clone',\n  'category': 'Utils',\n  'syntax': ['clone(x)'],\n  'description': 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices',\n  'examples': ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone(\"hello world\")'],\n  'seealso': []\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'format',\n  'category': 'Utils',\n  'syntax': ['format(value)', 'format(value, precision)'],\n  'description': 'Format a value of any type as string.',\n  'examples': ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],\n  'seealso': ['print']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'hasNumericValue',\n  'category': 'Utils',\n  'syntax': ['hasNumericValue(x)'],\n  'description': 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',\n  'examples': ['hasNumericValue(2)', 'hasNumericValue(\"2\")', 'isNumeric(\"2\")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, \"foo\", false])'],\n  'seealso': ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isInteger',\n  'category': 'Utils',\n  'syntax': ['isInteger(x)'],\n  'description': 'Test whether a value is an integer number.',\n  'examples': ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],\n  'seealso': ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isNaN',\n  'category': 'Utils',\n  'syntax': ['isNaN(x)'],\n  'description': 'Test whether a value is NaN (not a number)',\n  'examples': ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],\n  'seealso': ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isNegative',\n  'category': 'Utils',\n  'syntax': ['isNegative(x)'],\n  'description': 'Test whether a value is negative: smaller than zero.',\n  'examples': ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],\n  'seealso': ['isInteger', 'isNumeric', 'isPositive', 'isZero']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isNumeric',\n  'category': 'Utils',\n  'syntax': ['isNumeric(x)'],\n  'description': 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',\n  'examples': ['isNumeric(2)', 'isNumeric(\"2\")', 'hasNumericValue(\"2\")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, \"foo\", false])'],\n  'seealso': ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isPositive',\n  'category': 'Utils',\n  'syntax': ['isPositive(x)'],\n  'description': 'Test whether a value is positive: larger than zero.',\n  'examples': ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],\n  'seealso': ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isPrime',\n  'category': 'Utils',\n  'syntax': ['isPrime(x)'],\n  'description': 'Test whether a value is prime: has no divisors other than itself and one.',\n  'examples': ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],\n  'seealso': ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'isZero',\n  'category': 'Utils',\n  'syntax': ['isZero(x)'],\n  'description': 'Test whether a value is zero.',\n  'examples': ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],\n  'seealso': ['isInteger', 'isNumeric', 'isNegative', 'isPositive']\n};","\"use strict\";\n\nmodule.exports = {\n  'name': 'typeof',\n  'category': 'Utils',\n  'syntax': ['typeof(x)'],\n  'description': 'Get the type of a variable.',\n  'examples': ['typeof(3.5)', 'typeof(2 - 4i)', 'typeof(45 deg)', 'typeof(\"hello world\")'],\n  'seealso': ['getMatrixDataType']\n};","\"use strict\";\n\nfunction factory(construction, config, load, typed) {\n  var docs = {}; // construction functions\n\n  docs.bignumber = require('./construction/bignumber');\n  docs['boolean'] = require('./construction/boolean');\n  docs.complex = require('./construction/complex');\n  docs.createUnit = require('./construction/createUnit');\n  docs.fraction = require('./construction/fraction');\n  docs.index = require('./construction/index');\n  docs.matrix = require('./construction/matrix');\n  docs.number = require('./construction/number');\n  docs.sparse = require('./construction/sparse');\n  docs.splitUnit = require('./construction/splitUnit');\n  docs.string = require('./construction/string');\n  docs.unit = require('./construction/unit'); // constants\n\n  docs.e = require('./constants/e');\n  docs.E = require('./constants/e');\n  docs['false'] = require('./constants/false');\n  docs.i = require('./constants/i');\n  docs['Infinity'] = require('./constants/Infinity');\n  docs.LN2 = require('./constants/LN2');\n  docs.LN10 = require('./constants/LN10');\n  docs.LOG2E = require('./constants/LOG2E');\n  docs.LOG10E = require('./constants/LOG10E');\n  docs.NaN = require('./constants/NaN');\n  docs['null'] = require('./constants/null');\n  docs.pi = require('./constants/pi');\n  docs.PI = require('./constants/pi');\n  docs.phi = require('./constants/phi');\n  docs.SQRT1_2 = require('./constants/SQRT1_2');\n  docs.SQRT2 = require('./constants/SQRT2');\n  docs.tau = require('./constants/tau');\n  docs['true'] = require('./constants/true');\n  docs.version = require('./constants/version'); // physical constants\n  // TODO: more detailed docs for physical constants\n\n  docs.speedOfLight = {\n    description: 'Speed of light in vacuum',\n    examples: ['speedOfLight']\n  };\n  docs.gravitationConstant = {\n    description: 'Newtonian constant of gravitation',\n    examples: ['gravitationConstant']\n  };\n  docs.planckConstant = {\n    description: 'Planck constant',\n    examples: ['planckConstant']\n  };\n  docs.reducedPlanckConstant = {\n    description: 'Reduced Planck constant',\n    examples: ['reducedPlanckConstant']\n  };\n  docs.magneticConstant = {\n    description: 'Magnetic constant (vacuum permeability)',\n    examples: ['magneticConstant']\n  };\n  docs.electricConstant = {\n    description: 'Electric constant (vacuum permeability)',\n    examples: ['electricConstant']\n  };\n  docs.vacuumImpedance = {\n    description: 'Characteristic impedance of vacuum',\n    examples: ['vacuumImpedance']\n  };\n  docs.coulomb = {\n    description: 'Coulomb\\'s constant',\n    examples: ['coulomb']\n  };\n  docs.elementaryCharge = {\n    description: 'Elementary charge',\n    examples: ['elementaryCharge']\n  };\n  docs.bohrMagneton = {\n    description: 'Borh magneton',\n    examples: ['bohrMagneton']\n  };\n  docs.conductanceQuantum = {\n    description: 'Conductance quantum',\n    examples: ['conductanceQuantum']\n  };\n  docs.inverseConductanceQuantum = {\n    description: 'Inverse conductance quantum',\n    examples: ['inverseConductanceQuantum'] // docs.josephson = {description: 'Josephson constant', examples: ['josephson']}\n\n  };\n  docs.magneticFluxQuantum = {\n    description: 'Magnetic flux quantum',\n    examples: ['magneticFluxQuantum']\n  };\n  docs.nuclearMagneton = {\n    description: 'Nuclear magneton',\n    examples: ['nuclearMagneton']\n  };\n  docs.klitzing = {\n    description: 'Von Klitzing constant',\n    examples: ['klitzing']\n  };\n  docs.bohrRadius = {\n    description: 'Borh radius',\n    examples: ['bohrRadius']\n  };\n  docs.classicalElectronRadius = {\n    description: 'Classical electron radius',\n    examples: ['classicalElectronRadius']\n  };\n  docs.electronMass = {\n    description: 'Electron mass',\n    examples: ['electronMass']\n  };\n  docs.fermiCoupling = {\n    description: 'Fermi coupling constant',\n    examples: ['fermiCoupling']\n  };\n  docs.fineStructure = {\n    description: 'Fine-structure constant',\n    examples: ['fineStructure']\n  };\n  docs.hartreeEnergy = {\n    description: 'Hartree energy',\n    examples: ['hartreeEnergy']\n  };\n  docs.protonMass = {\n    description: 'Proton mass',\n    examples: ['protonMass']\n  };\n  docs.deuteronMass = {\n    description: 'Deuteron Mass',\n    examples: ['deuteronMass']\n  };\n  docs.neutronMass = {\n    description: 'Neutron mass',\n    examples: ['neutronMass']\n  };\n  docs.quantumOfCirculation = {\n    description: 'Quantum of circulation',\n    examples: ['quantumOfCirculation']\n  };\n  docs.rydberg = {\n    description: 'Rydberg constant',\n    examples: ['rydberg']\n  };\n  docs.thomsonCrossSection = {\n    description: 'Thomson cross section',\n    examples: ['thomsonCrossSection']\n  };\n  docs.weakMixingAngle = {\n    description: 'Weak mixing angle',\n    examples: ['weakMixingAngle']\n  };\n  docs.efimovFactor = {\n    description: 'Efimov factor',\n    examples: ['efimovFactor']\n  };\n  docs.atomicMass = {\n    description: 'Atomic mass constant',\n    examples: ['atomicMass']\n  };\n  docs.avogadro = {\n    description: 'Avogadro\\'s number',\n    examples: ['avogadro']\n  };\n  docs.boltzmann = {\n    description: 'Boltzmann constant',\n    examples: ['boltzmann']\n  };\n  docs.faraday = {\n    description: 'Faraday constant',\n    examples: ['faraday']\n  };\n  docs.firstRadiation = {\n    description: 'First radiation constant',\n    examples: ['firstRadiation']\n  };\n  docs.loschmidt = {\n    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',\n    examples: ['loschmidt']\n  };\n  docs.gasConstant = {\n    description: 'Gas constant',\n    examples: ['gasConstant']\n  };\n  docs.molarPlanckConstant = {\n    description: 'Molar Planck constant',\n    examples: ['molarPlanckConstant']\n  };\n  docs.molarVolume = {\n    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',\n    examples: ['molarVolume']\n  };\n  docs.sackurTetrode = {\n    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',\n    examples: ['sackurTetrode']\n  };\n  docs.secondRadiation = {\n    description: 'Second radiation constant',\n    examples: ['secondRadiation']\n  };\n  docs.stefanBoltzmann = {\n    description: 'Stefan-Boltzmann constant',\n    examples: ['stefanBoltzmann']\n  };\n  docs.wienDisplacement = {\n    description: 'Wien displacement law constant',\n    examples: ['wienDisplacement'] // docs.spectralRadiance = {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']}\n\n  };\n  docs.molarMass = {\n    description: 'Molar mass constant',\n    examples: ['molarMass']\n  };\n  docs.molarMassC12 = {\n    description: 'Molar mass constant of carbon-12',\n    examples: ['molarMassC12']\n  };\n  docs.gravity = {\n    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',\n    examples: ['gravity']\n  };\n  docs.planckLength = {\n    description: 'Planck length',\n    examples: ['planckLength']\n  };\n  docs.planckMass = {\n    description: 'Planck mass',\n    examples: ['planckMass']\n  };\n  docs.planckTime = {\n    description: 'Planck time',\n    examples: ['planckTime']\n  };\n  docs.planckCharge = {\n    description: 'Planck charge',\n    examples: ['planckCharge']\n  };\n  docs.planckTemperature = {\n    description: 'Planck temperature',\n    examples: ['planckTemperature'] // functions - algebra\n\n  };\n  docs.derivative = require('./function/algebra/derivative');\n  docs.lsolve = require('./function/algebra/lsolve');\n  docs.lup = require('./function/algebra/lup');\n  docs.lusolve = require('./function/algebra/lusolve');\n  docs.simplify = require('./function/algebra/simplify');\n  docs.rationalize = require('./function/algebra/rationalize');\n  docs.slu = require('./function/algebra/slu');\n  docs.usolve = require('./function/algebra/usolve');\n  docs.qr = require('./function/algebra/qr'); // functions - arithmetic\n\n  docs.abs = require('./function/arithmetic/abs');\n  docs.add = require('./function/arithmetic/add');\n  docs.cbrt = require('./function/arithmetic/cbrt');\n  docs.ceil = require('./function/arithmetic/ceil');\n  docs.cube = require('./function/arithmetic/cube');\n  docs.divide = require('./function/arithmetic/divide');\n  docs.dotDivide = require('./function/arithmetic/dotDivide');\n  docs.dotMultiply = require('./function/arithmetic/dotMultiply');\n  docs.dotPow = require('./function/arithmetic/dotPow');\n  docs.exp = require('./function/arithmetic/exp');\n  docs.expm = require('./function/arithmetic/expm');\n  docs.expm1 = require('./function/arithmetic/expm1');\n  docs.fix = require('./function/arithmetic/fix');\n  docs.floor = require('./function/arithmetic/floor');\n  docs.gcd = require('./function/arithmetic/gcd');\n  docs.hypot = require('./function/arithmetic/hypot');\n  docs.lcm = require('./function/arithmetic/lcm');\n  docs.log = require('./function/arithmetic/log');\n  docs.log2 = require('./function/arithmetic/log2');\n  docs.log1p = require('./function/arithmetic/log1p');\n  docs.log10 = require('./function/arithmetic/log10');\n  docs.mod = require('./function/arithmetic/mod');\n  docs.multiply = require('./function/arithmetic/multiply');\n  docs.norm = require('./function/arithmetic/norm');\n  docs.nthRoot = require('./function/arithmetic/nthRoot');\n  docs.nthRoots = require('./function/arithmetic/nthRoots');\n  docs.pow = require('./function/arithmetic/pow');\n  docs.round = require('./function/arithmetic/round');\n  docs.sign = require('./function/arithmetic/sign');\n  docs.sqrt = require('./function/arithmetic/sqrt');\n  docs.sqrtm = require('./function/arithmetic/sqrtm');\n  docs.square = require('./function/arithmetic/square');\n  docs.subtract = require('./function/arithmetic/subtract');\n  docs.unaryMinus = require('./function/arithmetic/unaryMinus');\n  docs.unaryPlus = require('./function/arithmetic/unaryPlus');\n  docs.xgcd = require('./function/arithmetic/xgcd'); // functions - bitwise\n\n  docs.bitAnd = require('./function/bitwise/bitAnd');\n  docs.bitNot = require('./function/bitwise/bitNot');\n  docs.bitOr = require('./function/bitwise/bitOr');\n  docs.bitXor = require('./function/bitwise/bitXor');\n  docs.leftShift = require('./function/bitwise/leftShift');\n  docs.rightArithShift = require('./function/bitwise/rightArithShift');\n  docs.rightLogShift = require('./function/bitwise/rightLogShift'); // functions - combinatorics\n\n  docs.bellNumbers = require('./function/combinatorics/bellNumbers');\n  docs.catalan = require('./function/combinatorics/catalan');\n  docs.composition = require('./function/combinatorics/composition');\n  docs.stirlingS2 = require('./function/combinatorics/stirlingS2'); // functions - core\n\n  docs['config'] = require('./core/config');\n  docs['import'] = require('./core/import');\n  docs['typed'] = require('./core/typed'); // functions - complex\n\n  docs.arg = require('./function/complex/arg');\n  docs.conj = require('./function/complex/conj');\n  docs.re = require('./function/complex/re');\n  docs.im = require('./function/complex/im'); // functions - expression\n\n  docs['eval'] = require('./function/expression/eval');\n  docs.help = require('./function/expression/help'); // functions - geometry\n\n  docs.distance = require('./function/geometry/distance');\n  docs.intersect = require('./function/geometry/intersect'); // functions - logical\n\n  docs['and'] = require('./function/logical/and');\n  docs['not'] = require('./function/logical/not');\n  docs['or'] = require('./function/logical/or');\n  docs['xor'] = require('./function/logical/xor'); // functions - matrix\n\n  docs['concat'] = require('./function/matrix/concat');\n  docs.cross = require('./function/matrix/cross');\n  docs.ctranspose = require('./function/matrix/ctranspose');\n  docs.det = require('./function/matrix/det');\n  docs.diag = require('./function/matrix/diag');\n  docs.dot = require('./function/matrix/dot');\n  docs.getMatrixDataType = require('./function/matrix/getMatrixDataType');\n  docs.identity = require('./function/matrix/identity');\n  docs.filter = require('./function/matrix/filter');\n  docs.flatten = require('./function/matrix/flatten');\n  docs.forEach = require('./function/matrix/forEach');\n  docs.inv = require('./function/matrix/inv');\n  docs.kron = require('./function/matrix/kron');\n  docs.map = require('./function/matrix/map');\n  docs.ones = require('./function/matrix/ones');\n  docs.partitionSelect = require('./function/matrix/partitionSelect');\n  docs.range = require('./function/matrix/range');\n  docs.resize = require('./function/matrix/resize');\n  docs.reshape = require('./function/matrix/reshape');\n  docs.size = require('./function/matrix/size');\n  docs.sort = require('./function/matrix/sort');\n  docs.squeeze = require('./function/matrix/squeeze');\n  docs.subset = require('./function/matrix/subset');\n  docs.trace = require('./function/matrix/trace');\n  docs.transpose = require('./function/matrix/transpose');\n  docs.zeros = require('./function/matrix/zeros'); // functions - probability\n\n  docs.combinations = require('./function/probability/combinations'); // docs.distribution = require('./function/probability/distribution')\n\n  docs.factorial = require('./function/probability/factorial');\n  docs.gamma = require('./function/probability/gamma');\n  docs.kldivergence = require('./function/probability/kldivergence');\n  docs.multinomial = require('./function/probability/multinomial');\n  docs.permutations = require('./function/probability/permutations');\n  docs.pickRandom = require('./function/probability/pickRandom');\n  docs.random = require('./function/probability/random');\n  docs.randomInt = require('./function/probability/randomInt'); // functions - relational\n\n  docs.compare = require('./function/relational/compare');\n  docs.compareNatural = require('./function/relational/compareNatural');\n  docs.compareText = require('./function/relational/compareText');\n  docs.deepEqual = require('./function/relational/deepEqual');\n  docs['equal'] = require('./function/relational/equal');\n  docs.equalText = require('./function/relational/equalText');\n  docs.larger = require('./function/relational/larger');\n  docs.largerEq = require('./function/relational/largerEq');\n  docs.smaller = require('./function/relational/smaller');\n  docs.smallerEq = require('./function/relational/smallerEq');\n  docs.unequal = require('./function/relational/unequal'); // functions - set\n\n  docs.setCartesian = require('./function/set/setCartesian');\n  docs.setDifference = require('./function/set/setDifference');\n  docs.setDistinct = require('./function/set/setDistinct');\n  docs.setIntersect = require('./function/set/setIntersect');\n  docs.setIsSubset = require('./function/set/setIsSubset');\n  docs.setMultiplicity = require('./function/set/setMultiplicity');\n  docs.setPowerset = require('./function/set/setPowerset');\n  docs.setSize = require('./function/set/setSize');\n  docs.setSymDifference = require('./function/set/setSymDifference');\n  docs.setUnion = require('./function/set/setUnion'); // functions - special\n\n  docs.erf = require('./function/special/erf'); // functions - statistics\n\n  docs.mad = require('./function/statistics/mad');\n  docs.max = require('./function/statistics/max');\n  docs.mean = require('./function/statistics/mean');\n  docs.median = require('./function/statistics/median');\n  docs.min = require('./function/statistics/min');\n  docs.mode = require('./function/statistics/mode');\n  docs.prod = require('./function/statistics/prod');\n  docs.quantileSeq = require('./function/statistics/quantileSeq');\n  docs.std = require('./function/statistics/std');\n  docs.sum = require('./function/statistics/sum');\n  docs['var'] = require('./function/statistics/var'); // functions - trigonometry\n\n  docs.acos = require('./function/trigonometry/acos');\n  docs.acosh = require('./function/trigonometry/acosh');\n  docs.acot = require('./function/trigonometry/acot');\n  docs.acoth = require('./function/trigonometry/acoth');\n  docs.acsc = require('./function/trigonometry/acsc');\n  docs.acsch = require('./function/trigonometry/acsch');\n  docs.asec = require('./function/trigonometry/asec');\n  docs.asech = require('./function/trigonometry/asech');\n  docs.asin = require('./function/trigonometry/asin');\n  docs.asinh = require('./function/trigonometry/asinh');\n  docs.atan = require('./function/trigonometry/atan');\n  docs.atanh = require('./function/trigonometry/atanh');\n  docs.atan2 = require('./function/trigonometry/atan2');\n  docs.cos = require('./function/trigonometry/cos');\n  docs.cosh = require('./function/trigonometry/cosh');\n  docs.cot = require('./function/trigonometry/cot');\n  docs.coth = require('./function/trigonometry/coth');\n  docs.csc = require('./function/trigonometry/csc');\n  docs.csch = require('./function/trigonometry/csch');\n  docs.sec = require('./function/trigonometry/sec');\n  docs.sech = require('./function/trigonometry/sech');\n  docs.sin = require('./function/trigonometry/sin');\n  docs.sinh = require('./function/trigonometry/sinh');\n  docs.tan = require('./function/trigonometry/tan');\n  docs.tanh = require('./function/trigonometry/tanh'); // functions - units\n\n  docs.to = require('./function/units/to'); // functions - utils\n\n  docs.clone = require('./function/utils/clone');\n  docs.format = require('./function/utils/format');\n  docs.isNaN = require('./function/utils/isNaN');\n  docs.isInteger = require('./function/utils/isInteger');\n  docs.isNegative = require('./function/utils/isNegative');\n  docs.isNumeric = require('./function/utils/isNumeric');\n  docs.hasNumericValue = require('./function/utils/hasNumericValue');\n  docs.isPositive = require('./function/utils/isPositive');\n  docs.isPrime = require('./function/utils/isPrime');\n  docs.isZero = require('./function/utils/isZero'); // docs.print = require('./function/utils/print') // TODO: add documentation for print as soon as the parser supports objects.\n\n  docs['typeof'] = require('./function/utils/typeof');\n  return docs;\n}\n\nexports.name = 'docs';\nexports.path = 'expression';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var parse = load(require('../parse'));\n  /**\n   * Parse and compile an expression.\n   * Returns a an object with a function `eval([scope])` to evaluate the\n   * compiled expression.\n   *\n   * Syntax:\n   *\n   *     math.compile(expr)                       // returns one node\n   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes\n   *\n   * Examples:\n   *\n   *     const code1 = math.compile('sqrt(3^2 + 4^2)')\n   *     code1.eval() // 5\n   *\n   *     let scope = {a: 3, b: 4}\n   *     const code2 = math.compile('a * b') // 12\n   *     code2.eval(scope) // 12\n   *     scope.a = 5\n   *     code2.eval(scope) // 20\n   *\n   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].eval() // 12\n   *\n   * See also:\n   *\n   *    parse, eval\n   *\n   * @param {string | string[] | Array | Matrix} expr\n   *            The expression to be compiled\n   * @return {{eval: Function} | Array.<{eval: Function}>} code\n   *            An object with the compiled expression\n   * @throws {Error}\n   */\n\n  return typed('compile', {\n    'string': function string(expr) {\n      return parse(expr).compile();\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile();\n      });\n    }\n  });\n}\n\nexports.name = 'compile';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var parse = load(require('../parse'));\n  /**\n   * Evaluate an expression.\n   *\n   * Note the evaluating arbitrary expressions may involve security risks,\n   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n   *\n   * Syntax:\n   *\n   *     math.eval(expr)\n   *     math.eval(expr, scope)\n   *     math.eval([expr1, expr2, expr3, ...])\n   *     math.eval([expr1, expr2, expr3, ...], scope)\n   *\n   * Example:\n   *\n   *     math.eval('(2+3)/4')                // 1.25\n   *     math.eval('sqrt(3^2 + 4^2)')        // 5\n   *     math.eval('sqrt(-4)')               // 2i\n   *     math.eval(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]\n   *\n   *     let scope = {a:3, b:4}\n   *     math.eval('a * b', scope)           // 12\n   *\n   * See also:\n   *\n   *    parse, compile\n   *\n   * @param {string | string[] | Matrix} expr   The expression to be evaluated\n   * @param {Object} [scope]                    Scope to read/write variables\n   * @return {*} The result of the expression\n   * @throws {Error}\n   */\n\n  return typed('compile', {\n    'string': function string(expr) {\n      var scope = {};\n      return parse(expr).compile().eval(scope);\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return parse(expr).compile().eval(scope);\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      var scope = {};\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().eval(scope);\n      });\n    },\n    'Array | Matrix, Object': function ArrayMatrixObject(expr, scope) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().eval(scope);\n      });\n    }\n  });\n}\n\nexports.name = 'eval';\nexports.factory = factory;","'use strict';\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nfunction factory(type, config, load, typed, math) {\n  var docs = load(require('../embeddedDocs'));\n  /**\n   * Retrieve help on a function or data type.\n   * Help files are retrieved from the documentation in math.expression.docs.\n   *\n   * Syntax:\n   *\n   *    math.help(search)\n   *\n   * Examples:\n   *\n   *    console.log(math.help('sin').toString())\n   *    console.log(math.help(math.add).toString())\n   *    console.log(math.help(math.add).toJSON())\n   *\n   * @param {Function | string | Object} search   A function or function name\n   *                                              for which to get help\n   * @return {Help} A help object\n   */\n\n  return typed('help', {\n    'any': function any(search) {\n      var prop;\n      var name = search;\n\n      if (typeof search !== 'string') {\n        for (prop in math) {\n          // search in functions and constants\n          if (math.hasOwnProperty(prop) && search === math[prop]) {\n            name = prop;\n            break;\n          }\n        }\n        /* TODO: implement help for data types\n         if (!text) {\n         // search data type\n         for (prop in math.type) {\n         if (math.type.hasOwnProperty(prop)) {\n         if (search === math.type[prop]) {\n         text = prop\n         break\n         }\n         }\n         }\n         }\n         */\n\n      }\n\n      var doc = getSafeProperty(docs, name);\n\n      if (!doc) {\n        throw new Error('No documentation found on \"' + name + '\"');\n      }\n\n      return new type.Help(doc);\n    }\n  });\n}\n\nexports.math = true; // request access to the math namespace as 5th argument of the factory function\n\nexports.name = 'help';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./compile'), require('./eval'), require('./help'), require('./parse'), require('./parser')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var parse = load(require('../parse'));\n  /**\n   * Parse an expression. Returns a node tree, which can be evaluated by\n   * invoking node.eval().\n   *\n   * Note the evaluating arbitrary expressions may involve security risks,\n   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n   *\n   * Syntax:\n   *\n   *     math.parse(expr)\n   *     math.parse(expr, options)\n   *     math.parse([expr1, expr2, expr3, ...])\n   *     math.parse([expr1, expr2, expr3, ...], options)\n   *\n   * Example:\n   *\n   *     const node1 = math.parse('sqrt(3^2 + 4^2)')\n   *     node1.compile().eval() // 5\n   *\n   *     let scope = {a:3, b:4}\n   *     const node2 = math.parse('a * b') // 12\n   *     const code2 = node2.compile()\n   *     code2.eval(scope) // 12\n   *     scope.a = 5\n   *     code2.eval(scope) // 20\n   *\n   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].compile().eval() // 12\n   *\n   * See also:\n   *\n   *     eval, compile\n   *\n   * @param {string | string[] | Matrix} expr          Expression to be parsed\n   * @param {{nodes: Object<string, Node>}} [options]  Available options:\n   *                                                   - `nodes` a set of custom nodes\n   * @return {Node | Node[]} node\n   * @throws {Error}\n   */\n\n  return typed('parse', {\n    'string | Array | Matrix': parse,\n    'string | Array | Matrix, Object': parse\n  });\n}\n\nexports.name = 'parse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed, math) {\n  var Parser = load(require('../Parser'));\n  /**\n   * Create a parser. The function creates a new `math.expression.Parser` object.\n   *\n   * Syntax:\n   *\n   *    math.parser()\n   *\n   * Examples:\n   *\n   *     const parser = new math.parser()\n   *\n   *     // evaluate expressions\n   *     const a = parser.eval('sqrt(3^2 + 4^2)') // 5\n   *     const b = parser.eval('sqrt(-4)')        // 2i\n   *     const c = parser.eval('2 inch in cm')    // 5.08 cm\n   *     const d = parser.eval('cos(45 deg)')     // 0.7071067811865476\n   *\n   *     // define variables and functions\n   *     parser.eval('x = 7 / 2')                 // 3.5\n   *     parser.eval('x + 3')                     // 6.5\n   *     parser.eval('function f(x, y) = x^y')    // f(x, y)\n   *     parser.eval('f(2, 3)')                   // 8\n   *\n   *     // get and set variables and functions\n   *     const x = parser.get('x')                // 7\n   *     const f = parser.get('f')                // function\n   *     const g = f(3, 2)                        // 9\n   *     parser.set('h', 500)\n   *     const i = parser.eval('h / 2')           // 250\n   *     parser.set('hello', function (name) {\n   *       return 'hello, ' + name + '!'\n   *     })\n   *     parser.eval('hello(\"user\")')           // \"hello, user!\"\n   *\n   *     // clear defined functions and variables\n   *     parser.clear()\n   *\n   * See also:\n   *\n   *    eval, compile, parse\n   *\n   * @return {Parser} Parser\n   */\n\n  return typed('parser', {\n    '': function _() {\n      return new Parser(math);\n    }\n  });\n}\n\nexports.name = 'parser';\nexports.factory = factory;\nexports.math = true; // requires the math namespace as 5th argument","'use strict';\n\nmodule.exports = [// Note that the docs folder is called \"embeddedDocs\" and not \"docs\" to prevent issues\n// with yarn autoclean. See https://github.com/josdejong/mathjs/issues/969\nrequire('./embeddedDocs'), require('./function'), require('./node'), require('./transform'), require('./Help'), require('./parse'), require('./Parser')];","'use strict'; // Reserved keywords not allowed to use in the parser\n\nmodule.exports = {\n  end: true\n};","'use strict';\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  var access = load(require('./utils/access'));\n  /**\n   * @constructor AccessorNode\n   * @extends {Node}\n   * Access an object property or get a matrix subset\n   *\n   * @param {Node} object                 The object from which to retrieve\n   *                                      a property or subset.\n   * @param {IndexNode} index             IndexNode containing ranges\n   */\n\n  function AccessorNode(object, index) {\n    if (!(this instanceof AccessorNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (!type.isNode(object)) {\n      throw new TypeError('Node expected for parameter \"object\"');\n    }\n\n    if (!type.isIndexNode(index)) {\n      throw new TypeError('IndexNode expected for parameter \"index\"');\n    }\n\n    this.object = object || null;\n    this.index = index; // readonly property name\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  AccessorNode.prototype = new Node();\n  AccessorNode.prototype.type = 'AccessorNode';\n  AccessorNode.prototype.isAccessorNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  AccessorNode.prototype._compile = function (math, argNames) {\n    var evalObject = this.object._compile(math, argNames);\n\n    var evalIndex = this.index._compile(math, argNames);\n\n    if (this.index.isObjectProperty()) {\n      var prop = this.index.getObjectProperty();\n      return function evalAccessorNode(scope, args, context) {\n        return getSafeProperty(evalObject(scope, args, context), prop);\n      };\n    } else {\n      return function evalAccessorNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        var index = evalIndex(scope, args, object); // we pass object here instead of context\n\n        return access(object, index);\n      };\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  AccessorNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this);\n    callback(this.index, 'index', this);\n  };\n  /**\n   * Create a new AccessorNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {AccessorNode} Returns a transformed copy of the node\n   */\n\n\n  AccessorNode.prototype.map = function (callback) {\n    return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AccessorNode}\n   */\n\n\n  AccessorNode.prototype.clone = function () {\n    return new AccessorNode(this.object, this.index);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype._toString = function (options) {\n    var object = this.object.toString(options);\n\n    if (needParenthesis(this.object)) {\n      object = '(' + object + ')';\n    }\n\n    return object + this.index.toString(options);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype.toHTML = function (options) {\n    var object = this.object.toHTML(options);\n\n    if (needParenthesis(this.object)) {\n      object = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + object + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    return object + this.index.toHTML(options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AccessorNode.prototype._toTex = function (options) {\n    var object = this.object.toTex(options);\n\n    if (needParenthesis(this.object)) {\n      object = \"\\\\left(' + object + '\\\\right)\";\n    }\n\n    return object + this.index.toTex(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  AccessorNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'AccessorNode',\n      object: this.object,\n      index: this.index\n    };\n  };\n  /**\n   * Instantiate an AccessorNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n   *                       where mathjs is optional\n   * @returns {AccessorNode}\n   */\n\n\n  AccessorNode.fromJSON = function (json) {\n    return new AccessorNode(json.object, json.index);\n  };\n  /**\n   * Are parenthesis needed?\n   * @private\n   */\n\n\n  function needParenthesis(node) {\n    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n    return !(type.isAccessorNode(node) || type.isArrayNode(node) || type.isConstantNode(node) || type.isFunctionNode(node) || type.isObjectNode(node) || type.isParenthesisNode(node) || type.isSymbolNode(node));\n  }\n\n  return AccessorNode;\n}\n\nexports.name = 'AccessorNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar map = require('../../utils/array').map;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  /**\n   * @constructor ArrayNode\n   * @extends {Node}\n   * Holds an 1-dimensional array with items\n   * @param {Node[]} [items]   1 dimensional array with items\n   */\n\n  function ArrayNode(items) {\n    if (!(this instanceof ArrayNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this.items = items || []; // validate input\n\n    if (!Array.isArray(this.items) || !this.items.every(type.isNode)) {\n      throw new TypeError('Array containing Nodes expected');\n    } // TODO: deprecated since v3, remove some day\n\n\n    var deprecated = function deprecated() {\n      throw new Error('Property `ArrayNode.nodes` is deprecated, use `ArrayNode.items` instead');\n    };\n\n    Object.defineProperty(this, 'nodes', {\n      get: deprecated,\n      set: deprecated\n    });\n  }\n\n  ArrayNode.prototype = new Node();\n  ArrayNode.prototype.type = 'ArrayNode';\n  ArrayNode.prototype.isArrayNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  ArrayNode.prototype._compile = function (math, argNames) {\n    var evalItems = map(this.items, function (item) {\n      return item._compile(math, argNames);\n    });\n    var asMatrix = math.config().matrix !== 'Array';\n\n    if (asMatrix) {\n      var matrix = math.matrix;\n      return function evalArrayNode(scope, args, context) {\n        return matrix(map(evalItems, function (evalItem) {\n          return evalItem(scope, args, context);\n        }));\n      };\n    } else {\n      return function evalArrayNode(scope, args, context) {\n        return map(evalItems, function (evalItem) {\n          return evalItem(scope, args, context);\n        });\n      };\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ArrayNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.items.length; i++) {\n      var node = this.items[i];\n      callback(node, 'items[' + i + ']', this);\n    }\n  };\n  /**\n   * Create a new ArrayNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {ArrayNode} Returns a transformed copy of the node\n   */\n\n\n  ArrayNode.prototype.map = function (callback) {\n    var items = [];\n\n    for (var i = 0; i < this.items.length; i++) {\n      items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n    }\n\n    return new ArrayNode(items);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ArrayNode}\n   */\n\n\n  ArrayNode.prototype.clone = function () {\n    return new ArrayNode(this.items.slice(0));\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ArrayNode.prototype._toString = function (options) {\n    var items = this.items.map(function (node) {\n      return node.toString(options);\n    });\n    return '[' + items.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ArrayNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ArrayNode',\n      items: this.items\n    };\n  };\n  /**\n   * Instantiate an ArrayNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ArrayNode\", items: [...]}`,\n   *                       where mathjs is optional\n   * @returns {ArrayNode}\n   */\n\n\n  ArrayNode.fromJSON = function (json) {\n    return new ArrayNode(json.items);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ArrayNode.prototype.toHTML = function (options) {\n    var items = this.items.map(function (node) {\n      return node.toHTML(options);\n    });\n    return '<span class=\"math-parenthesis math-square-parenthesis\">[</span>' + items.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-square-parenthesis\">]</span>';\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ArrayNode.prototype._toTex = function (options) {\n    var s = '\\\\begin{bmatrix}';\n    this.items.forEach(function (node) {\n      if (node.items) {\n        s += node.items.map(function (childNode) {\n          return childNode.toTex(options);\n        }).join('&');\n      } else {\n        s += node.toTex(options);\n      } // new line\n\n\n      s += '\\\\\\\\';\n    });\n    s += '\\\\end{bmatrix}';\n    return s;\n  };\n\n  return ArrayNode;\n}\n\nexports.name = 'ArrayNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nvar setSafeProperty = require('../../utils/customs').setSafeProperty;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  var assign = load(require('./utils/assign'));\n  var access = load(require('./utils/access'));\n\n  var operators = require('../operators');\n  /**\n   * @constructor AssignmentNode\n   * @extends {Node}\n   *\n   * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or\n   * replace a subset of a matrix like `A[2,2]=42`.\n   *\n   * Syntax:\n   *\n   *     new AssignmentNode(symbol, value)\n   *     new AssignmentNode(object, index, value)\n   *\n   * Usage:\n   *\n   *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))                       // a=2\n   *    new AssignmentNode(new SymbolNode('a'), new IndexNode('b'), new ConstantNode(2))   // a.b=2\n   *    new AssignmentNode(new SymbolNode('a'), new IndexNode(1, 2), new ConstantNode(3))  // a[1,2]=3\n   *\n   * @param {SymbolNode | AccessorNode} object  Object on which to assign a value\n   * @param {IndexNode} [index=null]            Index, property name or matrix\n   *                                            index. Optional. If not provided\n   *                                            and `object` is a SymbolNode,\n   *                                            the property is assigned to the\n   *                                            global scope.\n   * @param {Node} value                        The value to be assigned\n   */\n\n\n  function AssignmentNode(object, index, value) {\n    if (!(this instanceof AssignmentNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this.object = object;\n    this.index = value ? index : null;\n    this.value = value || index; // validate input\n\n    if (!type.isSymbolNode(object) && !type.isAccessorNode(object)) {\n      throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n    }\n\n    if (type.isSymbolNode(object) && object.name === 'end') {\n      throw new Error('Cannot assign to symbol \"end\"');\n    }\n\n    if (this.index && !type.isIndexNode(this.index)) {\n      // index is optional\n      throw new TypeError('IndexNode expected as \"index\"');\n    }\n\n    if (!type.isNode(this.value)) {\n      throw new TypeError('Node expected as \"value\"');\n    } // readonly property name\n\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    });\n  }\n\n  AssignmentNode.prototype = new Node();\n  AssignmentNode.prototype.type = 'AssignmentNode';\n  AssignmentNode.prototype.isAssignmentNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  AssignmentNode.prototype._compile = function (math, argNames) {\n    var evalObject = this.object._compile(math, argNames);\n\n    var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n\n    var evalValue = this.value._compile(math, argNames);\n\n    var name = this.object.name;\n\n    if (!this.index) {\n      // apply a variable to the scope, for example `a=2`\n      if (!type.isSymbolNode(this.object)) {\n        throw new TypeError('SymbolNode expected as object');\n      }\n\n      return function evalAssignmentNode(scope, args, context) {\n        return setSafeProperty(scope, name, evalValue(scope, args, context));\n      };\n    } else if (this.index.isObjectProperty()) {\n      // apply an object property for example `a.b=2`\n      var prop = this.index.getObjectProperty();\n      return function evalAssignmentNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        var value = evalValue(scope, args, context);\n        return setSafeProperty(object, prop, value);\n      };\n    } else if (type.isSymbolNode(this.object)) {\n      // update a matrix subset, for example `a[2]=3`\n      return function evalAssignmentNode(scope, args, context) {\n        var childObject = evalObject(scope, args, context);\n        var value = evalValue(scope, args, context);\n        var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context\n\n        setSafeProperty(scope, name, assign(childObject, index, value));\n        return value;\n      };\n    } else {\n      // type.isAccessorNode(node.object) === true\n      // update a matrix subset, for example `a.b[2]=3`\n      // we will not use the compile function of the AccessorNode, but compile it\n      // ourselves here as we need the parent object of the AccessorNode:\n      // wee need to apply the updated object to parent object\n      var evalParentObject = this.object.object._compile(math, argNames);\n\n      if (this.object.index.isObjectProperty()) {\n        var parentProp = this.object.index.getObjectProperty();\n        return function evalAssignmentNode(scope, args, context) {\n          var parent = evalParentObject(scope, args, context);\n          var childObject = getSafeProperty(parent, parentProp);\n          var index = evalIndex(scope, args, childObject); // Important: we pass childObject instead of context\n\n          var value = evalValue(scope, args, context);\n          setSafeProperty(parent, parentProp, assign(childObject, index, value));\n          return value;\n        };\n      } else {\n        // if some parameters use the 'end' parameter, we need to calculate the size\n        var evalParentIndex = this.object.index._compile(math, argNames);\n\n        return function evalAssignmentNode(scope, args, context) {\n          var parent = evalParentObject(scope, args, context);\n          var parentIndex = evalParentIndex(scope, args, parent); // Important: we pass parent instead of context\n\n          var childObject = access(parent, parentIndex);\n          var index = evalIndex(scope, args, childObject); // Important:  we pass childObject instead of context\n\n          var value = evalValue(scope, args, context);\n          assign(parent, parentIndex, assign(childObject, index, value));\n          return value;\n        };\n      }\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  AssignmentNode.prototype.forEach = function (callback) {\n    callback(this.object, 'object', this);\n\n    if (this.index) {\n      callback(this.index, 'index', this);\n    }\n\n    callback(this.value, 'value', this);\n  };\n  /**\n   * Create a new AssignmentNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {AssignmentNode} Returns a transformed copy of the node\n   */\n\n\n  AssignmentNode.prototype.map = function (callback) {\n    var object = this._ifNode(callback(this.object, 'object', this));\n\n    var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n\n    var value = this._ifNode(callback(this.value, 'value', this));\n\n    return new AssignmentNode(object, index, value);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {AssignmentNode}\n   */\n\n\n  AssignmentNode.prototype.clone = function () {\n    return new AssignmentNode(this.object, this.index, this.value);\n  };\n  /*\n   * Is parenthesis needed?\n   * @param {node} node\n   * @param {string} [parenthesis='keep']\n   * @private\n   */\n\n\n  function needParenthesis(node, parenthesis) {\n    if (!parenthesis) {\n      parenthesis = 'keep';\n    }\n\n    var precedence = operators.getPrecedence(node, parenthesis);\n    var exprPrecedence = operators.getPrecedence(node.value, parenthesis);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype._toString = function (options) {\n    var object = this.object.toString(options);\n    var index = this.index ? this.index.toString(options) : '';\n    var value = this.value.toString(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = '(' + value + ')';\n    }\n\n    return object + index + ' = ' + value;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  AssignmentNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'AssignmentNode',\n      object: this.object,\n      index: this.index,\n      value: this.value\n    };\n  };\n  /**\n   * Instantiate an AssignmentNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n   *                       where mathjs is optional\n   * @returns {AssignmentNode}\n   */\n\n\n  AssignmentNode.fromJSON = function (json) {\n    return new AssignmentNode(json.object, json.index, json.value);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype.toHTML = function (options) {\n    var object = this.object.toHTML(options);\n    var index = this.index ? this.index.toHTML(options) : '';\n    var value = this.value.toHTML(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = '<span class=\"math-paranthesis math-round-parenthesis\">(</span>' + value + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>';\n    }\n\n    return object + index + '<span class=\"math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator\">=</span>' + value;\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string}\n   */\n\n\n  AssignmentNode.prototype._toTex = function (options) {\n    var object = this.object.toTex(options);\n    var index = this.index ? this.index.toTex(options) : '';\n    var value = this.value.toTex(options);\n\n    if (needParenthesis(this, options && options.parenthesis)) {\n      value = \"\\\\left(\".concat(value, \"\\\\right)\");\n    }\n\n    return object + index + ':=' + value;\n  };\n\n  return AssignmentNode;\n}\n\nexports.name = 'AssignmentNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar forEach = require('../../utils/array').forEach;\n\nvar map = require('../../utils/array').map;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  var ResultSet = load(require('../../type/resultset/ResultSet'));\n  /**\n   * @constructor BlockNode\n   * @extends {Node}\n   * Holds a set with blocks\n   * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks\n   *            An array with blocks, where a block is constructed as an Object\n   *            with properties block, which is a Node, and visible, which is\n   *            a boolean. The property visible is optional and is true by default\n   */\n\n  function BlockNode(blocks) {\n    if (!(this instanceof BlockNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input, copy blocks\n\n\n    if (!Array.isArray(blocks)) throw new Error('Array expected');\n    this.blocks = blocks.map(function (block) {\n      var node = block && block.node;\n      var visible = block && block.visible !== undefined ? block.visible : true;\n      if (!type.isNode(node)) throw new TypeError('Property \"node\" must be a Node');\n      if (typeof visible !== 'boolean') throw new TypeError('Property \"visible\" must be a boolean');\n      return {\n        node: node,\n        visible: visible\n      };\n    });\n  }\n\n  BlockNode.prototype = new Node();\n  BlockNode.prototype.type = 'BlockNode';\n  BlockNode.prototype.isBlockNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  BlockNode.prototype._compile = function (math, argNames) {\n    var evalBlocks = map(this.blocks, function (block) {\n      return {\n        eval: block.node._compile(math, argNames),\n        visible: block.visible\n      };\n    });\n    return function evalBlockNodes(scope, args, context) {\n      var results = [];\n      forEach(evalBlocks, function evalBlockNode(block) {\n        var result = block.eval(scope, args, context);\n\n        if (block.visible) {\n          results.push(result);\n        }\n      });\n      return new ResultSet(results);\n    };\n  };\n  /**\n   * Execute a callback for each of the child blocks of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  BlockNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.blocks.length; i++) {\n      callback(this.blocks[i].node, 'blocks[' + i + '].node', this);\n    }\n  };\n  /**\n   * Create a new BlockNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {BlockNode} Returns a transformed copy of the node\n   */\n\n\n  BlockNode.prototype.map = function (callback) {\n    var blocks = [];\n\n    for (var i = 0; i < this.blocks.length; i++) {\n      var block = this.blocks[i];\n\n      var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n\n      blocks[i] = {\n        node: node,\n        visible: block.visible\n      };\n    }\n\n    return new BlockNode(blocks);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {BlockNode}\n   */\n\n\n  BlockNode.prototype.clone = function () {\n    var blocks = this.blocks.map(function (block) {\n      return {\n        node: block.node,\n        visible: block.visible\n      };\n    });\n    return new BlockNode(blocks);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  BlockNode.prototype._toString = function (options) {\n    return this.blocks.map(function (param) {\n      return param.node.toString(options) + (param.visible ? '' : ';');\n    }).join('\\n');\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  BlockNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'BlockNode',\n      blocks: this.blocks\n    };\n  };\n  /**\n   * Instantiate an BlockNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n   *                       where mathjs is optional\n   * @returns {BlockNode}\n   */\n\n\n  BlockNode.fromJSON = function (json) {\n    return new BlockNode(json.blocks);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  BlockNode.prototype.toHTML = function (options) {\n    return this.blocks.map(function (param) {\n      return param.node.toHTML(options) + (param.visible ? '' : '<span class=\"math-separator\">;</span>');\n    }).join('<span class=\"math-separator\"><br /></span>');\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  BlockNode.prototype._toTex = function (options) {\n    return this.blocks.map(function (param) {\n      return param.node.toTex(options) + (param.visible ? '' : ';');\n    }).join('\\\\;\\\\;\\n');\n  };\n\n  return BlockNode;\n}\n\nexports.name = 'BlockNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar operators = require('../operators');\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  var mathTypeOf = load(require('../../function/utils/typeof'));\n  /**\n   * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'\n   *\n   * @param {Node} condition   Condition, must result in a boolean\n   * @param {Node} trueExpr    Expression evaluated when condition is true\n   * @param {Node} falseExpr   Expression evaluated when condition is true\n   *\n   * @constructor ConditionalNode\n   * @extends {Node}\n   */\n\n  function ConditionalNode(condition, trueExpr, falseExpr) {\n    if (!(this instanceof ConditionalNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (!type.isNode(condition)) throw new TypeError('Parameter condition must be a Node');\n    if (!type.isNode(trueExpr)) throw new TypeError('Parameter trueExpr must be a Node');\n    if (!type.isNode(falseExpr)) throw new TypeError('Parameter falseExpr must be a Node');\n    this.condition = condition;\n    this.trueExpr = trueExpr;\n    this.falseExpr = falseExpr;\n  }\n\n  ConditionalNode.prototype = new Node();\n  ConditionalNode.prototype.type = 'ConditionalNode';\n  ConditionalNode.prototype.isConditionalNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  ConditionalNode.prototype._compile = function (math, argNames) {\n    var evalCondition = this.condition._compile(math, argNames);\n\n    var evalTrueExpr = this.trueExpr._compile(math, argNames);\n\n    var evalFalseExpr = this.falseExpr._compile(math, argNames);\n\n    return function evalConditionalNode(scope, args, context) {\n      return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);\n    };\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ConditionalNode.prototype.forEach = function (callback) {\n    callback(this.condition, 'condition', this);\n    callback(this.trueExpr, 'trueExpr', this);\n    callback(this.falseExpr, 'falseExpr', this);\n  };\n  /**\n   * Create a new ConditionalNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {ConditionalNode} Returns a transformed copy of the node\n   */\n\n\n  ConditionalNode.prototype.map = function (callback) {\n    return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConditionalNode}\n   */\n\n\n  ConditionalNode.prototype.clone = function () {\n    return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = operators.getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode\n    // or have lower or equal precedence\n    // NOTE: enclosing all OperatorNodes in parentheses is a decision\n    // purely based on aesthetics and readability\n\n    var condition = this.condition.toString(options);\n    var conditionPrecedence = operators.getPrecedence(this.condition, parenthesis);\n\n    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n      condition = '(' + condition + ')';\n    }\n\n    var trueExpr = this.trueExpr.toString(options);\n    var truePrecedence = operators.getPrecedence(this.trueExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n      trueExpr = '(' + trueExpr + ')';\n    }\n\n    var falseExpr = this.falseExpr.toString(options);\n    var falsePrecedence = operators.getPrecedence(this.falseExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n      falseExpr = '(' + falseExpr + ')';\n    }\n\n    return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ConditionalNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ConditionalNode',\n      condition: this.condition,\n      trueExpr: this.trueExpr,\n      falseExpr: this.falseExpr\n    };\n  };\n  /**\n   * Instantiate an ConditionalNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ConditionalNode\", \"condition\": ..., \"trueExpr\": ..., \"falseExpr\": ...}`,\n   *                       where mathjs is optional\n   * @returns {ConditionalNode}\n   */\n\n\n  ConditionalNode.fromJSON = function (json) {\n    return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = operators.getPrecedence(this, parenthesis); // Enclose Arguments in parentheses if they are an OperatorNode\n    // or have lower or equal precedence\n    // NOTE: enclosing all OperatorNodes in parentheses is a decision\n    // purely based on aesthetics and readability\n\n    var condition = this.condition.toHTML(options);\n    var conditionPrecedence = operators.getPrecedence(this.condition, parenthesis);\n\n    if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n      condition = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + condition + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    var trueExpr = this.trueExpr.toHTML(options);\n    var truePrecedence = operators.getPrecedence(this.trueExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n      trueExpr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + trueExpr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    var falseExpr = this.falseExpr.toHTML(options);\n    var falsePrecedence = operators.getPrecedence(this.falseExpr, parenthesis);\n\n    if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n      falseExpr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + falseExpr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    return condition + '<span class=\"math-operator math-conditional-operator\">?</span>' + trueExpr + '<span class=\"math-operator math-conditional-operator\">:</span>' + falseExpr;\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConditionalNode.prototype._toTex = function (options) {\n    return '\\\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\\\quad{\\\\text{if }\\\\;' + this.condition.toTex(options) + '}\\\\\\\\{' + this.falseExpr.toTex(options) + '}, &\\\\quad{\\\\text{otherwise}}\\\\end{cases}';\n  };\n  /**\n   * Test whether a condition is met\n   * @param {*} condition\n   * @returns {boolean} true if condition is true or non-zero, else false\n   */\n\n\n  function testCondition(condition) {\n    if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {\n      return !!condition;\n    }\n\n    if (condition) {\n      if (type.isBigNumber(condition)) {\n        return !condition.isZero();\n      }\n\n      if (type.isComplex(condition)) {\n        return !!(condition.re || condition.im);\n      }\n\n      if (type.isUnit(condition)) {\n        return !!condition.value;\n      }\n    }\n\n    if (condition === null || condition === undefined) {\n      return false;\n    }\n\n    throw new TypeError('Unsupported type of condition \"' + mathTypeOf(condition) + '\"');\n  }\n\n  return ConditionalNode;\n}\n\nexports.name = 'ConditionalNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar format = require('../../utils/string').format;\n\nvar escapeLatex = require('../../utils/latex').escape;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  var getType = load(require('../../function/utils/typeof'));\n  /**\n   * A ConstantNode holds a constant value like a number or string.\n   *\n   * Usage:\n   *\n   *     new ConstantNode(2.3)\n   *     new ConstantNode('hello')\n   *\n   * @param {*} value    Value can be any type (number, BigNumber, string, ...)\n   * @constructor ConstantNode\n   * @extends {Node}\n   */\n\n  function ConstantNode(value) {\n    if (!(this instanceof ConstantNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (arguments.length === 2) {\n      // TODO: remove deprecation error some day (created 2018-01-23)\n      throw new SyntaxError('new ConstantNode(valueStr, valueType) is not supported anymore since math v4.0.0. Use new ConstantNode(value) instead, where value is a non-stringified value.');\n    }\n\n    this.value = value;\n  }\n\n  ConstantNode.prototype = new Node();\n  ConstantNode.prototype.type = 'ConstantNode';\n  ConstantNode.prototype.isConstantNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  ConstantNode.prototype._compile = function (math, argNames) {\n    var value = this.value;\n    return function evalConstantNode() {\n      return value;\n    };\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ConstantNode.prototype.forEach = function (callback) {} // nothing to do, we don't have childs\n\n  /**\n   * Create a new ConstantNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node) : Node} callback\n   * @returns {ConstantNode} Returns a clone of the node\n   */\n  ;\n\n  ConstantNode.prototype.map = function (callback) {\n    return this.clone();\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ConstantNode}\n   */\n\n\n  ConstantNode.prototype.clone = function () {\n    return new ConstantNode(this.value);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype._toString = function (options) {\n    return format(this.value, options);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype.toHTML = function (options) {\n    var value = this._toString(options);\n\n    switch (getType(this.value)) {\n      case 'number':\n      case 'BigNumber':\n      case 'Fraction':\n        return '<span class=\"math-number\">' + value + '</span>';\n\n      case 'string':\n        return '<span class=\"math-string\">' + value + '</span>';\n\n      case 'boolean':\n        return '<span class=\"math-boolean\">' + value + '</span>';\n\n      case 'null':\n        return '<span class=\"math-null-symbol\">' + value + '</span>';\n\n      case 'undefined':\n        return '<span class=\"math-undefined\">' + value + '</span>';\n\n      default:\n        return '<span class=\"math-symbol\">' + value + '</span>';\n    }\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ConstantNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ConstantNode',\n      value: this.value\n    };\n  };\n  /**\n   * Instantiate a ConstantNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SymbolNode\", value: 2.3}`,\n   *                       where mathjs is optional\n   * @returns {ConstantNode}\n   */\n\n\n  ConstantNode.fromJSON = function (json) {\n    return new ConstantNode(json.value);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ConstantNode.prototype._toTex = function (options) {\n    var value = this._toString(options);\n\n    switch (getType(this.value)) {\n      case 'string':\n        return '\\\\mathtt{' + escapeLatex(value) + '}';\n\n      case 'number':\n      case 'BigNumber':\n        var index = value.toLowerCase().indexOf('e');\n\n        if (index !== -1) {\n          return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n        }\n\n        return value;\n\n      case 'Fraction':\n        return this.value.toLatex();\n\n      default:\n        return value;\n    }\n  };\n\n  return ConstantNode;\n}\n\nexports.name = 'ConstantNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar keywords = require('../keywords');\n\nvar escape = require('../../utils/string').escape;\n\nvar forEach = require('../../utils/array').forEach;\n\nvar join = require('../../utils/array').join;\n\nvar latex = require('../../utils/latex');\n\nvar operators = require('../operators');\n\nvar setSafeProperty = require('../../utils/customs').setSafeProperty;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  /**\n   * @constructor FunctionAssignmentNode\n   * @extends {Node}\n   * Function assignment\n   *\n   * @param {string} name           Function name\n   * @param {string[] | Array.<{name: string, type: string}>} params\n   *                                Array with function parameter names, or an\n   *                                array with objects containing the name\n   *                                and type of the parameter\n   * @param {Node} expr             The function expression\n   */\n\n  function FunctionAssignmentNode(name, params, expr) {\n    if (!(this instanceof FunctionAssignmentNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"');\n    if (!Array.isArray(params)) throw new TypeError('Array containing strings or objects expected for parameter \"params\"');\n    if (!type.isNode(expr)) throw new TypeError('Node expected for parameter \"expr\"');\n    if (name in keywords) throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\n    this.name = name;\n    this.params = params.map(function (param) {\n      return param && param.name || param;\n    });\n    this.types = params.map(function (param) {\n      return param && param.type || 'any';\n    });\n    this.expr = expr;\n  }\n\n  FunctionAssignmentNode.prototype = new Node();\n  FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode';\n  FunctionAssignmentNode.prototype.isFunctionAssignmentNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  FunctionAssignmentNode.prototype._compile = function (math, argNames) {\n    var childArgNames = Object.create(argNames);\n    forEach(this.params, function (param) {\n      childArgNames[param] = true;\n    }); // compile the function expression with the child args\n\n    var evalExpr = this.expr._compile(math, childArgNames);\n\n    var name = this.name;\n    var params = this.params;\n    var signature = join(this.types, ',');\n    var syntax = name + '(' + join(this.params, ', ') + ')';\n    return function evalFunctionAssignmentNode(scope, args, context) {\n      var signatures = {};\n\n      signatures[signature] = function () {\n        var childArgs = Object.create(args);\n\n        for (var i = 0; i < params.length; i++) {\n          childArgs[params[i]] = arguments[i];\n        }\n\n        return evalExpr(scope, childArgs, context);\n      };\n\n      var fn = typed(name, signatures);\n      fn.syntax = syntax;\n      setSafeProperty(scope, name, fn);\n      return fn;\n    };\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  FunctionAssignmentNode.prototype.forEach = function (callback) {\n    callback(this.expr, 'expr', this);\n  };\n  /**\n   * Create a new FunctionAssignmentNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {FunctionAssignmentNode} Returns a transformed copy of the node\n   */\n\n\n  FunctionAssignmentNode.prototype.map = function (callback) {\n    var expr = this._ifNode(callback(this.expr, 'expr', this));\n\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionAssignmentNode}\n   */\n\n\n  FunctionAssignmentNode.prototype.clone = function () {\n    return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n  };\n  /**\n   * Is parenthesis needed?\n   * @param {Node} node\n   * @param {Object} parenthesis\n   * @private\n   */\n\n\n  function needParenthesis(node, parenthesis) {\n    var precedence = operators.getPrecedence(node, parenthesis);\n    var exprPrecedence = operators.getPrecedence(node.expr, parenthesis);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  /**\n   * get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var expr = this.expr.toString(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = '(' + expr + ')';\n    }\n\n    return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  FunctionAssignmentNode.prototype.toJSON = function () {\n    var types = this.types;\n    return {\n      mathjs: 'FunctionAssignmentNode',\n      name: this.name,\n      params: this.params.map(function (param, index) {\n        return {\n          name: param,\n          type: types[index]\n        };\n      }),\n      expr: this.expr\n    };\n  };\n  /**\n   * Instantiate an FunctionAssignmentNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"FunctionAssignmentNode\", name: ..., params: ..., expr: ...}`,\n   *                       where mathjs is optional\n   * @returns {FunctionAssignmentNode}\n   */\n\n\n  FunctionAssignmentNode.fromJSON = function (json) {\n    return new FunctionAssignmentNode(json.name, json.params, json.expr);\n  };\n  /**\n   * get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var params = [];\n\n    for (var i = 0; i < this.params.length; i++) {\n      params.push('<span class=\"math-symbol math-parameter\">' + escape(this.params[i]) + '</span>');\n    }\n\n    var expr = this.expr.toHTML(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + expr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    return '<span class=\"math-function\">' + escape(this.name) + '</span>' + '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + params.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-round-parenthesis\">)</span><span class=\"math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator\">=</span>' + expr;\n  };\n  /**\n   * get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionAssignmentNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var expr = this.expr.toTex(options);\n\n    if (needParenthesis(this, parenthesis)) {\n      expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n    }\n\n    return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(latex.toSymbol).join(',') + '\\\\right):=' + expr;\n  };\n\n  return FunctionAssignmentNode;\n}\n\nexports.name = 'FunctionAssignmentNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\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\nvar latex = require('../../utils/latex');\n\nvar escape = require('../../utils/string').escape;\n\nvar hasOwnProperty = require('../../utils/object').hasOwnProperty;\n\nvar map = require('../../utils/array').map;\n\nvar validateSafeMethod = require('../../utils/customs').validateSafeMethod;\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nfunction factory(type, config, load, typed, math) {\n  var Node = load(require('./Node'));\n  var SymbolNode = load(require('./SymbolNode'));\n  /**\n   * @constructor FunctionNode\n   * @extends {./Node}\n   * invoke a list with arguments on a node\n   * @param {./Node | string} fn Node resolving with a function on which to invoke\n   *                             the arguments, typically a SymboNode or AccessorNode\n   * @param {./Node[]} args\n   */\n\n  function FunctionNode(fn, args) {\n    if (!(this instanceof FunctionNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (typeof fn === 'string') {\n      fn = new SymbolNode(fn);\n    } // validate input\n\n\n    if (!type.isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"');\n\n    if (!Array.isArray(args) || !args.every(type.isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n    }\n\n    this.fn = fn;\n    this.args = args || []; // readonly property name\n\n    Object.defineProperty(this, 'name', {\n      get: function () {\n        return this.fn.name || '';\n      }.bind(this),\n      set: function set() {\n        throw new Error('Cannot assign a new name, name is read-only');\n      }\n    }); // TODO: deprecated since v3, remove some day\n\n    var deprecated = function deprecated() {\n      throw new Error('Property `FunctionNode.object` is deprecated, use `FunctionNode.fn` instead');\n    };\n\n    Object.defineProperty(this, 'object', {\n      get: deprecated,\n      set: deprecated\n    });\n  }\n\n  FunctionNode.prototype = new Node();\n  FunctionNode.prototype.type = 'FunctionNode';\n  FunctionNode.prototype.isFunctionNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  FunctionNode.prototype._compile = function (math, argNames) {\n    if (!(this instanceof FunctionNode)) {\n      throw new TypeError('No valid FunctionNode');\n    } // compile arguments\n\n\n    var evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames);\n    });\n\n    if (type.isSymbolNode(this.fn)) {\n      // we can statically determine whether the function has an rawArgs property\n      var name = this.fn.name;\n      var fn = name in math ? getSafeProperty(math, name) : undefined;\n      var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n\n      if (isRaw) {\n        // pass unevaluated parameters (nodes) to the function\n        // \"raw\" evaluation\n        var rawArgs = this.args;\n        return function evalFunctionNode(scope, args, context) {\n          return (name in scope ? getSafeProperty(scope, name) : fn)(rawArgs, math, _extends({}, scope, args));\n        };\n      } else {\n        // \"regular\" evaluation\n        if (evalArgs.length === 1) {\n          var evalArg0 = evalArgs[0];\n          return function evalFunctionNode(scope, args, context) {\n            return (name in scope ? getSafeProperty(scope, name) : fn)(evalArg0(scope, args, context));\n          };\n        } else if (evalArgs.length === 2) {\n          var _evalArg = evalArgs[0];\n          var evalArg1 = evalArgs[1];\n          return function evalFunctionNode(scope, args, context) {\n            return (name in scope ? getSafeProperty(scope, name) : fn)(_evalArg(scope, args, context), evalArg1(scope, args, context));\n          };\n        } else {\n          return function evalFunctionNode(scope, args, context) {\n            return (name in scope ? getSafeProperty(scope, name) : fn).apply(null, map(evalArgs, function (evalArg) {\n              return evalArg(scope, args, context);\n            }));\n          };\n        }\n      }\n    } else if (type.isAccessorNode(this.fn) && type.isIndexNode(this.fn.index) && this.fn.index.isObjectProperty()) {\n      // execute the function with the right context: the object of the AccessorNode\n      var evalObject = this.fn.object._compile(math, argNames);\n\n      var prop = this.fn.index.getObjectProperty();\n      var _rawArgs = this.args;\n      return function evalFunctionNode(scope, args, context) {\n        var object = evalObject(scope, args, context);\n        validateSafeMethod(object, prop);\n        var isRaw = object[prop] && object[prop].rawArgs;\n        return isRaw ? object[prop](_rawArgs, math, _extends({}, scope, args)) // \"raw\" evaluation\n        : object[prop].apply(object, map(evalArgs, function (evalArg) {\n          // \"regular\" evaluation\n          return evalArg(scope, args, context);\n        }));\n      };\n    } else {\n      // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n      // we have to dynamically determine whether the function has a rawArgs property\n      var evalFn = this.fn._compile(math, argNames);\n\n      var _rawArgs2 = this.args;\n      return function evalFunctionNode(scope, args, context) {\n        var fn = evalFn(scope, args, context);\n        var isRaw = fn && fn.rawArgs;\n        return isRaw ? fn(_rawArgs2, math, _extends({}, scope, args)) // \"raw\" evaluation\n        : fn.apply(fn, map(evalArgs, function (evalArg) {\n          // \"regular\" evaluation\n          return evalArg(scope, args, context);\n        }));\n      };\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  FunctionNode.prototype.forEach = function (callback) {\n    callback(this.fn, 'fn', this);\n\n    for (var i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this);\n    }\n  };\n  /**\n   * Create a new FunctionNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {FunctionNode} Returns a transformed copy of the node\n   */\n\n\n  FunctionNode.prototype.map = function (callback) {\n    var fn = this._ifNode(callback(this.fn, 'fn', this));\n\n    var args = [];\n\n    for (var i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n    }\n\n    return new FunctionNode(fn, args);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {FunctionNode}\n   */\n\n\n  FunctionNode.prototype.clone = function () {\n    return new FunctionNode(this.fn, this.args.slice(0));\n  }; // backup Node's toString function\n  // @private\n\n\n  var nodeToString = FunctionNode.prototype.toString;\n  /**\n   * Get string representation. (wrapper function)\n   * This overrides parts of Node's toString function.\n   * If callback is an object containing callbacks, it\n   * calls the correct callback for the current node,\n   * otherwise it falls back to calling Node's toString\n   * function.\n   *\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n  FunctionNode.prototype.toString = function (options) {\n    var customString;\n    var name = this.fn.toString(options);\n\n    if (options && _typeof(options.handler) === 'object' && hasOwnProperty(options.handler, name)) {\n      // callback is a map of callback functions\n      customString = options.handler[name](this, options);\n    }\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    } // fall back to Node's toString\n\n\n    return nodeToString.call(this, options);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype._toString = function (options) {\n    var args = this.args.map(function (arg) {\n      return arg.toString(options);\n    });\n    var fn = type.isFunctionAssignmentNode(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options); // format the arguments like \"add(2, 4.2)\"\n\n    return fn + '(' + args.join(', ') + ')';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  FunctionNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'FunctionNode',\n      fn: this.fn,\n      args: this.args\n    };\n  };\n  /**\n   * Instantiate an AssignmentNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"FunctionNode\", fn: ..., args: ...}`,\n   *                       where mathjs is optional\n   * @returns {FunctionNode}\n   */\n\n\n  FunctionNode.fromJSON = function (json) {\n    return new FunctionNode(json.fn, json.args);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype.toHTML = function (options) {\n    var args = this.args.map(function (arg) {\n      return arg.toHTML(options);\n    }); // format the arguments like \"add(2, 4.2)\"\n\n    return '<span class=\"math-function\">' + escape(this.fn) + '</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>' + args.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>';\n  };\n  /*\n   * Expand a LaTeX template\n   *\n   * @param {string} template\n   * @param {Node} node\n   * @param {Object} options\n   * @private\n   **/\n\n\n  function expandTemplate(template, node, options) {\n    var latex = ''; // Match everything of the form ${identifier} or ${identifier[2]} or $$\n    // while submatching identifier and 2 (in the second case)\n\n    var regex = new RegExp('\\\\$(?:\\\\{([a-z_][a-z_0-9]*)(?:\\\\[([0-9]+)\\\\])?\\\\}|\\\\$)', 'ig');\n    var inputPos = 0; // position in the input string\n\n    var match;\n\n    while ((match = regex.exec(template)) !== null) {\n      // go through all matches\n      // add everything in front of the match to the LaTeX string\n      latex += template.substring(inputPos, match.index);\n      inputPos = match.index;\n\n      if (match[0] === '$$') {\n        // escaped dollar sign\n        latex += '$';\n        inputPos++;\n      } else {\n        // template parameter\n        inputPos += match[0].length;\n        var property = node[match[1]];\n\n        if (!property) {\n          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n        }\n\n        if (match[2] === undefined) {\n          // no square brackets\n          switch (_typeof(property)) {\n            case 'string':\n              latex += property;\n              break;\n\n            case 'object':\n              if (type.isNode(property)) {\n                latex += property.toTex(options);\n              } else if (Array.isArray(property)) {\n                // make array of Nodes into comma separated list\n                latex += property.map(function (arg, index) {\n                  if (type.isNode(arg)) {\n                    return arg.toTex(options);\n                  }\n\n                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');\n                }).join(',');\n              } else {\n                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n              }\n\n              break;\n\n            default:\n              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n          }\n        } else {\n          // with square brackets\n          if (type.isNode(property[match[2]] && property[match[2]])) {\n            latex += property[match[2]].toTex(options);\n          } else {\n            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');\n          }\n        }\n      }\n    }\n\n    latex += template.slice(inputPos); // append rest of the template\n\n    return latex;\n  } // backup Node's toTex function\n  // @private\n\n\n  var nodeToTex = FunctionNode.prototype.toTex;\n  /**\n   * Get LaTeX representation. (wrapper function)\n   * This overrides parts of Node's toTex function.\n   * If callback is an object containing callbacks, it\n   * calls the correct callback for the current node,\n   * otherwise it falls back to calling Node's toTex\n   * function.\n   *\n   * @param {Object} options\n   * @return {string}\n   */\n\n  FunctionNode.prototype.toTex = function (options) {\n    var customTex;\n\n    if (options && _typeof(options.handler) === 'object' && hasOwnProperty(options.handler, this.name)) {\n      // callback is a map of callback functions\n      customTex = options.handler[this.name](this, options);\n    }\n\n    if (typeof customTex !== 'undefined') {\n      return customTex;\n    } // fall back to Node's toTex\n\n\n    return nodeToTex.call(this, options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  FunctionNode.prototype._toTex = function (options) {\n    var args = this.args.map(function (arg) {\n      // get LaTeX of the arguments\n      return arg.toTex(options);\n    });\n    var latexConverter;\n\n    if (math[this.name] && (typeof math[this.name].toTex === 'function' || _typeof(math[this.name].toTex) === 'object' || typeof math[this.name].toTex === 'string')) {\n      // .toTex is a callback function\n      latexConverter = math[this.name].toTex;\n    }\n\n    var customToTex;\n\n    switch (_typeof(latexConverter)) {\n      case 'function':\n        // a callback function\n        customToTex = latexConverter(this, options);\n        break;\n\n      case 'string':\n        // a template string\n        customToTex = expandTemplate(latexConverter, this, options);\n        break;\n\n      case 'object':\n        // an object with different \"converters\" for different numbers of arguments\n        switch (_typeof(latexConverter[args.length])) {\n          case 'function':\n            customToTex = latexConverter[args.length](this, options);\n            break;\n\n          case 'string':\n            customToTex = expandTemplate(latexConverter[args.length], this, options);\n            break;\n        }\n\n    }\n\n    if (typeof customToTex !== 'undefined') {\n      return customToTex;\n    }\n\n    return expandTemplate(latex.defaultTemplate, this, options);\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  FunctionNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.name;\n  };\n\n  return FunctionNode;\n}\n\nexports.name = 'FunctionNode';\nexports.path = 'expression.node';\nexports.math = true; // request access to the math namespace as 5th argument of the factory function\n\nexports.factory = factory;","'use strict';\n\nvar map = require('../../utils/array').map;\n\nvar escape = require('../../utils/string').escape;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  var Range = load(require('../../type/matrix/Range'));\n  var isArray = Array.isArray;\n  /**\n   * @constructor IndexNode\n   * @extends Node\n   *\n   * Describes a subset of a matrix or an object property.\n   * Cannot be used on its own, needs to be used within an AccessorNode or\n   * AssignmentNode.\n   *\n   * @param {Node[]} dimensions\n   * @param {boolean} [dotNotation=false]  Optional property describing whether\n   *                                       this index was written using dot\n   *                                       notation like `a.b`, or using bracket\n   *                                       notation like `a[\"b\"]` (default).\n   *                                       Used to stringify an IndexNode.\n   */\n\n  function IndexNode(dimensions, dotNotation) {\n    if (!(this instanceof IndexNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this.dimensions = dimensions;\n    this.dotNotation = dotNotation || false; // validate input\n\n    if (!isArray(dimensions) || !dimensions.every(type.isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n    }\n\n    if (this.dotNotation && !this.isObjectProperty()) {\n      throw new Error('dotNotation only applicable for object properties');\n    } // TODO: deprecated since v3, remove some day\n\n\n    var deprecated = function deprecated() {\n      throw new Error('Property `IndexNode.object` is deprecated, use `IndexNode.fn` instead');\n    };\n\n    Object.defineProperty(this, 'object', {\n      get: deprecated,\n      set: deprecated\n    });\n  }\n\n  IndexNode.prototype = new Node();\n  IndexNode.prototype.type = 'IndexNode';\n  IndexNode.prototype.isIndexNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  IndexNode.prototype._compile = function (math, argNames) {\n    // TODO: implement support for bignumber (currently bignumbers are silently\n    //       reduced to numbers when changing the value to zero-based)\n    // TODO: Optimization: when the range values are ConstantNodes,\n    //       we can beforehand resolve the zero-based value\n    // optimization for a simple object property\n    var evalDimensions = map(this.dimensions, function (range, i) {\n      if (type.isRangeNode(range)) {\n        if (range.needsEnd()) {\n          // create a range containing end (like '4:end')\n          var childArgNames = Object.create(argNames);\n          childArgNames['end'] = true;\n\n          var evalStart = range.start._compile(math, childArgNames);\n\n          var evalEnd = range.end._compile(math, childArgNames);\n\n          var evalStep = range.step ? range.step._compile(math, childArgNames) : function () {\n            return 1;\n          };\n          return function evalDimension(scope, args, context) {\n            var size = math.size(context).valueOf();\n            var childArgs = Object.create(args);\n            childArgs['end'] = size[i];\n            return createRange(evalStart(scope, childArgs, context), evalEnd(scope, childArgs, context), evalStep(scope, childArgs, context));\n          };\n        } else {\n          // create range\n          var _evalStart = range.start._compile(math, argNames);\n\n          var _evalEnd = range.end._compile(math, argNames);\n\n          var _evalStep = range.step ? range.step._compile(math, argNames) : function () {\n            return 1;\n          };\n\n          return function evalDimension(scope, args, context) {\n            return createRange(_evalStart(scope, args, context), _evalEnd(scope, args, context), _evalStep(scope, args, context));\n          };\n        }\n      } else if (type.isSymbolNode(range) && range.name === 'end') {\n        // SymbolNode 'end'\n        var _childArgNames = Object.create(argNames);\n\n        _childArgNames['end'] = true;\n\n        var evalRange = range._compile(math, _childArgNames);\n\n        return function evalDimension(scope, args, context) {\n          var size = math.size(context).valueOf();\n          var childArgs = Object.create(args);\n          childArgs['end'] = size[i];\n          return evalRange(scope, childArgs, context);\n        };\n      } else {\n        // ConstantNode\n        var _evalRange = range._compile(math, argNames);\n\n        return function evalDimension(scope, args, context) {\n          return _evalRange(scope, args, context);\n        };\n      }\n    });\n    return function evalIndexNode(scope, args, context) {\n      var dimensions = map(evalDimensions, function (evalDimension) {\n        return evalDimension(scope, args, context);\n      });\n      return math.index.apply(math, dimensions);\n    };\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  IndexNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.dimensions.length; i++) {\n      callback(this.dimensions[i], 'dimensions[' + i + ']', this);\n    }\n  };\n  /**\n   * Create a new IndexNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {IndexNode} Returns a transformed copy of the node\n   */\n\n\n  IndexNode.prototype.map = function (callback) {\n    var dimensions = [];\n\n    for (var i = 0; i < this.dimensions.length; i++) {\n      dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));\n    }\n\n    return new IndexNode(dimensions);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {IndexNode}\n   */\n\n\n  IndexNode.prototype.clone = function () {\n    return new IndexNode(this.dimensions.slice(0));\n  };\n  /**\n   * Test whether this IndexNode contains a single property name\n   * @return {boolean}\n   */\n\n\n  IndexNode.prototype.isObjectProperty = function () {\n    return this.dimensions.length === 1 && type.isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n  };\n  /**\n   * Returns the property name if IndexNode contains a property.\n   * If not, returns null.\n   * @return {string | null}\n   */\n\n\n  IndexNode.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this.dimensions[0].value : null;\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype._toString = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  IndexNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'IndexNode',\n      dimensions: this.dimensions,\n      dotNotation: this.dotNotation\n    };\n  };\n  /**\n   * Instantiate an IndexNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n   *                       where mathjs is optional\n   * @returns {IndexNode}\n   */\n\n\n  IndexNode.fromJSON = function (json) {\n    return new IndexNode(json.dimensions, json.dotNotation);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype.toHTML = function (options) {\n    // format the parameters like \"[1, 0:5]\"\n    var dimensions = [];\n\n    for (var i = 0; i < this.dimensions.length; i++) {\n      dimensions[i] = this.dimensions[i].toHTML();\n    }\n\n    if (this.dotNotation) {\n      return '<span class=\"math-operator math-accessor-operator\">.</span>' + '<span class=\"math-symbol math-property\">' + escape(this.getObjectProperty()) + '</span>';\n    } else {\n      return '<span class=\"math-parenthesis math-square-parenthesis\">[</span>' + dimensions.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-square-parenthesis\">]</span>';\n    }\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  IndexNode.prototype._toTex = function (options) {\n    var dimensions = this.dimensions.map(function (range) {\n      return range.toTex(options);\n    });\n    return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n  }; // helper function to create a Range from start, step and end\n\n\n  function createRange(start, end, step) {\n    return new Range(type.isBigNumber(start) ? start.toNumber() : start, type.isBigNumber(end) ? end.toNumber() : end, type.isBigNumber(step) ? step.toNumber() : step);\n  }\n\n  return IndexNode;\n}\n\nexports.name = 'IndexNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\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\nvar keywords = require('../keywords');\n\nvar deepEqual = require('../../utils/object').deepEqual;\n\nvar hasOwnProperty = require('../../utils/object').hasOwnProperty;\n\nfunction factory(type, config, load, typed, math) {\n  /**\n   * Node\n   */\n  function Node() {\n    if (!(this instanceof Node)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n  /**\n   * Evaluate the node\n   * @param {Object} [scope]  Scope to read/write variables\n   * @return {*}              Returns the result\n   */\n\n\n  Node.prototype.eval = function (scope) {\n    return this.compile().eval(scope);\n  };\n\n  Node.prototype.type = 'Node';\n  Node.prototype.isNode = true;\n  Node.prototype.comment = '';\n  /**\n   * Compile the node into an optimized, evauatable JavaScript function\n   * @return {{eval: function([Object])}} expr  Returns an object with a function 'eval',\n   *                                  which can be invoked as expr.eval([scope: Object]),\n   *                                  where scope is an optional object with\n   *                                  variables.\n   */\n\n  Node.prototype.compile = function () {\n    var expr = this._compile(math.expression.mathWithTransform, {});\n\n    var args = {};\n    var context = null;\n    return {\n      eval: function evalNode(scope) {\n        var s = scope || {};\n\n        _validateScope(s);\n\n        return expr(s, args, context);\n      }\n    };\n  };\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n\n  Node.prototype._compile = function (math, argNames) {\n    throw new Error('Method _compile should be implemented by type ' + this.type);\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  Node.prototype.forEach = function (callback) {\n    // must be implemented by each of the Node implementations\n    throw new Error('Cannot run forEach on a Node interface');\n  };\n  /**\n   * Create a new Node having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {OperatorNode} Returns a transformed copy of the node\n   */\n\n\n  Node.prototype.map = function (callback) {\n    // must be implemented by each of the Node implementations\n    throw new Error('Cannot run map on a Node interface');\n  };\n  /**\n   * Validate whether an object is a Node, for use with map\n   * @param {Node} node\n   * @returns {Node} Returns the input if it's a node, else throws an Error\n   * @protected\n   */\n\n\n  Node.prototype._ifNode = function (node) {\n    if (!type.isNode(node)) {\n      throw new TypeError('Callback function must return a Node');\n    }\n\n    return node;\n  };\n  /**\n   * Recursively traverse all nodes in a node tree. Executes given callback for\n   * this node and each of its child nodes.\n   * @param {function(node: Node, path: string, parent: Node)} callback\n   *          A callback called for every node in the node tree.\n   */\n\n\n  Node.prototype.traverse = function (callback) {\n    // execute callback for itself\n    callback(this, null, null); // eslint-disable-line standard/no-callback-literal\n    // recursively traverse over all childs of a node\n\n    function _traverse(node, callback) {\n      node.forEach(function (child, path, parent) {\n        callback(child, path, parent);\n\n        _traverse(child, callback);\n      });\n    }\n\n    _traverse(this, callback);\n  };\n  /**\n   * Recursively transform a node tree via a transform function.\n   *\n   * For example, to replace all nodes of type SymbolNode having name 'x' with a\n   * ConstantNode with value 2:\n   *\n   *     const res = Node.transform(function (node, path, parent) {\n   *       if (node && node.isSymbolNode) && (node.name === 'x')) {\n   *         return new ConstantNode(2)\n   *       }\n   *       else {\n   *         return node\n   *       }\n   *     })\n   *\n   * @param {function(node: Node, path: string, parent: Node) : Node} callback\n   *          A mapping function accepting a node, and returning\n   *          a replacement for the node or the original node.\n   *          Signature: callback(node: Node, index: string, parent: Node) : Node\n   * @return {Node} Returns the original node or its replacement\n   */\n\n\n  Node.prototype.transform = function (callback) {\n    // traverse over all childs\n    function _transform(node, callback) {\n      return node.map(function (child, path, parent) {\n        var replacement = callback(child, path, parent);\n        return _transform(replacement, callback);\n      });\n    }\n\n    var replacement = callback(this, null, null); // eslint-disable-line standard/no-callback-literal\n\n    return _transform(replacement, callback);\n  };\n  /**\n   * Find any node in the node tree matching given filter function. For example, to\n   * find all nodes of type SymbolNode having name 'x':\n   *\n   *     const results = Node.filter(function (node) {\n   *       return (node && node.isSymbolNode) && (node.name === 'x')\n   *     })\n   *\n   * @param {function(node: Node, path: string, parent: Node) : Node} callback\n   *            A test function returning true when a node matches, and false\n   *            otherwise. Function signature:\n   *            callback(node: Node, index: string, parent: Node) : boolean\n   * @return {Node[]} nodes       An array with nodes matching given filter criteria\n   */\n\n\n  Node.prototype.filter = function (callback) {\n    var nodes = [];\n    this.traverse(function (node, path, parent) {\n      if (callback(node, path, parent)) {\n        nodes.push(node);\n      }\n    });\n    return nodes;\n  }; // TODO: deprecated since version 1.1.0, remove this some day\n\n\n  Node.prototype.find = function () {\n    throw new Error('Function Node.find is deprecated. Use Node.filter instead.');\n  }; // TODO: deprecated since version 1.1.0, remove this some day\n\n\n  Node.prototype.match = function () {\n    throw new Error('Function Node.match is deprecated. See functions Node.filter, Node.transform, Node.traverse.');\n  };\n  /**\n   * Create a shallow clone of this node\n   * @return {Node}\n   */\n\n\n  Node.prototype.clone = function () {\n    // must be implemented by each of the Node implementations\n    throw new Error('Cannot clone a Node interface');\n  };\n  /**\n   * Create a deep clone of this node\n   * @return {Node}\n   */\n\n\n  Node.prototype.cloneDeep = function () {\n    return this.map(function (node) {\n      return node.cloneDeep();\n    });\n  };\n  /**\n   * Deep compare this node with another node.\n   * @param {Node} other\n   * @return {boolean} Returns true when both nodes are of the same type and\n   *                   contain the same values (as do their childs)\n   */\n\n\n  Node.prototype.equals = function (other) {\n    return other ? deepEqual(this, other) : false;\n  };\n  /**\n   * Get string representation. (wrapper function)\n   *\n   * This function can get an object of the following form:\n   * {\n   *    handler: //This can be a callback function of the form\n   *             // \"function callback(node, options)\"or\n   *             // a map that maps function names (used in FunctionNodes)\n   *             // to callbacks\n   *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n   * }\n   *\n   * @param {Object} [options]\n   * @return {string}\n   */\n\n\n  Node.prototype.toString = function (options) {\n    var customString;\n\n    if (options && _typeof(options) === 'object') {\n      switch (_typeof(options.handler)) {\n        case 'object':\n        case 'undefined':\n          break;\n\n        case 'function':\n          customString = options.handler(this, options);\n          break;\n\n        default:\n          throw new TypeError('Object or function expected as callback');\n      }\n    }\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this._toString(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * Both .toJSON() and the static .fromJSON(json) should be implemented by all\n   * implementations of Node\n   * @returns {Object}\n   */\n\n\n  Node.prototype.toJSON = function () {\n    throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\n  };\n  /**\n   * Get HTML representation. (wrapper function)\n   *\n   * This function can get an object of the following form:\n   * {\n   *    handler: //This can be a callback function of the form\n   *             // \"function callback(node, options)\" or\n   *             // a map that maps function names (used in FunctionNodes)\n   *             // to callbacks\n   *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n   * }\n   *\n   * @param {Object} [options]\n   * @return {string}\n   */\n\n\n  Node.prototype.toHTML = function (options) {\n    var customString;\n\n    if (options && _typeof(options) === 'object') {\n      switch (_typeof(options.handler)) {\n        case 'object':\n        case 'undefined':\n          break;\n\n        case 'function':\n          customString = options.handler(this, options);\n          break;\n\n        default:\n          throw new TypeError('Object or function expected as callback');\n      }\n    }\n\n    if (typeof customString !== 'undefined') {\n      return customString;\n    }\n\n    return this.toHTML(options);\n  };\n  /**\n   * Internal function to generate the string output.\n   * This has to be implemented by every Node\n   *\n   * @throws {Error}\n   */\n\n\n  Node.prototype._toString = function () {\n    // must be implemented by each of the Node implementations\n    throw new Error('_toString not implemented for ' + this.type);\n  };\n  /**\n   * Get LaTeX representation. (wrapper function)\n   *\n   * This function can get an object of the following form:\n   * {\n   *    handler: //This can be a callback function of the form\n   *             // \"function callback(node, options)\"or\n   *             // a map that maps function names (used in FunctionNodes)\n   *             // to callbacks\n   *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n   * }\n   *\n   * @param {Object} [options]\n   * @return {string}\n   */\n\n\n  Node.prototype.toTex = function (options) {\n    var customTex;\n\n    if (options && _typeof(options) === 'object') {\n      switch (_typeof(options.handler)) {\n        case 'object':\n        case 'undefined':\n          break;\n\n        case 'function':\n          customTex = options.handler(this, options);\n          break;\n\n        default:\n          throw new TypeError('Object or function expected as callback');\n      }\n    }\n\n    if (typeof customTex !== 'undefined') {\n      return customTex;\n    }\n\n    return this._toTex(options);\n  };\n  /**\n   * Internal function to generate the LaTeX output.\n   * This has to be implemented by every Node\n   *\n   * @param {Object} [options]\n   * @throws {Error}\n   */\n\n\n  Node.prototype._toTex = function (options) {\n    // must be implemented by each of the Node implementations\n    throw new Error('_toTex not implemented for ' + this.type);\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  Node.prototype.getIdentifier = function () {\n    return this.type;\n  };\n  /**\n   * Get the content of the current Node.\n   * @return {Node} node\n   **/\n\n\n  Node.prototype.getContent = function () {\n    return this;\n  };\n  /**\n   * Validate the symbol names of a scope.\n   * Throws an error when the scope contains an illegal symbol.\n   * @param {Object} scope\n   */\n\n\n  function _validateScope(scope) {\n    for (var symbol in scope) {\n      if (hasOwnProperty(scope, symbol)) {\n        if (symbol in keywords) {\n          throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n        }\n      }\n    }\n  }\n\n  return Node;\n}\n\nexports.name = 'Node';\nexports.path = 'expression.node';\nexports.math = true; // request access to the math namespace as 5th argument of the factory function\n\nexports.factory = factory;","'use strict';\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\nvar stringify = require('../../utils/string').stringify;\n\nvar escape = require('../../utils/string').escape;\n\nvar isSafeProperty = require('../../utils/customs').isSafeProperty;\n\nvar hasOwnProperty = require('../../utils/object').hasOwnProperty;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  /**\n   * @constructor ObjectNode\n   * @extends {Node}\n   * Holds an object with keys/values\n   * @param {Object.<string, Node>} [properties]   object with key/value pairs\n   */\n\n  function ObjectNode(properties) {\n    if (!(this instanceof ObjectNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this.properties = properties || {}; // validate input\n\n    if (properties) {\n      if (!(_typeof(properties) === 'object') || !Object.keys(properties).every(function (key) {\n        return type.isNode(properties[key]);\n      })) {\n        throw new TypeError('Object containing Nodes expected');\n      }\n    }\n  }\n\n  ObjectNode.prototype = new Node();\n  ObjectNode.prototype.type = 'ObjectNode';\n  ObjectNode.prototype.isObjectNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  ObjectNode.prototype._compile = function (math, argNames) {\n    var evalEntries = {};\n\n    for (var key in this.properties) {\n      if (hasOwnProperty(this.properties, key)) {\n        // we stringify/parse the key here to resolve unicode characters,\n        // so you cannot create a key like {\"co\\\\u006Estructor\": null}\n        var stringifiedKey = stringify(key);\n        var parsedKey = JSON.parse(stringifiedKey);\n\n        if (!isSafeProperty(this.properties, parsedKey)) {\n          throw new Error('No access to property \"' + parsedKey + '\"');\n        }\n\n        evalEntries[parsedKey] = this.properties[key]._compile(math, argNames);\n      }\n    }\n\n    return function evalObjectNode(scope, args, context) {\n      var obj = {};\n\n      for (var _key in evalEntries) {\n        if (hasOwnProperty(evalEntries, _key)) {\n          obj[_key] = evalEntries[_key](scope, args, context);\n        }\n      }\n\n      return obj;\n    };\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ObjectNode.prototype.forEach = function (callback) {\n    for (var key in this.properties) {\n      if (this.properties.hasOwnProperty(key)) {\n        callback(this.properties[key], 'properties[' + stringify(key) + ']', this);\n      }\n    }\n  };\n  /**\n   * Create a new ObjectNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {ObjectNode} Returns a transformed copy of the node\n   */\n\n\n  ObjectNode.prototype.map = function (callback) {\n    var properties = {};\n\n    for (var key in this.properties) {\n      if (this.properties.hasOwnProperty(key)) {\n        properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + stringify(key) + ']', this));\n      }\n    }\n\n    return new ObjectNode(properties);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ObjectNode}\n   */\n\n\n  ObjectNode.prototype.clone = function () {\n    var properties = {};\n\n    for (var key in this.properties) {\n      if (this.properties.hasOwnProperty(key)) {\n        properties[key] = this.properties[key];\n      }\n    }\n\n    return new ObjectNode(properties);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ObjectNode.prototype._toString = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (this.properties.hasOwnProperty(key)) {\n        entries.push(stringify(key) + ': ' + this.properties[key].toString(options));\n      }\n    }\n\n    return '{' + entries.join(', ') + '}';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ObjectNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ObjectNode',\n      properties: this.properties\n    };\n  };\n  /**\n   * Instantiate an OperatorNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ObjectNode\", \"properties\": {...}}`,\n   *                       where mathjs is optional\n   * @returns {ObjectNode}\n   */\n\n\n  ObjectNode.fromJSON = function (json) {\n    return new ObjectNode(json.properties);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ObjectNode.prototype.toHTML = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (this.properties.hasOwnProperty(key)) {\n        entries.push('<span class=\"math-symbol math-property\">' + escape(key) + '</span>' + '<span class=\"math-operator math-assignment-operator math-property-assignment-operator math-binary-operator\">:</span>' + this.properties[key].toHTML(options));\n      }\n    }\n\n    return '<span class=\"math-parenthesis math-curly-parenthesis\">{</span>' + entries.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-parenthesis math-curly-parenthesis\">}</span>';\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  ObjectNode.prototype._toTex = function (options) {\n    var entries = [];\n\n    for (var key in this.properties) {\n      if (this.properties.hasOwnProperty(key)) {\n        entries.push('\\\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\\\\\');\n      }\n    }\n\n    return \"\\\\left\\\\{\\\\begin{array}{ll}\".concat(entries.join('\\n'), \"\\\\end{array}\\\\right\\\\}\");\n  };\n\n  return ObjectNode;\n}\n\nexports.name = 'ObjectNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar latex = require('../../utils/latex');\n\nvar map = require('../../utils/array').map;\n\nvar escape = require('../../utils/string').escape;\n\nvar isSafeMethod = require('../../utils/customs').isSafeMethod;\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nvar operators = require('../operators');\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  /**\n   * @constructor OperatorNode\n   * @extends {Node}\n   * An operator with two arguments, like 2+3\n   *\n   * @param {string} op           Operator name, for example '+'\n   * @param {string} fn           Function name, for example 'add'\n   * @param {Node[]} args         Operator arguments\n   * @param {boolean} [implicit]  Is this an implicit multiplication?\n   */\n\n  function OperatorNode(op, fn, args, implicit) {\n    if (!(this instanceof OperatorNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof op !== 'string') {\n      throw new TypeError('string expected for parameter \"op\"');\n    }\n\n    if (typeof fn !== 'string') {\n      throw new TypeError('string expected for parameter \"fn\"');\n    }\n\n    if (!Array.isArray(args) || !args.every(type.isNode)) {\n      throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n    }\n\n    this.implicit = implicit === true;\n    this.op = op;\n    this.fn = fn;\n    this.args = args || [];\n  }\n\n  OperatorNode.prototype = new Node();\n  OperatorNode.prototype.type = 'OperatorNode';\n  OperatorNode.prototype.isOperatorNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  OperatorNode.prototype._compile = function (math, argNames) {\n    // validate fn\n    if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {\n      if (!math[this.fn]) {\n        throw new Error('Function ' + this.fn + ' missing in provided namespace \"math\"');\n      } else {\n        throw new Error('No access to function \"' + this.fn + '\"');\n      }\n    }\n\n    var fn = getSafeProperty(math, this.fn);\n    var evalArgs = map(this.args, function (arg) {\n      return arg._compile(math, argNames);\n    });\n\n    if (evalArgs.length === 1) {\n      var evalArg0 = evalArgs[0];\n      return function evalOperatorNode(scope, args, context) {\n        return fn(evalArg0(scope, args, context));\n      };\n    } else if (evalArgs.length === 2) {\n      var _evalArg = evalArgs[0];\n      var evalArg1 = evalArgs[1];\n      return function evalOperatorNode(scope, args, context) {\n        return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));\n      };\n    } else {\n      return function evalOperatorNode(scope, args, context) {\n        return fn.apply(null, map(evalArgs, function (evalArg) {\n          return evalArg(scope, args, context);\n        }));\n      };\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  OperatorNode.prototype.forEach = function (callback) {\n    for (var i = 0; i < this.args.length; i++) {\n      callback(this.args[i], 'args[' + i + ']', this);\n    }\n  };\n  /**\n   * Create a new OperatorNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {OperatorNode} Returns a transformed copy of the node\n   */\n\n\n  OperatorNode.prototype.map = function (callback) {\n    var args = [];\n\n    for (var i = 0; i < this.args.length; i++) {\n      args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n    }\n\n    return new OperatorNode(this.op, this.fn, args, this.implicit);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {OperatorNode}\n   */\n\n\n  OperatorNode.prototype.clone = function () {\n    return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit);\n  };\n  /**\n   * Check whether this is an unary OperatorNode:\n   * has exactly one argument, like `-a`.\n   * @return {boolean} Returns true when an unary operator node, false otherwise.\n   */\n\n\n  OperatorNode.prototype.isUnary = function () {\n    return this.args.length === 1;\n  };\n  /**\n   * Check whether this is a binary OperatorNode:\n   * has exactly two arguments, like `a + b`.\n   * @return {boolean} Returns true when a binary operator node, false otherwise.\n   */\n\n\n  OperatorNode.prototype.isBinary = function () {\n    return this.args.length === 2;\n  };\n  /**\n   * Calculate which parentheses are necessary. Gets an OperatorNode\n   * (which is the root of the tree) and an Array of Nodes\n   * (this.args) and returns an array where 'true' means that an argument\n   * has to be enclosed in parentheses whereas 'false' means the opposite.\n   *\n   * @param {OperatorNode} root\n   * @param {string} parenthesis\n   * @param {Node[]} args\n   * @param {boolean} latex\n   * @return {boolean[]}\n   * @private\n   */\n\n\n  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n    // precedence of the root OperatorNode\n    var precedence = operators.getPrecedence(root, parenthesis);\n    var associativity = operators.getAssociativity(root, parenthesis);\n\n    if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {\n      var parens = args.map(function (arg) {\n        switch (arg.getContent().type) {\n          // Nodes that don't need extra parentheses\n          case 'ArrayNode':\n          case 'ConstantNode':\n          case 'SymbolNode':\n          case 'ParenthesisNode':\n            return false;\n\n          default:\n            return true;\n        }\n      });\n      return parens;\n    }\n\n    var result;\n\n    switch (args.length) {\n      case 0:\n        result = [];\n        break;\n\n      case 1:\n        // unary operators\n        // precedence of the operand\n        var operandPrecedence = operators.getPrecedence(args[0], parenthesis); // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n        if (latex && operandPrecedence !== null) {\n          var operandIdentifier;\n          var rootIdentifier;\n\n          if (parenthesis === 'keep') {\n            operandIdentifier = args[0].getIdentifier();\n            rootIdentifier = root.getIdentifier();\n          } else {\n            // Ignore Parenthesis Nodes when not in 'keep' mode\n            operandIdentifier = args[0].getContent().getIdentifier();\n            rootIdentifier = root.getContent().getIdentifier();\n          }\n\n          if (operators.properties[precedence][rootIdentifier].latexLeftParens === false) {\n            result = [false];\n            break;\n          }\n\n          if (operators.properties[operandPrecedence][operandIdentifier].latexParens === false) {\n            result = [false];\n            break;\n          }\n        }\n\n        if (operandPrecedence === null) {\n          // if the operand has no defined precedence, no parens are needed\n          result = [false];\n          break;\n        }\n\n        if (operandPrecedence <= precedence) {\n          // if the operands precedence is lower, parens are needed\n          result = [true];\n          break;\n        } // otherwise, no parens needed\n\n\n        result = [false];\n        break;\n\n      case 2:\n        // binary operators\n        var lhsParens; // left hand side needs parenthesis?\n        // precedence of the left hand side\n\n        var lhsPrecedence = operators.getPrecedence(args[0], parenthesis); // is the root node associative with the left hand side\n\n        var assocWithLhs = operators.isAssociativeWith(root, args[0], parenthesis);\n\n        if (lhsPrecedence === null) {\n          // if the left hand side has no defined precedence, no parens are needed\n          // FunctionNode for example\n          lhsParens = false;\n        } else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {\n          // In case of equal precedence, if the root node is left associative\n          // parens are **never** necessary for the left hand side.\n          // If it is right associative however, parens are necessary\n          // if the root node isn't associative with the left hand side\n          lhsParens = true;\n        } else if (lhsPrecedence < precedence) {\n          lhsParens = true;\n        } else {\n          lhsParens = false;\n        }\n\n        var rhsParens; // right hand side needs parenthesis?\n        // precedence of the right hand side\n\n        var rhsPrecedence = operators.getPrecedence(args[1], parenthesis); // is the root node associative with the right hand side?\n\n        var assocWithRhs = operators.isAssociativeWith(root, args[1], parenthesis);\n\n        if (rhsPrecedence === null) {\n          // if the right hand side has no defined precedence, no parens are needed\n          // FunctionNode for example\n          rhsParens = false;\n        } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {\n          // In case of equal precedence, if the root node is right associative\n          // parens are **never** necessary for the right hand side.\n          // If it is left associative however, parens are necessary\n          // if the root node isn't associative with the right hand side\n          rhsParens = true;\n        } else if (rhsPrecedence < precedence) {\n          rhsParens = true;\n        } else {\n          rhsParens = false;\n        } // handle special cases for LaTeX, where some of the parentheses aren't needed\n\n\n        if (latex) {\n          var _rootIdentifier;\n\n          var lhsIdentifier;\n          var rhsIdentifier;\n\n          if (parenthesis === 'keep') {\n            _rootIdentifier = root.getIdentifier();\n            lhsIdentifier = root.args[0].getIdentifier();\n            rhsIdentifier = root.args[1].getIdentifier();\n          } else {\n            // Ignore ParenthesisNodes when not in 'keep' mode\n            _rootIdentifier = root.getContent().getIdentifier();\n            lhsIdentifier = root.args[0].getContent().getIdentifier();\n            rhsIdentifier = root.args[1].getContent().getIdentifier();\n          }\n\n          if (lhsPrecedence !== null) {\n            if (operators.properties[precedence][_rootIdentifier].latexLeftParens === false) {\n              lhsParens = false;\n            }\n\n            if (operators.properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n              lhsParens = false;\n            }\n          }\n\n          if (rhsPrecedence !== null) {\n            if (operators.properties[precedence][_rootIdentifier].latexRightParens === false) {\n              rhsParens = false;\n            }\n\n            if (operators.properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n              rhsParens = false;\n            }\n          }\n        }\n\n        result = [lhsParens, rhsParens];\n        break;\n\n      default:\n        if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {\n          result = args.map(function (arg) {\n            var argPrecedence = operators.getPrecedence(arg, parenthesis);\n            var assocWithArg = operators.isAssociativeWith(root, arg, parenthesis);\n            var argAssociativity = operators.getAssociativity(arg, parenthesis);\n\n            if (argPrecedence === null) {\n              // if the argument has no defined precedence, no parens are needed\n              return false;\n            } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {\n              return true;\n            } else if (argPrecedence < precedence) {\n              return true;\n            }\n\n            return false;\n          });\n        }\n\n        break;\n    } // handles an edge case of 'auto' parentheses with implicit multiplication of ConstantNode\n    // In that case print parentheses for ParenthesisNodes even though they normally wouldn't be\n    // printed.\n\n\n    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis === 'auto' && implicit === 'hide') {\n      result = args.map(function (arg, index) {\n        var isParenthesisNode = arg.getIdentifier() === 'ParenthesisNode';\n\n        if (result[index] || isParenthesisNode) {\n          // put in parenthesis?\n          return true;\n        }\n\n        return false;\n      });\n    }\n\n    return result;\n  }\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = operators.getAssociativity(this, parenthesis);\n      var operand = args[0].toString(options);\n\n      if (parens[0]) {\n        operand = '(' + operand + ')';\n      } // for example for \"not\", we want a space between operand and argument\n\n\n      var opIsNamed = /[a-zA-Z]+/.test(this.op);\n\n      if (assoc === 'right') {\n        // prefix operator\n        return this.op + (opIsNamed ? ' ' : '') + operand;\n      } else if (assoc === 'left') {\n        // postfix\n        return operand + (opIsNamed ? ' ' : '') + this.op;\n      } // fall back to postfix\n\n\n      return operand + this.op;\n    } else if (args.length === 2) {\n      var lhs = args[0].toString(options); // left hand side\n\n      var rhs = args[1].toString(options); // right hand side\n\n      if (parens[0]) {\n        // left hand side in parenthesis?\n        lhs = '(' + lhs + ')';\n      }\n\n      if (parens[1]) {\n        // right hand side in parenthesis?\n        rhs = '(' + rhs + ')';\n      }\n\n      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n        return lhs + ' ' + rhs;\n      }\n\n      return lhs + ' ' + this.op + ' ' + rhs;\n    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n      var stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toString(options);\n\n        if (parens[index]) {\n          // put in parenthesis?\n          arg = '(' + arg + ')';\n        }\n\n        return arg;\n      });\n\n      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n        return stringifiedArgs.join(' ');\n      }\n\n      return stringifiedArgs.join(' ' + this.op + ' ');\n    } else {\n      // fallback to formatting as a function call\n      return this.fn + '(' + this.args.join(', ') + ')';\n    }\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  OperatorNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'OperatorNode',\n      op: this.op,\n      fn: this.fn,\n      args: this.args,\n      implicit: this.implicit\n    };\n  };\n  /**\n   * Instantiate an OperatorNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"OperatorNode\", \"op\": \"+\", \"fn\": \"add\", \"args\": [...], \"implicit\": false}`,\n   *                       where mathjs is optional\n   * @returns {OperatorNode}\n   */\n\n\n  OperatorNode.fromJSON = function (json) {\n    return new OperatorNode(json.op, json.fn, json.args, json.implicit);\n  };\n  /**\n   * Get HTML representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = operators.getAssociativity(this, parenthesis);\n      var operand = args[0].toHTML(options);\n\n      if (parens[0]) {\n        operand = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + operand + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n      }\n\n      if (assoc === 'right') {\n        // prefix operator\n        return '<span class=\"math-operator math-unary-operator math-lefthand-unary-operator\">' + escape(this.op) + '</span>' + operand;\n      } else if (assoc === 'left') {\n        // postfix\n        return '<span class=\"math-operator math-unary-operator math-righthand-unary-operator\">' + escape(this.op) + '</span>' + operand;\n      } // fall back to postfix\n\n\n      return '<span class=\"math-operator math-unary-operator math-righthand-unary-operator\">' + escape(this.op) + '</span>' + operand;\n    } else if (args.length === 2) {\n      // binary operatoes\n      var lhs = args[0].toHTML(options); // left hand side\n\n      var rhs = args[1].toHTML(options); // right hand side\n\n      if (parens[0]) {\n        // left hand side in parenthesis?\n        lhs = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + lhs + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n      }\n\n      if (parens[1]) {\n        // right hand side in parenthesis?\n        rhs = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + rhs + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n      }\n\n      if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n        return lhs + '<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>' + rhs;\n      }\n\n      return lhs + '<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">' + escape(this.op) + '</span>' + rhs;\n    } else {\n      var stringifiedArgs = args.map(function (arg, index) {\n        arg = arg.toHTML(options);\n\n        if (parens[index]) {\n          // put in parenthesis?\n          arg = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + arg + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n        }\n\n        return arg;\n      });\n\n      if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n          return stringifiedArgs.join('<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>');\n        }\n\n        return stringifiedArgs.join('<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">' + escape(this.op) + '</span>');\n      } else {\n        // fallback to formatting as a function call\n        return '<span class=\"math-function\">' + escape(this.fn) + '</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>' + stringifiedArgs.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>';\n      }\n    }\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  OperatorNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var implicit = options && options.implicit ? options.implicit : 'hide';\n    var args = this.args;\n    var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);\n    var op = latex.operators[this.fn];\n    op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op\n\n    if (args.length === 1) {\n      // unary operators\n      var assoc = operators.getAssociativity(this, parenthesis);\n      var operand = args[0].toTex(options);\n\n      if (parens[0]) {\n        operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\n      }\n\n      if (assoc === 'right') {\n        // prefix operator\n        return op + operand;\n      } else if (assoc === 'left') {\n        // postfix operator\n        return operand + op;\n      } // fall back to postfix\n\n\n      return operand + op;\n    } else if (args.length === 2) {\n      // binary operators\n      var lhs = args[0]; // left hand side\n\n      var lhsTex = lhs.toTex(options);\n\n      if (parens[0]) {\n        lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n      }\n\n      var rhs = args[1]; // right hand side\n\n      var rhsTex = rhs.toTex(options);\n\n      if (parens[1]) {\n        rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n      } // handle some exceptions (due to the way LaTeX works)\n\n\n      var lhsIdentifier;\n\n      if (parenthesis === 'keep') {\n        lhsIdentifier = lhs.getIdentifier();\n      } else {\n        // Ignore ParenthesisNodes if in 'keep' mode\n        lhsIdentifier = lhs.getContent().getIdentifier();\n      }\n\n      switch (this.getIdentifier()) {\n        case 'OperatorNode:divide':\n          // op contains '\\\\frac' at this point\n          return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n\n        case 'OperatorNode:pow':\n          lhsTex = '{' + lhsTex + '}';\n          rhsTex = '{' + rhsTex + '}';\n\n          switch (lhsIdentifier) {\n            case 'ConditionalNode': //\n\n            case 'OperatorNode:divide':\n              lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n          }\n\n          break;\n\n        case 'OperatorNode:multiply':\n          if (this.implicit && implicit === 'hide') {\n            return lhsTex + '~' + rhsTex;\n          }\n\n      }\n\n      return lhsTex + op + rhsTex;\n    } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n      var texifiedArgs = args.map(function (arg, index) {\n        arg = arg.toTex(options);\n\n        if (parens[index]) {\n          arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n        }\n\n        return arg;\n      });\n\n      if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit) {\n        return texifiedArgs.join('~');\n      }\n\n      return texifiedArgs.join(op);\n    } else {\n      // fall back to formatting as a function call\n      // as this is a fallback, it doesn't use\n      // fancy function names\n      return '\\\\mathrm{' + this.fn + '}\\\\left(' + args.map(function (arg) {\n        return arg.toTex(options);\n      }).join(',') + '\\\\right)';\n    }\n  };\n  /**\n   * Get identifier.\n   * @return {string}\n   */\n\n\n  OperatorNode.prototype.getIdentifier = function () {\n    return this.type + ':' + this.fn;\n  };\n\n  return OperatorNode;\n}\n\nexports.name = 'OperatorNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  /**\n   * @constructor ParenthesisNode\n   * @extends {Node}\n   * A parenthesis node describes manual parenthesis from the user input\n   * @param {Node} content\n   * @extends {Node}\n   */\n\n  function ParenthesisNode(content) {\n    if (!(this instanceof ParenthesisNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (!type.isNode(content)) {\n      throw new TypeError('Node expected for parameter \"content\"');\n    }\n\n    this.content = content;\n  }\n\n  ParenthesisNode.prototype = new Node();\n  ParenthesisNode.prototype.type = 'ParenthesisNode';\n  ParenthesisNode.prototype.isParenthesisNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  ParenthesisNode.prototype._compile = function (math, argNames) {\n    return this.content._compile(math, argNames);\n  };\n  /**\n   * Get the content of the current Node.\n   * @return {Node} content\n   * @override\n   **/\n\n\n  ParenthesisNode.prototype.getContent = function () {\n    return this.content.getContent();\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  ParenthesisNode.prototype.forEach = function (callback) {\n    callback(this.content, 'content', this);\n  };\n  /**\n   * Create a new ParenthesisNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node) : Node} callback\n   * @returns {ParenthesisNode} Returns a clone of the node\n   */\n\n\n  ParenthesisNode.prototype.map = function (callback) {\n    var content = callback(this.content, 'content', this);\n    return new ParenthesisNode(content);\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {ParenthesisNode}\n   */\n\n\n  ParenthesisNode.prototype.clone = function () {\n    return new ParenthesisNode(this.content);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ParenthesisNode.prototype._toString = function (options) {\n    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n      return '(' + this.content.toString(options) + ')';\n    }\n\n    return this.content.toString(options);\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  ParenthesisNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'ParenthesisNode',\n      content: this.content\n    };\n  };\n  /**\n   * Instantiate an ParenthesisNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ParenthesisNode\", \"content\": ...}`,\n   *                       where mathjs is optional\n   * @returns {ParenthesisNode}\n   */\n\n\n  ParenthesisNode.fromJSON = function (json) {\n    return new ParenthesisNode(json.content);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ParenthesisNode.prototype.toHTML = function (options) {\n    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n      return '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + this.content.toHTML(options) + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    return this.content.toHTML(options);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  ParenthesisNode.prototype._toTex = function (options) {\n    if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n      return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n    }\n\n    return this.content.toTex(options);\n  };\n\n  return ParenthesisNode;\n}\n\nexports.name = 'ParenthesisNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar operators = require('../operators');\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n  /**\n   * @constructor RangeNode\n   * @extends {Node}\n   * create a range\n   * @param {Node} start  included lower-bound\n   * @param {Node} end    included upper-bound\n   * @param {Node} [step] optional step\n   */\n\n  function RangeNode(start, end, step) {\n    if (!(this instanceof RangeNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate inputs\n\n\n    if (!type.isNode(start)) throw new TypeError('Node expected');\n    if (!type.isNode(end)) throw new TypeError('Node expected');\n    if (step && !type.isNode(step)) throw new TypeError('Node expected');\n    if (arguments.length > 3) throw new Error('Too many arguments');\n    this.start = start; // included lower-bound\n\n    this.end = end; // included upper-bound\n\n    this.step = step || null; // optional step\n  }\n\n  RangeNode.prototype = new Node();\n  RangeNode.prototype.type = 'RangeNode';\n  RangeNode.prototype.isRangeNode = true;\n  /**\n   * Check whether the RangeNode needs the `end` symbol to be defined.\n   * This end is the size of the Matrix in current dimension.\n   * @return {boolean}\n   */\n\n  RangeNode.prototype.needsEnd = function () {\n    // find all `end` symbols in this RangeNode\n    var endSymbols = this.filter(function (node) {\n      return type.isSymbolNode(node) && node.name === 'end';\n    });\n    return endSymbols.length > 0;\n  };\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n\n  RangeNode.prototype._compile = function (math, argNames) {\n    var range = math.range;\n\n    var evalStart = this.start._compile(math, argNames);\n\n    var evalEnd = this.end._compile(math, argNames);\n\n    if (this.step) {\n      var evalStep = this.step._compile(math, argNames);\n\n      return function evalRangeNode(scope, args, context) {\n        return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));\n      };\n    } else {\n      return function evalRangeNode(scope, args, context) {\n        return range(evalStart(scope, args, context), evalEnd(scope, args, context));\n      };\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  RangeNode.prototype.forEach = function (callback) {\n    callback(this.start, 'start', this);\n    callback(this.end, 'end', this);\n\n    if (this.step) {\n      callback(this.step, 'step', this);\n    }\n  };\n  /**\n   * Create a new RangeNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {RangeNode} Returns a transformed copy of the node\n   */\n\n\n  RangeNode.prototype.map = function (callback) {\n    return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {RangeNode}\n   */\n\n\n  RangeNode.prototype.clone = function () {\n    return new RangeNode(this.start, this.end, this.step && this.step);\n  };\n  /**\n   * Calculate the necessary parentheses\n   * @param {Node} node\n   * @param {string} parenthesis\n   * @return {Object} parentheses\n   * @private\n   */\n\n\n  function calculateNecessaryParentheses(node, parenthesis) {\n    var precedence = operators.getPrecedence(node, parenthesis);\n    var parens = {};\n    var startPrecedence = operators.getPrecedence(node.start, parenthesis);\n    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n\n    if (node.step) {\n      var stepPrecedence = operators.getPrecedence(node.step, parenthesis);\n      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n    }\n\n    var endPrecedence = operators.getPrecedence(node.end, parenthesis);\n    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n    return parens;\n  }\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n    var str;\n    var start = this.start.toString(options);\n\n    if (parens.start) {\n      start = '(' + start + ')';\n    }\n\n    str = start;\n\n    if (this.step) {\n      var step = this.step.toString(options);\n\n      if (parens.step) {\n        step = '(' + step + ')';\n      }\n\n      str += ':' + step;\n    }\n\n    var end = this.end.toString(options);\n\n    if (parens.end) {\n      end = '(' + end + ')';\n    }\n\n    str += ':' + end;\n    return str;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  RangeNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'RangeNode',\n      start: this.start,\n      end: this.end,\n      step: this.step\n    };\n  };\n  /**\n   * Instantiate an RangeNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n   *                       where mathjs is optional\n   * @returns {RangeNode}\n   */\n\n\n  RangeNode.fromJSON = function (json) {\n    return new RangeNode(json.start, json.end, json.step);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis); // format string as start:step:stop\n\n    var str;\n    var start = this.start.toHTML(options);\n\n    if (parens.start) {\n      start = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + start + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    str = start;\n\n    if (this.step) {\n      var step = this.step.toHTML(options);\n\n      if (parens.step) {\n        step = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + step + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n      }\n\n      str += '<span class=\"math-operator math-range-operator\">:</span>' + step;\n    }\n\n    var end = this.end.toHTML(options);\n\n    if (parens.end) {\n      end = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + end + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n    }\n\n    str += '<span class=\"math-operator math-range-operator\">:</span>' + end;\n    return str;\n  };\n  /**\n   * Get LaTeX representation\n   * @params {Object} options\n   * @return {string} str\n   */\n\n\n  RangeNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var parens = calculateNecessaryParentheses(this, parenthesis);\n    var str = this.start.toTex(options);\n\n    if (parens.start) {\n      str = \"\\\\left(\".concat(str, \"\\\\right)\");\n    }\n\n    if (this.step) {\n      var step = this.step.toTex(options);\n\n      if (parens.step) {\n        step = \"\\\\left(\".concat(step, \"\\\\right)\");\n      }\n\n      str += ':' + step;\n    }\n\n    var end = this.end.toTex(options);\n\n    if (parens.end) {\n      end = \"\\\\left(\".concat(end, \"\\\\right)\");\n    }\n\n    str += ':' + end;\n    return str;\n  };\n\n  return RangeNode;\n}\n\nexports.name = 'RangeNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar operators = require('../operators');\n\nvar latex = require('../../utils/latex');\n\nvar escape = require('../../utils/string').escape;\n\nfunction factory(type, config, load, typed) {\n  var Node = load(require('./Node'));\n\n  var getSafeProperty = require('../../utils/customs').getSafeProperty;\n  /**\n   * A node representing a chained conditional expression, such as 'x > y > z'\n   *\n   * @param {String[]} conditionals   An array of conditional operators used to compare the parameters\n   * @param {Node[]} params   The parameters that will be compared\n   *\n   * @constructor RelationalNode\n   * @extends {Node}\n   */\n\n\n  function RelationalNode(conditionals, params) {\n    if (!(this instanceof RelationalNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (!Array.isArray(conditionals)) throw new TypeError('Parameter conditionals must be an array');\n    if (!Array.isArray(params)) throw new TypeError('Parameter params must be an array');\n    if (conditionals.length !== params.length - 1) throw new TypeError('Parameter params must contain exactly one more element than parameter conditionals');\n    this.conditionals = conditionals;\n    this.params = params;\n  }\n\n  RelationalNode.prototype = new Node();\n  RelationalNode.prototype.type = 'RelationalNode';\n  RelationalNode.prototype.isRelationalNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  RelationalNode.prototype._compile = function (math, argNames) {\n    var self = this;\n    var compiled = this.params.map(function (p) {\n      return p._compile(math, argNames);\n    });\n    return function evalRelationalNode(scope, args, context) {\n      var evalLhs;\n      var evalRhs = compiled[0](scope, args, context);\n\n      for (var i = 0; i < self.conditionals.length; i++) {\n        evalLhs = evalRhs;\n        evalRhs = compiled[i + 1](scope, args, context);\n        var condFn = getSafeProperty(math, self.conditionals[i]);\n\n        if (!condFn(evalLhs, evalRhs)) {\n          return false;\n        }\n      }\n\n      return true;\n    };\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  RelationalNode.prototype.forEach = function (callback) {\n    var _this = this;\n\n    this.params.forEach(function (n, i) {\n      return callback(n, 'params[' + i + ']', _this);\n    }, this);\n  };\n  /**\n   * Create a new RelationalNode having its childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node): Node} callback\n   * @returns {RelationalNode} Returns a transformed copy of the node\n   */\n\n\n  RelationalNode.prototype.map = function (callback) {\n    var _this2 = this;\n\n    return new RelationalNode(this.conditionals.slice(), this.params.map(function (n, i) {\n      return _this2._ifNode(callback(n, 'params[' + i + ']', _this2));\n    }, this));\n  };\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {RelationalNode}\n   */\n\n\n  RelationalNode.prototype.clone = function () {\n    return new RelationalNode(this.conditionals, this.params);\n  };\n  /**\n   * Get string representation.\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype._toString = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = operators.getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = operators.getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n    });\n    var operatorMap = {\n      'equal': '==',\n      'unequal': '!=',\n      'smaller': '<',\n      'larger': '>',\n      'smallerEq': '<=',\n      'largerEq': '>='\n    };\n    var ret = paramStrings[0];\n\n    for (var i = 0; i < this.conditionals.length; i++) {\n      ret += ' ' + operatorMap[this.conditionals[i]] + ' ' + paramStrings[i + 1];\n    }\n\n    return ret;\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  RelationalNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'RelationalNode',\n      conditionals: this.conditionals,\n      params: this.params\n    };\n  };\n  /**\n   * Instantiate a RelationalNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"RelationalNode\", \"condition\": ..., \"trueExpr\": ..., \"falseExpr\": ...}`,\n   *                       where mathjs is optional\n   * @returns {RelationalNode}\n   */\n\n\n  RelationalNode.fromJSON = function (json) {\n    return new RelationalNode(json.conditionals, json.params);\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype.toHTML = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = operators.getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = operators.getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + p.toHTML(options) + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>' : p.toHTML(options);\n    });\n    var operatorMap = {\n      'equal': '==',\n      'unequal': '!=',\n      'smaller': '<',\n      'larger': '>',\n      'smallerEq': '<=',\n      'largerEq': '>='\n    };\n    var ret = paramStrings[0];\n\n    for (var i = 0; i < this.conditionals.length; i++) {\n      ret += '<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">' + escape(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];\n    }\n\n    return ret;\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   */\n\n\n  RelationalNode.prototype._toTex = function (options) {\n    var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n    var precedence = operators.getPrecedence(this, parenthesis);\n    var paramStrings = this.params.map(function (p, index) {\n      var paramPrecedence = operators.getPrecedence(p, parenthesis);\n      return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n    });\n    var ret = paramStrings[0];\n\n    for (var i = 0; i < this.conditionals.length; i++) {\n      ret += latex.operators[this.conditionals[i]] + paramStrings[i + 1];\n    }\n\n    return ret;\n  };\n\n  return RelationalNode;\n}\n\nexports.name = 'RelationalNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nvar latex = require('../../utils/latex');\n\nvar escape = require('../../utils/string').escape;\n\nvar hasOwnProperty = require('../../utils/object').hasOwnProperty;\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nfunction factory(type, config, load, typed, math) {\n  var Node = load(require('./Node'));\n  /**\n   * Check whether some name is a valueless unit like \"inch\".\n   * @param {string} name\n   * @return {boolean}\n   */\n\n  function isValuelessUnit(name) {\n    return type.Unit ? type.Unit.isValuelessUnit(name) : false;\n  }\n  /**\n   * @constructor SymbolNode\n   * @extends {Node}\n   * A symbol node can hold and resolve a symbol\n   * @param {string} name\n   * @extends {Node}\n   */\n\n\n  function SymbolNode(name) {\n    if (!(this instanceof SymbolNode)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // validate input\n\n\n    if (typeof name !== 'string') throw new TypeError('String expected for parameter \"name\"');\n    this.name = name;\n  }\n\n  SymbolNode.prototype = new Node();\n  SymbolNode.prototype.type = 'SymbolNode';\n  SymbolNode.prototype.isSymbolNode = true;\n  /**\n   * Compile a node into a JavaScript function.\n   * This basically pre-calculates as much as possible and only leaves open\n   * calculations which depend on a dynamic scope with variables.\n   * @param {Object} math     Math.js namespace with functions and constants.\n   * @param {Object} argNames An object with argument names as key and `true`\n   *                          as value. Used in the SymbolNode to optimize\n   *                          for arguments from user assigned functions\n   *                          (see FunctionAssignmentNode) or special symbols\n   *                          like `end` (see IndexNode).\n   * @return {function} Returns a function which can be called like:\n   *                        evalNode(scope: Object, args: Object, context: *)\n   */\n\n  SymbolNode.prototype._compile = function (math, argNames) {\n    var name = this.name;\n\n    if (hasOwnProperty(argNames, name)) {\n      // this is a FunctionAssignment argument\n      // (like an x when inside the expression of a function assignment `f(x) = ...`)\n      return function (scope, args, context) {\n        return args[name];\n      };\n    } else if (name in math) {\n      return function (scope, args, context) {\n        return name in scope ? getSafeProperty(scope, name) : getSafeProperty(math, name);\n      };\n    } else {\n      var isUnit = isValuelessUnit(name);\n      return function (scope, args, context) {\n        return name in scope ? getSafeProperty(scope, name) : isUnit ? new type.Unit(null, name) : undef(name);\n      };\n    }\n  };\n  /**\n   * Execute a callback for each of the child nodes of this node\n   * @param {function(child: Node, path: string, parent: Node)} callback\n   */\n\n\n  SymbolNode.prototype.forEach = function (callback) {} // nothing to do, we don't have childs\n\n  /**\n   * Create a new SymbolNode having it's childs be the results of calling\n   * the provided callback function for each of the childs of the original node.\n   * @param {function(child: Node, path: string, parent: Node) : Node} callback\n   * @returns {SymbolNode} Returns a clone of the node\n   */\n  ;\n\n  SymbolNode.prototype.map = function (callback) {\n    return this.clone();\n  };\n  /**\n   * Throws an error 'Undefined symbol {name}'\n   * @param {string} name\n   */\n\n\n  function undef(name) {\n    throw new Error('Undefined symbol ' + name);\n  }\n  /**\n   * Create a clone of this node, a shallow copy\n   * @return {SymbolNode}\n   */\n\n\n  SymbolNode.prototype.clone = function () {\n    return new SymbolNode(this.name);\n  };\n  /**\n   * Get string representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype._toString = function (options) {\n    return this.name;\n  };\n  /**\n   * Get HTML representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype.toHTML = function (options) {\n    var name = escape(this.name);\n\n    if (name === 'true' || name === 'false') {\n      return '<span class=\"math-symbol math-boolean\">' + name + '</span>';\n    } else if (name === 'i') {\n      return '<span class=\"math-symbol math-imaginary-symbol\">' + name + '</span>';\n    } else if (name === 'Infinity') {\n      return '<span class=\"math-symbol math-infinity-symbol\">' + name + '</span>';\n    } else if (name === 'NaN') {\n      return '<span class=\"math-symbol math-nan-symbol\">' + name + '</span>';\n    } else if (name === 'null') {\n      return '<span class=\"math-symbol math-null-symbol\">' + name + '</span>';\n    } else if (name === 'undefined') {\n      return '<span class=\"math-symbol math-undefined-symbol\">' + name + '</span>';\n    }\n\n    return '<span class=\"math-symbol\">' + name + '</span>';\n  };\n  /**\n   * Get a JSON representation of the node\n   * @returns {Object}\n   */\n\n\n  SymbolNode.prototype.toJSON = function () {\n    return {\n      mathjs: 'SymbolNode',\n      name: this.name\n    };\n  };\n  /**\n   * Instantiate a SymbolNode from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SymbolNode\", name: \"x\"}`,\n   *                       where mathjs is optional\n   * @returns {SymbolNode}\n   */\n\n\n  SymbolNode.fromJSON = function (json) {\n    return new SymbolNode(json.name);\n  };\n  /**\n   * Get LaTeX representation\n   * @param {Object} options\n   * @return {string} str\n   * @override\n   */\n\n\n  SymbolNode.prototype._toTex = function (options) {\n    var isUnit = false;\n\n    if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n      isUnit = true;\n    }\n\n    var symbol = latex.toSymbol(this.name, isUnit);\n\n    if (symbol[0] === '\\\\') {\n      // no space needed if the symbol starts with '\\'\n      return symbol;\n    } // the space prevents symbols from breaking stuff like '\\cdot' if it's written right before the symbol\n\n\n    return ' ' + symbol;\n  };\n\n  return SymbolNode;\n}\n\nexports.name = 'SymbolNode';\nexports.path = 'expression.node';\nexports.math = true; // request access to the math namespace as 5th argument of the factory function\n\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * @constructor UpdateNode\n   */\n  function UpdateNode() {\n    // TODO: deprecated since v3. Cleanup some day\n    throw new Error('UpdateNode is deprecated. Use AssignmentNode instead.');\n  }\n\n  return UpdateNode;\n}\n\nexports.name = 'UpdateNode';\nexports.path = 'expression.node';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./AccessorNode'), require('./ArrayNode'), require('./AssignmentNode'), require('./BlockNode'), require('./ConditionalNode'), require('./ConstantNode'), require('./IndexNode'), require('./FunctionAssignmentNode'), require('./FunctionNode'), require('./Node'), require('./ObjectNode'), require('./OperatorNode'), require('./ParenthesisNode'), require('./RangeNode'), require('./RelationalNode'), require('./SymbolNode'), require('./UpdateNode')];","'use strict';\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\nvar errorTransform = require('../../transform/error.transform').transform;\n\nvar getSafeProperty = require('../../../utils/customs').getSafeProperty;\n\nfunction factory(type, config, load, typed) {\n  var subset = load(require('../../../function/matrix/subset'));\n  /**\n   * Retrieve part of an object:\n   *\n   * - Retrieve a property from an object\n   * - Retrieve a part of a string\n   * - Retrieve a matrix subset\n   *\n   * @param {Object | Array | Matrix | string} object\n   * @param {Index} index\n   * @return {Object | Array | Matrix | string} Returns the subset\n   */\n\n  return function access(object, index) {\n    try {\n      if (Array.isArray(object)) {\n        return subset(object, index);\n      } else if (object && typeof object.subset === 'function') {\n        // Matrix\n        return object.subset(index);\n      } else if (typeof object === 'string') {\n        // TODO: move getStringSubset into a separate util file, use that\n        return subset(object, index);\n      } else if (_typeof(object) === 'object') {\n        if (!index.isObjectProperty()) {\n          throw new TypeError('Cannot apply a numeric index as object property');\n        }\n\n        return getSafeProperty(object, index.getObjectProperty());\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object');\n      }\n    } catch (err) {\n      throw errorTransform(err);\n    }\n  };\n}\n\nexports.factory = factory;","'use strict';\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\nvar errorTransform = require('../../transform/error.transform').transform;\n\nvar setSafeProperty = require('../../../utils/customs').setSafeProperty;\n\nfunction factory(type, config, load, typed) {\n  var subset = load(require('../../../function/matrix/subset'));\n  var matrix = load(require('../../../type/matrix/function/matrix'));\n  /**\n   * Replace part of an object:\n   *\n   * - Assign a property to an object\n   * - Replace a part of a string\n   * - Replace a matrix subset\n   *\n   * @param {Object | Array | Matrix | string} object\n   * @param {Index} index\n   * @param {*} value\n   * @return {Object | Array | Matrix | string} Returns the original object\n   *                                            except in case of a string\n   */\n  // TODO: change assign to return the value instead of the object\n\n  return function assign(object, index, value) {\n    try {\n      if (Array.isArray(object)) {\n        return matrix(object).subset(index, value).valueOf();\n      } else if (object && typeof object.subset === 'function') {\n        // Matrix\n        return object.subset(index, value);\n      } else if (typeof object === 'string') {\n        // TODO: move setStringSubset into a separate util file, use that\n        return subset(object, index, value);\n      } else if (_typeof(object) === 'object') {\n        if (!index.isObjectProperty()) {\n          throw TypeError('Cannot apply a numeric index as object property');\n        }\n\n        setSafeProperty(object, index.getObjectProperty(), value);\n        return object;\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object');\n      }\n    } catch (err) {\n      throw errorTransform(err);\n    }\n  };\n}\n\nexports.factory = factory;","'use strict'; // list of identifiers of nodes in order of their precedence\n// also contains information about left/right associativity\n// and which other operator the operator is associative with\n// Example:\n// addition is associative with addition and subtraction, because:\n// (a+b)+c=a+(b+c)\n// (a+b)-c=a+(b-c)\n//\n// postfix operators are left associative, prefix operators\n// are right associative\n//\n// It's also possible to set the following properties:\n// latexParens: if set to false, this node doesn't need to be enclosed\n//              in parentheses when using LaTeX\n// latexLeftParens: if set to false, this !OperatorNode's!\n//                  left argument doesn't need to be enclosed\n//                  in parentheses\n// latexRightParens: the same for the right argument\n\nvar properties = [{\n  // assignment\n  'AssignmentNode': {},\n  'FunctionAssignmentNode': {}\n}, {\n  // conditional expression\n  'ConditionalNode': {\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false // conditionals don't need parentheses in LaTeX because\n    // they are 2 dimensional\n\n  }\n}, {\n  // logical or\n  'OperatorNode:or': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // logical xor\n  'OperatorNode:xor': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // logical and\n  'OperatorNode:and': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitwise or\n  'OperatorNode:bitOr': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitwise xor\n  'OperatorNode:bitXor': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitwise and\n  'OperatorNode:bitAnd': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // relational operators\n  'OperatorNode:equal': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:unequal': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:smaller': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:larger': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:smallerEq': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:largerEq': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'RelationalNode': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitshift operators\n  'OperatorNode:leftShift': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:rightArithShift': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:rightLogShift': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // unit conversion\n  'OperatorNode:to': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // range\n  'RangeNode': {}\n}, {\n  // addition, subtraction\n  'OperatorNode:add': {\n    associativity: 'left',\n    associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n  },\n  'OperatorNode:subtract': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // multiply, divide, modulus\n  'OperatorNode:multiply': {\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n  },\n  'OperatorNode:divide': {\n    associativity: 'left',\n    associativeWith: [],\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false // fractions don't require parentheses because\n    // they're 2 dimensional, so parens aren't needed\n    // in LaTeX\n\n  },\n  'OperatorNode:dotMultiply': {\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\n  },\n  'OperatorNode:dotDivide': {\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:mod': {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // unary prefix operators\n  'OperatorNode:unaryPlus': {\n    associativity: 'right'\n  },\n  'OperatorNode:unaryMinus': {\n    associativity: 'right'\n  },\n  'OperatorNode:bitNot': {\n    associativity: 'right'\n  },\n  'OperatorNode:not': {\n    associativity: 'right'\n  }\n}, {\n  // exponentiation\n  'OperatorNode:pow': {\n    associativity: 'right',\n    associativeWith: [],\n    latexRightParens: false // the exponent doesn't need parentheses in\n    // LaTeX because it's 2 dimensional\n    // (it's on top)\n\n  },\n  'OperatorNode:dotPow': {\n    associativity: 'right',\n    associativeWith: []\n  }\n}, {\n  // factorial\n  'OperatorNode:factorial': {\n    associativity: 'left'\n  }\n}, {\n  // matrix transpose\n  'OperatorNode:transpose': {\n    associativity: 'left'\n  }\n}];\n/**\n * Get the precedence of a Node.\n * Higher number for higher precedence, starting with 0.\n * Returns null if the precedence is undefined.\n *\n * @param {Node}\n * @param {string} parenthesis\n * @return {number|null}\n */\n\nfunction getPrecedence(_node, parenthesis) {\n  var node = _node;\n\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n\n  var identifier = node.getIdentifier();\n\n  for (var i = 0; i < properties.length; i++) {\n    if (identifier in properties[i]) {\n      return i;\n    }\n  }\n\n  return null;\n}\n/**\n * Get the associativity of an operator (left or right).\n * Returns a string containing 'left' or 'right' or null if\n * the associativity is not defined.\n *\n * @param {Node}\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\n\n\nfunction getAssociativity(_node, parenthesis) {\n  var node = _node;\n\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n\n  var identifier = node.getIdentifier();\n  var index = getPrecedence(node, parenthesis);\n\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n\n  var property = properties[index][identifier];\n\n  if (property.hasOwnProperty('associativity')) {\n    if (property.associativity === 'left') {\n      return 'left';\n    }\n\n    if (property.associativity === 'right') {\n      return 'right';\n    } // associativity is invalid\n\n\n    throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n  } // associativity is undefined\n\n\n  return null;\n}\n/**\n * Check if an operator is associative with another operator.\n * Returns either true or false or null if not defined.\n *\n * @param {Node} nodeA\n * @param {Node} nodeB\n * @param {string} parenthesis\n * @return {bool|null}\n */\n\n\nfunction isAssociativeWith(nodeA, nodeB, parenthesis) {\n  // ParenthesisNodes are only ignored when not in 'keep' mode\n  var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;\n  var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;\n  var identifierA = a.getIdentifier();\n  var identifierB = b.getIdentifier();\n  var index = getPrecedence(a, parenthesis);\n\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n\n  var property = properties[index][identifierA];\n\n  if (property.hasOwnProperty('associativeWith') && property.associativeWith instanceof Array) {\n    for (var i = 0; i < property.associativeWith.length; i++) {\n      if (property.associativeWith[i] === identifierB) {\n        return true;\n      }\n    }\n\n    return false;\n  } // associativeWith is not defined\n\n\n  return null;\n}\n\nmodule.exports.properties = properties;\nmodule.exports.getPrecedence = getPrecedence;\nmodule.exports.getAssociativity = getAssociativity;\nmodule.exports.isAssociativeWith = isAssociativeWith;","'use strict';\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\nvar ArgumentsError = require('../error/ArgumentsError');\n\nvar deepMap = require('../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var numeric = load(require('../type/numeric'));\n  var AccessorNode = load(require('./node/AccessorNode'));\n  var ArrayNode = load(require('./node/ArrayNode'));\n  var AssignmentNode = load(require('./node/AssignmentNode'));\n  var BlockNode = load(require('./node/BlockNode'));\n  var ConditionalNode = load(require('./node/ConditionalNode'));\n  var ConstantNode = load(require('./node/ConstantNode'));\n  var FunctionAssignmentNode = load(require('./node/FunctionAssignmentNode'));\n  var IndexNode = load(require('./node/IndexNode'));\n  var ObjectNode = load(require('./node/ObjectNode'));\n  var OperatorNode = load(require('./node/OperatorNode'));\n  var ParenthesisNode = load(require('./node/ParenthesisNode'));\n  var FunctionNode = load(require('./node/FunctionNode'));\n  var RangeNode = load(require('./node/RangeNode'));\n  var RelationalNode = load(require('./node/RelationalNode'));\n  var SymbolNode = load(require('./node/SymbolNode'));\n  /**\n   * Parse an expression. Returns a node tree, which can be evaluated by\n   * invoking node.eval().\n   *\n   * Syntax:\n   *\n   *     parse(expr)\n   *     parse(expr, options)\n   *     parse([expr1, expr2, expr3, ...])\n   *     parse([expr1, expr2, expr3, ...], options)\n   *\n   * Example:\n   *\n   *     const node = parse('sqrt(3^2 + 4^2)')\n   *     node.compile(math).eval() // 5\n   *\n   *     let scope = {a:3, b:4}\n   *     const node = parse('a * b') // 12\n   *     const code = node.compile(math)\n   *     code.eval(scope) // 12\n   *     scope.a = 5\n   *     code.eval(scope) // 20\n   *\n   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].compile(math).eval() // 12\n   *\n   * @param {string | string[] | Matrix} expr\n   * @param {{nodes: Object<string, Node>}} [options]  Available options:\n   *                                                   - `nodes` a set of custom nodes\n   * @return {Node | Node[]} node\n   * @throws {Error}\n   */\n\n  function parse(expr, options) {\n    if (arguments.length !== 1 && arguments.length !== 2) {\n      throw new ArgumentsError('parse', arguments.length, 1, 2);\n    } // pass extra nodes\n\n\n    var extraNodes = options && options.nodes ? options.nodes : {};\n\n    if (typeof expr === 'string') {\n      // parse a single expression\n      return parseStart(expr, extraNodes);\n    } else if (Array.isArray(expr) || expr instanceof type.Matrix) {\n      // parse an array or matrix with expressions\n      return deepMap(expr, function (elem) {\n        if (typeof elem !== 'string') throw new TypeError('String expected');\n        return parseStart(elem, extraNodes);\n      });\n    } else {\n      // oops\n      throw new TypeError('String or matrix expected');\n    }\n  } // token types enumeration\n\n\n  var TOKENTYPE = {\n    NULL: 0,\n    DELIMITER: 1,\n    NUMBER: 2,\n    SYMBOL: 3,\n    UNKNOWN: 4 // map with all delimiters\n\n  };\n  var DELIMITERS = {\n    ',': true,\n    '(': true,\n    ')': true,\n    '[': true,\n    ']': true,\n    '{': true,\n    '}': true,\n    '\"': true,\n    '\\'': true,\n    ';': true,\n    '+': true,\n    '-': true,\n    '*': true,\n    '.*': true,\n    '/': true,\n    './': true,\n    '%': true,\n    '^': true,\n    '.^': true,\n    '~': true,\n    '!': true,\n    '&': true,\n    '|': true,\n    '^|': true,\n    '=': true,\n    ':': true,\n    '?': true,\n    '==': true,\n    '!=': true,\n    '<': true,\n    '>': true,\n    '<=': true,\n    '>=': true,\n    '<<': true,\n    '>>': true,\n    '>>>': true // map with all named delimiters\n\n  };\n  var NAMED_DELIMITERS = {\n    'mod': true,\n    'to': true,\n    'in': true,\n    'and': true,\n    'xor': true,\n    'or': true,\n    'not': true\n  };\n  var CONSTANTS = {\n    'true': true,\n    'false': false,\n    'null': null,\n    'undefined': undefined\n  };\n  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n\n  function initialState() {\n    return {\n      extraNodes: {},\n      // current extra nodes, must be careful not to mutate\n      expression: '',\n      // current expression\n      comment: '',\n      // last parsed comment\n      index: 0,\n      // current index in expr\n      token: '',\n      // current token\n      tokenType: TOKENTYPE.NULL,\n      // type of the token\n      nestingLevel: 0,\n      // level of nesting inside parameters, used to ignore newline characters\n      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here\n\n    };\n  }\n  /**\n   * View upto `length` characters of the expression starting at the current character.\n   *\n   * @param {State} state\n   * @param {number} [length=1] Number of characters to view\n   * @returns {string}\n   * @private\n   */\n\n\n  function currentString(state, length) {\n    return state.expression.substr(state.index, length);\n  }\n  /**\n   * View the current character. Returns '' if end of expression is reached.\n   *\n   * @param {State} state\n   * @returns {string}\n   * @private\n   */\n\n\n  function currentCharacter(state) {\n    return currentString(state, 1);\n  }\n  /**\n   * Get the next character from the expression.\n   * The character is stored into the char c. If the end of the expression is\n   * reached, the function puts an empty string in c.\n   * @private\n   */\n\n\n  function next(state) {\n    state.index++;\n  }\n  /**\n   * Preview the previous character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n\n\n  function prevCharacter(state) {\n    return state.expression.charAt(state.index - 1);\n  }\n  /**\n   * Preview the next character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n\n\n  function nextCharacter(state) {\n    return state.expression.charAt(state.index + 1);\n  }\n  /**\n   * Get next token in the current string expr.\n   * The token and token type are available as token and tokenType\n   * @private\n   */\n\n\n  function getToken(state) {\n    state.tokenType = TOKENTYPE.NULL;\n    state.token = '';\n    state.comment = ''; // skip over whitespaces\n    // space, tab, and newline when inside parameters\n\n    while (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n      next(state);\n    } // skip comment\n\n\n    if (currentCharacter(state) === '#') {\n      while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n        state.comment += currentCharacter(state);\n        next(state);\n      }\n    } // check for end of expression\n\n\n    if (currentCharacter(state) === '') {\n      // token is still empty\n      state.tokenType = TOKENTYPE.DELIMITER;\n      return;\n    } // check for new line character\n\n\n    if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = currentCharacter(state);\n      next(state);\n      return;\n    }\n\n    var c1 = currentCharacter(state);\n    var c2 = currentString(state, 2);\n    var c3 = currentString(state, 3);\n\n    if (c3.length === 3 && DELIMITERS[c3]) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = c3;\n      next(state);\n      next(state);\n      next(state);\n      return;\n    } // check for delimiters consisting of 2 characters\n\n\n    if (c2.length === 2 && DELIMITERS[c2]) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = c2;\n      next(state);\n      next(state);\n      return;\n    } // check for delimiters consisting of 1 character\n\n\n    if (DELIMITERS[c1]) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = c1;\n      next(state);\n      return;\n    } // check for a number\n\n\n    if (parse.isDigitDot(c1)) {\n      state.tokenType = TOKENTYPE.NUMBER; // get number, can have a single dot\n\n      if (currentCharacter(state) === '.') {\n        state.token += currentCharacter(state);\n        next(state);\n\n        if (!parse.isDigit(currentCharacter(state))) {\n          // this is no number, it is just a dot (can be dot notation)\n          state.tokenType = TOKENTYPE.DELIMITER;\n        }\n      } else {\n        while (parse.isDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n\n        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n      }\n\n      while (parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state);\n        next(state);\n      } // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n\n\n      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {\n        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {\n          state.token += currentCharacter(state);\n          next(state);\n\n          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n            state.token += currentCharacter(state);\n            next(state);\n          } // Scientific notation MUST be followed by an exponent\n\n\n          if (!parse.isDigit(currentCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n          }\n\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state);\n            next(state);\n          }\n\n          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n          }\n        } else if (nextCharacter(state) === '.') {\n          next(state);\n          throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n        }\n      }\n\n      return;\n    } // check for variables, functions, named operators\n\n\n    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {\n      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state);\n        next(state);\n      }\n\n      if (NAMED_DELIMITERS.hasOwnProperty(state.token)) {\n        state.tokenType = TOKENTYPE.DELIMITER;\n      } else {\n        state.tokenType = TOKENTYPE.SYMBOL;\n      }\n\n      return;\n    } // something unknown is found, wrong characters -> a syntax error\n\n\n    state.tokenType = TOKENTYPE.UNKNOWN;\n\n    while (currentCharacter(state) !== '') {\n      state.token += currentCharacter(state);\n      next(state);\n    }\n\n    throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n  }\n  /**\n   * Get next token and skip newline tokens\n   */\n\n\n  function getTokenSkipNewline(state) {\n    do {\n      getToken(state);\n    } while (state.token === '\\n'); // eslint-disable-line no-unmodified-loop-condition\n\n  }\n  /**\n   * Open parameters.\n   * New line characters will be ignored until closeParams(state) is called\n   */\n\n\n  function openParams(state) {\n    state.nestingLevel++;\n  }\n  /**\n   * Close parameters.\n   * New line characters will no longer be ignored\n   */\n\n\n  function closeParams(state) {\n    state.nestingLevel--;\n  }\n  /**\n   * Checks whether the current character `c` is a valid alpha character:\n   *\n   * - A latin letter (upper or lower case) Ascii: a-z, A-Z\n   * - An underscore                        Ascii: _\n   * - A dollar sign                        Ascii: $\n   * - A latin letter with accents          Unicode: \\u00C0 - \\u02AF\n   * - A greek letter                       Unicode: \\u0370 - \\u03FF\n   * - A mathematical alphanumeric symbol   Unicode: \\u{1D400} - \\u{1D7FF} excluding invalid code points\n   *\n   * The previous and next characters are needed to determine whether\n   * this character is part of a unicode surrogate pair.\n   *\n   * @param {string} c      Current character in the expression\n   * @param {string} cPrev  Previous character\n   * @param {string} cNext  Next character\n   * @return {boolean}\n   */\n\n\n  parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\n  };\n  /**\n   * Test whether a character is a valid latin, greek, or letter-like character\n   * @param {string} c\n   * @return {boolean}\n   */\n\n\n  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n    return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\n  };\n  /**\n   * Test whether two given 16 bit characters form a surrogate pair of a\n   * unicode math symbol.\n   *\n   * https://unicode-table.com/en/\n   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode\n   *\n   * Note: In ES6 will be unicode aware:\n   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes\n   * https://mathiasbynens.be/notes/es6-unicode-regex\n   *\n   * @param {string} high\n   * @param {string} low\n   * @return {boolean}\n   */\n\n\n  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {\n    return /^[\\uD835]$/.test(high) && /^[\\uDC00-\\uDFFF]$/.test(low) && /^[^\\uDC55\\uDC9D\\uDCA0\\uDCA1\\uDCA3\\uDCA4\\uDCA7\\uDCA8\\uDCAD\\uDCBA\\uDCBC\\uDCC4\\uDD06\\uDD0B\\uDD0C\\uDD15\\uDD1D\\uDD3A\\uDD3F\\uDD45\\uDD47-\\uDD49\\uDD51\\uDEA6\\uDEA7\\uDFCC\\uDFCD]$/.test(low);\n  };\n  /**\n   * Check whether given character c is a white space character: space, tab, or enter\n   * @param {string} c\n   * @param {number} nestingLevel\n   * @return {boolean}\n   */\n\n\n  parse.isWhitespace = function isWhitespace(c, nestingLevel) {\n    // TODO: also take '\\r' carriage return as newline? Or does that give problems on mac?\n    return c === ' ' || c === '\\t' || c === '\\n' && nestingLevel > 0;\n  };\n  /**\n   * Test whether the character c is a decimal mark (dot).\n   * This is the case when it's not the start of a delimiter '.*', './', or '.^'\n   * @param {string} c\n   * @param {string} cNext\n   * @return {boolean}\n   */\n\n\n  parse.isDecimalMark = function isDecimalMark(c, cNext) {\n    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\n  };\n  /**\n   * checks if the given char c is a digit or dot\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n\n\n  parse.isDigitDot = function isDigitDot(c) {\n    return c >= '0' && c <= '9' || c === '.';\n  };\n  /**\n   * checks if the given char c is a digit\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n\n\n  parse.isDigit = function isDigit(c) {\n    return c >= '0' && c <= '9';\n  };\n  /**\n   * Start of the parse levels below, in order of precedence\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseStart(expression, extraNodes) {\n    var state = initialState();\n\n    _extends(state, {\n      expression: expression,\n      extraNodes: extraNodes\n    });\n\n    getToken(state);\n    var node = parseBlock(state); // check for garbage at the end of the expression\n    // an expression ends with a empty character '' and tokenType DELIMITER\n\n    if (state.token !== '') {\n      if (state.tokenType === TOKENTYPE.DELIMITER) {\n        // user entered a not existing operator like \"//\"\n        // TODO: give hints for aliases, for example with \"<>\" give as hint \" did you mean !== ?\"\n        throw createError(state, 'Unexpected operator ' + state.token);\n      } else {\n        throw createSyntaxError(state, 'Unexpected part \"' + state.token + '\"');\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Parse a block with expressions. Expressions can be separated by a newline\n   * character '\\n', or by a semicolon ';'. In case of a semicolon, no output\n   * of the preceding line is returned.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBlock(state) {\n    var node;\n    var blocks = [];\n    var visible;\n\n    if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n      node = parseAssignment(state);\n      node.comment = state.comment;\n    } // TODO: simplify this loop\n\n\n    while (state.token === '\\n' || state.token === ';') {\n      // eslint-disable-line no-unmodified-loop-condition\n      if (blocks.length === 0 && node) {\n        visible = state.token !== ';';\n        blocks.push({\n          node: node,\n          visible: visible\n        });\n      }\n\n      getToken(state);\n\n      if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n        node = parseAssignment(state);\n        node.comment = state.comment;\n        visible = state.token !== ';';\n        blocks.push({\n          node: node,\n          visible: visible\n        });\n      }\n    }\n\n    if (blocks.length > 0) {\n      return new BlockNode(blocks);\n    } else {\n      if (!node) {\n        node = new ConstantNode(undefined);\n        node.comment = state.comment;\n      }\n\n      return node;\n    }\n  }\n  /**\n   * Assignment of a function or variable,\n   * - can be a variable like 'a=2.3'\n   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'\n   * - defining a function like 'f(x) = x^2'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseAssignment(state) {\n    var name, args, value, valid;\n    var node = parseConditional(state);\n\n    if (state.token === '=') {\n      if (type.isSymbolNode(node)) {\n        // parse a variable assignment like 'a = 2/3'\n        name = node.name;\n        getTokenSkipNewline(state);\n        value = parseAssignment(state);\n        return new AssignmentNode(new SymbolNode(name), value);\n      } else if (type.isAccessorNode(node)) {\n        // parse a matrix subset assignment like 'A[1,2] = 4'\n        getTokenSkipNewline(state);\n        value = parseAssignment(state);\n        return new AssignmentNode(node.object, node.index, value);\n      } else if (type.isFunctionNode(node) && type.isSymbolNode(node.fn)) {\n        // parse function assignment like 'f(x) = x^2'\n        valid = true;\n        args = [];\n        name = node.name;\n        node.args.forEach(function (arg, index) {\n          if (type.isSymbolNode(arg)) {\n            args[index] = arg.name;\n          } else {\n            valid = false;\n          }\n        });\n\n        if (valid) {\n          getTokenSkipNewline(state);\n          value = parseAssignment(state);\n          return new FunctionAssignmentNode(name, args, value);\n        }\n      }\n\n      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');\n    }\n\n    return node;\n  }\n  /**\n   * conditional operation\n   *\n   *     condition ? truePart : falsePart\n   *\n   * Note: conditional operator is right-associative\n   *\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseConditional(state) {\n    var node = parseLogicalOr(state);\n\n    while (state.token === '?') {\n      // eslint-disable-line no-unmodified-loop-condition\n      // set a conditional level, the range operator will be ignored as long\n      // as conditionalLevel === state.nestingLevel.\n      var prev = state.conditionalLevel;\n      state.conditionalLevel = state.nestingLevel;\n      getTokenSkipNewline(state);\n      var condition = node;\n      var trueExpr = parseAssignment(state);\n      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');\n      state.conditionalLevel = null;\n      getTokenSkipNewline(state);\n      var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity\n\n      node = new ConditionalNode(condition, trueExpr, falseExpr); // restore the previous conditional level\n\n      state.conditionalLevel = prev;\n    }\n\n    return node;\n  }\n  /**\n   * logical or, 'x or y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalOr(state) {\n    var node = parseLogicalXor(state);\n\n    while (state.token === 'or') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);\n    }\n\n    return node;\n  }\n  /**\n   * logical exclusive or, 'x xor y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalXor(state) {\n    var node = parseLogicalAnd(state);\n\n    while (state.token === 'xor') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);\n    }\n\n    return node;\n  }\n  /**\n   * logical and, 'x and y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLogicalAnd(state) {\n    var node = parseBitwiseOr(state);\n\n    while (state.token === 'and') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);\n    }\n\n    return node;\n  }\n  /**\n   * bitwise or, 'x | y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseOr(state) {\n    var node = parseBitwiseXor(state);\n\n    while (state.token === '|') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);\n    }\n\n    return node;\n  }\n  /**\n   * bitwise exclusive or (xor), 'x ^| y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseXor(state) {\n    var node = parseBitwiseAnd(state);\n\n    while (state.token === '^|') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);\n    }\n\n    return node;\n  }\n  /**\n   * bitwise and, 'x & y'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseBitwiseAnd(state) {\n    var node = parseRelational(state);\n\n    while (state.token === '&') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);\n    }\n\n    return node;\n  }\n  /**\n   * Parse a chained conditional, like 'a > b >= c'\n   * @return {Node} node\n   */\n\n\n  function parseRelational(state) {\n    var params = [parseShift(state)];\n    var conditionals = [];\n    var operators = {\n      '==': 'equal',\n      '!=': 'unequal',\n      '<': 'smaller',\n      '>': 'larger',\n      '<=': 'smallerEq',\n      '>=': 'largerEq'\n    };\n\n    while (operators.hasOwnProperty(state.token)) {\n      // eslint-disable-line no-unmodified-loop-condition\n      var cond = {\n        name: state.token,\n        fn: operators[state.token]\n      };\n      conditionals.push(cond);\n      getTokenSkipNewline(state);\n      params.push(parseShift(state));\n    }\n\n    if (params.length === 1) {\n      return params[0];\n    } else if (params.length === 2) {\n      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);\n    } else {\n      return new RelationalNode(conditionals.map(function (c) {\n        return c.fn;\n      }), params);\n    }\n  }\n  /**\n   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseShift(state) {\n    var node, operators, name, fn, params;\n    node = parseConversion(state);\n    operators = {\n      '<<': 'leftShift',\n      '>>': 'rightArithShift',\n      '>>>': 'rightLogShift'\n    };\n\n    while (operators.hasOwnProperty(state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      params = [node, parseConversion(state)];\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * conversion operators 'to' and 'in'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseConversion(state) {\n    var node, operators, name, fn, params;\n    node = parseRange(state);\n    operators = {\n      'to': 'to',\n      'in': 'to' // alias of 'to'\n\n    };\n\n    while (operators.hasOwnProperty(state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n\n      if (name === 'in' && state.token === '') {\n        // end of expression -> this is the unit 'in' ('inch')\n        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);\n      } else {\n        // operator 'a to b' or 'a in b'\n        params = [node, parseRange(state)];\n        node = new OperatorNode(name, fn, params);\n      }\n    }\n\n    return node;\n  }\n  /**\n   * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseRange(state) {\n    var node;\n    var params = [];\n\n    if (state.token === ':') {\n      // implicit start=1 (one-based)\n      node = new ConstantNode(1);\n    } else {\n      // explicit start\n      node = parseAddSubtract(state);\n    }\n\n    if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {\n      // we ignore the range operator when a conditional operator is being processed on the same level\n      params.push(node); // parse step and end\n\n      while (state.token === ':' && params.length < 3) {\n        // eslint-disable-line no-unmodified-loop-condition\n        getTokenSkipNewline(state);\n\n        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {\n          // implicit end\n          params.push(new SymbolNode('end'));\n        } else {\n          // explicit end\n          params.push(parseAddSubtract(state));\n        }\n      }\n\n      if (params.length === 3) {\n        // params = [start, step, end]\n        node = new RangeNode(params[0], params[2], params[1]); // start, end, step\n      } else {\n        // length === 2\n        // params = [start, end]\n        node = new RangeNode(params[0], params[1]); // start, end\n      }\n    }\n\n    return node;\n  }\n  /**\n   * add or subtract\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseAddSubtract(state) {\n    var node, operators, name, fn, params;\n    node = parseMultiplyDivide(state);\n    operators = {\n      '+': 'add',\n      '-': 'subtract'\n    };\n\n    while (operators.hasOwnProperty(state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      params = [node, parseMultiplyDivide(state)];\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * multiply, divide, modulus\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseMultiplyDivide(state) {\n    var node, last, operators, name, fn;\n    node = parseImplicitMultiplication(state);\n    last = node;\n    operators = {\n      '*': 'multiply',\n      '.*': 'dotMultiply',\n      '/': 'divide',\n      './': 'dotDivide',\n      '%': 'mod',\n      'mod': 'mod'\n    };\n\n    while (true) {\n      if (operators.hasOwnProperty(state.token)) {\n        // explicit operators\n        name = state.token;\n        fn = operators[name];\n        getTokenSkipNewline(state);\n        last = parseImplicitMultiplication(state);\n        node = new OperatorNode(name, fn, [node, last]);\n      } else {\n        break;\n      }\n    }\n\n    return node;\n  }\n  /**\n   * implicit multiplication\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseImplicitMultiplication(state) {\n    var node, last;\n    node = parseRule2(state);\n    last = node;\n\n    while (true) {\n      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && type.isConstantNode(node) || state.tokenType === TOKENTYPE.NUMBER && !type.isConstantNode(last) && (!type.isOperatorNode(last) || last.op === '!') || state.token === '(') {\n        // parse implicit multiplication\n        //\n        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'\n        // number:      implicit multiplication like '(2+3)2'\n        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'\n        last = parseRule2(state);\n        node = new OperatorNode('*', 'multiply', [node, last], true\n        /* implicit */\n        );\n      } else {\n        break;\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n   * Explicit division gets higher precedence than implicit multiplication\n   * when the division matches this pattern: [number] / [number] [symbol]\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseRule2(state) {\n    var node = parseUnary(state);\n    var last = node;\n    var tokenStates = [];\n\n    while (true) {\n      // Match the \"number /\" part of the pattern \"number / number symbol\"\n      if (state.token === '/' && type.isConstantNode(last)) {\n        // Look ahead to see if the next token is a number\n        tokenStates.push(_extends({}, state));\n        getTokenSkipNewline(state); // Match the \"number / number\" part of the pattern\n\n        if (state.tokenType === TOKENTYPE.NUMBER) {\n          // Look ahead again\n          tokenStates.push(_extends({}, state));\n          getTokenSkipNewline(state); // Match the \"symbol\" part of the pattern, or a left parenthesis\n\n          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(') {\n            // We've matched the pattern \"number / number symbol\".\n            // Rewind once and build the \"number / number\" node; the symbol will be consumed later\n            _extends(state, tokenStates.pop());\n\n            tokenStates.pop();\n            last = parseUnary(state);\n            node = new OperatorNode('/', 'divide', [node, last]);\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop();\n\n            _extends(state, tokenStates.pop());\n\n            break;\n          }\n        } else {\n          // Not a match, so rewind\n          _extends(state, tokenStates.pop());\n\n          break;\n        }\n      } else {\n        break;\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Unary plus and minus, and logical and bitwise not\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseUnary(state) {\n    var name, params, fn;\n    var operators = {\n      '-': 'unaryMinus',\n      '+': 'unaryPlus',\n      '~': 'bitNot',\n      'not': 'not'\n    };\n\n    if (operators.hasOwnProperty(state.token)) {\n      fn = operators[state.token];\n      name = state.token;\n      getTokenSkipNewline(state);\n      params = [parseUnary(state)];\n      return new OperatorNode(name, fn, params);\n    }\n\n    return parsePow(state);\n  }\n  /**\n   * power\n   * Note: power operator is right associative\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parsePow(state) {\n    var node, name, fn, params;\n    node = parseLeftHandOperators(state);\n\n    if (state.token === '^' || state.token === '.^') {\n      name = state.token;\n      fn = name === '^' ? 'pow' : 'dotPow';\n      getTokenSkipNewline(state);\n      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'\n\n      node = new OperatorNode(name, fn, params);\n    }\n\n    return node;\n  }\n  /**\n   * Left hand operators: factorial x!, ctranspose x'\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseLeftHandOperators(state) {\n    var node, operators, name, fn, params;\n    node = parseCustomNodes(state);\n    operators = {\n      '!': 'factorial',\n      '\\'': 'ctranspose'\n    };\n\n    while (operators.hasOwnProperty(state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getToken(state);\n      params = [node];\n      node = new OperatorNode(name, fn, params);\n      node = parseAccessors(state, node);\n    }\n\n    return node;\n  }\n  /**\n   * Parse a custom node handler. A node handler can be used to process\n   * nodes in a custom way, for example for handling a plot.\n   *\n   * A handler must be passed as second argument of the parse function.\n   * - must extend math.expression.node.Node\n   * - must contain a function _compile(defs: Object) : string\n   * - must contain a function find(filter: Object) : Node[]\n   * - must contain a function toString() : string\n   * - the constructor is called with a single argument containing all parameters\n   *\n   * For example:\n   *\n   *     nodes = {\n   *       'plot': PlotHandler\n   *     }\n   *\n   * The constructor of the handler is called as:\n   *\n   *     node = new PlotHandler(params)\n   *\n   * The handler will be invoked when evaluating an expression like:\n   *\n   *     node = math.parse('plot(sin(x), x)', nodes)\n   *\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseCustomNodes(state) {\n    var params = [];\n\n    if (state.tokenType === TOKENTYPE.SYMBOL && state.extraNodes.hasOwnProperty(state.token)) {\n      var CustomNode = state.extraNodes[state.token];\n      getToken(state); // parse parameters\n\n      if (state.token === '(') {\n        params = [];\n        openParams(state);\n        getToken(state);\n\n        if (state.token !== ')') {\n          params.push(parseAssignment(state)); // parse a list with parameters\n\n          while (state.token === ',') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params.push(parseAssignment(state));\n          }\n        }\n\n        if (state.token !== ')') {\n          throw createSyntaxError(state, 'Parenthesis ) expected');\n        }\n\n        closeParams(state);\n        getToken(state);\n      } // create a new custom node\n      // noinspection JSValidateTypes\n\n\n      return new CustomNode(params);\n    }\n\n    return parseSymbol(state);\n  }\n  /**\n   * parse symbols: functions, variables, constants, units\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseSymbol(state) {\n    var node, name;\n\n    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n      name = state.token;\n      getToken(state);\n\n      if (CONSTANTS.hasOwnProperty(name)) {\n        // true, false, null, ...\n        node = new ConstantNode(CONSTANTS[name]);\n      } else if (NUMERIC_CONSTANTS.indexOf(name) !== -1) {\n        // NaN, Infinity\n        node = new ConstantNode(numeric(name, 'number'));\n      } else {\n        node = new SymbolNode(name);\n      } // parse function parameters and matrix index\n\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseDoubleQuotesString(state);\n  }\n  /**\n   * parse accessors:\n   * - function invocation in round brackets (...), for example sqrt(2)\n   * - index enclosed in square brackets [...], for example A[2,3]\n   * - dot notation for properties, like foo.bar\n   * @param {Node} node    Node on which to apply the parameters. If there\n   *                       are no parameters in the expression, the node\n   *                       itself is returned\n   * @param {string[]} [types]  Filter the types of notations\n   *                            can be ['(', '[', '.']\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseAccessors(state, node, types) {\n    var params;\n\n    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.indexOf(state.token) !== -1)) {\n      // eslint-disable-line no-unmodified-loop-condition\n      params = [];\n\n      if (state.token === '(') {\n        if (type.isSymbolNode(node) || type.isAccessorNode(node)) {\n          // function invocation like fn(2, 3) or obj.fn(2, 3)\n          openParams(state);\n          getToken(state);\n\n          if (state.token !== ')') {\n            params.push(parseAssignment(state)); // parse a list with parameters\n\n            while (state.token === ',') {\n              // eslint-disable-line no-unmodified-loop-condition\n              getToken(state);\n              params.push(parseAssignment(state));\n            }\n          }\n\n          if (state.token !== ')') {\n            throw createSyntaxError(state, 'Parenthesis ) expected');\n          }\n\n          closeParams(state);\n          getToken(state);\n          node = new FunctionNode(node, params);\n        } else {\n          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)\n          // don't parse it here but let it be handled by parseImplicitMultiplication\n          // with correct precedence\n          return node;\n        }\n      } else if (state.token === '[') {\n        // index notation like variable[2, 3]\n        openParams(state);\n        getToken(state);\n\n        if (state.token !== ']') {\n          params.push(parseAssignment(state)); // parse a list with parameters\n\n          while (state.token === ',') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params.push(parseAssignment(state));\n          }\n        }\n\n        if (state.token !== ']') {\n          throw createSyntaxError(state, 'Parenthesis ] expected');\n        }\n\n        closeParams(state);\n        getToken(state);\n        node = new AccessorNode(node, new IndexNode(params));\n      } else {\n        // dot notation like variable.prop\n        getToken(state);\n\n        if (state.tokenType !== TOKENTYPE.SYMBOL) {\n          throw createSyntaxError(state, 'Property name expected after dot');\n        }\n\n        params.push(new ConstantNode(state.token));\n        getToken(state);\n        var dotNotation = true;\n        node = new AccessorNode(node, new IndexNode(params, dotNotation));\n      }\n    }\n\n    return node;\n  }\n  /**\n   * Parse a double quotes string.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseDoubleQuotesString(state) {\n    var node, str;\n\n    if (state.token === '\"') {\n      str = parseDoubleQuotesStringToken(state); // create constant\n\n      node = new ConstantNode(str); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseSingleQuotesString(state);\n  }\n  /**\n   * Parse a string surrounded by double quotes \"...\"\n   * @return {string}\n   */\n\n\n  function parseDoubleQuotesStringToken(state) {\n    var str = '';\n\n    while (currentCharacter(state) !== '' && currentCharacter(state) !== '\"') {\n      if (currentCharacter(state) === '\\\\') {\n        // escape character, immediately process the next\n        // character to prevent stopping at a next '\\\"'\n        str += currentCharacter(state);\n        next(state);\n      }\n\n      str += currentCharacter(state);\n      next(state);\n    }\n\n    getToken(state);\n\n    if (state.token !== '\"') {\n      throw createSyntaxError(state, 'End of string \" expected');\n    }\n\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n  /**\n   * Parse a single quotes string.\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseSingleQuotesString(state) {\n    var node, str;\n\n    if (state.token === '\\'') {\n      str = parseSingleQuotesStringToken(state); // create constant\n\n      node = new ConstantNode(str); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseMatrix(state);\n  }\n  /**\n   * Parse a string surrounded by single quotes '...'\n   * @return {string}\n   */\n\n\n  function parseSingleQuotesStringToken(state) {\n    var str = '';\n\n    while (currentCharacter(state) !== '' && currentCharacter(state) !== '\\'') {\n      if (currentCharacter(state) === '\\\\') {\n        // escape character, immediately process the next\n        // character to prevent stopping at a next '\\''\n        str += currentCharacter(state);\n        next(state);\n      }\n\n      str += currentCharacter(state);\n      next(state);\n    }\n\n    getToken(state);\n\n    if (state.token !== '\\'') {\n      throw createSyntaxError(state, 'End of string \\' expected');\n    }\n\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n  /**\n   * parse the matrix\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseMatrix(state) {\n    var array, params, rows, cols;\n\n    if (state.token === '[') {\n      // matrix [...]\n      openParams(state);\n      getToken(state);\n\n      if (state.token !== ']') {\n        // this is a non-empty matrix\n        var row = parseRow(state);\n\n        if (state.token === ';') {\n          // 2 dimensional array\n          rows = 1;\n          params = [row]; // the rows of the matrix are separated by dot-comma's\n\n          while (state.token === ';') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params[rows] = parseRow(state);\n            rows++;\n          }\n\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected');\n          }\n\n          closeParams(state);\n          getToken(state); // check if the number of columns matches in all rows\n\n          cols = params[0].items.length;\n\n          for (var r = 1; r < rows; r++) {\n            if (params[r].items.length !== cols) {\n              throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');\n            }\n          }\n\n          array = new ArrayNode(params);\n        } else {\n          // 1 dimensional vector\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected');\n          }\n\n          closeParams(state);\n          getToken(state);\n          array = row;\n        }\n      } else {\n        // this is an empty matrix \"[ ]\"\n        closeParams(state);\n        getToken(state);\n        array = new ArrayNode([]);\n      }\n\n      return parseAccessors(state, array);\n    }\n\n    return parseObject(state);\n  }\n  /**\n   * Parse a single comma-separated row from a matrix, like 'a, b, c'\n   * @return {ArrayNode} node\n   */\n\n\n  function parseRow(state) {\n    var params = [parseAssignment(state)];\n    var len = 1;\n\n    while (state.token === ',') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getToken(state); // parse expression\n\n      params[len] = parseAssignment(state);\n      len++;\n    }\n\n    return new ArrayNode(params);\n  }\n  /**\n   * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseObject(state) {\n    if (state.token === '{') {\n      openParams(state);\n      var key;\n      var properties = {};\n\n      do {\n        getToken(state);\n\n        if (state.token !== '}') {\n          // parse key\n          if (state.token === '\"') {\n            key = parseDoubleQuotesStringToken(state);\n          } else if (state.token === '\\'') {\n            key = parseSingleQuotesStringToken(state);\n          } else if (state.tokenType === TOKENTYPE.SYMBOL) {\n            key = state.token;\n            getToken(state);\n          } else {\n            throw createSyntaxError(state, 'Symbol or string expected as object key');\n          } // parse key/value separator\n\n\n          if (state.token !== ':') {\n            throw createSyntaxError(state, 'Colon : expected after object key');\n          }\n\n          getToken(state); // parse key\n\n          properties[key] = parseAssignment(state);\n        }\n      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n\n      if (state.token !== '}') {\n        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n      }\n\n      closeParams(state);\n      getToken(state);\n      var node = new ObjectNode(properties); // parse index parameters\n\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseNumber(state);\n  }\n  /**\n   * parse a number\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseNumber(state) {\n    var numberStr;\n\n    if (state.tokenType === TOKENTYPE.NUMBER) {\n      // this is a number\n      numberStr = state.token;\n      getToken(state);\n      return new ConstantNode(numeric(numberStr, config.number));\n    }\n\n    return parseParentheses(state);\n  }\n  /**\n   * parentheses\n   * @return {Node} node\n   * @private\n   */\n\n\n  function parseParentheses(state) {\n    var node; // check if it is a parenthesized expression\n\n    if (state.token === '(') {\n      // parentheses (...)\n      openParams(state);\n      getToken(state);\n      node = parseAssignment(state); // start again\n\n      if (state.token !== ')') {\n        throw createSyntaxError(state, 'Parenthesis ) expected');\n      }\n\n      closeParams(state);\n      getToken(state);\n      node = new ParenthesisNode(node);\n      node = parseAccessors(state, node);\n      return node;\n    }\n\n    return parseEnd(state);\n  }\n  /**\n   * Evaluated when the expression is not yet ended but expected to end\n   * @return {Node} res\n   * @private\n   */\n\n\n  function parseEnd(state) {\n    if (state.token === '') {\n      // syntax error or unexpected end of expression\n      throw createSyntaxError(state, 'Unexpected end of expression');\n    } else {\n      throw createSyntaxError(state, 'Value expected');\n    }\n  }\n  /**\n   * Shortcut for getting the current row value (one based)\n   * Returns the line of the currently handled expression\n   * @private\n   */\n\n  /* TODO: implement keeping track on the row number\n  function row () {\n    return null\n  }\n  */\n\n  /**\n   * Shortcut for getting the current col value (one based)\n   * Returns the column (position) where the last state.token starts\n   * @private\n   */\n\n\n  function col(state) {\n    return state.index - state.token.length + 1;\n  }\n  /**\n   * Create an error\n   * @param {string} message\n   * @return {SyntaxError} instantiated error\n   * @private\n   */\n\n\n  function createSyntaxError(state, message) {\n    var c = col(state);\n    var error = new SyntaxError(message + ' (char ' + c + ')');\n    error['char'] = c;\n    return error;\n  }\n  /**\n   * Create an error\n   * @param {string} message\n   * @return {Error} instantiated error\n   * @private\n   */\n\n\n  function createError(state, message) {\n    var c = col(state);\n    var error = new SyntaxError(message + ' (char ' + c + ')');\n    error['char'] = c;\n    return error;\n  }\n\n  return parse;\n}\n\nexports.name = 'parse';\nexports.path = 'expression';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n/**\n * Attach a transform function to math.apply\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function apply\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var apply = load(require('../../function/matrix/apply')); // @see: comment of concat itself\n\n  return typed('apply', {\n    '...any': function any(args) {\n      // change dim from one-based to zero-based\n      var dim = args[1];\n\n      if (type.isNumber(dim)) {\n        args[1] = dim - 1;\n      } else if (type.isBigNumber(dim)) {\n        args[1] = dim.minus(1);\n      }\n\n      try {\n        return apply.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'apply';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n/**\n * Attach a transform function to math.range\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function concat\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var concat = load(require('../../function/matrix/concat')); // @see: comment of concat itself\n\n  return typed('concat', {\n    '...any': function any(args) {\n      // change last argument from one-based to zero-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\n      if (type.isNumber(last)) {\n        args[lastIndex] = last - 1;\n      } else if (type.isBigNumber(last)) {\n        args[lastIndex] = last.minus(1);\n      }\n\n      try {\n        return concat.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'concat';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar IndexError = require('../../error/IndexError');\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error} Returns the transformed error\n */\n\n\nexports.transform = function (err) {\n  if (err && err.isIndexError) {\n    return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\n  }\n\n  return err;\n};","'use strict';\n\nvar filter = require('../../utils/array').filter;\n\nvar filterRegExp = require('../../utils/array').filterRegExp;\n\nvar maxArgumentCount = require('../../utils/function').maxArgumentCount;\n/**\n * Attach a transform function to math.filter\n * Adds a property transform containing the transform function.\n *\n * This transform adds support for equations as test function for math.filter,\n * so you can do something like 'filter([3, -2, 5], x > 0)'.\n */\n\n\nfunction factory(type, config, load, typed) {\n  var compileInlineExpression = load(require('./utils/compileInlineExpression'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n\n  function filterTransform(args, math, scope) {\n    var x, callback;\n\n    if (args[0]) {\n      x = args[0].compile().eval(scope);\n    }\n\n    if (args[1]) {\n      if (type.isSymbolNode(args[1]) || type.isFunctionAssignmentNode(args[1])) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = args[1].compile().eval(scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(args[1], math, scope);\n      }\n    }\n\n    return filter(x, callback);\n  }\n\n  filterTransform.rawArgs = true; // one based version of function filter\n\n  var filter = typed('filter', {\n    'Array, function': _filter,\n    'Matrix, function': function MatrixFunction(x, test) {\n      return matrix(_filter(x.toArray(), test));\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return matrix(filterRegExp(x.toArray(), test));\n    }\n  });\n  filter.toTex = undefined; // use default template\n\n  return filterTransform;\n}\n/**\n * Filter values in a callback given a callback function\n *\n * !!! Passes a one-based index !!!\n *\n * @param {Array} x\n * @param {Function} callback\n * @return {Array} Returns the filtered array\n * @private\n */\n\n\nfunction _filter(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n  return filter(x, function (value, index, array) {\n    // invoke the callback function with the right number of arguments\n    if (args === 1) {\n      return callback(value);\n    } else if (args === 2) {\n      return callback(value, [index + 1]);\n    } else {\n      // 3 or -1\n      return callback(value, [index + 1], array);\n    }\n  });\n}\n\nexports.name = 'filter';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar maxArgumentCount = require('../../utils/function').maxArgumentCount;\n\nvar forEach = require('../../utils/array').forEach;\n/**\n * Attach a transform function to math.forEach\n * Adds a property transform containing the transform function.\n *\n * This transform creates a one-based index instead of a zero-based index\n */\n\n\nfunction factory(type, config, load, typed) {\n  var compileInlineExpression = load(require('./utils/compileInlineExpression'));\n\n  function forEachTransform(args, math, scope) {\n    var x, callback;\n\n    if (args[0]) {\n      x = args[0].compile().eval(scope);\n    }\n\n    if (args[1]) {\n      if (type.isSymbolNode(args[1]) || type.isFunctionAssignmentNode(args[1])) {\n        // a function pointer, like forEach([3, -2, 5], myTestFunction)\n        callback = args[1].compile().eval(scope);\n      } else {\n        // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )\n        callback = compileInlineExpression(args[1], math, scope);\n      }\n    }\n\n    return _forEach(x, callback);\n  }\n\n  forEachTransform.rawArgs = true; // one-based version of forEach\n\n  var _forEach = typed('forEach', {\n    'Array | Matrix, function': function ArrayMatrixFunction(array, callback) {\n      // figure out what number of arguments the callback function expects\n      var args = maxArgumentCount(callback);\n\n      var recurse = function recurse(value, index) {\n        if (Array.isArray(value)) {\n          forEach(value, function (child, i) {\n            // we create a copy of the index array and append the new index value\n            recurse(child, index.concat(i + 1)); // one based index, hence i+1\n          });\n        } else {\n          // invoke the callback function with the right number of arguments\n          if (args === 1) {\n            callback(value);\n          } else if (args === 2) {\n            callback(value, index);\n          } else {\n            // 3 or -1\n            callback(value, index, array);\n          }\n        }\n      };\n\n      recurse(array.valueOf(), []); // pass Array\n    }\n  });\n\n  return forEachTransform;\n}\n\nexports.name = 'forEach';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./apply.transform'), require('./concat.transform'), require('./filter.transform'), require('./forEach.transform'), require('./index.transform'), require('./map.transform'), require('./max.transform'), require('./mean.transform'), require('./min.transform'), require('./range.transform'), require('./std.transform'), require('./subset.transform'), require('./sum.transform'), require('./var.transform')];","'use strict';\n/**\n * Attach a transform function to math.index\n * Adds a property transform containing the transform function.\n *\n * This transform creates a one-based index instead of a zero-based index\n */\n\nfunction factory(type, config, load) {\n  return function indexTransform() {\n    var args = [];\n\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i]; // change from one-based to zero based, and convert BigNumber to number\n\n      if (type.isRange(arg)) {\n        arg.start--;\n        arg.end -= arg.step > 0 ? 0 : 2;\n      } else if (arg && arg.isSet === true) {\n        arg = arg.map(function (v) {\n          return v - 1;\n        });\n      } else if (type.isArray(arg) || type.isMatrix(arg)) {\n        arg = arg.map(function (v) {\n          return v - 1;\n        });\n      } else if (type.isNumber(arg)) {\n        arg--;\n      } else if (type.isBigNumber(arg)) {\n        arg = arg.toNumber() - 1;\n      } else if (typeof arg === 'string') {// leave as is\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');\n      }\n\n      args[i] = arg;\n    }\n\n    var res = new type.Index();\n    type.Index.apply(res, args);\n    return res;\n  };\n}\n\nexports.name = 'index';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar maxArgumentCount = require('../../utils/function').maxArgumentCount;\n\nvar map = require('../../utils/array').map;\n/**\n * Attach a transform function to math.map\n * Adds a property transform containing the transform function.\n *\n * This transform creates a one-based index instead of a zero-based index\n */\n\n\nfunction factory(type, config, load, typed) {\n  var compileInlineExpression = load(require('./utils/compileInlineExpression'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n\n  function mapTransform(args, math, scope) {\n    var x, callback;\n\n    if (args[0]) {\n      x = args[0].compile().eval(scope);\n    }\n\n    if (args[1]) {\n      if (type.isSymbolNode(args[1]) || type.isFunctionAssignmentNode(args[1])) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = args[1].compile().eval(scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(args[1], math, scope);\n      }\n    }\n\n    return map(x, callback);\n  }\n\n  mapTransform.rawArgs = true; // one-based version of map function\n\n  var map = typed('map', {\n    'Array, function': function ArrayFunction(x, callback) {\n      return _map(x, callback, x);\n    },\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return matrix(_map(x.valueOf(), callback, x));\n    }\n  });\n  return mapTransform;\n}\n/**\n * Map for a multi dimensional array. One-based indexes\n * @param {Array} array\n * @param {function} callback\n * @param {Array} orig\n * @return {Array}\n * @private\n */\n\n\nfunction _map(array, callback, orig) {\n  // figure out what number of arguments the callback function expects\n  var argsCount = maxArgumentCount(callback);\n\n  function recurse(value, index) {\n    if (Array.isArray(value)) {\n      return map(value, function (child, i) {\n        // we create a copy of the index array and append the new index value\n        return recurse(child, index.concat(i + 1)); // one based index, hence i + 1\n      });\n    } else {\n      // invoke the (typed) callback function with the right number of arguments\n      if (argsCount === 1) {\n        return callback(value);\n      } else if (argsCount === 2) {\n        return callback(value, index);\n      } else {\n        // 3 or -1\n        return callback(value, index, orig);\n      }\n    }\n  }\n\n  return recurse(array, []);\n}\n\nexports.name = 'map';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n\nvar isCollection = require('../../utils/collection/isCollection');\n/**\n * Attach a transform function to math.max\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function max\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var max = load(require('../../function/statistics/max'));\n  return typed('max', {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && isCollection(args[0])) {\n        var dim = args[1];\n\n        if (type.isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (type.isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n\n      try {\n        return max.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'max';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n\nvar isCollection = require('../../utils/collection/isCollection');\n/**\n * Attach a transform function to math.mean\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function mean\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var mean = load(require('../../function/statistics/mean'));\n  return typed('mean', {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && isCollection(args[0])) {\n        var dim = args[1];\n\n        if (type.isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (type.isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n\n      try {\n        return mean.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'mean';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n\nvar isCollection = require('../../utils/collection/isCollection');\n/**\n * Attach a transform function to math.min\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function min\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var min = load(require('../../function/statistics/min'));\n  return typed('min', {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && isCollection(args[0])) {\n        var dim = args[1];\n\n        if (type.isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (type.isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n\n      try {\n        return min.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'min';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n/**\n * Attach a transform function to math.range\n * Adds a property transform containing the transform function.\n *\n * This transform creates a range which includes the end value\n */\n\nfunction factory(type, config, load, typed) {\n  var range = load(require('../../function/matrix/range'));\n  return typed('range', {\n    '...any': function any(args) {\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n\n      if (typeof last !== 'boolean') {\n        // append a parameter includeEnd=true\n        args.push(true);\n      }\n\n      return range.apply(null, args);\n    }\n  });\n}\n\nexports.name = 'range';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n\nvar isCollection = require('../../utils/collection/isCollection');\n/**\n * Attach a transform function to math.std\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function std\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var std = load(require('../../function/statistics/std'));\n  return typed('std', {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length >= 2 && isCollection(args[0])) {\n        var dim = args[1];\n\n        if (type.isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (type.isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n\n      try {\n        return std.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'std';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n/**\n * Attach a transform function to math.subset\n * Adds a property transform containing the transform function.\n *\n * This transform creates a range which includes the end value\n */\n\n\nfunction factory(type, config, load, typed) {\n  var subset = load(require('../../function/matrix/subset'));\n  return typed('subset', {\n    '...any': function any(args) {\n      try {\n        return subset.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'subset';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n\nvar isCollection = require('../../utils/collection/isCollection');\n/**\n * Attach a transform function to math.sum\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function mean\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var sum = load(require('../../function/statistics/sum'));\n  return typed('sum', {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && isCollection(args[0])) {\n        var dim = args[1];\n\n        if (type.isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (type.isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n\n      try {\n        return sum.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'sum';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compile an inline expression like \"x > 0\"\n   * @param {Node} expression\n   * @param {Object} math\n   * @param {Object} scope\n   * @return {function} Returns a function with one argument which fills in the\n   *                    undefined variable (like \"x\") and evaluates the expression\n   */\n  return function compileInlineExpression(expression, math, scope) {\n    // find an undefined symbol\n    var symbol = expression.filter(function (node) {\n      return type.isSymbolNode(node) && !(node.name in math) && !(node.name in scope);\n    })[0];\n\n    if (!symbol) {\n      throw new Error('No undefined variable found in inline expression \"' + expression + '\"');\n    } // create a test function for this equation\n\n\n    var name = symbol.name; // variable name\n\n    var subScope = Object.create(scope);\n    var eq = expression.compile();\n    return function inlineExpression(x) {\n      subScope[name] = x;\n      return eq.eval(subScope);\n    };\n  };\n}\n\nexports.factory = factory;","'use strict';\n\nvar errorTransform = require('./error.transform').transform;\n\nvar isCollection = require('../../utils/collection/isCollection');\n/**\n * Attach a transform function to math.var\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function var\n * from one-based to zero based\n */\n\n\nfunction factory(type, config, load, typed) {\n  var variance = load(require('../../function/statistics/var'));\n  return typed('var', {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length >= 2 && isCollection(args[0])) {\n        var dim = args[1];\n\n        if (type.isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (type.isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n\n      try {\n        return variance.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}\n\nexports.name = 'var';\nexports.path = 'expression.transform';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../../utils/index');\n\nvar object = util.object;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../../type/matrix/function/matrix'));\n  var abs = load(require('../../arithmetic/abs'));\n  var addScalar = load(require('../../arithmetic/addScalar'));\n  var divideScalar = load(require('../../arithmetic/divideScalar'));\n  var multiplyScalar = load(require('../../arithmetic/multiplyScalar'));\n  var subtract = load(require('../../arithmetic/subtract'));\n  var larger = load(require('../../relational/larger'));\n  var equalScalar = load(require('../../relational/equalScalar'));\n  var unaryMinus = load(require('../../arithmetic/unaryMinus'));\n  var SparseMatrix = type.SparseMatrix;\n  var DenseMatrix = type.DenseMatrix;\n  var Spa = type.Spa;\n  /**\n   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a\n   * row permutation vector `p` where `A[p,:] = L * U`\n   *\n   * Syntax:\n   *\n   *    math.lup(A)\n   *\n   * Example:\n   *\n   *    const m = [[2, 1], [1, 4]]\n   *    const r = math.lup(m)\n   *    // r = {\n   *    //   L: [[1, 0], [0.5, 1]],\n   *    //   U: [[2, 1], [0, 3.5]],\n   *    //   P: [0, 1]\n   *    // }\n   *\n   * See also:\n   *\n   *    slu, lsolve, lusolve, usolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.\n   *\n   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.\n   */\n\n  var lup = typed('lup', {\n    'DenseMatrix': function DenseMatrix(m) {\n      return _denseLUP(m);\n    },\n    'SparseMatrix': function SparseMatrix(m) {\n      return _sparseLUP(m);\n    },\n    'Array': function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a); // lup, use matrix implementation\n\n      var r = _denseLUP(m); // result\n\n\n      return {\n        L: r.L.valueOf(),\n        U: r.U.valueOf(),\n        p: r.p\n      };\n    }\n  });\n\n  function _denseLUP(m) {\n    // rows & columns\n    var rows = m._size[0];\n    var columns = m._size[1]; // minimum rows and columns\n\n    var n = Math.min(rows, columns); // matrix array, clone original data\n\n    var data = object.clone(m._data); // l matrix arrays\n\n    var ldata = [];\n    var lsize = [rows, n]; // u matrix arrays\n\n    var udata = [];\n    var usize = [n, columns]; // vars\n\n    var i, j, k; // permutation vector\n\n    var p = [];\n\n    for (i = 0; i < rows; i++) {\n      p[i] = i;\n    } // loop columns\n\n\n    for (j = 0; j < columns; j++) {\n      // skip first column in upper triangular matrix\n      if (j > 0) {\n        // loop rows\n        for (i = 0; i < rows; i++) {\n          // min i,j\n          var min = Math.min(i, j); // v[i, j]\n\n          var s = 0; // loop up to min\n\n          for (k = 0; k < min; k++) {\n            // s = l[i, k] - data[k, j]\n            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));\n          }\n\n          data[i][j] = subtract(data[i][j], s);\n        }\n      } // row with larger value in cvector, row >= j\n\n\n      var pi = j;\n      var pabsv = 0;\n      var vjj = 0; // loop rows\n\n      for (i = j; i < rows; i++) {\n        // data @ i, j\n        var v = data[i][j]; // absolute value\n\n        var absv = abs(v); // value is greater than pivote value\n\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = i; // update max value\n\n          pabsv = absv; // value @ [j, j]\n\n          vjj = v;\n        }\n      } // swap rows (j <-> pi)\n\n\n      if (j !== pi) {\n        // swap values j <-> pi in p\n        p[j] = [p[pi], p[pi] = p[j]][0]; // swap j <-> pi in data\n\n        DenseMatrix._swapRows(j, pi, data);\n      } // check column is in lower triangular matrix\n\n\n      if (j < rows) {\n        // loop rows (lower triangular matrix)\n        for (i = j + 1; i < rows; i++) {\n          // value @ i, j\n          var vij = data[i][j];\n\n          if (!equalScalar(vij, 0)) {\n            // update data\n            data[i][j] = divideScalar(data[i][j], vjj);\n          }\n        }\n      }\n    } // loop columns\n\n\n    for (j = 0; j < columns; j++) {\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // initialize row in arrays\n        if (j === 0) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i] = [];\n          } // L\n\n\n          ldata[i] = [];\n        } // check we are in the upper triangular matrix\n\n\n        if (i < j) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i][j] = data[i][j];\n          } // check column exists in lower triangular matrix\n\n\n          if (j < rows) {\n            // L\n            ldata[i][j] = 0;\n          }\n\n          continue;\n        } // diagonal value\n\n\n        if (i === j) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i][j] = data[i][j];\n          } // check column exists in lower triangular matrix\n\n\n          if (j < rows) {\n            // L\n            ldata[i][j] = 1;\n          }\n\n          continue;\n        } // check row exists in upper triangular matrix\n\n\n        if (i < columns) {\n          // U\n          udata[i][j] = 0;\n        } // check column exists in lower triangular matrix\n\n\n        if (j < rows) {\n          // L\n          ldata[i][j] = data[i][j];\n        }\n      }\n    } // l matrix\n\n\n    var l = new DenseMatrix({\n      data: ldata,\n      size: lsize\n    }); // u matrix\n\n    var u = new DenseMatrix({\n      data: udata,\n      size: usize\n    }); // p vector\n\n    var pv = [];\n\n    for (i = 0, n = p.length; i < n; i++) {\n      pv[p[i]] = i;\n    } // return matrices\n\n\n    return {\n      L: l,\n      U: u,\n      p: pv,\n      toString: function toString() {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p;\n      }\n    };\n  }\n\n  function _sparseLUP(m) {\n    // rows & columns\n    var rows = m._size[0];\n    var columns = m._size[1]; // minimum rows and columns\n\n    var n = Math.min(rows, columns); // matrix arrays (will not be modified, thanks to permutation vector)\n\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // l matrix arrays\n\n    var lvalues = [];\n    var lindex = [];\n    var lptr = [];\n    var lsize = [rows, n]; // u matrix arrays\n\n    var uvalues = [];\n    var uindex = [];\n    var uptr = [];\n    var usize = [n, columns]; // vars\n\n    var i, j, k; // permutation vectors, (current index -> original index) and (original index -> current index)\n\n    var pvCo = [];\n    var pvOc = [];\n\n    for (i = 0; i < rows; i++) {\n      pvCo[i] = i;\n      pvOc[i] = i;\n    } // swap indices in permutation vectors (condition x < y)!\n\n\n    var swapIndeces = function swapIndeces(x, y) {\n      // find pv indeces getting data from x and y\n      var kx = pvOc[x];\n      var ky = pvOc[y]; // update permutation vector current -> original\n\n      pvCo[kx] = y;\n      pvCo[ky] = x; // update permutation vector original -> current\n\n      pvOc[x] = ky;\n      pvOc[y] = kx;\n    }; // loop columns\n\n\n    var _loop = function _loop() {\n      // sparse accumulator\n      var spa = new Spa(); // check lower triangular matrix has a value @ column j\n\n      if (j < rows) {\n        // update ptr\n        lptr.push(lvalues.length); // first value in j column for lower triangular matrix\n\n        lvalues.push(1);\n        lindex.push(j);\n      } // update ptr\n\n\n      uptr.push(uvalues.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // copy column j into sparse accumulator\n\n      for (k = k0; k < k1; k++) {\n        // row\n        i = index[k]; // copy column values into sparse accumulator (use permutation vector)\n\n        spa.set(pvCo[i], values[k]);\n      } // skip first column in upper triangular matrix\n\n\n      if (j > 0) {\n        // loop rows in column j (above diagonal)\n        spa.forEach(0, j - 1, function (k, vkj) {\n          // loop rows in column k (L)\n          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {\n            // check row is below k\n            if (i > k) {\n              // update spa value\n              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));\n            }\n          });\n        });\n      } // row with larger value in spa, row >= j\n\n\n      var pi = j;\n      var vjj = spa.get(j);\n      var pabsv = abs(vjj); // loop values in spa (order by row, below diagonal)\n\n      spa.forEach(j + 1, rows - 1, function (x, v) {\n        // absolute value\n        var absv = abs(v); // value is greater than pivote value\n\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = x; // update max value\n\n          pabsv = absv; // value @ [j, j]\n\n          vjj = v;\n        }\n      }); // swap rows (j <-> pi)\n\n      if (j !== pi) {\n        // swap values j <-> pi in L\n        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); // swap values j <-> pi in U\n\n\n        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); // swap values in spa\n\n\n        spa.swap(j, pi); // update permutation vector (swap values @ j, pi)\n\n        swapIndeces(j, pi);\n      } // loop values in spa (order by row)\n\n\n      spa.forEach(0, rows - 1, function (x, v) {\n        // check we are above diagonal\n        if (x <= j) {\n          // update upper triangular matrix\n          uvalues.push(v);\n          uindex.push(x);\n        } else {\n          // update value\n          v = divideScalar(v, vjj); // check value is non zero\n\n          if (!equalScalar(v, 0)) {\n            // update lower triangular matrix\n            lvalues.push(v);\n            lindex.push(x);\n          }\n        }\n      });\n    };\n\n    for (j = 0; j < columns; j++) {\n      _loop();\n    } // update ptrs\n\n\n    uptr.push(uvalues.length);\n    lptr.push(lvalues.length); // return matrices\n\n    return {\n      L: new SparseMatrix({\n        values: lvalues,\n        index: lindex,\n        ptr: lptr,\n        size: lsize\n      }),\n      U: new SparseMatrix({\n        values: uvalues,\n        index: uindex,\n        ptr: uptr,\n        size: usize\n      }),\n      p: pvCo,\n      toString: function toString() {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p;\n      }\n    };\n  }\n\n  return lup;\n}\n\nexports.name = 'lup';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../../type/matrix/function/matrix'));\n  var zeros = load(require('../../matrix/zeros'));\n  var identity = load(require('../../matrix/identity'));\n  var isZero = load(require('../../utils/isZero'));\n  var unequal = load(require('../../relational/unequal'));\n  var sign = load(require('../../arithmetic/sign'));\n  var sqrt = load(require('../../arithmetic/sqrt'));\n  var conj = load(require('../../complex/conj'));\n  var unaryMinus = load(require('../../arithmetic/unaryMinus'));\n  var addScalar = load(require('../../arithmetic/addScalar'));\n  var divideScalar = load(require('../../arithmetic/divideScalar'));\n  var multiplyScalar = load(require('../../arithmetic/multiplyScalar'));\n  var subtract = load(require('../../arithmetic/subtract'));\n  /**\n   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in\n   * two matrices (`Q`, `R`) where `Q` is an\n   * orthogonal matrix and `R` is an upper triangular matrix.\n   *\n   * Syntax:\n   *\n   *    math.qr(A)\n   *\n   * Example:\n   *\n   *    const m = [\n   *      [1, -1,  4],\n   *      [1,  4, -2],\n   *      [1,  4,  2],\n   *      [1,  -1, 0]\n   *    ]\n   *    const result = math.qr(m)\n   *    // r = {\n   *    //   Q: [\n   *    //     [0.5, -0.5,   0.5],\n   *    //     [0.5,  0.5,  -0.5],\n   *    //     [0.5,  0.5,   0.5],\n   *    //     [0.5, -0.5,  -0.5],\n   *    //   ],\n   *    //   R: [\n   *    //     [2, 3,  2],\n   *    //     [0, 5, -2],\n   *    //     [0, 0,  4],\n   *    //     [0, 0,  0]\n   *    //   ]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lusolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array\n   * for which to get the QR decomposition.\n   *\n   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal\n   * matrix and R: the upper triangular matrix\n   */\n\n  var qr = typed('qr', {\n    'DenseMatrix': function DenseMatrix(m) {\n      return _denseQR(m);\n    },\n    'SparseMatrix': function SparseMatrix(m) {\n      return _sparseQR(m);\n    },\n    'Array': function Array(a) {\n      // create dense matrix from array\n      var m = matrix(a); // lup, use matrix implementation\n\n      var r = _denseQR(m); // result\n\n\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      };\n    }\n  });\n\n  function _denseQR(m) {\n    // rows & columns (m x n)\n    var rows = m._size[0]; // m\n\n    var cols = m._size[1]; // n\n\n    var Q = identity([rows], 'dense');\n    var Qdata = Q._data;\n    var R = m.clone();\n    var Rdata = R._data; // vars\n\n    var i, j, k;\n    var w = zeros([rows], '');\n\n    for (k = 0; k < Math.min(cols, rows); ++k) {\n      /*\n       * **k-th Household matrix**\n       *\n       * The matrix I - 2*v*transpose(v)\n       * x     = first column of A\n       * x1    = first element of x\n       * alpha = x1 / |x1| * |x|\n       * e1    = tranpose([1, 0, 0, ...])\n       * u     = x - alpha * e1\n       * v     = u / |u|\n       *\n       * Household matrix = I - 2 * v * tranpose(v)\n       *\n       *  * Initially Q = I and R = A.\n       *  * Household matrix is a reflection in a plane normal to v which\n       *    will zero out all but the top right element in R.\n       *  * Appplying reflection to both Q and R will not change product.\n       *  * Repeat this process on the (1,1) minor to get R as an upper\n       *    triangular matrix.\n       *  * Reflections leave the magnitude of the columns of Q unchanged\n       *    so Q remains othoganal.\n       *\n       */\n      var pivot = Rdata[k][k];\n      var sgn = unaryMinus(sign(pivot));\n      var conjSgn = conj(sgn);\n      var alphaSquared = 0;\n\n      for (i = k; i < rows; i++) {\n        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));\n      }\n\n      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));\n\n      if (!isZero(alpha)) {\n        // first element in vector u\n        var u1 = subtract(pivot, alpha); // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n\n        w[k] = 1;\n\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1);\n        } // tau = - conj(u1 / alpha)\n\n\n        var tau = unaryMinus(conj(divideScalar(u1, alpha)));\n        var s = void 0;\n        /*\n         * tau and w have been choosen so that\n         *\n         * 2 * v * tranpose(v) = tau * w * tranpose(w)\n         */\n\n        /*\n         * -- calculate R = R - tau * w * tranpose(w) * R --\n         * Only do calculation with rows k to (rows-1)\n         * Additionally columns 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n\n        for (j = k; j < cols; j++) {\n          s = 0.0; // calculate jth element of [tranpose(w) * R]\n\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));\n          } // calculate the jth element of [tau * transpose(w) * R]\n\n\n          s = multiplyScalar(s, tau);\n\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(subtract(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);\n          }\n        }\n        /*\n         * -- calculate Q = Q - tau * Q * w * transpose(w) --\n         * Q is a square matrix (rows x rows)\n         * Only do calculation with columns k to (rows-1)\n         * Additionally rows 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n\n\n        for (i = 0; i < rows; i++) {\n          s = 0.0; // calculate ith element of [Q * w]\n\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));\n          } // calculate the ith element of [tau * Q * w]\n\n\n          s = multiplyScalar(s, tau);\n\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(subtract(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);\n          }\n        }\n      }\n    } // coerse almost zero elements to zero\n    // TODO I feel uneasy just zeroing these values\n\n\n    for (i = 0; i < rows; ++i) {\n      for (j = 0; j < i && j < cols; ++j) {\n        if (unequal(0, divideScalar(Rdata[i][j], 1e5))) {\n          throw new Error('math.qr(): unknown error - ' + 'R is not lower triangular (element (' + i + ', ' + j + ')  = ' + Rdata[i][j] + ')');\n        }\n\n        Rdata[i][j] = multiplyScalar(Rdata[i][j], 0);\n      }\n    } // return matrices\n\n\n    return {\n      Q: Q,\n      R: R,\n      toString: function toString() {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString();\n      }\n    };\n  }\n\n  function _sparseQR(m) {\n    throw new Error('qr not implemented for sparse matrices yet');\n  }\n\n  return qr;\n}\n\nexports.name = 'qr';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../../utils/index');\n\nvar number = util.number;\nvar isInteger = number.isInteger;\n\nfunction factory(type, config, load, typed) {\n  var csSqr = load(require('../../algebra/sparse/csSqr'));\n  var csLu = load(require('../../algebra/sparse/csLu'));\n  /**\n   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where\n   *\n   * `P * A * Q = L * U`\n   *\n   * Syntax:\n   *\n   *    math.slu(A, order, threshold)\n   *\n   * Examples:\n   *\n   *    const A = math.sparse([[4,3], [6, 3]])\n   *    math.slu(A, 1, 0.001)\n   *    // returns:\n   *    // {\n   *    //   L: [[1, 0], [1.5, 1]]\n   *    //   U: [[4, 3], [0, -1.5]]\n   *    //   p: [0, 1]\n   *    //   q: [0, 1]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lsolve, usolve, lusolve\n   *\n   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.\n   * @param {Number}       order          The Symbolic Ordering and Analysis order:\n   *                                       0 - Natural ordering, no permutation vector q is returned\n   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'\n   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.\n   *                                           This is appropriatefor LU factorization of unsymmetric matrices.\n   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.\n   *                                           A dense row is a row with more than 10*sqr(columns) entries.\n   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)\n   *\n   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.\n   */\n\n  var slu = typed('slu', {\n    'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {\n      // verify order\n      if (!isInteger(order) || order < 0 || order > 3) {\n        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');\n      } // verify threshold\n\n\n      if (threshold < 0 || threshold > 1) {\n        throw new Error('Partial pivoting threshold must be a number from 0 to 1');\n      } // perform symbolic ordering and analysis\n\n\n      var s = csSqr(order, a, false); // perform lu decomposition\n\n      var f = csLu(a, s, threshold); // return decomposition\n\n      return {\n        L: f.L,\n        U: f.U,\n        p: f.pinv,\n        q: s.q,\n        toString: function toString() {\n          return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\np: ' + this.p.toString() + (this.q ? '\\nq: ' + this.q.toString() : '') + '\\n';\n        }\n      };\n    }\n  });\n  return slu;\n}\n\nexports.name = 'slu';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var parse = load(require('../../expression/parse'));\n  var simplify = load(require('./simplify'));\n  var equal = load(require('../relational/equal'));\n  var isZero = load(require('../utils/isZero'));\n  var getType = load(require('../utils/typeof'));\n  var numeric = load(require('../../type/numeric'));\n  var ConstantNode = load(require('../../expression/node/ConstantNode'));\n  var FunctionNode = load(require('../../expression/node/FunctionNode'));\n  var OperatorNode = load(require('../../expression/node/OperatorNode'));\n  var ParenthesisNode = load(require('../../expression/node/ParenthesisNode'));\n  var SymbolNode = load(require('../../expression/node/SymbolNode'));\n  /**\n   * Takes the derivative of an expression expressed in parser Nodes.\n   * The derivative will be taken over the supplied variable in the\n   * second parameter. If there are multiple variables in the expression,\n   * it will return a partial derivative.\n   *\n   * This uses rules of differentiation which can be found here:\n   *\n   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)\n   *\n   * Syntax:\n   *\n   *     derivative(expr, variable)\n   *     derivative(expr, variable, options)\n   *\n   * Examples:\n   *\n   *     math.derivative('x^2', 'x')                     // Node {2 * x}\n   *     math.derivative('x^2', 'x', {simplify: false})  // Node {2 * 1 * x ^ (2 - 1)\n   *     math.derivative('sin(2x)', 'x'))                // Node {2 * cos(2 * x)}\n   *     math.derivative('2*x', 'x').eval()              // number 2\n   *     math.derivative('x^2', 'x').eval({x: 4})        // number 8\n   *     const f = math.parse('x^2')\n   *     const x = math.parse('x')\n   *     math.derivative(f, x)                           // Node {2 * x}\n   *\n   * See also:\n   *\n   *     simplify, parse, eval\n   *\n   * @param  {Node | string} expr           The expression to differentiate\n   * @param  {SymbolNode | string} variable The variable over which to differentiate\n   * @param  {{simplify: boolean}} [options]\n   *                         There is one option available, `simplify`, which\n   *                         is true by default. When false, output will not\n   *                         be simplified.\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n\n  var derivative = typed('derivative', {\n    'Node, SymbolNode, Object': function NodeSymbolNodeObject(expr, variable, options) {\n      var constNodes = {};\n      constTag(constNodes, expr, variable.name);\n\n      var res = _derivative(expr, constNodes);\n\n      return options.simplify ? simplify(res) : res;\n    },\n    'Node, SymbolNode': function NodeSymbolNode(expr, variable) {\n      return derivative(expr, variable, {\n        simplify: true\n      });\n    },\n    'string, SymbolNode': function stringSymbolNode(expr, variable) {\n      return derivative(parse(expr), variable);\n    },\n    'string, SymbolNode, Object': function stringSymbolNodeObject(expr, variable, options) {\n      return derivative(parse(expr), variable, options);\n    },\n    'string, string': function stringString(expr, variable) {\n      return derivative(parse(expr), parse(variable));\n    },\n    'string, string, Object': function stringStringObject(expr, variable, options) {\n      return derivative(parse(expr), parse(variable), options);\n    },\n    'Node, string': function NodeString(expr, variable) {\n      return derivative(expr, parse(variable));\n    },\n    'Node, string, Object': function NodeStringObject(expr, variable, options) {\n      return derivative(expr, parse(variable), options);\n    } // TODO: replace the 8 signatures above with 4 as soon as typed-function supports optional arguments\n\n    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}\n    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {\n      let res = expr\n      for (let i = 0; i < order; i++) {\n        let constNodes = {}\n        constTag(constNodes, expr, variable.name)\n        res = _derivative(res, constNodes)\n      }\n      return res\n    }\n    */\n\n  });\n  derivative._simplify = true;\n\n  derivative.toTex = function (deriv) {\n    return _derivTex.apply(null, deriv.args);\n  }; // NOTE: the optional \"order\" parameter here is currently unused\n\n\n  var _derivTex = typed('_derivTex', {\n    'Node, SymbolNode': function NodeSymbolNode(expr, x) {\n      if (type.isConstantNode(expr) && getType(expr.value) === 'string') {\n        return _derivTex(parse(expr.value).toString(), x.toString(), 1);\n      } else {\n        return _derivTex(expr.toString(), x.toString(), 1);\n      }\n    },\n    'Node, ConstantNode': function NodeConstantNode(expr, x) {\n      if (getType(x.value) === 'string') {\n        return _derivTex(expr, parse(x.value));\n      } else {\n        throw new Error(\"The second parameter to 'derivative' is a non-string constant\");\n      }\n    },\n    'Node, SymbolNode, ConstantNode': function NodeSymbolNodeConstantNode(expr, x, order) {\n      return _derivTex(expr.toString(), x.name, order.value);\n    },\n    'string, string, number': function stringStringNumber(expr, x, order) {\n      var d;\n\n      if (order === 1) {\n        d = '{d\\\\over d' + x + '}';\n      } else {\n        d = '{d^{' + order + '}\\\\over d' + x + '^{' + order + '}}';\n      }\n\n      return d + \"\\\\left[\".concat(expr, \"\\\\right]\");\n    }\n  });\n  /**\n   * Does a depth-first search on the expression tree to identify what Nodes\n   * are constants (e.g. 2 + 2), and stores the ones that are constants in\n   * constNodes. Classification is done as follows:\n   *\n   *   1. ConstantNodes are constants.\n   *   2. If there exists a SymbolNode, of which we are differentiating over,\n   *      in the subtree it is not constant.\n   *\n   * @param  {Object} constNodes  Holds the nodes that are constant\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {string} varName     Variable that we are differentiating\n   * @return {boolean}  if node is constant\n   */\n  // TODO: can we rewrite constTag into a pure function?\n\n\n  var constTag = typed('constTag', {\n    'Object, ConstantNode, string': function ObjectConstantNodeString(constNodes, node) {\n      constNodes[node] = true;\n      return true;\n    },\n    'Object, SymbolNode, string': function ObjectSymbolNodeString(constNodes, node, varName) {\n      // Treat other variables like constants. For reasoning, see:\n      //   https://en.wikipedia.org/wiki/Partial_derivative\n      if (node.name !== varName) {\n        constNodes[node] = true;\n        return true;\n      }\n\n      return false;\n    },\n    'Object, ParenthesisNode, string': function ObjectParenthesisNodeString(constNodes, node, varName) {\n      return constTag(constNodes, node.content, varName);\n    },\n    'Object, FunctionAssignmentNode, string': function ObjectFunctionAssignmentNodeString(constNodes, node, varName) {\n      if (node.params.indexOf(varName) === -1) {\n        constNodes[node] = true;\n        return true;\n      }\n\n      return constTag(constNodes, node.expr, varName);\n    },\n    'Object, FunctionNode | OperatorNode, string': function ObjectFunctionNodeOperatorNodeString(constNodes, node, varName) {\n      if (node.args.length > 0) {\n        var isConst = constTag(constNodes, node.args[0], varName);\n\n        for (var i = 1; i < node.args.length; ++i) {\n          isConst = constTag(constNodes, node.args[i], varName) && isConst;\n        }\n\n        if (isConst) {\n          constNodes[node] = true;\n          return true;\n        }\n      }\n\n      return false;\n    }\n  });\n  /**\n   * Applies differentiation rules.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {Object} constNodes  Holds the nodes that are constant\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n\n  var _derivative = typed('_derivative', {\n    'ConstantNode, Object': function ConstantNodeObject(node) {\n      return createConstantNode(0);\n    },\n    'SymbolNode, Object': function SymbolNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      return createConstantNode(1);\n    },\n    'ParenthesisNode, Object': function ParenthesisNodeObject(node, constNodes) {\n      return new ParenthesisNode(_derivative(node.content, constNodes));\n    },\n    'FunctionAssignmentNode, Object': function FunctionAssignmentNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      return _derivative(node.expr, constNodes);\n    },\n    'FunctionNode, Object': function FunctionNodeObject(node, constNodes) {\n      if (node.args.length !== 1) {\n        funcArgsCheck(node);\n      }\n\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      var arg0 = node.args[0];\n      var arg1;\n      var div = false; // is output a fraction?\n\n      var negative = false; // is output negative?\n\n      var funcDerivative;\n\n      switch (node.name) {\n        case 'cbrt':\n          // d/dx(cbrt(x)) = 1 / (3x^(2/3))\n          div = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);\n          break;\n\n        case 'sqrt':\n        case 'nthRoot':\n          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))\n          if (node.args.length === 1) {\n            div = true;\n            funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);\n          } else if (node.args.length === 2) {\n            // Rearrange from nthRoot(x, a) -> x^(1/a)\n            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]); // Is a variable?\n\n            constNodes[arg1] = constNodes[node.args[1]];\n            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);\n          }\n\n          break;\n\n        case 'log10':\n          arg1 = createConstantNode(10);\n\n        /* fall through! */\n\n        case 'log':\n          if (!arg1 && node.args.length === 1) {\n            // d/dx(log(x)) = 1 / x\n            funcDerivative = arg0.clone();\n            div = true;\n          } else if (node.args.length === 1 && arg1 || node.args.length === 2 && constNodes[node.args[1]] !== undefined) {\n            // d/dx(log(x, c)) = 1 / (x*ln(c))\n            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);\n            div = true;\n          } else if (node.args.length === 2) {\n            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))\n            return _derivative(new OperatorNode('/', 'divide', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), constNodes);\n          }\n\n          break;\n\n        case 'pow':\n          constNodes[arg1] = constNodes[node.args[1]]; // Pass to pow operator node parser\n\n          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);\n\n        case 'exp':\n          // d/dx(e^x) = e^x\n          funcDerivative = new FunctionNode('exp', [arg0.clone()]);\n          break;\n\n        case 'sin':\n          // d/dx(sin(x)) = cos(x)\n          funcDerivative = new FunctionNode('cos', [arg0.clone()]);\n          break;\n\n        case 'cos':\n          // d/dx(cos(x)) = -sin(x)\n          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);\n          break;\n\n        case 'tan':\n          // d/dx(tan(x)) = sec(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'sec':\n          // d/dx(sec(x)) = sec(x)tan(x)\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);\n          break;\n\n        case 'csc':\n          // d/dx(csc(x)) = -csc(x)cot(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);\n          break;\n\n        case 'cot':\n          // d/dx(cot(x)) = -csc(x)^2\n          negative = true;\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'asin':\n          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);\n          break;\n\n        case 'acos':\n          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)\n          div = true;\n          negative = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);\n          break;\n\n        case 'atan':\n          // d/dx(atan(x)) = 1 / (x^2 + 1)\n          div = true;\n          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);\n          break;\n\n        case 'asec':\n          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))\n          div = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acsc':\n          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acot':\n          // d/dx(acot(x)) = -1 / (x^2 + 1)\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);\n          break;\n\n        case 'sinh':\n          // d/dx(sinh(x)) = cosh(x)\n          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);\n          break;\n\n        case 'cosh':\n          // d/dx(cosh(x)) = sinh(x)\n          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);\n          break;\n\n        case 'tanh':\n          // d/dx(tanh(x)) = sech(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'sech':\n          // d/dx(sech(x)) = -sech(x)tanh(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);\n          break;\n\n        case 'csch':\n          // d/dx(csch(x)) = -csch(x)coth(x)\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);\n          break;\n\n        case 'coth':\n          // d/dx(coth(x)) = -csch(x)^2\n          negative = true;\n          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);\n          break;\n\n        case 'asinh':\n          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);\n          break;\n\n        case 'acosh':\n          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)\n          div = true;\n          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);\n          break;\n\n        case 'atanh':\n          // d/dx(atanh(x)) = 1 / (1 - x^2)\n          div = true;\n          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);\n          break;\n\n        case 'asech':\n          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);\n          break;\n\n        case 'acsch':\n          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);\n          break;\n\n        case 'acoth':\n          // d/dx(acoth(x)) = -1 / (1 - x^2)\n          div = true;\n          negative = true;\n          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);\n          break;\n\n        case 'abs':\n          // d/dx(abs(x)) = abs(x)/x\n          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);\n          break;\n\n        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)\n\n        default:\n          throw new Error('Function \"' + node.name + '\" is not supported by derivative, or a wrong number of arguments is passed');\n      }\n\n      var op, func;\n\n      if (div) {\n        op = '/';\n        func = 'divide';\n      } else {\n        op = '*';\n        func = 'multiply';\n      }\n      /* Apply chain rule to all functions:\n         F(x)  = f(g(x))\n         F'(x) = g'(x)*f'(g(x)) */\n\n\n      var chainDerivative = _derivative(arg0, constNodes);\n\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);\n      }\n\n      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);\n    },\n    'OperatorNode, Object': function OperatorNodeObject(node, constNodes) {\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n\n      if (node.op === '+') {\n        // d/dx(sum(f(x)) = sum(f'(x))\n        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {\n          return _derivative(arg, constNodes);\n        }));\n      }\n\n      if (node.op === '-') {\n        // d/dx(+/-f(x)) = +/-f'(x)\n        if (node.isUnary()) {\n          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes)]);\n        } // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)\n\n\n        if (node.isBinary()) {\n          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], constNodes), _derivative(node.args[1], constNodes)]);\n        }\n      }\n\n      if (node.op === '*') {\n        // d/dx(c*f(x)) = c*f'(x)\n        var constantTerms = node.args.filter(function (arg) {\n          return constNodes[arg] !== undefined;\n        });\n\n        if (constantTerms.length > 0) {\n          var nonConstantTerms = node.args.filter(function (arg) {\n            return constNodes[arg] === undefined;\n          });\n          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);\n          var newArgs = constantTerms.concat(_derivative(nonConstantNode, constNodes));\n          return new OperatorNode('*', 'multiply', newArgs);\n        } // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)\n\n\n        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {\n          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {\n            return argInner === argOuter ? _derivative(argInner, constNodes) : argInner.clone();\n          }));\n        }));\n      }\n\n      if (node.op === '/' && node.isBinary()) {\n        var arg0 = node.args[0];\n        var arg1 = node.args[1]; // d/dx(f(x) / c) = f'(x) / c\n\n        if (constNodes[arg1] !== undefined) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);\n        } // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\n\n\n        if (constNodes[arg0] !== undefined) {\n          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, constNodes), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);\n        } // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2\n\n\n        return new OperatorNode('/', 'divide', [new OperatorNode('-', 'subtract', [new OperatorNode('*', 'multiply', [_derivative(arg0, constNodes), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, constNodes)])]), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])]);\n      }\n\n      if (node.op === '^' && node.isBinary()) {\n        var _arg = node.args[0];\n        var _arg2 = node.args[1];\n\n        if (constNodes[_arg] !== undefined) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if (type.isConstantNode(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {\n            return createConstantNode(0);\n          } // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)\n\n\n          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);\n        }\n\n        if (constNodes[_arg2] !== undefined) {\n          if (type.isConstantNode(_arg2)) {\n            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0\n            if (isZero(_arg2.value)) {\n              return createConstantNode(0);\n            } // Ignore exponent; f(x)^1 = f(x)\n\n\n            if (equal(_arg2.value, 1)) {\n              return _derivative(_arg, constNodes);\n            }\n          } // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)\n\n\n          var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);\n          return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), powMinusOne])]);\n        } // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]\n\n\n        return new OperatorNode('*', 'multiply', [new OperatorNode('^', 'pow', [_arg.clone(), _arg2.clone()]), new OperatorNode('+', 'add', [new OperatorNode('*', 'multiply', [_derivative(_arg, constNodes), new OperatorNode('/', 'divide', [_arg2.clone(), _arg.clone()])]), new OperatorNode('*', 'multiply', [_derivative(_arg2, constNodes), new FunctionNode('log', [_arg.clone()])])])]);\n      }\n\n      throw new Error('Operator \"' + node.op + '\" is not supported by derivative, or a wrong number of arguments is passed');\n    }\n  });\n  /**\n   * Ensures the number of arguments for a function are correct,\n   * and will throw an error otherwise.\n   *\n   * @param {FunctionNode} node\n   */\n\n\n  function funcArgsCheck(node) {\n    // TODO add min, max etc\n    if ((node.name === 'log' || node.name === 'nthRoot' || node.name === 'pow') && node.args.length === 2) {\n      return;\n    } // There should be an incorrect number of arguments if we reach here\n    // Change all args to constants to avoid unidentified\n    // symbol error when compiling function\n\n\n    for (var i = 0; i < node.args.length; ++i) {\n      node.args[i] = createConstantNode(0);\n    }\n\n    node.compile().eval();\n    throw new Error('Expected TypeError, but none found');\n  }\n  /**\n   * Helper function to create a constant node with a specific type\n   * (number, BigNumber, Fraction)\n   * @param {number} value\n   * @param {string} [valueType]\n   * @return {ConstantNode}\n   */\n\n\n  function createConstantNode(value, valueType) {\n    return new ConstantNode(numeric(value, valueType || config.number));\n  }\n\n  return derivative;\n}\n\nexports.name = 'derivative';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./derivative'), // simplify\nrequire('./simplify'), // polynomial\nrequire('./rationalize'), // decomposition\nrequire('./decomposition/qr'), require('./decomposition/lup'), require('./decomposition/slu'), // solver\nrequire('./solver/lsolve'), require('./solver/lusolve'), require('./solver/usolve')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var simplify = load(require('./simplify'));\n  var simplifyCore = load(require('./simplify/simplifyCore'));\n  var simplifyConstant = load(require('./simplify/simplifyConstant'));\n  var parse = load(require('../../expression/function/parse'));\n\n  var number = require('../../utils/number');\n\n  var ConstantNode = load(require('../../expression/node/ConstantNode'));\n  var OperatorNode = load(require('../../expression/node/OperatorNode'));\n  var SymbolNode = load(require('../../expression/node/SymbolNode'));\n  /**\n   * Transform a rationalizable expression in a rational fraction.\n   * If rational fraction is one variable polynomial then converts\n   * the numerator and denominator in canonical form, with decreasing\n   * exponents, returning the coefficients of numerator.\n   *\n   * Syntax:\n   *\n   *     rationalize(expr)\n   *     rationalize(expr, detailed)\n   *     rationalize(expr, scope)\n   *     rationalize(expr, scope, detailed)\n   *\n   * Examples:\n   *\n   *     math.rationalize('sin(x)+y')\n   *                   //  Error: There is an unsolved function call\n   *     math.rationalize('2x/y - y/(x+1)')\n   *                   // (2*x^2-y^2+2*x)/(x*y+y)\n   *     math.rationalize('(2x+1)^6')\n   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1\n   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')\n   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)\n   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =\n   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/\n   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)\n   *\n   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1\n   *     math.rationalize('x+x+x+y',{})    // 3*x+y\n   *\n   *     const ret = math.rationalize('x+x+x+y',{},true)\n   *                   // ret.expression=3*x+y, ret.variables = [\"x\",\"y\"]\n   *     const ret = math.rationalize('-2+5x^2',{},true)\n   *                   // ret.expression=5*x^2-2, ret.variables = [\"x\"], ret.coefficients=[-2,0,5]\n   *\n   * See also:\n   *\n   *     simplify\n   *\n   * @param  {Node|string} expr    The expression to check if is a polynomial expression\n   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input\n   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)\n   *\n   * @return {Object | Expression Node}    The rational polynomial of `expr` or na object\n   *            {Object}\n   *              {Expression Node} expression: node simplified expression\n   *              {Expression Node} numerator: simplified numerator of expression\n   *              {Expression Node | boolean} denominator: simplified denominator or false (if there is no denominator)\n   *              {Array}           variables:  variable names\n   *              {Array}           coefficients: coefficients of numerator sorted by increased exponent\n   *           {Expression Node}  node simplified expression\n   *\n   */\n\n  var rationalize = typed('rationalize', {\n    'string': function string(expr) {\n      return rationalize(parse(expr), {}, false);\n    },\n    'string, boolean': function stringBoolean(expr, detailed) {\n      return rationalize(parse(expr), {}, detailed);\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return rationalize(parse(expr), scope, false);\n    },\n    'string, Object, boolean': function stringObjectBoolean(expr, scope, detailed) {\n      return rationalize(parse(expr), scope, detailed);\n    },\n    'Node': function Node(expr) {\n      return rationalize(expr, {}, false);\n    },\n    'Node, boolean': function NodeBoolean(expr, detailed) {\n      return rationalize(expr, {}, detailed);\n    },\n    'Node, Object': function NodeObject(expr, scope) {\n      return rationalize(expr, scope, false);\n    },\n    'Node, Object, boolean': function NodeObjectBoolean(expr, scope, detailed) {\n      var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form\n\n      var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial\n\n      var nVars = polyRet.variables.length;\n      expr = polyRet.expression;\n\n      if (nVars >= 1) {\n        // If expression in not a constant\n        expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)\n\n        var sBefore; // Previous expression\n\n        var rules;\n        var eDistrDiv = true;\n        var redoInic = false;\n        expr = simplify(expr, setRules.firstRules, {}, {\n          exactFractions: false\n        }); // Apply the initial rules, including succ div rules\n\n        var s;\n\n        while (true) {\n          // Apply alternately  successive division rules and distr.div.rules\n          rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;\n          expr = simplify(expr, rules); // until no more changes\n\n          eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules\n\n          s = expr.toString();\n\n          if (s === sBefore) {\n            break; // No changes : end of the loop\n          }\n\n          redoInic = true;\n          sBefore = s;\n        }\n\n        if (redoInic) {\n          // Apply first rules again without succ div rules (if there are changes)\n          expr = simplify(expr, setRules.firstRulesAgain, {}, {\n            exactFractions: false\n          });\n        }\n\n        expr = simplify(expr, setRules.finalRules, {}, {\n          exactFractions: false\n        }); // Apply final rules\n      } // NVars >= 1\n\n\n      var coefficients = [];\n      var retRationalize = {};\n\n      if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {\n        // Separate numerator from denominator\n        if (nVars === 1) {\n          expr.args[0] = polyToCanonical(expr.args[0], coefficients);\n          expr.args[1] = polyToCanonical(expr.args[1]);\n        }\n\n        if (detailed) {\n          retRationalize.numerator = expr.args[0];\n          retRationalize.denominator = expr.args[1];\n        }\n      } else {\n        if (nVars === 1) {\n          expr = polyToCanonical(expr, coefficients);\n        }\n\n        if (detailed) {\n          retRationalize.numerator = expr;\n          retRationalize.denominator = null;\n        }\n      } // nVars\n\n\n      if (!detailed) return expr;\n      retRationalize.coefficients = coefficients;\n      retRationalize.variables = polyRet.variables;\n      retRationalize.expression = expr;\n      return retRationalize;\n    } // ^^^^^^^ end of rationalize ^^^^^^^^\n\n  }); // end of typed rationalize\n\n  /**\n   *  Function to simplify an expression using an optional scope and\n   *  return it if the expression is a polynomial expression, i.e.\n   *  an expression with one or more variables and the operators\n   *  +, -, *, and ^, where the exponent can only be a positive integer.\n   *\n   * Syntax:\n   *\n   *     polynomial(expr,scope,extended, rules)\n   *\n   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression\n   * @param  {object} scope           Optional scope for expression simplification\n   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.\n   * @param  {array}  rules           Optional. Default is no rule.\n   *\n   *\n   * @return {Object}\n   *            {Object} node:   node simplified expression\n   *            {Array}  variables:  variable names\n   */\n\n  function polynomial(expr, scope, extended, rules) {\n    var variables = [];\n    var node = simplify(expr, rules, scope, {\n      exactFractions: false\n    }); // Resolves any variables and functions with all defined parameters\n\n    extended = !!extended;\n    var oper = '+-*' + (extended ? '/' : '');\n    recPoly(node);\n    var retFunc = {};\n    retFunc.expression = node;\n    retFunc.variables = variables;\n    return retFunc; // -------------------------------------------------------------------------------------------------------\n\n    /**\n     *  Function to simplify an expression using an optional scope and\n     *  return it if the expression is a polynomial expression, i.e.\n     *  an expression with one or more variables and the operators\n     *  +, -, *, and ^, where the exponent can only be a positive integer.\n     *\n     * Syntax:\n     *\n     *     recPoly(node)\n     *\n     *\n     * @param  {Node} node               The current sub tree expression in recursion\n     *\n     * @return                           nothing, throw an exception if error\n     */\n\n    function recPoly(node) {\n      var tp = node.type; // node type\n\n      if (tp === 'FunctionNode') {\n        // No function call in polynomial expression\n        throw new Error('There is an unsolved function call');\n      } else if (tp === 'OperatorNode') {\n        if (node.op === '^') {\n          if (node.args[1].fn === 'unaryMinus') {\n            node = node.args[0];\n          }\n\n          if (node.args[1].type !== 'ConstantNode' || !number.isInteger(parseFloat(node.args[1].value))) {\n            throw new Error('There is a non-integer exponent');\n          } else {\n            recPoly(node.args[0]);\n          }\n        } else {\n          if (oper.indexOf(node.op) === -1) {\n            throw new Error('Operator ' + node.op + ' invalid in polynomial expression');\n          }\n\n          for (var i = 0; i < node.args.length; i++) {\n            recPoly(node.args[i]);\n          }\n        } // type of operator\n\n      } else if (tp === 'SymbolNode') {\n        var name = node.name; // variable name\n\n        var pos = variables.indexOf(name);\n\n        if (pos === -1) {\n          // new variable in expression\n          variables.push(name);\n        }\n      } else if (tp === 'ParenthesisNode') {\n        recPoly(node.content);\n      } else if (tp !== 'ConstantNode') {\n        throw new Error('type ' + tp + ' is not allowed in polynomial expression');\n      }\n    } // end of recPoly\n\n  } // end of polynomial\n  // ---------------------------------------------------------------------------------------\n\n  /**\n   * Return a rule set to rationalize an polynomial expression in rationalize\n   *\n   * Syntax:\n   *\n   *     rulesRationalize()\n   *\n   * @return {array}        rule set to rationalize an polynomial expression\n   */\n\n\n  function rulesRationalize() {\n    var oldRules = [simplifyCore, // sCore\n    {\n      l: 'n+n',\n      r: '2*n'\n    }, {\n      l: 'n+-n',\n      r: '0'\n    }, simplifyConstant, // sConstant\n    {\n      l: 'n*(n1^-1)',\n      r: 'n/n1'\n    }, {\n      l: 'n*n1^-n2',\n      r: 'n/n1^n2'\n    }, {\n      l: 'n1^-1',\n      r: '1/n1'\n    }, {\n      l: 'n*(n1/n2)',\n      r: '(n*n1)/n2'\n    }, {\n      l: '1*n',\n      r: 'n'\n    }];\n    var rulesFirst = [{\n      l: '(-n1)/(-n2)',\n      r: 'n1/n2'\n    }, // Unary division\n    {\n      l: '(-n1)*(-n2)',\n      r: 'n1*n2'\n    }, // Unary multiplication\n    {\n      l: 'n1--n2',\n      r: 'n1+n2'\n    }, // '--' elimination\n    {\n      l: 'n1-n2',\n      r: 'n1+(-n2)'\n    }, // Subtraction turn into add with un�ry minus\n    {\n      l: '(n1+n2)*n3',\n      r: '(n1*n3 + n2*n3)'\n    }, // Distributive 1\n    {\n      l: 'n1*(n2+n3)',\n      r: '(n1*n2+n1*n3)'\n    }, // Distributive 2\n    {\n      l: 'c1*n + c2*n',\n      r: '(c1+c2)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n + n',\n      r: '(c1+1)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n - c2*n',\n      r: '(c1-c2)*n'\n    }, // Joining constants\n    {\n      l: 'c1*n - n',\n      r: '(c1-1)*n'\n    }, // Joining constants\n    {\n      l: 'v/c',\n      r: '(1/c)*v'\n    }, // variable/constant (new!)\n    {\n      l: 'v/-c',\n      r: '-(1/c)*v'\n    }, // variable/constant (new!)\n    {\n      l: '-v*-c',\n      r: 'c*v'\n    }, // Inversion constant and variable 1\n    {\n      l: '-v*c',\n      r: '-c*v'\n    }, // Inversion constant and variable 2\n    {\n      l: 'v*-c',\n      r: '-c*v'\n    }, // Inversion constant and variable 3\n    {\n      l: 'v*c',\n      r: 'c*v'\n    }, // Inversion constant and variable 4\n    {\n      l: '-(-n1*n2)',\n      r: '(n1*n2)'\n    }, // Unary propagation\n    {\n      l: '-(n1*n2)',\n      r: '(-n1*n2)'\n    }, // Unary propagation\n    {\n      l: '-(-n1+n2)',\n      r: '(n1-n2)'\n    }, // Unary propagation\n    {\n      l: '-(n1+n2)',\n      r: '(-n1-n2)'\n    }, // Unary propagation\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    }, // Power to Power\n    {\n      l: '-(-n1/n2)',\n      r: '(n1/n2)'\n    }, // Division and Unary\n    {\n      l: '-(n1/n2)',\n      r: '(-n1/n2)'\n    }]; // Divisao and Unary\n\n    var rulesDistrDiv = [{\n      l: '(n1/n2 + n3/n4)',\n      r: '((n1*n4 + n3*n2)/(n2*n4))'\n    }, // Sum of fractions\n    {\n      l: '(n1/n2 + n3)',\n      r: '((n1 + n3*n2)/n2)'\n    }, // Sum fraction with number 1\n    {\n      l: '(n1 + n2/n3)',\n      r: '((n1*n3 + n2)/n3)'\n    }]; // Sum fraction with number 1\n\n    var rulesSucDiv = [{\n      l: '(n1/(n2/n3))',\n      r: '((n1*n3)/n2)'\n    }, // Division simplification\n    {\n      l: '(n1/n2/n3)',\n      r: '(n1/(n2*n3))'\n    }];\n    var setRules = {}; // rules set in 4 steps.\n    // All rules => infinite loop\n    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)\n\n    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv); // First rule set\n\n    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules\n\n    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules\n\n    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.\n    // Division simplification\n    // Second rule set.\n    // There is no aggregate expression with parentesis, but the only variable can be scattered.\n\n    setRules.finalRules = [simplifyCore, // simplify.rules[0]\n    {\n      l: 'n*-n',\n      r: '-n^2'\n    }, // Joining multiply with power 1\n    {\n      l: 'n*n',\n      r: 'n^2'\n    }, // Joining multiply with power 2\n    simplifyConstant, // simplify.rules[14] old 3rd index in oldRules\n    {\n      l: 'n*-n^n1',\n      r: '-n^(n1+1)'\n    }, // Joining multiply with power 3\n    {\n      l: 'n*n^n1',\n      r: 'n^(n1+1)'\n    }, // Joining multiply with power 4\n    {\n      l: 'n^n1*-n^n2',\n      r: '-n^(n1+n2)'\n    }, // Joining multiply with power 5\n    {\n      l: 'n^n1*n^n2',\n      r: 'n^(n1+n2)'\n    }, // Joining multiply with power 6\n    {\n      l: 'n^n1*-n',\n      r: '-n^(n1+1)'\n    }, // Joining multiply with power 7\n    {\n      l: 'n^n1*n',\n      r: 'n^(n1+1)'\n    }, // Joining multiply with power 8\n    {\n      l: 'n^n1/-n',\n      r: '-n^(n1-1)'\n    }, // Joining multiply with power 8\n    {\n      l: 'n^n1/n',\n      r: 'n^(n1-1)'\n    }, // Joining division with power 1\n    {\n      l: 'n/-n^n1',\n      r: '-n^(1-n1)'\n    }, // Joining division with power 2\n    {\n      l: 'n/n^n1',\n      r: 'n^(1-n1)'\n    }, // Joining division with power 3\n    {\n      l: 'n^n1/-n^n2',\n      r: 'n^(n1-n2)'\n    }, // Joining division with power 4\n    {\n      l: 'n^n1/n^n2',\n      r: 'n^(n1-n2)'\n    }, // Joining division with power 5\n    {\n      l: 'n1+(-n2*n3)',\n      r: 'n1-n2*n3'\n    }, // Solving useless parenthesis 1\n    {\n      l: 'v*(-c)',\n      r: '-c*v'\n    }, // Solving useless unary 2\n    {\n      l: 'n1+-n2',\n      r: 'n1-n2'\n    }, // Solving +- together (new!)\n    {\n      l: 'v*c',\n      r: 'c*v'\n    }, // inversion constant with variable\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))' // Power to Power\n\n    }];\n    return setRules;\n  } // End rulesRationalize\n  // ---------------------------------------------------------------------------------------\n\n  /**\n   *  Expand recursively a tree node for handling with expressions with exponents\n   *  (it's not for constants, symbols or functions with exponents)\n   *  PS: The other parameters are internal for recursion\n   *\n   * Syntax:\n   *\n   *     expandPower(node)\n   *\n   * @param  {Node} node         Current expression node\n   * @param  {node} parent       Parent current node inside the recursion\n   * @param  (int}               Parent number of chid inside the rercursion\n   *\n   * @return {node}        node expression with all powers expanded.\n   */\n\n\n  function expandPower(node, parent, indParent) {\n    var tp = node.type;\n    var internal = arguments.length > 1; // TRUE in internal calls\n\n    if (tp === 'OperatorNode' && node.isBinary()) {\n      var does = false;\n      var val;\n\n      if (node.op === '^') {\n        // First operator: Parenthesis or UnaryMinus\n        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {\n          // Second operator: Constant\n          val = parseFloat(node.args[1].value);\n          does = val >= 2 && number.isInteger(val);\n        }\n      }\n\n      if (does) {\n        // Exponent >= 2\n        // Before:\n        //            operator A --> Subtree\n        // parent pow\n        //            constant\n        //\n        if (val > 2) {\n          // Exponent > 2,\n          // AFTER:  (exponent > 2)\n          //             operator A --> Subtree\n          // parent  *\n          //                 deep clone (operator A --> Subtree\n          //             pow\n          //                 constant - 1\n          //\n          var nEsqTopo = node.args[0];\n          var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);\n          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);\n        } else {\n          // Expo = 2 - no power\n          // AFTER:  (exponent =  2)\n          //             operator A --> Subtree\n          // parent   oper\n          //            deep clone (operator A --> Subtree)\n          //\n          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()]);\n        }\n\n        if (internal) {\n          // Change parent references in internal recursive calls\n          if (indParent === 'content') {\n            parent.content = node;\n          } else {\n            parent.args[indParent] = node;\n          }\n        }\n      } // does\n\n    } // binary OperatorNode\n\n\n    if (tp === 'ParenthesisNode') {\n      // Recursion\n      expandPower(node.content, node, 'content');\n    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {\n      for (var i = 0; i < node.args.length; i++) {\n        expandPower(node.args[i], node, i);\n      }\n    }\n\n    if (!internal) {\n      // return the root node\n      return node;\n    }\n  } // End expandPower\n  // ---------------------------------------------------------------------------------------\n\n  /**\n   * Auxilary function for rationalize\n   * Convert near canonical polynomial in one variable in a canonical polynomial\n   * with one term for each exponent in decreasing order\n   *\n   * Syntax:\n   *\n   *     polyToCanonical(node [, coefficients])\n   *\n   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression\n   *\n   *        The string or tree expression needs to be at below syntax, with free spaces:\n   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+\n   *       Where 'var' is one variable with any valid name\n   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1\n   *             'expo' are integers greater than 0. It can be omitted if equal than 1.\n   *\n   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent\n   *\n   *\n   * @return {node}        new node tree with one variable polynomial or string error.\n   */\n\n\n  function polyToCanonical(node, coefficients) {\n    if (coefficients === undefined) {\n      coefficients = [];\n    } // coefficients.\n\n\n    coefficients[0] = 0; // index is the exponent\n\n    var o = {};\n    o.cte = 1;\n    o.oper = '+'; // fire: mark with * or ^ when finds * or ^ down tree, reset to \"\" with + and -.\n    //       It is used to deduce the exponent: 1 for *, 0 for \"\".\n\n    o.fire = '';\n    var maxExpo = 0; // maximum exponent\n\n    var varname = ''; // variable name\n\n    recurPol(node, null, o);\n    maxExpo = coefficients.length - 1;\n    var first = true;\n    var no;\n\n    for (var i = maxExpo; i >= 0; i--) {\n      if (coefficients[i] === 0) continue;\n      var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));\n      var op = coefficients[i] < 0 ? '-' : '+';\n\n      if (i > 0) {\n        // Is not a constant without variable\n        var n2 = new SymbolNode(varname);\n\n        if (i > 1) {\n          var n3 = new ConstantNode(i);\n          n2 = new OperatorNode('^', 'pow', [n2, n3]);\n        }\n\n        if (coefficients[i] === -1 && first) {\n          n1 = new OperatorNode('-', 'unaryMinus', [n2]);\n        } else if (Math.abs(coefficients[i]) === 1) {\n          n1 = n2;\n        } else {\n          n1 = new OperatorNode('*', 'multiply', [n1, n2]);\n        }\n      }\n\n      if (first) {\n        no = n1;\n      } else if (op === '+') {\n        no = new OperatorNode('+', 'add', [no, n1]);\n      } else {\n        no = new OperatorNode('-', 'subtract', [no, n1]);\n      }\n\n      first = false;\n    } // for\n\n\n    if (first) {\n      return new ConstantNode(0);\n    } else {\n      return no;\n    }\n    /**\n     * Recursive auxilary function inside polyToCanonical for\n     * converting expression in canonical form\n     *\n     * Syntax:\n     *\n     *     recurPol(node, noPai, obj)\n     *\n     * @param  {Node} node        The current subpolynomial expression\n     * @param  {Node | Null}  noPai   The current parent node\n     * @param  {object}    obj        Object with many internal flags\n     *\n     * @return {}                    No return. If error, throws an exception\n     */\n\n\n    function recurPol(node, noPai, o) {\n      var tp = node.type;\n\n      if (tp === 'FunctionNode') {\n        // ***** FunctionName *****\n        // No function call in polynomial expression\n        throw new Error('There is an unsolved function call');\n      } else if (tp === 'OperatorNode') {\n        // ***** OperatorName *****\n        if ('+-*^'.indexOf(node.op) === -1) throw new Error('Operator ' + node.op + ' invalid');\n\n        if (noPai !== null) {\n          // -(unary),^  : children of *,+,-\n          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {\n            throw new Error('Invalid ' + node.op + ' placing');\n          } // -,+,* : children of +,-\n\n\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {\n            throw new Error('Invalid ' + node.op + ' placing');\n          } // -,+ : first child\n\n\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {\n            throw new Error('Invalid ' + node.op + ' placing');\n          }\n        } // Has parent\n        // Firers: ^,*       Old:   ^,&,-(unary): firers\n\n\n        if (node.op === '^' || node.op === '*') {\n          o.fire = node.op;\n        }\n\n        for (var _i = 0; _i < node.args.length; _i++) {\n          // +,-: reset fire\n          if (node.fn === 'unaryMinus') o.oper = '-';\n\n          if (node.op === '+' || node.fn === 'subtract') {\n            o.fire = '';\n            o.cte = 1; // default if there is no constant\n\n            o.oper = _i === 0 ? '+' : node.op;\n          }\n\n          o.noFil = _i; // number of son\n\n          recurPol(node.args[_i], node, o);\n        } // for in children\n\n      } else if (tp === 'SymbolNode') {\n        // ***** SymbolName *****\n        if (node.name !== varname && varname !== '') {\n          throw new Error('There is more than one variable');\n        }\n\n        varname = node.name;\n\n        if (noPai === null) {\n          coefficients[1] = 1;\n          return;\n        } // ^: Symbol is First child\n\n\n        if (noPai.op === '^' && o.noFil !== 0) {\n          throw new Error('In power the variable should be the first parameter');\n        } // *: Symbol is Second child\n\n\n        if (noPai.op === '*' && o.noFil !== 1) {\n          throw new Error('In multiply the variable should be the second parameter');\n        } // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)\n\n\n        if (o.fire === '' || o.fire === '*') {\n          if (maxExpo < 1) coefficients[1] = 0;\n          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1);\n          maxExpo = Math.max(1, maxExpo);\n        }\n      } else if (tp === 'ConstantNode') {\n        var valor = parseFloat(node.value);\n\n        if (noPai === null) {\n          coefficients[0] = valor;\n          return;\n        }\n\n        if (noPai.op === '^') {\n          // cte: second  child of power\n          if (o.noFil !== 1) throw new Error('Constant cannot be powered');\n\n          if (!number.isInteger(valor) || valor <= 0) {\n            throw new Error('Non-integer exponent is not allowed');\n          }\n\n          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {\n            coefficients[_i2] = 0;\n          }\n\n          if (valor > maxExpo) coefficients[valor] = 0;\n          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1);\n          maxExpo = Math.max(valor, maxExpo);\n          return;\n        }\n\n        o.cte = valor; // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.\n\n        if (o.fire === '') {\n          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);\n        }\n      } else {\n        throw new Error('Type ' + tp + ' is not allowed');\n      }\n    } // End of recurPol\n\n  } // End of polyToCanonical\n\n\n  return rationalize;\n} // end of factory\n\n\nexports.name = 'rationalize';\nexports.factory = factory;","'use strict';\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 factory(type, config, load, typed, math) {\n  var parse = load(require('../../expression/parse'));\n  var equal = load(require('../relational/equal'));\n  var ConstantNode = load(require('../../expression/node/ConstantNode'));\n  var FunctionNode = load(require('../../expression/node/FunctionNode'));\n  var OperatorNode = load(require('../../expression/node/OperatorNode'));\n  var ParenthesisNode = load(require('../../expression/node/ParenthesisNode'));\n  var SymbolNode = load(require('../../expression/node/SymbolNode'));\n  var simplifyConstant = load(require('./simplify/simplifyConstant'));\n  var simplifyCore = load(require('./simplify/simplifyCore'));\n  var resolve = load(require('./simplify/resolve'));\n  var util = load(require('./simplify/util'));\n  var isCommutative = util.isCommutative;\n  var isAssociative = util.isAssociative;\n  var flatten = util.flatten;\n  var unflattenr = util.unflattenr;\n  var unflattenl = util.unflattenl;\n  var createMakeNodeFunction = util.createMakeNodeFunction;\n  /**\n   * Simplify an expression tree.\n   *\n   * A list of rules are applied to an expression, repeating over the list until\n   * no further changes are made.\n   * It's possible to pass a custom set of rules to the function as second\n   * argument. A rule can be specified as an object, string, or function:\n   *\n   *     const rules = [\n   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },\n   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',\n   *       function (node) {\n   *         // ... return a new node or return the node unchanged\n   *         return node\n   *       }\n   *     ]\n   *\n   * String and object rules consist of a left and right pattern. The left is\n   * used to match against the expression and the right determines what matches\n   * are replaced with. The main difference between a pattern and a normal\n   * expression is that variables starting with the following characters are\n   * interpreted as wildcards:\n   *\n   * - 'n' - matches any Node\n   * - 'c' - matches any ConstantNode\n   * - 'v' - matches any Node that is not a ConstantNode\n   *\n   * The default list of rules is exposed on the function as `simplify.rules`\n   * and can be used as a basis to built a set of custom rules.\n   *\n   * For more details on the theory, see:\n   *\n   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)\n   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)\n   *\n   *  An optional `options` argument can be passed as last argument of `simplify`.\n   *  There is currently one option available: `exactFractions`, a boolean which\n   *  is `true` by default.\n   *\n   * Syntax:\n   *\n   *     simplify(expr)\n   *     simplify(expr, rules)\n   *     simplify(expr, rules)\n   *     simplify(expr, rules, scope)\n   *     simplify(expr, rules, scope, options)\n   *     simplify(expr, scope)\n   *     simplify(expr, scope, options)\n   *\n   * Examples:\n   *\n   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node \"2 * x\"\n   *     math.simplify('2 * 3 * x', {x: 4})        // Node \"24\"\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simplify(f)                          // Node \"2 * x\"\n   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node \"x * 2 / 5\"\n   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node \"0.4 * x\"\n   *\n   * See also:\n   *\n   *     derivative, parse, eval, rationalize\n   *\n   * @param {Node | string} expr\n   *            The expression to be simplified\n   * @param {Array<{l:string, r: string} | string | function>} [rules]\n   *            Optional list with custom rules\n   * @return {Node} Returns the simplified form of `expr`\n   */\n\n  var simplify = typed('simplify', {\n    'string': function string(expr) {\n      return simplify(parse(expr), simplify.rules, {}, {});\n    },\n    'string, Object': function stringObject(expr, scope) {\n      return simplify(parse(expr), simplify.rules, scope, {});\n    },\n    'string, Object, Object': function stringObjectObject(expr, scope, options) {\n      return simplify(parse(expr), simplify.rules, scope, options);\n    },\n    'string, Array': function stringArray(expr, rules) {\n      return simplify(parse(expr), rules, {}, {});\n    },\n    'string, Array, Object': function stringArrayObject(expr, rules, scope) {\n      return simplify(parse(expr), rules, scope, {});\n    },\n    'string, Array, Object, Object': function stringArrayObjectObject(expr, rules, scope, options) {\n      return simplify(parse(expr), rules, scope, options);\n    },\n    'Node, Object': function NodeObject(expr, scope) {\n      return simplify(expr, simplify.rules, scope, {});\n    },\n    'Node, Object, Object': function NodeObjectObject(expr, scope, options) {\n      return simplify(expr, simplify.rules, scope, options);\n    },\n    'Node': function Node(expr) {\n      return simplify(expr, simplify.rules, {}, {});\n    },\n    'Node, Array': function NodeArray(expr, rules) {\n      return simplify(expr, rules, {}, {});\n    },\n    'Node, Array, Object': function NodeArrayObject(expr, rules, scope) {\n      return simplify(expr, rules, scope, {});\n    },\n    'Node, Array, Object, Object': function NodeArrayObjectObject(expr, rules, scope, options) {\n      rules = _buildRules(rules);\n      var res = resolve(expr, scope);\n      res = removeParens(res);\n      var visited = {};\n      var str = res.toString({\n        parenthesis: 'all'\n      });\n\n      while (!visited[str]) {\n        visited[str] = true;\n        _lastsym = 0; // counter for placeholder symbols\n\n        for (var i = 0; i < rules.length; i++) {\n          if (typeof rules[i] === 'function') {\n            res = rules[i](res, options);\n          } else {\n            flatten(res);\n            res = applyRule(res, rules[i]);\n          }\n\n          unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it\n        }\n\n        str = res.toString({\n          parenthesis: 'all'\n        });\n      }\n\n      return res;\n    }\n  });\n  simplify.simplifyCore = simplifyCore;\n  simplify.resolve = resolve;\n\n  function removeParens(node) {\n    return node.transform(function (node, path, parent) {\n      return type.isParenthesisNode(node) ? node.content : node;\n    });\n  } // All constants that are allowed in rules\n\n\n  var SUPPORTED_CONSTANTS = {\n    true: true,\n    false: true,\n    e: true,\n    i: true,\n    Infinity: true,\n    LN2: true,\n    LN10: true,\n    LOG2E: true,\n    LOG10E: true,\n    NaN: true,\n    phi: true,\n    pi: true,\n    SQRT1_2: true,\n    SQRT2: true,\n    tau: true // null: false,\n    // undefined: false,\n    // version: false,\n    // Array of strings, used to build the ruleSet.\n    // Each l (left side) and r (right side) are parsed by\n    // the expression parser into a node tree.\n    // Left hand sides are matched to subtrees within the\n    // expression to be parsed and replaced with the right\n    // hand side.\n    // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])\n    // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.\n    // It is possible to get into an infinite loop with conflicting rules\n\n  };\n  simplify.rules = [simplifyCore, // { l: 'n+0', r: 'n' },     // simplifyCore\n  // { l: 'n^0', r: '1' },     // simplifyCore\n  // { l: '0*n', r: '0' },     // simplifyCore\n  // { l: 'n/n', r: '1'},      // simplifyCore\n  // { l: 'n^1', r: 'n' },     // simplifyCore\n  // { l: '+n1', r:'n1' },     // simplifyCore\n  // { l: 'n--n1', r:'n+n1' }, // simplifyCore\n  {\n    l: 'log(e)',\n    r: '1'\n  }, // temporary rules\n  {\n    l: 'n-n1',\n    r: 'n+-n1'\n  }, // temporarily replace 'subtract' so we can further flatten the 'add' operator\n  {\n    l: '-(c*v)',\n    r: '(-c) * v'\n  }, // make non-constant terms positive\n  {\n    l: '-v',\n    r: '(-1) * v'\n  }, {\n    l: 'n/n1^n2',\n    r: 'n*n1^-n2'\n  }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator\n  {\n    l: 'n/n1',\n    r: 'n*n1^-1'\n  }, // expand nested exponentiation\n  {\n    l: '(n ^ n1) ^ n2',\n    r: 'n ^ (n1 * n2)'\n  }, // collect like factors\n  {\n    l: 'n*n',\n    r: 'n^2'\n  }, {\n    l: 'n * n^n1',\n    r: 'n^(n1+1)'\n  }, {\n    l: 'n^n1 * n^n2',\n    r: 'n^(n1+n2)'\n  }, // collect like terms\n  {\n    l: 'n+n',\n    r: '2*n'\n  }, {\n    l: 'n+-n',\n    r: '0'\n  }, {\n    l: 'n1*n2 + n2',\n    r: '(n1+1)*n2'\n  }, {\n    l: 'n1*n3 + n2*n3',\n    r: '(n1+n2)*n3'\n  }, // remove parenthesis in the case of negating a quantitiy\n  {\n    l: 'n1 + -1 * (n2 + n3)',\n    r: 'n1 + -1 * n2 + -1 * n3'\n  }, simplifyConstant, {\n    l: '(-n)*n1',\n    r: '-(n*n1)'\n  }, // make factors positive (and undo 'make non-constant terms positive')\n  // ordering of constants\n  {\n    l: 'c+v',\n    r: 'v+c',\n    context: {\n      'add': {\n        commutative: false\n      }\n    }\n  }, {\n    l: 'v*c',\n    r: 'c*v',\n    context: {\n      'multiply': {\n        commutative: false\n      }\n    }\n  }, // undo temporary rules\n  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant\n  {\n    l: 'n+-n1',\n    r: 'n-n1'\n  }, // undo replace 'subtract'\n  {\n    l: 'n*(n1^-1)',\n    r: 'n/n1'\n  }, // undo replace 'divide'\n  {\n    l: 'n*n1^-n2',\n    r: 'n/n1^n2'\n  }, {\n    l: 'n1^-1',\n    r: '1/n1'\n  }, {\n    l: 'n*(n1/n2)',\n    r: '(n*n1)/n2'\n  }, // '*' before '/'\n  {\n    l: 'n-(n1+n2)',\n    r: 'n-n1-n2'\n  }, // '-' before '+'\n  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },\n  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },\n  {\n    l: '1*n',\n    r: 'n' // this pattern can be produced by simplifyConstant\n\n  }];\n  /**\n   * Parse the string array of rules into nodes\n   *\n   * Example syntax for rules:\n   *\n   * Position constants to the left in a product:\n   * { l: 'n1 * c1', r: 'c1 * n1' }\n   * n1 is any Node, and c1 is a ConstantNode.\n   *\n   * Apply difference of squares formula:\n   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }\n   * n1, n2 mean any Node.\n   *\n   * Short hand notation:\n   * 'n1 * c1 -> c1 * n1'\n   */\n\n  function _buildRules(rules) {\n    // Array of rules to be used to simplify expressions\n    var ruleSet = [];\n\n    for (var i = 0; i < rules.length; i++) {\n      var rule = rules[i];\n      var newRule = void 0;\n\n      var ruleType = _typeof(rule);\n\n      switch (ruleType) {\n        case 'string':\n          var lr = rule.split('->');\n\n          if (lr.length === 2) {\n            rule = {\n              l: lr[0],\n              r: lr[1]\n            };\n          } else {\n            throw SyntaxError('Could not parse rule: ' + rule);\n          }\n\n        /* falls through */\n\n        case 'object':\n          newRule = {\n            l: removeParens(parse(rule.l)),\n            r: removeParens(parse(rule.r))\n          };\n\n          if (rule.context) {\n            newRule.evaluate = rule.context;\n          }\n\n          if (rule.evaluate) {\n            newRule.evaluate = parse(rule.evaluate);\n          }\n\n          if (isAssociative(newRule.l)) {\n            var makeNode = createMakeNodeFunction(newRule.l);\n\n            var expandsym = _getExpandPlaceholderSymbol();\n\n            newRule.expanded = {};\n            newRule.expanded.l = makeNode([newRule.l.clone(), expandsym]); // Push the expandsym into the deepest possible branch.\n            // This helps to match the newRule against nodes returned from getSplits() later on.\n\n            flatten(newRule.expanded.l);\n            unflattenr(newRule.expanded.l);\n            newRule.expanded.r = makeNode([newRule.r, expandsym]);\n          }\n\n          break;\n\n        case 'function':\n          newRule = rule;\n          break;\n\n        default:\n          throw TypeError('Unsupported type of rule: ' + ruleType);\n      } // console.log('Adding rule: ' + rules[i])\n      // console.log(newRule)\n\n\n      ruleSet.push(newRule);\n    }\n\n    return ruleSet;\n  }\n\n  var _lastsym = 0;\n\n  function _getExpandPlaceholderSymbol() {\n    return new SymbolNode('_p' + _lastsym++);\n  }\n  /**\n   * Returns a simplfied form of node, or the original node if no simplification was possible.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.\n   */\n\n\n  var applyRule = typed('applyRule', {\n    'Node, Object': function NodeObject(node, rule) {\n      // console.log('Entering applyRule(' + node.toString() + ')')\n      // Do not clone node unless we find a match\n      var res = node; // First replace our child nodes with their simplified versions\n      // If a child could not be simplified, the assignments will have\n      // no effect since the node is returned unchanged\n\n      if (res instanceof OperatorNode || res instanceof FunctionNode) {\n        if (res.args) {\n          for (var i = 0; i < res.args.length; i++) {\n            res.args[i] = applyRule(res.args[i], rule);\n          }\n        }\n      } else if (res instanceof ParenthesisNode) {\n        if (res.content) {\n          res.content = applyRule(res.content, rule);\n        }\n      } // Try to match a rule against this node\n\n\n      var repl = rule.r;\n\n      var matches = _ruleMatch(rule.l, res)[0]; // If the rule is associative operator, we can try matching it while allowing additional terms.\n      // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.\n\n\n      if (!matches && rule.expanded) {\n        repl = rule.expanded.r;\n        matches = _ruleMatch(rule.expanded.l, res)[0];\n      }\n\n      if (matches) {\n        // const before = res.toString({parenthesis: 'all'})\n        // Create a new node by cloning the rhs of the matched rule\n        // we keep any implicit multiplication state if relevant\n        var implicit = res.implicit;\n        res = repl.clone();\n\n        if (implicit && 'implicit' in repl) {\n          res.implicit = true;\n        } // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes\n\n\n        var _transform = function _transform(node) {\n          if (node.isSymbolNode && matches.placeholders.hasOwnProperty(node.name)) {\n            return matches.placeholders[node.name].clone();\n          } else {\n            return node.map(_transform);\n          }\n        };\n\n        res = _transform(res); // const after = res.toString({parenthesis: 'all'})\n        // console.log('Simplified ' + before + ' to ' + after)\n      }\n\n      return res;\n    }\n  });\n  /**\n   * Get (binary) combinations of a flattened binary node\n   * e.g. +(node1, node2, node3) -> [\n   *        +(node1,  +(node2, node3)),\n   *        +(node2,  +(node1, node3)),\n   *        +(node3,  +(node1, node2))]\n   *\n   */\n\n  function getSplits(node, context) {\n    var res = [];\n    var right, rightArgs;\n    var makeNode = createMakeNodeFunction(node);\n\n    if (isCommutative(node, context)) {\n      for (var i = 0; i < node.args.length; i++) {\n        rightArgs = node.args.slice(0);\n        rightArgs.splice(i, 1);\n        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);\n        res.push(makeNode([node.args[i], right]));\n      }\n    } else {\n      rightArgs = node.args.slice(1);\n      right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);\n      res.push(makeNode([node.args[0], right]));\n    }\n\n    return res;\n  }\n  /**\n   * Returns the set union of two match-placeholders or null if there is a conflict.\n   */\n\n\n  function mergeMatch(match1, match2) {\n    var res = {\n      placeholders: {} // Some matches may not have placeholders; this is OK\n\n    };\n\n    if (!match1.placeholders && !match2.placeholders) {\n      return res;\n    } else if (!match1.placeholders) {\n      return match2;\n    } else if (!match2.placeholders) {\n      return match1;\n    } // Placeholders with the same key must match exactly\n\n\n    for (var key in match1.placeholders) {\n      res.placeholders[key] = match1.placeholders[key];\n\n      if (match2.placeholders.hasOwnProperty(key)) {\n        if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {\n          return null;\n        }\n      }\n    }\n\n    for (var _key in match2.placeholders) {\n      res.placeholders[_key] = match2.placeholders[_key];\n    }\n\n    return res;\n  }\n  /**\n   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.\n   * Each list represents matches found in one child of a node.\n   */\n\n\n  function combineChildMatches(list1, list2) {\n    var res = [];\n\n    if (list1.length === 0 || list2.length === 0) {\n      return res;\n    }\n\n    var merged;\n\n    for (var i1 = 0; i1 < list1.length; i1++) {\n      for (var i2 = 0; i2 < list2.length; i2++) {\n        merged = mergeMatch(list1[i1], list2[i2]);\n\n        if (merged) {\n          res.push(merged);\n        }\n      }\n    }\n\n    return res;\n  }\n  /**\n   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.\n   * Each list represents matches found in one child of a node.\n   * Returns a list of unique matches.\n   */\n\n\n  function mergeChildMatches(childMatches) {\n    if (childMatches.length === 0) {\n      return childMatches;\n    }\n\n    var sets = childMatches.reduce(combineChildMatches);\n    var uniqueSets = [];\n    var unique = {};\n\n    for (var i = 0; i < sets.length; i++) {\n      var s = JSON.stringify(sets[i]);\n\n      if (!unique[s]) {\n        unique[s] = true;\n        uniqueSets.push(sets[i]);\n      }\n    }\n\n    return uniqueSets;\n  }\n  /**\n   * Determines whether node matches rule.\n   *\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @return {Object} Information about the match, if it exists.\n   */\n\n\n  function _ruleMatch(rule, node, isSplit) {\n    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')\n    //    console.log('rule = ' + rule)\n    //    console.log('node = ' + node)\n    //    console.log('Entering _ruleMatch(' + rule.toString() + ', ' + node.toString() + ')')\n    var res = [{\n      placeholders: {}\n    }];\n\n    if (rule instanceof OperatorNode && node instanceof OperatorNode || rule instanceof FunctionNode && node instanceof FunctionNode) {\n      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly\n      if (rule instanceof OperatorNode) {\n        if (rule.op !== node.op || rule.fn !== node.fn) {\n          return [];\n        }\n      } else if (rule instanceof FunctionNode) {\n        if (rule.name !== node.name) {\n          return [];\n        }\n      } // rule and node match. Search the children of rule and node.\n\n\n      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node) || isSplit) {\n        // Expect non-associative operators to match exactly\n        var childMatches = [];\n\n        for (var i = 0; i < rule.args.length; i++) {\n          var childMatch = _ruleMatch(rule.args[i], node.args[i]);\n\n          if (childMatch.length === 0) {\n            // Child did not match, so stop searching immediately\n            return [];\n          } // The child matched, so add the information returned from the child to our result\n\n\n          childMatches.push(childMatch);\n        }\n\n        res = mergeChildMatches(childMatches);\n      } else if (node.args.length >= 2 && rule.args.length === 2) {\n        // node is flattened, rule is not\n        // Associative operators/functions can be split in different ways so we check if the rule matches each\n        // them and return their union.\n        var splits = getSplits(node, rule.context);\n        var splitMatches = [];\n\n        for (var _i = 0; _i < splits.length; _i++) {\n          var matchSet = _ruleMatch(rule, splits[_i], true); // recursing at the same tree depth here\n\n\n          splitMatches = splitMatches.concat(matchSet);\n        }\n\n        return splitMatches;\n      } else if (rule.args.length > 2) {\n        throw Error('Unexpected non-binary associative function: ' + rule.toString());\n      } else {\n        // Incorrect number of arguments in rule and node, so no match\n        return [];\n      }\n    } else if (rule instanceof SymbolNode) {\n      // If the rule is a SymbolNode, then it carries a special meaning\n      // according to the first character of the symbol node name.\n      // c.* matches a ConstantNode\n      // n.* matches any node\n      if (rule.name.length === 0) {\n        throw new Error('Symbol in rule has 0 length...!?');\n      }\n\n      if (math.hasOwnProperty(rule.name)) {\n        if (!SUPPORTED_CONSTANTS[rule.name]) {\n          throw new Error('Built in constant: ' + rule.name + ' is not supported by simplify.');\n        } // built-in constant must match exactly\n\n\n        if (rule.name !== node.name) {\n          return [];\n        }\n      } else if (rule.name[0] === 'n' || rule.name.substring(0, 2) === '_p') {\n        // rule matches _anything_, so assign this node to the rule.name placeholder\n        // Assign node to the rule.name placeholder.\n        // Our parent will check for matches among placeholders.\n        res[0].placeholders[rule.name] = node;\n      } else if (rule.name[0] === 'v') {\n        // rule matches any variable thing (not a ConstantNode)\n        if (!type.isConstantNode(node)) {\n          res[0].placeholders[rule.name] = node;\n        } else {\n          // Mis-match: rule was expecting something other than a ConstantNode\n          return [];\n        }\n      } else if (rule.name[0] === 'c') {\n        // rule matches any ConstantNode\n        if (node instanceof ConstantNode) {\n          res[0].placeholders[rule.name] = node;\n        } else {\n          // Mis-match: rule was expecting a ConstantNode\n          return [];\n        }\n      } else {\n        throw new Error('Invalid symbol in rule: ' + rule.name);\n      }\n    } else if (rule instanceof ConstantNode) {\n      // Literal constant must match exactly\n      if (!equal(rule.value, node.value)) {\n        return [];\n      }\n    } else {\n      // Some other node was encountered which we aren't prepared for, so no match\n      return [];\n    } // It's a match!\n    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')\n\n\n    return res;\n  }\n  /**\n   * Determines whether p and q (and all their children nodes) are identical.\n   *\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q\n   * @return {Object} Information about the match, if it exists.\n   */\n\n\n  function _exactMatch(p, q) {\n    if (p instanceof ConstantNode && q instanceof ConstantNode) {\n      if (!equal(p.value, q.value)) {\n        return false;\n      }\n    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {\n      if (p.name !== q.name) {\n        return false;\n      }\n    } else if (p instanceof OperatorNode && q instanceof OperatorNode || p instanceof FunctionNode && q instanceof FunctionNode) {\n      if (p instanceof OperatorNode) {\n        if (p.op !== q.op || p.fn !== q.fn) {\n          return false;\n        }\n      } else if (p instanceof FunctionNode) {\n        if (p.name !== q.name) {\n          return false;\n        }\n      }\n\n      if (p.args.length !== q.args.length) {\n        return false;\n      }\n\n      for (var i = 0; i < p.args.length; i++) {\n        if (!_exactMatch(p.args[i], q.args[i])) {\n          return false;\n        }\n      }\n    } else {\n      return false;\n    }\n\n    return true;\n  }\n\n  return simplify;\n}\n\nexports.math = true;\nexports.name = 'simplify';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed, math) {\n  var Node = math.expression.node.Node;\n  var OperatorNode = math.expression.node.OperatorNode;\n  var FunctionNode = math.expression.node.FunctionNode;\n  var ParenthesisNode = math.expression.node.ParenthesisNode;\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     simplify.resolve(expr, scope)\n   *\n   * Examples:\n   *\n   *     math.simplify.resolve('x + y', {x:1, y:2})           // Node {1 + 2}\n   *     math.simplify.resolve(math.parse('x+y'), {x:1, y:2}) // Node {1 + 2}\n   *     math.simplify('x+y', {x:2, y:'x+x'}).toString()      // \"6\"\n   *\n   * @param {Node} node\n   *     The expression tree to be simplified\n   * @param {Object} scope with variables to be resolved\n   */\n\n  function resolve(node, scope) {\n    if (!scope) {\n      return node;\n    }\n\n    if (type.isSymbolNode(node)) {\n      var value = scope[node.name];\n\n      if (value instanceof Node) {\n        return resolve(value, scope);\n      } else if (typeof value === 'number') {\n        return math.parse(String(value));\n      }\n    } else if (type.isOperatorNode(node)) {\n      var args = node.args.map(function (arg) {\n        return resolve(arg, scope);\n      });\n      return new OperatorNode(node.op, node.fn, args, node.implicit);\n    } else if (type.isParenthesisNode(node)) {\n      return new ParenthesisNode(resolve(node.content, scope));\n    } else if (type.isFunctionNode(node)) {\n      var _args = node.args.map(function (arg) {\n        return resolve(arg, scope);\n      });\n\n      return new FunctionNode(node.name, _args);\n    }\n\n    return node;\n  }\n\n  return resolve;\n}\n\nexports.math = true;\nexports.name = 'resolve';\nexports.path = 'algebra.simplify';\nexports.factory = factory;","'use strict'; // TODO this could be improved by simplifying seperated constants under associative and commutative operators\n\nfunction factory(type, config, load, typed, math) {\n  var util = load(require('./util'));\n  var isCommutative = util.isCommutative;\n  var isAssociative = util.isAssociative;\n  var allChildren = util.allChildren;\n  var createMakeNodeFunction = util.createMakeNodeFunction;\n  var ConstantNode = math.expression.node.ConstantNode;\n  var OperatorNode = math.expression.node.OperatorNode;\n  var FunctionNode = math.expression.node.FunctionNode;\n\n  function simplifyConstant(expr, options) {\n    var res = foldFraction(expr, options);\n    return type.isNode(res) ? res : _toNode(res);\n  }\n\n  function _eval(fnname, args, options) {\n    try {\n      return _toNumber(math[fnname].apply(null, args), options);\n    } catch (ignore) {\n      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions\n      args = args.map(function (x) {\n        if (type.isFraction(x)) {\n          return x.valueOf();\n        }\n\n        return x;\n      });\n      return _toNumber(math[fnname].apply(null, args), options);\n    }\n  }\n\n  var _toNode = typed({\n    'Fraction': _fractionToNode,\n    'number': function number(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n\n      return new ConstantNode(n);\n    },\n    'BigNumber': function BigNumber(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n\n      return new ConstantNode(n); // old parameters: (n.toString(), 'number')\n    },\n    'Complex': function Complex(s) {\n      throw new Error('Cannot convert Complex number to Node');\n    }\n  }); // convert a number to a fraction only if it can be expressed exactly\n\n\n  function _exactFraction(n, options) {\n    var exactFractions = options && options.exactFractions !== false;\n\n    if (exactFractions && isFinite(n)) {\n      var f = math.fraction(n);\n\n      if (f.valueOf() === n) {\n        return f;\n      }\n    }\n\n    return n;\n  } // Convert numbers to a preferred number type in preference order: Fraction, number, Complex\n  // BigNumbers are left alone\n\n\n  var _toNumber = typed({\n    'string, Object': function stringObject(s, options) {\n      if (config.number === 'BigNumber') {\n        return math.bignumber(s);\n      } else if (config.number === 'Fraction') {\n        return math.fraction(s);\n      } else {\n        var n = parseFloat(s);\n        return _exactFraction(n, options);\n      }\n    },\n    'Fraction, Object': function FractionObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n    'BigNumber, Object': function BigNumberObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n    'number, Object': function numberObject(s, options) {\n      return _exactFraction(s, options);\n    },\n    'Complex, Object': function ComplexObject(s, options) {\n      if (s.im !== 0) {\n        return s;\n      }\n\n      return _exactFraction(s.re, options);\n    }\n  });\n\n  function unaryMinusNode(n) {\n    return new OperatorNode('-', 'unaryMinus', [n]);\n  }\n\n  function _fractionToNode(f) {\n    var n;\n    var vn = f.s * f.n;\n\n    if (vn < 0) {\n      n = new OperatorNode('-', 'unaryMinus', [new ConstantNode(-vn)]);\n    } else {\n      n = new ConstantNode(vn);\n    }\n\n    if (f.d === 1) {\n      return n;\n    }\n\n    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);\n  }\n  /*\n   * Create a binary tree from a list of Fractions and Nodes.\n   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so\n   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).\n   * @param args - list of Fractions and Nodes\n   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions\n   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes\n   * if args.length is 1, returns args[0]\n   * @return - Either a Node representing a binary expression or Fraction\n   */\n\n\n  function foldOp(fn, args, makeNode, options) {\n    return args.reduce(function (a, b) {\n      if (!type.isNode(a) && !type.isNode(b)) {\n        try {\n          return _eval(fn, [a, b], options);\n        } catch (ignoreandcontinue) {}\n\n        a = _toNode(a);\n        b = _toNode(b);\n      } else if (!type.isNode(a)) {\n        a = _toNode(a);\n      } else if (!type.isNode(b)) {\n        b = _toNode(b);\n      }\n\n      return makeNode([a, b]);\n    });\n  } // destroys the original node and returns a folded one\n\n\n  function foldFraction(node, options) {\n    switch (node.type) {\n      case 'SymbolNode':\n        return node;\n\n      case 'ConstantNode':\n        if (typeof node.value === 'number' || !isNaN(node.value)) {\n          return _toNumber(node.value, options);\n        }\n\n        return node;\n\n      case 'FunctionNode':\n        if (math[node.name] && math[node.name].rawArgs) {\n          return node;\n        } // Process operators as OperatorNode\n\n\n        var operatorFunctions = ['add', 'multiply'];\n\n        if (operatorFunctions.indexOf(node.name) === -1) {\n          var _args = node.args.map(function (arg) {\n            return foldFraction(arg, options);\n          }); // If all args are numbers\n\n\n          if (!_args.some(type.isNode)) {\n            try {\n              return _eval(node.name, _args, options);\n            } catch (ignoreandcontine) {}\n          } // Convert all args to nodes and construct a symbolic function call\n\n\n          _args = _args.map(function (arg) {\n            return type.isNode(arg) ? arg : _toNode(arg);\n          });\n          return new FunctionNode(node.name, _args);\n        } else {} // treat as operator\n\n        /* falls through */\n\n\n      case 'OperatorNode':\n        var fn = node.fn.toString();\n        var args;\n        var res;\n        var makeNode = createMakeNodeFunction(node);\n\n        if (node.isUnary()) {\n          args = [foldFraction(node.args[0], options)];\n\n          if (!type.isNode(args[0])) {\n            res = _eval(fn, args, options);\n          } else {\n            res = makeNode(args);\n          }\n        } else if (isAssociative(node)) {\n          args = allChildren(node);\n          args = args.map(function (arg) {\n            return foldFraction(arg, options);\n          });\n\n          if (isCommutative(fn)) {\n            // commutative binary operator\n            var consts = [];\n            var vars = [];\n\n            for (var i = 0; i < args.length; i++) {\n              if (!type.isNode(args[i])) {\n                consts.push(args[i]);\n              } else {\n                vars.push(args[i]);\n              }\n            }\n\n            if (consts.length > 1) {\n              res = foldOp(fn, consts, makeNode, options);\n              vars.unshift(res);\n              res = foldOp(fn, vars, makeNode, options);\n            } else {\n              // we won't change the children order since it's not neccessary\n              res = foldOp(fn, args, makeNode, options);\n            }\n          } else {\n            // non-commutative binary operator\n            res = foldOp(fn, args, makeNode, options);\n          }\n        } else {\n          // non-associative binary operator\n          args = node.args.map(function (arg) {\n            return foldFraction(arg, options);\n          });\n          res = foldOp(fn, args, makeNode, options);\n        }\n\n        return res;\n\n      case 'ParenthesisNode':\n        // remove the uneccessary parenthesis\n        return foldFraction(node.content, options);\n\n      case 'AccessorNode':\n      /* falls through */\n\n      case 'ArrayNode':\n      /* falls through */\n\n      case 'AssignmentNode':\n      /* falls through */\n\n      case 'BlockNode':\n      /* falls through */\n\n      case 'FunctionAssignmentNode':\n      /* falls through */\n\n      case 'IndexNode':\n      /* falls through */\n\n      case 'ObjectNode':\n      /* falls through */\n\n      case 'RangeNode':\n      /* falls through */\n\n      case 'UpdateNode':\n      /* falls through */\n\n      case 'ConditionalNode':\n      /* falls through */\n\n      default:\n        throw new Error(\"Unimplemented node type in simplifyConstant: \".concat(node.type));\n    }\n  }\n\n  return simplifyConstant;\n}\n\nexports.math = true;\nexports.name = 'simplifyConstant';\nexports.path = 'algebra.simplify';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed, math) {\n  var equal = load(require('../../relational/equal'));\n  var isZero = load(require('../../utils/isZero'));\n  var add = load(require('../../arithmetic/add'));\n  var subtract = load(require('../../arithmetic/subtract'));\n  var multiply = load(require('../../arithmetic/multiply'));\n  var divide = load(require('../../arithmetic/divide'));\n  var pow = load(require('../../arithmetic/pow'));\n  var ConstantNode = math.expression.node.ConstantNode;\n  var OperatorNode = math.expression.node.OperatorNode;\n  var FunctionNode = math.expression.node.FunctionNode;\n  var ParenthesisNode = math.expression.node.ParenthesisNode;\n  var node0 = new ConstantNode(0);\n  var node1 = new ConstantNode(1);\n  /**\n   * simplifyCore() performs single pass simplification suitable for\n   * applications requiring ultimate performance. In contrast, simplify()\n   * extends simplifyCore() with additional passes to provide deeper\n   * simplification.\n   *\n   * Syntax:\n   *\n   *     simplify.simplifyCore(expr)\n   *\n   * Examples:\n   *\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simplify.simpifyCore(f)                          // Node {2 * x}\n   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplify.simpifyCore]) // Node {2 * x}\n   *\n   * See also:\n   *\n   *     derivative\n   *\n   * @param {Node} node\n   *     The expression to be simplified\n   */\n\n  function simplifyCore(node) {\n    if (type.isOperatorNode(node) && node.isUnary()) {\n      var a0 = simplifyCore(node.args[0]);\n\n      if (node.op === '+') {\n        // unary plus\n        return a0;\n      }\n\n      if (node.op === '-') {\n        // unary minus\n        if (type.isOperatorNode(a0)) {\n          if (a0.isUnary() && a0.op === '-') {\n            return a0.args[0];\n          } else if (a0.isBinary() && a0.fn === 'subtract') {\n            return new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [a0]);\n      }\n    } else if (type.isOperatorNode(node) && node.isBinary()) {\n      var _a = simplifyCore(node.args[0]);\n\n      var a1 = simplifyCore(node.args[1]);\n\n      if (node.op === '+') {\n        if (type.isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return a1;\n          } else if (type.isConstantNode(a1)) {\n            return new ConstantNode(add(_a.value, a1.value));\n          }\n        }\n\n        if (type.isConstantNode(a1) && isZero(a1.value)) {\n          return _a;\n        }\n\n        if (type.isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          return new OperatorNode('-', 'subtract', [_a, a1.args[0]]);\n        }\n\n        return new OperatorNode(node.op, node.fn, a1 ? [_a, a1] : [_a]);\n      } else if (node.op === '-') {\n        if (type.isConstantNode(_a) && a1) {\n          if (type.isConstantNode(a1)) {\n            return new ConstantNode(subtract(_a.value, a1.value));\n          } else if (isZero(_a.value)) {\n            return new OperatorNode('-', 'unaryMinus', [a1]);\n          }\n        } // if (node.fn === \"subtract\" && node.args.length === 2) {\n\n\n        if (node.fn === 'subtract') {\n          if (type.isConstantNode(a1) && isZero(a1.value)) {\n            return _a;\n          }\n\n          if (type.isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]));\n          }\n\n          return new OperatorNode(node.op, node.fn, [_a, a1]);\n        }\n      } else if (node.op === '*') {\n        if (type.isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (equal(_a.value, 1)) {\n            return a1;\n          } else if (type.isConstantNode(a1)) {\n            return new ConstantNode(multiply(_a.value, a1.value));\n          }\n        }\n\n        if (type.isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node0;\n          } else if (equal(a1.value, 1)) {\n            return _a;\n          } else if (type.isOperatorNode(_a) && _a.isBinary() && _a.op === node.op) {\n            var a00 = _a.args[0];\n\n            if (type.isConstantNode(a00)) {\n              var a00a1 = new ConstantNode(multiply(a00.value, a1.value));\n              return new OperatorNode(node.op, node.fn, [a00a1, _a.args[1]], node.implicit); // constants on left\n            }\n          }\n\n          return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);\n      } else if (node.op === '/') {\n        if (type.isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (type.isConstantNode(a1) && (equal(a1.value, 1) || equal(a1.value, 2) || equal(a1.value, 4))) {\n            return new ConstantNode(divide(_a.value, a1.value));\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1]);\n      } else if (node.op === '^') {\n        if (type.isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node1;\n          } else if (equal(a1.value, 1)) {\n            return _a;\n          } else {\n            if (type.isConstantNode(_a)) {\n              // fold constant\n              return new ConstantNode(pow(_a.value, a1.value));\n            } else if (type.isOperatorNode(_a) && _a.isBinary() && _a.op === '^') {\n              var a01 = _a.args[1];\n\n              if (type.isConstantNode(a01)) {\n                return new OperatorNode(node.op, node.fn, [_a.args[0], new ConstantNode(multiply(a01.value, a1.value))]);\n              }\n            }\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1]);\n      }\n    } else if (type.isParenthesisNode(node)) {\n      var c = simplifyCore(node.content);\n\n      if (type.isParenthesisNode(c) || type.isSymbolNode(c) || type.isConstantNode(c)) {\n        return c;\n      }\n\n      return new ParenthesisNode(c);\n    } else if (type.isFunctionNode(node)) {\n      var args = node.args.map(simplifyCore).map(function (arg) {\n        return type.isParenthesisNode(arg) ? arg.content : arg;\n      });\n      return new FunctionNode(simplifyCore(node.fn), args);\n    } else {// cannot simplify\n    }\n\n    return node;\n  }\n\n  return simplifyCore;\n}\n\nexports.math = true;\nexports.name = 'simplifyCore';\nexports.path = 'algebra.simplify';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed, math) {\n  var FunctionNode = math.expression.node.FunctionNode;\n  var OperatorNode = math.expression.node.OperatorNode;\n  var SymbolNode = math.expression.node.SymbolNode; // TODO commutative/associative properties rely on the arguments\n  // e.g. multiply is not commutative for matrices\n  // The properties should be calculated from an argument to simplify, or possibly something in math.config\n  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments\n\n  var commutative = {\n    'add': true,\n    'multiply': true\n  };\n  var associative = {\n    'add': true,\n    'multiply': true\n  };\n\n  function isCommutative(node, context) {\n    if (!type.isOperatorNode(node)) {\n      return true;\n    }\n\n    var name = node.fn.toString();\n\n    if (context && context.hasOwnProperty(name) && context[name].hasOwnProperty('commutative')) {\n      return context[name].commutative;\n    }\n\n    return commutative[name] || false;\n  }\n\n  function isAssociative(node, context) {\n    if (!type.isOperatorNode(node)) {\n      return false;\n    }\n\n    var name = node.fn.toString();\n\n    if (context && context.hasOwnProperty(name) && context[name].hasOwnProperty('associative')) {\n      return context[name].associative;\n    }\n\n    return associative[name] || false;\n  }\n  /**\n   * Flatten all associative operators in an expression tree.\n   * Assumes parentheses have already been removed.\n   */\n\n\n  function flatten(node) {\n    if (!node.args || node.args.length === 0) {\n      return node;\n    }\n\n    node.args = allChildren(node);\n\n    for (var i = 0; i < node.args.length; i++) {\n      flatten(node.args[i]);\n    }\n  }\n  /**\n   * Get the children of a node as if it has been flattened.\n   * TODO implement for FunctionNodes\n   */\n\n\n  function allChildren(node) {\n    var op;\n    var children = [];\n\n    var findChildren = function findChildren(node) {\n      for (var i = 0; i < node.args.length; i++) {\n        var child = node.args[i];\n\n        if (type.isOperatorNode(child) && op === child.op) {\n          findChildren(child);\n        } else {\n          children.push(child);\n        }\n      }\n    };\n\n    if (isAssociative(node)) {\n      op = node.op;\n      findChildren(node);\n      return children;\n    } else {\n      return node.args;\n    }\n  }\n  /**\n   *  Unflatten all flattened operators to a right-heavy binary tree.\n   */\n\n\n  function unflattenr(node) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n\n    for (var i = 0; i < l; i++) {\n      unflattenr(node.args[i]);\n    }\n\n    if (l > 2 && isAssociative(node)) {\n      var curnode = node.args.pop();\n\n      while (node.args.length > 0) {\n        curnode = makeNode([node.args.pop(), curnode]);\n      }\n\n      node.args = curnode.args;\n    }\n  }\n  /**\n   *  Unflatten all flattened operators to a left-heavy binary tree.\n   */\n\n\n  function unflattenl(node) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n\n    for (var i = 0; i < l; i++) {\n      unflattenl(node.args[i]);\n    }\n\n    if (l > 2 && isAssociative(node)) {\n      var curnode = node.args.shift();\n\n      while (node.args.length > 0) {\n        curnode = makeNode([curnode, node.args.shift()]);\n      }\n\n      node.args = curnode.args;\n    }\n  }\n\n  function createMakeNodeFunction(node) {\n    if (type.isOperatorNode(node)) {\n      return function (args) {\n        try {\n          return new OperatorNode(node.op, node.fn, args, node.implicit);\n        } catch (err) {\n          console.error(err);\n          return [];\n        }\n      };\n    } else {\n      return function (args) {\n        return new FunctionNode(new SymbolNode(node.name), args);\n      };\n    }\n  }\n\n  return {\n    createMakeNodeFunction: createMakeNodeFunction,\n    isCommutative: isCommutative,\n    isAssociative: isAssociative,\n    flatten: flatten,\n    allChildren: allChildren,\n    unflattenr: unflattenr,\n    unflattenl: unflattenl\n  };\n}\n\nexports.factory = factory;\nexports.math = true;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../../type/matrix/function/matrix'));\n  var divideScalar = load(require('../../arithmetic/divideScalar'));\n  var multiplyScalar = load(require('../../arithmetic/multiplyScalar'));\n  var subtract = load(require('../../arithmetic/subtract'));\n  var equalScalar = load(require('../../relational/equalScalar'));\n  var solveValidation = load(require('./utils/solveValidation'));\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Solves the linear equation system by forwards substitution. Matrix must be a lower triangular matrix.\n   *\n   * `L * x = b`\n   *\n   * Syntax:\n   *\n   *    math.lsolve(L, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = lsolve(a, b)  // [[-5.5], [20]]\n   *\n   * See also:\n   *\n   *    lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} L       A N x N matrix or array (L)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n\n  var lsolve = typed('lsolve', {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      // process matrix\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      // process matrix\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      // create dense matrix from array\n      var m = matrix(a); // use matrix implementation\n\n      var r = _denseForwardSubstitution(m, b); // result\n\n\n      return r.valueOf();\n    }\n  });\n\n  function _denseForwardSubstitution(m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true); // column vector data\n\n    var bdata = b._data; // rows & columns\n\n    var rows = m._size[0];\n    var columns = m._size[1]; // result\n\n    var x = []; // data\n\n    var data = m._data; // forward solve m * x = b, loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // b[j]\n      var bj = bdata[j][0] || 0; // x[j]\n\n      var xj = void 0; // forward substitution (outer product) avoids inner looping when bj === 0\n\n      if (!equalScalar(bj, 0)) {\n        // value @ [j, j]\n        var vjj = data[j][j]; // check vjj\n\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        } // calculate xj\n\n\n        xj = divideScalar(bj, vjj); // loop rows\n\n        for (var i = j + 1; i < rows; i++) {\n          // update copy of b\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, data[i][j]))];\n        }\n      } else {\n        // zero @ j\n        xj = 0;\n      } // update x\n\n\n      x[j] = [xj];\n    } // return vector\n\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n\n  function _sparseForwardSubstitution(m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true); // column vector data\n\n    var bdata = b._data; // rows & columns\n\n    var rows = m._size[0];\n    var columns = m._size[1]; // matrix arrays\n\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // vars\n\n    var i, k; // result\n\n    var x = []; // forward solve m * x = b, loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // b[j]\n      var bj = bdata[j][0] || 0; // forward substitution (outer product) avoids inner looping when bj === 0\n\n      if (!equalScalar(bj, 0)) {\n        // value @ [j, j]\n        var vjj = 0; // lower triangular matrix values & index (column j)\n\n        var jvalues = [];\n        var jindex = []; // last index in column\n\n        var l = ptr[j + 1]; // values in column, find value @ [j, j]\n\n        for (k = ptr[j]; k < l; k++) {\n          // row\n          i = index[k]; // check row (rows are not sorted!)\n\n          if (i === j) {\n            // update vjj\n            vjj = values[k];\n          } else if (i > j) {\n            // store lower triangular\n            jvalues.push(values[k]);\n            jindex.push(i);\n          }\n        } // at this point we must have a value @ [j, j]\n\n\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved, there is no value @ [j, j]\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        } // calculate xj\n\n\n        var xj = divideScalar(bj, vjj); // loop lower triangular\n\n        for (k = 0, l = jindex.length; k < l; k++) {\n          // row\n          i = jindex[k]; // update copy of b\n\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, jvalues[k]))];\n        } // update x\n\n\n        x[j] = [xj];\n      } else {\n        // update x\n        x[j] = [0];\n      }\n    } // return vector\n\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n\n  return lsolve;\n}\n\nexports.name = 'lsolve';\nexports.factory = factory;","'use strict';\n\nvar isArray = Array.isArray;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../../type/matrix/function/matrix'));\n  var lup = load(require('../decomposition/lup'));\n  var slu = load(require('../decomposition/slu'));\n  var csIpvec = load(require('../sparse/csIpvec'));\n  var solveValidation = load(require('./utils/solveValidation'));\n  var usolve = load(require('./usolve'));\n  var lsolve = load(require('./lsolve'));\n  /**\n   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.\n   *\n   * Syntax:\n   *\n   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b\n   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)\n   *\n   * Examples:\n   *\n   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]\n   *\n   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]\n   *\n   *    const f = math.lup(m)\n   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]\n   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = math.lusolve(a, b)  // [[2], [5]]\n   *\n   * See also:\n   *\n   *    lup, slu, lsolve, usolve\n   *\n   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition\n   * @param {Matrix | Array} b               Column Vector\n   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix\n   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.\n   *\n   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b\n   */\n\n  var lusolve = typed('lusolve', {\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      // convert a to matrix\n      a = matrix(a); // matrix lup decomposition\n\n      var d = lup(a); // solve\n\n      var x = _lusolve(d.L, d.U, d.p, null, b); // convert result to array\n\n\n      return x.valueOf();\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {\n      // matrix lup decomposition\n      var d = lup(a); // solve\n\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {\n      // matrix lup decomposition\n      var d = lup(a); // solve\n\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix, number, number': function SparseMatrixArrayMatrixNumberNumber(a, b, order, threshold) {\n      // matrix lu decomposition\n      var d = slu(a, order, threshold); // solve\n\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    },\n    'Object, Array | Matrix': function ObjectArrayMatrix(d, b) {\n      // solve\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    }\n  });\n\n  var _toMatrix = function _toMatrix(a) {\n    // check it is a matrix\n    if (type.isMatrix(a)) {\n      return a;\n    } // check array\n\n\n    if (isArray(a)) {\n      return matrix(a);\n    } // throw\n\n\n    throw new TypeError('Invalid Matrix LU decomposition');\n  };\n\n  function _lusolve(l, u, p, q, b) {\n    // verify L, U, P\n    l = _toMatrix(l);\n    u = _toMatrix(u); // validate matrix and vector\n\n    b = solveValidation(l, b, false); // apply row permutations if needed (b is a DenseMatrix)\n\n    if (p) {\n      b._data = csIpvec(p, b._data);\n    } // use forward substitution to resolve L * y = b\n\n\n    var y = lsolve(l, b); // use backward substitution to resolve U * x = y\n\n    var x = usolve(u, y); // apply column permutations if needed (x is a DenseMatrix)\n\n    if (q) {\n      x._data = csIpvec(q, x._data);\n    } // return solution\n\n\n    return x;\n  }\n\n  return lusolve;\n}\n\nexports.name = 'lusolve';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../../type/matrix/function/matrix'));\n  var divideScalar = load(require('../../arithmetic/divideScalar'));\n  var multiplyScalar = load(require('../../arithmetic/multiplyScalar'));\n  var subtract = load(require('../../arithmetic/subtract'));\n  var equalScalar = load(require('../../relational/equalScalar'));\n  var solveValidation = load(require('./utils/solveValidation'));\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Solves the linear equation system by backward substitution. Matrix must be an upper triangular matrix.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolve(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolve(a, b)  // [[8], [9]]\n   *\n   * See also:\n   *\n   *    lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n\n  var usolve = typed('usolve', {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      // process matrix\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      // process matrix\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      // create dense matrix from array\n      var m = matrix(a); // use matrix implementation\n\n      var r = _denseBackwardSubstitution(m, b); // result\n\n\n      return r.valueOf();\n    }\n  });\n\n  function _denseBackwardSubstitution(m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true); // column vector data\n\n    var bdata = b._data; // rows & columns\n\n    var rows = m._size[0];\n    var columns = m._size[1]; // result\n\n    var x = []; // arrays\n\n    var data = m._data; // backward solve m * x = b, loop columns (backwards)\n\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0; // x[j]\n\n      var xj = void 0; // backward substitution (outer product) avoids inner looping when bj === 0\n\n      if (!equalScalar(bj, 0)) {\n        // value @ [j, j]\n        var vjj = data[j][j]; // check vjj\n\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        } // calculate xj\n\n\n        xj = divideScalar(bj, vjj); // loop rows\n\n        for (var i = j - 1; i >= 0; i--) {\n          // update copy of b\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, data[i][j]))];\n        }\n      } else {\n        // zero value @ j\n        xj = 0;\n      } // update x\n\n\n      x[j] = [xj];\n    } // return column vector\n\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n\n  function _sparseBackwardSubstitution(m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true); // column vector data\n\n    var bdata = b._data; // rows & columns\n\n    var rows = m._size[0];\n    var columns = m._size[1]; // matrix arrays\n\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // vars\n\n    var i, k; // result\n\n    var x = []; // backward solve m * x = b, loop columns (backwards)\n\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0; // backward substitution (outer product) avoids inner looping when bj === 0\n\n      if (!equalScalar(bj, 0)) {\n        // value @ [j, j]\n        var vjj = 0; // upper triangular matrix values & index (column j)\n\n        var jvalues = [];\n        var jindex = []; // first & last indeces in column\n\n        var f = ptr[j];\n        var l = ptr[j + 1]; // values in column, find value @ [j, j], loop backwards\n\n        for (k = l - 1; k >= f; k--) {\n          // row\n          i = index[k]; // check row\n\n          if (i === j) {\n            // update vjj\n            vjj = values[k];\n          } else if (i < j) {\n            // store upper triangular\n            jvalues.push(values[k]);\n            jindex.push(i);\n          }\n        } // at this point we must have a value @ [j, j]\n\n\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved, there is no value @ [j, j]\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        } // calculate xj\n\n\n        var xj = divideScalar(bj, vjj); // loop upper triangular\n\n        for (k = 0, l = jindex.length; k < l; k++) {\n          // row\n          i = jindex[k]; // update copy of b\n\n          bdata[i] = [subtract(bdata[i][0], multiplyScalar(xj, jvalues[k]))];\n        } // update x\n\n\n        x[j] = [xj];\n      } else {\n        // update x\n        x[j] = [0];\n      }\n    } // return vector\n\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n\n  return usolve;\n}\n\nexports.name = 'usolve';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../../../utils/index');\n\nvar string = util.string;\nvar array = util.array;\nvar isArray = Array.isArray;\n\nfunction factory(type) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Validates matrix and column vector b for backward/forward substitution algorithms.\n   *\n   * @param {Matrix} m            An N x N matrix\n   * @param {Array | Matrix} b    A column vector\n   * @param {Boolean} copy        Return a copy of vector b\n   *\n   * @return {DenseMatrix}        Dense column vector b\n   */\n\n  var solveValidation = function solveValidation(m, b, copy) {\n    // matrix size\n    var size = m.size(); // validate matrix dimensions\n\n    if (size.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + string.format(size) + ')');\n    } // rows & columns\n\n\n    var rows = size[0];\n    var columns = size[1]; // validate rows & columns\n\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + string.format(size) + ')');\n    } // vars\n\n\n    var data, i, bdata; // check b is matrix\n\n    if (type.isMatrix(b)) {\n      // matrix size\n      var msize = b.size(); // vector\n\n      if (msize.length === 1) {\n        // check vector length\n        if (msize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        } // create data array\n\n\n        data = []; // matrix data (DenseMatrix)\n\n        bdata = b._data; // loop b data\n\n        for (i = 0; i < rows; i++) {\n          // row array\n          data[i] = [bdata[i]];\n        } // return Dense Matrix\n\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1],\n          datatype: b._datatype\n        });\n      } // two dimensions\n\n\n      if (msize.length === 2) {\n        // array must be a column vector\n        if (msize[0] !== rows || msize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        } // check matrix type\n\n\n        if (type.isDenseMatrix(b)) {\n          // check a copy is needed\n          if (copy) {\n            // create data array\n            data = []; // matrix data (DenseMatrix)\n\n            bdata = b._data; // loop b data\n\n            for (i = 0; i < rows; i++) {\n              // row array\n              data[i] = [bdata[i][0]];\n            } // return Dense Matrix\n\n\n            return new DenseMatrix({\n              data: data,\n              size: [rows, 1],\n              datatype: b._datatype\n            });\n          } // b is already a column vector\n\n\n          return b;\n        } // create data array\n\n\n        data = [];\n\n        for (i = 0; i < rows; i++) {\n          data[i] = [0];\n        } // sparse matrix arrays\n\n\n        var values = b._values;\n        var index = b._index;\n        var ptr = b._ptr; // loop values in column 0\n\n        for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n          // row\n          i = index[k]; // add to data\n\n          data[i][0] = values[k];\n        } // return Dense Matrix\n\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1],\n          datatype: b._datatype\n        });\n      } // throw error\n\n\n      throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n    } // check b is array\n\n\n    if (isArray(b)) {\n      // size\n      var asize = array.size(b); // check matrix dimensions, vector\n\n      if (asize.length === 1) {\n        // check vector length\n        if (asize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        } // create data array\n\n\n        data = []; // loop b\n\n        for (i = 0; i < rows; i++) {\n          // row array\n          data[i] = [b[i]];\n        } // return Dense Matrix\n\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1]\n        });\n      }\n\n      if (asize.length === 2) {\n        // array must be a column vector\n        if (asize[0] !== rows || asize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        } // create data array\n\n\n        data = []; // loop b data\n\n        for (i = 0; i < rows; i++) {\n          // row array\n          data[i] = [b[i][0]];\n        } // return Dense Matrix\n\n\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1]\n        });\n      } // throw error\n\n\n      throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n    }\n  };\n\n  return solveValidation;\n}\n\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csFlip = load(require('./csFlip'));\n  var csFkeep = load(require('./csFkeep'));\n  var csTdfs = load(require('./csTdfs'));\n  var add = load(require('../../arithmetic/add'));\n  var multiply = load(require('../../arithmetic/multiply'));\n  var transpose = load(require('../../matrix/transpose'));\n  /**\n   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used\n   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization\n   * than A. It is a gready method that selects the sparsest pivot row and column during the course\n   * of a right looking sparse Cholesky factorization.\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   *\n   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR\n   * @param {Matrix} m        Sparse Matrix\n   */\n\n  var csAmd = function csAmd(order, a) {\n    // check input parameters\n    if (!a || order <= 0 || order > 3) {\n      return null;\n    } // a matrix arrays\n\n\n    var asize = a._size; // rows and columns\n\n    var m = asize[0];\n    var n = asize[1]; // initialize vars\n\n    var lemax = 0; // dense threshold\n\n    var dense = Math.max(16, 10 * Math.sqrt(n));\n    dense = Math.min(n - 2, dense); // create target matrix C\n\n    var cm = _createTargetMatrix(order, a, m, n, dense); // drop diagonal entries\n\n\n    csFkeep(cm, _diag, null); // C matrix arrays\n\n    var cindex = cm._index;\n    var cptr = cm._ptr; // number of nonzero elements in C\n\n    var cnz = cptr[n]; // allocate result (n+1)\n\n    var P = []; // create workspace (8 * (n + 1))\n\n    var W = [];\n    var len = 0; // first n + 1 entries\n\n    var nv = n + 1; // next n + 1 entries\n\n    var next = 2 * (n + 1); // next n + 1 entries\n\n    var head = 3 * (n + 1); // next n + 1 entries\n\n    var elen = 4 * (n + 1); // next n + 1 entries\n\n    var degree = 5 * (n + 1); // next n + 1 entries\n\n    var w = 6 * (n + 1); // next n + 1 entries\n\n    var hhead = 7 * (n + 1); // last n + 1 entries\n    // use P as workspace for last\n\n    var last = P; // initialize quotient graph\n\n    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree); // initialize degree lists\n\n\n    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next); // minimum degree node\n\n\n    var mindeg = 0; // vars\n\n    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d; // while (selecting pivots) do\n\n    while (nel < n) {\n      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first\n      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow\n      // many nodes have been eliminated.\n      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++) {\n        ;\n      }\n\n      if (W[next + k] !== -1) {\n        last[W[next + k]] = -1;\n      } // remove k from degree list\n\n\n      W[head + mindeg] = W[next + k]; // elenk = |Ek|\n\n      var elenk = W[elen + k]; // # of nodes k represents\n\n      var nvk = W[nv + k]; // W[nv + k] nodes of A eliminated\n\n      nel += nvk; // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is\n      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the\n      // degree lists. All elements e in Ek are absorved into element k.\n\n      var dk = 0; // flag k as in Lk\n\n      W[nv + k] = -nvk;\n      var p = cptr[k]; // do in place if W[elen + k] === 0\n\n      var pk1 = elenk === 0 ? p : cnz;\n      var pk2 = pk1;\n\n      for (k1 = 1; k1 <= elenk + 1; k1++) {\n        if (k1 > elenk) {\n          // search the nodes in k\n          e = k; // list of nodes starts at cindex[pj]\n\n          pj = p; // length of list of nodes in k\n\n          ln = W[len + k] - elenk;\n        } else {\n          // search the nodes in e\n          e = cindex[p++];\n          pj = cptr[e]; // length of list of nodes in e\n\n          ln = W[len + e];\n        }\n\n        for (k2 = 1; k2 <= ln; k2++) {\n          i = cindex[pj++]; // check  node i dead, or seen\n\n          if ((nvi = W[nv + i]) <= 0) {\n            continue;\n          } // W[degree + Lk] += size of node i\n\n\n          dk += nvi; // negate W[nv + i] to denote i in Lk\n\n          W[nv + i] = -nvi; // place i in Lk\n\n          cindex[pk2++] = i;\n\n          if (W[next + i] !== -1) {\n            last[W[next + i]] = last[i];\n          } // check we need to remove i from degree list\n\n\n          if (last[i] !== -1) {\n            W[next + last[i]] = W[next + i];\n          } else {\n            W[head + W[degree + i]] = W[next + i];\n          }\n        }\n\n        if (e !== k) {\n          // absorb e into k\n          cptr[e] = csFlip(k); // e is now a dead element\n\n          W[w + e] = 0;\n        }\n      } // cindex[cnz...nzmax] is free\n\n\n      if (elenk !== 0) {\n        cnz = pk2;\n      } // external degree of k - |Lk\\i|\n\n\n      W[degree + k] = dk; // element k is in cindex[pk1..pk2-1]\n\n      cptr[k] = pk1;\n      W[len + k] = pk2 - pk1; // k is now an element\n\n      W[elen + k] = -2; // Find set differences. The scan1 function now computes the set differences |Le \\ Lk| for all elements e. At the start of the\n      // scan, no entry in the w array is greater than or equal to mark.\n      // clear w if necessary\n\n      mark = _wclear(mark, lemax, W, w, n); // scan 1: find |Le\\Lk|\n\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check if W[elen + i] empty, skip it\n\n        if ((eln = W[elen + i]) <= 0) {\n          continue;\n        } // W[nv + i] was negated\n\n\n        nvi = -W[nv + i];\n        var wnvi = mark - nvi; // scan Ei\n\n        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {\n          e = cindex[p];\n\n          if (W[w + e] >= mark) {\n            // decrement |Le\\Lk|\n            W[w + e] -= nvi;\n          } else if (W[w + e] !== 0) {\n            // ensure e is a live element, 1st time e seen in scan 1\n            W[w + e] = W[degree + e] + wnvi;\n          }\n        }\n      } // degree update\n      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash\n      // function h(i) for all nodes in Lk.\n      // scan2: degree update\n\n\n      for (pk = pk1; pk < pk2; pk++) {\n        // consider node i in Lk\n        i = cindex[pk];\n        p1 = cptr[i];\n        p2 = p1 + W[elen + i] - 1;\n        pn = p1; // scan Ei\n\n        for (h = 0, d = 0, p = p1; p <= p2; p++) {\n          e = cindex[p]; // check e is an unabsorbed element\n\n          if (W[w + e] !== 0) {\n            // dext = |Le\\Lk|\n            var dext = W[w + e] - mark;\n\n            if (dext > 0) {\n              // sum up the set differences\n              d += dext; // keep e in Ei\n\n              cindex[pn++] = e; // compute the hash of node i\n\n              h += e;\n            } else {\n              // aggressive absorb. e->k\n              cptr[e] = csFlip(k); // e is a dead element\n\n              W[w + e] = 0;\n            }\n          }\n        } // W[elen + i] = |Ei|\n\n\n        W[elen + i] = pn - p1 + 1;\n        var p3 = pn;\n        var p4 = p1 + W[len + i]; // prune edges in Ai\n\n        for (p = p2 + 1; p < p4; p++) {\n          j = cindex[p]; // check node j dead or in Lk\n\n          var nvj = W[nv + j];\n\n          if (nvj <= 0) {\n            continue;\n          } // degree(i) += |j|\n\n\n          d += nvj; // place j in node list of i\n\n          cindex[pn++] = j; // compute hash for node i\n\n          h += j;\n        } // check for mass elimination\n\n\n        if (d === 0) {\n          // absorb i into k\n          cptr[i] = csFlip(k);\n          nvi = -W[nv + i]; // |Lk| -= |i|\n\n          dk -= nvi; // |k| += W[nv + i]\n\n          nvk += nvi;\n          nel += nvi;\n          W[nv + i] = 0; // node i is dead\n\n          W[elen + i] = -1;\n        } else {\n          // update degree(i)\n          W[degree + i] = Math.min(W[degree + i], d); // move first node to end\n\n          cindex[pn] = cindex[p3]; // move 1st el. to end of Ei\n\n          cindex[p3] = cindex[p1]; // add k as 1st element in of Ei\n\n          cindex[p1] = k; // new len of adj. list of node i\n\n          W[len + i] = pn - p1 + 1; // finalize hash of i\n\n          h = (h < 0 ? -h : h) % n; // place i in hash bucket\n\n          W[next + i] = W[hhead + h];\n          W[hhead + h] = i; // save hash of i in last[i]\n\n          last[i] = h;\n        }\n      } // finalize |Lk|\n\n\n      W[degree + k] = dk;\n      lemax = Math.max(lemax, dk); // clear w\n\n      mark = _wclear(mark + lemax, lemax, W, w, n); // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.\n      // If two nodes have identical adjacency lists, their hash functions wil be identical.\n\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check i is dead, skip it\n\n        if (W[nv + i] >= 0) {\n          continue;\n        } // scan hash bucket of node i\n\n\n        h = last[i];\n        i = W[hhead + h]; // hash bucket will be empty\n\n        W[hhead + h] = -1;\n\n        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {\n          ln = W[len + i];\n          eln = W[elen + i];\n\n          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {\n            W[w + cindex[p]] = mark;\n          }\n\n          var jlast = i; // compare i with all j\n\n          for (j = W[next + i]; j !== -1;) {\n            var ok = W[len + j] === ln && W[elen + j] === eln;\n\n            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {\n              // compare i and j\n              if (W[w + cindex[p]] !== mark) {\n                ok = 0;\n              }\n            } // check i and j are identical\n\n\n            if (ok) {\n              // absorb j into i\n              cptr[j] = csFlip(i);\n              W[nv + i] += W[nv + j];\n              W[nv + j] = 0; // node j is dead\n\n              W[elen + j] = -1; // delete j from hash bucket\n\n              j = W[next + j];\n              W[next + jlast] = j;\n            } else {\n              // j and i are different\n              jlast = j;\n              j = W[next + j];\n            }\n          }\n        }\n      } // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.\n      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.\n\n\n      for (p = pk1, pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]; // check  i is dead, skip it\n\n        if ((nvi = -W[nv + i]) <= 0) {\n          continue;\n        } // restore W[nv + i]\n\n\n        W[nv + i] = nvi; // compute external degree(i)\n\n        d = W[degree + i] + dk - nvi;\n        d = Math.min(d, n - nel - nvi);\n\n        if (W[head + d] !== -1) {\n          last[W[head + d]] = i;\n        } // put i back in degree list\n\n\n        W[next + i] = W[head + d];\n        last[i] = -1;\n        W[head + d] = i; // find new minimum degree\n\n        mindeg = Math.min(mindeg, d);\n        W[degree + i] = d; // place i in Lk\n\n        cindex[p++] = i;\n      } // # nodes absorbed into k\n\n\n      W[nv + k] = nvk; // length of adj list of element k\n\n      if ((W[len + k] = p - pk1) === 0) {\n        // k is a root of the tree\n        cptr[k] = -1; // k is now a dead element\n\n        W[w + k] = 0;\n      }\n\n      if (elenk !== 0) {\n        // free unused space in Lk\n        cnz = p;\n      }\n    } // Postordering. The elimination is complete, but no permutation has been computed. All that is left\n    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if\n    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation\n    // is computed. The tree is restored by unflipping all of ptr.\n    // fix assembly tree\n\n\n    for (i = 0; i < n; i++) {\n      cptr[i] = csFlip(cptr[i]);\n    }\n\n    for (j = 0; j <= n; j++) {\n      W[head + j] = -1;\n    } // place unordered nodes in lists\n\n\n    for (j = n; j >= 0; j--) {\n      // skip if j is an element\n      if (W[nv + j] > 0) {\n        continue;\n      } // place j in list of its parent\n\n\n      W[next + j] = W[head + cptr[j]];\n      W[head + cptr[j]] = j;\n    } // place elements in lists\n\n\n    for (e = n; e >= 0; e--) {\n      // skip unless e is an element\n      if (W[nv + e] <= 0) {\n        continue;\n      }\n\n      if (cptr[e] !== -1) {\n        // place e in list of its parent\n        W[next + e] = W[head + cptr[e]];\n        W[head + cptr[e]] = e;\n      }\n    } // postorder the assembly tree\n\n\n    for (k = 0, i = 0; i <= n; i++) {\n      if (cptr[i] === -1) {\n        k = csTdfs(i, k, W, head, next, P, w);\n      }\n    } // remove last item in array\n\n\n    P.splice(P.length - 1, 1); // return P\n\n    return P;\n  };\n  /**\n   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation\n   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.\n   *\n   * Order: 0\n   *   A natural ordering P=null matrix is returned.\n   *\n   * Order: 1\n   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.\n   *   P = M + M'\n   *\n   * Order: 2\n   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.\n   *   P = M' * M\n   *\n   * Order: 3\n   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.\n   *   P = M' * M\n   */\n\n\n  function _createTargetMatrix(order, a, m, n, dense) {\n    // compute A'\n    var at = transpose(a); // check order = 1, matrix must be square\n\n    if (order === 1 && n === m) {\n      // C = A + A'\n      return add(a, at);\n    } // check order = 2, drop dense columns from M'\n\n\n    if (order === 2) {\n      // transpose arrays\n      var tindex = at._index;\n      var tptr = at._ptr; // new column index\n\n      var p2 = 0; // loop A' columns (rows)\n\n      for (var j = 0; j < m; j++) {\n        // column j of AT starts here\n        var p = tptr[j]; // new column j starts here\n\n        tptr[j] = p2; // skip dense col j\n\n        if (tptr[j + 1] - p > dense) {\n          continue;\n        } // map rows in column j of A\n\n\n        for (var p1 = tptr[j + 1]; p < p1; p++) {\n          tindex[p2++] = tindex[p];\n        }\n      } // finalize AT\n\n\n      tptr[m] = p2; // recreate A from new transpose matrix\n\n      a = transpose(at); // use A' * A\n\n      return multiply(at, a);\n    } // use A' * A, square or rectangular matrix\n\n\n    return multiply(at, a);\n  }\n  /**\n   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:\n   *\n   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.\n   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).\n   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.\n   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).\n   */\n\n\n  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {\n    // Initialize quotient graph\n    for (var k = 0; k < n; k++) {\n      W[len + k] = cptr[k + 1] - cptr[k];\n    }\n\n    W[len + n] = 0; // initialize workspace\n\n    for (var i = 0; i <= n; i++) {\n      // degree list i is empty\n      W[head + i] = -1;\n      last[i] = -1;\n      W[next + i] = -1; // hash list i is empty\n\n      W[hhead + i] = -1; // node i is just one node\n\n      W[nv + i] = 1; // node i is alive\n\n      W[w + i] = 1; // Ek of node i is empty\n\n      W[elen + i] = 0; // degree of node i\n\n      W[degree + i] = W[len + i];\n    } // clear w\n\n\n    var mark = _wclear(0, 0, W, w, n); // n is a dead element\n\n\n    W[elen + n] = -2; // n is a root of assembly tree\n\n    cptr[n] = -1; // n is a dead element\n\n    W[w + n] = 0; // return mark\n\n    return mark;\n  }\n  /**\n   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with\n   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the\n   * output permutation p.\n   */\n\n\n  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {\n    // result\n    var nel = 0; // loop columns\n\n    for (var i = 0; i < n; i++) {\n      // degree @ i\n      var d = W[degree + i]; // check node i is empty\n\n      if (d === 0) {\n        // element i is dead\n        W[elen + i] = -2;\n        nel++; // i is a root of assembly tree\n\n        cptr[i] = -1;\n        W[w + i] = 0;\n      } else if (d > dense) {\n        // absorb i into element n\n        W[nv + i] = 0; // node i is dead\n\n        W[elen + i] = -1;\n        nel++;\n        cptr[i] = csFlip(n);\n        W[nv + n]++;\n      } else {\n        var h = W[head + d];\n\n        if (h !== -1) {\n          last[h] = i;\n        } // put node i in degree list d\n\n\n        W[next + i] = W[head + d];\n        W[head + d] = i;\n      }\n    }\n\n    return nel;\n  }\n\n  function _wclear(mark, lemax, W, w, n) {\n    if (mark < 2 || mark + lemax < 0) {\n      for (var k = 0; k < n; k++) {\n        if (W[w + k] !== 0) {\n          W[w + k] = 1;\n        }\n      }\n\n      mark = 2;\n    } // at this point, W [0..n-1] < mark holds\n\n\n    return mark;\n  }\n\n  function _diag(i, j) {\n    return i !== j;\n  }\n\n  return csAmd;\n}\n\nexports.name = 'csAmd';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var transpose = load(require('../../matrix/transpose'));\n  var csLeaf = load(require('./csLeaf'));\n  /**\n   * Computes the column counts using the upper triangular part of A.\n   * It transposes A internally, none of the input parameters are modified.\n   *\n   * @param {Matrix} a           The sparse matrix A\n   *\n   * @param {Matrix} ata         Count the columns of A'A instead\n   *\n   * @return                     An array of size n of the column counts or null on error\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csCounts = function csCounts(a, parent, post, ata) {\n    // check inputs\n    if (!a || !parent || !post) {\n      return null;\n    } // a matrix arrays\n\n\n    var asize = a._size; // rows and columns\n\n    var m = asize[0];\n    var n = asize[1]; // variables\n\n    var i, j, k, J, p, p0, p1; // workspace size\n\n    var s = 4 * n + (ata ? n + m + 1 : 0); // allocate workspace\n\n    var w = []; // (s)\n\n    var ancestor = 0; // first n entries\n\n    var maxfirst = n; // next n entries\n\n    var prevleaf = 2 * n; // next n entries\n\n    var first = 3 * n; // next n entries\n\n    var head = 4 * n; // next n + 1 entries (used when ata is true)\n\n    var next = 5 * n + 1; // last entries in workspace\n    // clear workspace w[0..s-1]\n\n    for (k = 0; k < s; k++) {\n      w[k] = -1;\n    } // allocate result\n\n\n    var colcount = []; // (n)\n    // AT = A'\n\n    var at = transpose(a); // at arrays\n\n    var tindex = at._index;\n    var tptr = at._ptr; // find w[first + j]\n\n    for (k = 0; k < n; k++) {\n      j = post[k]; // colcount[j]=1 if j is a leaf\n\n      colcount[j] = w[first + j] === -1 ? 1 : 0;\n\n      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {\n        w[first + j] = k;\n      }\n    } // initialize ata if needed\n\n\n    if (ata) {\n      // invert post\n      for (k = 0; k < n; k++) {\n        w[post[k]] = k;\n      } // loop rows (columns in AT)\n\n\n      for (i = 0; i < m; i++) {\n        // values in column i of AT\n        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) {\n          k = Math.min(k, w[tindex[p]]);\n        } // place row i in linked list k\n\n\n        w[next + i] = w[head + k];\n        w[head + k] = i;\n      }\n    } // each node in its own set\n\n\n    for (i = 0; i < n; i++) {\n      w[ancestor + i] = i;\n    }\n\n    for (k = 0; k < n; k++) {\n      // j is the kth node in postordered etree\n      j = post[k]; // check j is not a root\n\n      if (parent[j] !== -1) {\n        colcount[parent[j]]--;\n      } // J=j for LL'=A case\n\n\n      for (J = ata ? w[head + k] : j; J !== -1; J = ata ? w[next + J] : -1) {\n        for (p = tptr[J]; p < tptr[J + 1]; p++) {\n          i = tindex[p];\n          var r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor); // check A(i,j) is in skeleton\n\n          if (r.jleaf >= 1) {\n            colcount[j]++;\n          } // check account for overlap in q\n\n\n          if (r.jleaf === 2) {\n            colcount[r.q]--;\n          }\n        }\n      }\n\n      if (parent[j] !== -1) {\n        w[ancestor + j] = parent[j];\n      }\n    } // sum up colcount's of each child\n\n\n    for (j = 0; j < n; j++) {\n      if (parent[j] !== -1) {\n        colcount[parent[j]] += colcount[j];\n      }\n    }\n\n    return colcount;\n  };\n\n  return csCounts;\n}\n\nexports.name = 'csCounts';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csMarked = load(require('./csMarked'));\n  var csMark = load(require('./csMark'));\n  var csUnflip = load(require('./csUnflip'));\n  /**\n   * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting\n   * at nodes in B (see csReach()).\n   *\n   * @param {Number}  j               The starting node for the DFS algorithm\n   * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored\n   * @param {Number}  top             Start index in stack xi[top..n-1]\n   * @param {Number}  k               The kth column in B\n   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n   *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b\n   *\n   * @return {Number}                 New value of top\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csDfs = function csDfs(j, g, top, xi, pinv) {\n    // g arrays\n    var index = g._index;\n    var ptr = g._ptr;\n    var size = g._size; // columns\n\n    var n = size[1]; // vars\n\n    var i, p, p2; // initialize head\n\n    var head = 0; // initialize the recursion stack\n\n    xi[0] = j; // loop\n\n    while (head >= 0) {\n      // get j from the top of the recursion stack\n      j = xi[head]; // apply permutation vector\n\n      var jnew = pinv ? pinv[j] : j; // check node j is marked\n\n      if (!csMarked(ptr, j)) {\n        // mark node j as visited\n        csMark(ptr, j); // update stack (last n entries in xi)\n\n        xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew]);\n      } // node j done if no unvisited neighbors\n\n\n      var done = 1; // examine all neighbors of j, stack (last n entries in xi)\n\n      for (p = xi[n + head], p2 = jnew < 0 ? 0 : csUnflip(ptr[jnew + 1]); p < p2; p++) {\n        // consider neighbor node i\n        i = index[p]; // check we have visited node i, skip it\n\n        if (csMarked(ptr, i)) {\n          continue;\n        } // pause depth-first search of node j, update stack (last n entries in xi)\n\n\n        xi[n + head] = p; // start dfs at node i\n\n        xi[++head] = i; // node j is not done\n\n        done = 0; // break, to start dfs(i)\n\n        break;\n      } // check depth-first search at node j is done\n\n\n      if (done) {\n        // remove j from the recursion stack\n        head--; // and place in the output stack\n\n        xi[--top] = j;\n      }\n    }\n\n    return top;\n  };\n\n  return csDfs;\n}\n\nexports.name = 'csDfs';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * Computes the elimination tree of Matrix A (using triu(A)) or the\n   * elimination tree of A'A without forming A'A.\n   *\n   * @param {Matrix}  a               The A Matrix\n   * @param {boolean} ata             A value of true the function computes the etree of A'A\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  var csEtree = function csEtree(a, ata) {\n    // check inputs\n    if (!a) {\n      return null;\n    } // a arrays\n\n\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size; // rows & columns\n\n    var m = asize[0];\n    var n = asize[1]; // allocate result\n\n    var parent = []; // (n)\n    // allocate workspace\n\n    var w = []; // (n + (ata ? m : 0))\n\n    var ancestor = 0; // first n entries in w\n\n    var prev = n; // last m entries (ata = true)\n\n    var i, inext; // check we are calculating A'A\n\n    if (ata) {\n      // initialize workspace\n      for (i = 0; i < m; i++) {\n        w[prev + i] = -1;\n      }\n    } // loop columns\n\n\n    for (var k = 0; k < n; k++) {\n      // node k has no parent yet\n      parent[k] = -1; // nor does k have an ancestor\n\n      w[ancestor + k] = -1; // values in column k\n\n      for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n        // row\n        var r = aindex[p]; // node\n\n        i = ata ? w[prev + r] : r; // traverse from i to k\n\n        for (; i !== -1 && i < k; i = inext) {\n          // inext = ancestor of i\n          inext = w[ancestor + i]; // path compression\n\n          w[ancestor + i] = k; // check no anc., parent is k\n\n          if (inext === -1) {\n            parent[i] = k;\n          }\n        }\n\n        if (ata) {\n          w[prev + r] = k;\n        }\n      }\n    }\n\n    return parent;\n  };\n\n  return csEtree;\n}\n\nexports.name = 'csEtree';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise\n   *\n   * @param {Matrix}   a              The sparse matrix\n   * @param {function} callback       The callback function, function will be invoked with the following args:\n   *                                    - The entry row\n   *                                    - The entry column\n   *                                    - The entry value\n   *                                    - The state parameter\n   * @param {any}      other          The state\n   *\n   * @return                          The number of nonzero elements in the matrix\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  var csFkeep = function csFkeep(a, callback, other) {\n    // a arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size; // columns\n\n    var n = asize[1]; // nonzero items\n\n    var nz = 0; // loop columns\n\n    for (var j = 0; j < n; j++) {\n      // get current location of col j\n      var p = aptr[j]; // record new location of col j\n\n      aptr[j] = nz;\n\n      for (; p < aptr[j + 1]; p++) {\n        // check we need to keep this item\n        if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {\n          // keep A(i,j)\n          aindex[nz] = aindex[p]; // check we need to process values (pattern only)\n\n          if (avalues) {\n            avalues[nz] = avalues[p];\n          } // increment nonzero items\n\n\n          nz++;\n        }\n      }\n    } // finalize A\n\n\n    aptr[n] = nz; // trim arrays\n\n    aindex.splice(nz, aindex.length - nz); // check we need to process values (pattern only)\n\n    if (avalues) {\n      avalues.splice(nz, avalues.length - nz);\n    } // return number of nonzero items\n\n\n    return nz;\n  };\n\n  return csFkeep;\n}\n\nexports.name = 'csFkeep';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * This function \"flips\" its input about the integer -1.\n   *\n   * @param {Number}  i               The value to flip\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  var csFlip = function csFlip(i) {\n    // flip the value\n    return -i - 2;\n  };\n\n  return csFlip;\n}\n\nexports.name = 'csFlip';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.\n   *\n   * @param {Array} p           The permutation vector of length n. null value denotes identity\n   * @param {Array} b           The input vector\n   *\n   * @return {Array}            The output vector x = P'b\n   */\n  function csIpvec(p, b) {\n    // vars\n    var k;\n    var n = b.length;\n    var x = []; // check permutation vector was provided, p = null denotes identity\n\n    if (p) {\n      // loop vector\n      for (k = 0; k < n; k++) {\n        // apply permutation\n        x[p[k]] = b[k];\n      }\n    } else {\n      // loop vector\n      for (k = 0; k < n; k++) {\n        // x[i] = b[i]\n        x[k] = b[k];\n      }\n    }\n\n    return x;\n  }\n\n  return csIpvec;\n}\n\nexports.name = 'csIpvec';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * This function determines if j is a leaf of the ith row subtree.\n   * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)\n   *\n   * @param {Number}  i               The ith row subtree\n   * @param {Number}  j               The node to test\n   * @param {Array}   w               The workspace array\n   * @param {Number}  first           The index offset within the workspace for the first array\n   * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array\n   * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array\n   * @param {Number}  ancestor        The index offset within the workspace for the ancestor array\n   *\n   * @return {Object}\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  var csLeaf = function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {\n    var s, sparent, jprev; // our result\n\n    var jleaf = 0;\n    var q; // check j is a leaf\n\n    if (i <= j || w[first + j] <= w[maxfirst + i]) {\n      return -1;\n    } // update max first[j] seen so far\n\n\n    w[maxfirst + i] = w[first + j]; // jprev = previous leaf of ith subtree\n\n    jprev = w[prevleaf + i];\n    w[prevleaf + i] = j; // check j is first or subsequent leaf\n\n    if (jprev === -1) {\n      // 1st leaf, q = root of ith subtree\n      jleaf = 1;\n      q = i;\n    } else {\n      // update jleaf\n      jleaf = 2; // q = least common ancester (jprev,j)\n\n      for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {\n        ;\n      }\n\n      for (s = jprev; s !== q; s = sparent) {\n        // path compression\n        sparent = w[ancestor + s];\n        w[ancestor + s] = q;\n      }\n    }\n\n    return {\n      jleaf: jleaf,\n      q: q\n    };\n  };\n\n  return csLeaf;\n}\n\nexports.name = 'csLeaf';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var abs = load(require('../../arithmetic/abs'));\n  var divideScalar = load(require('../../arithmetic/divideScalar'));\n  var multiply = load(require('../../arithmetic/multiply'));\n  var larger = load(require('../../relational/larger'));\n  var largerEq = load(require('../../relational/largerEq'));\n  var csSpsolve = load(require('./csSpsolve'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization\n   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L\n   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so\n   * L * U = A(p, q), where p is the inverse of pinv.\n   *\n   * @param {Matrix}  m               The A Matrix to factorize\n   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing\n   *                                  column ordering q\n   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)\n   *\n   * @return {Number}                 The numeric LU factorization of A or null\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csLu = function csLu(m, s, tol) {\n    // validate input\n    if (!m) {\n      return null;\n    } // m arrays\n\n\n    var size = m._size; // columns\n\n    var n = size[1]; // symbolic analysis result\n\n    var q;\n    var lnz = 100;\n    var unz = 100; // update symbolic analysis parameters\n\n    if (s) {\n      q = s.q;\n      lnz = s.lnz || lnz;\n      unz = s.unz || unz;\n    } // L arrays\n\n\n    var lvalues = []; // (lnz)\n\n    var lindex = []; // (lnz)\n\n    var lptr = []; // (n + 1)\n    // L\n\n    var L = new SparseMatrix({\n      values: lvalues,\n      index: lindex,\n      ptr: lptr,\n      size: [n, n]\n    }); // U arrays\n\n    var uvalues = []; // (unz)\n\n    var uindex = []; // (unz)\n\n    var uptr = []; // (n + 1)\n    // U\n\n    var U = new SparseMatrix({\n      values: uvalues,\n      index: uindex,\n      ptr: uptr,\n      size: [n, n]\n    }); // inverse of permutation vector\n\n    var pinv = []; // (n)\n    // vars\n\n    var i, p; // allocate arrays\n\n    var x = []; // (n)\n\n    var xi = []; // (2 * n)\n    // initialize variables\n\n    for (i = 0; i < n; i++) {\n      // clear workspace\n      x[i] = 0; // no rows pivotal yet\n\n      pinv[i] = -1; // no cols of L yet\n\n      lptr[i + 1] = 0;\n    } // reset number of nonzero elements in L and U\n\n\n    lnz = 0;\n    unz = 0; // compute L(:,k) and U(:,k)\n\n    for (var k = 0; k < n; k++) {\n      // update ptr\n      lptr[k] = lnz;\n      uptr[k] = unz; // apply column permutations if needed\n\n      var col = q ? q[k] : k; // solve triangular system, x = L\\A(:,col)\n\n      var top = csSpsolve(L, m, col, xi, x, pinv, 1); // find pivot\n\n      var ipiv = -1;\n      var a = -1; // loop xi[] from top -> n\n\n      for (p = top; p < n; p++) {\n        // x[i] is nonzero\n        i = xi[p]; // check row i is not yet pivotal\n\n        if (pinv[i] < 0) {\n          // absolute value of x[i]\n          var xabs = abs(x[i]); // check absoulte value is greater than pivot value\n\n          if (larger(xabs, a)) {\n            // largest pivot candidate so far\n            a = xabs;\n            ipiv = i;\n          }\n        } else {\n          // x(i) is the entry U(pinv[i],k)\n          uindex[unz] = pinv[i];\n          uvalues[unz++] = x[i];\n        }\n      } // validate we found a valid pivot\n\n\n      if (ipiv === -1 || a <= 0) {\n        return null;\n      } // update actual pivot column, give preference to diagonal value\n\n\n      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {\n        ipiv = col;\n      } // the chosen pivot\n\n\n      var pivot = x[ipiv]; // last entry in U(:,k) is U(k,k)\n\n      uindex[unz] = k;\n      uvalues[unz++] = pivot; // ipiv is the kth pivot row\n\n      pinv[ipiv] = k; // first entry in L(:,k) is L(k,k) = 1\n\n      lindex[lnz] = ipiv;\n      lvalues[lnz++] = 1; // L(k+1:n,k) = x / pivot\n\n      for (p = top; p < n; p++) {\n        // row\n        i = xi[p]; // check x(i) is an entry in L(:,k)\n\n        if (pinv[i] < 0) {\n          // save unpermuted row in L\n          lindex[lnz] = i; // scale pivot column\n\n          lvalues[lnz++] = divideScalar(x[i], pivot);\n        } // x[0..n-1] = 0 for next k\n\n\n        x[i] = 0;\n      }\n    } // update ptr\n\n\n    lptr[n] = lnz;\n    uptr[n] = unz; // fix row indices of L for final pinv\n\n    for (p = 0; p < lnz; p++) {\n      lindex[p] = pinv[lindex[p]];\n    } // trim arrays\n\n\n    lvalues.splice(lnz, lvalues.length - lnz);\n    lindex.splice(lnz, lindex.length - lnz);\n    uvalues.splice(unz, uvalues.length - unz);\n    uindex.splice(unz, uindex.length - unz); // return LU factor\n\n    return {\n      L: L,\n      U: U,\n      pinv: pinv\n    };\n  };\n\n  return csLu;\n}\n\nexports.name = 'csLu';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csFlip = load(require('./csFlip'));\n  /**\n   * Marks the node at w[j]\n   *\n   * @param {Array}   w               The array\n   * @param {Number}  j               The array index\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csMark = function csMark(w, j) {\n    // mark w[j]\n    w[j] = csFlip(w[j]);\n  };\n\n  return csMark;\n}\n\nexports.name = 'csMark';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * Checks if the node at w[j] is marked\n   *\n   * @param {Array}   w               The array\n   * @param {Number}  j               The array index\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  var csMarked = function csMarked(w, j) {\n    // check node is marked\n    return w[j] < 0;\n  };\n\n  return csMarked;\n}\n\nexports.name = 'csMarked';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type) {\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Permutes a sparse matrix C = P * A * Q\n   *\n   * @param {Matrix}  a               The Matrix A\n   * @param {Array}   pinv            The row permutation vector\n   * @param {Array}   q               The column permutation vector\n   * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise\n   *\n   * @return {Matrix}                 C = P * A * Q, null on error\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csPermute = function csPermute(a, pinv, q, values) {\n    // a arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // rows & columns\n\n    var m = asize[0];\n    var n = asize[1]; // c arrays\n\n    var cvalues = values && a._values ? [] : null;\n    var cindex = []; // (aptr[n])\n\n    var cptr = []; // (n + 1)\n    // initialize vars\n\n    var nz = 0; // loop columns\n\n    for (var k = 0; k < n; k++) {\n      // column k of C is column q[k] of A\n      cptr[k] = nz; // apply column permutation\n\n      var j = q ? q[k] : k; // loop values in column j of A\n\n      for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {\n        // row i of A is row pinv[i] of C\n        var r = pinv ? pinv[aindex[t]] : aindex[t]; // index\n\n        cindex[nz] = r; // check we need to populate values\n\n        if (cvalues) {\n          cvalues[nz] = avalues[t];\n        } // increment number of nonzero elements\n\n\n        nz++;\n      }\n    } // finalize the last column of C\n\n\n    cptr[n] = nz; // return C matrix\n\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [m, n],\n      datatype: adt\n    });\n  };\n\n  return csPermute;\n}\n\nexports.name = 'csPermute';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csTdfs = load(require('./csTdfs'));\n  /**\n   * Post order a tree of forest\n   *\n   * @param {Array}   parent          The tree or forest\n   * @param {Number}  n               Number of columns\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csPost = function csPost(parent, n) {\n    // check inputs\n    if (!parent) {\n      return null;\n    } // vars\n\n\n    var k = 0;\n    var j; // allocate result\n\n    var post = []; // (n)\n    // workspace, head: first n entries, next: next n entries, stack: last n entries\n\n    var w = []; // (3 * n)\n\n    var head = 0;\n    var next = n;\n    var stack = 2 * n; // initialize workspace\n\n    for (j = 0; j < n; j++) {\n      // empty linked lists\n      w[head + j] = -1;\n    } // traverse nodes in reverse order\n\n\n    for (j = n - 1; j >= 0; j--) {\n      // check j is a root\n      if (parent[j] === -1) {\n        continue;\n      } // add j to list of its parent\n\n\n      w[next + j] = w[head + parent[j]];\n      w[head + parent[j]] = j;\n    } // loop nodes\n\n\n    for (j = 0; j < n; j++) {\n      // skip j if it is not a root\n      if (parent[j] !== -1) {\n        continue;\n      } // depth-first search\n\n\n      k = csTdfs(j, k, w, head, next, post, stack);\n    }\n\n    return post;\n  };\n\n  return csPost;\n}\n\nexports.name = 'csPost';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csDfs = load(require('./csDfs'));\n  var csMarked = load(require('./csMarked'));\n  var csMark = load(require('./csMark'));\n  /**\n   * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1\n   * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The\n   * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).\n   *\n   * @param {Matrix}  g               The G matrix\n   * @param {Matrix}  b               The B matrix\n   * @param {Number}  k               The kth column in B\n   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n   *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n   * @param {Array}   pinv            The inverse row permutation vector\n   *\n   * @return {Number}                 The index for the nonzero pattern\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csReach = function csReach(g, b, k, xi, pinv) {\n    // g arrays\n    var gptr = g._ptr;\n    var gsize = g._size; // b arrays\n\n    var bindex = b._index;\n    var bptr = b._ptr; // columns\n\n    var n = gsize[1]; // vars\n\n    var p, p0, p1; // initialize top\n\n    var top = n; // loop column indeces in B\n\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n      // node i\n      var i = bindex[p]; // check node i is marked\n\n      if (!csMarked(gptr, i)) {\n        // start a dfs at unmarked node i\n        top = csDfs(i, g, top, xi, pinv);\n      }\n    } // loop columns from top -> n - 1\n\n\n    for (p = top; p < n; p++) {\n      // restore G\n      csMark(gptr, xi[p]);\n    }\n\n    return top;\n  };\n\n  return csReach;\n}\n\nexports.name = 'csReach';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var divideScalar = load(require('../../arithmetic/divideScalar'));\n  var multiply = load(require('../../arithmetic/multiply'));\n  var subtract = load(require('../../arithmetic/subtract'));\n  var csReach = load(require('./csReach'));\n  /**\n   * The function csSpsolve() computes the solution to G * x = bk, where bk is the\n   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the\n   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U\n   * is upper triangular with the diagonal entry as the last entry in each column.\n   *\n   * @param {Matrix}  g               The G matrix\n   * @param {Matrix}  b               The B matrix\n   * @param {Number}  k               The kth column in B\n   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n   *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n   * @param {Array}   x               The soluton to the linear system G * x = b\n   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b\n   * @param {boolean} lo              The lower (true) upper triangular (false) flag\n   *\n   * @return {Number}                 The index for the nonzero pattern\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csSpsolve = function csSpsolve(g, b, k, xi, x, pinv, lo) {\n    // g arrays\n    var gvalues = g._values;\n    var gindex = g._index;\n    var gptr = g._ptr;\n    var gsize = g._size; // columns\n\n    var n = gsize[1]; // b arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr; // vars\n\n    var p, p0, p1, q; // xi[top..n-1] = csReach(B(:,k))\n\n    var top = csReach(g, b, k, xi, pinv); // clear x\n\n    for (p = top; p < n; p++) {\n      x[xi[p]] = 0;\n    } // scatter b\n\n\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n      x[bindex[p]] = bvalues[p];\n    } // loop columns\n\n\n    for (var px = top; px < n; px++) {\n      // x array index for px\n      var j = xi[px]; // apply permutation vector (U x = b), j maps to column J of G\n\n      var J = pinv ? pinv[j] : j; // check column J is empty\n\n      if (J < 0) {\n        continue;\n      } // column value indeces in G, p0 <= p < p1\n\n\n      p0 = gptr[J];\n      p1 = gptr[J + 1]; // x(j) /= G(j,j)\n\n      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]); // first entry L(j,j)\n\n      p = lo ? p0 + 1 : p0;\n      q = lo ? p1 : p1 - 1; // loop\n\n      for (; p < q; p++) {\n        // row\n        var i = gindex[p]; // x(i) -= G(i,j) * x(j)\n\n        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));\n      }\n    } // return top of stack\n\n\n    return top;\n  };\n\n  return csSpsolve;\n}\n\nexports.name = 'csSpsolve';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csAmd = load(require('./csAmd'));\n  var csPermute = load(require('./csPermute'));\n  var csEtree = load(require('./csEtree'));\n  var csPost = load(require('./csPost'));\n  var csCounts = load(require('./csCounts'));\n  /**\n   * Symbolic ordering and analysis for QR and LU decompositions.\n   *\n   * @param {Number}  order           The ordering strategy (see csAmd for more details)\n   * @param {Matrix}  a               The A matrix\n   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or\n   *                                  symbolic ordering and analysis for LU decomposition (false)\n   *\n   * @return {Object}                 The Symbolic ordering and analysis for matrix A\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csSqr = function csSqr(order, a, qr) {\n    // a arrays\n    var aptr = a._ptr;\n    var asize = a._size; // columns\n\n    var n = asize[1]; // vars\n\n    var k; // symbolic analysis result\n\n    var s = {}; // fill-reducing ordering\n\n    s.q = csAmd(order, a); // validate results\n\n    if (order && !s.q) {\n      return null;\n    } // QR symbolic analysis\n\n\n    if (qr) {\n      // apply permutations if needed\n      var c = order ? csPermute(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)\n\n      s.parent = csEtree(c, 1); // post order elimination tree\n\n      var post = csPost(s.parent, n); // col counts chol(C'*C)\n\n      s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements\n\n      if (c && s.parent && s.cp && _vcount(c, s)) {\n        // calculate number of nonzero elements\n        for (s.unz = 0, k = 0; k < n; k++) {\n          s.unz += s.cp[k];\n        }\n      }\n    } else {\n      // for LU factorization only, guess nnz(L) and nnz(U)\n      s.unz = 4 * aptr[n] + n;\n      s.lnz = s.unz;\n    } // return result S\n\n\n    return s;\n  };\n  /**\n   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent\n   */\n\n\n  function _vcount(a, s) {\n    // a arrays\n    var aptr = a._ptr;\n    var aindex = a._index;\n    var asize = a._size; // rows & columns\n\n    var m = asize[0];\n    var n = asize[1]; // initialize s arrays\n\n    s.pinv = []; // (m + n)\n\n    s.leftmost = []; // (m)\n    // vars\n\n    var parent = s.parent;\n    var pinv = s.pinv;\n    var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n\n    var w = []; // (m + 3 * n)\n\n    var next = 0;\n    var head = m;\n    var tail = m + n;\n    var nque = m + 2 * n; // vars\n\n    var i, k, p, p0, p1; // initialize w\n\n    for (k = 0; k < n; k++) {\n      // queue k is empty\n      w[head + k] = -1;\n      w[tail + k] = -1;\n      w[nque + k] = 0;\n    } // initialize row arrays\n\n\n    for (i = 0; i < m; i++) {\n      leftmost[i] = -1;\n    } // loop columns backwards\n\n\n    for (k = n - 1; k >= 0; k--) {\n      // values & index for column k\n      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n        // leftmost[i] = min(find(A(i,:)))\n        leftmost[aindex[p]] = k;\n      }\n    } // scan rows in reverse order\n\n\n    for (i = m - 1; i >= 0; i--) {\n      // row i is not yet ordered\n      pinv[i] = -1;\n      k = leftmost[i]; // check row i is empty\n\n      if (k === -1) {\n        continue;\n      } // first row in queue k\n\n\n      if (w[nque + k]++ === 0) {\n        w[tail + k] = i;\n      } // put i at head of queue k\n\n\n      w[next + i] = w[head + k];\n      w[head + k] = i;\n    }\n\n    s.lnz = 0;\n    s.m2 = m; // find row permutation and nnz(V)\n\n    for (k = 0; k < n; k++) {\n      // remove row i from queue k\n      i = w[head + k]; // count V(k,k) as nonzero\n\n      s.lnz++; // add a fictitious row\n\n      if (i < 0) {\n        i = s.m2++;\n      } // associate row i with V(:,k)\n\n\n      pinv[i] = k; // skip if V(k+1:m,k) is empty\n\n      if (--nque[k] <= 0) {\n        continue;\n      } // nque[k] is nnz (V(k+1:m,k))\n\n\n      s.lnz += w[nque + k]; // move all rows to parent of k\n\n      var pa = parent[k];\n\n      if (pa !== -1) {\n        if (w[nque + pa] === 0) {\n          w[tail + pa] = w[tail + k];\n        }\n\n        w[next + w[tail + k]] = w[head + pa];\n        w[head + pa] = w[next + i];\n        w[nque + pa] += w[nque + k];\n      }\n    }\n\n    for (i = 0; i < m; i++) {\n      if (pinv[i] < 0) {\n        pinv[i] = k++;\n      }\n    }\n\n    return true;\n  }\n\n  return csSqr;\n}\n\nexports.name = 'csSqr';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory() {\n  /**\n   * Depth-first search and postorder of a tree rooted at node j\n   *\n   * @param {Number}  j               The tree node\n   * @param {Number}  k\n   * @param {Array}   w               The workspace array\n   * @param {Number}  head            The index offset within the workspace for the head array\n   * @param {Number}  next            The index offset within the workspace for the next array\n   * @param {Array}   post            The post ordering array\n   * @param {Number}  stack           The index offset within the workspace for the stack array\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n  var csTdfs = function csTdfs(j, k, w, head, next, post, stack) {\n    // variables\n    var top = 0; // place j on the stack\n\n    w[stack] = j; // while (stack is not empty)\n\n    while (top >= 0) {\n      // p = top of stack\n      var p = w[stack + top]; // i = youngest child of p\n\n      var i = w[head + p];\n\n      if (i === -1) {\n        // p has no unordered children left\n        top--; // node p is the kth postordered node\n\n        post[k++] = p;\n      } else {\n        // remove i from children of p\n        w[head + p] = w[next + i]; // increment top\n\n        ++top; // start dfs on child node i\n\n        w[stack + top] = i;\n      }\n    }\n\n    return k;\n  };\n\n  return csTdfs;\n}\n\nexports.name = 'csTdfs';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var csFlip = load(require('./csFlip'));\n  /**\n   * Flips the value if it is negative of returns the same value otherwise.\n   *\n   * @param {Number}  i               The value to flip\n   *\n   * Reference: http://faculty.cse.tamu.edu/davis/publications.html\n   */\n\n  var csUnflip = function csUnflip(i) {\n    // flip the value if it is negative\n    return i < 0 ? csFlip(i) : i;\n  };\n\n  return csUnflip;\n}\n\nexports.name = 'csUnflip';\nexports.path = 'algebra.sparse';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the absolute value of a number. For matrices, the function is\n   * evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.abs(x)\n   *\n   * Examples:\n   *\n   *    math.abs(3.5)                // returns number 3.5\n   *    math.abs(-4.2)               // returns number 4.2\n   *\n   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]\n   *\n   * See also:\n   *\n   *    sign\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            A number or matrix for which to get the absolute value\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}\n   *            Absolute value of `x`\n   */\n  var abs = typed('abs', {\n    'number': Math.abs,\n    'Complex': function Complex(x) {\n      return x.abs();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.abs();\n    },\n    'Fraction': function Fraction(x) {\n      return x.abs();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since abs(0) = 0\n      return deepMap(x, abs, true);\n    },\n    'Unit': function Unit(x) {\n      return x.abs();\n    }\n  });\n  abs.toTex = {\n    1: \"\\\\left|${args[0]}\\\\right|\"\n  };\n  return abs;\n}\n\nexports.name = 'abs';\nexports.factory = factory;","'use strict';\n\nvar extend = require('../../utils/object').extend;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var addScalar = load(require('./addScalar'));\n\n  var latex = require('../../utils/latex.js');\n\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm04 = load(require('../../type/matrix/utils/algorithm04'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Add two or more values, `x + y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.add(x, y)\n   *    math.add(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.add(2, 3)               // returns number 5\n   *    math.add(2, 3, 4)            // returns number 9\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(-4, 1)\n   *    math.add(a, b)               // returns Complex -2 + 4i\n   *\n   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]\n   *\n   *    const c = math.unit('5 cm')\n   *    const d = math.unit('2.1 mm')\n   *    math.add(c, d)               // returns Unit 52.1 mm\n   *\n   *    math.add(\"2.3\", \"4\")         // returns number 6.3\n   *\n   * See also:\n   *\n   *    subtract, sum\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`\n   */\n\n  var add = typed('add', extend({\n    // we extend the signatures of addScalar with signatures dealing with matrices\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, addScalar);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, addScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, addScalar, true);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, addScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return add(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return add(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return add(x, matrix(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, addScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, y, addScalar, false);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, addScalar, true);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, addScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, addScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, addScalar, true).valueOf();\n    },\n    'any, any': addScalar,\n    'any, any, ...any': function anyAnyAny(x, y, rest) {\n      var result = add(x, y);\n\n      for (var i = 0; i < rest.length; i++) {\n        result = add(result, rest[i]);\n      }\n\n      return result;\n    }\n  }, addScalar.signatures));\n  add.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['add'], \"${args[1]}\\\\right)\")\n  };\n  return add;\n}\n\nexports.name = 'add';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix), and does\n   * not validate the number of of inputs.\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit}                      Sum of `x` and `y`\n   * @private\n   */\n  var add = typed('add', {\n    'number, number': function numberNumber(x, y) {\n      return x + y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.plus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');\n      if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = add(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    }\n  });\n  return add;\n}\n\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var unaryMinus = load(require('./unaryMinus'));\n  var isNegative = load(require('../utils/isNegative'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Calculate the cubic root of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cbrt(x)\n   *    math.cbrt(x, allRoots)\n   *\n   * Examples:\n   *\n   *    math.cbrt(27)                  // returns 3\n   *    math.cube(3)                   // returns 27\n   *    math.cbrt(-64)                 // returns -4\n   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m\n   *    math.cbrt([27, 64, 125])       // returns [3, 4, 5]\n   *\n   *    const x = math.complex('8i')\n   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i\n   *    math.cbrt(x, true)             // returns Matrix [\n   *                                    //    1.7320508075689 + i\n   *                                    //   -1.7320508075689 + i\n   *                                    //   -2i\n   *                                    // ]\n   *\n   * See also:\n   *\n   *    square, sqrt, cube\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x\n   *            Value for which to calculate the cubic root.\n   * @param {boolean} [allRoots]  Optional, false by default. Only applicable\n   *            when `x` is a number or complex number. If true, all complex\n   *            roots are returned, if false (default) the principal root is\n   *            returned.\n   * @return {number | BigNumber | Complex | Unit | Array | Matrix}\n   *            Returns the cubic root of `x`\n   */\n\n  var cbrt = typed('cbrt', {\n    'number': _cbrtNumber,\n    // note: signature 'number, boolean' is also supported,\n    //       created by typed as it knows how to convert number to Complex\n    'Complex': _cbrtComplex,\n    'Complex, boolean': _cbrtComplex,\n    'BigNumber': function BigNumber(x) {\n      return x.cbrt();\n    },\n    'Unit': _cbrtUnit,\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since cbrt(0) = 0\n      return deepMap(x, cbrt, true);\n    }\n  });\n  /**\n   * Calculate the cubic root for a complex number\n   * @param {Complex} x\n   * @param {boolean} [allRoots]   If true, the function will return an array\n   *                               with all three roots. If false or undefined,\n   *                               the principal root is returned.\n   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x\n   * @private\n   */\n\n  function _cbrtComplex(x, allRoots) {\n    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers\n    var arg3 = x.arg() / 3;\n    var abs = x.abs(); // principal root:\n\n    var principal = new type.Complex(_cbrtNumber(abs), 0).mul(new type.Complex(0, arg3).exp());\n\n    if (allRoots) {\n      var all = [principal, new type.Complex(_cbrtNumber(abs), 0).mul(new type.Complex(0, arg3 + Math.PI * 2 / 3).exp()), new type.Complex(_cbrtNumber(abs), 0).mul(new type.Complex(0, arg3 - Math.PI * 2 / 3).exp())];\n      return config.matrix === 'Array' ? all : matrix(all);\n    } else {\n      return principal;\n    }\n  }\n  /**\n   * Calculate the cubic root for a Unit\n   * @param {Unit} x\n   * @return {Unit} Returns the cubic root of x\n   * @private\n   */\n\n\n  function _cbrtUnit(x) {\n    if (x.value && type.isComplex(x.value)) {\n      var result = x.clone();\n      result.value = 1.0;\n      result = result.pow(1.0 / 3); // Compute the units\n\n      result.value = _cbrtComplex(x.value); // Compute the value\n\n      return result;\n    } else {\n      var negate = isNegative(x.value);\n\n      if (negate) {\n        x.value = unaryMinus(x.value);\n      } // TODO: create a helper function for this\n\n\n      var third;\n\n      if (type.isBigNumber(x.value)) {\n        third = new type.BigNumber(1).div(3);\n      } else if (type.isFraction(x.value)) {\n        third = new type.Fraction(1, 3);\n      } else {\n        third = 1 / 3;\n      }\n\n      var _result = x.pow(third);\n\n      if (negate) {\n        _result.value = unaryMinus(_result.value);\n      }\n\n      return _result;\n    }\n  }\n\n  cbrt.toTex = {\n    1: \"\\\\sqrt[3]{${args[0]}}\"\n  };\n  return cbrt;\n}\n/**\n * Calculate cbrt for a number\n *\n * Code from es6-shim.js:\n *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number | Complex} Returns the cubic root of x\n * @private\n */\n\n\nvar _cbrtNumber = Math.cbrt || function (x) {\n  if (x === 0) {\n    return x;\n  }\n\n  var negate = x < 0;\n  var result;\n\n  if (negate) {\n    x = -x;\n  }\n\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3); // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n\n  return negate ? -result : result;\n};\n\nexports.name = 'cbrt';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var round = load(require('../../function/arithmetic/round'));\n  /**\n   * Round a value towards plus infinity\n   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.ceil(x)\n   *\n   * Examples:\n   *\n   *    math.ceil(3.2)               // returns number 4\n   *    math.ceil(3.8)               // returns number 4\n   *    math.ceil(-4.2)              // returns number -4\n   *    math.ceil(-4.7)              // returns number -4\n   *\n   *    const c = math.complex(3.2, -2.7)\n   *    math.ceil(c)                 // returns Complex 4 - 2i\n   *\n   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]\n   *\n   * See also:\n   *\n   *    floor, fix, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n   */\n\n  var ceil = typed('ceil', {\n    'number': function number(x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return Math.ceil(x);\n      }\n    },\n    'Complex': function Complex(x) {\n      return x.ceil();\n    },\n    'BigNumber': function BigNumber(x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.ceil();\n      }\n    },\n    'Fraction': function Fraction(x) {\n      return x.ceil();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, ceil, true);\n    }\n  });\n  ceil.toTex = {\n    1: \"\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil\"\n  };\n  return ceil;\n}\n\nexports.name = 'ceil';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the cube of a value, `x * x * x`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cube(x)\n   *\n   * Examples:\n   *\n   *    math.cube(2)            // returns number 8\n   *    math.pow(2, 3)          // returns number 8\n   *    math.cube(4)            // returns number 64\n   *    4 * 4 * 4               // returns number 64\n   *\n   *    math.cube([1, 2, 3, 4]) // returns Array [1, 8, 27, 64]\n   *\n   * See also:\n   *\n   *    multiply, square, pow, cbrt\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x  Number for which to calculate the cube\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} Cube of x\n   */\n  var cube = typed('cube', {\n    'number': function number(x) {\n      return x * x * x;\n    },\n    'Complex': function Complex(x) {\n      return x.mul(x).mul(x); // Is faster than pow(x, 3)\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.times(x).times(x);\n    },\n    'Fraction': function Fraction(x) {\n      return x.pow(3); // Is faster than mul()mul()mul()\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since cube(0) = 0\n      return deepMap(x, cube, true);\n    },\n    'Unit': function Unit(x) {\n      return x.pow(3);\n    }\n  });\n  cube.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)^3\"\n  };\n  return cube;\n}\n\nexports.name = 'cube';\nexports.factory = factory;","'use strict';\n\nvar extend = require('../../utils/object').extend;\n\nfunction factory(type, config, load, typed) {\n  var divideScalar = load(require('./divideScalar'));\n  var multiply = load(require('./multiply'));\n  var inv = load(require('../matrix/inv'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Divide two values, `x / y`.\n   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.\n   *\n   * Syntax:\n   *\n   *    math.divide(x, y)\n   *\n   * Examples:\n   *\n   *    math.divide(2, 3)            // returns number 0.6666666666666666\n   *\n   *    const a = math.complex(5, 14)\n   *    const b = math.complex(4, 1)\n   *    math.divide(a, b)            // returns Complex 2 + 3i\n   *\n   *    const c = [[7, -6], [13, -4]]\n   *    const d = [[1, 2], [4, 3]]\n   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]\n   *\n   *    const e = math.unit('18 km')\n   *    math.divide(e, 4.5)          // returns Unit 4 km\n   *\n   * See also:\n   *\n   *    multiply\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x   Numerator\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} y          Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`\n   */\n\n  var divide = typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(x, y) {\n      // TODO: implement matrix right division using pseudo inverse\n      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html\n      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html\n      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour\n      return multiply(x, inv(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, divideScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, divideScalar, false);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array | Matrix': function anyArrayMatrix(x, y) {\n      return multiply(x, inv(y));\n    }\n  }, divideScalar.signatures));\n  divide.toTex = {\n    2: \"\\\\frac{${args[0]}}{${args[1]}}\"\n  };\n  return divide;\n}\n\nexports.name = 'divide';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var numeric = load(require('../../type/numeric'));\n  var getTypeOf = load(require('../../function/utils/typeof'));\n  /**\n   * Divide two scalar values, `x / y`.\n   * This function is meant for internal use: it is used by the public functions\n   * `divide` and `inv`.\n   *\n   * This function does not support collections (Array or Matrix), and does\n   * not validate the number of of inputs.\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   Numerator\n   * @param  {number | BigNumber | Fraction | Complex} y          Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit}                      Quotient, `x / y`\n   * @private\n   */\n\n  var divideScalar = typed('divide', {\n    'number, number': function numberNumber(x, y) {\n      return x / y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.div(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.div(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.div(y);\n    },\n    'Unit, number | Fraction | BigNumber': function UnitNumberFractionBigNumber(x, y) {\n      var res = x.clone(); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n      var one = numeric(1, getTypeOf(y));\n      res.value = divideScalar(res.value === null ? res._normalize(one) : res.value, y);\n      return res;\n    },\n    'number | Fraction | BigNumber, Unit': function numberFractionBigNumberUnit(x, y) {\n      var res = y.clone();\n      res = res.pow(-1); // TODO: move the divide function to Unit.js, it uses internals of Unit\n\n      var one = numeric(1, getTypeOf(x));\n      res.value = divideScalar(x, y.value === null ? y._normalize(one) : y.value);\n      return res;\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return x.divide(y);\n    }\n  });\n  return divideScalar;\n}\n\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var divideScalar = load(require('./divideScalar'));\n\n  var latex = require('../../utils/latex');\n\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Divide two matrices element wise. The function accepts both matrices and\n   * scalar values.\n   *\n   * Syntax:\n   *\n   *    math.dotDivide(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotDivide(2, 4)   // returns 0.5\n   *\n   *    a = [[9, 5], [6, 1]]\n   *    b = [[3, 2], [5, 2]]\n   *\n   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]\n   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]\n   *\n   * See also:\n   *\n   *    divide, multiply, dotMultiply\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`\n   */\n\n  var dotDivide = typed('dotDivide', {\n    'any, any': divideScalar,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, divideScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, divideScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, divideScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, divideScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return dotDivide(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return dotDivide(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return dotDivide(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, divideScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, divideScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, divideScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, divideScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, divideScalar, true).valueOf();\n    }\n  });\n  dotDivide.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['dotDivide'], \"${args[1]}\\\\right)\")\n  };\n  return dotDivide;\n}\n\nexports.name = 'dotDivide';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var multiplyScalar = load(require('./multiplyScalar'));\n\n  var latex = require('../../utils/latex');\n\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm09 = load(require('../../type/matrix/utils/algorithm09'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Multiply two matrices element wise. The function accepts both matrices and\n   * scalar values.\n   *\n   * Syntax:\n   *\n   *    math.dotMultiply(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotMultiply(2, 4) // returns 8\n   *\n   *    a = [[9, 5], [6, 1]]\n   *    b = [[3, 2], [5, 2]]\n   *\n   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]\n   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]\n   *\n   * See also:\n   *\n   *    multiply, divide, dotDivide\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`\n   */\n\n  var dotMultiply = typed('dotMultiply', {\n    'any, any': multiplyScalar,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm09(x, y, multiplyScalar, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, multiplyScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, multiplyScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return dotMultiply(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return dotMultiply(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return dotMultiply(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n    }\n  });\n  dotMultiply.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['dotMultiply'], \"${args[1]}\\\\right)\")\n  };\n  return dotMultiply;\n}\n\nexports.name = 'dotMultiply';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var pow = load(require('./pow'));\n\n  var latex = require('../../utils/latex');\n\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Calculates the power of x to y element wise.\n   *\n   * Syntax:\n   *\n   *    math.dotPow(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotPow(2, 3)            // returns number 8\n   *\n   *    const a = [[1, 2], [4, 3]]\n   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]\n   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]\n   *\n   * See also:\n   *\n   *    pow, sqrt, multiply\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent\n   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`\n   */\n\n  var dotPow = typed('dotPow', {\n    'any, any': pow,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, pow, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, pow, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, pow, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, pow);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return dotPow(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return dotPow(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return dotPow(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, dotPow, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, dotPow, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, dotPow, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, dotPow, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, dotPow, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, dotPow, true).valueOf();\n    }\n  });\n  dotPow.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['dotPow'], \"${args[1]}\\\\right)\")\n  };\n  return dotPow;\n}\n\nexports.name = 'dotPow';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the exponent of a value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.exp(x)\n   *\n   * Examples:\n   *\n   *    math.exp(2)                  // returns number 7.3890560989306495\n   *    math.pow(math.e, 2)          // returns number 7.3890560989306495\n   *    math.log(math.exp(2))        // returns number 2\n   *\n   *    math.exp([1, 2, 3])\n   *    // returns Array [\n   *    //   2.718281828459045,\n   *    //   7.3890560989306495,\n   *    //   20.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    expm1, log, pow\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to exponentiate\n   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`\n   */\n  var exp = typed('exp', {\n    'number': Math.exp,\n    'Complex': function Complex(x) {\n      return x.exp();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.exp();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // TODO: exp(sparse) should return a dense matrix since exp(0)==1\n      return deepMap(x, exp);\n    }\n  });\n  exp.toTex = {\n    1: \"\\\\exp\\\\left(${args[0]}\\\\right)\"\n  };\n  return exp;\n}\n\nexports.name = 'exp';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n  /**\n   * Calculate the value of subtracting 1 from the exponential value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.expm1(x)\n   *\n   * Examples:\n   *\n   *    math.expm1(2)                      // returns number 6.38905609893065\n   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495\n   *    math.log(math.expm1(2) + 1)        // returns number 2\n   *\n   *    math.expm1([1, 2, 3])\n   *    // returns Array [\n   *    //   1.718281828459045,\n   *    //   6.3890560989306495,\n   *    //   19.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    exp, log, pow\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x  A number or matrix to apply expm1\n   * @return {number | BigNumber | Complex | Array | Matrix} Exponent of `x`\n   */\n\n\n  var expm1 = typed('expm1', {\n    'number': Math.expm1 || _expm1,\n    'Complex': function Complex(x) {\n      var r = Math.exp(x.re);\n      return new type.Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.exp().minus(1);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, expm1);\n    }\n  });\n  /**\n   * Calculates exponentiation minus 1.\n   * @param {number} x\n   * @return {number} res\n   * @private\n   */\n\n  function _expm1(x) {\n    return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n  }\n\n  expm1.toTex = \"\\\\left(e\".concat(latex.operators['pow'], \"{${args[0]}}-1\\\\right)\");\n  return expm1;\n}\n\nexports.name = 'expm1';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var ceil = load(require('../../function/arithmetic/ceil'));\n  var floor = load(require('../../function/arithmetic/floor'));\n  /**\n   * Round a value towards zero.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.fix(x)\n   *\n   * Examples:\n   *\n   *    math.fix(3.2)                // returns number 3\n   *    math.fix(3.8)                // returns number 3\n   *    math.fix(-4.2)               // returns number -4\n   *    math.fix(-4.7)               // returns number -4\n   *\n   *    const c = math.complex(3.2, -2.7)\n   *    math.fix(c)                  // returns Complex 3 - 2i\n   *\n   *    math.fix([3.2, 3.8, -4.7])   // returns Array [3, 3, -4]\n   *\n   * See also:\n   *\n   *    ceil, floor, round\n   *\n   * @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix}            Rounded value\n   */\n\n  var fix = typed('fix', {\n    'number': function number(x) {\n      return x > 0 ? floor(x) : ceil(x);\n    },\n    'Complex': function Complex(x) {\n      return new type.Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.isNegative() ? ceil(x) : floor(x);\n    },\n    'Fraction': function Fraction(x) {\n      return x.s < 0 ? x.ceil() : x.floor();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, fix, true);\n    }\n  });\n  fix.toTex = {\n    1: \"\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)\"\n  };\n  return fix;\n}\n\nexports.name = 'fix';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var round = load(require('../../function/arithmetic/round'));\n  /**\n   * Round a value towards minus infinity.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.floor(x)\n   *\n   * Examples:\n   *\n   *    math.floor(3.2)              // returns number 3\n   *    math.floor(3.8)              // returns number 3\n   *    math.floor(-4.2)             // returns number -5\n   *    math.floor(-4.7)             // returns number -5\n   *\n   *    const c = math.complex(3.2, -2.7)\n   *    math.floor(c)                // returns Complex 3 - 3i\n   *\n   *    math.floor([3.2, 3.8, -4.7]) // returns Array [3, 3, -5]\n   *\n   * See also:\n   *\n   *    ceil, fix, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n   */\n\n  var floor = typed('floor', {\n    'number': function number(x) {\n      if (nearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return Math.floor(x);\n      }\n    },\n    'Complex': function Complex(x) {\n      return x.floor();\n    },\n    'BigNumber': function BigNumber(x) {\n      if (bigNearlyEqual(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.floor();\n      }\n    },\n    'Fraction': function Fraction(x) {\n      return x.floor();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, floor, true);\n    }\n  });\n  floor.toTex = {\n    1: \"\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor\"\n  };\n  return floor;\n}\n\nexports.name = 'floor';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm04 = load(require('../../type/matrix/utils/algorithm04'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Calculate the greatest common divisor for two or more values or arrays.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.gcd(a, b)\n   *    math.gcd(a, b, c, ...)\n   *\n   * Examples:\n   *\n   *    math.gcd(8, 12)              // returns 4\n   *    math.gcd(-4, 6)              // returns 2\n   *    math.gcd(25, 15, -10)        // returns 5\n   *\n   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]\n   *\n   * See also:\n   *\n   *    lcm, xgcd\n   *\n   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers\n   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor\n   */\n\n  var gcd = typed('gcd', {\n    'number, number': _gcd,\n    'BigNumber, BigNumber': _gcdBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.gcd(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, gcd);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, gcd, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, gcd, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, gcd);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return gcd(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return gcd(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return gcd(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm10(x, y, gcd, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, gcd, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      return algorithm10(y, x, gcd, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, gcd, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, gcd, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, gcd, true).valueOf();\n    },\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {\n      var res = gcd(a, b);\n\n      for (var i = 0; i < args.length; i++) {\n        res = gcd(res, args[i]);\n      }\n\n      return res;\n    }\n  });\n  gcd.toTex = \"\\\\gcd\\\\left(${args}\\\\right)\";\n  return gcd;\n  /**\n   * Calculate gcd for BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @returns {BigNumber} Returns greatest common denominator of a and b\n   * @private\n   */\n\n  function _gcdBigNumber(a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function gcd must be integer numbers');\n    } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n    var zero = new type.BigNumber(0);\n\n    while (!b.isZero()) {\n      var r = a.mod(b);\n      a = b;\n      b = r;\n    }\n\n    return a.lt(zero) ? a.neg() : a;\n  }\n}\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n * @private\n */\n\n\nfunction _gcd(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers');\n  } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n  var r;\n\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n\n  return a < 0 ? -a : a;\n}\n\nexports.name = 'gcd';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var abs = load(require('./abs'));\n  var add = load(require('./addScalar'));\n  var divide = load(require('./divideScalar'));\n  var multiply = load(require('./multiplyScalar'));\n  var sqrt = load(require('./sqrt'));\n  var smaller = load(require('../relational/smaller'));\n  var isPositive = load(require('../utils/isPositive'));\n  /**\n   * Calculate the hypotenusa of a list with values. The hypotenusa is defined as:\n   *\n   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)\n   *\n   * For matrix input, the hypotenusa is calculated for all values in the matrix.\n   *\n   * Syntax:\n   *\n   *     math.hypot(a, b, ...)\n   *     math.hypot([a, b, c, ...])\n   *\n   * Examples:\n   *\n   *     math.hypot(3, 4)      // 5\n   *     math.hypot(3, 4, 5)   // 7.0710678118654755\n   *     math.hypot([3, 4, 5]) // 7.0710678118654755\n   *     math.hypot(-2)        // 2\n   *\n   * See also:\n   *\n   *     abs, norm\n   *\n   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.\n   *                                                          Matrix and Array input is flattened and returns a\n   *                                                          single number for the whole matrix.\n   * @return {number | BigNumber} Returns the hypothenusa of the input values.\n   */\n\n  var hypot = typed('hypot', {\n    '... number | BigNumber': _hypot,\n    'Array': function Array(x) {\n      return hypot.apply(hypot, flatten(x));\n    },\n    'Matrix': function Matrix(x) {\n      return hypot.apply(hypot, flatten(x.toArray()));\n    }\n  });\n  /**\n   * Calculate the hypotenusa for an Array with values\n   * @param {Array.<number | BigNumber>} args\n   * @return {number | BigNumber} Returns the result\n   * @private\n   */\n\n  function _hypot(args) {\n    // code based on `hypot` from es6-shim:\n    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633\n    var result = 0;\n    var largest = 0;\n\n    for (var i = 0; i < args.length; i++) {\n      var value = abs(args[i]);\n\n      if (smaller(largest, value)) {\n        result = multiply(result, multiply(divide(largest, value), divide(largest, value)));\n        result = add(result, 1);\n        largest = value;\n      } else {\n        result = add(result, isPositive(value) ? multiply(divide(value, largest), divide(value, largest)) : value);\n      }\n    }\n\n    return multiply(largest, sqrt(result));\n  }\n\n  hypot.toTex = \"\\\\hypot\\\\left(${args}\\\\right)\";\n  return hypot;\n}\n\nexports.name = 'hypot';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./abs'), require('./add'), require('./addScalar'), require('./cbrt'), require('./ceil'), require('./cube'), require('./divide'), require('./dotDivide'), require('./dotMultiply'), require('./dotPow'), require('./exp'), require('./expm1'), require('./fix'), require('./floor'), require('./gcd'), require('./hypot'), require('./lcm'), require('./log'), require('./log10'), require('./log1p'), require('./log2'), require('./mod'), require('./multiply'), require('./norm'), require('./nthRoot'), require('./nthRoots'), require('./pow'), require('./round'), require('./sign'), require('./sqrt'), require('./square'), require('./subtract'), require('./unaryMinus'), require('./unaryPlus'), require('./xgcd')];","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm06 = load(require('../../type/matrix/utils/algorithm06'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Calculate the least common multiple for two or more values or arrays.\n   *\n   * lcm is defined as:\n   *\n   *     lcm(a, b) = abs(a * b) / gcd(a, b)\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.lcm(a, b)\n   *    math.lcm(a, b, c, ...)\n   *\n   * Examples:\n   *\n   *    math.lcm(4, 6)               // returns 12\n   *    math.lcm(6, 21)              // returns 42\n   *    math.lcm(6, 21, 5)           // returns 210\n   *\n   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]\n   *\n   * See also:\n   *\n   *    gcd, xgcd\n   *\n   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers\n   * @return {number | BigNumber | Array | Matrix}                           The least common multiple\n   */\n\n  var lcm = typed('lcm', {\n    'number, number': _lcm,\n    'BigNumber, BigNumber': _lcmBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.lcm(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, lcm);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, lcm, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, lcm, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, lcm);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return lcm(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return lcm(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return lcm(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, lcm, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, lcm, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      return algorithm11(y, x, lcm, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, lcm, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, lcm, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, lcm, true).valueOf();\n    },\n    // TODO: need a smarter notation here\n    'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumberArrayMatrixNumberBigNumberArrayMatrixNumberBigNumber(a, b, args) {\n      var res = lcm(a, b);\n\n      for (var i = 0; i < args.length; i++) {\n        res = lcm(res, args[i]);\n      }\n\n      return res;\n    }\n  });\n  lcm.toTex = undefined; // use default template\n\n  return lcm;\n  /**\n   * Calculate lcm for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @returns {BigNumber} Returns the least common multiple of a and b\n   * @private\n   */\n\n  function _lcmBigNumber(a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function lcm must be integer numbers');\n    }\n\n    if (a.isZero() || b.isZero()) {\n      return new type.BigNumber(0);\n    } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    // evaluate lcm here inline to reduce overhead\n\n\n    var prod = a.times(b);\n\n    while (!b.isZero()) {\n      var t = b;\n      b = a.mod(t);\n      a = t;\n    }\n\n    return prod.div(a).abs();\n  }\n}\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n * @private\n */\n\n\nfunction _lcm(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function lcm must be integer numbers');\n  }\n\n  if (a === 0 || b === 0) {\n    return 0;\n  } // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n\n\n  var t;\n  var prod = a * b;\n\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n\n  return Math.abs(prod / a);\n}\n\nexports.name = 'lcm';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var divideScalar = load(require('./divideScalar'));\n  /**\n   * Calculate the logarithm of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log(x)\n   *    math.log(x, base)\n   *\n   * Examples:\n   *\n   *    math.log(3.5)                  // returns 1.252762968495368\n   *    math.exp(math.log(2.4))        // returns 2.4\n   *\n   *    math.pow(10, 4)                // returns 10000\n   *    math.log(10000, 10)            // returns 4\n   *    math.log(10000) / math.log(10) // returns 4\n   *\n   *    math.log(1024, 2)              // returns 10\n   *    math.pow(2, 10)                // returns 1024\n   *\n   * See also:\n   *\n   *    exp, log2, log10, log1p\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @param {number | BigNumber | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x` is calculated.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the logarithm of `x`\n   */\n\n  var log = typed('log', {\n    'number': function number(x) {\n      if (x >= 0 || config.predictable) {\n        return Math.log(x);\n      } else {\n        // negative value -> complex value computation\n        return new type.Complex(x, 0).log();\n      }\n    },\n    'Complex': function Complex(x) {\n      return x.log();\n    },\n    'BigNumber': function BigNumber(x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.ln();\n      } else {\n        // downgrade to number, return Complex valued result\n        return new type.Complex(x.toNumber(), 0).log();\n      }\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, log);\n    },\n    'any, any': function anyAny(x, base) {\n      // calculate logarithm for a specified base, log(x, base)\n      return divideScalar(log(x), log(base));\n    }\n  });\n  log.toTex = {\n    1: \"\\\\ln\\\\left(${args[0]}\\\\right)\",\n    2: \"\\\\log_{${args[1]}}\\\\left(${args[0]}\\\\right)\"\n  };\n  return log;\n}\n\nexports.name = 'log';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log10(x)\n   *\n   * Examples:\n   *\n   *    math.log10(0.00001)            // returns -5\n   *    math.log10(10000)              // returns 4\n   *    math.log(10000) / math.log(10) // returns 4\n   *    math.pow(10, 4)                // returns 10000\n   *\n   * See also:\n   *\n   *    exp, log, log1p, log2\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the 10-base logarithm of `x`\n   */\n  var log10 = typed('log10', {\n    'number': function number(x) {\n      if (x >= 0 || config.predictable) {\n        return _log10(x);\n      } else {\n        // negative value -> complex value computation\n        return new type.Complex(x, 0).log().div(Math.LN10);\n      }\n    },\n    'Complex': function Complex(x) {\n      return new type.Complex(x).log().div(Math.LN10);\n    },\n    'BigNumber': function BigNumber(x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.log();\n      } else {\n        // downgrade to number, return Complex valued result\n        return new type.Complex(x.toNumber(), 0).log().div(Math.LN10);\n      }\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, log10);\n    }\n  });\n  log10.toTex = {\n    1: \"\\\\log_{10}\\\\left(${args[0]}\\\\right)\"\n  };\n  return log10;\n}\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n * @private\n */\n\n\nvar _log10 = Math.log10 || function (x) {\n  return Math.log(x) / Math.LN10;\n};\n\nexports.name = 'log10';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var divideScalar = load(require('./divideScalar'));\n  var log = load(require('./log'));\n  /**\n   * Calculate the logarithm of a `value+1`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log1p(x)\n   *    math.log1p(x, base)\n   *\n   * Examples:\n   *\n   *    math.log1p(2.5)                 // returns 1.252762968495368\n   *    math.exp(math.log1p(1.4))       // returns 2.4\n   *\n   *    math.pow(10, 4)                 // returns 10000\n   *    math.log1p(9999, 10)            // returns 4\n   *    math.log1p(9999) / math.log(10) // returns 4\n   *\n   * See also:\n   *\n   *    exp, log, log2, log10\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm of `x+1`.\n   * @param {number | BigNumber | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x+1` is calculated.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the logarithm of `x+1`\n   */\n\n  var log1p = typed('log1p', {\n    'number': _log1pNumber,\n    'Complex': _log1pComplex,\n    'BigNumber': function BigNumber(x) {\n      var y = x.plus(1);\n\n      if (!y.isNegative() || config.predictable) {\n        return y.ln();\n      } else {\n        // downgrade to number, return Complex valued result\n        return _log1pComplex(new type.Complex(x.toNumber(), 0));\n      }\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, log1p);\n    },\n    'any, any': function anyAny(x, base) {\n      // calculate logarithm for a specified base, log1p(x, base)\n      return divideScalar(log1p(x), log(base));\n    }\n  });\n  /**\n   * Calculate the natural logarithm of a `number+1`\n   * @param {number} x\n   * @returns {number | Complex}\n   * @private\n   */\n\n  function _log1pNumber(x) {\n    if (x >= -1 || config.predictable) {\n      return Math.log1p ? Math.log1p(x) : Math.log(x + 1);\n    } else {\n      // negative value -> complex value computation\n      return _log1pComplex(new type.Complex(x, 0));\n    }\n  }\n  /**\n   * Calculate the natural logarithm of a complex number + 1\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n\n\n  function _log1pComplex(x) {\n    var xRe1p = x.re + 1;\n    return new type.Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));\n  }\n\n  log1p.toTex = {\n    1: \"\\\\ln\\\\left(${args[0]}+1\\\\right)\",\n    2: \"\\\\log_{${args[1]}}\\\\left(${args[0]}+1\\\\right)\"\n  };\n  return log1p;\n}\n\nexports.name = 'log1p';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log2(x)\n   *\n   * Examples:\n   *\n   *    math.log2(0.03125)           // returns -5\n   *    math.log2(16)                // returns 4\n   *    math.log2(16) / math.log2(2) // returns 4\n   *    math.pow(2, 4)               // returns 16\n   *\n   * See also:\n   *\n   *    exp, log, log1p, log10\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the 2-base logarithm of `x`\n   */\n  var log2 = typed('log2', {\n    'number': function number(x) {\n      if (x >= 0 || config.predictable) {\n        return Math.log2 ? Math.log2(x) : Math.log(x) / Math.LN2;\n      } else {\n        // negative value -> complex value computation\n        return _log2Complex(new type.Complex(x, 0));\n      }\n    },\n    'Complex': _log2Complex,\n    'BigNumber': function BigNumber(x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.log(2);\n      } else {\n        // downgrade to number, return Complex valued result\n        return _log2Complex(new type.Complex(x.toNumber(), 0));\n      }\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, log2);\n    }\n  });\n  /**\n   * Calculate log2 for a complex value\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n\n  function _log2Complex(x) {\n    var newX = Math.sqrt(x.re * x.re + x.im * x.im);\n    return new type.Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);\n  }\n\n  log2.toTex = \"\\\\log_{2}\\\\left(${args[0]}\\\\right)\";\n  return log2;\n}\n\nexports.name = 'log2';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n\n  var latex = require('../../utils/latex');\n\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm05 = load(require('../../type/matrix/utils/algorithm05'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Calculates the modulus, the remainder of an integer division.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * The modulus is defined as:\n   *\n   *     x - y * floor(x / y)\n   *\n   * See https://en.wikipedia.org/wiki/Modulo_operation.\n   *\n   * Syntax:\n   *\n   *    math.mod(x, y)\n   *\n   * Examples:\n   *\n   *    math.mod(8, 3)                // returns 2\n   *    math.mod(11, 2)               // returns 1\n   *\n   *    function isOdd(x) {\n   *      return math.mod(x, 2) != 0\n   *    }\n   *\n   *    isOdd(2)                      // returns false\n   *    isOdd(3)                      // returns true\n   *\n   * See also:\n   *\n   *    divide\n   *\n   * @param  {number | BigNumber | Fraction | Array | Matrix} x Dividend\n   * @param  {number | BigNumber | Fraction | Array | Matrix} y Divisor\n   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.\n   */\n\n  var mod = typed('mod', {\n    'number, number': _mod,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return y.isZero() ? x : x.mod(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.mod(y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, mod, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, mod, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, mod, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, mod);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return mod(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return mod(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return mod(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, mod, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, mod, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, mod, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, mod, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, mod, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, mod, true).valueOf();\n    }\n  });\n  mod.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['mod'], \"${args[1]}\\\\right)\")\n  };\n  return mod;\n  /**\n   * Calculate the modulus of two numbers\n   * @param {number} x\n   * @param {number} y\n   * @returns {number} res\n   * @private\n   */\n\n  function _mod(x, y) {\n    if (y > 0) {\n      // We don't use JavaScript's % operator here as this doesn't work\n      // correctly for x < 0 and x === 0\n      // see https://en.wikipedia.org/wiki/Modulo_operation\n      return x - y * Math.floor(x / y);\n    } else if (y === 0) {\n      return x;\n    } else {\n      // y < 0\n      // TODO: implement mod for a negative divisor\n      throw new Error('Cannot calculate mod for a negative divisor');\n    }\n  }\n}\n\nexports.name = 'mod';\nexports.factory = factory;","'use strict';\n\nvar extend = require('../../utils/object').extend;\n\nvar array = require('../../utils/array');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var addScalar = load(require('./addScalar'));\n  var multiplyScalar = load(require('./multiplyScalar'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  var DenseMatrix = type.DenseMatrix;\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Multiply two or more values, `x * y`.\n   * For matrices, the matrix product is calculated.\n   *\n   * Syntax:\n   *\n   *    math.multiply(x, y)\n   *    math.multiply(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.multiply(4, 5.2)        // returns number 20.8\n   *    math.multiply(2, 3, 4)       // returns number 24\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.multiply(a, b)          // returns Complex 5 + 14i\n   *\n   *    const c = [[1, 2], [4, 3]]\n   *    const d = [[1, 2, 3], [3, -4, 7]]\n   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]\n   *\n   *    const e = math.unit('2.1 km')\n   *    math.multiply(3, e)          // returns Unit 6.3 km\n   *\n   * See also:\n   *\n   *    divide, prod, cross, dot\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to multiply\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`\n   */\n\n  var multiply = typed('multiply', extend({\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n    'Array, Array': function ArrayArray(x, y) {\n      // check dimensions\n      _validateMatrixDimensions(array.size(x), array.size(y)); // use dense matrix implementation\n\n\n      var m = multiply(matrix(x), matrix(y)); // return array or scalar\n\n      return type.isMatrix(m) ? m.valueOf() : m;\n    },\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // dimensions\n      var xsize = x.size();\n      var ysize = y.size(); // check dimensions\n\n      _validateMatrixDimensions(xsize, ysize); // process dimensions\n\n\n      if (xsize.length === 1) {\n        // process y dimensions\n        if (ysize.length === 1) {\n          // Vector * Vector\n          return _multiplyVectorVector(x, y, xsize[0]);\n        } // Vector * Matrix\n\n\n        return _multiplyVectorMatrix(x, y);\n      } // process y dimensions\n\n\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      } // Matrix * Matrix\n\n\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use Matrix * Matrix implementation\n      return multiply(x, matrix(y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use Matrix * Matrix implementation\n      return multiply(matrix(x, y.storage()), y);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': function anyAnyAny(x, y, rest) {\n      var result = multiply(x, y);\n\n      for (var i = 0; i < rest.length; i++) {\n        result = multiply(result, rest[i]);\n      }\n\n      return result;\n    }\n  }, multiplyScalar.signatures));\n\n  function _validateMatrixDimensions(size1, size2) {\n    // check left operand dimensions\n    switch (size1.length) {\n      case 1:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Vector x Vector\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');\n            }\n\n            break;\n\n          case 2:\n            // Vector x Matrix\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');\n            }\n\n            break;\n\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n\n        break;\n\n      case 2:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Matrix x Vector\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');\n            }\n\n            break;\n\n          case 2:\n            // Matrix x Matrix\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');\n            }\n\n            break;\n\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n\n        break;\n\n      default:\n        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');\n    }\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (N)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {number}             Scalar value\n   */\n\n\n  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    } // a dense\n\n\n    var adata = a._data;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bdt = b._datatype; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result (do not initialize it with zero)\n\n\n    var c = mf(adata[0], bdata[0]); // loop data\n\n    for (var i = 1; i < n; i++) {\n      // multiply and accumulate\n      c = af(c, mf(adata[i], bdata[i]));\n    }\n\n    return c;\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Matrix         (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n\n\n  function _multiplyVectorMatrix(a, b) {\n    // process storage\n    if (b.storage() !== 'dense') {\n      throw new Error('Support for SparseMatrix not implemented');\n    }\n\n    return _multiplyVectorDenseMatrix(a, b);\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Dense Matrix   (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n\n\n  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // rows & columns\n\n    var alength = asize[0];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix columns\n\n    for (var j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      var sum = mf(adata[0], bdata[0][j]); // loop vector\n\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n\n      c[j] = sum;\n    } // return matrix\n\n\n    return new DenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: dt\n    });\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {Matrix}             Dense Vector   (M)\n   */\n\n\n  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\n  });\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Matrix         (NxC)\n   *\n   * @return {Matrix}             Matrix         (MxC)\n   */\n\n\n  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix  (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             Dense Vector (M)\n   */\n\n\n  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = asize[0];\n    var acolumns = asize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix a rows\n\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i]; // sum (do not initialize it with zero)\n\n      var sum = mf(row[0], bdata[0]); // loop matrix a columns\n\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n\n      c[i] = sum;\n    } // return matrix\n\n\n    return new DenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: dt\n    });\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            DenseMatrix    (NxC)\n   *\n   * @return {Matrix}             DenseMatrix    (MxC)\n   */\n\n\n  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b dense\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var c = []; // loop matrix a rows\n\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i]; // initialize row array\n\n      c[i] = []; // loop matrix b columns\n\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]); // loop matrix a columns\n\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n\n        c[i][j] = sum;\n      }\n    } // return matrix\n\n\n    return new DenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            SparseMatrix   (NxC)\n   *\n   * @return {Matrix}             SparseMatrix   (MxC)\n   */\n\n\n  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b sparse\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate b matrix\n\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    } // rows & columns\n\n\n    var arows = asize[0];\n    var bcolumns = bsize[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // result\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // indeces in column jb\n\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1]; // do not process column jb if no data exists\n\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0; // loop a rows\n\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1; // C[i, jb]\n\n          var cij = void 0; // values in b column j\n\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb]; // check value has been initialized\n\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]); // update mark\n\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          } // check column has been processed and value != 0\n\n\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix    (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             SparseMatrix    (M, 1)\n   */\n\n\n  function _multiplySparseMatrixVector(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // validate a matrix\n\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    } // b dense\n\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var brows = b._size[0]; // result\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // workspace\n\n\n    var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // update ptr\n\n    cptr[0] = 0; // rows in b\n\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib]; // check b[ib] != 0, avoid loops\n\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          var ia = aindex[ka]; // check value exists in current j\n\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true; // add i to pattern of C\n\n            cindex.push(ia); // x(ia) = A\n\n            x[ia] = mf(vbi, avalues[ka]);\n          } else {\n            // i exists in C already\n            x[ia] = af(x[ia], mf(vbi, avalues[ka]));\n          }\n        }\n      }\n    } // copy values from x to column jb of c\n\n\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p]; // copy value\n\n      cvalues[p] = x[ic];\n    } // update ptr\n\n\n    cptr[1] = cindex.length; // return sparse matrix\n\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: dt\n    });\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            DenseMatrix       (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n\n\n  function _multiplySparseMatrixDenseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // validate a matrix\n\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    } // b dense\n\n\n    var bdata = b._data;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1]; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // equalScalar signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt);\n    } // result\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // workspace\n\n    var x = []; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // mark in workspace for current column\n\n      var mark = jb + 1; // rows in jb\n\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb]; // check b[ib, jb] != 0, avoid loops\n\n        if (!eq(vbij, zero)) {\n          // A values & index in ib column\n          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            var ia = aindex[ka]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia); // x(ia) = A\n\n              x[ia] = mf(vbij, avalues[ka]);\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(vbij, avalues[ka]));\n            }\n          }\n        }\n      } // copy values from x to column jb of c\n\n\n      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        var ic = cindex[p]; // copy value\n\n        cvalues[p] = x[ic];\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\n  }\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            SparseMatrix      (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n\n\n  function _multiplySparseMatrixSparseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype; // b sparse\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype; // rows & columns\n\n    var arows = a._size[0];\n    var bcolumns = b._size[1]; // flag indicating both matrices (a & b) contain data\n\n    var values = avalues && bvalues; // datatype\n\n    var dt; // addScalar signature to use\n\n    var af = addScalar; // multiplyScalar signature to use\n\n    var mf = multiplyScalar; // process data types\n\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signatures that matches (dt, dt)\n\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    } // result\n\n\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // c matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    }); // workspace\n\n    var x = values ? [] : undefined; // vector with marks indicating a value x[i] exists in a given column\n\n    var w = []; // variables\n\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib; // loop b columns\n\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length; // mark in workspace for current column\n\n      var mark = jb + 1; // B values & index in j\n\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb]; // check we need to process values\n\n        if (values) {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia); // x(ia) = A\n\n              x[ia] = mf(bvalues[kb], avalues[ka]);\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));\n            }\n          }\n        } else {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka]; // check value exists in current j\n\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark; // add i to pattern of C\n\n              cindex.push(ia);\n            }\n          }\n        }\n      } // check we need to process matrix values (pattern matrix)\n\n\n      if (values) {\n        // copy values from x to column jb of c\n        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          var ic = cindex[p]; // copy value\n\n          cvalues[p] = x[ic];\n        }\n      }\n    } // update ptr\n\n\n    cptr[bcolumns] = cindex.length; // return sparse matrix\n\n    return c;\n  }\n\n  multiply.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['multiply'], \"${args[1]}\\\\right)\")\n  };\n  return multiply;\n}\n\nexports.name = 'multiply';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Multiply two scalar values, `x * y`.\n   * This function is meant for internal use: it is used by the public function\n   * `multiply`\n   *\n   * This function does not support collections (Array or Matrix), and does\n   * not validate the number of of inputs.\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | Fraction | Complex | Unit}                      Multiplication of `x` and `y`\n   * @private\n   */\n  var multiplyScalar = typed('multiplyScalar', {\n    'number, number': function numberNumber(x, y) {\n      return x * y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.mul(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.times(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.mul(y);\n    },\n    'number | Fraction | BigNumber | Complex, Unit': function numberFractionBigNumberComplexUnit(x, y) {\n      var res = y.clone();\n      res.value = res.value === null ? res._normalize(x) : multiplyScalar(res.value, x);\n      return res;\n    },\n    'Unit, number | Fraction | BigNumber | Complex': function UnitNumberFractionBigNumberComplex(x, y) {\n      var res = x.clone();\n      res.value = res.value === null ? res._normalize(y) : multiplyScalar(res.value, y);\n      return res;\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return x.multiply(y);\n    }\n  });\n  return multiplyScalar;\n}\n\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var abs = load(require('../arithmetic/abs'));\n  var add = load(require('../arithmetic/add'));\n  var pow = load(require('../arithmetic/pow'));\n  var conj = load(require('../complex/conj'));\n  var sqrt = load(require('../arithmetic/sqrt'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  var larger = load(require('../relational/larger'));\n  var smaller = load(require('../relational/smaller'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Calculate the norm of a number, vector or matrix.\n   *\n   * The second parameter p is optional. If not provided, it defaults to 2.\n   *\n   * Syntax:\n   *\n   *    math.norm(x)\n   *    math.norm(x, p)\n   *\n   * Examples:\n   *\n   *    math.abs(-3.5)                         // returns 3.5\n   *    math.norm(-3.5)                        // returns 3.5\n   *\n   *    math.norm(math.complex(3, -4))         // returns 5\n   *\n   *    math.norm([1, 2, -3], Infinity)        // returns 3\n   *    math.norm([1, 2, -3], -Infinity)       // returns 1\n   *\n   *    math.norm([3, 4], 2)                   // returns 5\n   *\n   *    math.norm([[1, 2], [3, 4]], 1)          // returns 6\n   *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7\n   *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661\n   *\n   * See also:\n   *\n   *    abs, hypot\n   *\n   * @param  {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the norm\n   * @param  {number | BigNumber | string} [p=2]\n   *            Vector space.\n   *            Supported numbers include Infinity and -Infinity.\n   *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)\n   * @return {number | BigNumber} the p-norm\n   */\n\n  var norm = typed('norm', {\n    'number': Math.abs,\n    'Complex': function Complex(x) {\n      return x.abs();\n    },\n    'BigNumber': function BigNumber(x) {\n      // norm(x) = abs(x)\n      return x.abs();\n    },\n    'boolean': function boolean(x) {\n      // norm(x) = abs(x)\n      return Math.abs(x);\n    },\n    'Array': function Array(x) {\n      return _norm(matrix(x), 2);\n    },\n    'Matrix': function Matrix(x) {\n      return _norm(x, 2);\n    },\n    'number | Complex | BigNumber | boolean, number | BigNumber | string': function numberComplexBigNumberBooleanNumberBigNumberString(x) {\n      // ignore second parameter, TODO: remove the option of second parameter for these types\n      return norm(x);\n    },\n    'Array, number | BigNumber | string': function ArrayNumberBigNumberString(x, p) {\n      return _norm(matrix(x), p);\n    },\n    'Matrix, number | BigNumber | string': function MatrixNumberBigNumberString(x, p) {\n      return _norm(x, p);\n    }\n  });\n  /**\n   * Calculate the norm for an array\n   * @param {Matrix} x\n   * @param {number | string} p\n   * @returns {number} Returns the norm\n   * @private\n   */\n\n  function _norm(x, p) {\n    // size\n    var sizeX = x.size(); // check if it is a vector\n\n    if (sizeX.length === 1) {\n      // check p\n      if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n        // norm(x, Infinity) = max(abs(x))\n        var pinf = 0; // skip zeros since abs(0) === 0\n\n        x.forEach(function (value) {\n          var v = abs(value);\n\n          if (larger(v, pinf)) {\n            pinf = v;\n          }\n        }, true);\n        return pinf;\n      }\n\n      if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n        // norm(x, -Infinity) = min(abs(x))\n        var ninf; // skip zeros since abs(0) === 0\n\n        x.forEach(function (value) {\n          var v = abs(value);\n\n          if (!ninf || smaller(v, ninf)) {\n            ninf = v;\n          }\n        }, true);\n        return ninf || 0;\n      }\n\n      if (p === 'fro') {\n        return _norm(x, 2);\n      }\n\n      if (typeof p === 'number' && !isNaN(p)) {\n        // check p != 0\n        if (!equalScalar(p, 0)) {\n          // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p\n          var n = 0; // skip zeros since abs(0) === 0\n\n          x.forEach(function (value) {\n            n = add(pow(abs(value), p), n);\n          }, true);\n          return pow(n, 1 / p);\n        }\n\n        return Number.POSITIVE_INFINITY;\n      } // invalid parameter value\n\n\n      throw new Error('Unsupported parameter value');\n    } // MxN matrix\n\n\n    if (sizeX.length === 2) {\n      // check p\n      if (p === 1) {\n        // norm(x) = the largest column sum\n        var c = []; // result\n\n        var maxc = 0; // skip zeros since abs(0) == 0\n\n        x.forEach(function (value, index) {\n          var j = index[1];\n          var cj = add(c[j] || 0, abs(value));\n\n          if (larger(cj, maxc)) {\n            maxc = cj;\n          }\n\n          c[j] = cj;\n        }, true);\n        return maxc;\n      }\n\n      if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n        // norm(x) = the largest row sum\n        var r = []; // result\n\n        var maxr = 0; // skip zeros since abs(0) == 0\n\n        x.forEach(function (value, index) {\n          var i = index[0];\n          var ri = add(r[i] || 0, abs(value));\n\n          if (larger(ri, maxr)) {\n            maxr = ri;\n          }\n\n          r[i] = ri;\n        }, true);\n        return maxr;\n      }\n\n      if (p === 'fro') {\n        // norm(x) = sqrt(sum(diag(x'x)))\n        var fro = 0;\n        x.forEach(function (value, index) {\n          fro = add(fro, multiply(value, conj(value)));\n        });\n        return abs(sqrt(fro));\n      }\n\n      if (p === 2) {\n        // not implemented\n        throw new Error('Unsupported parameter value, missing implementation of matrix singular value decomposition');\n      } // invalid parameter value\n\n\n      throw new Error('Unsupported parameter value');\n    }\n  }\n\n  norm.toTex = {\n    1: \"\\\\left\\\\|${args[0]}\\\\right\\\\|\",\n    2: undefined // use default template\n\n  };\n  return norm;\n}\n\nexports.name = 'norm';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm06 = load(require('../../type/matrix/utils/algorithm06'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Calculate the nth root of a value.\n   * The principal nth root of a positive real number A, is the positive real\n   * solution of the equation\n   *\n   *     x^root = A\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *     math.nthRoot(a)\n   *     math.nthRoot(a, root)\n   *\n   * Examples:\n   *\n   *     math.nthRoot(9, 2)    // returns 3, as 3^2 == 9\n   *     math.sqrt(9)          // returns 3, as 3^2 == 9\n   *     math.nthRoot(64, 3)   // returns 4, as 4^3 == 64\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * @param {number | BigNumber | Array | Matrix | Complex} a\n   *              Value for which to calculate the nth root\n   * @param {number | BigNumber} [root=2]    The root.\n   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`\n   */\n\n  var complexErr = '' + 'Complex number not supported in function nthRoot. ' + 'Use nthRoots instead.';\n  var nthRoot = typed('nthRoot', {\n    'number': function number(x) {\n      return _nthRoot(x, 2);\n    },\n    'number, number': _nthRoot,\n    'BigNumber': function BigNumber(x) {\n      return _bigNthRoot(x, new type.BigNumber(2));\n    },\n    'Complex': function Complex(x) {\n      throw new Error(complexErr);\n    },\n    'Complex, number': function ComplexNumber(x, y) {\n      throw new Error(complexErr);\n    },\n    'BigNumber, BigNumber': _bigNthRoot,\n    'Array | Matrix': function ArrayMatrix(x) {\n      return nthRoot(x, 2);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      // density must be one (no zeros in matrix)\n      if (y.density() === 1) {\n        // sparse + sparse\n        return algorithm06(x, y, nthRoot);\n      } else {\n        // throw exception\n        throw new Error('Root must be non-zero');\n      }\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, nthRoot, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      // density must be one (no zeros in matrix)\n      if (y.density() === 1) {\n        // dense + sparse\n        return algorithm01(x, y, nthRoot, false);\n      } else {\n        // throw exception\n        throw new Error('Root must be non-zero');\n      }\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, nthRoot);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return nthRoot(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return nthRoot(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return nthRoot(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, nthRoot, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, nthRoot, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // density must be one (no zeros in matrix)\n      if (y.density() === 1) {\n        // sparse - scalar\n        return algorithm11(y, x, nthRoot, true);\n      } else {\n        // throw exception\n        throw new Error('Root must be non-zero');\n      }\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      return algorithm14(y, x, nthRoot, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return nthRoot(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return nthRoot(x, matrix(y)).valueOf();\n    }\n  });\n  nthRoot.toTex = {\n    2: \"\\\\sqrt[${args[1]}]{${args[0]}}\"\n  };\n  return nthRoot;\n  /**\n   * Calculate the nth root of a for BigNumbers, solve x^root == a\n   * https://rosettacode.org/wiki/Nth_root#JavaScript\n   * @param {BigNumber} a\n   * @param {BigNumber} root\n   * @private\n   */\n\n  function _bigNthRoot(a, root) {\n    var precision = type.BigNumber.precision;\n    var Big = type.BigNumber.clone({\n      precision: precision + 2\n    });\n    var zero = new type.BigNumber(0);\n    var one = new Big(1);\n    var inv = root.isNegative();\n\n    if (inv) {\n      root = root.neg();\n    }\n\n    if (root.isZero()) {\n      throw new Error('Root must be non-zero');\n    }\n\n    if (a.isNegative() && !root.abs().mod(2).equals(1)) {\n      throw new Error('Root must be odd when a is negative.');\n    } // edge cases zero and infinity\n\n\n    if (a.isZero()) {\n      return inv ? new Big(Infinity) : 0;\n    }\n\n    if (!a.isFinite()) {\n      return inv ? zero : a;\n    }\n\n    var x = a.abs().pow(one.div(root)); // If a < 0, we require that root is an odd integer,\n    // so (-1) ^ (1/root) = -1\n\n    x = a.isNeg() ? x.neg() : x;\n    return new type.BigNumber((inv ? one.div(x) : x).toPrecision(precision));\n  }\n}\n/**\n * Calculate the nth root of a, solve x^root == a\n * https://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} root\n * @private\n */\n\n\nfunction _nthRoot(a, root) {\n  var inv = root < 0;\n\n  if (inv) {\n    root = -root;\n  }\n\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  } // edge cases zero and infinity\n\n\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n\n  var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x; // Very nice algorithm, but fails with nthRoot(-2, 3).\n  // Newton's method has some well-known problems at times:\n  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n\n  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n   if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n   return inv ? 1 / x : x\n  */\n}\n\nexports.name = 'nthRoot';\nexports.factory = factory;","'use strict';\n\nvar Complex = require('../../type/complex/Complex');\n\nvar typed = require('../../core/typed');\n\nvar complex = Complex.factory('Complex', {}, '', typed, {\n  on: function on(x, y) {}\n});\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the nth roots of a value.\n   * An nth root of a positive real number A,\n   * is a positive real solution of the equation \"x^root = A\".\n   * This function returns an array of complex values.\n   *\n   * Syntax:\n   *\n   *    math.nthRoots(x)\n   *    math.nthRoots(x, root)\n   *\n   * Examples:\n   *\n   *    math.nthRoots(1)\n   *    // returns [\n   *    //   {re: 1, im: 0},\n   *    //   {re: -1, im: 0}\n   *    // ]\n   *    nthRoots(1, 3)\n   *    // returns [\n   *    //   { re: 1, im: 0 },\n   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },\n   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }\n   *    ]\n   *\n   * See also:\n   *\n   *    nthRoot, pow, sqrt\n   *\n   * @param {number | BigNumber | Fraction | Complex | Array | Matrix} x Number to be rounded\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix}            Rounded value\n   */\n  var nthRoots = typed('nthRoots', {\n    'Complex': function Complex(x) {\n      return _nthComplexRoots(x, 2);\n    },\n    'Complex, number': _nthComplexRoots\n  });\n  nthRoots.toTex = {\n    2: \"\\\\{y : $y^{args[1]} = {${args[0]}}\\\\}\"\n  };\n  return nthRoots;\n}\n/**\n * Each function here returns a real multiple of i as a Complex value.\n * @param  {number} val\n * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3\n */\n// This is used to fix float artifacts for zero-valued components.\n\n\nvar _calculateExactResult = [function realPos(val) {\n  return complex(val);\n}, function imagPos(val) {\n  return complex(0, val);\n}, function realNeg(val) {\n  return complex(-val);\n}, function imagNeg(val) {\n  return complex(0, -val);\n}];\n/**\n * Calculate the nth root of a Complex Number a using De Movire's Theorem.\n * @param  {Complex} a\n * @param  {number} root\n * @return {Array} array of n Complex Roots\n */\n\nfunction _nthComplexRoots(a, root) {\n  if (root < 0) throw new Error('Root must be greater than zero');\n  if (root === 0) throw new Error('Root must be non-zero');\n  if (root % 1 !== 0) throw new Error('Root must be an integer');\n  if (a === 0 || a.abs() === 0) return [complex(0)];\n  var aIsNumeric = typeof a === 'number';\n  var offset; // determine the offset (argument of a)/(pi/2)\n\n  if (aIsNumeric || a.re === 0 || a.im === 0) {\n    if (aIsNumeric) {\n      offset = 2 * +(a < 0); // numeric value on the real axis\n    } else if (a.im === 0) {\n      offset = 2 * +(a.re < 0); // complex value on the real axis\n    } else {\n      offset = 2 * +(a.im < 0) + 1; // complex value on the imaginary axis\n    }\n  }\n\n  var arg = a.arg();\n  var abs = a.abs();\n  var roots = [];\n  var r = Math.pow(abs, 1 / root);\n\n  for (var k = 0; k < root; k++) {\n    var halfPiFactor = (offset + 4 * k) / root;\n    /**\n     * If (offset + 4*k)/root is an integral multiple of pi/2\n     * then we can produce a more exact result.\n     */\n\n    if (halfPiFactor === Math.round(halfPiFactor)) {\n      roots.push(_calculateExactResult[halfPiFactor % 4](r));\n      continue;\n    }\n\n    roots.push(complex({\n      r: r,\n      phi: (arg + 2 * Math.PI * k) / root\n    }));\n  }\n\n  return roots;\n}\n\nexports.name = 'nthRoots';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar size = require('../../utils/array').size;\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var identity = load(require('../matrix/identity'));\n  var multiply = load(require('./multiply'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var fraction = load(require('../../type/fraction/function/fraction'));\n  var number = load(require('../../type/number'));\n  /**\n   * Calculates the power of x to y, `x ^ y`.\n   * Matrix exponentiation is supported for square matrices `x`, and positive\n   * integer exponents `y`.\n   *\n   * For cubic roots of negative numbers, the function returns the principal\n   * root by default. In order to let the function return the real root,\n   * math.js can be configured with `math.config({predictable: true})`.\n   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.\n   *\n   * Syntax:\n   *\n   *    math.pow(x, y)\n   *\n   * Examples:\n   *\n   *    math.pow(2, 3)               // returns number 8\n   *\n   *    const a = math.complex(2, 3)\n   *    math.pow(a, 2)                // returns Complex -5 + 12i\n   *\n   *    const b = [[1, 2], [4, 3]]\n   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]\n   *\n   * See also:\n   *\n   *    multiply, sqrt, cbrt, nthRoot\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | Complex} y                          The exponent\n   * @return {number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y`\n   */\n\n  var pow = typed('pow', {\n    'number, number': _pow,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.pow(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      if (y.isInteger() || x >= 0 || config.predictable) {\n        return x.pow(y);\n      } else {\n        return new type.Complex(x.toNumber(), 0).pow(y.toNumber(), 0);\n      }\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      if (y.d !== 1) {\n        if (config.predictable) {\n          throw new Error('Function pow does not support non-integer exponents for fractions.');\n        } else {\n          return _pow(x.valueOf(), y.valueOf());\n        }\n      } else {\n        return x.pow(y);\n      }\n    },\n    'Array, number': _powArray,\n    'Array, BigNumber': function ArrayBigNumber(x, y) {\n      return _powArray(x, y.toNumber());\n    },\n    'Matrix, number': _powMatrix,\n    'Matrix, BigNumber': function MatrixBigNumber(x, y) {\n      return _powMatrix(x, y.toNumber());\n    },\n    'Unit, number | BigNumber': function UnitNumberBigNumber(x, y) {\n      return x.pow(y);\n    }\n  });\n  /**\n   * Calculates the power of x to y, x^y, for two numbers.\n   * @param {number} x\n   * @param {number} y\n   * @return {number | Complex} res\n   * @private\n   */\n\n  function _pow(x, y) {\n    // Alternatively could define a 'realmode' config option or something, but\n    // 'predictable' will work for now\n    if (config.predictable && !isInteger(y) && x < 0) {\n      // Check to see if y can be represented as a fraction\n      try {\n        var yFrac = fraction(y);\n        var yNum = number(yFrac);\n\n        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {\n          if (yFrac.d % 2 === 1) {\n            return (yFrac.n % 2 === 0 ? 1 : -1) * Math.pow(-x, y);\n          }\n        }\n      } catch (ex) {} // fraction() throws an error if y is Infinity, etc.\n      // Unable to express y as a fraction, so continue on\n\n    } // x^Infinity === 0 if -1 < x < 1\n    // A real number 0 is returned instead of complex(0)\n\n\n    if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n      return 0;\n    } // **for predictable mode** x^Infinity === NaN if x < -1\n    // N.B. this behavour is different from `Math.pow` which gives\n    // (-2)^Infinity === Infinity\n\n\n    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {\n      return NaN;\n    }\n\n    if (isInteger(y) || x >= 0 || config.predictable) {\n      return Math.pow(x, y);\n    } else {\n      return new type.Complex(x, 0).pow(y, 0);\n    }\n  }\n  /**\n   * Calculate the power of a 2d array\n   * @param {Array} x     must be a 2 dimensional, square matrix\n   * @param {number} y    a positive, integer value\n   * @returns {Array}\n   * @private\n   */\n\n\n  function _powArray(x, y) {\n    if (!isInteger(y) || y < 0) {\n      throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')');\n    } // verify that A is a 2 dimensional square matrix\n\n\n    var s = size(x);\n\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');\n    }\n\n    if (s[0] !== s[1]) {\n      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');\n    }\n\n    var res = identity(s[0]).valueOf();\n    var px = x;\n\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res);\n      }\n\n      y >>= 1;\n      px = multiply(px, px);\n    }\n\n    return res;\n  }\n  /**\n   * Calculate the power of a 2d matrix\n   * @param {Matrix} x     must be a 2 dimensional, square matrix\n   * @param {number} y    a positive, integer value\n   * @returns {Matrix}\n   * @private\n   */\n\n\n  function _powMatrix(x, y) {\n    return matrix(_powArray(x.valueOf(), y));\n  }\n\n  pow.toTex = {\n    2: \"\\\\left(${args[0]}\\\\right)\".concat(latex.operators['pow'], \"{${args[1]}}\")\n  };\n  return pow;\n}\n\nexports.name = 'pow';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar toFixed = require('../../utils/number').toFixed;\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar NO_INT = 'Number of decimals in function round must be an integer';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  var zeros = load(require('../matrix/zeros'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Round a value towards the nearest integer.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.round(x)\n   *    math.round(x, n)\n   *\n   * Examples:\n   *\n   *    math.round(3.2)              // returns number 3\n   *    math.round(3.8)              // returns number 4\n   *    math.round(-4.2)             // returns number -4\n   *    math.round(-4.7)             // returns number -5\n   *    math.round(math.pi, 3)       // returns number 3.142\n   *    math.round(123.45678, 2)     // returns number 123.46\n   *\n   *    const c = math.complex(3.2, -2.7)\n   *    math.round(c)                // returns Complex 3 - 3i\n   *\n   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]\n   *\n   * See also:\n   *\n   *    ceil, fix, floor\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix} x  Number to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value\n   */\n\n  var round = typed('round', {\n    'number': function number(x) {\n      return _round(x, 0);\n    },\n    'number, number': function numberNumber(x, n) {\n      if (!isInteger(n)) {\n        throw new TypeError(NO_INT);\n      }\n\n      if (n < 0 || n > 15) {\n        throw new Error('Number of decimals in function round must be in te range of 0-15');\n      }\n\n      return _round(x, n);\n    },\n    'Complex': function Complex(x) {\n      return x.round();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.round(n);\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      var _n = n.toNumber();\n\n      return x.round(_n);\n    },\n    'number, BigNumber': function numberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      return new type.BigNumber(x).toDecimalPlaces(n.toNumber());\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.toDecimalPlaces(0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.toDecimalPlaces(n.toNumber());\n    },\n    'Fraction': function Fraction(x) {\n      return x.round();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n\n      return x.round(n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, round, true);\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, round, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, round, false);\n    },\n    'number | Complex | BigNumber, SparseMatrix': function numberComplexBigNumberSparseMatrix(x, y) {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm12(y, x, round, true);\n    },\n    'number | Complex | BigNumber, DenseMatrix': function numberComplexBigNumberDenseMatrix(x, y) {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, round, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, round, false).valueOf();\n    },\n    'number | Complex | BigNumber, Array': function numberComplexBigNumberArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, round, true).valueOf();\n    }\n  });\n  round.toTex = {\n    1: \"\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil\",\n    2: undefined // use default template\n\n  };\n  return round;\n}\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n * @private\n */\n\n\nfunction _round(value, decimals) {\n  return parseFloat(toFixed(value, decimals));\n}\n\nexports.name = 'round';\nexports.factory = factory;","'use strict';\n\nvar number = require('../../utils/number');\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the sign of a value. The sign of a value x is:\n   *\n   * -  1 when x > 0\n   * - -1 when x < 0\n   * -  0 when x == 0\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sign(x)\n   *\n   * Examples:\n   *\n   *    math.sign(3.5)               // returns 1\n   *    math.sign(-4.2)              // returns -1\n   *    math.sign(0)                 // returns 0\n   *\n   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]\n   *\n   * See also:\n   *\n   *    abs\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            The number for which to determine the sign\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}e\n   *            The sign of `x`\n   */\n  var sign = typed('sign', {\n    'number': number.sign,\n    'Complex': function Complex(x) {\n      return x.sign();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(x.cmp(0));\n    },\n    'Fraction': function Fraction(x) {\n      return new type.Fraction(x.s, 1);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sign(0) = 0\n      return deepMap(x, sign, true);\n    },\n    'Unit': function Unit(x) {\n      return sign(x.value);\n    }\n  });\n  sign.toTex = {\n    1: \"\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)\"\n  };\n  return sign;\n}\n\nexports.name = 'sign';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the square root of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sqrt(x)\n   *\n   * Examples:\n   *\n   *    math.sqrt(25)                // returns 5\n   *    math.square(5)               // returns 25\n   *    math.sqrt(-4)                // returns Complex 2i\n   *\n   * See also:\n   *\n   *    square, multiply, cube, cbrt, sqrtm\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x\n   *            Value for which to calculate the square root.\n   * @return {number | BigNumber | Complex | Array | Matrix | Unit}\n   *            Returns the square root of `x`\n   */\n  var sqrt = typed('sqrt', {\n    'number': _sqrtNumber,\n    'Complex': function Complex(x) {\n      return x.sqrt();\n    },\n    'BigNumber': function BigNumber(x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.sqrt();\n      } else {\n        // negative value -> downgrade to number to do complex value computation\n        return _sqrtNumber(x.toNumber());\n      }\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sqrt(0) = 0\n      return deepMap(x, sqrt, true);\n    },\n    'Unit': function Unit(x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5);\n    }\n  });\n  /**\n   * Calculate sqrt for a number\n   * @param {number} x\n   * @returns {number | Complex} Returns the square root of x\n   * @private\n   */\n\n  function _sqrtNumber(x) {\n    if (isNaN(x)) {\n      return NaN;\n    } else if (x >= 0 || config.predictable) {\n      return Math.sqrt(x);\n    } else {\n      return new type.Complex(x, 0).sqrt();\n    }\n  }\n\n  sqrt.toTex = {\n    1: \"\\\\sqrt{${args[0]}}\"\n  };\n  return sqrt;\n}\n\nexports.name = 'sqrt';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the square of a value, `x * x`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.square(x)\n   *\n   * Examples:\n   *\n   *    math.square(2)           // returns number 4\n   *    math.square(3)           // returns number 9\n   *    math.pow(3, 2)           // returns number 9\n   *    math.multiply(3, 3)      // returns number 9\n   *\n   *    math.square([1, 2, 3, 4])  // returns Array [1, 4, 9, 16]\n   *\n   * See also:\n   *\n   *    multiply, cube, sqrt, pow\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x\n   *            Number for which to calculate the square\n   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}\n   *            Squared value\n   */\n  var square = typed('square', {\n    'number': function number(x) {\n      return x * x;\n    },\n    'Complex': function Complex(x) {\n      return x.mul(x);\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.times(x);\n    },\n    'Fraction': function Fraction(x) {\n      return x.mul(x);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since square(0) = 0\n      return deepMap(x, square, true);\n    },\n    'Unit': function Unit(x) {\n      return x.pow(2);\n    }\n  });\n  square.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)^2\"\n  };\n  return square;\n}\n\nexports.name = 'square';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var addScalar = load(require('./addScalar'));\n  var unaryMinus = load(require('./unaryMinus'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm05 = load(require('../../type/matrix/utils/algorithm05'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14')); // TODO: split function subtract in two: subtract and subtractScalar\n\n  /**\n   * Subtract two values, `x - y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.subtract(x, y)\n   *\n   * Examples:\n   *\n   *    math.subtract(5.3, 2)        // returns number 3.3\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.subtract(a, b)          // returns Complex -2 + 2i\n   *\n   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]\n   *\n   *    const c = math.unit('2.1 km')\n   *    const d = math.unit('500m')\n   *    math.subtract(c, d)          // returns Unit 1.6 km\n   *\n   * See also:\n   *\n   *    add\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x\n   *            Initial value\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y\n   *            Value to subtract from `x`\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Subtraction of `x` and `y`\n   */\n\n  var subtract = typed('subtract', {\n    'number, number': function numberNumber(x, y) {\n      return x - y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.sub(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.minus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.sub(y);\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (x.value === null) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n\n      if (y.value === null) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n\n      if (!x.equalBase(y)) {\n        throw new Error('Units do not match');\n      }\n\n      var res = x.clone();\n      res.value = subtract(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm05(x, y, subtract);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm03(y, x, subtract, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm01(x, y, subtract, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      checkEqualDimensions(x, y);\n      return algorithm13(x, y, subtract);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return subtract(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return subtract(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return subtract(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, unaryMinus(y), addScalar);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, subtract);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, subtract, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, subtract, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, subtract, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, subtract, true).valueOf();\n    }\n  });\n  subtract.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['subtract'], \"${args[1]}\\\\right)\")\n  };\n  return subtract;\n}\n/**\n * Check whether matrix x and y have the same number of dimensions.\n * Throws a DimensionError when dimensions are not equal\n * @param {Matrix} x\n * @param {Matrix} y\n */\n\n\nfunction checkEqualDimensions(x, y) {\n  var xsize = x.size();\n  var ysize = y.size();\n\n  if (xsize.length !== ysize.length) {\n    throw new DimensionError(xsize.length, ysize.length);\n  }\n}\n\nexports.name = 'subtract';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n  /**\n   * Inverse the sign of a value, apply a unary minus operation.\n   *\n   * For matrices, the function is evaluated element wise. Boolean values and\n   * strings will be converted to a number. For complex numbers, both real and\n   * complex value are inverted.\n   *\n   * Syntax:\n   *\n   *    math.unaryMinus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryMinus(3.5)      // returns -3.5\n   *    math.unaryMinus(-4.2)     // returns 4.2\n   *\n   * See also:\n   *\n   *    add, subtract, unaryPlus\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.\n   */\n\n\n  var unaryMinus = typed('unaryMinus', {\n    'number': function number(x) {\n      return -x;\n    },\n    'Complex': function Complex(x) {\n      return x.neg();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.neg();\n    },\n    'Fraction': function Fraction(x) {\n      return x.neg();\n    },\n    'Unit': function Unit(x) {\n      var res = x.clone();\n      res.value = unaryMinus(x.value);\n      return res;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since unaryMinus(0) = 0\n      return deepMap(x, unaryMinus, true);\n    } // TODO: add support for string\n\n  });\n  unaryMinus.toTex = {\n    1: \"\".concat(latex.operators['unaryMinus'], \"\\\\left(${args[0]}\\\\right)\")\n  };\n  return unaryMinus;\n}\n\nexports.name = 'unaryMinus';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n  /**\n   * Unary plus operation.\n   * Boolean values and strings will be converted to a number, numeric values will be returned as is.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.unaryPlus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryPlus(3.5)      // returns 3.5\n   *    math.unaryPlus(1)     // returns 1\n   *\n   * See also:\n   *\n   *    unaryMinus, add, subtract\n   *\n   * @param  {number | BigNumber | Fraction | string | Complex | Unit | Array | Matrix} x\n   *            Input value\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Returns the input value when numeric, converts to a number when input is non-numeric.\n   */\n\n\n  var unaryPlus = typed('unaryPlus', {\n    'number': function number(x) {\n      return x;\n    },\n    'Complex': function Complex(x) {\n      return x; // complex numbers are immutable\n    },\n    'BigNumber': function BigNumber(x) {\n      return x; // bignumbers are immutable\n    },\n    'Fraction': function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    'Unit': function Unit(x) {\n      return x.clone();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since unaryPlus(0) = 0\n      return deepMap(x, unaryPlus, true);\n    },\n    'boolean | string': function booleanString(x) {\n      // convert to a number or bignumber\n      return config.number === 'BigNumber' ? new type.BigNumber(+x) : +x;\n    }\n  });\n  unaryPlus.toTex = {\n    1: \"\".concat(latex.operators['unaryPlus'], \"\\\\left(${args[0]}\\\\right)\")\n  };\n  return unaryPlus;\n}\n\nexports.name = 'unaryPlus';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Calculate the extended greatest common divisor for two values.\n   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.\n   *\n   * Syntax:\n   *\n   *    math.xgcd(a, b)\n   *\n   * Examples:\n   *\n   *    math.xgcd(8, 12)             // returns [4, -1, 1]\n   *    math.gcd(8, 12)              // returns 4\n   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]\n   *\n   * See also:\n   *\n   *    gcd, lcm\n   *\n   * @param {number | BigNumber} a  An integer number\n   * @param {number | BigNumber} b  An integer number\n   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`\n   *                              where `div = gcd(a, b)` and `a*m + b*n = div`\n   */\n\n  var xgcd = typed('xgcd', {\n    'number, number': _xgcd,\n    'BigNumber, BigNumber': _xgcdBigNumber // TODO: implement support for Fraction\n\n  });\n  xgcd.toTex = undefined; // use default template\n\n  return xgcd;\n  /**\n   * Calculate xgcd for two numbers\n   * @param {number} a\n   * @param {number} b\n   * @return {number} result\n   * @private\n   */\n\n  function _xgcd(a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    var t; // used to swap two variables\n\n    var q; // quotient\n\n    var r; // remainder\n\n    var x = 0;\n    var lastx = 1;\n    var y = 1;\n    var lasty = 0;\n\n    if (!isInteger(a) || !isInteger(b)) {\n      throw new Error('Parameters in function xgcd must be integer numbers');\n    }\n\n    while (b) {\n      q = Math.floor(a / b);\n      r = a - q * b;\n      t = x;\n      x = lastx - q * x;\n      lastx = t;\n      t = y;\n      y = lasty - q * y;\n      lasty = t;\n      a = b;\n      b = r;\n    }\n\n    var res;\n\n    if (a < 0) {\n      res = [-a, -lastx, -lasty];\n    } else {\n      res = [a, a ? lastx : 0, lasty];\n    }\n\n    return config.matrix === 'Array' ? res : matrix(res);\n  }\n  /**\n   * Calculate xgcd for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @return {BigNumber[]} result\n   * @private\n   */\n\n\n  function _xgcdBigNumber(a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    var // used to swap two variables\n    t;\n    var // quotient\n    q;\n    var // remainder\n    r;\n    var zero = new type.BigNumber(0);\n    var one = new type.BigNumber(1);\n    var x = zero;\n    var lastx = one;\n    var y = one;\n    var lasty = zero;\n\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function xgcd must be integer numbers');\n    }\n\n    while (!b.isZero()) {\n      q = a.div(b).floor();\n      r = a.mod(b);\n      t = x;\n      x = lastx.minus(q.times(x));\n      lastx = t;\n      t = y;\n      y = lasty.minus(q.times(y));\n      lasty = t;\n      a = b;\n      b = r;\n    }\n\n    var res;\n\n    if (a.lt(zero)) {\n      res = [a.neg(), lastx.neg(), lasty.neg()];\n    } else {\n      res = [a, !a.isZero() ? lastx : 0, lasty];\n    }\n\n    return config.matrix === 'Array' ? res : matrix(res);\n  }\n}\n\nexports.name = 'xgcd';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar bigBitAnd = require('../../utils/bignumber/bitAnd');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm06 = load(require('../../type/matrix/utils/algorithm06'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Bitwise AND two values, `x & y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.bitAnd(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitAnd(53, 131)               // returns number 1\n   *\n   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]\n   *\n   * See also:\n   *\n   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x First value to and\n   * @param  {number | BigNumber | Array | Matrix} y Second value to and\n   * @return {number | BigNumber | Array | Matrix} AND of `x` and `y`\n   */\n\n  var bitAnd = typed('bitAnd', {\n    'number, number': function numberNumber(x, y) {\n      if (!isInteger(x) || !isInteger(y)) {\n        throw new Error('Integers expected in function bitAnd');\n      }\n\n      return x & y;\n    },\n    'BigNumber, BigNumber': bigBitAnd,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, bitAnd, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, bitAnd, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, bitAnd, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, bitAnd);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return bitAnd(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return bitAnd(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return bitAnd(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm11(x, y, bitAnd, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, bitAnd, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm11(y, x, bitAnd, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, bitAnd, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, bitAnd, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, bitAnd, true).valueOf();\n    }\n  });\n  bitAnd.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['bitAnd'], \"${args[1]}\\\\right)\")\n  };\n  return bitAnd;\n}\n\nexports.name = 'bitAnd';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar bigBitNot = require('../../utils/bignumber/bitNot');\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n  /**\n   * Bitwise NOT value, `~x`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.bitNot(x)\n   *\n   * Examples:\n   *\n   *    math.bitNot(1)               // returns number -2\n   *\n   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, 5]\n   *\n   * See also:\n   *\n   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x Value to not\n   * @return {number | BigNumber | Array | Matrix} NOT of `x`\n   */\n\n\n  var bitNot = typed('bitNot', {\n    'number': function number(x) {\n      if (!isInteger(x)) {\n        throw new Error('Integer expected in function bitNot');\n      }\n\n      return ~x;\n    },\n    'BigNumber': bigBitNot,\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, bitNot);\n    }\n  });\n  bitNot.toTex = {\n    1: latex.operators['bitNot'] + \"\\\\left(${args[0]}\\\\right)\"\n  };\n  return bitNot;\n}\n\nexports.name = 'bitNot';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar bigBitOr = require('../../utils/bignumber/bitOr');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm04 = load(require('../../type/matrix/utils/algorithm04'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Bitwise OR two values, `x | y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the lowest print base.\n   *\n   * Syntax:\n   *\n   *    math.bitOr(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitOr(1, 2)               // returns number 3\n   *\n   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x First value to or\n   * @param  {number | BigNumber | Array | Matrix} y Second value to or\n   * @return {number | BigNumber | Array | Matrix} OR of `x` and `y`\n   */\n\n  var bitOr = typed('bitOr', {\n    'number, number': function numberNumber(x, y) {\n      if (!isInteger(x) || !isInteger(y)) {\n        throw new Error('Integers expected in function bitOr');\n      }\n\n      return x | y;\n    },\n    'BigNumber, BigNumber': bigBitOr,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm04(x, y, bitOr);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm01(y, x, bitOr, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, bitOr, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, bitOr);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return bitOr(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return bitOr(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return bitOr(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm10(x, y, bitOr, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, bitOr, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm10(y, x, bitOr, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, bitOr, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, bitOr, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, bitOr, true).valueOf();\n    }\n  });\n  bitOr.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['bitOr'], \"${args[1]}\\\\right)\")\n  };\n  return bitOr;\n}\n\nexports.name = 'bitOr';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar bigBitXor = require('../../utils/bignumber/bitXor');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Bitwise XOR two values, `x ^ y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.bitXor(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitXor(1, 2)               // returns number 3\n   *\n   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x First value to xor\n   * @param  {number | BigNumber | Array | Matrix} y Second value to xor\n   * @return {number | BigNumber | Array | Matrix} XOR of `x` and `y`\n   */\n\n  var bitXor = typed('bitXor', {\n    'number, number': function numberNumber(x, y) {\n      if (!isInteger(x) || !isInteger(y)) {\n        throw new Error('Integers expected in function bitXor');\n      }\n\n      return x ^ y;\n    },\n    'BigNumber, BigNumber': bigBitXor,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, bitXor);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, bitXor, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, bitXor, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, bitXor);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return bitXor(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return bitXor(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return bitXor(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, bitXor, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, bitXor, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, bitXor, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, bitXor, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, bitXor, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, bitXor, true).valueOf();\n    }\n  });\n  bitXor.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['bitXor'], \"${args[1]}\\\\right)\")\n  };\n  return bitXor;\n}\n\nexports.name = 'bitXor';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./bitAnd'), require('./bitNot'), require('./bitOr'), require('./bitXor'), require('./leftShift'), require('./rightArithShift'), require('./rightLogShift')];","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar bigLeftShift = require('../../utils/bignumber/leftShift');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  var zeros = load(require('../matrix/zeros'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm08 = load(require('../../type/matrix/utils/algorithm08'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Bitwise left logical shift of a value x by y number of bits, `x << y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.leftShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.leftShift(1, 2)               // returns number 4\n   *\n   *    math.leftShift([1, 2, 3], 4)       // returns Array [16, 32, 64]\n   *\n   * See also:\n   *\n   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber} y Amount of shifts\n   * @return {number | BigNumber | Array | Matrix} `x` shifted left `y` times\n   */\n\n  var leftShift = typed('leftShift', {\n    'number, number': function numberNumber(x, y) {\n      if (!isInteger(x) || !isInteger(y)) {\n        throw new Error('Integers expected in function leftShift');\n      }\n\n      return x << y;\n    },\n    'BigNumber, BigNumber': bigLeftShift,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, leftShift, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, leftShift, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, leftShift, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, leftShift);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return leftShift(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return leftShift(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return leftShift(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, leftShift, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, leftShift, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, leftShift, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, leftShift, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return leftShift(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return leftShift(x, matrix(y)).valueOf();\n    }\n  });\n  leftShift.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['leftShift'], \"${args[1]}\\\\right)\")\n  };\n  return leftShift;\n}\n\nexports.name = 'leftShift';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar bigRightArithShift = require('../../utils/bignumber/rightArithShift');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  var zeros = load(require('../matrix/zeros'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm08 = load(require('../../type/matrix/utils/algorithm08'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.rightArithShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.rightArithShift(4, 2)               // returns number 1\n   *\n   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 3]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber} y Amount of shifts\n   * @return {number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times\n   */\n\n  var rightArithShift = typed('rightArithShift', {\n    'number, number': function numberNumber(x, y) {\n      if (!isInteger(x) || !isInteger(y)) {\n        throw new Error('Integers expected in function rightArithShift');\n      }\n\n      return x >> y;\n    },\n    'BigNumber, BigNumber': bigRightArithShift,\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, rightArithShift, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, rightArithShift, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, rightArithShift, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, rightArithShift);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return rightArithShift(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return rightArithShift(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return rightArithShift(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, rightArithShift, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, rightArithShift, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, rightArithShift, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, rightArithShift, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return rightArithShift(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return rightArithShift(x, matrix(y)).valueOf();\n    }\n  });\n  rightArithShift.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['rightArithShift'], \"${args[1]}\\\\right)\")\n  };\n  return rightArithShift;\n}\n\nexports.name = 'rightArithShift';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  var zeros = load(require('../matrix/zeros'));\n  var algorithm01 = load(require('../../type/matrix/utils/algorithm01'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm08 = load(require('../../type/matrix/utils/algorithm08'));\n  var algorithm10 = load(require('../../type/matrix/utils/algorithm10'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.rightLogShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.rightLogShift(4, 2)               // returns number 1\n   *\n   *    math.rightLogShift([16, -32, 64], 4)   // returns Array [1, 2, 3]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift\n   *\n   * @param  {number | Array | Matrix} x Value to be shifted\n   * @param  {number} y Amount of shifts\n   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times\n   */\n\n  var rightLogShift = typed('rightLogShift', {\n    'number, number': function numberNumber(x, y) {\n      if (!isInteger(x) || !isInteger(y)) {\n        throw new Error('Integers expected in function rightLogShift');\n      }\n\n      return x >>> y;\n    },\n    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm08(x, y, rightLogShift, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, rightLogShift, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm01(x, y, rightLogShift, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, rightLogShift);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return rightLogShift(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return rightLogShift(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return rightLogShift(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm11(x, y, rightLogShift, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n\n      return algorithm14(x, y, rightLogShift, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm10(y, x, rightLogShift, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // check scalar\n      if (equalScalar(x, 0)) {\n        return zeros(y.size(), y.storage());\n      }\n\n      return algorithm14(y, x, rightLogShift, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      // use matrix implementation\n      return rightLogShift(matrix(x), y).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      // use matrix implementation\n      return rightLogShift(x, matrix(y)).valueOf();\n    }\n  });\n  rightLogShift.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['rightLogShift'], \"${args[1]}\\\\right)\")\n  };\n  return rightLogShift;\n}\n\nexports.name = 'rightLogShift';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var stirlingS2 = load(require('./stirlingS2'));\n  var isNegative = load(require('../utils/isNegative'));\n  var isInteger = load(require('../utils/isInteger'));\n  /**\n   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.\n   * bellNumbers only takes integer arguments.\n   * The following condition must be enforced: n >= 0\n   *\n   * Syntax:\n   *\n   *   math.bellNumbers(n)\n   *\n   * Examples:\n   *\n   *    math.bellNumbers(3) // returns 5\n   *    math.bellNumbers(8) // returns 4140\n   *\n   * See also:\n   *\n   *    stirlingS2\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @return {Number | BigNumber}     B(n)\n   */\n\n  var bellNumbers = typed('bellNumbers', {\n    'number | BigNumber': function numberBigNumber(n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function bellNumbers');\n      } // Sum (k=0, n) S(n,k).\n\n\n      var result = 0;\n\n      for (var i = 0; i <= n; i++) {\n        result = add(result, stirlingS2(n, i));\n      }\n\n      return result;\n    }\n  });\n  bellNumbers.toTex = {\n    1: \"\\\\mathrm{B}_{${args[0]}}\"\n  };\n  return bellNumbers;\n}\n\nexports.name = 'bellNumbers';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var divide = load(require('../arithmetic/divide'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var combinations = load(require('../probability/combinations'));\n  var isNegative = load(require('../utils/isNegative'));\n  var isInteger = load(require('../utils/isInteger'));\n  /**\n   * The Catalan Numbers enumerate combinatorial structures of many different types.\n   * catalan only takes integer arguments.\n   * The following condition must be enforced: n >= 0\n   *\n   * Syntax:\n   *\n   *   math.catalan(n)\n   *\n   * Examples:\n   *\n   *    math.catalan(3) // returns 5\n   *    math.catalan(8) // returns 1430\n   *\n   * See also:\n   *\n   *    bellNumbers\n   *\n   * @param {Number | BigNumber} n    nth Catalan number\n   * @return {Number | BigNumber}     Cn(n)\n   */\n\n  var catalan = typed('catalan', {\n    'number | BigNumber': function numberBigNumber(n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function catalan');\n      }\n\n      return divide(combinations(multiply(n, 2), n), add(n, 1));\n    }\n  });\n  catalan.toTex = {\n    1: \"\\\\mathrm{C}_{${args[0]}}\"\n  };\n  return catalan;\n}\n\nexports.name = 'catalan';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var combinations = load(require('../probability/combinations'));\n  var add = load(require('../arithmetic/addScalar'));\n  var isPositive = load(require('../utils/isPositive'));\n  var isInteger = load(require('../utils/isInteger'));\n  var larger = load(require('../relational/larger'));\n  /**\n   * The composition counts of n into k parts.\n   *\n   * composition only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *   math.composition(n, k)\n   *\n   * Examples:\n   *\n   *    math.composition(5, 3) // returns 6\n   *\n   * See also:\n   *\n   *    combinations\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @param {Number | BigNumber} k    Number of objects in the subset\n   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.\n   */\n\n  var composition = typed('composition', {\n    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {\n      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {\n        throw new TypeError('Positive integer value expected in function composition');\n      } else if (larger(k, n)) {\n        throw new TypeError('k must be less than or equal to n in function composition');\n      }\n\n      return combinations(add(n, -1), add(k, -1));\n    }\n  });\n  composition.toTex = undefined; // use default template\n\n  return composition;\n}\n\nexports.name = 'composition';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./bellNumbers'), require('./composition'), require('./stirlingS2'), require('./catalan')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var divide = load(require('../arithmetic/divide'));\n  var pow = load(require('../arithmetic/pow'));\n  var factorial = load(require('../probability/factorial'));\n  var combinations = load(require('../probability/combinations'));\n  var isNegative = load(require('../utils/isNegative'));\n  var isInteger = load(require('../utils/isInteger'));\n  var larger = load(require('../relational/larger'));\n  /**\n   * The Stirling numbers of the second kind, counts the number of ways to partition\n   * a set of n labelled objects into k nonempty unlabelled subsets.\n   * stirlingS2 only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   *  If n = k or k = 1, then s(n,k) = 1\n   *\n   * Syntax:\n   *\n   *   math.stirlingS2(n, k)\n   *\n   * Examples:\n   *\n   *    math.stirlingS2(5, 3) //returns 25\n   *\n   * See also:\n   *\n   *    bellNumbers\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @param {Number | BigNumber} k    Number of objects in the subset\n   * @return {Number | BigNumber}     S(n,k)\n   */\n\n  var stirlingS2 = typed('stirlingS2', {\n    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(n, k) {\n      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {\n        throw new TypeError('Non-negative integer value expected in function stirlingS2');\n      } else if (larger(k, n)) {\n        throw new TypeError('k must be less than or equal to n in function stirlingS2');\n      } // 1/k! Sum(i=0 -> k) [(-1)^(k-i)*C(k,j)* i^n]\n\n\n      var kFactorial = factorial(k);\n      var result = 0;\n\n      for (var i = 0; i <= k; i++) {\n        var negativeOne = pow(-1, subtract(k, i));\n        var kChooseI = combinations(k, i);\n        var iPower = pow(i, n);\n        result = add(result, multiply(multiply(kChooseI, iPower), negativeOne));\n      }\n\n      return divide(result, kFactorial);\n    }\n  });\n  stirlingS2.toTex = {\n    2: \"\\\\mathrm{S}\\\\left(${args}\\\\right)\"\n  };\n  return stirlingS2;\n}\n\nexports.name = 'stirlingS2';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the argument of a complex value.\n   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.arg(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 2)\n   *    math.arg(a) / math.pi          // returns number 0.25\n   *\n   *    const b = math.complex('2 + 3i')\n   *    math.arg(b)                    // returns number 0.982793723247329\n   *    math.atan2(3, 2)               // returns number 0.982793723247329\n   *\n   * See also:\n   *\n   *    re, im, conj, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The argument of x\n   */\n  var arg = typed('arg', {\n    'number': function number(x) {\n      return Math.atan2(0, x);\n    },\n    'BigNumber': function BigNumber(x) {\n      return type.BigNumber.atan2(0, x);\n    },\n    'Complex': function Complex(x) {\n      return x.arg();\n    },\n    // TODO: implement BigNumber support for function arg\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, arg);\n    }\n  });\n  arg.toTex = {\n    1: \"\\\\arg\\\\left(${args[0]}\\\\right)\"\n  };\n  return arg;\n}\n\nexports.name = 'arg';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the complex conjugate of a complex value.\n   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.conj(x)\n   *\n   * Examples:\n   *\n   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i\n   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i\n   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i\n   *\n   * See also:\n   *\n   *    re, im, arg, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            The complex conjugate of x\n   */\n  var conj = typed('conj', {\n    'number': function number(x) {\n      return x;\n    },\n    'BigNumber': function BigNumber(x) {\n      return x;\n    },\n    'Complex': function Complex(x) {\n      return x.conjugate();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, conj);\n    }\n  });\n  conj.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)^*\"\n  };\n  return conj;\n}\n\nexports.name = 'conj';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Get the imaginary part of a complex number.\n   * For a complex number `a + bi`, the function returns `b`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.im(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number -5.2\n   *    math.re(math.complex(2.4))     // returns number 0\n   *\n   * See also:\n   *\n   *    re, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The imaginary part of x\n   */\n  var im = typed('im', {\n    'number': function number(x) {\n      return 0;\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(0);\n    },\n    'Complex': function Complex(x) {\n      return x.im;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, im);\n    }\n  });\n  im.toTex = {\n    1: \"\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace\"\n  };\n  return im;\n}\n\nexports.name = 'im';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./arg'), require('./conj'), require('./im'), require('./re')];","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Get the real part of a complex number.\n   * For a complex number `a + bi`, the function returns `a`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.re(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number 0\n   *    math.re(math.complex(2.4))     // returns number 2.4\n   *\n   * See also:\n   *\n   *    im, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The real part of x\n   */\n  var re = typed('re', {\n    'number': function number(x) {\n      return x;\n    },\n    'BigNumber': function BigNumber(x) {\n      return x;\n    },\n    'Complex': function Complex(x) {\n      return x.re;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, re);\n    }\n  });\n  re.toTex = {\n    1: \"\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace\"\n  };\n  return re;\n}\n\nexports.name = 're';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/addScalar'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var multiply = load(require('../arithmetic/multiplyScalar'));\n  var divide = load(require('../arithmetic/divideScalar'));\n  var negate = load(require('../arithmetic/unaryMinus'));\n  var sqrt = load(require('../arithmetic/sqrt'));\n  var abs = load(require('../arithmetic/abs'));\n  /**\n    * Calculates:\n    *    The eucledian distance between two points in 2 and 3 dimensional spaces.\n    *    Distance between point and a line in 2 and 3 dimensional spaces.\n    *    Pairwise distance between a set of 2D or 3D points\n    * NOTE:\n    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c\n    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)\n    *\n    * Syntax:\n    *    math.distance([x1, y1], [x2, y2])\n    *-   math.distance({pointOneX: 4, pointOneY: 5}, {pointTwoX: 2, pointTwoY: 7})\n    *    math.distance([x1, y1, z1], [x2, y2, z2])\n    *    math.distance({pointOneX: 4, pointOneY: 5, pointOneZ: 8}, {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})\n    *    math.distance([[A], [B], [C]...])\n    *    math.distance([x1, y1], [LinePtX1, LinePtY1], [LinePtX2, LinePtY2])\n    *    math.distance({pointX: 1, pointY: 4}, {lineOnePtX: 6, lineOnePtY: 3}, {lineTwoPtX: 2, lineTwoPtY: 8})\n    *    math.distance([x1, y1, z1], [LinePtX1, LinePtY1, LinePtZ1], [LinePtX2, LinePtY2, LinePtZ2])\n    *    math.distance({pointX: 1, pointY: 4, pointZ: 7}, {lineOnePtX: 6, lineOnePtY: 3, lineOnePtZ: 4}, {lineTwoPtX: 2, lineTwoPtY: 8, lineTwoPtZ: 5})\n    *    math.distance([x1, y1], [xCoeffLine, yCoeffLine, constant])\n    *    math.distance({pointX: 10, pointY: 10}, {xCoeffLine: 8, yCoeffLine: 1, constant: 3})\n    *    math.distance([x1, y1, z1], [x0, y0, z0, a-tCoeff, b-tCoeff, c-tCoeff]) point and parametric equation of 3D line\n    *    math.distance([x, y, z], [x0, y0, z0, a, b, c])\n    *    math.distance({pointX: 2, pointY: 5, pointZ: 9}, {x0: 4, y0: 6, z0: 3, a: 4, b: 2, c: 0})\n    *\n    * Examples:\n    *    math.distance([0,0], [4,4])                     // Returns 5.6569\n    *    math.distance(\n    *     {pointOneX: 0, pointOneY: 0},\n    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951\n    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.74166\n    *    math.distance(\n    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},\n    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3\n    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]\n    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]\n    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387\n    *    math.distance([10, 10], [2, 3], [-8, 0])        // Returns 8.759953130362847\n    *    math.distance(\n    *     {pointX: 1, pointY: 4},\n    *     {lineOnePtX: 6, lineOnePtY: 3},\n    *     {lineTwoPtX: 2, lineTwoPtY: 8})                // Returns 2.720549372624744\n    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857\n    *    math.distance(\n    *     {pointX: 2, pointY: 3, pointZ: 1},\n    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1}        // Returns 2.3204774044612857\n    *\n    * @param {Array | Matrix | Object} x    Co-ordinates of first point\n    * @param {Array | Matrix | Object} y    Co-ordinates of second point\n    * @return {Number | BigNumber} Returns the distance from two/three points\n  */\n\n  var distance = typed('distance', {\n    'Array, Array, Array': function ArrayArrayArray(x, y, z) {\n      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)\n      if (x.length === 2 && y.length === 2 && z.length === 2) {\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n\n        var m = divide(subtract(z[1], z[0]), subtract(y[1], y[0]));\n        var xCoeff = multiply(multiply(m, m), y[0]);\n        var yCoeff = negate(multiply(m, y[0]));\n        var constant = x[1];\n        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant);\n      } else {\n        throw new TypeError('Invalid Arguments: Try again');\n      }\n    },\n    'Object, Object, Object': function ObjectObjectObject(x, y, z) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');\n        }\n\n        if (x.hasOwnProperty('pointX') && x.hasOwnProperty('pointY') && y.hasOwnProperty('lineOnePtX') && y.hasOwnProperty('lineOnePtY') && z.hasOwnProperty('lineTwoPtX') && z.hasOwnProperty('lineTwoPtY')) {\n          var m = divide(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));\n          var xCoeff = multiply(multiply(m, m), y.lineOnePtX);\n          var yCoeff = negate(multiply(m, y.lineOnePtX));\n          var constant = x.pointX;\n          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant);\n        } else {\n          throw new TypeError('Key names do not match');\n        }\n      } else {\n        throw new TypeError('Invalid Arguments: Try again');\n      }\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])\n      if (x.length === 2 && y.length === 3) {\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n        }\n\n        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2]);\n      } else if (x.length === 3 && y.length === 6) {\n        // Point to Line 3D\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_parametricLine(y)) {\n          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');\n        }\n\n        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5]);\n      } else if (x.length === 2 && y.length === 2) {\n        // Point to Point 2D\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        return _distance2d(x[0], x[1], y[0], y[1]);\n      } else if (x.length === 3 && y.length === 3) {\n        // Point to Point 3D\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n        }\n\n        return _distance3d(x[0], x[1], x[2], y[0], y[1], y[2]);\n      } else {\n        throw new TypeError('Invalid Arguments: Try again');\n      }\n    },\n    'Object, Object': function ObjectObject(x, y) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');\n        }\n\n        if (x.hasOwnProperty('pointX') && x.hasOwnProperty('pointY') && y.hasOwnProperty('xCoeffLine') && y.hasOwnProperty('yCoeffLine') && y.hasOwnProperty('constant')) {\n          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant);\n        } else {\n          throw new TypeError('Key names do not match');\n        }\n      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {\n        // Point to Line 3D\n        if (!_3d(x)) {\n          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers');\n        }\n\n        if (!_parametricLine(y)) {\n          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');\n        }\n\n        if (x.hasOwnProperty('pointX') && x.hasOwnProperty('pointY') && y.hasOwnProperty('x0') && y.hasOwnProperty('y0') && y.hasOwnProperty('z0') && y.hasOwnProperty('a') && y.hasOwnProperty('b') && y.hasOwnProperty('c')) {\n          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c);\n        } else {\n          throw new TypeError('Key names do not match');\n        }\n      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {\n        // Point to Point 2D\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');\n        }\n\n        if (x.hasOwnProperty('pointOneX') && x.hasOwnProperty('pointOneY') && y.hasOwnProperty('pointTwoX') && y.hasOwnProperty('pointTwoY')) {\n          return _distance2d(x.pointOneX, x.pointOneY, y.pointTwoX, y.pointTwoY);\n        } else {\n          throw new TypeError('Key names do not match');\n        }\n      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {\n        // Point to Point 3D\n        if (!_3d(x)) {\n          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');\n        }\n\n        if (x.hasOwnProperty('pointOneX') && x.hasOwnProperty('pointOneY') && x.hasOwnProperty('pointOneZ') && y.hasOwnProperty('pointTwoX') && y.hasOwnProperty('pointTwoY') && y.hasOwnProperty('pointTwoZ')) {\n          return _distance3d(x.pointOneX, x.pointOneY, x.pointOneZ, y.pointTwoX, y.pointTwoY, y.pointTwoZ);\n        } else {\n          throw new TypeError('Key names do not match');\n        }\n      } else {\n        throw new TypeError('Invalid Arguments: Try again');\n      }\n    },\n    'Array': function Array(arr) {\n      if (!_pairwise(arr)) {\n        throw new TypeError('Incorrect array format entered for pairwise distance calculation');\n      }\n\n      return _distancePairwise(arr);\n    }\n  });\n\n  function _isNumber(a) {\n    // distance supports numbers and bignumbers\n    return typeof a === 'number' || type.isBigNumber(a);\n  }\n\n  function _2d(a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (a.constructor !== Array) {\n      a = _objectToArray(a);\n    }\n\n    return _isNumber(a[0]) && _isNumber(a[1]);\n  }\n\n  function _3d(a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (a.constructor !== Array) {\n      a = _objectToArray(a);\n    }\n\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);\n  }\n\n  function _parametricLine(a) {\n    if (a.constructor !== Array) {\n      a = _objectToArray(a);\n    }\n\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);\n  }\n\n  function _objectToArray(o) {\n    var keys = Object.keys(o);\n    var a = [];\n\n    for (var i = 0; i < keys.length; i++) {\n      a.push(o[keys[i]]);\n    }\n\n    return a;\n  }\n\n  function _pairwise(a) {\n    // checks for valid arguments passed to _distancePairwise(Array)\n    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {\n      for (var i in a) {\n        if (a[i].length !== 2 || !_isNumber(a[i][0]) || !_isNumber(a[i][1])) {\n          return false;\n        }\n      }\n    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {\n      for (var _i in a) {\n        if (a[_i].length !== 3 || !_isNumber(a[_i][0]) || !_isNumber(a[_i][1]) || !_isNumber(a[_i][2])) {\n          return false;\n        }\n      }\n    } else {\n      return false;\n    }\n\n    return true;\n  }\n\n  function _distancePointLine2D(x, y, a, b, c) {\n    var num = abs(add(add(multiply(a, x), multiply(b, y)), c));\n    var den = sqrt(add(multiply(a, a), multiply(b, b)));\n    var result = divide(num, den);\n    return result;\n  }\n\n  function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {\n    var num = [subtract(multiply(subtract(y0, y), c), multiply(subtract(z0, z), b)), subtract(multiply(subtract(z0, z), a), multiply(subtract(x0, x), c)), subtract(multiply(subtract(x0, x), b), multiply(subtract(y0, y), a))];\n    num = sqrt(add(add(multiply(num[0], num[0]), multiply(num[1], num[1])), multiply(num[2], num[2])));\n    var den = sqrt(add(add(multiply(a, a), multiply(b, b)), multiply(c, c)));\n    var result = divide(num, den);\n    return result;\n  }\n\n  function _distance2d(x1, y1, x2, y2) {\n    var yDiff = subtract(y2, y1);\n    var xDiff = subtract(x2, x1);\n    var radicant = add(multiply(yDiff, yDiff), multiply(xDiff, xDiff));\n    var result = sqrt(radicant);\n    return result;\n  }\n\n  function _distance3d(x1, y1, z1, x2, y2, z2) {\n    var zDiff = subtract(z2, z1);\n    var yDiff = subtract(y2, y1);\n    var xDiff = subtract(x2, x1);\n    var radicant = add(add(multiply(zDiff, zDiff), multiply(yDiff, yDiff)), multiply(xDiff, xDiff));\n    var result = sqrt(radicant);\n    return result;\n  }\n\n  function _distancePairwise(a) {\n    var result = [];\n\n    for (var i = 0; i < a.length - 1; i++) {\n      for (var j = i + 1; j < a.length; j++) {\n        if (a[0].length === 2) {\n          result.push(_distance2d(a[i][0], a[i][1], a[j][0], a[j][1]));\n        } else if (a[0].length === 3) {\n          result.push(_distance3d(a[i][0], a[i][1], a[i][2], a[j][0], a[j][1], a[j][2]));\n        }\n      }\n    }\n\n    return result;\n  }\n\n  return distance;\n}\n\nexports.name = 'distance';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./intersect'), require('./distance')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var abs = load(require('../arithmetic/abs'));\n  var add = load(require('../arithmetic/add'));\n  var addScalar = load(require('../arithmetic/addScalar'));\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var multiplyScalar = load(require('../arithmetic/multiplyScalar'));\n  var divideScalar = load(require('../arithmetic/divideScalar'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var smaller = load(require('../relational/smaller'));\n  var equalScalar = load(require('../relational/equalScalar'));\n  /**\n   * Calculates the point of intersection of two lines in two or three dimensions\n   * and of a line and a plane in three dimensions. The inputs are in the form of\n   * arrays or 1 dimensional matrices. The line intersection functions return null\n   * if the lines do not meet.\n   *\n   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.\n   *\n   * Syntax:\n   *\n   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)\n   *    math.intersect(endPoint1, endPoint2, planeCoefficients)\n   *\n   * Examples:\n   *\n   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]\n   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]\n   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]\n   *\n   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line\n   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line\n   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line\n   *                              OR Co-efficients of the plane's equation\n   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line\n   *                              OR null if the calculation is for line and plane\n   * @return {Array}              Returns the point of intersection of lines/lines-planes\n   */\n\n  var intersect = typed('intersect', {\n    'Array, Array, Array': function ArrayArrayArray(x, y, plane) {\n      if (!_3d(x)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n      }\n\n      if (!_3d(y)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n      }\n\n      if (!_4d(plane)) {\n        throw new TypeError('Array with 4 numbers expected as third argument');\n      }\n\n      return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3]);\n    },\n    'Array, Array, Array, Array': function ArrayArrayArrayArray(w, x, y, z) {\n      if (w.length === 2) {\n        if (!_2d(w)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');\n        }\n\n        return _intersect2d(w, x, y, z);\n      } else if (w.length === 3) {\n        if (!_3d(w)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n        }\n\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n        }\n\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');\n        }\n\n        if (!_3d(z)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');\n        }\n\n        return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2]);\n      } else {\n        throw new TypeError('Arrays with two or thee dimensional points expected');\n      }\n    },\n    'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {\n      return matrix(intersect(x.valueOf(), y.valueOf(), plane.valueOf()));\n    },\n    'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {\n      // TODO: output matrix type should match input matrix type\n      return matrix(intersect(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf()));\n    }\n  });\n\n  function _isNumber(a) {\n    // intersect supports numbers and bignumbers\n    return typeof a === 'number' || type.isBigNumber(a);\n  }\n\n  function _2d(x) {\n    return x.length === 2 && _isNumber(x[0]) && _isNumber(x[1]);\n  }\n\n  function _3d(x) {\n    return x.length === 3 && _isNumber(x[0]) && _isNumber(x[1]) && _isNumber(x[2]);\n  }\n\n  function _4d(x) {\n    return x.length === 4 && _isNumber(x[0]) && _isNumber(x[1]) && _isNumber(x[2]) && _isNumber(x[3]);\n  }\n\n  function _intersect2d(p1a, p1b, p2a, p2b) {\n    var o1 = p1a;\n    var o2 = p2a;\n    var d1 = subtract(o1, p1b);\n    var d2 = subtract(o2, p2b);\n    var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));\n\n    if (smaller(abs(det), config.epsilon)) {\n      return null;\n    }\n\n    var d20o11 = multiplyScalar(d2[0], o1[1]);\n    var d21o10 = multiplyScalar(d2[1], o1[0]);\n    var d20o21 = multiplyScalar(d2[0], o2[1]);\n    var d21o20 = multiplyScalar(d2[1], o2[0]);\n    var t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det);\n    return add(multiply(d1, t), o1);\n  }\n\n  function _intersect3dHelper(a, b, c, d, e, f, g, h, i, j, k, l) {\n    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)\n    var add1 = multiplyScalar(subtract(a, b), subtract(c, d));\n    var add2 = multiplyScalar(subtract(e, f), subtract(g, h));\n    var add3 = multiplyScalar(subtract(i, j), subtract(k, l));\n    return addScalar(addScalar(add1, add2), add3);\n  }\n\n  function _intersect3d(x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {\n    var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);\n\n    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);\n\n    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);\n\n    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);\n\n    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);\n\n    var ta = divideScalar(subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343)), subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321)));\n    var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);\n    var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));\n    var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));\n    var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));\n    var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));\n    var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));\n    var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));\n\n    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {\n      return [pax, pay, paz];\n    } else {\n      return null;\n    }\n  }\n\n  function _intersectLinePlane(x1, y1, z1, x2, y2, z2, x, y, z, c) {\n    var x1x = multiplyScalar(x1, x);\n    var x2x = multiplyScalar(x2, x);\n    var y1y = multiplyScalar(y1, y);\n    var y2y = multiplyScalar(y2, y);\n    var z1z = multiplyScalar(z1, z);\n    var z2z = multiplyScalar(z2, z);\n    var t = divideScalar(subtract(subtract(subtract(c, x1x), y1y), z1z), subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z));\n    var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));\n    var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));\n    var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));\n    return [px, py, pz]; // TODO: Add cases when line is parallel to the plane:\n    //       (a) no intersection,\n    //       (b) line contained in plane\n  }\n\n  return intersect;\n}\n\nexports.name = 'intersect';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./algebra'), require('./arithmetic'), require('./bitwise'), require('./combinatorics'), require('./complex'), require('./geometry'), require('./logical'), require('./matrix'), require('./probability'), require('./relational'), require('./set'), require('./special'), require('./statistics'), require('./string'), require('./trigonometry'), require('./unit'), require('./utils')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var zeros = load(require('../matrix/zeros'));\n  var not = load(require('./not'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm06 = load(require('../../type/matrix/utils/algorithm06'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.and(x, y)\n   *\n   * Examples:\n   *\n   *    math.and(2, 4)   // returns true\n   *\n   *    a = [2, 0, 0]\n   *    b = [3, 7, 0]\n   *    c = 0\n   *\n   *    math.and(a, b)   // returns [true, false, false]\n   *    math.and(a, c)   // returns [false, false, false]\n   *\n   * See also:\n   *\n   *    not, or, xor\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when both inputs are defined with a nonzero/nonempty value.\n   */\n\n  var and = typed('and', {\n    'number, number': function numberNumber(x, y) {\n      return !!(x && y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return and(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm06(x, y, and, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm02(y, x, and, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm02(x, y, and, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, and);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return and(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return and(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return and(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm11(x, y, and, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      // check scalar\n      if (not(y)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm14(x, y, and, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm11(y, x, and, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      // check scalar\n      if (not(x)) {\n        // return zero matrix\n        return zeros(x.size(), x.storage());\n      }\n\n      return algorithm14(y, x, and, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return and(matrix(x), y).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return and(x, matrix(y)).valueOf();\n    }\n  });\n  and.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['and'], \"${args[1]}\\\\right)\")\n  };\n  return and;\n}\n\nexports.name = 'and';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./and'), require('./not'), require('./or'), require('./xor')];","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n  /**\n   * Logical `not`. Flips boolean value of a given parameter.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.not(x)\n   *\n   * Examples:\n   *\n   *    math.not(2)      // returns false\n   *    math.not(0)      // returns true\n   *    math.not(true)   // returns false\n   *\n   *    a = [2, -7, 0]\n   *    math.not(a)      // returns [false, false, true]\n   *\n   * See also:\n   *\n   *    and, or, xor\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when input is a zero or empty value.\n   */\n\n\n  var not = typed('not', {\n    'number': function number(x) {\n      return !x;\n    },\n    'Complex': function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.isZero() || x.isNaN();\n    },\n    'Unit': function Unit(x) {\n      return x.value !== null ? not(x.value) : true;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, not);\n    }\n  });\n  not.toTex = {\n    1: latex.operators['not'] + \"\\\\left(${args[0]}\\\\right)\"\n  };\n  return not;\n}\n\nexports.name = 'not';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm05 = load(require('../../type/matrix/utils/algorithm05'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.or(x, y)\n   *\n   * Examples:\n   *\n   *    math.or(2, 4)   // returns true\n   *\n   *    a = [2, 5, 0]\n   *    b = [0, 22, 0]\n   *    c = 0\n   *\n   *    math.or(a, b)   // returns [true, true, false]\n   *    math.or(b, c)   // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    and, not, xor\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.\n   */\n\n  var or = typed('or', {\n    'number, number': function numberNumber(x, y) {\n      return !!(x || y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return or(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, or);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, or, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, or, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, or);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return or(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return or(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return or(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, or, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, or, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, or, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, or, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, or, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, or, true).valueOf();\n    }\n  });\n  or.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['or'], \"${args[1]}\\\\right)\")\n  };\n  return or;\n}\n\nexports.name = 'or';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.xor(x, y)\n   *\n   * Examples:\n   *\n   *    math.xor(2, 4)   // returns false\n   *\n   *    a = [2, 0, 0]\n   *    b = [2, 7, 0]\n   *    c = 0\n   *\n   *    math.xor(a, b)   // returns [false, true, false]\n   *    math.xor(a, c)   // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    and, not, or\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when one and only one input is defined with a nonzero/nonempty value.\n   */\n\n  var xor = typed('xor', {\n    'number, number': function numberNumber(x, y) {\n      return !!x !== !!y;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      return xor(x.value || 0, y.value || 0);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, xor);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, xor, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, xor, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, xor);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return xor(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return xor(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return xor(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, xor, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, xor, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, xor, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, xor, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, xor, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, xor, true).valueOf();\n    }\n  });\n  xor.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['xor'], \"${args[1]}\\\\right)\")\n  };\n  return xor;\n}\n\nexports.name = 'xor';\nexports.factory = factory;","'use strict';\n\nvar arraySize = require('../../utils/array').size;\n\nvar isMatrix = require('../../utils/collection/isMatrix');\n\nvar IndexError = require('../../error/IndexError');\n\nfunction factory(type, config, load, typed) {\n  var isInteger = load(require('../utils/isInteger'));\n  /**\n   * Apply a function that maps an array to a scalar\n   * along a given axis of a matrix or array.\n   * Returns a new matrix or array with one less dimension than the input.\n   *\n   * Syntax:\n   *\n   *     math.apply(A, dim, callback)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [3, 4]]\n   *    const sum = math.sum\n   *\n   *    math.apply(A, 0, sum)             // returns [4, 6]\n   *    math.apply(A, 1, sum)             // returns [3, 7]\n   *\n   * See also:\n   *\n   *    map, filter, forEach\n   *\n   * @param {Array | Matrix} array   The input Matrix\n   * @param {number} dim             The dimension along which the callback is applied\n   * @param {Function} callback      The callback function that is applied. This Function\n   *                                 should take an array or 1-d matrix as an input and\n   *                                 return a number.\n   * @return {Array | Matrix} res    The residual matrix with the function applied over some dimension.\n   */\n\n  var apply = typed('apply', {\n    'Array | Matrix, number | BigNumber, function': function ArrayMatrixNumberBigNumberFunction(mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension');\n      }\n\n      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\n      if (dim < 0 || dim >= size.length) {\n        throw new IndexError(dim, size.length);\n      }\n\n      if (isMatrix(mat)) {\n        return mat.create(_apply(mat.valueOf(), dim, callback));\n      } else {\n        return _apply(mat, dim, callback);\n      }\n    }\n  });\n  apply.toTex = undefined; // use default template\n\n  return apply;\n}\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _apply(mat, dim, callback) {\n  var i, ret, tran;\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      return callback(mat);\n    } else {\n      tran = _switch(mat);\n      ret = [];\n\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _apply(tran[i], dim - 1, callback);\n      }\n\n      return ret;\n    }\n  } else {\n    ret = [];\n\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _apply(mat[i], dim - 1, callback);\n    }\n\n    return ret;\n  }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n\n    ret.push(tmp);\n  }\n\n  return ret;\n}\n\nexports.name = 'apply';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../utils/object').clone;\n\nvar array = require('../../utils/array');\n\nvar IndexError = require('../../error/IndexError');\n\nvar DimensionError = require('../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var isInteger = load(require('../utils/isInteger'));\n  /**\n   * Concatenate two or more matrices.\n   *\n   * Syntax:\n   *\n   *     math.concat(A, B, C, ...)\n   *     math.concat(A, B, C, ..., dim)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *   By default the last dimension of the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [5, 6]]\n   *    const B = [[3, 4], [7, 8]]\n   *\n   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]\n   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]\n   *    math.concat('hello', ' ', 'world') // returns 'hello world'\n   *\n   * See also:\n   *\n   *    size, squeeze, subset, transpose\n   *\n   * @param {... Array | Matrix} args     Two or more matrices\n   * @return {Array | Matrix} Concatenated matrix\n   */\n\n  var concat = typed('concat', {\n    // TODO: change signature to '...Array | Matrix, dim?' when supported\n    '...Array | Matrix | number | BigNumber': function ArrayMatrixNumberBigNumber(args) {\n      var i;\n      var len = args.length;\n      var dim = -1; // zero-based dimension\n\n      var prevDim;\n      var asMatrix = false;\n      var matrices = []; // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        var arg = args[i]; // test whether we need to return a Matrix (if not we return an Array)\n\n        if (type.isMatrix(arg)) {\n          asMatrix = true;\n        }\n\n        if (type.isNumber(arg) || type.isBigNumber(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument');\n          } // last argument contains the dimension on which to concatenate\n\n\n          prevDim = dim;\n          dim = arg.valueOf(); // change BigNumber to number\n\n          if (!isInteger(dim)) {\n            throw new TypeError('Integer number expected for dimension');\n          }\n\n          if (dim < 0 || i > 0 && dim > prevDim) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new IndexError(dim, prevDim + 1);\n          }\n        } else {\n          // this is a matrix or array\n          var m = clone(arg).valueOf();\n          var size = array.size(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1; // verify whether each of the matrices has the same number of dimensions\n\n          if (i > 0 && dim !== prevDim) {\n            throw new DimensionError(prevDim + 1, dim + 1);\n          }\n        }\n      }\n\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected');\n      }\n\n      var res = matrices.shift();\n\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim, 0);\n      }\n\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\n    }\n  });\n  concat.toTex = undefined; // use default template\n\n  return concat;\n}\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices is not cloned.\n * @param {Array} a             Multi dimensional array\n * @param {Array} b             Multi dimensional array\n * @param {number} concatDim    The dimension on which to concatenate (zero-based)\n * @param {number} dim          The current dim (zero-based)\n * @return {Array} c            The concatenated matrix\n * @private\n */\n\n\nfunction _concat(a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length);\n    }\n\n    var c = [];\n\n    for (var i = 0; i < a.length; i++) {\n      c[i] = _concat(a[i], b[i], concatDim, dim + 1);\n    }\n\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}\n\nexports.name = 'concat';\nexports.factory = factory;","'use strict';\n\nvar array = require('../../utils/array');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var multiply = load(require('../arithmetic/multiply'));\n  /**\n   * Calculate the cross product for two vectors in three dimensional space.\n   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined\n   * as:\n   *\n   *    cross(A, B) = [\n   *      a2 * b3 - a3 * b2,\n   *      a3 * b1 - a1 * b3,\n   *      a1 * b2 - a2 * b1\n   *    ]\n   *\n   * If one of the input vectors has a dimension greater than 1, the output\n   * vector will be a 1x3 (2-dimensional) matrix.\n   *\n   * Syntax:\n   *\n   *    math.cross(x, y)\n   *\n   * Examples:\n   *\n   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]\n   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]\n   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]\n   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]\n   *\n   * See also:\n   *\n   *    dot, multiply\n   *\n   * @param  {Array | Matrix} x   First vector\n   * @param  {Array | Matrix} y   Second vector\n   * @return {Array | Matrix}     Returns the cross product of `x` and `y`\n   */\n\n  var cross = typed('cross', {\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      return matrix(_cross(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return matrix(_cross(x.toArray(), y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return matrix(_cross(x, y.toArray()));\n    },\n    'Array, Array': _cross\n  });\n  cross.toTex = {\n    2: \"\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)\"\n  };\n  return cross;\n  /**\n   * Calculate the cross product for two arrays\n   * @param {Array} x  First vector\n   * @param {Array} y  Second vector\n   * @returns {Array} Returns the cross product of x and y\n   * @private\n   */\n\n  function _cross(x, y) {\n    var highestDimension = Math.max(array.size(x).length, array.size(y).length);\n    x = array.squeeze(x);\n    y = array.squeeze(y);\n    var xSize = array.size(x);\n    var ySize = array.size(y);\n\n    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {\n      throw new RangeError('Vectors with length 3 expected ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');\n    }\n\n    var product = [subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))];\n\n    if (highestDimension > 1) {\n      return [product];\n    } else {\n      return product;\n    }\n  }\n}\n\nexports.name = 'cross';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var transpose = load(require('./transpose'));\n  var conj = load(require('../complex/conj'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Transpose and complex conjugate a matrix. All values of the matrix are\n   * reflected over its main diagonal and then the complex conjugate is\n   * taken. This is equivalent to complex conjugation for scalars and\n   * vectors.\n   *\n   * Syntax:\n   *\n   *     math.ctranspose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]\n   *     math.ctranspose(A)               // returns [[1, 4], [2, 5], [3, {re:6,im:7}]]\n   *\n   * See also:\n   *\n   *     transpose, diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be ctransposed\n   * @return {Array | Matrix}   The ctransposed matrix\n   */\n\n\n  var ctranspose = typed('ctranspose', {\n    'any': function any(x) {\n      return conj(transpose(x));\n    }\n  });\n  ctranspose.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latex.operators['ctranspose'])\n  };\n  return ctranspose;\n}\n\nexports.name = 'ctranspose';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../utils/index');\n\nvar object = util.object;\nvar string = util.string;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var unaryMinus = load(require('../arithmetic/unaryMinus'));\n  var lup = load(require('../algebra/decomposition/lup'));\n  /**\n   * Calculate the determinant of a matrix.\n   *\n   * Syntax:\n   *\n   *    math.det(x)\n   *\n   * Examples:\n   *\n   *    math.det([[1, 2], [3, 4]]) // returns -2\n   *\n   *    const A = [\n   *      [-2, 2, 3],\n   *      [-1, 1, 3],\n   *      [2, 0, -1]\n   *    ]\n   *    math.det(A) // returns 6\n   *\n   * See also:\n   *\n   *    inv\n   *\n   * @param {Array | Matrix} x  A matrix\n   * @return {number} The determinant of `x`\n   */\n\n  var det = typed('det', {\n    'any': function any(x) {\n      return object.clone(x);\n    },\n    'Array | Matrix': function det(x) {\n      var size;\n\n      if (type.isMatrix(x)) {\n        size = x.size();\n      } else if (Array.isArray(x)) {\n        x = matrix(x);\n        size = x.size();\n      } else {\n        // a scalar\n        size = [];\n      }\n\n      switch (size.length) {\n        case 0:\n          // scalar\n          return object.clone(x);\n\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return object.clone(x.valueOf()[0]);\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + string.format(size) + ')');\n          }\n\n        case 2:\n          // two dimensional array\n          var rows = size[0];\n          var cols = size[1];\n\n          if (rows === cols) {\n            return _det(x.clone().valueOf(), rows, cols);\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + string.format(size) + ')');\n          }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + string.format(size) + ')');\n      }\n    }\n  });\n  det.toTex = {\n    1: \"\\\\det\\\\left(${args[0]}\\\\right)\"\n  };\n  return det;\n  /**\n   * Calculate the determinant of a matrix\n   * @param {Array[]} matrix  A square, two dimensional matrix\n   * @param {number} rows     Number of rows of the matrix (zero-based)\n   * @param {number} cols     Number of columns of the matrix (zero-based)\n   * @returns {number} det\n   * @private\n   */\n\n  function _det(matrix, rows, cols) {\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      return object.clone(matrix[0][0]);\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12\n      return subtract(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));\n    } else {\n      // Compute the LU decomposition\n      var decomp = lup(matrix); // The determinant is the product of the diagonal entries of U (and those of L, but they are all 1)\n\n      var _det2 = decomp.U[0][0];\n\n      for (var _i = 1; _i < rows; _i++) {\n        _det2 = multiply(_det2, decomp.U[_i][_i]);\n      } // The determinant will be multiplied by 1 or -1 depending on the parity of the permutation matrix.\n      // This can be determined by counting the cycles. This is roughly a linear time algorithm.\n\n\n      var evenCycles = 0;\n      var i = 0;\n      var visited = [];\n\n      while (true) {\n        while (visited[i]) {\n          i++;\n        }\n\n        if (i >= rows) break;\n        var j = i;\n        var cycleLen = 0;\n\n        while (!visited[decomp.p[j]]) {\n          visited[decomp.p[j]] = true;\n          j = decomp.p[j];\n          cycleLen++;\n        }\n\n        if (cycleLen % 2 === 0) {\n          evenCycles++;\n        }\n      }\n\n      return evenCycles % 2 === 0 ? _det2 : unaryMinus(_det2);\n    }\n  }\n}\n\nexports.name = 'det';\nexports.factory = factory;","'use strict';\n\nvar array = require('../../utils/array');\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Create a diagonal matrix or retrieve the diagonal of a matrix\n   *\n   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.\n   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.\n   * When k is positive, the values are placed on the super diagonal.\n   * When k is negative, the values are placed on the sub diagonal.\n   *\n   * Syntax:\n   *\n   *     math.diag(X)\n   *     math.diag(X, format)\n   *     math.diag(X, k)\n   *     math.diag(X, k, format)\n   *\n   * Examples:\n   *\n   *     // create a diagonal matrix\n   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]\n   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *\n   *    // retrieve the diagonal from a matrix\n   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n   *    math.diag(a)   // returns [1, 5, 9]\n   *\n   * See also:\n   *\n   *     ones, zeros, identity\n   *\n   * @param {Matrix | Array} x          A two dimensional matrix or a vector\n   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled\n   *                                    in or retrieved.\n   * @param {string} [format='dense']   The matrix storage format.\n   *\n   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.\n   */\n\n  var diag = typed('diag', {\n    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments\n    'Array': function Array(x) {\n      return _diag(x, 0, array.size(x), null);\n    },\n    'Array, number': function ArrayNumber(x, k) {\n      return _diag(x, k, array.size(x), null);\n    },\n    'Array, BigNumber': function ArrayBigNumber(x, k) {\n      return _diag(x, k.toNumber(), array.size(x), null);\n    },\n    'Array, string': function ArrayString(x, format) {\n      return _diag(x, 0, array.size(x), format);\n    },\n    'Array, number, string': function ArrayNumberString(x, k, format) {\n      return _diag(x, k, array.size(x), format);\n    },\n    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), array.size(x), format);\n    },\n    'Matrix': function Matrix(x) {\n      return _diag(x, 0, x.size(), x.storage());\n    },\n    'Matrix, number': function MatrixNumber(x, k) {\n      return _diag(x, k, x.size(), x.storage());\n    },\n    'Matrix, BigNumber': function MatrixBigNumber(x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage());\n    },\n    'Matrix, string': function MatrixString(x, format) {\n      return _diag(x, 0, x.size(), format);\n    },\n    'Matrix, number, string': function MatrixNumberString(x, k, format) {\n      return _diag(x, k, x.size(), format);\n    },\n    'Matrix, BigNumber, string': function MatrixBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format);\n    }\n  });\n  diag.toTex = undefined; // use default template\n\n  return diag;\n  /**\n   * Creeate diagonal matrix from a vector or vice versa\n   * @param {Array | Matrix} x\n   * @param {number} k\n   * @param {string} format Storage format for matrix. If null,\n   *                          an Array is returned\n   * @returns {Array | Matrix}\n   * @private\n   */\n\n  function _diag(x, k, size, format) {\n    if (!isInteger(k)) {\n      throw new TypeError('Second parameter in function diag must be an integer');\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // check dimensions\n\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);\n\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper);\n    }\n\n    throw new RangeError('Matrix for function diag must be 2 dimensional');\n  }\n\n  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {\n    // matrix size\n    var ms = [l + kSub, l + kSuper]; // get matrix constructor\n\n    var F = type.Matrix.storage(format || 'dense'); // create diagonal matrix\n\n    var m = F.diagonal(ms, x, k); // check we need to return a matrix\n\n    return format !== null ? m : m.valueOf();\n  }\n\n  function _getDiagonal(x, k, format, s, kSub, kSuper) {\n    // check x is a Matrix\n    if (type.isMatrix(x)) {\n      // get diagonal matrix\n      var dm = x.diagonal(k); // check we need to return a matrix\n\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) {\n          return matrix(dm, format);\n        }\n\n        return dm;\n      }\n\n      return dm.valueOf();\n    } // vector size\n\n\n    var n = Math.min(s[0] - kSub, s[1] - kSuper); // diagonal values\n\n    var vector = []; // loop diagonal\n\n    for (var i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper];\n    } // check we need to return a matrix\n\n\n    return format !== null ? matrix(vector) : vector;\n  }\n}\n\nexports.name = 'diag';\nexports.factory = factory;","'use strict';\n\nvar size = require('../../utils/array').size;\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var multiply = load(require('../arithmetic/multiply'));\n  /**\n   * Calculate the dot product of two vectors. The dot product of\n   * `A = [a1, a2, a3, ..., an]` and `B = [b1, b2, b3, ..., bn]` is defined as:\n   *\n   *    dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn\n   *\n   * Syntax:\n   *\n   *    math.dot(x, y)\n   *\n   * Examples:\n   *\n   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15\n   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15\n   *\n   * See also:\n   *\n   *    multiply, cross\n   *\n   * @param  {Array | Matrix} x     First vector\n   * @param  {Array | Matrix} y     Second vector\n   * @return {number}               Returns the dot product of `x` and `y`\n   */\n\n  var dot = typed('dot', {\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      return _dot(x.toArray(), y.toArray());\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return _dot(x.toArray(), y);\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return _dot(x, y.toArray());\n    },\n    'Array, Array': _dot\n  });\n  dot.toTex = {\n    2: \"\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)\"\n  };\n  return dot;\n  /**\n   * Calculate the dot product for two arrays\n   * @param {Array} x  First vector\n   * @param {Array} y  Second vector\n   * @returns {number} Returns the dot product of x and y\n   * @private\n   */\n  // TODO: double code with math.multiply\n\n  function _dot(x, y) {\n    var xSize = size(x);\n    var ySize = size(y);\n    var len = xSize[0];\n    if (xSize.length !== 1 || ySize.length !== 1) throw new RangeError('Vector expected'); // TODO: better error message\n\n    if (xSize[0] !== ySize[0]) throw new RangeError('Vectors must have equal length (' + xSize[0] + ' != ' + ySize[0] + ')');\n    if (len === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');\n    var prod = 0;\n\n    for (var i = 0; i < len; i++) {\n      prod = add(prod, multiply(x[i], y[i]));\n    }\n\n    return prod;\n  }\n}\n\nexports.name = 'dot';\nexports.factory = factory;","'use strict';\n\nvar format = require('../../utils/string').format;\n\nfunction factory(type, config, load, typed) {\n  var abs = load(require('../arithmetic/abs'));\n  var add = load(require('../arithmetic/add'));\n  var identity = load(require('./identity'));\n  var inv = load(require('./inv'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.\n   * Not to be confused with exp(a), which performs element-wise\n   * exponentiation.\n   *\n   * The exponential is calculated using the Padé approximant with scaling and\n   * squaring; see \"Nineteen Dubious Ways to Compute the Exponential of a\n   * Matrix,\" by Moler and Van Loan.\n   *\n   * Syntax:\n   *\n   *     math.expm(x)\n   *\n   * Examples:\n   *\n   *     const A = [[0,2],[0,0]]\n   *     math.expm(A)        // returns [[1,2],[0,1]]\n   *\n   * See also:\n   *\n   *     exp\n   *\n   * @param {Matrix} x  A square Matrix\n   * @return {Matrix}   The exponential of x\n   */\n\n  var expm = typed('expm', {\n    'Matrix': function Matrix(A) {\n      // Check matrix size\n      var size = A.size();\n\n      if (size.length !== 2 || size[0] !== size[1]) {\n        throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');\n      }\n\n      var n = size[0]; // Desired accuracy of the approximant (The actual accuracy\n      // will be affected by round-off error)\n\n      var eps = 1e-15; // The Padé approximant is not so accurate when the values of A\n      // are \"large\", so scale A by powers of two. Then compute the\n      // exponential, and square the result repeatedly according to\n      // the identity e^A = (e^(A/m))^m\n      // Compute infinity-norm of A, ||A||, to see how \"big\" it is\n\n      var infNorm = infinityNorm(A); // Find the optimal scaling factor and number of terms in the\n      // Padé approximant to reach the desired accuracy\n\n      var params = findParams(infNorm, eps);\n      var q = params.q;\n      var j = params.j; // The Pade approximation to e^A is:\n      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)\n      // where\n      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i\n      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i\n      // Scale A by 1 / 2^j\n\n      var Apos = multiply(A, Math.pow(2, -j)); // The i=0 term is just the identity matrix\n\n      var N = identity(n);\n      var D = identity(n); // Initialization (i=0)\n\n      var factor = 1; // Initialization (i=1)\n\n      var AposToI = Apos; // Cloning not necessary\n\n      var alternate = -1;\n\n      for (var i = 1; i <= q; i++) {\n        if (i > 1) {\n          AposToI = multiply(AposToI, Apos);\n          alternate = -alternate;\n        }\n\n        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);\n        N = add(N, multiply(factor, AposToI));\n        D = add(D, multiply(factor * alternate, AposToI));\n      }\n\n      var R = multiply(inv(D), N); // Square j times\n\n      for (var _i = 0; _i < j; _i++) {\n        R = multiply(R, R);\n      }\n\n      return type.isSparseMatrix(A) ? new SparseMatrix(R) : R;\n    }\n  });\n\n  function infinityNorm(A) {\n    var n = A.size()[0];\n    var infNorm = 0;\n\n    for (var i = 0; i < n; i++) {\n      var rowSum = 0;\n\n      for (var j = 0; j < n; j++) {\n        rowSum += abs(A.get([i, j]));\n      }\n\n      infNorm = Math.max(rowSum, infNorm);\n    }\n\n    return infNorm;\n  }\n  /**\n   * Find the best parameters for the Pade approximant given\n   * the matrix norm and desired accuracy. Returns the first acceptable\n   * combination in order of increasing computational load.\n   */\n\n\n  function findParams(infNorm, eps) {\n    var maxSearchSize = 30;\n\n    for (var k = 0; k < maxSearchSize; k++) {\n      for (var q = 0; q <= k; q++) {\n        var j = k - q;\n\n        if (errorEstimate(infNorm, q, j) < eps) {\n          return {\n            q: q,\n            j: j\n          };\n        }\n      }\n    }\n\n    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)');\n  }\n  /**\n   * Returns the estimated error of the Pade approximant for the given\n   * parameters.\n   */\n\n\n  function errorEstimate(infNorm, q, j) {\n    var qfac = 1;\n\n    for (var i = 2; i <= q; i++) {\n      qfac *= i;\n    }\n\n    var twoqfac = qfac;\n\n    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {\n      twoqfac *= _i2;\n    }\n\n    var twoqp1fac = twoqfac * (2 * q + 1);\n    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);\n  }\n\n  expm.toTex = {\n    1: \"\\\\exp\\\\left(${args[0]}\\\\right)\"\n  };\n  return expm;\n}\n\nexports.name = 'expm';\nexports.factory = factory;","'use strict'; // TODO: function eye is removed since v5.0.0 (June 2018). Remove it some day.\n\nfunction factory(type, config, load, typed) {\n  return function eye() {\n    throw new Error('Function \"eye\" is renamed to \"identity\" since mathjs version 5.0.0. ' + 'To keep eye working, create an alias for it using \"math.import({eye: math.identity}, {override: true})\"');\n  };\n}\n\nexports.name = 'eye';\nexports.factory = factory;","'use strict';\n\nvar filter = require('../../utils/array').filter;\n\nvar filterRegExp = require('../../utils/array').filterRegExp;\n\nvar maxArgumentCount = require('../../utils/function').maxArgumentCount;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Filter the items in an array or one dimensional matrix.\n   *\n   * Syntax:\n   *\n   *    math.filter(x, test)\n   *\n   * Examples:\n   *\n   *    function isPositive (x) {\n   *      return x > 0\n   *    }\n   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]\n   *\n   *    math.filter([\"23\", \"foo\", \"100\", \"55\", \"bar\"], /[0-9]+/) // returns [\"23\", \"100\", \"55\"]\n   *\n   * See also:\n   *\n   *    forEach, map, sort\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to filter\n   * @param {Function | RegExp} test\n   *        A function or regular expression to test items.\n   *        All entries for which `test` returns true are returned.\n   *        When `test` is a function, it is invoked with three parameters:\n   *        the value of the element, the index of the element, and the\n   *        matrix/array being traversed. The function must return a boolean.\n   * @return {Matrix | Array} Returns the filtered matrix.\n   */\n\n  var filter = typed('filter', {\n    'Array, function': _filterCallback,\n    'Matrix, function': function MatrixFunction(x, test) {\n      return matrix(_filterCallback(x.toArray(), test));\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return matrix(filterRegExp(x.toArray(), test));\n    }\n  });\n  filter.toTex = undefined; // use default template\n\n  return filter;\n}\n/**\n * Filter values in a callback given a callback function\n * @param {Array} x\n * @param {Function} callback\n * @return {Array} Returns the filtered array\n * @private\n */\n\n\nfunction _filterCallback(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n  return filter(x, function (value, index, array) {\n    // invoke the callback function with the right number of arguments\n    if (args === 1) {\n      return callback(value);\n    } else if (args === 2) {\n      return callback(value, [index]);\n    } else {\n      // 3 or -1\n      return callback(value, [index], array);\n    }\n  });\n}\n\nexports.name = 'filter';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../utils/object').clone;\n\nvar _flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Flatten a multi dimensional matrix into a single dimensional matrix.\n   *\n   * Syntax:\n   *\n   *    math.flatten(x)\n   *\n   * Examples:\n   *\n   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]\n   *\n   * See also:\n   *\n   *    concat, resize, size, squeeze\n   *\n   * @param {Matrix | Array} x   Matrix to be flattened\n   * @return {Matrix | Array} Returns the flattened matrix\n   */\n\n  var flatten = typed('flatten', {\n    'Array': function Array(x) {\n      return _flatten(clone(x));\n    },\n    'Matrix': function Matrix(x) {\n      var flat = _flatten(clone(x.toArray())); // TODO: return the same matrix type as x\n\n\n      return matrix(flat);\n    }\n  });\n  flatten.toTex = undefined; // use default template\n\n  return flatten;\n}\n\nexports.name = 'flatten';\nexports.factory = factory;","'use strict';\n\nvar maxArgumentCount = require('../../utils/function').maxArgumentCount;\n\nvar forEach = require('../../utils/array').forEach;\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Iterate over all elements of a matrix/array, and executes the given callback function.\n   *\n   * Syntax:\n   *\n   *    math.forEach(x, callback)\n   *\n   * Examples:\n   *\n   *    math.forEach([1, 2, 3], function(value) {\n   *      console.log(value)\n   *    })\n   *    // outputs 1, 2, 3\n   *\n   * See also:\n   *\n   *    filter, map, sort\n   *\n   * @param {Matrix | Array} x    The matrix to iterate on.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix/array being traversed.\n   */\n  var forEach = typed('forEach', {\n    'Array, function': _forEach,\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.forEach(callback);\n    }\n  });\n  forEach.toTex = undefined; // use default template\n\n  return forEach;\n}\n/**\n * forEach for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\n\n\nfunction _forEach(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n\n  var recurse = function recurse(value, index) {\n    if (Array.isArray(value)) {\n      forEach(value, function (child, i) {\n        // we create a copy of the index array and append the new index value\n        recurse(child, index.concat(i));\n      });\n    } else {\n      // invoke the callback function with the right number of arguments\n      if (args === 1) {\n        callback(value);\n      } else if (args === 2) {\n        callback(value, index);\n      } else {\n        // 3 or -1\n        callback(value, index, array);\n      }\n    }\n  };\n\n  recurse(array, []);\n}\n\nexports.name = 'forEach';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var getArrayDataType = load(require('../../type/matrix/utils/getArrayDataType'));\n  /**\n   * Find the data type of all elements in a matrix or array,\n   * for example 'number' if all items are a number and 'Complex' if all values\n   * are complex numbers.\n   * If a matrix contains more than one data type, it will return 'mixed'.\n   *\n   * Syntax:\n   *\n   *    math.getMatrixDataType(x)\n   *\n   * Examples:\n   *\n   *    const x = [ [1, 2, 3], [4, 5, 6] ]\n   *    const mixedX = [ [1, true], [2, 3] ]\n   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3] ]\n   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]\n   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]\n   *    const sparse = math.sparse(x)\n   *    const dense = math.matrix(x)\n   *    math.getMatrixDataType(x)   // returns 'number'\n   *    math.getMatrixDataType(sparse)   // returns 'number'\n   *    math.getMatrixDataType(dense)   // returns 'number'\n   *    math.getMatrixDataType(mixedX) // returns 'mixed'\n   *    math.getMatrixDataType(fractionX) // returns 'Fraction'\n   *    math.getMatrixDataType(unitX) // returns 'Unit'\n   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'\n   *\n   * See also:\n   *  SparseMatrix, DenseMatrix\n   *\n   * @param {...Matrix | Array} x   The Matrix with values.\n   *\n   * @return {string} A string representation of the matrix type\n   */\n\n  var getMatrixDataType = typed('getMatrixDataType', {\n    'Array': function Array(x) {\n      return getArrayDataType(x);\n    },\n    'Matrix': function Matrix(x) {\n      return x.getDataType();\n    }\n  });\n  return getMatrixDataType;\n}\n\nexports.name = 'getMatrixDataType';\nexports.factory = factory;","'use strict';\n\nvar array = require('../../utils/array');\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Create a 2-dimensional identity matrix with size m x n or n x n.\n   * The matrix has ones on the diagonal and zeros elsewhere.\n   *\n   * Syntax:\n   *\n   *    math.identity(n)\n   *    math.identity(n, format)\n   *    math.identity(m, n)\n   *    math.identity(m, n, format)\n   *    math.identity([m, n])\n   *    math.identity([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]\n   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]\n   *\n   * See also:\n   *\n   *    diag, ones, zeros, size, range\n   *\n   * @param {...number | Matrix | Array} size   The size for the matrix\n   * @param {string} [format]                   The Matrix storage format\n   *\n   * @return {Matrix | Array | number} A matrix with ones on the diagonal.\n   */\n\n  var identity = typed('identity', {\n    '': function _() {\n      return config.matrix === 'Matrix' ? matrix([]) : [];\n    },\n    'string': function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber': function numberBigNumber(rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'default' : undefined);\n    },\n    'number | BigNumber, string': function numberBigNumberString(rows, format) {\n      return _identity(rows, rows, format);\n    },\n    'number | BigNumber, number | BigNumber': function numberBigNumberNumberBigNumber(rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'default' : undefined);\n    },\n    'number | BigNumber, number | BigNumber, string': function numberBigNumberNumberBigNumberString(rows, cols, format) {\n      return _identity(rows, cols, format);\n    },\n    'Array': function Array(size) {\n      return _identityVector(size);\n    },\n    'Array, string': function ArrayString(size, format) {\n      return _identityVector(size, format);\n    },\n    'Matrix': function Matrix(size) {\n      return _identityVector(size.valueOf(), size.storage());\n    },\n    'Matrix, string': function MatrixString(size, format) {\n      return _identityVector(size.valueOf(), format);\n    }\n  });\n  identity.toTex = undefined; // use default template\n\n  return identity;\n\n  function _identityVector(size, format) {\n    switch (size.length) {\n      case 0:\n        return format ? matrix(format) : [];\n\n      case 1:\n        return _identity(size[0], size[0], format);\n\n      case 2:\n        return _identity(size[0], size[1], format);\n\n      default:\n        throw new Error('Vector containing two values expected');\n    }\n  }\n  /**\n   * Create an identity matrix\n   * @param {number | BigNumber} rows\n   * @param {number | BigNumber} cols\n   * @param {string} [format]\n   * @returns {Matrix}\n   * @private\n   */\n\n\n  function _identity(rows, cols, format) {\n    // BigNumber constructor with the right precision\n    var Big = type.isBigNumber(rows) || type.isBigNumber(cols) ? type.BigNumber : null;\n    if (type.isBigNumber(rows)) rows = rows.toNumber();\n    if (type.isBigNumber(cols)) cols = cols.toNumber();\n\n    if (!isInteger(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n\n    var one = Big ? new type.BigNumber(1) : 1;\n    var defaultValue = Big ? new Big(0) : 0;\n    var size = [rows, cols]; // check we need to return a matrix\n\n    if (format) {\n      // get matrix storage constructor\n      var F = type.Matrix.storage(format); // create diagonal matrix (use optimized implementation for storage format)\n\n      return F.diagonal(size, one, 0, defaultValue);\n    } // create and resize array\n\n\n    var res = array.resize([], size, defaultValue); // fill in ones on the diagonal\n\n    var minimum = rows < cols ? rows : cols; // fill diagonal\n\n    for (var d = 0; d < minimum; d++) {\n      res[d][d] = one;\n    }\n\n    return res;\n  }\n}\n\nexports.name = 'identity';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./apply'), require('./concat'), require('./cross'), require('./ctranspose'), require('./det'), require('./diag'), require('./dot'), require('./eye'), require('./expm'), require('./filter'), require('./flatten'), require('./forEach'), require('./identity'), require('./inv'), require('./kron'), require('./map'), require('./ones'), require('./partitionSelect'), require('./range'), require('./reshape'), require('./resize'), require('./size'), require('./sort'), require('./sqrtm'), require('./squeeze'), require('./subset'), require('./trace'), require('./transpose'), require('./zeros'), require('./getMatrixDataType')];","'use strict';\n\nvar util = require('../../utils/index');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var divideScalar = load(require('../arithmetic/divideScalar'));\n  var addScalar = load(require('../arithmetic/addScalar'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var unaryMinus = load(require('../arithmetic/unaryMinus'));\n  var det = load(require('../matrix/det'));\n  var identity = load(require('./identity'));\n  var abs = load(require('../arithmetic/abs'));\n  /**\n   * Calculate the inverse of a square matrix.\n   *\n   * Syntax:\n   *\n   *     math.inv(x)\n   *\n   * Examples:\n   *\n   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]\n   *     math.inv(4)                 // returns 0.25\n   *     1 / 4                       // returns 0.25\n   *\n   * See also:\n   *\n   *     det, transpose\n   *\n   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed\n   * @return {number | Complex | Array | Matrix} The inverse of `x`.\n   */\n\n  var inv = typed('inv', {\n    'Array | Matrix': function ArrayMatrix(x) {\n      var size = type.isMatrix(x) ? x.size() : util.array.size(x);\n\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (type.isMatrix(x)) {\n              return matrix([divideScalar(1, x.valueOf()[0])]);\n            } else {\n              return [divideScalar(1, x[0])];\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + util.string.format(size) + ')');\n          }\n\n        case 2:\n          // two dimensional array\n          var rows = size[0];\n          var cols = size[1];\n\n          if (rows === cols) {\n            if (type.isMatrix(x)) {\n              return matrix(_inv(x.valueOf(), rows, cols), x.storage());\n            } else {\n              // return an Array\n              return _inv(x, rows, cols);\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + util.string.format(size) + ')');\n          }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + util.string.format(size) + ')');\n      }\n    },\n    'any': function any(x) {\n      // scalar\n      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers\n    }\n  });\n  /**\n   * Calculate the inverse of a square matrix\n   * @param {Array[]} mat     A square matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns, must equal rows\n   * @return {Array[]} inv    Inverse matrix\n   * @private\n   */\n\n  function _inv(mat, rows, cols) {\n    var r, s, f, value, temp;\n\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0];\n\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n\n      return [[divideScalar(1, value)]];\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      var d = det(mat);\n\n      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\n      }\n\n      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];\n    } else {\n      // this is a matrix of 3 x 3 or larger\n      // calculate inverse using gauss-jordan elimination\n      //      https://en.wikipedia.org/wiki/Gaussian_elimination\n      //      http://mathworld.wolfram.com/MatrixInverse.html\n      //      http://math.uww.edu/~mcfarlat/inverse.htm\n      // make a copy of the matrix (only the arrays, not of the elements)\n      var A = mat.concat();\n\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat();\n      } // create an identity matrix which in the end will contain the\n      // matrix inverse\n\n\n      var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions\n\n      for (var c = 0; c < cols; c++) {\n        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n        var ABig = abs(A[c][c]);\n        var rBig = c;\n        r = c + 1;\n\n        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c]);\n            rBig = r;\n          }\n\n          r++;\n        }\n\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero');\n        }\n\n        r = rBig;\n\n        if (r !== c) {\n          temp = A[c];\n          A[c] = A[r];\n          A[r] = temp;\n          temp = B[c];\n          B[c] = B[r];\n          B[r] = temp;\n        } // eliminate non-zero values on the other rows at column c\n\n\n        var Ac = A[c];\n        var Bc = B[c];\n\n        for (r = 0; r < rows; r++) {\n          var Ar = A[r];\n          var Br = B[r];\n\n          if (r !== c) {\n            // eliminate value at column c and row r\n            if (Ar[c] !== 0) {\n              f = divideScalar(unaryMinus(Ar[c]), Ac[c]); // add (f * row c) to row r to eliminate the value\n              // at column c\n\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\n              }\n\n              for (s = 0; s < cols; s++) {\n                Br[s] = addScalar(Br[s], multiply(f, Bc[s]));\n              }\n            }\n          } else {\n            // normalize value at Acc to 1,\n            // divide each value on row r with the value at Acc\n            f = Ac[c];\n\n            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f);\n            }\n\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f);\n            }\n          }\n        }\n      }\n\n      return B;\n    }\n  }\n\n  inv.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)^{-1}\"\n  };\n  return inv;\n}\n\nexports.name = 'inv';\nexports.factory = factory;","'use strict';\n\nvar size = require('../../utils/array').size;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var multiplyScalar = load(require('../arithmetic/multiplyScalar'));\n  /**\n     * Calculates the kronecker product of 2 matrices or vectors.\n     *\n     * NOTE: If a one dimensional vector / matrix is given, it will be\n     * wrapped so its two dimensions.\n     * See the examples.\n     *\n     * Syntax:\n     *\n     *    math.kron(x, y)\n     *\n     * Examples:\n     *\n     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])\n     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]\n     *\n     *    math.kron([1,1], [2,3,4])\n     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]\n     *\n     * See also:\n     *\n     *    multiply, dot, cross\n     *\n     * @param  {Array | Matrix} x     First vector\n     * @param  {Array | Matrix} y     Second vector\n     * @return {Array | Matrix}       Returns the kronecker product of `x` and `y`\n     */\n\n  var kron = typed('kron', {\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      return matrix(_kron(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return matrix(_kron(x.toArray(), y));\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return matrix(_kron(x, y.toArray()));\n    },\n    'Array, Array': _kron\n  });\n  return kron;\n  /**\n     * Calculate the kronecker product of two matrices / vectors\n     * @param {Array} a  First vector\n     * @param {Array} b  Second vector\n     * @returns {Array} Returns the kronecker product of x and y\n     * @private\n     */\n\n  function _kron(a, b) {\n    // Deal with the dimensions of the matricies.\n    if (size(a).length === 1) {\n      // Wrap it in a 2D Matrix\n      a = [a];\n    }\n\n    if (size(b).length === 1) {\n      // Wrap it in a 2D Matrix\n      b = [b];\n    }\n\n    if (size(a).length > 2 || size(b).length > 2) {\n      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');\n    }\n\n    var t = [];\n    var r = [];\n    return a.map(function (a) {\n      return b.map(function (b) {\n        r = [];\n        t.push(r);\n        return a.map(function (y) {\n          return b.map(function (x) {\n            return r.push(multiplyScalar(y, x));\n          });\n        });\n      });\n    }) && t;\n  }\n}\n\nexports.name = 'kron';\nexports.factory = factory;","'use strict';\n\nvar maxArgumentCount = require('../../utils/function').maxArgumentCount;\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a new matrix or array with the results of the callback function executed on\n   * each entry of the matrix/array.\n   *\n   * Syntax:\n   *\n   *    math.map(x, callback)\n   *\n   * Examples:\n   *\n   *    math.map([1, 2, 3], function(value) {\n   *      return value * value\n   *    })  // returns [1, 4, 9]\n   *\n   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The matrix to iterate on.\n   * @param {Function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the matrix being traversed.\n   * @return {Matrix | array}     Transformed map of x\n   */\n  var map = typed('map', {\n    'Array, function': _map,\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.map(callback);\n    }\n  });\n  map.toTex = undefined; // use default template\n\n  return map;\n}\n/**\n * Map for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @return {Array}\n * @private\n */\n\n\nfunction _map(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = maxArgumentCount(callback);\n\n  var recurse = function recurse(value, index) {\n    if (Array.isArray(value)) {\n      return value.map(function (child, i) {\n        // we create a copy of the index array and append the new index value\n        return recurse(child, index.concat(i));\n      });\n    } else {\n      // invoke the callback function with the right number of arguments\n      if (args === 1) {\n        return callback(value);\n      } else if (args === 2) {\n        return callback(value, index);\n      } else {\n        // 3 or -1\n        return callback(value, index, array);\n      }\n    }\n  };\n\n  return recurse(array, []);\n}\n\nexports.name = 'map';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar resize = require('../../utils/array').resize;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Create a matrix filled with ones. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.ones(m)\n   *    math.ones(m, format)\n   *    math.ones(m, n)\n   *    math.ones(m, n, format)\n   *    math.ones([m, n])\n   *    math.ones([m, n], format)\n   *    math.ones([m, n, p, ...])\n   *    math.ones([m, n, p, ...], format)\n   *\n   * Examples:\n   *\n   *    math.ones(3)                   // returns [1, 1, 1]\n   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]\n   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]\n   *\n   * See also:\n   *\n   *    zeros, identity, size, range\n   *\n   * @param {...number | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix | number}  A matrix filled with ones\n   */\n\n  var ones = typed('ones', {\n    '': function _() {\n      return config.matrix === 'Array' ? _ones([]) : _ones([], 'default');\n    },\n    // math.ones(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function numberBigNumberString(size) {\n      var last = size[size.length - 1];\n\n      if (typeof last === 'string') {\n        var format = size.pop();\n        return _ones(size, format);\n      } else if (config.matrix === 'Array') {\n        return _ones(size);\n      } else {\n        return _ones(size, 'default');\n      }\n    },\n    'Array': _ones,\n    'Matrix': function Matrix(size) {\n      var format = size.storage();\n      return _ones(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(size, format) {\n      return _ones(size.valueOf(), format);\n    }\n  });\n  ones.toTex = undefined; // use default template\n\n  return ones;\n  /**\n   * Create an Array or Matrix with ones\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n\n  function _ones(size, format) {\n    var hasBigNumbers = _normalize(size);\n\n    var defaultValue = hasBigNumbers ? new type.BigNumber(1) : 1;\n\n    _validate(size);\n\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n\n      return arr;\n    }\n  } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n  function _normalize(size) {\n    var hasBigNumbers = false;\n    size.forEach(function (value, index, arr) {\n      if (type.isBigNumber(value)) {\n        hasBigNumbers = true;\n        arr[index] = value.toNumber();\n      }\n    });\n    return hasBigNumbers;\n  } // validate arguments\n\n\n  function _validate(size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function ones must be positive integers');\n      }\n    });\n  }\n}\n\nexports.name = 'ones';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var isNumeric = load(require('../utils/isNumeric'));\n  var isNaN = load(require('../utils/isNaN'));\n  var asc = load(require('../relational/compare'));\n\n  function desc(a, b) {\n    return -asc(a, b);\n  }\n  /**\n   * Partition-based selection of an array or 1D matrix.\n   * Will find the kth smallest value, and mutates the input array.\n   * Uses Quickselect.\n   *\n   * Syntax:\n   *\n   *    math.partitionSelect(x, k)\n   *    math.partitionSelect(x, k, compare)\n   *\n   * Examples:\n   *\n   *    math.partitionSelect([5, 10, 1], 2)           // returns 10\n   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1) // returns 'B'\n   *\n   *    function sortByLength (a, b) {\n   *      return a.length - b.length\n   *    }\n   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'\n   *\n   * See also:\n   *\n   *    sort\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to sort\n   * @param {Number} k            The kth smallest value to be retrieved zero-based index\n   * @param {Function | 'asc' | 'desc'} [compare='asc']\n   *        An optional comparator function. The function is called as\n   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,\n   *        and 0 when a == b.\n   * @return {*} Returns the kth lowest value.\n   */\n\n\n  return typed('partitionSelect', {\n    'Array | Matrix, number': function ArrayMatrixNumber(x, k) {\n      return _partitionSelect(x, k, asc);\n    },\n    'Array | Matrix, number, string': function ArrayMatrixNumberString(x, k, compare) {\n      if (compare === 'asc') {\n        return _partitionSelect(x, k, asc);\n      } else if (compare === 'desc') {\n        return _partitionSelect(x, k, desc);\n      } else {\n        throw new Error('Compare string must be \"asc\" or \"desc\"');\n      }\n    },\n    'Array | Matrix, number, function': _partitionSelect\n  });\n\n  function _partitionSelect(x, k, compare) {\n    if (!isInteger(k) || k < 0) {\n      throw new Error('k must be a non-negative integer');\n    }\n\n    if (type.isMatrix(x)) {\n      var size = x.size();\n\n      if (size.length > 1) {\n        throw new Error('Only one dimensional matrices supported');\n      }\n\n      return quickSelect(x.valueOf(), k, compare);\n    }\n\n    if (Array.isArray(x)) {\n      return quickSelect(x, k, compare);\n    }\n  }\n  /**\n   * Quickselect algorithm.\n   * Code adapted from:\n   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html\n   *\n   * @param {Array} arr\n   * @param {Number} k\n   * @param {Function} compare\n   * @private\n   */\n\n\n  function quickSelect(arr, k, compare) {\n    if (k >= arr.length) {\n      throw new Error('k out of bounds');\n    } // check for NaN values since these can cause an infinite while loop\n\n\n    for (var i = 0; i < arr.length; i++) {\n      if (isNumeric(arr[i]) && isNaN(arr[i])) {\n        return arr[i]; // return NaN\n      }\n    }\n\n    var from = 0;\n    var to = arr.length - 1; // if from == to we reached the kth element\n\n    while (from < to) {\n      var r = from;\n      var w = to;\n      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets\n\n      while (r < w) {\n        // arr[r] >= pivot\n        if (compare(arr[r], pivot) >= 0) {\n          // put the large values at the end\n          var tmp = arr[w];\n          arr[w] = arr[r];\n          arr[r] = tmp;\n          --w;\n        } else {\n          // the value is smaller than the pivot, skip\n          ++r;\n        }\n      } // if we stepped up (r++) we need to step one down (arr[r] > pivot)\n\n\n      if (compare(arr[r], pivot) > 0) {\n        --r;\n      } // the r pointer is on the end of the first k elements\n\n\n      if (k <= r) {\n        to = r;\n      } else {\n        from = r + 1;\n      }\n    }\n\n    return arr[k];\n  }\n}\n\nexports.name = 'partitionSelect';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var smaller = load(require('../relational/smaller'));\n  var larger = load(require('../relational/larger'));\n  var smallerEq = load(require('../relational/smallerEq'));\n  var largerEq = load(require('../relational/largerEq'));\n  var ZERO = new type.BigNumber(0);\n  var ONE = new type.BigNumber(1);\n  /**\n   * Create an array from a range.\n   * By default, the range end is excluded. This can be customized by providing\n   * an extra parameter `includeEnd`.\n   *\n   * Syntax:\n   *\n   *     math.range(str [, includeEnd])               // Create a range from a string,\n   *                                                  // where the string contains the\n   *                                                  // start, optional step, and end,\n   *                                                  // separated by a colon.\n   *     math.range(start, end [, includeEnd])        // Create a range with start and\n   *                                                  // end and a step size of 1.\n   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,\n   *                                                  // and end.\n   *\n   * Where:\n   *\n   * - `str: string`\n   *   A string 'start:end' or 'start:step:end'\n   * - `start: {number | BigNumber}`\n   *   Start of the range\n   * - `end: number | BigNumber`\n   *   End of the range, excluded by default, included when parameter includeEnd=true\n   * - `step: number | BigNumber`\n   *   Step size. Default value is 1.\n   * - `includeEnd: boolean`\n   *   Option to specify whether to include the end or not. False by default.\n   *\n   * Examples:\n   *\n   *     math.range(2, 6)        // [2, 3, 4, 5]\n   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]\n   *     math.range('2:1:6')     // [2, 3, 4, 5]\n   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]\n   *\n   * See also:\n   *\n   *     ones, zeros, size, subset\n   *\n   * @param {*} args   Parameters describing the ranges `start`, `end`, and optional `step`.\n   * @return {Array | Matrix} range\n   */\n\n  var range = typed('range', {\n    // TODO: simplify signatures when typed-function supports default values and optional arguments\n    // TODO: a number or boolean should not be converted to string here\n    'string': _strRange,\n    'string, boolean': _strRange,\n    'number, number': function numberNumber(start, end) {\n      return _out(_rangeEx(start, end, 1));\n    },\n    'number, number, number': function numberNumberNumber(start, end, step) {\n      return _out(_rangeEx(start, end, step));\n    },\n    'number, number, boolean': function numberNumberBoolean(start, end, includeEnd) {\n      return includeEnd ? _out(_rangeInc(start, end, 1)) : _out(_rangeEx(start, end, 1));\n    },\n    'number, number, number, boolean': function numberNumberNumberBoolean(start, end, step, includeEnd) {\n      return includeEnd ? _out(_rangeInc(start, end, step)) : _out(_rangeEx(start, end, step));\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(start, end) {\n      return _out(_bigRangeEx(start, end, ONE));\n    },\n    'BigNumber, BigNumber, BigNumber': function BigNumberBigNumberBigNumber(start, end, step) {\n      return _out(_bigRangeEx(start, end, step));\n    },\n    'BigNumber, BigNumber, boolean': function BigNumberBigNumberBoolean(start, end, includeEnd) {\n      return includeEnd ? _out(_bigRangeInc(start, end, ONE)) : _out(_bigRangeEx(start, end, ONE));\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function BigNumberBigNumberBigNumberBoolean(start, end, step, includeEnd) {\n      return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));\n    }\n  });\n  range.toTex = undefined; // use default template\n\n  return range;\n\n  function _out(arr) {\n    return config.matrix === 'Array' ? arr : matrix(arr);\n  }\n\n  function _strRange(str, includeEnd) {\n    var r = _parse(str);\n\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range');\n    }\n\n    var fn;\n\n    if (config.number === 'BigNumber') {\n      fn = includeEnd ? _bigRangeInc : _bigRangeEx;\n      return _out(fn(new type.BigNumber(r.start), new type.BigNumber(r.end), new type.BigNumber(r.step)));\n    } else {\n      fn = includeEnd ? _rangeInc : _rangeEx;\n      return _out(fn(r.start, r.end, r.step));\n    }\n  }\n  /**\n   * Create a range with numbers. End is excluded\n   * @param {number} start\n   * @param {number} end\n   * @param {number} step\n   * @returns {Array} range\n   * @private\n   */\n\n\n  function _rangeEx(start, end, step) {\n    var array = [];\n    var x = start;\n\n    if (step > 0) {\n      while (smaller(x, end)) {\n        array.push(x);\n        x += step;\n      }\n    } else if (step < 0) {\n      while (larger(x, end)) {\n        array.push(x);\n        x += step;\n      }\n    }\n\n    return array;\n  }\n  /**\n   * Create a range with numbers. End is included\n   * @param {number} start\n   * @param {number} end\n   * @param {number} step\n   * @returns {Array} range\n   * @private\n   */\n\n\n  function _rangeInc(start, end, step) {\n    var array = [];\n    var x = start;\n\n    if (step > 0) {\n      while (smallerEq(x, end)) {\n        array.push(x);\n        x += step;\n      }\n    } else if (step < 0) {\n      while (largerEq(x, end)) {\n        array.push(x);\n        x += step;\n      }\n    }\n\n    return array;\n  }\n  /**\n   * Create a range with big numbers. End is excluded\n   * @param {BigNumber} start\n   * @param {BigNumber} end\n   * @param {BigNumber} step\n   * @returns {Array} range\n   * @private\n   */\n\n\n  function _bigRangeEx(start, end, step) {\n    var array = [];\n    var x = start;\n\n    if (step.gt(ZERO)) {\n      while (smaller(x, end)) {\n        array.push(x);\n        x = x.plus(step);\n      }\n    } else if (step.lt(ZERO)) {\n      while (larger(x, end)) {\n        array.push(x);\n        x = x.plus(step);\n      }\n    }\n\n    return array;\n  }\n  /**\n   * Create a range with big numbers. End is included\n   * @param {BigNumber} start\n   * @param {BigNumber} end\n   * @param {BigNumber} step\n   * @returns {Array} range\n   * @private\n   */\n\n\n  function _bigRangeInc(start, end, step) {\n    var array = [];\n    var x = start;\n\n    if (step.gt(ZERO)) {\n      while (smallerEq(x, end)) {\n        array.push(x);\n        x = x.plus(step);\n      }\n    } else if (step.lt(ZERO)) {\n      while (largerEq(x, end)) {\n        array.push(x);\n        x = x.plus(step);\n      }\n    }\n\n    return array;\n  }\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @param {string} str\n   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step\n   * @private\n   */\n\n\n  function _parse(str) {\n    var args = str.split(':'); // number\n\n    var nums = args.map(function (arg) {\n      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string\n      return Number(arg);\n    });\n    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\n\n    if (invalid) {\n      return null;\n    }\n\n    switch (nums.length) {\n      case 2:\n        return {\n          start: nums[0],\n          end: nums[1],\n          step: 1\n        };\n\n      case 3:\n        return {\n          start: nums[0],\n          end: nums[2],\n          step: nums[1]\n        };\n\n      default:\n        return null;\n    }\n  }\n}\n\nexports.name = 'range';\nexports.factory = factory;","'use strict';\n\nvar array = require('../../utils/array');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var isInteger = load(require('../utils/isInteger'));\n  /**\n   * Reshape a multi dimensional array to fit the specified dimensions\n   *\n   * Syntax:\n   *\n   *     math.reshape(x, sizes)\n   *\n   * Examples:\n   *\n   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])\n   *     // returns Array  [[1, 2, 3], [4, 5, 6]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [1, 4])\n   *     // returns Array  [[1, 2, 3, 4]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [4])\n   *     // returns Array [1, 2, 3, 4]\n   *\n   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])\n   *     math.reshape(x, [2, 2, 2])\n   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n   *\n   * See also:\n   *\n   *     size, squeeze, resize\n   *\n   * @param {Array | Matrix | *} x  Matrix to be reshaped\n   * @param {number[]} sizes        One dimensional array with integral sizes for\n   *                                each dimension\n   *\n   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`\n   *\n   * @throws {TypeError}            If `sizes` does not contain solely integers\n   * @throws {DimensionError}       If the product of the new dimension sizes does\n   *                                not equal that of the old ones\n   */\n\n  var reshape = typed('reshape', {\n    'Matrix, Array': function MatrixArray(x, sizes) {\n      if (x.reshape) {\n        return x.reshape(sizes);\n      } else {\n        return matrix(array.reshape(x.valueOf(), sizes));\n      }\n    },\n    'Array, Array': function ArrayArray(x, sizes) {\n      sizes.forEach(function (size) {\n        if (!isInteger(size)) {\n          throw new TypeError('Invalid size for dimension: ' + size);\n        }\n      });\n      return array.reshape(x, sizes);\n    }\n  });\n  reshape.toTex = undefined; // use default template\n\n  return reshape;\n}\n\nexports.name = 'reshape';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../error/DimensionError');\n\nvar ArgumentsError = require('../../error/ArgumentsError');\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar format = require('../../utils/string').format;\n\nvar clone = require('../../utils/object').clone;\n\nvar array = require('../../utils/array');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Resize a matrix\n   *\n   * Syntax:\n   *\n   *     math.resize(x, size)\n   *     math.resize(x, size, defaultValue)\n   *\n   * Examples:\n   *\n   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]\n   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]\n   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]\n   *     math.resize(\"hello\", [8], \"!\")    // returns string 'hello!!!'\n   *\n   * See also:\n   *\n   *     size, squeeze, subset, reshape\n   *\n   * @param {Array | Matrix | *} x             Matrix to be resized\n   * @param {Array | Matrix} size              One dimensional array with numbers\n   * @param {number | string} [defaultValue=0] Zero by default, except in\n   *                                           case of a string, in that case\n   *                                           defaultValue = ' '\n   * @return {* | Array | Matrix} A resized clone of matrix `x`\n   */\n  // TODO: rework resize to a typed-function\n\n  var resize = function resize(x, size, defaultValue) {\n    if (arguments.length !== 2 && arguments.length !== 3) {\n      throw new ArgumentsError('resize', arguments.length, 2, 3);\n    }\n\n    if (type.isMatrix(size)) {\n      size = size.valueOf(); // get Array\n    }\n\n    if (type.isBigNumber(size[0])) {\n      // convert bignumbers to numbers\n      size = size.map(function (value) {\n        return type.isBigNumber(value) ? value.toNumber() : value;\n      });\n    } // check x is a Matrix\n\n\n    if (type.isMatrix(x)) {\n      // use optimized matrix implementation, return copy\n      return x.resize(size, defaultValue, true);\n    }\n\n    if (typeof x === 'string') {\n      // resize string\n      return _resizeString(x, size, defaultValue);\n    } // check result should be a matrix\n\n\n    var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';\n\n    if (size.length === 0) {\n      // output a scalar\n      while (Array.isArray(x)) {\n        x = x[0];\n      }\n\n      return clone(x);\n    } else {\n      // output an array/matrix\n      if (!Array.isArray(x)) {\n        x = [x];\n      }\n\n      x = clone(x);\n      var res = array.resize(x, size, defaultValue);\n      return asMatrix ? matrix(res) : res;\n    }\n  };\n\n  resize.toTex = undefined; // use default template\n\n  return resize;\n  /**\n   * Resize a string\n   * @param {string} str\n   * @param {number[]} size\n   * @param {string} [defaultChar=' ']\n   * @private\n   */\n\n  function _resizeString(str, size, defaultChar) {\n    if (defaultChar !== undefined) {\n      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {\n        throw new TypeError('Single character expected as defaultValue');\n      }\n    } else {\n      defaultChar = ' ';\n    }\n\n    if (size.length !== 1) {\n      throw new DimensionError(size.length, 1);\n    }\n\n    var len = size[0];\n\n    if (typeof len !== 'number' || !isInteger(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n\n    if (str.length > len) {\n      return str.substring(0, len);\n    } else if (str.length < len) {\n      var res = str;\n\n      for (var i = 0, ii = len - str.length; i < ii; i++) {\n        res += defaultChar;\n      }\n\n      return res;\n    } else {\n      return str;\n    }\n  }\n}\n\nexports.name = 'resize';\nexports.factory = factory;","'use strict';\n\nvar array = require('../../utils/array');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Calculate the size of a matrix or scalar.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                  // returns []\n   *     math.size('hello world')        // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                    // returns [2, 3]\n   *     math.size(math.range(1,6))      // returns [5]\n   *\n   * See also:\n   *\n   *     resize, squeeze, subset\n   *\n   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix\n   * @return {Array | Matrix} A vector with size of `x`.\n   */\n\n  var size = typed('size', {\n    'Matrix': function Matrix(x) {\n      // TODO: return the same matrix type as the input\n      return matrix(x.size());\n    },\n    'Array': array.size,\n    'string': function string(x) {\n      return config.matrix === 'Array' ? [x.length] : matrix([x.length]);\n    },\n    'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {\n      // scalar\n      return config.matrix === 'Array' ? [] : matrix([]);\n    }\n  });\n  size.toTex = undefined; // use default template\n\n  return size;\n}\n\nexports.name = 'size';\nexports.factory = factory;","'use strict';\n\nvar size = require('../../utils/array').size;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var compareAsc = load(require('../relational/compare'));\n\n  var compareDesc = function compareDesc(a, b) {\n    return -compareAsc(a, b);\n  };\n\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Sort the items in a matrix.\n   *\n   * Syntax:\n   *\n   *    math.sort(x)\n   *    math.sort(x, compare)\n   *\n   * Examples:\n   *\n   *    math.sort([5, 10, 1]) // returns [1, 5, 10]\n   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)\n   *    // returns ['A', 'B', 'C', 'D']\n   *\n   *    function sortByLength (a, b) {\n   *      return a.length - b.length\n   *    }\n   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)\n   *    // returns ['Tom', 'Sara', 'Langdon']\n   *\n   * See also:\n   *\n   *    filter, forEach, map, compare, compareNatural\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to sort\n   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']\n   *        An optional _comparator function or name. The function is called as\n   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,\n   *        and 0 when a == b.\n   * @return {Matrix | Array} Returns the sorted matrix.\n   */\n\n  var sort = typed('sort', {\n    'Array': function Array(x) {\n      _arrayIsVector(x);\n\n      return x.sort(compareAsc);\n    },\n    'Matrix': function Matrix(x) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(compareAsc), x.storage());\n    },\n    'Array, function': function ArrayFunction(x, _comparator) {\n      _arrayIsVector(x);\n\n      return x.sort(_comparator);\n    },\n    'Matrix, function': function MatrixFunction(x, _comparator) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(_comparator), x.storage());\n    },\n    'Array, string': function ArrayString(x, order) {\n      _arrayIsVector(x);\n\n      return x.sort(_comparator(order));\n    },\n    'Matrix, string': function MatrixString(x, order) {\n      _matrixIsVector(x);\n\n      return matrix(x.toArray().sort(_comparator(order)), x.storage());\n    }\n  });\n  sort.toTex = undefined; // use default template\n\n  /**\n   * Get the comparator for given order ('asc', 'desc', 'natural')\n   * @param {'asc' | 'desc' | 'natural'} order\n   * @return {Function} Returns a _comparator function\n   */\n\n  function _comparator(order) {\n    if (order === 'asc') {\n      return compareAsc;\n    } else if (order === 'desc') {\n      return compareDesc;\n    } else if (order === 'natural') {\n      return compareNatural;\n    } else {\n      throw new Error('String \"asc\", \"desc\", or \"natural\" expected');\n    }\n  }\n  /**\n   * Validate whether an array is one dimensional\n   * Throws an error when this is not the case\n   * @param {Array} array\n   * @private\n   */\n\n\n  function _arrayIsVector(array) {\n    if (size(array).length !== 1) {\n      throw new Error('One dimensional array expected');\n    }\n  }\n  /**\n   * Validate whether a matrix is one dimensional\n   * Throws an error when this is not the case\n   * @param {Matrix} matrix\n   * @private\n   */\n\n\n  function _matrixIsVector(matrix) {\n    if (matrix.size().length !== 1) {\n      throw new Error('One dimensional matrix expected');\n    }\n  }\n\n  return sort;\n}\n\nexports.name = 'sort';\nexports.factory = factory;","'use strict';\n\nvar array = require('../../utils/array');\n\nvar latex = require('../../utils/latex');\n\nvar string = require('../../utils/string');\n\nfunction factory(type, config, load, typed) {\n  var abs = load(require('../arithmetic/abs'));\n  var add = load(require('../arithmetic/add'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var sqrt = load(require('../arithmetic/sqrt'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var inv = load(require('../matrix/inv'));\n  var size = load(require('../matrix/size'));\n  var max = load(require('../statistics/max'));\n  var identity = load(require('./identity'));\n  /**\n   * Calculate the principal square root of a square matrix.\n   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix\n   *\n   * Syntax:\n   *\n   *     X = math.sqrtm(A)\n   *\n   * Examples:\n   *\n   *     math.sqrtm([[1, 2], [3, 4]]) // returns [[-2, 1], [1.5, -0.5]]\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * @param  {Array | Matrix} A   The square matrix `A`\n   * @return {Array | Matrix}     The principal square root of matrix `A`\n   */\n\n  var sqrtm = typed('sqrtm', {\n    'Array | Matrix': function ArrayMatrix(A) {\n      var size = type.isMatrix(A) ? A.size() : array.size(A);\n\n      switch (size.length) {\n        case 1:\n          // Single element Array | Matrix\n          if (size[0] === 1) {\n            return sqrt(A);\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + string.format(size) + ')');\n          }\n\n        case 2:\n          // Two-dimensional Array | Matrix\n          var rows = size[0];\n          var cols = size[1];\n\n          if (rows === cols) {\n            return _denmanBeavers(A);\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + string.format(size) + ')');\n          }\n\n      }\n    }\n  });\n  var _maxIterations = 1e3;\n  var _tolerance = 1e-6;\n  /**\n   * Calculate the principal square root matrix using the Denman–Beavers iterative method\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration\n   *\n   * @param  {Array | Matrix} A   The square matrix `A`\n   * @return {Array | Matrix}     The principal square root of matrix `A`\n   * @private\n   */\n\n  function _denmanBeavers(A) {\n    var error;\n    var iterations = 0;\n    var Y = A;\n    var Z = identity(size(A));\n\n    do {\n      var Yk = Y;\n      Y = multiply(0.5, add(Yk, inv(Z)));\n      Z = multiply(0.5, add(Z, inv(Yk)));\n      error = max(abs(subtract(Y, Yk)));\n\n      if (error > _tolerance && ++iterations > _maxIterations) {\n        throw new Error('computing square root of matrix: iterative method could not converge');\n      }\n    } while (error > _tolerance);\n\n    return Y;\n  }\n\n  sqrtm.toTex = {\n    1: \"{${args[0]}}\".concat(latex.operators['pow'], \"{\\\\frac{1}{2}}\")\n  };\n  return sqrtm;\n}\n\nexports.name = 'sqrtm';\nexports.factory = factory;","'use strict';\n\nvar object = require('../../utils/object');\n\nvar array = require('../../utils/array');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.\n   *\n   * Syntax:\n   *\n   *     math.squeeze(x)\n   *\n   * Examples:\n   *\n   *     math.squeeze([3])           // returns 3\n   *     math.squeeze([[3]])         // returns 3\n   *\n   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)\n   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)\n   *\n   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)\n   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)\n   *\n   *     // only inner and outer dimensions are removed\n   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)\n   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)\n   *\n   * See also:\n   *\n   *     subset\n   *\n   * @param {Matrix | Array} x      Matrix to be squeezed\n   * @return {Matrix | Array} Squeezed matrix\n   */\n\n  var squeeze = typed('squeeze', {\n    'Array': function Array(x) {\n      return array.squeeze(object.clone(x));\n    },\n    'Matrix': function Matrix(x) {\n      var res = array.squeeze(x.toArray()); // FIXME: return the same type of matrix as the input\n\n      return Array.isArray(res) ? matrix(res) : res;\n    },\n    'any': function any(x) {\n      // scalar\n      return object.clone(x);\n    }\n  });\n  squeeze.toTex = undefined; // use default template\n\n  return squeeze;\n}\n\nexports.name = 'squeeze';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../utils/object').clone;\n\nvar validateIndex = require('../../utils/array').validateIndex;\n\nvar getSafeProperty = require('../../utils/customs').getSafeProperty;\n\nvar setSafeProperty = require('../../utils/customs').setSafeProperty;\n\nvar DimensionError = require('../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Get or set a subset of a matrix or string.\n   *\n   * Syntax:\n   *     math.subset(value, index)                                // retrieve a subset\n   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset\n   *\n   * Examples:\n   *\n   *     // get a subset\n   *     const d = [[1, 2], [3, 4]]\n   *     math.subset(d, math.index(1, 0))        // returns 3\n   *     math.subset(d, math.index([0, 1], 1))   // returns [[2], [4]]\n   *\n   *     // replace a subset\n   *     const e = []\n   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 6]]\n   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 6], [0, 7]]\n   *\n   * See also:\n   *\n   *     size, resize, squeeze, index\n   *\n   * @param {Array | Matrix | string} matrix  An array, matrix, or string\n   * @param {Index} index                     An index containing ranges for each\n   *                                          dimension\n   * @param {*} [replacement]                 An array, matrix, or scalar.\n   *                                          If provided, the subset is replaced with replacement.\n   *                                          If not provided, the subset is returned\n   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when\n   *                                          the matrix is resized. If not provided,\n   *                                          math.matrix elements will be left undefined.\n   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.\n   */\n\n  var subset = typed('subset', {\n    // get subset\n    'Array, Index': function ArrayIndex(value, index) {\n      var m = matrix(value);\n      var subset = m.subset(index); // returns a Matrix\n\n      return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)\n    },\n    'Matrix, Index': function MatrixIndex(value, index) {\n      return value.subset(index);\n    },\n    'Object, Index': _getObjectProperty,\n    'string, Index': _getSubstring,\n    // set subset\n    'Array, Index, any': function ArrayIndexAny(value, index, replacement) {\n      return matrix(clone(value)).subset(index, replacement, undefined).valueOf();\n    },\n    'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {\n      return matrix(clone(value)).subset(index, replacement, defaultValue).valueOf();\n    },\n    'Matrix, Index, any': function MatrixIndexAny(value, index, replacement) {\n      return value.clone().subset(index, replacement);\n    },\n    'Matrix, Index, any, any': function MatrixIndexAnyAny(value, index, replacement, defaultValue) {\n      return value.clone().subset(index, replacement, defaultValue);\n    },\n    'string, Index, string': _setSubstring,\n    'string, Index, string, string': _setSubstring,\n    'Object, Index, any': _setObjectProperty\n  });\n  subset.toTex = undefined; // use default template\n\n  return subset;\n  /**\n   * Retrieve a subset of a string\n   * @param {string} str            string from which to get a substring\n   * @param {Index} index           An index containing ranges for each dimension\n   * @returns {string} substring\n   * @private\n   */\n\n  function _getSubstring(str, index) {\n    if (!type.isIndex(index)) {\n      // TODO: better error message\n      throw new TypeError('Index expected');\n    }\n\n    if (index.size().length !== 1) {\n      throw new DimensionError(index.size().length, 1);\n    } // validate whether the range is out of range\n\n\n    var strLen = str.length;\n    validateIndex(index.min()[0], strLen);\n    validateIndex(index.max()[0], strLen);\n    var range = index.dimension(0);\n    var substr = '';\n    range.forEach(function (v) {\n      substr += str.charAt(v);\n    });\n    return substr;\n  }\n  /**\n   * Replace a substring in a string\n   * @param {string} str            string to be replaced\n   * @param {Index} index           An index containing ranges for each dimension\n   * @param {string} replacement    Replacement string\n   * @param {string} [defaultValue] Default value to be uses when resizing\n   *                                the string. is ' ' by default\n   * @returns {string} result\n   * @private\n   */\n\n\n  function _setSubstring(str, index, replacement, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      // TODO: better error message\n      throw new TypeError('Index expected');\n    }\n\n    if (index.size().length !== 1) {\n      throw new DimensionError(index.size().length, 1);\n    }\n\n    if (defaultValue !== undefined) {\n      if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {\n        throw new TypeError('Single character expected as defaultValue');\n      }\n    } else {\n      defaultValue = ' ';\n    }\n\n    var range = index.dimension(0);\n    var len = range.size()[0];\n\n    if (len !== replacement.length) {\n      throw new DimensionError(range.size()[0], replacement.length);\n    } // validate whether the range is out of range\n\n\n    var strLen = str.length;\n    validateIndex(index.min()[0]);\n    validateIndex(index.max()[0]); // copy the string into an array with characters\n\n    var chars = [];\n\n    for (var i = 0; i < strLen; i++) {\n      chars[i] = str.charAt(i);\n    }\n\n    range.forEach(function (v, i) {\n      chars[v] = replacement.charAt(i[0]);\n    }); // initialize undefined characters with a space\n\n    if (chars.length > strLen) {\n      for (var _i = strLen - 1, _len = chars.length; _i < _len; _i++) {\n        if (!chars[_i]) {\n          chars[_i] = defaultValue;\n        }\n      }\n    }\n\n    return chars.join('');\n  }\n}\n/**\n * Retrieve a property from an object\n * @param {Object} object\n * @param {Index} index\n * @return {*} Returns the value of the property\n * @private\n */\n\n\nfunction _getObjectProperty(object, index) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1);\n  }\n\n  var key = index.dimension(0);\n\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property');\n  }\n\n  return getSafeProperty(object, key);\n}\n/**\n * Set a property on an object\n * @param {Object} object\n * @param {Index} index\n * @param {*} replacement\n * @return {*} Returns the updated object\n * @private\n */\n\n\nfunction _setObjectProperty(object, index, replacement) {\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1);\n  }\n\n  var key = index.dimension(0);\n\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property');\n  } // clone the object, and apply the property to the clone\n\n\n  var updated = clone(object);\n  setSafeProperty(updated, key, replacement);\n  return updated;\n}\n\nexports.name = 'subset';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../utils/object').clone;\n\nvar format = require('../../utils/string').format;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var add = load(require('../arithmetic/add'));\n  /**\n   * Calculate the trace of a matrix: the sum of the elements on the main\n   * diagonal of a square matrix.\n   *\n   * Syntax:\n   *\n   *    math.trace(x)\n   *\n   * Examples:\n   *\n   *    math.trace([[1, 2], [3, 4]]) // returns 5\n   *\n   *    const A = [\n   *      [1, 2, 3],\n   *      [-1, 2, 3],\n   *      [2, 0, 3]\n   *    ]\n   *    math.trace(A) // returns 6\n   *\n   * See also:\n   *\n   *    diag\n   *\n   * @param {Array | Matrix} x  A matrix\n   *\n   * @return {number} The trace of `x`\n   */\n\n  var trace = typed('trace', {\n    'Array': function _arrayTrace(x) {\n      // use dense matrix implementation\n      return _denseTrace(matrix(x));\n    },\n    'SparseMatrix': _sparseTrace,\n    'DenseMatrix': _denseTrace,\n    'any': clone\n  });\n\n  function _denseTrace(m) {\n    // matrix size & data\n    var size = m._size;\n    var data = m._data; // process dimensions\n\n    switch (size.length) {\n      case 1:\n        // vector\n        if (size[0] === 1) {\n          // return data[0]\n          return clone(data[0]);\n        }\n\n        throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n\n      case 2:\n        // two dimensional\n        var rows = size[0];\n        var cols = size[1];\n\n        if (rows === cols) {\n          // calulate sum\n          var sum = 0; // loop diagonal\n\n          for (var i = 0; i < rows; i++) {\n            sum = add(sum, data[i][i]);\n          } // return trace\n\n\n          return sum;\n        }\n\n        throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be two dimensional (size: ' + format(size) + ')');\n    }\n  }\n\n  function _sparseTrace(m) {\n    // matrix arrays\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n    var size = m._size; // check dimensions\n\n    var rows = size[0];\n    var columns = size[1]; // matrix must be square\n\n    if (rows === columns) {\n      // calulate sum\n      var sum = 0; // check we have data (avoid looping columns)\n\n      if (values.length > 0) {\n        // loop columns\n        for (var j = 0; j < columns; j++) {\n          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n          var k0 = ptr[j];\n          var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n          for (var k = k0; k < k1; k++) {\n            // row index\n            var i = index[k]; // check row\n\n            if (i === j) {\n              // accumulate value\n              sum = add(sum, values[k]); // exit loop\n\n              break;\n            }\n\n            if (i > j) {\n              // exit loop, no value on the diagonal for column j\n              break;\n            }\n          }\n        }\n      } // return trace\n\n\n      return sum;\n    }\n\n    throw new RangeError('Matrix must be square (size: ' + format(size) + ')');\n  }\n\n  trace.toTex = {\n    1: \"\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)\"\n  };\n  return trace;\n}\n\nexports.name = 'trace';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../utils/object').clone;\n\nvar format = require('../../utils/string').format;\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var DenseMatrix = type.DenseMatrix;\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Transpose a matrix. All values of the matrix are reflected over its\n   * main diagonal. Only applicable to two dimensional matrices containing\n   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional\n   * vectors and scalars return the input unchanged.\n   *\n   * Syntax:\n   *\n   *     math.transpose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]\n   *\n   * See also:\n   *\n   *     diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be transposed\n   * @return {Array | Matrix}   The transposed matrix\n   */\n\n  var transpose = typed('transpose', {\n    'Array': function Array(x) {\n      // use dense matrix implementation\n      return transpose(matrix(x)).valueOf();\n    },\n    'Matrix': function Matrix(x) {\n      // matrix size\n      var size = x.size(); // result\n\n      var c; // process dimensions\n\n      switch (size.length) {\n        case 1:\n          // vector\n          c = x.clone();\n          break;\n\n        case 2:\n          // rows and columns\n          var rows = size[0];\n          var columns = size[1]; // check columns\n\n          if (columns === 0) {\n            // throw exception\n            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')');\n          } // process storage format\n\n\n          switch (x.storage()) {\n            case 'dense':\n              c = _denseTranspose(x, rows, columns);\n              break;\n\n            case 'sparse':\n              c = _sparseTranspose(x, rows, columns);\n              break;\n          }\n\n          break;\n\n        default:\n          // multi dimensional\n          throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(this._size) + ')');\n      }\n\n      return c;\n    },\n    // scalars\n    'any': function any(x) {\n      return clone(x);\n    }\n  });\n\n  function _denseTranspose(m, rows, columns) {\n    // matrix array\n    var data = m._data; // transposed matrix data\n\n    var transposed = [];\n    var transposedRow; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = []; // loop rows\n\n      for (var i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = clone(data[i][j]);\n      }\n    } // return matrix\n\n\n    return new DenseMatrix({\n      data: transposed,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n\n  function _sparseTranspose(m, rows, columns) {\n    // matrix arrays\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // result matrices\n\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // row counts\n\n    var w = [];\n\n    for (var x = 0; x < rows; x++) {\n      w[x] = 0;\n    } // vars\n\n\n    var p, l, j; // loop values in matrix\n\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++;\n    } // cumulative sum\n\n\n    var sum = 0; // initialize cptr with the cummulative sum of row counts\n\n    for (var i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum); // update sum\n\n      sum += w[i]; // update w\n\n      w[i] = cptr[i];\n    } // update cptr\n\n\n    cptr.push(sum); // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // values & index in column\n      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {\n        // C values & index\n        var q = w[index[k]]++; // C[j, i] = A[i, j]\n\n        cindex[q] = j; // check we need to process values (pattern matrix)\n\n        if (values) {\n          cvalues[q] = clone(values[k]);\n        }\n      }\n    } // return matrix\n\n\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n\n  transpose.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latex.operators['transpose'])\n  };\n  return transpose;\n}\n\nexports.name = 'transpose';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar resize = require('../../utils/array').resize;\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  /**\n   * Create a matrix filled with zeros. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.zeros(m)\n   *    math.zeros(m, format)\n   *    math.zeros(m, n)\n   *    math.zeros(m, n, format)\n   *    math.zeros([m, n])\n   *    math.zeros([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.zeros(3)                  // returns [0, 0, 0]\n   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]\n   *    math.zeros(3, 'dense')         // returns [0, 0, 0]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]\n   *\n   * See also:\n   *\n   *    ones, identity, size, range\n   *\n   * @param {...number | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix}           A matrix filled with zeros\n   */\n\n  var zeros = typed('zeros', {\n    '': function _() {\n      return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');\n    },\n    // math.zeros(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function numberBigNumberString(size) {\n      var last = size[size.length - 1];\n\n      if (typeof last === 'string') {\n        var format = size.pop();\n        return _zeros(size, format);\n      } else if (config.matrix === 'Array') {\n        return _zeros(size);\n      } else {\n        return _zeros(size, 'default');\n      }\n    },\n    'Array': _zeros,\n    'Matrix': function Matrix(size) {\n      var format = size.storage();\n      return _zeros(size.valueOf(), format);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(size, format) {\n      return _zeros(size.valueOf(), format);\n    }\n  });\n  zeros.toTex = undefined; // use default template\n\n  return zeros;\n  /**\n   * Create an Array or Matrix with zeros\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n\n  function _zeros(size, format) {\n    var hasBigNumbers = _normalize(size);\n\n    var defaultValue = hasBigNumbers ? new type.BigNumber(0) : 0;\n\n    _validate(size);\n\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue);\n      }\n\n      return arr;\n    }\n  } // replace BigNumbers with numbers, returns true if size contained BigNumbers\n\n\n  function _normalize(size) {\n    var hasBigNumbers = false;\n    size.forEach(function (value, index, arr) {\n      if (type.isBigNumber(value)) {\n        hasBigNumbers = true;\n        arr[index] = value.toNumber();\n      }\n    });\n    return hasBigNumbers;\n  } // validate arguments\n\n\n  function _validate(size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function zeros must be positive integers');\n      }\n    });\n  }\n} // TODO: zeros contains almost the same code as ones. Reuse this?\n\n\nexports.name = 'zeros';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar product = require('./product');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the number of ways of picking `k` unordered outcomes from `n`\n   * possibilities.\n   *\n   * Combinations only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *     math.combinations(n, k)\n   *\n   * Examples:\n   *\n   *    math.combinations(7, 5) // returns 21\n   *\n   * See also:\n   *\n   *    permutations, factorial\n   *\n   * @param {number | BigNumber} n    Total number of objects in the set\n   * @param {number | BigNumber} k    Number of objects in the subset\n   * @return {number | BigNumber}     Number of possible combinations.\n   */\n  var combinations = typed('combinations', {\n    'number, number': function numberNumber(n, k) {\n      var prodrange, nMinusk;\n\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinations');\n      }\n\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function combinations');\n      }\n\n      if (k > n) {\n        throw new TypeError('k must be less than or equal to n');\n      }\n\n      nMinusk = n - k;\n\n      if (k < nMinusk) {\n        prodrange = product(nMinusk + 1, n);\n        return prodrange / product(1, k);\n      }\n\n      prodrange = product(k + 1, n);\n      return prodrange / product(1, nMinusk);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var max, result, i, ii;\n      var one = new type.BigNumber(1);\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinations');\n      }\n\n      if (k.gt(n)) {\n        throw new TypeError('k must be less than n in function combinations');\n      }\n\n      max = n.minus(k);\n      if (k.lt(max)) max = k;\n      result = one;\n\n      for (i = one, ii = n.minus(max); i.lte(ii); i = i.plus(1)) {\n        result = result.times(max.plus(i)).dividedBy(i);\n      }\n\n      return result;\n    } // TODO: implement support for collection in combinations\n\n  });\n  combinations.toTex = {\n    2: \"\\\\binom{${args[0]}}{${args[1]}}\"\n  };\n  return combinations;\n}\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\n\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}\n\nexports.name = 'combinations';\nexports.factory = factory;","'use strict';\n\nvar ArgumentsError = require('../../error/ArgumentsError');\n\nvar isCollection = require('../../utils/collection/isCollection');\n\nvar isNumber = require('../../utils/number').isNumber; // TODO: rethink math.distribution\n// TODO: rework to a typed function\n\n\nfunction factory(type, config, load, typed, math) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n\n  var array = require('../../utils/array'); // seeded pseudo random number generator\n\n\n  var rng = load(require('./seededRNG'));\n  /**\n   * Create a distribution object with a set of random functions for given\n   * random distribution.\n   *\n   * Syntax:\n   *\n   *     math.distribution(name)\n   *\n   * Examples:\n   *\n   *     const normalDist = math.distribution('normal') // create a normal distribution\n   *     normalDist.random(0, 10)                     // get a random value between 0 and 10\n   *\n   * See also:\n   *\n   *     random, randomInt, pickRandom\n   *\n   * @param {string} name   Name of a distribution. Choose from 'uniform', 'normal'.\n   * @return {Object}       Returns a distribution object containing functions:\n   *                        `random([size] [, min] [, max])`,\n   *                        `randomInt([min] [, max])`,\n   *                        `pickRandom(array)`\n   */\n\n  function distribution(name) {\n    if (!distributions.hasOwnProperty(name)) {\n      throw new Error('Unknown distribution ' + name);\n    }\n\n    var args = Array.prototype.slice.call(arguments, 1);\n    var distribution = distributions[name].apply(this, args);\n    return function (distribution) {\n      // This is the public API for all distributions\n      var randFunctions = {\n        random: function random(arg1, arg2, arg3) {\n          var size, min, max;\n\n          if (arguments.length > 3) {\n            throw new ArgumentsError('random', arguments.length, 0, 3);\n          } else if (arguments.length === 1) {\n            // `random(max)` or `random(size)`\n            if (isCollection(arg1)) {\n              size = arg1;\n            } else {\n              max = arg1;\n            }\n          } else if (arguments.length === 2) {\n            // `random(min, max)` or `random(size, max)`\n            if (isCollection(arg1)) {\n              size = arg1;\n              max = arg2;\n            } else {\n              min = arg1;\n              max = arg2;\n            }\n          } else {\n            // `random(size, min, max)`\n            size = arg1;\n            min = arg2;\n            max = arg3;\n          } // TODO: validate type of size\n\n\n          if (min !== undefined && !isNumber(min) || max !== undefined && !isNumber(max)) {\n            throw new TypeError('Invalid argument in function random');\n          }\n\n          if (max === undefined) max = 1;\n          if (min === undefined) min = 0;\n\n          if (size !== undefined) {\n            var res = _randomDataForMatrix(size.valueOf(), min, max, _random);\n\n            return type.isMatrix(size) ? matrix(res) : res;\n          }\n\n          return _random(min, max);\n        },\n        randomInt: typed({\n          'number | Array': function numberArray(arg) {\n            var min = 0;\n\n            if (isCollection(arg)) {\n              var size = arg;\n              var max = 1;\n\n              var res = _randomDataForMatrix(size.valueOf(), min, max, _randomInt);\n\n              return type.isMatrix(size) ? matrix(res) : res;\n            } else {\n              var _max = arg;\n              return _randomInt(min, _max);\n            }\n          },\n          'number | Array, number': function numberArrayNumber(arg1, arg2) {\n            if (isCollection(arg1)) {\n              var size = arg1;\n              var max = arg2;\n              var min = 0;\n\n              var res = _randomDataForMatrix(size.valueOf(), min, max, _randomInt);\n\n              return type.isMatrix(size) ? matrix(res) : res;\n            } else {\n              var _min = arg1;\n              var _max2 = arg2;\n              return _randomInt(_min, _max2);\n            }\n          },\n          'Array, number, number': function ArrayNumberNumber(size, min, max) {\n            var res = _randomDataForMatrix(size.valueOf(), min, max, _randomInt);\n\n            return size && size.isMatrix === true ? matrix(res) : res;\n          }\n        }),\n        pickRandom: typed({\n          'Array': function Array(possibles) {\n            return _pickRandom(possibles);\n          },\n          'Array, number | Array': function ArrayNumberArray(possibles, arg2) {\n            var number, weights;\n\n            if (Array.isArray(arg2)) {\n              weights = arg2;\n            } else if (isNumber(arg2)) {\n              number = arg2;\n            } else {\n              throw new TypeError('Invalid argument in function pickRandom');\n            }\n\n            return _pickRandom(possibles, number, weights);\n          },\n          'Array, number | Array, Array | number': function ArrayNumberArrayArrayNumber(possibles, arg2, arg3) {\n            var number, weights;\n\n            if (Array.isArray(arg2)) {\n              weights = arg2;\n              number = arg3;\n            } else {\n              weights = arg3;\n              number = arg2;\n            }\n\n            if (!Array.isArray(weights) || !isNumber(number)) {\n              throw new TypeError('Invalid argument in function pickRandom');\n            }\n\n            return _pickRandom(possibles, number, weights);\n          }\n        })\n      };\n\n      function _pickRandom(possibles, number, weights) {\n        var single = typeof number === 'undefined';\n\n        if (single) {\n          number = 1;\n        }\n\n        if (type.isMatrix(possibles)) {\n          possibles = possibles.valueOf(); // get Array\n        } else if (!Array.isArray(possibles)) {\n          throw new TypeError('Unsupported type of value in function pickRandom');\n        }\n\n        if (array.size(possibles).length > 1) {\n          throw new Error('Only one dimensional vectors supported');\n        }\n\n        var totalWeights = 0;\n\n        if (typeof weights !== 'undefined') {\n          if (weights.length !== possibles.length) {\n            throw new Error('Weights must have the same length as possibles');\n          }\n\n          for (var i = 0, len = weights.length; i < len; i++) {\n            if (!isNumber(weights[i]) || weights[i] < 0) {\n              throw new Error('Weights must be an array of positive numbers');\n            }\n\n            totalWeights += weights[i];\n          }\n        }\n\n        var length = possibles.length;\n\n        if (length === 0) {\n          return [];\n        } else if (number >= length) {\n          return number > 1 ? possibles : possibles[0];\n        }\n\n        var result = [];\n        var pick;\n\n        while (result.length < number) {\n          if (typeof weights === 'undefined') {\n            pick = possibles[Math.floor(rng() * length)];\n          } else {\n            var randKey = rng() * totalWeights;\n\n            for (var _i = 0, _len = possibles.length; _i < _len; _i++) {\n              randKey -= weights[_i];\n\n              if (randKey < 0) {\n                pick = possibles[_i];\n                break;\n              }\n            }\n          }\n\n          if (result.indexOf(pick) === -1) {\n            result.push(pick);\n          }\n        }\n\n        return single ? result[0] : result; // TODO: add support for multi dimensional matrices\n      }\n\n      function _random(min, max) {\n        return min + distribution() * (max - min);\n      }\n\n      function _randomInt(min, max) {\n        return Math.floor(min + distribution() * (max - min));\n      } // This is a function for generating a random matrix recursively.\n\n\n      function _randomDataForMatrix(size, min, max, randFunc) {\n        var data = [];\n        size = size.slice(0);\n\n        if (size.length > 1) {\n          for (var i = 0, length = size.shift(); i < length; i++) {\n            data.push(_randomDataForMatrix(size, min, max, randFunc));\n          }\n        } else {\n          for (var _i2 = 0, _length = size.shift(); _i2 < _length; _i2++) {\n            data.push(randFunc(min, max));\n          }\n        }\n\n        return data;\n      }\n\n      return randFunctions;\n    }(distribution);\n  } // Each distribution is a function that takes no argument and when called returns\n  // a number between 0 and 1.\n\n\n  var distributions = {\n    uniform: function uniform() {\n      return rng;\n    },\n    // Implementation of normal distribution using Box-Muller transform\n    // ref : https://en.wikipedia.org/wiki/Box%E2%80%93Muller_transform\n    // We take : mean = 0.5, standard deviation = 1/6\n    // so that 99.7% values are in [0, 1].\n    normal: function normal() {\n      return function () {\n        var u1;\n        var u2;\n        var picked = -1; // We reject values outside of the interval [0, 1]\n        // TODO: check if it is ok to do that?\n\n        while (picked < 0 || picked > 1) {\n          u1 = rng();\n          u2 = rng();\n          picked = 1 / 6 * Math.pow(-2 * Math.log(u1), 0.5) * Math.cos(2 * Math.PI * u2) + 0.5;\n        }\n\n        return picked;\n      };\n    }\n  };\n  distribution.toTex = undefined; // use default template\n\n  return distribution;\n}\n\nexports.name = 'distribution';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var gamma = load(require('./gamma'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Compute the factorial of a value\n   *\n   * Factorial only supports an integer value as argument.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.factorial(n)\n   *\n   * Examples:\n   *\n   *    math.factorial(5)    // returns 120\n   *    math.factorial(3)    // returns 6\n   *\n   * See also:\n   *\n   *    combinations, gamma, permutations\n   *\n   * @param {number | BigNumber | Array | Matrix} n   An integer number\n   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`\n   */\n\n\n  var factorial = typed('factorial', {\n    'number': function number(n) {\n      if (n < 0) {\n        throw new Error('Value must be non-negative');\n      }\n\n      return gamma(n + 1);\n    },\n    'BigNumber': function BigNumber(n) {\n      if (n.isNegative()) {\n        throw new Error('Value must be non-negative');\n      }\n\n      return gamma(n.plus(1));\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, factorial);\n    }\n  });\n  factorial.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latex.operators['factorial'])\n  };\n  return factorial;\n}\n\nexports.name = 'factorial';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var multiply = load(require('../arithmetic/multiply'));\n  var pow = load(require('../arithmetic/pow'));\n\n  var product = require('./product');\n  /**\n   * Compute the gamma function of a value using Lanczos approximation for\n   * small values, and an extended Stirling approximation for large values.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.gamma(n)\n   *\n   * Examples:\n   *\n   *    math.gamma(5)       // returns 24\n   *    math.gamma(-0.5)    // returns -3.5449077018110335\n   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i\n   *\n   * See also:\n   *\n   *    combinations, factorial, permutations\n   *\n   * @param {number | Array | Matrix} n   A real or complex number\n   * @return {number | Array | Matrix}    The gamma of `n`\n   */\n\n\n  var gamma = typed('gamma', {\n    'number': function number(n) {\n      var t, x;\n\n      if (isInteger(n)) {\n        if (n <= 0) {\n          return isFinite(n) ? Infinity : NaN;\n        }\n\n        if (n > 171) {\n          return Infinity; // Will overflow\n        }\n\n        return product(1, n - 1);\n      }\n\n      if (n < 0.5) {\n        return Math.PI / (Math.sin(Math.PI * n) * gamma(1 - n));\n      }\n\n      if (n >= 171.35) {\n        return Infinity; // will overflow\n      }\n\n      if (n > 85.0) {\n        // Extended Stirling Approx\n        var twoN = n * n;\n        var threeN = twoN * n;\n        var fourN = threeN * n;\n        var fiveN = fourN * n;\n        return Math.sqrt(2 * Math.PI / n) * Math.pow(n / Math.E, n) * (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) - 571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) + 5246819 / (75246796800 * fiveN * n));\n      }\n\n      --n;\n      x = p[0];\n\n      for (var i = 1; i < p.length; ++i) {\n        x += p[i] / (n + i);\n      }\n\n      t = n + g + 0.5;\n      return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;\n    },\n    'Complex': function Complex(n) {\n      var t, x;\n\n      if (n.im === 0) {\n        return gamma(n.re);\n      }\n\n      n = new type.Complex(n.re - 1, n.im);\n      x = new type.Complex(p[0], 0);\n\n      for (var i = 1; i < p.length; ++i) {\n        var real = n.re + i; // x += p[i]/(n+i)\n\n        var den = real * real + n.im * n.im;\n\n        if (den !== 0) {\n          x.re += p[i] * real / den;\n          x.im += -(p[i] * n.im) / den;\n        } else {\n          x.re = p[i] < 0 ? -Infinity : Infinity;\n        }\n      }\n\n      t = new type.Complex(n.re + g + 0.5, n.im);\n      var twoPiSqrt = Math.sqrt(2 * Math.PI);\n      n.re += 0.5;\n      var result = pow(t, n);\n\n      if (result.im === 0) {\n        // sqrt(2*PI)*result\n        result.re *= twoPiSqrt;\n      } else if (result.re === 0) {\n        result.im *= twoPiSqrt;\n      } else {\n        result.re *= twoPiSqrt;\n        result.im *= twoPiSqrt;\n      }\n\n      var r = Math.exp(-t.re); // exp(-t)\n\n      t.re = r * Math.cos(-t.im);\n      t.im = r * Math.sin(-t.im);\n      return multiply(multiply(result, t), x);\n    },\n    'BigNumber': function BigNumber(n) {\n      if (n.isInteger()) {\n        return n.isNegative() || n.isZero() ? new type.BigNumber(Infinity) : bigFactorial(n.minus(1));\n      }\n\n      if (!n.isFinite()) {\n        return new type.BigNumber(n.isNegative() ? NaN : Infinity);\n      }\n\n      throw new Error('Integer BigNumber expected');\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, gamma);\n    }\n  });\n  /**\n   * Calculate factorial for a BigNumber\n   * @param {BigNumber} n\n   * @returns {BigNumber} Returns the factorial of n\n   */\n\n  function bigFactorial(n) {\n    if (n.isZero()) {\n      return new type.BigNumber(1); // 0! is per definition 1\n    }\n\n    var precision = config.precision + (Math.log(n.toNumber()) | 0);\n    var Big = type.BigNumber.clone({\n      precision: precision\n    });\n    var res = new Big(n);\n    var value = n.toNumber() - 1; // number\n\n    while (value > 1) {\n      res = res.times(value);\n      value--;\n    }\n\n    return new type.BigNumber(res.toPrecision(type.BigNumber.precision));\n  }\n\n  gamma.toTex = {\n    1: \"\\\\Gamma\\\\left(${args[0]}\\\\right)\"\n  };\n  return gamma;\n} // TODO: comment on the variables g and p\n\n\nvar g = 4.7421875;\nvar p = [0.99999999999999709182, 57.156235665862923517, -59.597960355475491248, 14.136097974741747174, -0.49191381609762019978, 0.33994649984811888699e-4, 0.46523628927048575665e-4, -0.98374475304879564677e-4, 0.15808870322491248884e-3, -0.21026444172410488319e-3, 0.21743961811521264320e-3, -0.16431810653676389022e-3, 0.84418223983852743293e-4, -0.26190838401581408670e-4, 0.36899182659531622704e-5];\nexports.name = 'gamma';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// require('./distribution'), // TODO: rethink math.distribution\nrequire('./combinations'), require('./factorial'), require('./gamma'), require('./kldivergence'), require('./multinomial'), require('./permutations'), require('./pickRandom'), require('./random'), require('./randomInt')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var divide = load(require('../arithmetic/divide'));\n  var sum = load(require('../statistics/sum'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var dotDivide = load(require('../arithmetic/dotDivide'));\n  var log = load(require('../arithmetic/log'));\n  var isNumeric = load(require('../utils/isNumeric'));\n  /**\n     * Calculate the Kullback-Leibler (KL) divergence  between two distributions\n     *\n     * Syntax:\n     *\n     *     math.kldivergence(x, y)\n     *\n     * Examples:\n     *\n     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153\n     *\n     *\n     * @param  {Array | Matrix} q    First vector\n     * @param  {Array | Matrix} p    Second vector\n     * @return {number}              Returns distance between q and p\n     */\n\n  var kldivergence = typed('kldivergence', {\n    'Array, Array': function ArrayArray(q, p) {\n      return _kldiv(matrix(q), matrix(p));\n    },\n    'Matrix, Array': function MatrixArray(q, p) {\n      return _kldiv(q, matrix(p));\n    },\n    'Array, Matrix': function ArrayMatrix(q, p) {\n      return _kldiv(matrix(q), p);\n    },\n    'Matrix, Matrix': function MatrixMatrix(q, p) {\n      return _kldiv(q, p);\n    }\n  });\n\n  function _kldiv(q, p) {\n    var plength = p.size().length;\n    var qlength = q.size().length;\n\n    if (plength > 1) {\n      throw new Error('first object must be one dimensional');\n    }\n\n    if (qlength > 1) {\n      throw new Error('second object must be one dimensional');\n    }\n\n    if (plength !== qlength) {\n      throw new Error('Length of two vectors must be equal');\n    } // Before calculation, apply normalization\n\n\n    var sumq = sum(q);\n\n    if (sumq === 0) {\n      throw new Error('Sum of elements in first object must be non zero');\n    }\n\n    var sump = sum(p);\n\n    if (sump === 0) {\n      throw new Error('Sum of elements in second object must be non zero');\n    }\n\n    var qnorm = divide(q, sum(q));\n    var pnorm = divide(p, sum(p));\n    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));\n\n    if (isNumeric(result)) {\n      return result;\n    } else {\n      return Number.NaN;\n    }\n  }\n\n  return kldivergence;\n}\n\nexports.name = 'kldivergence';\nexports.factory = factory;","'use strict';\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var divide = load(require('../arithmetic/divide'));\n  var factorial = load(require('../probability/factorial'));\n  var isInteger = load(require('../utils/isInteger'));\n  var isPositive = load(require('../utils/isPositive'));\n  /**\n   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.\n   *\n   * multinomial takes one array of integers as an argument.\n   * The following condition must be enforced: every ai <= 0\n   *\n   * Syntax:\n   *\n   *     math.multinomial(a) // a is an array type\n   *\n   * Examples:\n   *\n   *    math.multinomial([1,2,1]) // returns 12\n   *\n   * See also:\n   *\n   *    combinations, factorial\n   *\n   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset\n   * @return {Number | BigNumber}         Multinomial coefficient.\n   */\n\n  return typed('multinomial', {\n    'Array | Matrix': function ArrayMatrix(a) {\n      var sum = 0;\n      var denom = 1;\n      deepForEach(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial');\n        }\n\n        sum = add(sum, ai);\n        denom = multiply(denom, factorial(ai));\n      });\n      return divide(factorial(sum), denom);\n    }\n  });\n}\n\nexports.name = 'multinomial';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type, config, load, typed) {\n  var factorial = load(require('./factorial'));\n\n  var product = require('./product');\n  /**\n   * Compute the number of ways of obtaining an ordered subset of `k` elements\n   * from a set of `n` elements.\n   *\n   * Permutations only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *     math.permutations(n)\n   *     math.permutations(n, k)\n   *\n   * Examples:\n   *\n   *    math.permutations(5)     // 120\n   *    math.permutations(5, 3)  // 60\n   *\n   * See also:\n   *\n   *    combinations, factorial\n   *\n   * @param {number | BigNumber} n   The number of objects in total\n   * @param {number | BigNumber} [k] The number of objects in the subset\n   * @return {number | BigNumber}    The number of permutations\n   */\n\n\n  var permutations = typed('permutations', {\n    'number | BigNumber': factorial,\n    'number, number': function numberNumber(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (k > n) {\n        throw new TypeError('second argument k must be less than or equal to first argument n');\n      } // Permute n objects, k at a time\n\n\n      return product(n - k + 1, n);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var result, i;\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n\n      if (k.gt(n)) {\n        throw new TypeError('second argument k must be less than or equal to first argument n');\n      }\n\n      result = new type.BigNumber(1);\n\n      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {\n        result = result.times(i);\n      }\n\n      return result;\n    } // TODO: implement support for collection in permutations\n\n  });\n  permutations.toTex = undefined; // use default template\n\n  return permutations;\n}\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\n\n\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}\n\nexports.name = 'permutations';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var distribution = load(require('./distribution'));\n  /**\n   * Random pick one or more values from a one dimensional array.\n   * Array elements are picked using a random function with uniform or weighted distribution.\n   *\n   * Syntax:\n   *\n   *     math.pickRandom(array)\n   *     math.pickRandom(array, number)\n   *     math.pickRandom(array, weights)\n   *     math.pickRandom(array, number, weights)\n   *     math.pickRandom(array, weights, number)\n   *\n   * Examples:\n   *\n   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution\n   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution\n   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution\n   *\n   * See also:\n   *\n   *     random, randomInt\n   *\n   * @param {Array} array     A one dimensional array\n   * @param {Int} number      An int or float\n   * @param {Array} weights   An array of ints or floats\n   * @return {number | Array} Returns a single random value from array when number is 1 or undefined.\n   *                          Returns an array with the configured number of elements when number is > 1.\n   */\n  // TODO: rework pickRandom to a typed-function\n\n  var pickRandom = distribution('uniform').pickRandom;\n  pickRandom.toTex = undefined; // use default template\n\n  return pickRandom;\n}\n\nexports.name = 'pickRandom';\nexports.factory = factory;","\"use strict\";\n\n/** @param {integer} i\n *  @param {integer} n\n *  @returns : product of i to n\n */\nfunction product(i, n) {\n  var half;\n\n  if (n < i) {\n    return 1;\n  }\n\n  if (n === i) {\n    return n;\n  }\n\n  half = n + i >> 1; // divide (n + i) by 2 and truncate to integer\n\n  return product(i, half) * product(half + 1, n);\n}\n\nmodule.exports = product;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var distribution = load(require('./distribution'));\n  /**\n   * Return a random number larger or equal to `min` and smaller than `max`\n   * using a uniform distribution.\n   *\n   * Syntax:\n   *\n   *     math.random()                // generate a random number between 0 and 1\n   *     math.random(max)             // generate a random number between 0 and max\n   *     math.random(min, max)        // generate a random number between min and max\n   *     math.random(size)            // generate a matrix with random numbers between 0 and 1\n   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max\n   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max\n   *\n   * Examples:\n   *\n   *     math.random()       // returns a random number between 0 and 1\n   *     math.random(100)    // returns a random number between 0 and 100\n   *     math.random(30, 40) // returns a random number between 30 and 40\n   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1\n   *\n   * See also:\n   *\n   *     randomInt, pickRandom\n   *\n   * @param {Array | Matrix} [size] If provided, an array or matrix with given\n   *                                size and filled with random values is returned\n   * @param {number} [min]  Minimum boundary for the random value, included\n   * @param {number} [max]  Maximum boundary for the random value, excluded\n   * @return {number | Array | Matrix} A random number\n   */\n  // TODO: rework random to a typed-function\n\n  var random = distribution('uniform').random;\n  random.toTex = undefined; // use default template\n\n  return random;\n}\n\nexports.name = 'random';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var distribution = load(require('./distribution'));\n  /**\n   * Return a random integer number larger or equal to `min` and smaller than `max`\n   * using a uniform distribution.\n   *\n   * Syntax:\n   *\n   *     math.randomInt(max)             // generate a random integer between 0 and max\n   *     math.randomInt(min, max)        // generate a random integer between min and max\n   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1\n   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max\n   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max\n   *\n   * Examples:\n   *\n   *     math.randomInt(100)    // returns a random integer between 0 and 100\n   *     math.randomInt(30, 40) // returns a random integer between 30 and 40\n   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1\n   *\n   * See also:\n   *\n   *     random, pickRandom\n   *\n   * @param {Array | Matrix} [size] If provided, an array or matrix with given\n   *                                size and filled with random values is returned\n   * @param {number} [min]  Minimum boundary for the random value, included\n   * @param {number} [max]  Maximum boundary for the random value, excluded\n   * @return {number | Array | Matrix} A random integer value\n   */\n  // TODO: rework randomInt to a typed-function\n\n  var randomInt = distribution('uniform').randomInt;\n  randomInt.toTex = undefined; // use default template\n\n  return randomInt;\n}\n\nexports.name = 'randomInt';\nexports.factory = factory;","'use strict';\n\nvar seedrandom = require('seed-random'); // create a random seed here to prevent an infinite loop from seed-random\n// inside the factory. Reason is that math.random is defined as a getter/setter\n// and seed-random generates a seed from the local entropy by reading every\n// defined object including `math` itself. That means that whilst getting\n// math.random, it tries to get math.random, etc... an infinite loop.\n// See https://github.com/ForbesLindesay/seed-random/issues/6\n\n\nvar singletonRandom = seedrandom();\n\nfunction factory(type, config, load, typed, math) {\n  var random; // create a new random generator with given seed\n\n  function setSeed(seed) {\n    random = seed === null ? singletonRandom : seedrandom(String(seed));\n  } // initialize a seeded pseudo random number generator with config's random seed\n\n\n  setSeed(config.randomSeed); // wrapper function so the rng can be updated via generator\n\n  function rng() {\n    return random();\n  } // updates generator with a new instance of a seeded pseudo random number generator\n\n\n  math.on('config', function (curr, prev, changes) {\n    // if the user specified a randomSeed\n    if (changes.randomSeed !== undefined) {\n      // update generator with a new instance of a seeded pseudo random number generator\n      setSeed(curr.randomSeed);\n    }\n  });\n  return rng;\n}\n\nexports.factory = factory;\nexports.math = true;","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm05 = load(require('../../type/matrix/utils/algorithm05'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.\n   *\n   * x and y are considered equal when the relative difference between x and y\n   * is smaller than the configured epsilon. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.compare(x, y)\n   *\n   * Examples:\n   *\n   *    math.compare(6, 1)           // returns 1\n   *    math.compare(2, 3)           // returns -1\n   *    math.compare(7, 7)           // returns 0\n   *    math.compare('10', '2')      // returns 1\n   *    math.compare('1000', '1e3')  // returns 0\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('40 mm')\n   *    math.compare(a, b)           // returns 1\n   *\n   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText\n   *\n   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | Unit | string | Array | Matrix} y Second value to compare\n   * @return {number | BigNumber | Fraction | Array | Matrix} Returns the result of the comparison:\n   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n\n  var compare = typed('compare', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y ? 0 : x > y ? 1 : -1;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x === y || nearlyEqual(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon) ? new type.BigNumber(0) : new type.BigNumber(x.cmp(y));\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return new type.Fraction(x.compare(y));\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return compare(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm05(x, y, compare);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, compare, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, compare, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, compare);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return compare(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return compare(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return compare(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, compare, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, compare, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, compare, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, compare, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, compare, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, compare, true).valueOf();\n    }\n  });\n  compare.toTex = undefined; // use default template\n\n  return compare;\n}\n\nexports.name = 'compare';\nexports.factory = factory;","'use strict';\n\nvar naturalSort = require('javascript-natural-sort');\n\nfunction factory(type, config, load, typed) {\n  var getTypeOf = load(require('../utils/typeof'));\n  var compare = load(require('./compare'));\n  var compareBooleans = compare.signatures['boolean,boolean'];\n  /**\n   * Compare two values of any type in a deterministic, natural way.\n   *\n   * For numeric values, the function works the same as `math.compare`.\n   * For types of values that can't be compared mathematically,\n   * the function compares in a natural way.\n   *\n   * For numeric values, x and y are considered equal when the relative\n   * difference between x and y is smaller than the configured epsilon.\n   * The function cannot be used to compare values smaller than\n   * approximately 2.22e-16.\n   *\n   * For Complex numbers, first the real parts are compared. If equal,\n   * the imaginary parts are compared.\n   *\n   * Strings are compared with a natural sorting algorithm, which\n   * orders strings in a \"logic\" way following some heuristics.\n   * This differs from the function `compare`, which converts the string\n   * into a numeric value and compares that. The function `compareText`\n   * on the other hand compares text lexically.\n   *\n   * Arrays and Matrices are compared value by value until there is an\n   * unequal pair of values encountered. Objects are compared by sorted\n   * keys until the keys or their values are unequal.\n   *\n   * Syntax:\n   *\n   *    math.compareNatural(x, y)\n   *\n   * Examples:\n   *\n   *    math.compareNatural(6, 1)              // returns 1\n   *    math.compareNatural(2, 3)              // returns -1\n   *    math.compareNatural(7, 7)              // returns 0\n   *\n   *    math.compareNatural('10', '2')         // returns 1\n   *    math.compareText('10', '2')            // returns -1\n   *    math.compare('10', '2')                // returns 1\n   *\n   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1\n   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1\n   *    math.compare('Answer: 10', 'Answer: 2')\n   *        // Error: Cannot convert \"Answer: 10\" to a number\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('40 mm')\n   *    math.compareNatural(a, b)              // returns 1\n   *\n   *    const c = math.complex('2 + 3i')\n   *    const d = math.complex('2 + 4i')\n   *    math.compareNatural(c, d)              // returns -1\n   *\n   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1\n   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1\n   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1\n   *    math.compareNatural([1, 2], [1, 2])       // returns 0\n   *\n   *    math.compareNatural({a: 2}, {a: 4})       // returns -1\n   *\n   * See also:\n   *\n   *    compare, compareText\n   *\n   * @param  {*} x First value to compare\n   * @param  {*} y Second value to compare\n   * @return {number} Returns the result of the comparison:\n   *                  1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n\n  var compareNatural = typed('compareNatural', {\n    'any, any': function anyAny(x, y) {\n      var typeX = getTypeOf(x);\n      var typeY = getTypeOf(y);\n      var c; // numeric types\n\n      if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {\n        c = compare(x, y);\n\n        if (c.toString() !== '0') {\n          // c can be number, BigNumber, or Fraction\n          return c > 0 ? 1 : -1; // return a number\n        } else {\n          return naturalSort(typeX, typeY);\n        }\n      } // matrix types\n\n\n      if (typeX === 'Array' || typeX === 'Matrix' || typeY === 'Array' || typeY === 'Matrix') {\n        c = compareMatricesAndArrays(x, y);\n\n        if (c !== 0) {\n          return c;\n        } else {\n          return naturalSort(typeX, typeY);\n        }\n      } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'\n\n\n      if (typeX !== typeY) {\n        return naturalSort(typeX, typeY);\n      }\n\n      if (typeX === 'Complex') {\n        return compareComplexNumbers(x, y);\n      }\n\n      if (typeX === 'Unit') {\n        if (x.equalBase(y)) {\n          return compareNatural(x.value, y.value);\n        } // compare by units\n\n\n        return compareArrays(x.formatUnits(), y.formatUnits());\n      }\n\n      if (typeX === 'boolean') {\n        return compareBooleans(x, y);\n      }\n\n      if (typeX === 'string') {\n        return naturalSort(x, y);\n      }\n\n      if (typeX === 'Object') {\n        return compareObjects(x, y);\n      }\n\n      if (typeX === 'null') {\n        return 0;\n      }\n\n      if (typeX === 'undefined') {\n        return 0;\n      } // this should not occur...\n\n\n      throw new TypeError('Unsupported type of value \"' + typeX + '\"');\n    }\n  });\n  compareNatural.toTex = undefined; // use default template\n\n  /**\n   * Compare mixed matrix/array types, by converting to same-shaped array.\n   * This comparator is non-deterministic regarding input types.\n   * @param {Array | SparseMatrix | DenseMatrix | *} x\n   * @param {Array | SparseMatrix | DenseMatrix | *} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n\n  function compareMatricesAndArrays(x, y) {\n    if (type.isSparseMatrix(x) && type.isSparseMatrix(y)) {\n      return compareArrays(x.toJSON().values, y.toJSON().values);\n    }\n\n    if (type.isSparseMatrix(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(x.toArray(), y);\n    }\n\n    if (type.isSparseMatrix(y)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(x, y.toArray());\n    } // convert DenseArray into Array\n\n\n    if (type.isDenseMatrix(x)) {\n      return compareMatricesAndArrays(x.toJSON().data, y);\n    }\n\n    if (type.isDenseMatrix(y)) {\n      return compareMatricesAndArrays(x, y.toJSON().data);\n    } // convert scalars to array\n\n\n    if (!Array.isArray(x)) {\n      return compareMatricesAndArrays([x], y);\n    }\n\n    if (!Array.isArray(y)) {\n      return compareMatricesAndArrays(x, [y]);\n    }\n\n    return compareArrays(x, y);\n  }\n  /**\n   * Compare two Arrays\n   *\n   * - First, compares value by value\n   * - Next, if all corresponding values are equal,\n   *   look at the length: longest array will be considered largest\n   *\n   * @param {Array} x\n   * @param {Array} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n\n\n  function compareArrays(x, y) {\n    // compare each value\n    for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {\n      var v = compareNatural(x[i], y[i]);\n\n      if (v !== 0) {\n        return v;\n      }\n    } // compare the size of the arrays\n\n\n    if (x.length > y.length) {\n      return 1;\n    }\n\n    if (x.length < y.length) {\n      return -1;\n    } // both Arrays have equal size and content\n\n\n    return 0;\n  }\n  /**\n   * Compare two objects\n   *\n   * - First, compare sorted property names\n   * - Next, compare the property values\n   *\n   * @param {Object} x\n   * @param {Object} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n\n\n  function compareObjects(x, y) {\n    var keysX = Object.keys(x);\n    var keysY = Object.keys(y); // compare keys\n\n    keysX.sort(naturalSort);\n    keysY.sort(naturalSort);\n    var c = compareArrays(keysX, keysY);\n\n    if (c !== 0) {\n      return c;\n    } // compare values\n\n\n    for (var i = 0; i < keysX.length; i++) {\n      var v = compareNatural(x[keysX[i]], y[keysY[i]]);\n\n      if (v !== 0) {\n        return v;\n      }\n    }\n\n    return 0;\n  }\n\n  return compareNatural;\n}\n/**\n * Compare two complex numbers, `x` and `y`:\n *\n * - First, compare the real values of `x` and `y`\n * - If equal, compare the imaginary values of `x` and `y`\n *\n * @params {Complex} x\n * @params {Complex} y\n * @returns {number} Returns the comparison result: -1, 0, or 1\n */\n\n\nfunction compareComplexNumbers(x, y) {\n  if (x.re > y.re) {\n    return 1;\n  }\n\n  if (x.re < y.re) {\n    return -1;\n  }\n\n  if (x.im > y.im) {\n    return 1;\n  }\n\n  if (x.im < y.im) {\n    return -1;\n  }\n\n  return 0;\n}\n\nexports.name = 'compareNatural';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n\n  var _typeof = load(require('../utils/typeof'));\n\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Compare two strings lexically. Comparison is case sensitive.\n   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.compareText(x, y)\n   *\n   * Examples:\n   *\n   *    math.compareText('B', 'A')     // returns 1\n   *    math.compareText('2', '10')    // returns 1\n   *    math.compare('2', '10')        // returns -1\n   *    math.compareNatural('2', '10') // returns -1\n   *\n   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]\n   *\n   * See also:\n   *\n   *    equal, equalText, compare, compareNatural\n   *\n   * @param  {string | Array | DenseMatrix} x First string to compare\n   * @param  {string | Array | DenseMatrix} y Second string to compare\n   * @return {number | Array | DenseMatrix} Returns the result of the comparison:\n   *                                        1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n\n  var compareText = typed('compareText', {\n    'any, any': _compareText,\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, _compareText);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return compareText(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return compareText(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return compareText(x, matrix(y));\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, _compareText, false);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, _compareText, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _compareText, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, _compareText, true).valueOf();\n    }\n  });\n  /**\n   * Compare two strings\n   * @param {string} x\n   * @param {string} y\n   * @returns {number}\n   * @private\n   */\n\n  function _compareText(x, y) {\n    // we don't want to convert numbers to string, only accept string input\n    if (!type.isString(x)) {\n      throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + _typeof(x) + ', index: 0)');\n    }\n\n    if (!type.isString(y)) {\n      throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + _typeof(y) + ', index: 1)');\n    }\n\n    return x === y ? 0 : x > y ? 1 : -1;\n  }\n\n  compareText.toTex = undefined; // use default template\n\n  return compareText;\n}\n\nexports.name = 'compareText';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var equal = load(require('./equal'));\n  /**\n   * Test element wise whether two matrices are equal.\n   * The function accepts both matrices and scalar values.\n   *\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.deepEqual(x, y)\n   *\n   * Examples:\n   *\n   *    math.deepEqual(2, 4)   // returns false\n   *\n   *    a = [2, 5, 1]\n   *    b = [2, 7, 1]\n   *\n   *    math.deepEqual(a, b)   // returns false\n   *    math.equal(a, b)       // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    equal, unequal\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Returns true when the input matrices have the same size and each of their elements is equal.\n   */\n\n  var deepEqual = typed('deepEqual', {\n    'any, any': function anyAny(x, y) {\n      return _deepEqual(x.valueOf(), y.valueOf());\n    }\n  });\n  deepEqual.toTex = undefined; // use default template\n\n  return deepEqual;\n  /**\n   * Test whether two arrays have the same size and all elements are equal\n   * @param {Array | *} x\n   * @param {Array | *} y\n   * @return {boolean} Returns true if both arrays are deep equal\n   */\n\n  function _deepEqual(x, y) {\n    if (Array.isArray(x)) {\n      if (Array.isArray(y)) {\n        var len = x.length;\n\n        if (len !== y.length) {\n          return false;\n        }\n\n        for (var i = 0; i < len; i++) {\n          if (!_deepEqual(x[i], y[i])) {\n            return false;\n          }\n        }\n\n        return true;\n      } else {\n        return false;\n      }\n    } else {\n      if (Array.isArray(y)) {\n        return false;\n      } else {\n        return equal(x, y);\n      }\n    }\n  }\n}\n\nexports.name = 'deepEqual';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var equalScalar = load(require('./equalScalar'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Test whether two values are equal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * smaller than the configured epsilon. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is only\n   * equal to `null` and nothing else, and `undefined` is only equal to\n   * `undefined` and nothing else. Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.equal(x, y)\n   *\n   * Examples:\n   *\n   *    math.equal(2 + 2, 3)         // returns false\n   *    math.equal(2 + 2, 4)         // returns true\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.equal(a, b)             // returns true\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *\n   *    math.equal(c, d)             // returns [true, false, true]\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.equal(\"1000\", \"1e3\")    // returns true\n   *    math.equal(0, null)          // returns false\n   *\n   * See also:\n   *\n   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText\n   *\n   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false\n   */\n\n\n  var equal = typed('equal', {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n\n      if (y === null) {\n        return x === null;\n      }\n\n      if (x === undefined) {\n        return y === undefined;\n      }\n\n      if (y === undefined) {\n        return x === undefined;\n      }\n\n      return equalScalar(x, y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, equalScalar);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, equalScalar, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, equalScalar, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, equalScalar);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return equal(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return equal(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return equal(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, equalScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, equalScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, equalScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, equalScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, equalScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, equalScalar, true).valueOf();\n    }\n  });\n  equal.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['equal'], \"${args[1]}\\\\right)\")\n  };\n  return equal;\n}\n\nexports.name = 'equal';\nexports.factory = factory;","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether two values are equal.\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  var equalScalar = typed('equalScalar', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x === y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.equals(y);\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return equalScalar(x.value, y.value);\n    }\n  });\n  return equalScalar;\n}\n\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var compareText = load(require('./compareText'));\n  var isZero = load(require('../utils/isZero'));\n  /**\n   * Check equality of two strings. Comparison is case sensitive.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.equalText(x, y)\n   *\n   * Examples:\n   *\n   *    math.equalText('Hello', 'Hello')     // returns true\n   *    math.equalText('a', 'A')             // returns false\n   *    math.equal('2e3', '2000')            // returns true\n   *    math.equalText('2e3', '2000')        // returns false\n   *\n   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    equal, compareText, compare, compareNatural\n   *\n   * @param  {string | Array | DenseMatrix} x First string to compare\n   * @param  {string | Array | DenseMatrix} y Second string to compare\n   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.\n   */\n\n  var equalText = typed('equalText', {\n    'any, any': function anyAny(x, y) {\n      return isZero(compareText(x, y));\n    }\n  });\n  equalText.toTex = undefined; // use default template\n\n  return equalText;\n}\n\nexports.name = 'equalText';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./compare'), require('./compareNatural'), require('./compareText'), require('./deepEqual'), require('./equal'), require('./equalText'), require('./larger'), require('./largerEq'), require('./smaller'), require('./smallerEq'), require('./unequal')];","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Test whether value x is larger than y.\n   *\n   * The function returns true when x is larger than y and the relative\n   * difference between x and y is larger than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.larger(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 3)             // returns false\n   *    math.larger(5, 2 + 2)         // returns true\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.larger(a, b)             // returns false\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false\n   */\n\n\n  var larger = typed('larger', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x > y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x > y && !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) === 1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return larger(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, larger);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, larger, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, larger, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, larger);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return larger(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return larger(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return larger(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, larger, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, larger, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, larger, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, larger, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, larger, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, larger, true).valueOf();\n    }\n  });\n  larger.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['larger'], \"${args[1]}\\\\right)\")\n  };\n  return larger;\n}\n\nexports.name = 'larger';\nexports.factory = factory;","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Test whether value x is larger or equal to y.\n   *\n   * The function returns true when x is larger than y or the relative\n   * difference between x and y is smaller than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.largerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 1 + 1)         // returns false\n   *    math.largerEq(2, 1 + 1)       // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false\n   */\n\n\n  var largerEq = typed('largerEq', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x >= y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x >= y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) !== -1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return largerEq(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, largerEq);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, largerEq, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, largerEq, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, largerEq);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return largerEq(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return largerEq(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return largerEq(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, largerEq, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, largerEq, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, largerEq, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, largerEq, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, largerEq, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, largerEq, true).valueOf();\n    }\n  });\n  largerEq.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['largerEq'], \"${args[1]}\\\\right)\")\n  };\n  return largerEq;\n}\n\nexports.name = 'largerEq';\nexports.factory = factory;","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Test whether value x is smaller than y.\n   *\n   * The function returns true when x is smaller than y and the relative\n   * difference between x and y is smaller than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smaller(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(2, 3)            // returns true\n   *    math.smaller(5, 2 * 2)        // returns false\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.smaller(a, b)            // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smallerEq, smaller, smallerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n\n\n  var smaller = typed('smaller', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x < y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x < y && !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lt(y) && !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) === -1;\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return smaller(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, smaller);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, smaller, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, smaller, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, smaller);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return smaller(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return smaller(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return smaller(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, smaller, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, smaller, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, smaller, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, smaller, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, smaller, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, smaller, true).valueOf();\n    }\n  });\n  smaller.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['smaller'], \"${args[1]}\\\\right)\")\n  };\n  return smaller;\n}\n\nexports.name = 'smaller';\nexports.factory = factory;","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Test whether value x is smaller or equal to y.\n   *\n   * The function returns true when x is smaller than y or the relative\n   * difference between x and y is smaller than the configured epsilon. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smallerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(1 + 2, 3)        // returns false\n   *    math.smallerEq(1 + 2, 3)      // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n\n\n  var smallerEq = typed('smallerEq', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x <= y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return x <= y || nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.compare(y) !== 1;\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return smallerEq(x.value, y.value);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, smallerEq);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, smallerEq, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, smallerEq, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, smallerEq);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return smallerEq(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return smallerEq(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return smallerEq(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, smallerEq, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, smallerEq, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, smallerEq, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, smallerEq, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, smallerEq, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, smallerEq, true).valueOf();\n    }\n  });\n  smallerEq.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['smallerEq'], \"${args[1]}\\\\right)\")\n  };\n  return smallerEq;\n}\n\nexports.name = 'smallerEq';\nexports.factory = factory;","'use strict';\n\nvar nearlyEqual = require('../../utils/number').nearlyEqual;\n\nvar bigNearlyEqual = require('../../utils/bignumber/nearlyEqual');\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm07 = load(require('../../type/matrix/utils/algorithm07'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n\n  var latex = require('../../utils/latex');\n  /**\n   * Test whether two values are unequal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * larger than the configured epsilon. The function cannot be used to compare\n   * values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.\n   * Strings are compared by their numerical value.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is unequal\n   * with everything except `null`, and `undefined` is unequal with everything\n   * except `undefined`.\n   *\n   * Syntax:\n   *\n   *    math.unequal(x, y)\n   *\n   * Examples:\n   *\n   *    math.unequal(2 + 2, 3)       // returns true\n   *    math.unequal(2 + 2, 4)       // returns false\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.unequal(a, b)           // returns false\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *\n   *    math.unequal(c, d)           // returns [false, true, false]\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.unequal(0, null)        // returns true\n   * See also:\n   *\n   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false\n   */\n\n\n  var unequal = typed('unequal', {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y !== null;\n      }\n\n      if (y === null) {\n        return x !== null;\n      }\n\n      if (x === undefined) {\n        return y !== undefined;\n      }\n\n      if (y === undefined) {\n        return x !== undefined;\n      }\n\n      return _unequal(x, y);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm07(x, y, _unequal);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      return algorithm03(y, x, _unequal, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, _unequal, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, _unequal);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return unequal(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return unequal(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return unequal(x, matrix(y));\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return algorithm12(x, y, _unequal, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return algorithm14(x, y, _unequal, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return algorithm12(y, x, _unequal, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return algorithm14(y, x, _unequal, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, _unequal, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, _unequal, true).valueOf();\n    }\n  });\n\n  var _unequal = typed('_unequal', {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x !== y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return !nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return !bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return !x.equals(y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return !x.equals(y);\n    },\n    'Unit, Unit': function UnitUnit(x, y) {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n\n      return unequal(x.value, y.value);\n    }\n  });\n\n  unequal.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['unequal'], \"${args[1]}\\\\right)\")\n  };\n  return unequal;\n}\n\nexports.name = 'unequal';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./setCartesian'), require('./setDifference'), require('./setDistinct'), require('./setIntersect'), require('./setIsSubset'), require('./setMultiplicity'), require('./setPowerset'), require('./setSize'), require('./setSymDifference'), require('./setUnion')];","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var DenseMatrix = load(require('../../type/matrix/DenseMatrix'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Create the cartesian product of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setCartesian(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference, setPowerset\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The cartesian product of two (multi)sets\n   */\n\n  var setCartesian = typed('setCartesian', {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      var result = [];\n\n      if (subset(size(a1), new MatrixIndex(0)) !== 0 && subset(size(a2), new MatrixIndex(0)) !== 0) {\n        // if any of them is empty, return empty\n        var b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);\n        var b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);\n        result = [];\n\n        for (var i = 0; i < b1.length; i++) {\n          for (var j = 0; j < b2.length; j++) {\n            result.push([b1[i], b2[j]]);\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return result;\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(result);\n    }\n  });\n  return setCartesian;\n}\n\nexports.name = 'setCartesian';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nvar identify = require('../../utils/array').identify;\n\nvar generalize = require('../../utils/array').generalize;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var DenseMatrix = load(require('../../type/matrix/DenseMatrix'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setDifference(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]\n   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setSymDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The difference of two (multi)sets\n   */\n\n  var setDifference = typed('setDifference', {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n\n      if (subset(size(a1), new MatrixIndex(0)) === 0) {\n        // empty-anything=empty\n        result = [];\n      } else if (subset(size(a2), new MatrixIndex(0)) === 0) {\n        // anything-empty=anything\n        return flatten(a1.toArray());\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n        var inb2;\n\n        for (var i = 0; i < b1.length; i++) {\n          inb2 = false;\n\n          for (var j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n              // the identifier is always a decimal int\n              inb2 = true;\n              break;\n            }\n          }\n\n          if (!inb2) {\n            result.push(b1[i]);\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result);\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(generalize(result));\n    }\n  });\n  return setDifference;\n}\n\nexports.name = 'setDifference';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var DenseMatrix = load(require('../../type/matrix/DenseMatrix'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Collect the distinct elements of a multiset.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setDistinct(set)\n   *\n   * Examples:\n   *\n   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]\n   *\n   * See also:\n   *\n   *    setMultiplicity\n   *\n   * @param {Array | Matrix}    a  A multiset\n   * @return {Array | Matrix}    A set containing the distinc elements of the multiset\n   */\n\n  var setDistinct = typed('setDistinct', {\n    'Array | Matrix': function ArrayMatrix(a) {\n      var result;\n\n      if (subset(size(a), new MatrixIndex(0)) === 0) {\n        // if empty, return empty\n        result = [];\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        result = [];\n        result.push(b[0]);\n\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            result.push(b[i]);\n          }\n        }\n      } // return an array, if the input was an array\n\n\n      if (Array.isArray(a)) {\n        return result;\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(result);\n    }\n  });\n  return setDistinct;\n}\n\nexports.name = 'setDistinct';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nvar identify = require('../../utils/array').identify;\n\nvar generalize = require('../../utils/array').generalize;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var DenseMatrix = load(require('../../type/matrix/DenseMatrix'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Create the intersection of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setIntersect(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]\n   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]\n   *\n   * See also:\n   *\n   *    setUnion, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The intersection of two (multi)sets\n   */\n\n  var setIntersect = typed('setIntersect', {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n\n      if (subset(size(a1), new MatrixIndex(0)) === 0 || subset(size(a2), new MatrixIndex(0)) === 0) {\n        // of any of them is empty, return empty\n        result = [];\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n\n        for (var i = 0; i < b1.length; i++) {\n          for (var j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n              // the identifier is always a decimal int\n              result.push(b1[i]);\n              break;\n            }\n          }\n        }\n      } // return an array, if both inputs were arrays\n\n\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result);\n      } // return a matrix otherwise\n\n\n      return new DenseMatrix(generalize(result));\n    }\n  });\n  return setIntersect;\n}\n\nexports.name = 'setIntersect';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nvar identify = require('../../utils/array').identify;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setIsSubset(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false\n   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {boolean}            true | false\n   */\n\n  var setIsSubset = typed('setIsSubset', {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new MatrixIndex(0)) === 0) {\n        // empty is a subset of anything\n        return true;\n      } else if (subset(size(a2), new MatrixIndex(0)) === 0) {\n        // anything is not a subset of empty\n        return false;\n      }\n\n      var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n      var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n      var inb2;\n\n      for (var i = 0; i < b1.length; i++) {\n        inb2 = false;\n\n        for (var j = 0; j < b2.length; j++) {\n          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {\n            // the identifier is always a decimal int\n            inb2 = true;\n            break;\n          }\n        }\n\n        if (inb2 === false) {\n          return false;\n        }\n      }\n\n      return true;\n    }\n  });\n  return setIsSubset;\n}\n\nexports.name = 'setIsSubset';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var compareNatural = load(require('../relational/compareNatural'));\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  /**\n   * Count the multiplicity of an element in a multiset.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setMultiplicity(element, set)\n   *\n   * Examples:\n   *\n   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1\n   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2\n   *\n   * See also:\n   *\n   *    setDistinct, setSize\n   *\n   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset\n   * @param {Array | Matrix}     a  A multiset\n   * @return {number}            The number of how many times the multiset contains the element\n   */\n\n  var setMultiplicity = typed('setMultiplicity', {\n    'number | BigNumber | Fraction | Complex, Array | Matrix': function numberBigNumberFractionComplexArrayMatrix(e, a) {\n      if (subset(size(a), new MatrixIndex(0)) === 0) {\n        // if empty, return 0\n        return 0;\n      }\n\n      var b = flatten(Array.isArray(a) ? a : a.toArray());\n      var count = 0;\n\n      for (var i = 0; i < b.length; i++) {\n        if (compareNatural(b[i], e) === 0) {\n          count++;\n        }\n      }\n\n      return count;\n    }\n  });\n  return setMultiplicity;\n}\n\nexports.name = 'setMultiplicity';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setPowerset(set)\n   *\n   * Examples:\n   *\n   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]\n   *\n   * See also:\n   *\n   *    setCartesian\n   *\n   * @param {Array | Matrix}    a  A (multi)set\n   * @return {Array}    The powerset of the (multi)set\n   */\n\n  var setPowerset = typed('setPowerset', {\n    'Array | Matrix': function ArrayMatrix(a) {\n      if (subset(size(a), new MatrixIndex(0)) === 0) {\n        // if empty, return empty\n        return [];\n      }\n\n      var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n      var result = [];\n      var number = 0;\n\n      while (number.toString(2).length <= b.length) {\n        result.push(_subset(b, number.toString(2).split('').reverse()));\n        number++;\n      } // can not return a matrix, because of the different size of the subarrays\n\n\n      return _sort(result);\n    }\n  });\n  return setPowerset; // create subset\n\n  function _subset(array, bitarray) {\n    var result = [];\n\n    for (var i = 0; i < bitarray.length; i++) {\n      if (bitarray[i] === '1') {\n        result.push(array[i]);\n      }\n    }\n\n    return result;\n  } // sort subsests by length\n\n\n  function _sort(array) {\n    var temp = [];\n\n    for (var i = array.length - 1; i > 0; i--) {\n      for (var j = 0; j < i; j++) {\n        if (array[j].length > array[j + 1].length) {\n          temp = array[j];\n          array[j] = array[j + 1];\n          array[j + 1] = temp;\n        }\n      }\n    }\n\n    return array;\n  }\n}\n\nexports.name = 'setPowerset';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var compareNatural = load(require('../relational/compareNatural'));\n  /**\n   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setSize(set)\n   *    math.setSize(set, unique)\n   *\n   * Examples:\n   *\n   *    math.setSize([1, 2, 2, 4])          // returns 4\n   *    math.setSize([1, 2, 2, 4], true)    // returns 3\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a  A multiset\n   * @return {number}            The number of elements of the (multi)set\n   */\n\n  var setSize = typed('setSize', {\n    'Array | Matrix': function ArrayMatrix(a) {\n      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n    },\n    'Array | Matrix, boolean': function ArrayMatrixBoolean(a, unique) {\n      if (unique === false || a.length === 0) {\n        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        var count = 1;\n\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            count++;\n          }\n        }\n\n        return count;\n      }\n    }\n  });\n  return setSize;\n}\n\nexports.name = 'setSize';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var concat = load(require('../matrix/concat'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var setDifference = load(require('../set/setDifference'));\n  /**\n   * Create the symmetric difference of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setSymDifference(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]\n   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The symmetric difference of two (multi)sets\n   */\n\n  var setSymDifference = typed('setSymDifference', {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new MatrixIndex(0)) === 0) {\n        // if any of them is empty, return the other one\n        return flatten(a2);\n      } else if (subset(size(a2), new MatrixIndex(0)) === 0) {\n        return flatten(a1);\n      }\n\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setDifference(b1, b2), setDifference(b2, b1));\n    }\n  });\n  return setSymDifference;\n}\n\nexports.name = 'setSymDifference';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var MatrixIndex = load(require('../../type/matrix/MatrixIndex'));\n  var concat = load(require('../matrix/concat'));\n  var size = load(require('../matrix/size'));\n  var subset = load(require('../matrix/subset'));\n  var setIntersect = load(require('../set/setIntersect'));\n  var setSymDifference = load(require('../set/setSymDifference'));\n  /**\n   * Create the union of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setUnion(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]\n   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]\n   *\n   * See also:\n   *\n   *    setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The union of two (multi)sets\n   */\n\n  var setUnion = typed('setUnion', {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new MatrixIndex(0)) === 0) {\n        // if any of them is empty, return the other one\n        return flatten(a2);\n      } else if (subset(size(a2), new MatrixIndex(0)) === 0) {\n        return flatten(a1);\n      }\n\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));\n    }\n  });\n  return setUnion;\n}\n\nexports.name = 'setUnion';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar sign = require('../../utils/number').sign;\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Compute the erf function of a value using a rational Chebyshev\n   * approximations for different intervals of x.\n   *\n   * This is a translation of W. J. Cody's Fortran implementation from 1987\n   * ( https://www.netlib.org/specfun/erf ). See the AMS publication\n   * \"Rational Chebyshev Approximations for the Error Function\" by W. J. Cody\n   * for an explanation of this process.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.erf(x)\n   *\n   * Examples:\n   *\n   *    math.erf(0.2)    // returns 0.22270258921047847\n   *    math.erf(-0.5)   // returns -0.5204998778130465\n   *    math.erf(4)      // returns 0.9999999845827421\n   *\n   * @param {number | Array | Matrix} x   A real number\n   * @return {number | Array | Matrix}    The erf of `x`\n   */\n  var erf = typed('erf', {\n    'number': function number(x) {\n      var y = Math.abs(x);\n\n      if (y >= MAX_NUM) {\n        return sign(x);\n      }\n\n      if (y <= THRESH) {\n        return sign(x) * erf1(y);\n      }\n\n      if (y <= 4.0) {\n        return sign(x) * (1 - erfc2(y));\n      }\n\n      return sign(x) * (1 - erfc3(y));\n    },\n    // TODO: Not sure if there's a way to guarantee some degree of accuracy here.\n    //  Perhaps it would be best to set the precision of the number to that which\n    //  is guaranteed by erf()\n    'BigNumber': function BigNumber(n) {\n      return new type.BigNumber(erf(n.toNumber()));\n    },\n    'Array | Matrix': function ArrayMatrix(n) {\n      return deepMap(n, erf);\n    } // TODO: For complex numbers, use the approximation for the Faddeeva function\n    //  from \"More Efficient Computation of the Complex Error Function\" (AMS)\n\n  });\n  /**\n   * Approximates the error function erf() for x <= 0.46875 using this function:\n   *               n\n   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))\n   *              j=0\n   */\n\n  function erf1(y) {\n    var ysq = y * y;\n    var xnum = P[0][4] * ysq;\n    var xden = ysq;\n    var i;\n\n    for (i = 0; i < 3; i += 1) {\n      xnum = (xnum + P[0][i]) * ysq;\n      xden = (xden + Q[0][i]) * ysq;\n    }\n\n    return y * (xnum + P[0][3]) / (xden + Q[0][3]);\n  }\n  /**\n   * Approximates the complement of the error function erfc() for\n   * 0.46875 <= x <= 4.0 using this function:\n   *                       n\n   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)\n   *                      j=0\n   */\n\n\n  function erfc2(y) {\n    var xnum = P[1][8] * y;\n    var xden = y;\n    var i;\n\n    for (i = 0; i < 7; i += 1) {\n      xnum = (xnum + P[1][i]) * y;\n      xden = (xden + Q[1][i]) * y;\n    }\n\n    var result = (xnum + P[1][7]) / (xden + Q[1][7]);\n    var ysq = parseInt(y * 16) / 16;\n    var del = (y - ysq) * (y + ysq);\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;\n  }\n  /**\n   * Approximates the complement of the error function erfc() for x > 4.0 using\n   * this function:\n   *\n   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +\n   *               n\n   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]\n   *              j=0\n   */\n\n\n  function erfc3(y) {\n    var ysq = 1 / (y * y);\n    var xnum = P[2][5] * ysq;\n    var xden = ysq;\n    var i;\n\n    for (i = 0; i < 4; i += 1) {\n      xnum = (xnum + P[2][i]) * ysq;\n      xden = (xden + Q[2][i]) * ysq;\n    }\n\n    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);\n    result = (SQRPI - result) / y;\n    ysq = parseInt(y * 16) / 16;\n    var del = (y - ysq) * (y + ysq);\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;\n  }\n\n  erf.toTex = {\n    1: \"erf\\\\left(${args[0]}\\\\right)\"\n  };\n  return erf;\n}\n/**\n * Upper bound for the first approximation interval, 0 <= x <= THRESH\n * @constant\n */\n\n\nvar THRESH = 0.46875;\n/**\n * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)\n * @constant\n */\n\nvar SQRPI = 5.6418958354775628695e-1;\n/**\n * Coefficients for each term of the numerator sum (p_j) for each approximation\n * interval (see W. J. Cody's paper for more details)\n * @constant\n */\n\nvar P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];\n/**\n * Coefficients for each term of the denominator sum (q_j) for each approximation\n * interval (see W. J. Cody's paper for more details)\n * @constant\n */\n\nvar Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];\n/**\n * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is\n * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will\n * return 1\n */\n\nvar MAX_NUM = Math.pow(2, 53);\nexports.name = 'erf';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./erf')];","'use strict';\n\nmodule.exports = [require('./mad'), require('./max'), require('./mean'), require('./median'), require('./min'), require('./mode'), require('./prod'), require('./quantileSeq'), require('./std'), require('./sum'), require('./var')];","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var abs = load(require('../arithmetic/abs'));\n  var map = load(require('../matrix/map'));\n  var median = load(require('../statistics/median'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the median absolute deviation of a matrix or a list with values.\n   * The median absolute deviation is defined as the median of the absolute\n   * deviations from the median.\n   *\n   * Syntax:\n   *\n   *     math.mad(a, b, c, ...)\n   *     math.mad(A)\n   *\n   * Examples:\n   *\n   *     math.mad(10, 20, 30)             // returns 10\n   *     math.mad([1, 2, 3])              // returns 1\n   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5\n   *\n   * See also:\n   *\n   *     median, mean, std, abs\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or multiple scalar values.\n   * @return {*} The median absolute deviation.\n   */\n\n  var mad = typed('mad', {\n    // mad([a, b, c, d, ...])\n    'Array | Matrix': _mad,\n    // mad(a, b, c, d, ...)\n    '...': function _(args) {\n      return _mad(args);\n    }\n  });\n  mad.toTex = undefined; // use default template\n\n  return mad;\n\n  function _mad(array) {\n    array = flatten(array.valueOf());\n\n    if (array.length === 0) {\n      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');\n    }\n\n    try {\n      var med = median(array);\n      return median(map(array, function (value) {\n        return abs(subtract(value, med));\n      }));\n    } catch (err) {\n      if (err instanceof TypeError && err.message.indexOf('median') !== -1) {\n        throw new TypeError(err.message.replace('median', 'mad'));\n      } else {\n        throw improveErrorMessage(err, 'mad');\n      }\n    }\n  }\n}\n\nexports.name = 'mad';\nexports.factory = factory;","'use strict';\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nvar reduce = require('../../utils/collection/reduce');\n\nvar containsCollections = require('../../utils/collection/containsCollections');\n\nfunction factory(type, config, load, typed) {\n  var larger = load(require('../relational/larger'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the maximum value of a matrix or a  list with values.\n   * In case of a multi dimensional array, the maximum of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.max(a, b, c, ...)\n   *     math.max(A)\n   *     math.max(A, dim)\n   *\n   * Examples:\n   *\n   *     math.max(2, 1, 4, 3)                  // returns 4\n   *     math.max([2, 1, 4, 3])                // returns 4\n   *\n   *     // maximum over a specified dimension (zero-based)\n   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]\n   *     math.max([[2, 5], [4, 3]], [1, 7], 1) // returns [5, 4, 7]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, min, prod, std, sum, var\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The maximum value\n   */\n\n  var max = typed('max', {\n    // max([a, b, c, d, ...])\n    'Array | Matrix': _max,\n    // max([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _largest);\n    },\n    // max(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function max');\n      }\n\n      return _max(args);\n    }\n  });\n  max.toTex = \"\\\\max\\\\left(${args}\\\\right)\";\n  return max;\n  /**\n   * Return the largest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is largest, or y when y is largest\n   * @private\n   */\n\n  function _largest(x, y) {\n    try {\n      return larger(x, y) ? x : y;\n    } catch (err) {\n      throw improveErrorMessage(err, 'max', y);\n    }\n  }\n  /**\n   * Recursively calculate the maximum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} max\n   * @private\n   */\n\n\n  function _max(array) {\n    var max;\n    deepForEach(array, function (value) {\n      try {\n        if (isNaN(value) && typeof value === 'number') {\n          max = NaN;\n        } else if (max === undefined || larger(value, max)) {\n          max = value;\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'max', value);\n      }\n    });\n\n    if (max === undefined) {\n      throw new Error('Cannot calculate max of an empty array');\n    }\n\n    return max;\n  }\n}\n\nexports.name = 'max';\nexports.factory = factory;","'use strict';\n\nvar size = require('../../utils/array').size;\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nvar reduce = require('../../utils/collection/reduce');\n\nvar containsCollections = require('../../utils/collection/containsCollections');\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var divide = load(require('../arithmetic/divide'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the mean value of matrix or a list with values.\n   * In case of a multi dimensional array, the mean of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.mean(a, b, c, ...)\n   *     math.mean(A)\n   *     math.mean(A, dim)\n   *\n   * Examples:\n   *\n   *     math.mean(2, 1, 4, 3)                     // returns 2.5\n   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725\n   *\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]\n   *\n   * See also:\n   *\n   *     median, min, max, sum, prod, std, var\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The mean of all values\n   */\n\n  var mean = typed('mean', {\n    // mean([a, b, c, d, ...])\n    'Array | Matrix': _mean,\n    // mean([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nmeanDim,\n    // mean(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function mean');\n      }\n\n      return _mean(args);\n    }\n  });\n  mean.toTex = undefined; // use default template\n\n  return mean;\n  /**\n   * Calculate the mean value in an n-dimensional array, returning a\n   * n-1 dimensional array\n   * @param {Array} array\n   * @param {number} dim\n   * @return {number} mean\n   * @private\n   */\n\n  function _nmeanDim(array, dim) {\n    try {\n      var sum = reduce(array, dim, add);\n      var s = Array.isArray(array) ? size(array) : array.size();\n      return divide(sum, s[dim]);\n    } catch (err) {\n      throw improveErrorMessage(err, 'mean');\n    }\n  }\n  /**\n   * Recursively calculate the mean value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} mean\n   * @private\n   */\n\n\n  function _mean(array) {\n    var sum = 0;\n    var num = 0;\n    deepForEach(array, function (value) {\n      try {\n        sum = add(sum, value);\n        num++;\n      } catch (err) {\n        throw improveErrorMessage(err, 'mean', value);\n      }\n    });\n\n    if (num === 0) {\n      throw new Error('Cannot calculate mean of an empty array');\n    }\n\n    return divide(sum, num);\n  }\n}\n\nexports.name = 'mean';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nvar containsCollections = require('../../utils/collection/containsCollections');\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/addScalar'));\n  var divide = load(require('../arithmetic/divideScalar'));\n  var compare = load(require('../relational/compare'));\n  var partitionSelect = load(require('../matrix/partitionSelect'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the median of a matrix or a list with values. The values are\n   * sorted and the middle value is returned. In case of an even number of\n   * values, the average of the two middle values is returned.\n   * Supported types of values are: Number, BigNumber, Unit\n   *\n   * In case of a (multi dimensional) array or matrix, the median of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.median(a, b, c, ...)\n   *     math.median(A)\n   *\n   * Examples:\n   *\n   *     math.median(5, 2, 7)        // returns 5\n   *     math.median([3, -1, 5, 7])  // returns 4\n   *\n   * See also:\n   *\n   *     mean, min, max, sum, prod, std, var, quantileSeq\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The median\n   */\n\n  var median = typed('median', {\n    // median([a, b, c, d, ...])\n    'Array | Matrix': _median,\n    // median([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      // TODO: implement median(A, dim)\n      throw new Error('median(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], ...)\n    },\n    // median(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function median');\n      }\n\n      return _median(args);\n    }\n  });\n  /**\n   * Recursively calculate the median of an n-dimensional array\n   * @param {Array} array\n   * @return {Number} median\n   * @private\n   */\n\n  function _median(array) {\n    try {\n      array = flatten(array.valueOf());\n      var num = array.length;\n\n      if (num === 0) {\n        throw new Error('Cannot calculate median of an empty array');\n      }\n\n      if (num % 2 === 0) {\n        // even: return the average of the two middle values\n        var mid = num / 2 - 1;\n        var right = partitionSelect(array, mid + 1); // array now partitioned at mid + 1, take max of left part\n\n        var left = array[mid];\n\n        for (var i = 0; i < mid; ++i) {\n          if (compare(array[i], left) > 0) {\n            left = array[i];\n          }\n        }\n\n        return middle2(left, right);\n      } else {\n        // odd: return the middle value\n        var m = partitionSelect(array, (num - 1) / 2);\n        return middle(m);\n      }\n    } catch (err) {\n      throw improveErrorMessage(err, 'median');\n    }\n  } // helper function to type check the middle value of the array\n\n\n  var middle = typed({\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {\n      return value;\n    }\n  }); // helper function to type check the two middle value of the array\n\n  var middle2 = typed({\n    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function numberBigNumberComplexUnitNumberBigNumberComplexUnit(left, right) {\n      return divide(add(left, right), 2);\n    }\n  });\n  median.toTex = undefined; // use default template\n\n  return median;\n}\n\nexports.name = 'median';\nexports.factory = factory;","'use strict';\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nvar reduce = require('../../utils/collection/reduce');\n\nvar containsCollections = require('../../utils/collection/containsCollections');\n\nfunction factory(type, config, load, typed) {\n  var smaller = load(require('../relational/smaller'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the minimum value of a matrix or a  list of values.\n   * In case of a multi dimensional array, the minimum of the flattened array\n   * will be calculated. When `dim` is provided, the minimum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.min(a, b, c, ...)\n   *     math.min(A)\n   *     math.min(A, dim)\n   *\n   * Examples:\n   *\n   *     math.min(2, 1, 4, 3)                  // returns 1\n   *     math.min([2, 1, 4, 3])                // returns 1\n   *\n   *     // minimum over a specified dimension (zero-based)\n   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]\n   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, max, prod, std, sum, var\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The minimum value\n   */\n\n  var min = typed('min', {\n    // min([a, b, c, d, ...])\n    'Array | Matrix': _min,\n    // min([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _smallest);\n    },\n    // min(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function min');\n      }\n\n      return _min(args);\n    }\n  });\n  min.toTex = \"\\\\min\\\\left(${args}\\\\right)\";\n  return min;\n  /**\n   * Return the smallest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is smallest, or y when y is smallest\n   * @private\n   */\n\n  function _smallest(x, y) {\n    try {\n      return smaller(x, y) ? x : y;\n    } catch (err) {\n      throw improveErrorMessage(err, 'min', y);\n    }\n  }\n  /**\n   * Recursively calculate the minimum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} min\n   * @private\n   */\n\n\n  function _min(array) {\n    var min;\n    deepForEach(array, function (value) {\n      try {\n        if (isNaN(value) && typeof value === 'number') {\n          min = NaN;\n        } else if (min === undefined || smaller(value, min)) {\n          min = value;\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'min', value);\n      }\n    });\n\n    if (min === undefined) {\n      throw new Error('Cannot calculate min of an empty array');\n    }\n\n    return min;\n  }\n}\n\nexports.name = 'min';\nexports.factory = factory;","'use strict';\n\nvar flatten = require('../../utils/array').flatten;\n\nfunction factory(type, config, load, typed) {\n  var isNaN = load(require('../utils/isNaN'));\n  var isNumeric = load(require('../utils/isNumeric'));\n  /**\n  * Computes the mode of a set of numbers or a list with values(numbers or characters).\n  * If there are more than one modes, it returns a list of those values.\n  *\n  * Syntax:\n  *\n  *     math.mode(a, b, c, ...)\n  *     math.mode(A)\n  *\n  * Examples:\n  *\n  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]\n  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]\n  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]\n  *     math.mode('a','a','b','c')                           // returns [\"a\"]\n  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, \"abc\"]\n  *\n  * See also:\n  *\n  *     median,\n  *     mean\n  *\n  * @param {... *} args  A single matrix\n  * @return {*} The mode of all values\n  */\n\n  var mode = typed('mode', {\n    'Array | Matrix': _mode,\n    '...': function _(args) {\n      return _mode(args);\n    }\n  });\n  return mode;\n  /**\n   * Calculates the mode in an 1-dimensional array\n   * @param {Array} values\n   * @return {Array} mode\n   * @private\n   */\n\n  function _mode(values) {\n    values = flatten(values.valueOf());\n    var num = values.length;\n\n    if (num === 0) {\n      throw new Error('Cannot calculate mode of an empty array');\n    }\n\n    var count = {};\n    var mode = [];\n    var max = 0;\n\n    for (var i = 0; i < values.length; i++) {\n      var value = values[i];\n\n      if (isNumeric(value) && isNaN(value)) {\n        throw new Error('Cannot calculate mode of an array containing NaN values');\n      }\n\n      if (!(value in count)) {\n        count[value] = 0;\n      }\n\n      count[value]++;\n\n      if (count[value] === max) {\n        mode.push(value);\n      } else if (count[value] > max) {\n        max = count[value];\n        mode = [value];\n      }\n    }\n\n    return mode;\n  }\n}\n\nexports.name = 'mode';\nexports.factory = factory;","'use strict';\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nfunction factory(type, config, load, typed) {\n  var multiply = load(require('../arithmetic/multiplyScalar'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the product of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.prod(a, b, c, ...)\n   *     math.prod(A)\n   *\n   * Examples:\n   *\n   *     math.multiply(2, 3)           // returns 6\n   *     math.prod(2, 3)               // returns 6\n   *     math.prod(2, 3, 4)            // returns 24\n   *     math.prod([2, 3, 4])          // returns 24\n   *     math.prod([[2, 5], [4, 3]])   // returns 120\n   *\n   * See also:\n   *\n   *    mean, median, min, max, sum, std, var\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The product of all values\n   */\n\n  var prod = typed('prod', {\n    // prod([a, b, c, d, ...])\n    'Array | Matrix': _prod,\n    // prod([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      // TODO: implement prod(A, dim)\n      throw new Error('prod(A, dim) is not yet supported'); // return reduce(arguments[0], arguments[1], math.prod)\n    },\n    // prod(a, b, c, d, ...)\n    '...': function _(args) {\n      return _prod(args);\n    }\n  });\n  prod.toTex = undefined; // use default template\n\n  return prod;\n  /**\n   * Recursively calculate the product of an n-dimensional array\n   * @param {Array} array\n   * @return {number} prod\n   * @private\n   */\n\n  function _prod(array) {\n    var prod;\n    deepForEach(array, function (value) {\n      try {\n        prod = prod === undefined ? value : multiply(prod, value);\n      } catch (err) {\n        throw improveErrorMessage(err, 'prod', value);\n      }\n    });\n\n    if (prod === undefined) {\n      throw new Error('Cannot calculate prod of an empty array');\n    }\n\n    return prod;\n  }\n}\n\nexports.name = 'prod';\nexports.factory = factory;","'use strict';\n\nvar isInteger = require('../../utils/number').isInteger;\n\nvar isNumber = require('../../utils/number').isNumber;\n\nvar flatten = require('../../utils/array').flatten;\n\nvar isCollection = require('../../utils/collection/isCollection');\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/add'));\n  var multiply = load(require('../arithmetic/multiply'));\n  var partitionSelect = load(require('../matrix/partitionSelect'));\n  var compare = load(require('../relational/compare'));\n  /**\n   * Compute the prob order quantile of a matrix or a list with values.\n   * The sequence is sorted and the middle value is returned.\n   * Supported types of sequence values are: Number, BigNumber, Unit\n   * Supported types of probability are: Number, BigNumber\n   *\n   * In case of a (multi dimensional) array or matrix, the prob order quantile\n   * of all elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.quantileSeq(A, prob[, sorted])\n   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])\n   *     math.quantileSeq(A, N[, sorted])\n   *\n   * Examples:\n   *\n   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4\n   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]\n   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]\n   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4\n   *\n   * See also:\n   *\n   *     median, mean, min, max, sum, prod, std, var\n   *\n   * @param {Array, Matrix} data                A single matrix or Array\n   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is\n   *                                            the amount of evenly distributed steps of\n   *                                            probabilities; only one of these options can\n   *                                            be provided\n   * @param {Boolean} sorted=false              is data sorted in ascending order\n   * @return {Number, BigNumber, Unit, Array}   Quantile(s)\n   */\n\n  function quantileSeq(data, probOrN, sorted) {\n    var probArr, dataArr, one;\n\n    if (arguments.length < 2 || arguments.length > 3) {\n      throw new SyntaxError('Function quantileSeq requires two or three parameters');\n    }\n\n    if (isCollection(data)) {\n      sorted = sorted || false;\n\n      if (typeof sorted === 'boolean') {\n        dataArr = data.valueOf();\n\n        if (isNumber(probOrN)) {\n          if (probOrN < 0) {\n            throw new Error('N/prob must be non-negative');\n          }\n\n          if (probOrN <= 1) {\n            // quantileSeq([a, b, c, d, ...], prob[,sorted])\n            return _quantileSeq(dataArr, probOrN, sorted);\n          }\n\n          if (probOrN > 1) {\n            // quantileSeq([a, b, c, d, ...], N[,sorted])\n            if (!isInteger(probOrN)) {\n              throw new Error('N must be a positive integer');\n            }\n\n            var nPlusOne = probOrN + 1;\n            probArr = new Array(probOrN);\n\n            for (var i = 0; i < probOrN;) {\n              probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);\n            }\n\n            return probArr;\n          }\n        }\n\n        if (type.isBigNumber(probOrN)) {\n          if (probOrN.isNegative()) {\n            throw new Error('N/prob must be non-negative');\n          }\n\n          one = new probOrN.constructor(1);\n\n          if (probOrN.lte(one)) {\n            // quantileSeq([a, b, c, d, ...], prob[,sorted])\n            return new type.BigNumber(_quantileSeq(dataArr, probOrN, sorted));\n          }\n\n          if (probOrN.gt(one)) {\n            // quantileSeq([a, b, c, d, ...], N[,sorted])\n            if (!probOrN.isInteger()) {\n              throw new Error('N must be a positive integer');\n            } // largest possible Array length is 2^32-1\n            // 2^32 < 10^15, thus safe conversion guaranteed\n\n\n            var intN = probOrN.toNumber();\n\n            if (intN > 4294967295) {\n              throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');\n            }\n\n            var _nPlusOne = new type.BigNumber(intN + 1);\n\n            probArr = new Array(intN);\n\n            for (var _i = 0; _i < intN;) {\n              probArr[_i] = new type.BigNumber(_quantileSeq(dataArr, new type.BigNumber(++_i).div(_nPlusOne), sorted));\n            }\n\n            return probArr;\n          }\n        }\n\n        if (Array.isArray(probOrN)) {\n          // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])\n          probArr = new Array(probOrN.length);\n\n          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {\n            var currProb = probOrN[_i2];\n\n            if (isNumber(currProb)) {\n              if (currProb < 0 || currProb > 1) {\n                throw new Error('Probability must be between 0 and 1, inclusive');\n              }\n            } else if (type.isBigNumber(currProb)) {\n              one = new currProb.constructor(1);\n\n              if (currProb.isNegative() || currProb.gt(one)) {\n                throw new Error('Probability must be between 0 and 1, inclusive');\n              }\n            } else {\n              throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function\n            }\n\n            probArr[_i2] = _quantileSeq(dataArr, currProb, sorted);\n          }\n\n          return probArr;\n        }\n\n        throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function\n      }\n\n      throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function\n    }\n\n    throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function\n  }\n  /**\n   * Calculate the prob order quantile of an n-dimensional array.\n   *\n   * @param {Array} array\n   * @param {Number, BigNumber} prob\n   * @param {Boolean} sorted\n   * @return {Number, BigNumber, Unit} prob order quantile\n   * @private\n   */\n\n\n  function _quantileSeq(array, prob, sorted) {\n    var flat = flatten(array);\n    var len = flat.length;\n\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence');\n    }\n\n    if (isNumber(prob)) {\n      var _index = prob * (len - 1);\n\n      var _fracPart = _index % 1;\n\n      if (_fracPart === 0) {\n        var value = sorted ? flat[_index] : partitionSelect(flat, _index);\n        validate(value);\n        return value;\n      }\n\n      var _integerPart = Math.floor(_index);\n\n      var _left;\n\n      var _right;\n\n      if (sorted) {\n        _left = flat[_integerPart];\n        _right = flat[_integerPart + 1];\n      } else {\n        _right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest\n\n        _left = flat[_integerPart];\n\n        for (var i = 0; i < _integerPart; ++i) {\n          if (compare(flat[i], _left) > 0) {\n            _left = flat[i];\n          }\n        }\n      }\n\n      validate(_left);\n      validate(_right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n\n      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));\n    } // If prob is a BigNumber\n\n\n    var index = prob.times(len - 1);\n\n    if (index.isInteger()) {\n      index = index.toNumber();\n\n      var _value = sorted ? flat[index] : partitionSelect(flat, index);\n\n      validate(_value);\n      return _value;\n    }\n\n    var integerPart = index.floor();\n    var fracPart = index.minus(integerPart);\n    var integerPartNumber = integerPart.toNumber();\n    var left;\n    var right;\n\n    if (sorted) {\n      left = flat[integerPartNumber];\n      right = flat[integerPartNumber + 1];\n    } else {\n      right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest\n\n      left = flat[integerPartNumber];\n\n      for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {\n        if (compare(flat[_i3], left) > 0) {\n          left = flat[_i3];\n        }\n      }\n    }\n\n    validate(left);\n    validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n\n    var one = new fracPart.constructor(1);\n    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));\n  }\n  /**\n   * Check if array value types are valid, throw error otherwise.\n   * @param {number | BigNumber | Unit} x\n   * @param {number | BigNumber | Unit} x\n   * @private\n   */\n\n\n  var validate = typed({\n    'number | BigNumber | Unit': function numberBigNumberUnit(x) {\n      return x;\n    }\n  });\n  return quantileSeq;\n}\n\nexports.name = 'quantileSeq';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var sqrt = load(require('../arithmetic/sqrt'));\n  var variance = load(require('../statistics/var'));\n  /**\n   * Compute the standard deviation of a matrix or a  list with values.\n   * The standard deviations is defined as the square root of the variance:\n   * `std(A) = sqrt(var(A))`.\n   * In case of a (multi dimensional) array or matrix, the standard deviation\n   * over all elements will be calculated by default, unless an axis is specified\n   * in which case the standard deviation will be computed along that axis.\n   *\n   * Additionally, it is possible to compute the standard deviation along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Syntax:\n   *\n   *     math.std(a, b, c, ...)\n   *     math.std(A)\n   *     math.std(A, normalization)\n   *     math.std(A, dimension)\n   *     math.std(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.std(2, 4, 6)                     // returns 2\n   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611\n   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979\n   *     math.std([2, 4, 6, 8], 'biased')      // returns 2\n   *\n   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707\n   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, sum, var\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the standard deviation for a matrix\n   * @return {*} The standard deviation\n   */\n\n  var std = typed('std', {\n    // std([a, b, c, d, ...])\n    'Array | Matrix': _std,\n    // std([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _std,\n    // std([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': _std,\n    // std([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _std,\n    // std(a, b, c, d, ...)\n    '...': function _(args) {\n      return _std(args);\n    }\n  });\n  std.toTex = undefined; // use default template\n\n  return std;\n\n  function _std(array, normalization) {\n    if (array.length === 0) {\n      throw new SyntaxError('Function std requires one or more parameters (0 provided)');\n    }\n\n    try {\n      return sqrt(variance.apply(null, arguments));\n    } catch (err) {\n      if (err instanceof TypeError && err.message.indexOf(' var') !== -1) {\n        throw new TypeError(err.message.replace(' var', ' std'));\n      } else {\n        throw err;\n      }\n    }\n  }\n}\n\nexports.name = 'std';\nexports.factory = factory;","'use strict';\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nvar reduce = require('../../utils/collection/reduce');\n\nvar containsCollections = require('../../utils/collection/containsCollections');\n\nfunction factory(type, config, load, typed) {\n  var add = load(require('../arithmetic/addScalar'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the sum of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.sum(a, b, c, ...)\n   *     math.sum(A)\n   *\n   * Examples:\n   *\n   *     math.sum(2, 1, 4, 3)               // returns 10\n   *     math.sum([2, 1, 4, 3])             // returns 10\n   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, var\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The sum of all values\n   */\n\n  var sum = typed('sum', {\n    // sum([a, b, c, d, ...])\n    'Array | Matrix': _sum,\n    // sum([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nsumDim,\n    // sum(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function sum');\n      }\n\n      return _sum(args);\n    }\n  });\n  sum.toTex = undefined; // use default template\n\n  return sum;\n  /**\n   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array} array\n   * @return {number} sum\n   * @private\n   */\n\n  function _sum(array) {\n    var sum;\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n      } catch (err) {\n        throw improveErrorMessage(err, 'sum', value);\n      }\n    });\n\n    if (sum === undefined) {\n      switch (config.number) {\n        case 'number':\n          return 0;\n\n        case 'BigNumber':\n          return new type.BigNumber(0);\n\n        case 'Fraction':\n          return new type.Fraction(0);\n\n        default:\n          return 0;\n      }\n    }\n\n    return sum;\n  }\n\n  function _nsumDim(array, dim) {\n    try {\n      var _sum2 = reduce(array, dim, add);\n\n      return _sum2;\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum');\n    }\n  }\n}\n\nexports.name = 'sum';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var getType = load(require('../../utils/typeof'));\n  /**\n   * Improve error messages for statistics functions. Errors are typically\n   * thrown in an internally used function like larger, causing the error\n   * not to mention the function (like max) which is actually used by the user.\n   *\n   * @param {Error} err\n   * @param {String} fnName\n   * @param {*} [value]\n   * @return {Error}\n   */\n\n  return function improveErrorMessage(err, fnName, value) {\n    // TODO: add information with the index (also needs transform in expression parser)\n    var details;\n\n    if (String(err).indexOf('Unexpected type') !== -1) {\n      details = arguments.length > 2 ? ' (type: ' + getType(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';\n      return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);\n    }\n\n    if (String(err).indexOf('complex numbers') !== -1) {\n      details = arguments.length > 2 ? ' (type: ' + getType(value) + ', value: ' + JSON.stringify(value) + ')' : '';\n      return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);\n    }\n\n    return err;\n  };\n}\n\nexports.factory = factory;","'use strict';\n\nvar DEFAULT_NORMALIZATION = 'unbiased';\n\nvar deepForEach = require('../../utils/collection/deepForEach');\n\nfunction factory(type, config, load, typed) {\n  var apply = load(require('../matrix/apply'));\n  var add = load(require('../arithmetic/addScalar'));\n  var subtract = load(require('../arithmetic/subtract'));\n  var multiply = load(require('../arithmetic/multiplyScalar'));\n  var divide = load(require('../arithmetic/divideScalar'));\n  var isNaN = load(require('../utils/isNaN'));\n  var improveErrorMessage = load(require('./utils/improveErrorMessage'));\n  /**\n   * Compute the variance of a matrix or a  list with values.\n   * In case of a (multi dimensional) array or matrix, the variance over all\n   * elements will be calculated.\n   *\n   * Additionally, it is possible to compute the variance along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Note that older browser may not like the variable name `var`. In that\n   * case, the function can be called as `math['var'](...)` instead of\n   * `math.var(...)`.\n   *\n   * Syntax:\n   *\n   *     math.var(a, b, c, ...)\n   *     math.var(A)\n   *     math.var(A, normalization)\n   *     math.var(A, dimension)\n   *     math.var(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.var(2, 4, 6)                     // returns 4\n   *     math.var([2, 4, 6, 8])                // returns 6.666666666666667\n   *     math.var([2, 4, 6, 8], 'uncorrected') // returns 5\n   *     math.var([2, 4, 6, 8], 'biased')      // returns 4\n   *\n   *     math.var([[1, 2, 3], [4, 5, 6]])      // returns 3.5\n   *     math.var([[1, 2, 3], [4, 6, 8]], 0)    // returns [4.5, 8, 12.5]\n   *     math.var([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 4]\n   *     math.var([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, std, sum\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the variance for a matrix\n   * @return {*} The variance\n   */\n\n  var variance = typed('variance', {\n    // var([a, b, c, d, ...])\n    'Array | Matrix': function ArrayMatrix(array) {\n      return _var(array, DEFAULT_NORMALIZATION);\n    },\n    // var([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n    // var([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION);\n    },\n    // var([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n    // var(a, b, c, d, ...)\n    '...': function _(args) {\n      return _var(args, DEFAULT_NORMALIZATION);\n    }\n  });\n  variance.toTex = \"\\\\mathrm{Var}\\\\left(${args}\\\\right)\";\n  return variance;\n  /**\n   * Recursively calculate the variance of an n-dimensional array\n   * @param {Array} array\n   * @param {string} normalization\n   *                        Determines how to normalize the variance:\n   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)\n   *                        - 'uncorrected' The sum of squared errors is divided by n\n   *                        - 'biased'      The sum of squared errors is divided by (n + 1)\n   * @return {number | BigNumber} variance\n   * @private\n   */\n\n  function _var(array, normalization) {\n    var sum = 0;\n    var num = 0;\n\n    if (array.length === 0) {\n      throw new SyntaxError('Function var requires one or more parameters (0 provided)');\n    } // calculate the mean and number of elements\n\n\n    deepForEach(array, function (value) {\n      try {\n        sum = add(sum, value);\n        num++;\n      } catch (err) {\n        throw improveErrorMessage(err, 'var', value);\n      }\n    });\n    if (num === 0) throw new Error('Cannot calculate var of an empty array');\n    var mean = divide(sum, num); // calculate the variance\n\n    sum = 0;\n    deepForEach(array, function (value) {\n      var diff = subtract(value, mean);\n      sum = add(sum, multiply(diff, diff));\n    });\n\n    if (isNaN(sum)) {\n      return sum;\n    }\n\n    switch (normalization) {\n      case 'uncorrected':\n        return divide(sum, num);\n\n      case 'biased':\n        return divide(sum, num + 1);\n\n      case 'unbiased':\n        var zero = type.isBigNumber(sum) ? new type.BigNumber(0) : 0;\n        return num === 1 ? zero : divide(sum, num - 1);\n\n      default:\n        throw new Error('Unknown normalization \"' + normalization + '\". ' + 'Choose \"unbiased\" (default), \"uncorrected\", or \"biased\".');\n    }\n  }\n\n  function _varDim(array, dim, normalization) {\n    try {\n      if (array.length === 0) {\n        throw new SyntaxError('Function var requires one or more parameters (0 provided)');\n      }\n\n      return apply(array, dim, function (x) {\n        return _var(x, normalization);\n      });\n    } catch (err) {\n      throw improveErrorMessage(err, 'var');\n    }\n  }\n}\n\nexports.name = 'var';\nexports.factory = factory;","'use strict';\n\nvar string = require('../../utils/string');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Format a value of any type into a string.\n   *\n   * Syntax:\n   *\n   *    math.format(value)\n   *    math.format(value, options)\n   *    math.format(value, precision)\n   *    math.format(value, callback)\n   *\n   * Where:\n   *\n   *  - `value: *`\n   *    The value to be formatted\n   *  - `options: Object`\n   *    An object with formatting options. Available options:\n   *    - `notation: string`\n   *      Number notation. Choose from:\n   *      - 'fixed'\n   *        Always use regular number notation.\n   *        For example '123.40' and '14000000'\n   *      - 'exponential'\n   *        Always use exponential notation.\n   *        For example '1.234e+2' and '1.4e+7'\n   *      - 'engineering'\n   *        Always use engineering notation.\n   *        For example '123.4e+0' and '14.0e+6'\n   *      - 'auto' (default)\n   *        Regular number notation for numbers having an absolute value between\n   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.\n   *        Lower bound is included, upper bound is excluded.\n   *        For example '123.4' and '1.4e7'.\n   *    - `precision: number`\n   *      A number between 0 and 16 to round the digits of the number. In case\n   *      of notations 'exponential', 'engineering', and 'auto', `precision`\n   *      defines the total number of significant digits returned.\n   *      In case of notation 'fixed', `precision` defines the number of\n   *      significant digits after the decimal point.\n   *      `precision` is undefined by default.\n   *    - `lowerExp: number`\n   *      Exponent determining the lower boundary for formatting a value with\n   *      an exponent when `notation='auto`. Default value is `-3`.\n   *    - `upperExp: number`\n   *      Exponent determining the upper boundary for formatting a value with\n   *      an exponent when `notation='auto`. Default value is `5`.\n   *    - `fraction: string`. Available values: 'ratio' (default) or 'decimal'.\n   *      For example `format(fraction(1, 3))` will output '1/3' when 'ratio' is\n   *      configured, and will output `0.(3)` when 'decimal' is configured.\n   * - `callback: function`\n   *   A custom formatting function, invoked for all numeric elements in `value`,\n   *   for example all elements of a matrix, or the real and imaginary\n   *   parts of a complex number. This callback can be used to override the\n   *   built-in numeric notation with any type of formatting. Function `callback`\n   *   is called with `value` as parameter and must return a string.\n   *\n   * When `value` is an Object:\n   *\n   * - When the object contains a property `format` being a function, this function\n   *   is invoked as `value.format(options)` and the result is returned.\n   * - When the object has its own `toString` method, this method is invoked\n   *   and the result is returned.\n   * - In other cases the function will loop over all object properties and\n   *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n   *\n   * When value is a function:\n   *\n   * - When the function has a property `syntax`, it returns this\n   *   syntax description.\n   * - In other cases, a string `'function'` is returned.\n   *\n   * Examples:\n   *\n   *    math.format(6.4)                                        // returns '6.4'\n   *    math.format(1240000)                                    // returns '1.24e6'\n   *    math.format(1/3)                                        // returns '0.3333333333333333'\n   *    math.format(1/3, 3)                                     // returns '0.333'\n   *    math.format(21385, 2)                                   // returns '21000'\n   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'\n   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'\n   *    math.format(12400,{notation: 'engineering'})            // returns '12.400e+3'\n   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'\n   *\n   *    function formatCurrency(value) {\n   *      // return currency notation with two digits:\n   *      return '$' + value.toFixed(2)\n   *\n   *      // you could also use math.format inside the callback:\n   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})\n   *    }\n   *    math.format([2.1, 3, 0.016], formatCurrency}            // returns '[$2.10, $3.00, $0.02]'\n   *\n   * See also:\n   *\n   *    print\n   *\n   * @param {*} value                               Value to be stringified\n   * @param {Object | Function | number} [options]  Formatting options\n   * @return {string} The formatted value\n   */\n  var format = typed('format', {\n    'any': string.format,\n    'any, Object | function | number': string.format\n  });\n  format.toTex = undefined; // use default template\n\n  return format;\n}\n\nexports.name = 'format';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./format'), require('./print')];","'use strict';\n\nvar isString = require('../../utils/string').isString;\n\nvar format = require('../../utils/string').format;\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Interpolate values into a string template.\n   *\n   * Syntax:\n   *\n   *     math.print(template, values)\n   *     math.print(template, values, precision)\n   *     math.print(template, values, options)\n   *\n   * Example usage:\n   *\n   *     // the following outputs: 'Lucy is 5 years old'\n   *     math.print('Lucy is $age years old', {age: 5})\n   *\n   *     // the following outputs: 'The value of pi is 3.141592654'\n   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)\n   *\n   *     // the following outputs: 'hello Mary! The date is 2013-03-23'\n   *     math.print('Hello $user.name! The date is $date', {\n   *       user: {\n   *         name: 'Mary',\n   *       },\n   *       date: new Date(2013, 2, 23).toISOString().substring(0, 10)\n   *     })\n   *\n   *     // the following outputs: 'My favorite fruits are apples and bananas !'\n   *     math.print('My favorite fruits are $0 and $1 !', [\n   *       'apples',\n   *       'bananas'\n   *     ])\n   *\n   * See also:\n   *\n   *     format\n   *\n   * @param {string} template           A string containing variable placeholders.\n   * @param {Object | Array | Matrix}   values An object or array containing variables\n   *                                    which will be filled in in the template.\n   * @param {number | Object} [options] Formatting options,\n   *                                    or the number of digits to format numbers.\n   *                                    See function math.format for a description\n   *                                    of all options.\n   * @return {string} Interpolated string\n   */\n  var print = typed('print', {\n    // note: Matrix will be converted automatically to an Array\n    'string, Object | Array': _print,\n    'string, Object | Array, number | Object': _print\n  });\n  print.toTex = undefined; // use default template\n\n  return print;\n}\n/**\n * Interpolate values into a string template.\n * @param {string} template\n * @param {Object} values\n * @param {number | Object} [options]\n * @returns {string} Interpolated string\n * @private\n */\n\n\nfunction _print(template, values, options) {\n  return template.replace(/\\$([\\w.]+)/g, function (original, key) {\n    var keys = key.split('.');\n    var value = values[keys.shift()];\n\n    while (keys.length && value !== undefined) {\n      var k = keys.shift();\n      value = k ? value[k] : value + '.';\n    }\n\n    if (value !== undefined) {\n      if (!isString(value)) {\n        return format(value, options);\n      } else {\n        return value;\n      }\n    }\n\n    return original;\n  });\n}\n\nexports.name = 'print';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the inverse cosine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acos(x)\n   *\n   * Examples:\n   *\n   *    math.acos(0.5)           // returns number 1.0471975511965979\n   *    math.acos(math.cos(1.5)) // returns number 1.5\n   *\n   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    cos, atan, asin\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} The arc cosine of x\n   */\n  var acos = typed('acos', {\n    'number': function number(x) {\n      if (x >= -1 && x <= 1 || config.predictable) {\n        return Math.acos(x);\n      } else {\n        return new type.Complex(x, 0).acos();\n      }\n    },\n    'Complex': function Complex(x) {\n      return x.acos();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.acos();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, acos);\n    }\n  });\n  acos.toTex = {\n    1: \"\\\\cos^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return acos;\n}\n\nexports.name = 'acos';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic arccos of a value,\n   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acosh(x)\n   *\n   * Examples:\n   *\n   *    math.acosh(1.5)       // returns 0.9624236501192069\n   *\n   * See also:\n   *\n   *    cosh, asinh, atanh\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arccosine of x\n   */\n  var acosh = typed('acosh', {\n    'number': function number(x) {\n      if (x >= 1 || config.predictable) {\n        return _acosh(x);\n      }\n\n      if (x <= -1) {\n        return new type.Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);\n      }\n\n      return new type.Complex(x, 0).acosh();\n    },\n    'Complex': function Complex(x) {\n      return x.acosh();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.acosh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, acosh);\n    }\n  });\n  acosh.toTex = {\n    1: \"\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return acosh;\n}\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n * @private\n */\n\n\nvar _acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\n\nexports.name = 'acosh';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acot(x)\n   *\n   * Examples:\n   *\n   *    math.acot(0.5)           // returns number 0.4636476090008061\n   *    math.acot(math.cot(1.5)) // returns number 1.5\n   *\n   *    math.acot(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    cot, atan\n   *\n   * @param {number | Complex | Array | Matrix} x   Function input\n   * @return {number | Complex | Array | Matrix} The arc cotangent of x\n   */\n  var acot = typed('acot', {\n    'number': function number(x) {\n      return Math.atan(1 / x);\n    },\n    'Complex': function Complex(x) {\n      return x.acot();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x).atan();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, acot);\n    }\n  });\n  acot.toTex = {\n    1: \"\\\\cot^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return acot;\n}\n\nexports.name = 'acot';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic arccotangent of a value,\n   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acoth(x)\n   *\n   * Examples:\n   *\n   *    math.acoth(0.5)       // returns 0.8047189562170503\n   *\n   * See also:\n   *\n   *    acsch, asech\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arccotangent of x\n   */\n  var acoth = typed('acoth', {\n    'number': function number(x) {\n      if (x >= 1 || x <= -1 || config.predictable) {\n        return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;\n      }\n\n      return new type.Complex(x, 0).acoth();\n    },\n    'Complex': function Complex(x) {\n      return x.acoth();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x).atanh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, acoth);\n    }\n  });\n  acoth.toTex = {\n    1: \"\\\\coth^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return acoth;\n}\n\nexports.name = 'acoth';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acsc(x)\n   *\n   * Examples:\n   *\n   *    math.acsc(0.5)           // returns number 0.5235987755982989\n   *    math.acsc(math.csc(1.5)) // returns number ~1.5\n   *\n   *    math.acsc(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    csc, asin, asec\n   *\n   * @param {number | Complex | Array | Matrix} x   Function input\n   * @return {number | Complex | Array | Matrix} The arc cosecant of x\n   */\n  var acsc = typed('acsc', {\n    'number': function number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return Math.asin(1 / x);\n      }\n\n      return new type.Complex(x, 0).acsc();\n    },\n    'Complex': function Complex(x) {\n      return x.acsc();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x).asin();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, acsc);\n    }\n  });\n  acsc.toTex = {\n    1: \"\\\\csc^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return acsc;\n}\n\nexports.name = 'acsc';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic arccosecant of a value,\n   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acsch(x)\n   *\n   * Examples:\n   *\n   *    math.acsch(0.5)       // returns 1.4436354751788103\n   *\n   * See also:\n   *\n   *    asech, acoth\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arccosecant of x\n   */\n  var acsch = typed('acsch', {\n    'number': function number(x) {\n      x = 1 / x;\n      return Math.log(x + Math.sqrt(x * x + 1));\n    },\n    'Complex': function Complex(x) {\n      return x.acsch();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x).asinh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, acsch);\n    }\n  });\n  acsch.toTex = {\n    1: \"\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return acsch;\n}\n\nexports.name = 'acsch';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asec(x)\n   *\n   * Examples:\n   *\n   *    math.asec(0.5)           // returns 1.0471975511965979\n   *    math.asec(math.sec(1.5)) // returns 1.5\n   *\n   *    math.asec(2)             // returns 0 + 1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    acos, acot, acsc\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} The arc secant of x\n   */\n  var asec = typed('asec', {\n    'number': function number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return Math.acos(1 / x);\n      }\n\n      return new type.Complex(x, 0).asec();\n    },\n    'Complex': function Complex(x) {\n      return x.asec();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x).acos();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, asec);\n    }\n  });\n  asec.toTex = {\n    1: \"\\\\sec^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return asec;\n}\n\nexports.name = 'asec';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic arcsecant of a value,\n   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asech(x)\n   *\n   * Examples:\n   *\n   *    math.asech(0.5)       // returns 1.3169578969248166\n   *\n   * See also:\n   *\n   *    acsch, acoth\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arcsecant of x\n   */\n  var asech = typed('asech', {\n    'number': function number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        x = 1 / x;\n        var ret = Math.sqrt(x * x - 1);\n\n        if (x > 0 || config.predictable) {\n          return Math.log(ret + x);\n        }\n\n        return new type.Complex(Math.log(ret - x), Math.PI);\n      }\n\n      return new type.Complex(x, 0).asech();\n    },\n    'Complex': function Complex(x) {\n      return x.asech();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x).acosh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, asech);\n    }\n  });\n  asech.toTex = {\n    1: \"\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return asech;\n}\n\nexports.name = 'asech';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the inverse sine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asin(x)\n   *\n   * Examples:\n   *\n   *    math.asin(0.5)           // returns number 0.5235987755982989\n   *    math.asin(math.sin(1.5)) // returns number ~1.5\n   *\n   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    sin, atan, acos\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} The arc sine of x\n   */\n  var asin = typed('asin', {\n    'number': function number(x) {\n      if (x >= -1 && x <= 1 || config.predictable) {\n        return Math.asin(x);\n      } else {\n        return new type.Complex(x, 0).asin();\n      }\n    },\n    'Complex': function Complex(x) {\n      return x.asin();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.asin();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since asin(0) = 0\n      return deepMap(x, asin, true);\n    }\n  });\n  asin.toTex = {\n    1: \"\\\\sin^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return asin;\n}\n\nexports.name = 'asin';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic arcsine of a value,\n   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.asinh(x)\n   *\n   * Examples:\n   *\n   *    math.asinh(0.5)       // returns 0.48121182505960347\n   *\n   * See also:\n   *\n   *    acosh, atanh\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arcsine of x\n   */\n  var asinh = typed('asinh', {\n    'number': Math.asinh || function (x) {\n      return Math.log(Math.sqrt(x * x + 1) + x);\n    },\n    'Complex': function Complex(x) {\n      return x.asinh();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.asinh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since asinh(0) = 0\n      return deepMap(x, asinh, true);\n    }\n  });\n  asinh.toTex = {\n    1: \"\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return asinh;\n}\n\nexports.name = 'asinh';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the inverse tangent of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atan(x)\n   *\n   * Examples:\n   *\n   *    math.atan(0.5)           // returns number 0.4636476090008061\n   *    math.atan(math.tan(1.5)) // returns number 1.5\n   *\n   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    tan, asin, acos\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x   Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} The arc tangent of x\n   */\n  var atan = typed('atan', {\n    'number': function number(x) {\n      return Math.atan(x);\n    },\n    'Complex': function Complex(x) {\n      return x.atan();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.atan();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since atan(0) = 0\n      return deepMap(x, atan, true);\n    }\n  });\n  atan.toTex = {\n    1: \"\\\\tan^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return atan;\n}\n\nexports.name = 'atan';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm02 = load(require('../../type/matrix/utils/algorithm02'));\n  var algorithm03 = load(require('../../type/matrix/utils/algorithm03'));\n  var algorithm09 = load(require('../../type/matrix/utils/algorithm09'));\n  var algorithm11 = load(require('../../type/matrix/utils/algorithm11'));\n  var algorithm12 = load(require('../../type/matrix/utils/algorithm12'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Calculate the inverse tangent function with two arguments, y/x.\n   * By providing two arguments, the right quadrant of the computed angle can be\n   * determined.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atan2(y, x)\n   *\n   * Examples:\n   *\n   *    math.atan2(2, 2) / math.pi       // returns number 0.25\n   *\n   *    const angle = math.unit(60, 'deg') // returns Unit 60 deg\n   *    const x = math.cos(angle)\n   *    const y = math.sin(angle)\n   *\n   *    math.atan(2)             // returns Complex 1.5707963267948966 -1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    tan, atan, sin, cos\n   *\n   * @param {number | Array | Matrix} y  Second dimension\n   * @param {number | Array | Matrix} x  First dimension\n   * @return {number | Array | Matrix} Four-quadrant inverse tangent\n   */\n\n  var atan2 = typed('atan2', {\n    'number, number': Math.atan2,\n    // Complex numbers doesn't seem to have a reasonable implementation of\n    // atan2(). Even Matlab removed the support, after they only calculated\n    // the atan only on base of the real part of the numbers and ignored the imaginary.\n    'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {\n      return type.BigNumber.atan2(y, x);\n    },\n    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {\n      return algorithm09(x, y, atan2, false);\n    },\n    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {\n      // mind the order of y and x!\n      return algorithm02(y, x, atan2, true);\n    },\n    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {\n      return algorithm03(x, y, atan2, false);\n    },\n    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n      return algorithm13(x, y, atan2);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      return atan2(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      return atan2(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      return atan2(x, matrix(y));\n    },\n    'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {\n      return algorithm11(x, y, atan2, false);\n    },\n    'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {\n      return algorithm14(x, y, atan2, false);\n    },\n    'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {\n      // mind the order of y and x\n      return algorithm12(y, x, atan2, true);\n    },\n    'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {\n      // mind the order of y and x\n      return algorithm14(y, x, atan2, true);\n    },\n    'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {\n      return algorithm14(matrix(x), y, atan2, false).valueOf();\n    },\n    'number | BigNumber, Array': function numberBigNumberArray(x, y) {\n      return algorithm14(matrix(y), x, atan2, true).valueOf();\n    }\n  });\n  atan2.toTex = {\n    2: \"\\\\mathrm{atan2}\\\\left(${args}\\\\right)\"\n  };\n  return atan2;\n}\n\nexports.name = 'atan2';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic arctangent of a value,\n   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atanh(x)\n   *\n   * Examples:\n   *\n   *    math.atanh(0.5)       // returns 0.5493061443340549\n   *\n   * See also:\n   *\n   *    acosh, asinh\n   *\n   * @param {number | Complex | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic arctangent of x\n   */\n  var atanh = typed('atanh', {\n    'number': function number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        return _atanh(x);\n      }\n\n      return new type.Complex(x, 0).atanh();\n    },\n    'Complex': function Complex(x) {\n      return x.atanh();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.atanh();\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since atanh(0) = 0\n      return deepMap(x, atanh, true);\n    }\n  });\n  atanh.toTex = {\n    1: \"\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)\"\n  };\n  return atanh;\n}\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n * @private\n */\n\n\nvar _atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n\nexports.name = 'atanh';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the cosine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cos(x)\n   *\n   * Examples:\n   *\n   *    math.cos(2)                      // returns number -0.4161468365471422\n   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475\n   *    math.cos(math.unit(180, 'deg'))  // returns number -1\n   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Cosine of x\n   */\n  var cos = typed('cos', {\n    'number': Math.cos,\n    'Complex': function Complex(x) {\n      return x.cos();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.cos();\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cos is no angle');\n      }\n\n      return cos(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, cos);\n    }\n  });\n  cos.toTex = {\n    1: \"\\\\cos\\\\left(${args[0]}\\\\right)\"\n  };\n  return cos;\n}\n\nexports.name = 'cos';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic cosine of a value,\n   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cosh(x)\n   *\n   * Examples:\n   *\n   *    math.cosh(0.5)       // returns number 1.1276259652063807\n   *\n   * See also:\n   *\n   *    sinh, tanh\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic cosine of x\n   */\n  var cosh = typed('cosh', {\n    'number': _cosh,\n    'Complex': function Complex(x) {\n      return x.cosh();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.cosh();\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cosh is no angle');\n      }\n\n      return cosh(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, cosh);\n    }\n  });\n  cosh.toTex = {\n    1: \"\\\\cosh\\\\left(${args[0]}\\\\right)\"\n  };\n  return cosh;\n}\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n * @private\n */\n\n\nvar _cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\nexports.name = 'cosh';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.cot(x)\n   *\n   * Examples:\n   *\n   *    math.cot(2)      // returns number -0.45765755436028577\n   *    1 / math.tan(2)  // returns number -0.45765755436028577\n   *\n   * See also:\n   *\n   *    tan, sec, csc\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Cotangent of x\n   */\n  var cot = typed('cot', {\n    'number': function number(x) {\n      return 1 / Math.tan(x);\n    },\n    'Complex': function Complex(x) {\n      return x.cot();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x.tan());\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle');\n      }\n\n      return cot(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, cot);\n    }\n  });\n  cot.toTex = {\n    1: \"\\\\cot\\\\left(${args[0]}\\\\right)\"\n  };\n  return cot;\n}\n\nexports.name = 'cot';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic cotangent of a value,\n   * defined as `coth(x) = 1 / tanh(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.coth(x)\n   *\n   * Examples:\n   *\n   *    // coth(x) = 1 / tanh(x)\n   *    math.coth(2)         // returns 1.0373147207275482\n   *    1 / math.tanh(2)     // returns 1.0373147207275482\n   *\n   * See also:\n   *\n   *    sinh, tanh, cosh\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic cotangent of x\n   */\n  var coth = typed('coth', {\n    'number': _coth,\n    'Complex': function Complex(x) {\n      return x.coth();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x.tanh());\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function coth is no angle');\n      }\n\n      return coth(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, coth);\n    }\n  });\n  coth.toTex = {\n    1: \"\\\\coth\\\\left(${args[0]}\\\\right)\"\n  };\n  return coth;\n}\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n * @private\n */\n\n\nfunction _coth(x) {\n  var e = Math.exp(2 * x);\n  return (e + 1) / (e - 1);\n}\n\nexports.name = 'coth';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.csc(x)\n   *\n   * Examples:\n   *\n   *    math.csc(2)      // returns number 1.099750170294617\n   *    1 / math.sin(2)  // returns number 1.099750170294617\n   *\n   * See also:\n   *\n   *    sin, sec, cot\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Cosecant of x\n   */\n  var csc = typed('csc', {\n    'number': function number(x) {\n      return 1 / Math.sin(x);\n    },\n    'Complex': function Complex(x) {\n      return x.csc();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x.sin());\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csc is no angle');\n      }\n\n      return csc(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, csc);\n    }\n  });\n  csc.toTex = {\n    1: \"\\\\csc\\\\left(${args[0]}\\\\right)\"\n  };\n  return csc;\n}\n\nexports.name = 'csc';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar sign = require('../../utils/number').sign;\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic cosecant of a value,\n   * defined as `csch(x) = 1 / sinh(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.csch(x)\n   *\n   * Examples:\n   *\n   *    // csch(x) = 1/ sinh(x)\n   *    math.csch(0.5)       // returns 1.9190347513349437\n   *    1 / math.sinh(0.5)   // returns 1.9190347513349437\n   *\n   * See also:\n   *\n   *    sinh, sech, coth\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic cosecant of x\n   */\n  var csch = typed('csch', {\n    'number': _csch,\n    'Complex': function Complex(x) {\n      return x.csch();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x.sinh());\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function csch is no angle');\n      }\n\n      return csch(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, csch);\n    }\n  });\n  csch.toTex = {\n    1: \"\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)\"\n  };\n  return csch;\n}\n/**\n * Calculate the hyperbolic cosecant of a number\n * @param {number} x\n * @returns {number}\n * @private\n */\n\n\nfunction _csch(x) {\n  // consider values close to zero (+/-)\n  if (x === 0) {\n    return Number.POSITIVE_INFINITY;\n  } else {\n    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * sign(x);\n  }\n}\n\nexports.name = 'csch';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./acos'), require('./acosh'), require('./acot'), require('./acoth'), require('./acsc'), require('./acsch'), require('./asec'), require('./asech'), require('./asin'), require('./asinh'), require('./atan'), require('./atan2'), require('./atanh'), require('./cos'), require('./cosh'), require('./cot'), require('./coth'), require('./csc'), require('./csch'), require('./sec'), require('./sech'), require('./sin'), require('./sinh'), require('./tan'), require('./tanh')];","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sec(x)\n   *\n   * Examples:\n   *\n   *    math.sec(2)      // returns number -2.4029979617223822\n   *    1 / math.cos(2)  // returns number -2.4029979617223822\n   *\n   * See also:\n   *\n   *    cos, csc, cot\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Secant of x\n   */\n  var sec = typed('sec', {\n    'number': function number(x) {\n      return 1 / Math.cos(x);\n    },\n    'Complex': function Complex(x) {\n      return x.sec();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x.cos());\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sec is no angle');\n      }\n\n      return sec(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, sec);\n    }\n  });\n  sec.toTex = {\n    1: \"\\\\sec\\\\left(${args[0]}\\\\right)\"\n  };\n  return sec;\n}\n\nexports.name = 'sec';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic secant of a value,\n   * defined as `sech(x) = 1 / cosh(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sech(x)\n   *\n   * Examples:\n   *\n   *    // sech(x) = 1/ cosh(x)\n   *    math.sech(0.5)       // returns 0.886818883970074\n   *    1 / math.cosh(0.5)   // returns 0.886818883970074\n   *\n   * See also:\n   *\n   *    cosh, csch, coth\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Hyperbolic secant of x\n   */\n  var sech = typed('sech', {\n    'number': _sech,\n    'Complex': function Complex(x) {\n      return x.sech();\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.BigNumber(1).div(x.cosh());\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sech is no angle');\n      }\n\n      return sech(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, sech);\n    }\n  });\n  sech.toTex = {\n    1: \"\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)\"\n  };\n  return sech;\n}\n/**\n * Calculate the hyperbolic secant of a number\n * @param {number} x\n * @returns {number}\n * @private\n */\n\n\nfunction _sech(x) {\n  return 2 / (Math.exp(x) + Math.exp(-x));\n}\n\nexports.name = 'sech';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the sine of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sin(x)\n   *\n   * Examples:\n   *\n   *    math.sin(2)                      // returns number 0.9092974268256813\n   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475\n   *    math.sin(math.unit(90, 'deg'))   // returns number 1\n   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number ~1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Sine of x\n   */\n  var sin = typed('sin', {\n    'number': Math.sin,\n    'Complex': function Complex(x) {\n      return x.sin();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.sin();\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sin is no angle');\n      }\n\n      return sin(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sin(0) = 0\n      return deepMap(x, sin, true);\n    }\n  });\n  sin.toTex = {\n    1: \"\\\\sin\\\\left(${args[0]}\\\\right)\"\n  };\n  return sin;\n}\n\nexports.name = 'sin';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic sine of a value,\n   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sinh(x)\n   *\n   * Examples:\n   *\n   *    math.sinh(0.5)       // returns number 0.5210953054937474\n   *\n   * See also:\n   *\n   *    cosh, tanh\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic sine of x\n   */\n  var sinh = typed('sinh', {\n    'number': _sinh,\n    'Complex': function Complex(x) {\n      return x.sinh();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.sinh();\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function sinh is no angle');\n      }\n\n      return sinh(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since sinh(0) = 0\n      return deepMap(x, sinh, true);\n    }\n  });\n  sinh.toTex = {\n    1: \"\\\\sinh\\\\left(${args[0]}\\\\right)\"\n  };\n  return sinh;\n}\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n * @private\n */\n\n\nvar _sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\nexports.name = 'sinh';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.tan(x)\n   *\n   * Examples:\n   *\n   *    math.tan(0.5)                    // returns number 0.5463024898437905\n   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905\n   *    math.tan(math.pi / 4)            // returns number 1\n   *    math.tan(math.unit(45, 'deg'))   // returns number 1\n   *\n   * See also:\n   *\n   *    atan, sin, cos\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Tangent of x\n   */\n  var tan = typed('tan', {\n    'number': Math.tan,\n    'Complex': function Complex(x) {\n      return x.tan();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.tan();\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tan is no angle');\n      }\n\n      return tan(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since tan(0) = 0\n      return deepMap(x, tan, true);\n    }\n  });\n  tan.toTex = {\n    1: \"\\\\tan\\\\left(${args[0]}\\\\right)\"\n  };\n  return tan;\n}\n\nexports.name = 'tan';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Calculate the hyperbolic tangent of a value,\n   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.tanh(x)\n   *\n   * Examples:\n   *\n   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)\n   *    math.tanh(0.5)                   // returns 0.46211715726000974\n   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974\n   *    1 / math.coth(0.5)               // returns 0.46211715726000974\n   *\n   * See also:\n   *\n   *    sinh, cosh, coth\n   *\n   * @param {number | BigNumber | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | BigNumber | Complex | Array | Matrix} Hyperbolic tangent of x\n   */\n  var tanh = typed('tanh', {\n    'number': _tanh,\n    'Complex': function Complex(x) {\n      return x.tanh();\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.tanh();\n    },\n    'Unit': function Unit(x) {\n      if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function tanh is no angle');\n      }\n\n      return tanh(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      // deep map collection, skip zeros since tanh(0) = 0\n      return deepMap(x, tanh, true);\n    }\n  });\n  tanh.toTex = {\n    1: \"\\\\tanh\\\\left(${args[0]}\\\\right)\"\n  };\n  return tanh;\n}\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n * @private\n */\n\n\nvar _tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};\n\nexports.name = 'tanh';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./to')];","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../utils/latex');\n\n  var matrix = load(require('../../type/matrix/function/matrix'));\n  var algorithm13 = load(require('../../type/matrix/utils/algorithm13'));\n  var algorithm14 = load(require('../../type/matrix/utils/algorithm14'));\n  /**\n   * Change the unit of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.to(x, unit)\n   *\n   * Examples:\n   *\n   *    math.to(math.unit('2 inch'), 'cm')                   // returns Unit 5.08 cm\n   *    math.to(math.unit('2 inch'), math.unit(null, 'cm'))  // returns Unit 5.08 cm\n   *    math.to(math.unit(16, 'bytes'), 'bits')              // returns Unit 128 bits\n   *\n   * See also:\n   *\n   *    unit\n   *\n   * @param {Unit | Array | Matrix} x     The unit to be converted.\n   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like \"cm\"\n   *                                      or a unit without value.\n   * @return {Unit | Array | Matrix} value with changed, fixed unit.\n   */\n\n  var to = typed('to', {\n    'Unit, Unit | string': function UnitUnitString(x, unit) {\n      return x.to(unit);\n    },\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm13(x, y, to);\n    },\n    'Array, Array': function ArrayArray(x, y) {\n      // use matrix implementation\n      return to(matrix(x), matrix(y)).valueOf();\n    },\n    'Array, Matrix': function ArrayMatrix(x, y) {\n      // use matrix implementation\n      return to(matrix(x), y);\n    },\n    'Matrix, Array': function MatrixArray(x, y) {\n      // use matrix implementation\n      return to(x, matrix(y));\n    },\n    'Matrix, any': function MatrixAny(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(x, y, to, false);\n    },\n    'any, Matrix': function anyMatrix(x, y) {\n      // SparseMatrix does not support Units\n      return algorithm14(y, x, to, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(x), y, to, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return algorithm14(matrix(y), x, to, true).valueOf();\n    }\n  });\n  to.toTex = {\n    2: \"\\\\left(${args[0]}\".concat(latex.operators['to'], \"${args[1]}\\\\right)\")\n  };\n  return to;\n}\n\nexports.name = 'to';\nexports.factory = factory;","'use strict';\n\nvar object = require('../../utils/object');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Clone an object.\n   *\n   * Syntax:\n   *\n   *     math.clone(x)\n   *\n   * Examples:\n   *\n   *    math.clone(3.5)                   // returns number 3.5\n   *    math.clone(math.complex('2-4i') // returns Complex 2 - 4i\n   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg\n   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]\n   *    math.clone(\"hello world\")         // returns string \"hello world\"\n   *\n   * @param {*} x   Object to be cloned\n   * @return {*} A clone of object x\n   */\n  var clone = typed('clone', {\n    'any': object.clone\n  });\n  clone.toTex = undefined; // use default template\n\n  return clone;\n}\n\nexports.name = 'clone';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var isNumeric = load(require('./isNumeric'));\n  /**\n   * Test whether a value is an numeric value.\n   *\n   * In case of a string, true is returned if the string contains a numeric value.\n   *\n   * Syntax:\n   *\n   *     math.hasNumericValue(x)\n   *\n   * Examples:\n   *\n   *    math.hasNumericValue(2)                     // returns true\n   *    math.hasNumericValue('2')                   // returns true\n   *    math.isNumeric('2')                         // returns false\n   *    math.hasNumericValue(0)                     // returns true\n   *    math.hasNumericValue(math.bignumber(500))   // returns true\n   *    math.hasNumericValue(math.fraction(4))      // returns true\n   *    math.hasNumericValue(math.complex('2-4i')   // returns false\n   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    isZero, isPositive, isNegative, isInteger, isNumeric\n   *\n   * @param {*} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,\n   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.\n   *                    Throws an error in case of unknown types.\n   */\n\n  var hasNumericValue = typed('hasNumericValue', {\n    'string': function string(x) {\n      return x.trim().length > 0 && !isNaN(Number(x));\n    },\n    'any': function any(x) {\n      return isNumeric(x);\n    }\n  });\n  return hasNumericValue;\n}\n\nexports.name = 'hasNumericValue';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./clone'), require('./isInteger'), require('./isNegative'), require('./isNumeric'), require('./hasNumericValue'), require('./isPositive'), require('./isPrime'), require('./isZero'), require('./isNaN'), require('./typeof')];","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nvar number = require('../../utils/number');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is an integer number.\n   * The function supports `number`, `BigNumber`, and `Fraction`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isInteger(x)\n   *\n   * Examples:\n   *\n   *    math.isInteger(2)                     // returns true\n   *    math.isInteger(0)                     // returns true\n   *    math.isInteger(0.5)                   // returns false\n   *    math.isInteger(math.bignumber(500))   // returns true\n   *    math.isInteger(math.fraction(4))      // returns true\n   *    math.isInteger('3')                   // returns true\n   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]\n   *    math.isInteger(math.complex('2-4i')   // throws an error\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | Fraction | Array | Matrix} x   Value to be tested\n   * @return {boolean}  Returns true when `x` contains a numeric, integer value.\n   *                    Throws an error in case of an unknown data type.\n   */\n  var isInteger = typed('isInteger', {\n    'number': number.isInteger,\n    // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n    'BigNumber': function BigNumber(x) {\n      return x.isInt();\n    },\n    'Fraction': function Fraction(x) {\n      return x.d === 1 && isFinite(x.n);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, isInteger);\n    }\n  });\n  return isInteger;\n}\n\nexports.name = 'isInteger';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is NaN (not a number).\n   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNaN(x)\n   *\n   * Examples:\n   *\n   *    math.isNaN(3)                     // returns false\n   *    math.isNaN(NaN)                   // returns true\n   *    math.isNaN(0)                     // returns false\n   *    math.isNaN(math.bignumber(NaN))   // returns true\n   *    math.isNaN(math.bignumber(0))     // returns false\n   *    math.isNaN(math.fraction(-2, 5))  // returns false\n   *    math.isNaN('-2')                  // returns false\n   *    math.isNaN([2, 0, -3, NaN]')      // returns [false, false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isNegative, isPositive, isZero, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is NaN.\n   *                    Throws an error in case of an unknown data type.\n   */\n  var isNaN = typed('isNaN', {\n    'number': function number(x) {\n      return Number.isNaN(x);\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.isNaN();\n    },\n    'Fraction': function Fraction(x) {\n      return false;\n    },\n    'Complex': function Complex(x) {\n      return x.isNaN();\n    },\n    'Unit': function Unit(x) {\n      return Number.isNaN(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, Number.isNaN);\n    }\n  });\n  return isNaN;\n}\n\nexports.name = 'isNaN';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is negative: smaller than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNegative(x)\n   *\n   * Examples:\n   *\n   *    math.isNegative(3)                     // returns false\n   *    math.isNegative(-2)                    // returns true\n   *    math.isNegative(0)                     // returns false\n   *    math.isNegative(-0)                    // returns false\n   *    math.isNegative(math.bignumber(2))     // returns false\n   *    math.isNegative(math.fraction(-2, 5))  // returns true\n   *    math.isNegative('-2')                  // returns true\n   *    math.isNegative([2, 0, -3]')           // returns [false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isZero, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  var isNegative = typed('isNegative', {\n    'number': function number(x) {\n      return x < 0;\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    'Fraction': function Fraction(x) {\n      return x.s < 0; // It's enough to decide on the sign\n    },\n    'Unit': function Unit(x) {\n      return isNegative(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, isNegative);\n    }\n  });\n  return isNegative;\n}\n\nexports.name = 'isNegative';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is an numeric value.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNumeric(x)\n   *\n   * Examples:\n   *\n   *    math.isNumeric(2)                     // returns true\n   *    math.isNumeric('2')                   // returns true\n   *    math.hasNumericValue('2')             // returns true\n   *    math.isNumeric(0)                     // returns true\n   *    math.isNumeric(math.bignumber(500))   // returns true\n   *    math.isNumeric(math.fraction(4))      // returns true\n   *    math.isNumeric(math.complex('2-4i')   // returns false\n   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    isZero, isPositive, isNegative, isInteger, hasNumericValue\n   *\n   * @param {*} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,\n   *                    `Fraction`, or `boolean`. Returns false for other types.\n   *                    Throws an error in case of unknown types.\n   */\n  var isNumeric = typed('isNumeric', {\n    'number | BigNumber | Fraction | boolean': function numberBigNumberFractionBoolean() {\n      return true;\n    },\n    'Complex | Unit | string | null | undefined | Node': function ComplexUnitStringNullUndefinedNode() {\n      return false;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, isNumeric);\n    }\n  });\n  return isNumeric;\n}\n\nexports.name = 'isNumeric';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is positive: larger than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPositive(x)\n   *\n   * Examples:\n   *\n   *    math.isPositive(3)                     // returns true\n   *    math.isPositive(-2)                    // returns false\n   *    math.isPositive(0)                     // returns false\n   *    math.isPositive(-0)                    // returns false\n   *    math.isPositive(0.5)                   // returns true\n   *    math.isPositive(math.bignumber(2))     // returns true\n   *    math.isPositive(math.fraction(-2, 5))  // returns false\n   *    math.isPositive(math.fraction(1,3))    // returns false\n   *    math.isPositive('2')                   // returns true\n   *    math.isPositive([2, 0, -3])            // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  var isPositive = typed('isPositive', {\n    'number': function number(x) {\n      return x > 0;\n    },\n    'BigNumber': function BigNumber(x) {\n      return !x.isNeg() && !x.isZero() && !x.isNaN();\n    },\n    'Fraction': function Fraction(x) {\n      return x.s > 0 && x.n > 0;\n    },\n    'Unit': function Unit(x) {\n      return isPositive(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, isPositive);\n    }\n  });\n  return isPositive;\n}\n\nexports.name = 'isPositive';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is prime: has no divisors other than itself and one.\n   * The function supports type `number`, `bignumber`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPrime(x)\n   *\n   * Examples:\n   *\n   *    math.isPrime(3)                     // returns true\n   *    math.isPrime(-2)                    // returns false\n   *    math.isPrime(0)                     // returns false\n   *    math.isPrime(-0)                    // returns false\n   *    math.isPrime(0.5)                   // returns false\n   *    math.isPrime('2')                   // returns true\n   *    math.isPrime([2, 17, 100])           // returns [true, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  var isPrime = typed('isPrime', {\n    'number': function number(x) {\n      if (x < 2) {\n        return false;\n      }\n\n      if (x === 2) {\n        return true;\n      }\n\n      if (x % 2 === 0) {\n        return false;\n      }\n\n      for (var i = 3; i * i <= x; i += 2) {\n        if (x % i === 0) {\n          return false;\n        }\n      }\n\n      return true;\n    },\n    'BigNumber': function BigNumber(x) {\n      if (x.lt(2)) {\n        return false;\n      }\n\n      if (x.equals(2)) {\n        return true;\n      }\n\n      if (x.mod(2).isZero()) {\n        return false;\n      }\n\n      for (var i = type.BigNumber(3); i.times(i).lte(x); i = i.plus(1)) {\n        if (x.mod(i).isZero()) {\n          return false;\n        }\n      }\n\n      return true;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, isPrime);\n    }\n  });\n  return isPrime;\n}\n\nexports.name = 'isPrime';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Test whether a value is zero.\n   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,\n   * `Complex`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isZero(x)\n   *\n   * Examples:\n   *\n   *    math.isZero(0)                     // returns true\n   *    math.isZero(2)                     // returns false\n   *    math.isZero(0.5)                   // returns false\n   *    math.isZero(math.bignumber(0))     // returns true\n   *    math.isZero(math.fraction(0))      // returns true\n   *    math.isZero(math.fraction(1,3))    // returns false\n   *    math.isZero(math.complex('2 - 4i') // returns false\n   *    math.isZero(math.complex('0i')     // returns true\n   *    math.isZero('0')                   // returns true\n   *    math.isZero('2')                   // returns false\n   *    math.isZero([2, 0, -3]')           // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isInteger\n   *\n   * @param {number | BigNumber | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  var isZero = typed('isZero', {\n    'number': function number(x) {\n      return x === 0;\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.isZero();\n    },\n    'Complex': function Complex(x) {\n      return x.re === 0 && x.im === 0;\n    },\n    'Fraction': function Fraction(x) {\n      return x.d === 1 && x.n === 0;\n    },\n    'Unit': function Unit(x) {\n      return isZero(x.value);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, isZero);\n    }\n  });\n  return isZero;\n}\n\nexports.name = 'isZero';\nexports.factory = factory;","'use strict';\n\nfunction _typeof2(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof2 = function _typeof2(obj) { return typeof obj; }; } else { _typeof2 = function _typeof2(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof2(obj); }\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Determine the type of a variable.\n   *\n   * Function `typeof` recognizes the following types of objects:\n   *\n   * Object                 | Returns       | Example\n   * ---------------------- | ------------- | ------------------------------------------\n   * null                   | `'null'`      | `math.typeof(null)`\n   * number                 | `'number'`    | `math.typeof(3.5)`\n   * boolean                | `'boolean'`   | `math.typeof(true)`\n   * string                 | `'string'`    | `math.typeof('hello world')`\n   * Array                  | `'Array'`     | `math.typeof([1, 2, 3])`\n   * Date                   | `'Date'`      | `math.typeof(new Date())`\n   * Function               | `'Function'`  | `math.typeof(function () {})`\n   * Object                 | `'Object'`    | `math.typeof({a: 2, b: 3})`\n   * RegExp                 | `'RegExp'`    | `math.typeof(/a regexp/)`\n   * undefined              | `'undefined'` | `math.typeof(undefined)`\n   * math.type.BigNumber    | `'BigNumber'` | `math.typeof(math.bignumber('2.3e500'))`\n   * math.type.Chain        | `'Chain'`     | `math.typeof(math.chain(2))`\n   * math.type.Complex      | `'Complex'`   | `math.typeof(math.complex(2, 3))`\n   * math.type.Fraction     | `'Fraction'`  | `math.typeof(math.fraction(1, 3))`\n   * math.type.Help         | `'Help'`      | `math.typeof(math.help('sqrt'))`\n   * math.type.Help         | `'Help'`      | `math.typeof(math.help('sqrt'))`\n   * math.type.Index        | `'Index'`     | `math.typeof(math.index(1, 3))`\n   * math.type.Matrix       | `'Matrix'`    | `math.typeof(math.matrix([[1,2], [3, 4]]))`\n   * math.type.Range        | `'Range'`     | `math.typeof(math.range(0, 10))`\n   * math.type.ResultSet    | `'ResultSet'` | `math.typeof(math.eval('a=2\\nb=3'))`\n   * math.type.Unit         | `'Unit'`      | `math.typeof(math.unit('45 deg'))`\n   * math.expression.node&#8203;.AccessorNode            | `'AccessorNode'`            | `math.typeof(math.parse('A[2]'))`\n   * math.expression.node&#8203;.ArrayNode               | `'ArrayNode'`               | `math.typeof(math.parse('[1,2,3]'))`\n   * math.expression.node&#8203;.AssignmentNode          | `'AssignmentNode'`          | `math.typeof(math.parse('x=2'))`\n   * math.expression.node&#8203;.BlockNode               | `'BlockNode'`               | `math.typeof(math.parse('a=2; b=3'))`\n   * math.expression.node&#8203;.ConditionalNode         | `'ConditionalNode'`         | `math.typeof(math.parse('x<0 ? -x : x'))`\n   * math.expression.node&#8203;.ConstantNode            | `'ConstantNode'`            | `math.typeof(math.parse('2.3'))`\n   * math.expression.node&#8203;.FunctionAssignmentNode  | `'FunctionAssignmentNode'`  | `math.typeof(math.parse('f(x)=x^2'))`\n   * math.expression.node&#8203;.FunctionNode            | `'FunctionNode'`            | `math.typeof(math.parse('sqrt(4)'))`\n   * math.expression.node&#8203;.IndexNode               | `'IndexNode'`               | `math.typeof(math.parse('A[2]').index)`\n   * math.expression.node&#8203;.ObjectNode              | `'ObjectNode'`              | `math.typeof(math.parse('{a:2}'))`\n   * math.expression.node&#8203;.ParenthesisNode         | `'ParenthesisNode'`         | `math.typeof(math.parse('(2+3)'))`\n   * math.expression.node&#8203;.RangeNode               | `'RangeNode'`               | `math.typeof(math.parse('1:10'))`\n   * math.expression.node&#8203;.SymbolNode              | `'SymbolNode'`              | `math.typeof(math.parse('x'))`\n   *\n   * Syntax:\n   *\n   *    math.typeof(x)\n   *\n   * Examples:\n   *\n   *    math.typeof(3.5)                     // returns 'number'\n   *    math.typeof(math.complex('2-4i'))    // returns 'Complex'\n   *    math.typeof(math.unit('45 deg'))     // returns 'Unit'\n   *    math.typeof('hello world')           // returns 'string'\n   *\n   * @param {*} x     The variable for which to test the type.\n   * @return {string} Returns the name of the type. Primitive types are lower case,\n   *                  non-primitive types are upper-camel-case.\n   *                  For example 'number', 'string', 'Array', 'Date'.\n   */\n  var _typeof = typed('_typeof', {\n    'any': function any(x) {\n      var t = _typeof2(x);\n\n      if (t === 'object') {\n        // JavaScript types\n        if (x === null) return 'null';\n        if (Array.isArray(x)) return 'Array';\n        if (x instanceof Date) return 'Date';\n        if (x instanceof RegExp) return 'RegExp'; // math.js types\n\n        if (type.isBigNumber(x)) return 'BigNumber';\n        if (type.isComplex(x)) return 'Complex';\n        if (type.isFraction(x)) return 'Fraction';\n        if (type.isMatrix(x)) return 'Matrix';\n        if (type.isUnit(x)) return 'Unit';\n        if (type.isIndex(x)) return 'Index';\n        if (type.isRange(x)) return 'Range';\n        if (type.isResultSet(x)) return 'ResultSet';\n        if (type.isNode(x)) return x.type;\n        if (type.isChain(x)) return 'Chain';\n        if (type.isHelp(x)) return 'Help';\n        return 'Object';\n      }\n\n      if (t === 'function') return 'Function';\n      return t; // can be 'string', 'number', 'boolean', ...\n    }\n  });\n\n  _typeof.toTex = undefined; // use default template\n\n  return _typeof;\n}\n\nexports.name = 'typeof';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [require('./reviver')];","'use strict';\n\nfunction factory(type, config, load, typed, math) {\n  /**\n   * Instantiate mathjs data types from their JSON representation\n   * @param {string} key\n   * @param {*} value\n   * @returns {*} Returns the revived object\n   */\n  return function reviver(key, value) {\n    var constructor = type[value && value.mathjs] || math.expression && math.expression.node[value && value.mathjs]; // TODO: instead of checking math.expression.node, expose all Node classes on math.type too\n\n    if (constructor && typeof constructor.fromJSON === 'function') {\n      return constructor.fromJSON(value);\n    }\n\n    return value;\n  };\n}\n\nexports.name = 'reviver';\nexports.path = 'json';\nexports.factory = factory;\nexports.math = true; // request the math namespace as fifth argument","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.factory = factory;\nexports.math = exports.path = exports.name = void 0;\n\nvar _decimal = _interopRequireDefault(require(\"decimal.js\"));\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction factory(type, config, load, typed, math) {\n  var BigNumber = _decimal.default.clone({\n    precision: config.precision\n  });\n  /**\n   * Attach type information\n   */\n\n\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\n  /**\n   * Get a JSON representation of a BigNumber containing\n   * type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   */\n\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    };\n  };\n  /**\n   * Instantiate a BigNumber from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   * @return {BigNumber}\n   */\n\n\n  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value);\n  }; // listen for changed in the configuration, automatically apply changed precision\n\n\n  math.on('config', function (curr, prev) {\n    if (curr.precision !== prev.precision) {\n      BigNumber.config({\n        precision: curr.precision\n      });\n    }\n  });\n  return BigNumber;\n}\n\nvar name = 'BigNumber';\nexports.name = name;\nvar path = 'type';\nexports.path = path;\nvar math = true; // request access to the math namespace\n\nexports.math = math;","'use strict';\n\nvar deepMap = require('../../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a BigNumber, which can store numbers with arbitrary precision.\n   * When a matrix is provided, all elements will be converted to BigNumber.\n   *\n   * Syntax:\n   *\n   *    math.bignumber(x)\n   *\n   * Examples:\n   *\n   *    0.1 + 0.2                                  // returns number 0.30000000000000004\n   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3\n   *\n   *\n   *    7.2e500                                    // returns number Infinity\n   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500\n   *\n   * See also:\n   *\n   *    boolean, complex, index, matrix, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix | boolean | null} [value]  Value for the big number,\n   *                                                    0 by default.\n   * @returns {BigNumber} The created bignumber\n   */\n  var bignumber = typed('bignumber', {\n    '': function _() {\n      return new type.BigNumber(0);\n    },\n    'number': function number(x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new type.BigNumber(x + '');\n    },\n    'string': function string(x) {\n      return new type.BigNumber(x);\n    },\n    'BigNumber': function BigNumber(x) {\n      // we assume a BigNumber is immutable\n      return x;\n    },\n    'Fraction': function Fraction(x) {\n      return new type.BigNumber(x.n).div(x.d).times(x.s);\n    },\n    'null': function _null(x) {\n      return new type.BigNumber(0);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, bignumber);\n    }\n  });\n  bignumber.toTex = {\n    0: '0',\n    1: \"\\\\left(${args[0]}\\\\right)\"\n  };\n  return bignumber;\n}\n\nexports.name = 'bignumber';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// type\nrequire('./BigNumber'), // construction function\nrequire('./function/bignumber')];","'use strict';\n\nvar deepMap = require('./../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a boolean or convert a string or number to a boolean.\n   * In case of a number, `true` is returned for non-zero numbers, and `false` in\n   * case of zero.\n   * Strings can be `'true'` or `'false'`, or can contain a number.\n   * When value is a matrix, all elements will be converted to boolean.\n   *\n   * Syntax:\n   *\n   *    math.boolean(x)\n   *\n   * Examples:\n   *\n   *    math.boolean(0)     // returns false\n   *    math.boolean(1)     // returns true\n   *    math.boolean(-3)     // returns true\n   *    math.boolean('true')     // returns true\n   *    math.boolean('false')     // returns false\n   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]\n   *\n   * See also:\n   *\n   *    bignumber, complex, index, matrix, string, unit\n   *\n   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type\n   * @return {boolean | Array | Matrix} The boolean value\n   */\n  var bool = typed('bool', {\n    '': function _() {\n      return false;\n    },\n    'boolean': function boolean(x) {\n      return x;\n    },\n    'number': function number(x) {\n      return !!x;\n    },\n    'null': function _null(x) {\n      return false;\n    },\n    'BigNumber': function BigNumber(x) {\n      return !x.isZero();\n    },\n    'string': function string(x) {\n      // try case insensitive\n      var lcase = x.toLowerCase();\n\n      if (lcase === 'true') {\n        return true;\n      } else if (lcase === 'false') {\n        return false;\n      } // test whether value is a valid number\n\n\n      var num = Number(x);\n\n      if (x !== '' && !isNaN(num)) {\n        return !!num;\n      }\n\n      throw new Error('Cannot convert \"' + x + '\" to a boolean');\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, bool);\n    }\n  });\n  return bool;\n}\n\nexports.name = 'boolean';\nexports.factory = factory;","'use strict';\n\nvar format = require('../../utils/string').format;\n\nvar lazy = require('../../utils/object').lazy;\n\nfunction factory(type, config, load, typed, math) {\n  /**\n   * @constructor Chain\n   * Wrap any value in a chain, allowing to perform chained operations on\n   * the value.\n   *\n   * All methods available in the math.js library can be called upon the chain,\n   * and then will be evaluated with the value itself as first argument.\n   * The chain can be closed by executing chain.done(), which will return\n   * the final value.\n   *\n   * The Chain has a number of special functions:\n   * - done()             Finalize the chained operation and return the\n   *                      chain's value.\n   * - valueOf()          The same as done()\n   * - toString()         Returns a string representation of the chain's value.\n   *\n   * @param {*} [value]\n   */\n  function Chain(value) {\n    if (!(this instanceof Chain)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (type.isChain(value)) {\n      this.value = value.value;\n    } else {\n      this.value = value;\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Chain.prototype.type = 'Chain';\n  Chain.prototype.isChain = true;\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method valueOf()\n   * @returns {*} value\n   */\n\n  Chain.prototype.done = function () {\n    return this.value;\n  };\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method done()\n   * @returns {*} value\n   */\n\n\n  Chain.prototype.valueOf = function () {\n    return this.value;\n  };\n  /**\n   * Get a string representation of the value in the chain\n   * @returns {string}\n   */\n\n\n  Chain.prototype.toString = function () {\n    return format(this.value);\n  };\n  /**\n   * Get a JSON representation of the chain\n   * @returns {Object}\n   */\n\n\n  Chain.prototype.toJSON = function () {\n    return {\n      mathjs: 'Chain',\n      value: this.value\n    };\n  };\n  /**\n   * Instantiate a Chain from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"Chain\", value: ...}`,\n   *                       where mathjs is optional\n   * @returns {Chain}\n   */\n\n\n  Chain.fromJSON = function (json) {\n    return new Chain(json.value);\n  };\n  /**\n   * Create a proxy method for the chain\n   * @param {string} name\n   * @param {Function} fn      The function to be proxied\n   *                           If fn is no function, it is silently ignored.\n   * @private\n   */\n\n\n  function createProxy(name, fn) {\n    if (typeof fn === 'function') {\n      Chain.prototype[name] = chainify(fn);\n    }\n  }\n  /**\n   * Create a proxy method for the chain\n   * @param {string} name\n   * @param {function} resolver   The function resolving with the\n   *                              function to be proxied\n   * @private\n   */\n\n\n  function createLazyProxy(name, resolver) {\n    lazy(Chain.prototype, name, function outerResolver() {\n      var fn = resolver();\n\n      if (typeof fn === 'function') {\n        return chainify(fn);\n      }\n\n      return undefined; // if not a function, ignore\n    });\n  }\n  /**\n   * Make a function chainable\n   * @param {function} fn\n   * @return {Function} chain function\n   * @private\n   */\n\n\n  function chainify(fn) {\n    return function () {\n      var args = [this.value]; // `this` will be the context of a Chain instance\n\n      for (var i = 0; i < arguments.length; i++) {\n        args[i + 1] = arguments[i];\n      }\n\n      return new Chain(fn.apply(fn, args));\n    };\n  }\n  /**\n   * Create a proxy for a single method, or an object with multiple methods.\n   * Example usage:\n   *\n   *   Chain.createProxy('add', function add (x, y) {...})\n   *   Chain.createProxy({\n   *     add:      function add (x, y) {...},\n   *     subtract: function subtract (x, y) {...}\n   *   }\n   *\n   * @param {string | Object} arg0   A name (string), or an object with\n   *                                 functions\n   * @param {*} [arg1]               A function, when arg0 is a name\n   */\n\n\n  Chain.createProxy = function (arg0, arg1) {\n    if (typeof arg0 === 'string') {\n      // createProxy(name, value)\n      createProxy(arg0, arg1);\n    } else {\n      // createProxy(values)\n      for (var prop in arg0) {\n        if (arg0.hasOwnProperty(prop)) {\n          createProxy(prop, arg0[prop]);\n        }\n      }\n    }\n  }; // create proxy for everything that is in math.js\n\n\n  Chain.createProxy(math); // register on the import event, automatically add a proxy for every imported function.\n\n  math.on('import', function (name, resolver, path) {\n    if (path === undefined) {\n      // an imported function (not a data type or something special)\n      createLazyProxy(name, resolver);\n    }\n  });\n  return Chain;\n}\n\nexports.name = 'Chain';\nexports.path = 'type';\nexports.factory = factory;\nexports.math = true; // require providing the math namespace as 5th argument\n\nexports.lazy = false; // we need to register a listener on the import events, so no lazy loading","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Wrap any value in a chain, allowing to perform chained operations on\n   * the value.\n   *\n   * All methods available in the math.js library can be called upon the chain,\n   * and then will be evaluated with the value itself as first argument.\n   * The chain can be closed by executing `chain.done()`, which returns\n   * the final value.\n   *\n   * The chain has a number of special functions:\n   *\n   * - `done()`     Finalize the chain and return the chain's value.\n   * - `valueOf()`  The same as `done()`\n   * - `toString()` Executes `math.format()` onto the chain's value, returning\n   *                a string representation of the value.\n   *\n   * Syntax:\n   *\n   *    math.chain(value)\n   *\n   * Examples:\n   *\n   *     math.chain(3)\n   *         .add(4)\n   *         .subtract(2)\n   *         .done()     // 5\n   *\n   *     math.chain( [[1, 2], [3, 4]] )\n   *         .subset(math.index(0, 0), 8)\n   *         .multiply(3)\n   *         .done()     // [[24, 6], [9, 12]]\n   *\n   * @param {*} [value]   A value of any type on which to start a chained operation.\n   * @return {math.type.Chain} The created chain\n   */\n  return typed('chain', {\n    '': function _() {\n      return new type.Chain();\n    },\n    'any': function any(value) {\n      return new type.Chain(value);\n    }\n  });\n}\n\nexports.name = 'chain';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// type\nrequire('./Chain'), // construction function\nrequire('./function/chain')];","'use strict';\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\nvar Complex = require('complex.js');\n\nvar format = require('../../utils/number').format;\n\nvar isNumber = require('../../utils/number').isNumber;\n\nfunction factory(type, config, load, typed, math) {\n  /**\n   * Attach type information\n   */\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\n  /**\n   * Get a JSON representation of the complex number\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}`\n   */\n\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    };\n  };\n  /*\n   * Return the value of the complex number in polar notation\n   * The angle phi will be set in the interval of [-pi, pi].\n   * @return {{r: number, phi: number}} Returns and object with properties r and phi.\n   */\n\n\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    };\n  };\n  /**\n   * Get a string representation of the complex number,\n   * with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string} str\n   */\n\n\n  Complex.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options); // round either re or im when smaller than the configured precision\n\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\n\n      if (Math.abs(im / re) < epsilon) {\n        im = 0;\n      }\n    }\n\n    if (im === 0) {\n      // real value\n      str = strRe;\n    } else if (re === 0) {\n      // purely complex value\n      if (im === 1) {\n        str = 'i';\n      } else if (im === -1) {\n        str = '-i';\n      } else {\n        str = strIm + 'i';\n      }\n    } else {\n      // complex value\n      if (im < 0) {\n        if (im === -1) {\n          str = strRe + ' - i';\n        } else {\n          str = strRe + ' - ' + strIm.substring(1) + 'i';\n        }\n      } else {\n        if (im === 1) {\n          str = strRe + ' + i';\n        } else {\n          str = strRe + ' + ' + strIm + 'i';\n        }\n      }\n    }\n\n    return str;\n  };\n  /**\n   * Create a complex number from polar coordinates\n   *\n   * Usage:\n   *\n   *     Complex.fromPolar(r: number, phi: number) : Complex\n   *     Complex.fromPolar({r: number, phi: number}) : Complex\n   *\n   * @param {*} args...\n   * @return {Complex}\n   */\n\n\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        var arg = arguments[0];\n\n        if (_typeof(arg) === 'object') {\n          return Complex(arg);\n        }\n\n        throw new TypeError('Input has to be an object with r and phi keys.');\n\n      case 2:\n        var r = arguments[0];\n        var phi = arguments[1];\n\n        if (isNumber(r)) {\n          if (type.isUnit(phi) && phi.hasBase('ANGLE')) {\n            // convert unit to a number in radians\n            phi = phi.toNumber('rad');\n          }\n\n          if (isNumber(phi)) {\n            return new Complex({\n              r: r,\n              phi: phi\n            });\n          }\n\n          throw new TypeError('Phi is not a number nor an angle unit.');\n        } else {\n          throw new TypeError('Radius r is not a number.');\n        }\n\n      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar');\n    }\n  };\n\n  Complex.prototype.valueOf = Complex.prototype.toString;\n  /**\n   * Create a Complex number from a JSON object\n   * @param {Object} json  A JSON Object structured as\n   *                       {\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}\n   *                       All properties are optional, default values\n   *                       for `re` and `im` are 0.\n   * @return {Complex} Returns a new Complex number\n   */\n\n  Complex.fromJSON = function (json) {\n    return new Complex(json);\n  }; // apply the current epsilon\n\n\n  Complex.EPSILON = config.epsilon; // listen for changed in the configuration, automatically apply changed epsilon\n\n  math.on('config', function (curr, prev) {\n    if (curr.epsilon !== prev.epsilon) {\n      Complex.EPSILON = curr.epsilon;\n    }\n  });\n  /**\n   * Compare two complex numbers, `a` and `b`:\n   *\n   * - Returns 1 when the real part of `a` is larger than the real part of `b`\n   * - Returns -1 when the real part of `a` is smaller than the real part of `b`\n   * - Returns 1 when the real parts are equal\n   *   and the imaginary part of `a` is larger than the imaginary part of `b`\n   * - Returns -1 when the real parts are equal\n   *   and the imaginary part of `a` is smaller than the imaginary part of `b`\n   * - Returns 0 when both real and imaginary parts are equal.\n   *\n   * @params {Complex} a\n   * @params {Complex} b\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n\n    if (a.re < b.re) {\n      return -1;\n    }\n\n    if (a.im > b.im) {\n      return 1;\n    }\n\n    if (a.im < b.im) {\n      return -1;\n    }\n\n    return 0;\n  };\n\n  return Complex;\n}\n\nexports.name = 'Complex';\nexports.path = 'type';\nexports.factory = factory;\nexports.math = true; // request access to the math namespace","'use strict';\n\nvar deepMap = require('../../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  var latex = require('../../../utils/latex');\n  /**\n   * Create a complex value or convert a value to a complex value.\n   *\n   * Syntax:\n   *\n   *     math.complex()                           // creates a complex value with zero\n   *                                              // as real and imaginary part.\n   *     math.complex(re : number, im : string)   // creates a complex value with provided\n   *                                              // values for real and imaginary part.\n   *     math.complex(re : number)                // creates a complex value with provided\n   *                                              // real value and zero imaginary part.\n   *     math.complex(complex : Complex)          // clones the provided complex value.\n   *     math.complex(arg : string)               // parses a string into a complex value.\n   *     math.complex(array : Array)              // converts the elements of the array\n   *                                              // or matrix element wise into a\n   *                                              // complex value.\n   *     math.complex({re: number, im: number})   // creates a complex value with provided\n   *                                              // values for real an imaginary part.\n   *     math.complex({r: number, phi: number})   // creates a complex value with provided\n   *                                              // polar coordinates\n   *\n   * Examples:\n   *\n   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i\n   *    a.re = 5                          // a = Complex 5 - 4i\n   *    const i = a.im                    // Number -4\n   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i\n   *    const c = math.complex()          // Complex 0 + 0i\n   *    const d = math.add(a, b)          // Complex 5 + 2i\n   *\n   * See also:\n   *\n   *    bignumber, boolean, index, matrix, number, string, unit\n   *\n   * @param {* | Array | Matrix} [args]\n   *            Arguments specifying the real and imaginary part of the complex number\n   * @return {Complex | Array | Matrix} Returns a complex value\n   */\n\n\n  var complex = typed('complex', {\n    '': function _() {\n      return type.Complex.ZERO;\n    },\n    'number': function number(x) {\n      return new type.Complex(x, 0);\n    },\n    'number, number': function numberNumber(re, im) {\n      return new type.Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {\n      return new type.Complex(re.toNumber(), im.toNumber());\n    },\n    'Complex': function Complex(x) {\n      return x.clone();\n    },\n    'string': function string(x) {\n      return type.Complex(x); // for example '2 + 3i'\n    },\n    'null': function _null(x) {\n      return type.Complex(0);\n    },\n    'Object': function Object(x) {\n      if ('re' in x && 'im' in x) {\n        return new type.Complex(x.re, x.im);\n      }\n\n      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {\n        return new type.Complex(x);\n      }\n\n      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, complex);\n    }\n  });\n  complex.toTex = {\n    0: '0',\n    1: \"\\\\left(${args[0]}\\\\right)\",\n    2: \"\\\\left(\\\\left(${args[0]}\\\\right)+\".concat(latex.symbols['i'], \"\\\\cdot\\\\left(${args[1]}\\\\right)\\\\right)\")\n  };\n  return complex;\n}\n\nexports.name = 'complex';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// type\nrequire('./Complex'), // construction function\nrequire('./function/complex')];","'use strict';\n\nvar Fraction = require('fraction.js');\n/**\n * Attach type information\n */\n\n\nFraction.prototype.type = 'Fraction';\nFraction.prototype.isFraction = true;\n/**\n * Get a JSON representation of a Fraction containing type information\n * @returns {Object} Returns a JSON object structured as:\n *                   `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n */\n\nFraction.prototype.toJSON = function () {\n  return {\n    mathjs: 'Fraction',\n    n: this.s * this.n,\n    d: this.d\n  };\n};\n/**\n * Instantiate a Fraction from a JSON object\n * @param {Object} json  a JSON object structured as:\n *                       `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n * @return {BigNumber}\n */\n\n\nFraction.fromJSON = function (json) {\n  return new Fraction(json);\n};\n\nfunction factory(type, config, load, typed) {\n  return Fraction;\n}\n\nexports.name = 'Fraction';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a fraction convert a value to a fraction.\n   *\n   * Syntax:\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)         Turn all matrix entries\n   *                                                   into fractions\n   *\n   * Examples:\n   *\n   *     math.fraction(1, 3)\n   *     math.fraction('2/3')\n   *     math.fraction({n: 2, d: 3})\n   *     math.fraction([0.2, 0.25, 1.25])\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]\n   *            Arguments specifying the numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  var fraction = typed('fraction', {\n    'number': function number(x) {\n      if (!isFinite(x) || isNaN(x)) {\n        throw new Error(x + ' cannot be represented as a fraction');\n      }\n\n      return new type.Fraction(x);\n    },\n    'string': function string(x) {\n      return new type.Fraction(x);\n    },\n    'number, number': function numberNumber(numerator, denominator) {\n      return new type.Fraction(numerator, denominator);\n    },\n    'null': function _null(x) {\n      return new type.Fraction(0);\n    },\n    'BigNumber': function BigNumber(x) {\n      return new type.Fraction(x.toString());\n    },\n    'Fraction': function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    'Object': function Object(x) {\n      return new type.Fraction(x);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, fraction);\n    }\n  });\n  return fraction;\n}\n\nexports.name = 'fraction';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// type\nrequire('./Fraction'), // construction function\nrequire('./function/fraction')];","'use strict';\n\nmodule.exports = [require('./bignumber'), require('./boolean'), require('./chain'), require('./complex'), require('./fraction'), require('./matrix'), require('./number'), require('./numeric'), require('./resultset'), require('./string'), require('./unit')];","'use strict';\n\nvar util = require('../../utils/index');\n\nvar DimensionError = require('../../error/DimensionError');\n\nvar string = util.string;\nvar array = util.array;\nvar object = util.object;\nvar number = util.number;\nvar isArray = Array.isArray;\nvar isNumber = number.isNumber;\nvar isInteger = number.isInteger;\nvar isString = string.isString;\nvar validateIndex = array.validateIndex;\n\nfunction factory(type, config, load, typed) {\n  var getArrayDataType = load(require('./utils/getArrayDataType'));\n  var Matrix = load(require('./Matrix')); // force loading Matrix (do not use via type.Matrix)\n\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   */\n\n  function DenseMatrix(data, datatype) {\n    if (!(this instanceof DenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n\n    if (type.isMatrix(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = object.clone(data._data);\n        this._size = object.clone(data._size);\n        this._datatype = datatype || data._datatype;\n      } else {\n        // build data from existing matrix\n        this._data = data.toArray();\n        this._size = data.size();\n        this._datatype = datatype || data._datatype;\n      }\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data); // get the dimensions of the array\n\n      this._size = array.size(this._data); // verify the dimensions of the array, TODO: compute size while processing array\n\n      array.validate(this._data, this._size); // data type unknown\n\n      this._datatype = datatype;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + util.types.type(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n    }\n  }\n\n  DenseMatrix.prototype = new Matrix();\n  /**\n   * Attach type information\n   */\n\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf DenseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data);\n  };\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()  // retrieve storage format\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The storage format.\n   */\n\n\n  DenseMatrix.prototype.storage = function () {\n    return 'dense';\n  };\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()   // retrieve matrix datatype\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The datatype.\n   */\n\n\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n\n\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof DenseMatrix\n   * @param {Index} index\n   * @param {Array | DenseMatrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n\n\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n      // intentional fall through\n\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue);\n\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  /**\n   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\n\n  DenseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check index\n\n\n    for (var x = 0; x < index.length; x++) {\n      validateIndex(index[x], this._size[x]);\n    }\n\n    var data = this._data;\n\n    for (var i = 0, ii = index.length; i < ii; i++) {\n      var indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    return data;\n  };\n  /**\n   * Replace a single element in the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {DenseMatrix} self\n   */\n\n\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n\n    var i, ii, indexI; // enlarge matrix when needed\n\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n\n    _fit(this, size, defaultValue); // traverse over the dimensions\n\n\n    var data = this._data;\n\n    for (i = 0, ii = index.length - 1; i < ii; i++) {\n      indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    } // set new value\n\n\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\n  };\n  /**\n   * Get a submatrix of this matrix\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index   Zero-based index\n   * @private\n   */\n\n\n  function _get(matrix, index) {\n    if (!type.isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n\n    var isScalar = index.isScalar();\n\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      } // validate if any of the ranges in the index is out of range\n\n\n      var min = index.min();\n      var max = index.max();\n\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      } // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n\n\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\n    }\n  }\n  /**\n   * Recursively get a submatrix of a multi dimensional matrix.\n   * Index is not checked for correct number or length of dimensions.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {number} dims   Total number of dimensions\n   * @param {number} dim    Current dimension\n   * @return {Array} submatrix\n   * @private\n   */\n\n\n  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n\n    if (last) {\n      return range.map(function (i) {\n        validateIndex(i, data.length);\n        return data[i];\n      }).valueOf();\n    } else {\n      return range.map(function (i) {\n        validateIndex(i, data.length);\n        var child = data[i];\n        return _getSubmatrix(child, index, dims, dim + 1);\n      }).valueOf();\n    }\n  }\n  /**\n   * Replace a submatrix in this matrix\n   * Indexes are zero-based.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index\n   * @param {DenseMatrix | Array | *} submatrix\n   * @param {*} defaultValue          Default value, filled in on new entries when\n   *                                  the matrix is resized.\n   * @return {DenseMatrix} matrix\n   * @private\n   */\n\n\n  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    } // get index size and check whether the index contains a single value\n\n\n    var iSize = index.size();\n    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n    var sSize;\n\n    if (type.isMatrix(submatrix)) {\n      sSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      sSize = array.size(submatrix);\n    }\n\n    if (isScalar) {\n      // set a scalar\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        } // unsqueeze both outer and inner dimensions\n\n\n        submatrix = array.unsqueeze(submatrix, iSize.length, outer, sSize);\n      } // check whether the size of the submatrix matches the index size\n\n\n      if (!object.deepEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      } // enlarge matrix when needed\n\n\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n\n      _fit(matrix, size, defaultValue); // insert the sub matrix\n\n\n      var dims = iSize.length;\n      var dim = 0;\n\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n\n    return matrix;\n  }\n  /**\n   * Replace a submatrix of a multi dimensional matrix.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {Array} submatrix\n   * @param {number} dims   Total number of dimensions\n   * @param {number} dim\n   * @private\n   */\n\n\n  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n\n    if (last) {\n      range.forEach(function (dataIndex, subIndex) {\n        validateIndex(dataIndex);\n        data[dataIndex] = submatrix[subIndex[0]];\n      });\n    } else {\n      range.forEach(function (dataIndex, subIndex) {\n        validateIndex(dataIndex);\n\n        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\n      });\n    }\n  }\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof DenseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n\n\n  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isArray(size)) {\n      throw new TypeError('Array expected');\n    } // matrix to resize\n\n\n    var m = copy ? this.clone() : this; // resize matrix\n\n    return _resize(m, size, defaultValue);\n  };\n\n  function _resize(matrix, size, defaultValue) {\n    // check size\n    if (size.length === 0) {\n      // first value in matrix\n      var v = matrix._data; // go deep\n\n      while (isArray(v)) {\n        v = v[0];\n      }\n\n      return v;\n    } // resize matrix\n\n\n    matrix._size = size.slice(0); // copy the array\n\n    matrix._data = array.resize(matrix._data, matrix._size, defaultValue); // return matrix\n\n    return matrix;\n  }\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof DenseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n\n\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = array.reshape(m._data, size);\n    m._size = size.slice(0);\n    return m;\n  };\n  /**\n   * Enlarge the matrix when it is smaller than given size.\n   * If the matrix is larger or equal sized, nothing is done.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix           The matrix to be resized\n   * @param {number[]} size\n   * @param {*} defaultValue          Default value, filled in on new entries.\n   * @private\n   */\n\n\n  function _fit(matrix, size, defaultValue) {\n    var // copy the array\n    newSize = matrix._size.slice(0);\n\n    var changed = false; // add dimensions when needed\n\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    } // enlarge size when needed\n\n\n    for (var i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i];\n        changed = true;\n      }\n    }\n\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n\n\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: object.clone(this._data),\n      size: object.clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n\n\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\n  };\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   *\n   * @return {DenseMatrix} matrix\n   */\n\n\n  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        return value.map(function (child, i) {\n          return recurse(child, index.concat(i));\n        });\n      } else {\n        return callback(value, index, me);\n      }\n    }; // return dense format\n\n\n    return new DenseMatrix({\n      data: recurse(this._data, []),\n      size: object.clone(this._size),\n      datatype: this._datatype\n    });\n  };\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n\n\n  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\n\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        value.forEach(function (child, i) {\n          recurse(child, index.concat(i));\n        });\n      } else {\n        callback(value, index, me);\n      }\n    };\n\n    recurse(this._data, []);\n  };\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n\n\n  DenseMatrix.prototype.toArray = function () {\n    return object.clone(this._data);\n  };\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n\n\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\n  };\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof DenseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n\n\n  DenseMatrix.prototype.format = function (options) {\n    return string.format(this._data, options);\n  };\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n\n\n  DenseMatrix.prototype.toString = function () {\n    return string.format(this._data);\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n\n\n  DenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'DenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof DenseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Array}                      The array vector with the diagonal values.\n   */\n\n\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (type.isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // number diagonal values\n\n    var n = Math.min(rows - kSub, columns - kSuper); // x is a matrix get diagonal from matrix\n\n    var data = []; // loop rows\n\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    } // create DenseMatrix\n\n\n    return new DenseMatrix({\n      data: data,\n      size: [n],\n      datatype: this._datatype\n    });\n  };\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {Array} size                   The matrix size.\n   * @param {number | Array} value          The values for the diagonal.\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]        The default value for non-diagonal\n   *\n   * @returns {DenseMatrix}\n   */\n\n\n  DenseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // map size & validate\n\n\n    size = size.map(function (s) {\n      // check it is a big number\n      if (type.isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      } // validate arguments\n\n\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n\n      return s;\n    }); // validate k if any\n\n    if (k) {\n      // convert BigNumber to a number\n      if (type.isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    if (defaultValue && isString(datatype)) {\n      // convert defaultValue to the same datatype\n      defaultValue = typed.convert(defaultValue, datatype);\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows and columns\n\n    var rows = size[0];\n    var columns = size[1]; // number of non-zero items\n\n    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n    var _value; // check value\n\n\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (type.isMatrix(value)) {\n      // matrix size\n      var ms = value.size(); // validate matrix\n\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    } // discover default value if needed\n\n\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = type.isBigNumber(_value(0)) ? new type.BigNumber(0) : 0;\n    } // empty array\n\n\n    var data = []; // check we need to resize array\n\n    if (size.length > 0) {\n      // resize array\n      data = array.resize(data, size, defaultValue); // fill diagonal\n\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    } // create DenseMatrix\n\n\n    return new DenseMatrix({\n      data: data,\n      size: [rows, columns]\n    });\n  };\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof DenseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"DenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {DenseMatrix}\n   */\n\n\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\n  };\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n\n\n  DenseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    } // check dimensions\n\n\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    } // validate index\n\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]); // swap rows\n\n    DenseMatrix._swapRows(i, j, this._data); // return current instance\n\n\n    return this;\n  };\n  /**\n   * Swap rows i and j in Dense Matrix data structure.\n   *\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   */\n\n\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    var vi = data[i];\n    data[i] = data[j];\n    data[j] = vi;\n  };\n  /**\n   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n   * Matrices. Replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @return {Array} data\n   */\n\n\n  function preprocess(data) {\n    for (var i = 0, ii = data.length; i < ii; i++) {\n      var elem = data[i];\n\n      if (isArray(elem)) {\n        data[i] = preprocess(elem);\n      } else if (elem && elem.isMatrix === true) {\n        data[i] = preprocess(elem.valueOf());\n      }\n    }\n\n    return data;\n  } // register this type in the base class Matrix\n\n\n  type.Matrix._storage.dense = DenseMatrix;\n  type.Matrix._storage['default'] = DenseMatrix; // exports\n\n  return DenseMatrix;\n}\n\nexports.name = 'DenseMatrix';\nexports.path = 'type';\nexports.factory = factory;\nexports.lazy = false; // no lazy loading, as we alter type.Matrix._storage","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var smaller = load(require('../../function/relational/smaller'));\n  var larger = load(require('../../function/relational/larger'));\n  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);\n  /**\n   * Fibonacci Heap implementation, used interally for Matrix math.\n   * @class FibonacciHeap\n   * @constructor FibonacciHeap\n   */\n\n  function FibonacciHeap() {\n    if (!(this instanceof FibonacciHeap)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // initialize fields\n\n\n    this._minimum = null;\n    this._size = 0;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  FibonacciHeap.prototype.type = 'FibonacciHeap';\n  FibonacciHeap.prototype.isFibonacciHeap = true;\n  /**\n   * Inserts a new data element into the heap. No heap consolidation is\n   * performed at this time, the new node is simply inserted into the root\n   * list of this heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n  FibonacciHeap.prototype.insert = function (key, value) {\n    // create node\n    var node = {\n      key: key,\n      value: value,\n      degree: 0 // check we have a node in the minimum\n\n    };\n\n    if (this._minimum) {\n      // minimum node\n      var minimum = this._minimum; // update left & right of node\n\n      node.left = minimum;\n      node.right = minimum.right;\n      minimum.right = node;\n      node.right.left = node; // update minimum node in heap if needed\n\n      if (smaller(key, minimum.key)) {\n        // node has a smaller key, use it as minimum\n        this._minimum = node;\n      }\n    } else {\n      // set left & right\n      node.left = node;\n      node.right = node; // this is the first node\n\n      this._minimum = node;\n    } // increment number of nodes in heap\n\n\n    this._size++; // return node\n\n    return node;\n  };\n  /**\n   * Returns the number of nodes in heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.size = function () {\n    return this._size;\n  };\n  /**\n   * Removes all elements from this heap.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.clear = function () {\n    this._minimum = null;\n    this._size = 0;\n  };\n  /**\n   * Returns true if the heap is empty, otherwise false.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.isEmpty = function () {\n    return this._size === 0;\n  };\n  /**\n   * Extracts the node with minimum key from heap. Amortized running\n   * time: O(log n).\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.extractMinimum = function () {\n    // node to remove\n    var node = this._minimum; // check we have a minimum\n\n    if (node === null) {\n      return node;\n    } // current minimum\n\n\n    var minimum = this._minimum; // get number of children\n\n    var numberOfChildren = node.degree; // pointer to the first child\n\n    var x = node.child; // for each child of node do...\n\n    while (numberOfChildren > 0) {\n      // store node in right side\n      var tempRight = x.right; // remove x from child list\n\n      x.left.right = x.right;\n      x.right.left = x.left; // add x to root list of heap\n\n      x.left = minimum;\n      x.right = minimum.right;\n      minimum.right = x;\n      x.right.left = x; // set Parent[x] to null\n\n      x.parent = null;\n      x = tempRight;\n      numberOfChildren--;\n    } // remove node from root list of heap\n\n\n    node.left.right = node.right;\n    node.right.left = node.left; // update minimum\n\n    if (node === node.right) {\n      // empty\n      minimum = null;\n    } else {\n      // update minimum\n      minimum = node.right; // we need to update the pointer to the root with minimum key\n\n      minimum = _findMinimumNode(minimum, this._size);\n    } // decrement size of heap\n\n\n    this._size--; // update minimum\n\n    this._minimum = minimum; // return node\n\n    return node;\n  };\n  /**\n   * Removes a node from the heap given the reference to the node. The trees\n   * in the heap will be consolidated, if necessary. This operation may fail\n   * to remove the correct element if there are nodes with key value -Infinity.\n   * Running time: O(log n) amortized.\n   * @memberof FibonacciHeap\n   */\n\n\n  FibonacciHeap.prototype.remove = function (node) {\n    // decrease key value\n    this._minimum = _decreaseKey(this._minimum, node, -1); // remove the smallest\n\n    this.extractMinimum();\n  };\n  /**\n   * Decreases the key value for a heap node, given the new value to take on.\n   * The structure of the heap may be changed and will not be consolidated.\n   * Running time: O(1) amortized.\n   * @memberof FibonacciHeap\n   */\n\n\n  function _decreaseKey(minimum, node, key) {\n    // set node key\n    node.key = key; // get parent node\n\n    var parent = node.parent;\n\n    if (parent && smaller(node.key, parent.key)) {\n      // remove node from parent\n      _cut(minimum, node, parent); // remove all nodes from parent to the root parent\n\n\n      _cascadingCut(minimum, parent);\n    } // update minimum node if needed\n\n\n    if (smaller(node.key, minimum.key)) {\n      minimum = node;\n    } // return minimum\n\n\n    return minimum;\n  }\n  /**\n   * The reverse of the link operation: removes node from the child list of parent.\n   * This method assumes that min is non-null. Running time: O(1).\n   * @memberof FibonacciHeap\n   */\n\n\n  function _cut(minimum, node, parent) {\n    // remove node from parent children and decrement Degree[parent]\n    node.left.right = node.right;\n    node.right.left = node.left;\n    parent.degree--; // reset y.child if necessary\n\n    if (parent.child === node) {\n      parent.child = node.right;\n    } // remove child if degree is 0\n\n\n    if (parent.degree === 0) {\n      parent.child = null;\n    } // add node to root list of heap\n\n\n    node.left = minimum;\n    node.right = minimum.right;\n    minimum.right = node;\n    node.right.left = node; // set parent[node] to null\n\n    node.parent = null; // set mark[node] to false\n\n    node.mark = false;\n  }\n  /**\n   * Performs a cascading cut operation. This cuts node from its parent and then\n   * does the same for its parent, and so on up the tree.\n   * Running time: O(log n); O(1) excluding the recursion.\n   * @memberof FibonacciHeap\n   */\n\n\n  function _cascadingCut(minimum, node) {\n    // store parent node\n    var parent = node.parent; // if there's a parent...\n\n    if (!parent) {\n      return;\n    } // if node is unmarked, set it marked\n\n\n    if (!node.mark) {\n      node.mark = true;\n    } else {\n      // it's marked, cut it from parent\n      _cut(minimum, node, parent); // cut its parent as well\n\n\n      _cascadingCut(parent);\n    }\n  }\n  /**\n   * Make the first node a child of the second one. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n\n\n  var _linkNodes = function _linkNodes(node, parent) {\n    // remove node from root list of heap\n    node.left.right = node.right;\n    node.right.left = node.left; // make node a Child of parent\n\n    node.parent = parent;\n\n    if (!parent.child) {\n      parent.child = node;\n      node.right = node;\n      node.left = node;\n    } else {\n      node.left = parent.child;\n      node.right = parent.child.right;\n      parent.child.right = node;\n      node.right.left = node;\n    } // increase degree[parent]\n\n\n    parent.degree++; // set mark[node] false\n\n    node.mark = false;\n  };\n\n  function _findMinimumNode(minimum, size) {\n    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree\n    var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; // create list with initial capacity\n\n    var array = new Array(arraySize); // find the number of root nodes.\n\n    var numRoots = 0;\n    var x = minimum;\n\n    if (x) {\n      numRoots++;\n      x = x.right;\n\n      while (x !== minimum) {\n        numRoots++;\n        x = x.right;\n      }\n    } // vars\n\n\n    var y; // For each node in root list do...\n\n    while (numRoots > 0) {\n      // access this node's degree..\n      var d = x.degree; // get next node\n\n      var next = x.right; // check if there is a node already in array with the same degree\n\n      while (true) {\n        // get node with the same degree is any\n        y = array[d];\n\n        if (!y) {\n          break;\n        } // make one node with the same degree a child of the other, do this based on the key value.\n\n\n        if (larger(x.key, y.key)) {\n          var temp = y;\n          y = x;\n          x = temp;\n        } // make y a child of x\n\n\n        _linkNodes(y, x); // we have handled this degree, go to next one.\n\n\n        array[d] = null;\n        d++;\n      } // save this node for later when we might encounter another of the same degree.\n\n\n      array[d] = x; // move forward through list.\n\n      x = next;\n      numRoots--;\n    } // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n\n\n    minimum = null; // loop nodes in array\n\n    for (var i = 0; i < arraySize; i++) {\n      // get current node\n      y = array[i];\n\n      if (!y) {\n        continue;\n      } // check if we have a linked list\n\n\n      if (minimum) {\n        // First remove node from root list.\n        y.left.right = y.right;\n        y.right.left = y.left; // now add to root list, again.\n\n        y.left = minimum;\n        y.right = minimum.right;\n        minimum.right = y;\n        y.right.left = y; // check if this is a new min.\n\n        if (smaller(y.key, minimum.key)) {\n          minimum = y;\n        }\n      } else {\n        minimum = y;\n      }\n    }\n\n    return minimum;\n  }\n\n  return FibonacciHeap;\n}\n\nexports.name = 'FibonacciHeap';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../utils/index');\n\nvar string = util.string;\nvar object = util.object;\nvar isArray = Array.isArray;\nvar isString = string.isString;\n\nfunction factory(type, config, load) {\n  var DenseMatrix = load(require('./DenseMatrix'));\n  var smaller = load(require('../../function/relational/smaller'));\n\n  function ImmutableDenseMatrix(data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n\n    if (type.isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      var matrix = new DenseMatrix(data, datatype); // internal structures\n\n      this._data = matrix._data;\n      this._size = matrix._size;\n      this._datatype = matrix._datatype;\n      this._min = null;\n      this._max = null;\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      this._datatype = data.datatype;\n      this._min = typeof data.min !== 'undefined' ? data.min : null;\n      this._max = typeof data.max !== 'undefined' ? data.max : null;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + util.types.type(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n      this._min = null;\n      this._max = null;\n    }\n  }\n\n  ImmutableDenseMatrix.prototype = new DenseMatrix();\n  /**\n   * Attach type information\n   */\n\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | ImmutableDenseMatrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n\n  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n        // use base implementation\n        var m = DenseMatrix.prototype.subset.call(this, index); // check result is a matrix\n\n        if (type.isMatrix(m)) {\n          // return immutable matrix\n          return new ImmutableDenseMatrix({\n            data: m._data,\n            size: m._size,\n            datatype: m._datatype\n          });\n        }\n\n        return m;\n      // intentional fall through\n\n      case 2:\n      case 3:\n        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');\n\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  /**\n   * Replace a single element in the matrix.\n   * @param {Number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {ImmutableDenseMatrix} self\n   */\n\n\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance');\n  };\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {Number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n\n\n  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance');\n  };\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n\n\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');\n  };\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n\n\n  ImmutableDenseMatrix.prototype.clone = function () {\n    var m = new ImmutableDenseMatrix({\n      data: object.clone(this._data),\n      size: object.clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n\n\n  ImmutableDenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'ImmutableDenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n  /**\n   * Generate a matrix from a JSON object\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ImmutableDenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {ImmutableDenseMatrix}\n   */\n\n\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json);\n  };\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @param {Number} i       Matrix row index 1\n   * @param {Number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n\n\n  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');\n  };\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n\n\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      var m = null; // compute min\n\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) {\n          m = v;\n        }\n      });\n      this._min = m !== null ? m : undefined;\n    }\n\n    return this._min;\n  };\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n\n\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      var m = null; // compute max\n\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) {\n          m = v;\n        }\n      });\n      this._max = m !== null ? m : undefined;\n    }\n\n    return this._max;\n  }; // exports\n\n\n  return ImmutableDenseMatrix;\n}\n\nexports.name = 'ImmutableDenseMatrix';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../utils/index');\n\nvar string = util.string;\nvar isString = string.isString;\n\nfunction factory(type, config, load, typed) {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix() {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\n  /**\n   * Get the Matrix storage constructor for the given format.\n   *\n   * @param {string} format       The Matrix storage format.\n   *\n   * @return {Function}           The Matrix storage constructor.\n   */\n\n  Matrix.storage = function (format) {\n    // check storage format is a string\n    if (!isString(format)) {\n      throw new TypeError('format must be a string value');\n    } // get storage format constructor\n\n\n    var constructor = Matrix._storage[format];\n\n    if (!constructor) {\n      throw new SyntaxError('Unsupported matrix storage format: ' + format);\n    } // return storage constructor\n\n\n    return constructor;\n  }; // a map with all constructors for all storage types\n\n\n  Matrix._storage = {};\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @return {string}           The storage format.\n   */\n\n  Matrix.prototype.storage = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke storage on a Matrix interface');\n  };\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @return {string}           The datatype.\n   */\n\n\n  Matrix.prototype.datatype = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke datatype on a Matrix interface');\n  };\n  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n\n\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\n  };\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n\n\n  Matrix.prototype.subset = function (index, replacement, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke subset on a Matrix interface');\n  };\n  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\n\n  Matrix.prototype.get = function (index) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke get on a Matrix interface');\n  };\n  /**\n   * Replace a single element in the matrix.\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {Matrix} self\n   */\n\n\n  Matrix.prototype.set = function (index, value, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke set on a Matrix interface');\n  };\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n\n\n  Matrix.prototype.resize = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke resize on a Matrix interface');\n  };\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n\n\n  Matrix.prototype.reshape = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke reshape on a Matrix interface');\n  };\n  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n\n\n  Matrix.prototype.clone = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke clone on a Matrix interface');\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n\n\n  Matrix.prototype.size = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke size on a Matrix interface');\n  };\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {Matrix} matrix\n   */\n\n\n  Matrix.prototype.map = function (callback, skipZeros) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke map on a Matrix interface');\n  };\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n\n\n  Matrix.prototype.forEach = function (callback) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke forEach on a Matrix interface');\n  };\n  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n\n\n  Matrix.prototype.toArray = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toArray on a Matrix interface');\n  };\n  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n\n\n  Matrix.prototype.valueOf = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke valueOf on a Matrix interface');\n  };\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n\n\n  Matrix.prototype.format = function (options) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke format on a Matrix interface');\n  };\n  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n\n\n  Matrix.prototype.toString = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toString on a Matrix interface');\n  }; // exports\n\n\n  return Matrix;\n}\n\nexports.name = 'Matrix';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../utils/object').clone;\n\nvar isInteger = require('../../utils/number').isInteger;\n\nfunction factory(type) {\n  /**\n   * Create an index. An Index can store ranges and sets for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Usage:\n   *     const index = new Index(range1, range2, matrix1, array1, ...)\n   *\n   * Where each parameter can be any of:\n   *     A number\n   *     A string (containing a name of an object property)\n   *     An instance of Range\n   *     An Array with the Set values\n   *     A Matrix with the Set values\n   *\n   * The parameters start, end, and step must be integer numbers.\n   *\n   * @class Index\n   * @Constructor Index\n   * @param {...*} ranges\n   */\n  function Index(ranges) {\n    if (!(this instanceof Index)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this._dimensions = [];\n    this._isScalar = true;\n\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i];\n\n      if (type.isRange(arg)) {\n        this._dimensions.push(arg);\n\n        this._isScalar = false;\n      } else if (Array.isArray(arg) || type.isMatrix(arg)) {\n        // create matrix\n        var m = _createImmutableMatrix(arg.valueOf());\n\n        this._dimensions.push(m); // size\n\n\n        var size = m.size(); // scalar\n\n        if (size.length !== 1 || size[0] !== 1) {\n          this._isScalar = false;\n        }\n      } else if (typeof arg === 'number') {\n        this._dimensions.push(_createImmutableMatrix([arg]));\n      } else if (typeof arg === 'string') {\n        // object property (arguments.count should be 1)\n        this._dimensions.push(arg);\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');\n      } // TODO: implement support for wildcard '*'\n\n    }\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Index.prototype.type = 'Index';\n  Index.prototype.isIndex = true;\n\n  function _createImmutableMatrix(arg) {\n    // loop array elements\n    for (var i = 0, l = arg.length; i < l; i++) {\n      if (typeof arg[i] !== 'number' || !isInteger(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers');\n      }\n    } // create matrix\n\n\n    return new type.ImmutableDenseMatrix(arg);\n  }\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n\n\n  Index.prototype.clone = function () {\n    var index = new Index();\n    index._dimensions = clone(this._dimensions);\n    index._isScalar = this._isScalar;\n    return index;\n  };\n  /**\n   * Create an index from an array with ranges/numbers\n   * @memberof Index\n   * @param {Array.<Array | number>} ranges\n   * @return {Index} index\n   * @private\n   */\n\n\n  Index.create = function (ranges) {\n    var index = new Index();\n    Index.apply(index, ranges);\n    return index;\n  };\n  /**\n   * Retrieve the size of the index, the number of elements for each dimension.\n   * @memberof Index\n   * @returns {number[]} size\n   */\n\n\n  Index.prototype.size = function () {\n    var size = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var d = this._dimensions[i];\n      size[i] = typeof d === 'string' ? 1 : d.size()[0];\n    }\n\n    return size;\n  };\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n\n\n  Index.prototype.max = function () {\n    var values = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.max();\n    }\n\n    return values;\n  };\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n\n\n  Index.prototype.min = function () {\n    var values = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var range = this._dimensions[i];\n      values[i] = typeof range === 'string' ? range : range.min();\n    }\n\n    return values;\n  };\n  /**\n   * Loop over each of the ranges of the index\n   * @memberof Index\n   * @param {Function} callback   Called for each range with a Range as first\n   *                              argument, the dimension as second, and the\n   *                              index object as third.\n   */\n\n\n  Index.prototype.forEach = function (callback) {\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this);\n    }\n  };\n  /**\n   * Retrieve the dimension for the given index\n   * @memberof Index\n   * @param {Number} dim                  Number of the dimension\n   * @returns {Range | null} range\n   */\n\n\n  Index.prototype.dimension = function (dim) {\n    return this._dimensions[dim] || null;\n  };\n  /**\n   * Test whether this index contains an object property\n   * @returns {boolean} Returns true if the index is an object property\n   */\n\n\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';\n  };\n  /**\n   * Returns the object property name when the Index holds a single object property,\n   * else returns null\n   * @returns {string | null}\n   */\n\n\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null;\n  };\n  /**\n   * Test whether this index contains only a single value.\n   *\n   * This is the case when the index is created with only scalar values as ranges,\n   * not for ranges resolving into a single value.\n   * @memberof Index\n   * @return {boolean} isScalar\n   */\n\n\n  Index.prototype.isScalar = function () {\n    return this._isScalar;\n  };\n  /**\n   * Expand the Index into an array.\n   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]\n   * @memberof Index\n   * @returns {Array} array\n   */\n\n\n  Index.prototype.toArray = function () {\n    var array = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());\n    }\n\n    return array;\n  };\n  /**\n   * Get the primitive value of the Index, a two dimensional array.\n   * Equivalent to Index.toArray().\n   * @memberof Index\n   * @returns {Array} array\n   */\n\n\n  Index.prototype.valueOf = Index.prototype.toArray;\n  /**\n   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'\n   * @memberof Index\n   * @returns {String} str\n   */\n\n  Index.prototype.toString = function () {\n    var strings = [];\n\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n\n      if (typeof dimension === 'string') {\n        strings.push(JSON.stringify(dimension));\n      } else {\n        strings.push(dimension.toString());\n      }\n    }\n\n    return '[' + strings.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the Index\n   * @memberof Index\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Index\", \"ranges\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   */\n\n\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\n    };\n  };\n  /**\n   * Instantiate an Index from a JSON object\n   * @memberof Index\n   * @param {Object} json A JSON object structured as:\n   *                     `{\"mathjs\": \"Index\", \"dimensions\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   * @return {Index}\n   */\n\n\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions);\n  };\n\n  return Index;\n}\n\nexports.name = 'Index';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar number = require('../../utils/number');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a range. A range has a start, step, and end, and contains functions\n   * to iterate over the range.\n   *\n   * A range can be constructed as:\n   *\n   *     const range = new Range(start, end)\n   *     const range = new Range(start, end, step)\n   *\n   * To get the result of the range:\n   *     range.forEach(function (x) {\n   *         console.log(x)\n   *     })\n   *     range.map(function (x) {\n   *         return math.sin(x)\n   *     })\n   *     range.toArray()\n   *\n   * Example usage:\n   *\n   *     const c = new Range(2, 6)       // 2:1:5\n   *     c.toArray()                     // [2, 3, 4, 5]\n   *     const d = new Range(2, -3, -1)  // 2:-1:-2\n   *     d.toArray()                     // [2, 1, 0, -1, -2]\n   *\n   * @class Range\n   * @constructor Range\n   * @param {number} start  included lower bound\n   * @param {number} end    excluded upper bound\n   * @param {number} [step] step size, default value is 1\n   */\n  function Range(start, end, step) {\n    if (!(this instanceof Range)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    var hasStart = start !== null && start !== undefined;\n    var hasEnd = end !== null && end !== undefined;\n    var hasStep = step !== null && step !== undefined;\n\n    if (hasStart) {\n      if (type.isBigNumber(start)) {\n        start = start.toNumber();\n      } else if (typeof start !== 'number') {\n        throw new TypeError('Parameter start must be a number');\n      }\n    }\n\n    if (hasEnd) {\n      if (type.isBigNumber(end)) {\n        end = end.toNumber();\n      } else if (typeof end !== 'number') {\n        throw new TypeError('Parameter end must be a number');\n      }\n    }\n\n    if (hasStep) {\n      if (type.isBigNumber(step)) {\n        step = step.toNumber();\n      } else if (typeof step !== 'number') {\n        throw new TypeError('Parameter step must be a number');\n      }\n    }\n\n    this.start = hasStart ? parseFloat(start) : 0;\n    this.end = hasEnd ? parseFloat(end) : 0;\n    this.step = hasStep ? parseFloat(step) : 1;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Range.prototype.type = 'Range';\n  Range.prototype.isRange = true;\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @memberof Range\n   * @param {string} str\n   * @return {Range | null} range\n   */\n\n  Range.parse = function (str) {\n    if (typeof str !== 'string') {\n      return null;\n    }\n\n    var args = str.split(':');\n    var nums = args.map(function (arg) {\n      return parseFloat(arg);\n    });\n    var invalid = nums.some(function (num) {\n      return isNaN(num);\n    });\n\n    if (invalid) {\n      return null;\n    }\n\n    switch (nums.length) {\n      case 2:\n        return new Range(nums[0], nums[1]);\n\n      case 3:\n        return new Range(nums[0], nums[2], nums[1]);\n\n      default:\n        return null;\n    }\n  };\n  /**\n   * Create a clone of the range\n   * @return {Range} clone\n   */\n\n\n  Range.prototype.clone = function () {\n    return new Range(this.start, this.end, this.step);\n  };\n  /**\n   * Retrieve the size of the range.\n   * Returns an array containing one number, the number of elements in the range.\n   * @memberof Range\n   * @returns {number[]} size\n   */\n\n\n  Range.prototype.size = function () {\n    var len = 0;\n    var start = this.start;\n    var step = this.step;\n    var end = this.end;\n    var diff = end - start;\n\n    if (number.sign(step) === number.sign(diff)) {\n      len = Math.ceil(diff / step);\n    } else if (diff === 0) {\n      len = 0;\n    }\n\n    if (isNaN(len)) {\n      len = 0;\n    }\n\n    return [len];\n  };\n  /**\n   * Calculate the minimum value in the range\n   * @memberof Range\n   * @return {number | undefined} min\n   */\n\n\n  Range.prototype.min = function () {\n    var size = this.size()[0];\n\n    if (size > 0) {\n      if (this.step > 0) {\n        // positive step\n        return this.start;\n      } else {\n        // negative step\n        return this.start + (size - 1) * this.step;\n      }\n    } else {\n      return undefined;\n    }\n  };\n  /**\n   * Calculate the maximum value in the range\n   * @memberof Range\n   * @return {number | undefined} max\n   */\n\n\n  Range.prototype.max = function () {\n    var size = this.size()[0];\n\n    if (size > 0) {\n      if (this.step > 0) {\n        // positive step\n        return this.start + (size - 1) * this.step;\n      } else {\n        // negative step\n        return this.start;\n      }\n    } else {\n      return undefined;\n    }\n  };\n  /**\n   * Execute a callback function for each value in the range.\n   * @memberof Range\n   * @param {function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Range being traversed.\n   */\n\n\n  Range.prototype.forEach = function (callback) {\n    var x = this.start;\n    var step = this.step;\n    var end = this.end;\n    var i = 0;\n\n    if (step > 0) {\n      while (x < end) {\n        callback(x, [i], this);\n        x += step;\n        i++;\n      }\n    } else if (step < 0) {\n      while (x > end) {\n        callback(x, [i], this);\n        x += step;\n        i++;\n      }\n    }\n  };\n  /**\n   * Execute a callback function for each value in the Range, and return the\n   * results as an array\n   * @memberof Range\n   * @param {function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.map = function (callback) {\n    var array = [];\n    this.forEach(function (value, index, obj) {\n      array[index[0]] = callback(value, index, obj);\n    });\n    return array;\n  };\n  /**\n   * Create an Array with a copy of the Ranges data\n   * @memberof Range\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.toArray = function () {\n    var array = [];\n    this.forEach(function (value, index) {\n      array[index[0]] = value;\n    });\n    return array;\n  };\n  /**\n   * Get the primitive value of the Range, a one dimensional array\n   * @memberof Range\n   * @returns {Array} array\n   */\n\n\n  Range.prototype.valueOf = function () {\n    // TODO: implement a caching mechanism for range.valueOf()\n    return this.toArray();\n  };\n  /**\n   * Get a string representation of the range, with optional formatting options.\n   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'\n   * @memberof Range\n   * @param {Object | number | function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n\n\n  Range.prototype.format = function (options) {\n    var str = number.format(this.start, options);\n\n    if (this.step !== 1) {\n      str += ':' + number.format(this.step, options);\n    }\n\n    str += ':' + number.format(this.end, options);\n    return str;\n  };\n  /**\n   * Get a string representation of the range.\n   * @memberof Range\n   * @returns {string}\n   */\n\n\n  Range.prototype.toString = function () {\n    return this.format();\n  };\n  /**\n   * Get a JSON representation of the range\n   * @memberof Range\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n   */\n\n\n  Range.prototype.toJSON = function () {\n    return {\n      mathjs: 'Range',\n      start: this.start,\n      end: this.end,\n      step: this.step\n    };\n  };\n  /**\n   * Instantiate a Range from a JSON object\n   * @memberof Range\n   * @param {Object} json A JSON object structured as:\n   *                      `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n   * @return {Range}\n   */\n\n\n  Range.fromJSON = function (json) {\n    return new Range(json.start, json.end, json.step);\n  };\n\n  return Range;\n}\n\nexports.name = 'Range';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load) {\n  var add = load(require('../../function/arithmetic/add'));\n  var equalScalar = load(require('../../function/relational/equalScalar'));\n  /**\n   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array\n   * of the vector elements and an ordered list of non-zero elements.\n   */\n\n  function Spa() {\n    if (!(this instanceof Spa)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    } // allocate vector, TODO use typed arrays\n\n\n    this._values = [];\n    this._heap = new type.FibonacciHeap();\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Spa.prototype.type = 'Spa';\n  Spa.prototype.isSpa = true;\n  /**\n   * Set the value for index i.\n   *\n   * @param {number} i                       The index\n   * @param {number | BigNumber | Complex}   The value at index i\n   */\n\n  Spa.prototype.set = function (i, v) {\n    // check we have a value @ i\n    if (!this._values[i]) {\n      // insert in heap\n      var node = this._heap.insert(i, v); // set the value @ i\n\n\n      this._values[i] = node;\n    } else {\n      // update the value @ i\n      this._values[i].value = v;\n    }\n  };\n\n  Spa.prototype.get = function (i) {\n    var node = this._values[i];\n\n    if (node) {\n      return node.value;\n    }\n\n    return 0;\n  };\n\n  Spa.prototype.accumulate = function (i, v) {\n    // node @ i\n    var node = this._values[i];\n\n    if (!node) {\n      // insert in heap\n      node = this._heap.insert(i, v); // initialize value\n\n      this._values[i] = node;\n    } else {\n      // accumulate value\n      node.value = add(node.value, v);\n    }\n  };\n\n  Spa.prototype.forEach = function (from, to, callback) {\n    // references\n    var heap = this._heap;\n    var values = this._values; // nodes\n\n    var nodes = []; // node with minimum key, save it\n\n    var node = heap.extractMinimum();\n\n    if (node) {\n      nodes.push(node);\n    } // extract nodes from heap (ordered)\n\n\n    while (node && node.key <= to) {\n      // check it is in range\n      if (node.key >= from) {\n        // check value is not zero\n        if (!equalScalar(node.value, 0)) {\n          // invoke callback\n          callback(node.key, node.value, this);\n        }\n      } // extract next node, save it\n\n\n      node = heap.extractMinimum();\n\n      if (node) {\n        nodes.push(node);\n      }\n    } // reinsert all nodes in heap\n\n\n    for (var i = 0; i < nodes.length; i++) {\n      // current node\n      var n = nodes[i]; // insert node in heap\n\n      node = heap.insert(n.key, n.value); // update values\n\n      values[node.key] = node;\n    }\n  };\n\n  Spa.prototype.swap = function (i, j) {\n    // node @ i and j\n    var nodei = this._values[i];\n    var nodej = this._values[j]; // check we need to insert indeces\n\n    if (!nodei && nodej) {\n      // insert in heap\n      nodei = this._heap.insert(i, nodej.value); // remove from heap\n\n      this._heap.remove(nodej); // set values\n\n\n      this._values[i] = nodei;\n      this._values[j] = undefined;\n    } else if (nodei && !nodej) {\n      // insert in heap\n      nodej = this._heap.insert(j, nodei.value); // remove from heap\n\n      this._heap.remove(nodei); // set values\n\n\n      this._values[j] = nodej;\n      this._values[i] = undefined;\n    } else if (nodei && nodej) {\n      // swap values\n      var v = nodei.value;\n      nodei.value = nodej.value;\n      nodej.value = v;\n    }\n  };\n\n  return Spa;\n}\n\nexports.name = 'Spa';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nvar util = require('../../utils/index');\n\nvar DimensionError = require('../../error/DimensionError');\n\nvar array = util.array;\nvar object = util.object;\nvar string = util.string;\nvar number = util.number;\nvar isArray = Array.isArray;\nvar isNumber = number.isNumber;\nvar isInteger = number.isInteger;\nvar isString = string.isString;\nvar validateIndex = array.validateIndex;\n\nfunction factory(type, config, load, typed) {\n  var Matrix = load(require('./Matrix')); // force loading Matrix (do not use via type.Matrix)\n\n  var equalScalar = load(require('../../function/relational/equalScalar'));\n  var getArrayDataType = load(require('./utils/getArrayDataType'));\n  /**\n   * Sparse Matrix implementation. This type implements a Compressed Column Storage format\n   * for sparse matrices.\n   * @class SparseMatrix\n   */\n\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n\n    if (type.isMatrix(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype);\n    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n      // initialize fields\n      this._values = data.values;\n      this._index = data.index;\n      this._ptr = data.ptr;\n      this._size = data.size;\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // create from array\n      _createFromArray(this, data, datatype);\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + util.types.type(data) + ')');\n    } else {\n      // nothing provided\n      this._values = [];\n      this._index = [];\n      this._ptr = [0];\n      this._size = [0, 0];\n      this._datatype = datatype;\n    }\n  }\n\n  function _createFromMatrix(matrix, source, datatype) {\n    // check matrix type\n    if (source.type === 'SparseMatrix') {\n      // clone arrays\n      matrix._values = source._values ? object.clone(source._values) : undefined;\n      matrix._index = object.clone(source._index);\n      matrix._ptr = object.clone(source._ptr);\n      matrix._size = object.clone(source._size);\n      matrix._datatype = datatype || source._datatype;\n    } else {\n      // build from matrix data\n      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);\n    }\n  }\n\n  function _createFromArray(matrix, data, datatype) {\n    // initialize fields\n    matrix._values = [];\n    matrix._index = [];\n    matrix._ptr = [];\n    matrix._datatype = datatype; // discover rows & columns, do not use math.size() to avoid looping array twice\n\n    var rows = data.length;\n    var columns = 0; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, datatype);\n    } // check we have rows (empty array)\n\n\n    if (rows > 0) {\n      // column index\n      var j = 0;\n\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length); // loop rows\n\n\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i]; // check row is an array\n\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            } // check row has column\n\n\n            if (j < row.length) {\n              // value\n              var v = row[j]; // check value != 0\n\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v); // index\n\n\n                matrix._index.push(i);\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) {\n              columns = 1;\n            } // check value != 0 (row is a scalar)\n\n\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row); // index\n\n\n              matrix._index.push(i);\n            }\n          }\n        } // increment index\n\n\n        j++;\n      } while (j < columns);\n    } // store number of values in ptr\n\n\n    matrix._ptr.push(matrix._index.length); // size\n\n\n    matrix._size = [rows, columns];\n  }\n\n  SparseMatrix.prototype = new Matrix();\n  /**\n   * Attach type information\n   */\n\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf SparseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values);\n  };\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The storage format.\n   */\n\n\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\n  };\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The datatype.\n   */\n\n\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n\n\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n  /**\n   * Get the matrix density.\n   *\n   * Usage:\n   *     const density = matrix.density()                   // retrieve matrix density\n   *\n   * @memberof SparseMatrix\n   * @return {number}           The matrix density.\n   */\n\n\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1]; // calculate density\n\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n  };\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof SparseMatrix\n   * @param {Index} index\n   * @param {Array | Maytrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n\n\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke subset on a Pattern only matrix');\n    } // check arguments\n\n\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n      // intentional fall through\n\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue);\n\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n\n  function _getsubset(matrix, idx) {\n    // check idx\n    if (!type.isIndex(idx)) {\n      throw new TypeError('Invalid index');\n    }\n\n    var isScalar = idx.isScalar();\n\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    } // validate dimensions\n\n\n    var size = idx.size();\n\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    } // vars\n\n\n    var i, ii, k, kk; // validate if any of the ranges in the index is out of range\n\n    var min = idx.min();\n    var max = idx.max();\n\n    for (i = 0, ii = matrix._size.length; i < ii; i++) {\n      validateIndex(min[i], matrix._size[i]);\n      validateIndex(max[i], matrix._size[i]);\n    } // matrix arrays\n\n\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr; // rows & columns dimensions for result matrix\n\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1); // workspace & permutation vector\n\n    var w = [];\n    var pv = []; // loop rows in resulting matrix\n\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0]; // mark i in workspace\n\n      w[i] = true;\n    }); // result matrix arrays\n\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = []; // loop columns in result matrix\n\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length); // loop values in column j\n\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k]; // check row is in result matrix\n\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]); // check we need to process values\n\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    }); // update ptr\n\n    ptr.push(index.length); // return matrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: size,\n      datatype: matrix._datatype\n    });\n  }\n\n  function _setsubset(matrix, index, submatrix, defaultValue) {\n    // check index\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    } // get index size and check whether the index contains a single value\n\n\n    var iSize = index.size();\n    var isScalar = index.isScalar(); // calculate the size of the submatrix, and convert it into an Array if needed\n\n    var sSize;\n\n    if (type.isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size(); // use array representation\n\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = array.size(submatrix);\n    } // check index is a scalar\n\n\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      } // set value\n\n\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // validate dimensions, index size must be one or two dimensions\n      if (iSize.length !== 1 && iSize.length !== 2) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      } // check submatrix and index have the same dimensions\n\n\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        } // unsqueeze both outer and inner dimensions\n\n\n        submatrix = array.unsqueeze(submatrix, iSize.length, outer, sSize);\n      } // check whether the size of the submatrix matches the index size\n\n\n      if (!object.deepEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      } // offsets\n\n\n      var x0 = index.min()[0];\n      var y0 = index.min()[1]; // submatrix rows and columns\n\n      var m = sSize[0];\n      var n = sSize[1]; // loop submatrix\n\n      for (var x = 0; x < m; x++) {\n        // loop columns\n        for (var y = 0; y < n; y++) {\n          // value at i, j\n          var v = submatrix[x][y]; // invoke set (zero value will remove entry from matrix)\n\n          matrix.set([x + x0, y + y0], v, defaultValue);\n        }\n      }\n    }\n\n    return matrix;\n  }\n  /**\n   * Get a single element from the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n\n\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check it is a pattern matrix\n\n\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    } // row and column\n\n\n    var i = index[0];\n    var j = index[1]; // check i, j are valid\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]); // find value index\n\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row\n\n\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n\n    return 0;\n  };\n  /**\n   * Replace a single element in the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be set to zero.\n   * @return {SparseMatrix} self\n   */\n\n\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    } // check it is a pattern matrix\n\n\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    } // row and column\n\n\n    var i = index[0];\n    var j = index[1]; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, this._datatype);\n    } // check we need to resize matrix\n\n\n    if (i > rows - 1 || j > columns - 1) {\n      // resize matrix\n      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue); // update rows & columns\n\n\n      rows = this._size[0];\n      columns = this._size[1];\n    } // check i, j are valid\n\n\n    validateIndex(i, rows);\n    validateIndex(j, columns); // find value index\n\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); // check k is prior to next column k and it is in the correct row\n\n\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      // check value != 0\n      if (!eq(v, zero)) {\n        // update value\n        this._values[k] = v;\n      } else {\n        // remove value from matrix\n        _remove(k, j, this._values, this._index, this._ptr);\n      }\n    } else {\n      // insert value @ (i, j)\n      _insert(k, i, j, v, this._values, this._index, this._ptr);\n    }\n\n    return this;\n  };\n\n  function _getValueIndex(i, top, bottom, index) {\n    // check row is on the bottom side\n    if (bottom - top === 0) {\n      return bottom;\n    } // loop rows [top, bottom[\n\n\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    } // we did not find row\n\n\n    return top;\n  }\n\n  function _remove(k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1);\n    index.splice(k, 1); // update pointers\n\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v); // update row for k\n\n    index.splice(k, 0, i); // update column pointers\n\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]++;\n    }\n  }\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof SparseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n\n\n  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isArray(size)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // check sizes\n\n\n    size.forEach(function (value) {\n      if (!number.isNumber(value) || !number.isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + string.format(size) + ')');\n      }\n    }); // matrix to resize\n\n    var m = copy ? this.clone() : this; // resize matrix\n\n    return _resize(m, size[0], size[1], defaultValue);\n  };\n\n  function _resize(matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    var value = defaultValue || 0; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, matrix._datatype); // convert value to the same datatype\n\n      value = typed.convert(value, matrix._datatype);\n    } // should we insert the value?\n\n\n    var ins = !eq(value, zero); // old columns and rows\n\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k; // check we need to increase columns\n\n    if (columns > c) {\n      // loop new columns\n      for (j = c; j < columns; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._values.length; // check we need to insert matrix._values\n\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value); // update matrix._index\n\n\n            matrix._index.push(i);\n          }\n        }\n      } // store number of matrix._values in matrix._ptr\n\n\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns); // truncate matrix._values and matrix._index\n\n\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    } // update columns\n\n\n    c = columns; // check we need to increase rows\n\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0; // loop columns\n\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n; // where to insert matrix._values\n\n          k = matrix._ptr[j + 1] + n; // pointer\n\n          var p = 0; // loop new rows, initialize pointer\n\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value); // update matrix._index\n\n\n            matrix._index.splice(k + p, 0, i); // increment inserts\n\n\n            n++;\n          }\n        } // store number of matrix._values in matrix._ptr\n\n\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0; // loop columns\n\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d; // where matrix._values start for next column\n\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d; // loop matrix._index\n\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k]; // check we need to delete value and matrix._index\n\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1); // remove item from matrix._index\n\n\n            matrix._index.splice(k, 1); // increase deletes\n\n\n            d++;\n          }\n        }\n      } // update matrix._ptr for current column\n\n\n      matrix._ptr[j] = matrix._values.length;\n    } // update matrix._size\n\n\n    matrix._size[0] = rows;\n    matrix._size[1] = columns; // return matrix\n\n    return matrix;\n  }\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof SparseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n\n\n  SparseMatrix.prototype.reshape = function (size, copy) {\n    // validate arguments\n    if (!isArray(size)) {\n      throw new TypeError('Array expected');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    } // check sizes\n\n\n    size.forEach(function (value) {\n      if (!number.isNumber(value) || !number.isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + string.format(size) + ')');\n      }\n    }); // m * n must not change\n\n    if (this._size[0] * this._size[1] !== size[0] * size[1]) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    } // matrix to reshape\n\n\n    var m = copy ? this.clone() : this; // return unchanged if the same shape\n\n    if (this._size[0] === size[0] && this._size[1] === size[1]) {\n      return m;\n    } // Convert to COO format (generate a column index)\n\n\n    var colIndex = [];\n\n    for (var i = 0; i < m._ptr.length; i++) {\n      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i);\n      }\n    } // Clone the values array\n\n\n    var values = m._values.slice(); // Clone the row index array\n\n\n    var rowIndex = m._index.slice(); // Transform the (row, column) indices\n\n\n    for (var _i = 0; _i < m._index.length; _i++) {\n      var r1 = rowIndex[_i];\n      var c1 = colIndex[_i];\n      var flat = r1 * m._size[1] + c1;\n      colIndex[_i] = flat % size[1];\n      rowIndex[_i] = Math.floor(flat / size[1]);\n    } // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored\n    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,\n    // sorting several arrays based on some other array.\n    // OR, we could easily just:\n    // 1. Remove all values from the matrix\n\n\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = size[1] + 1;\n    m._size = size.slice();\n\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\n    } // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)\n    // This step is probably the most time-consuming\n\n\n    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    } // The value indices are inserted out of order, but apparently that's... still OK?\n\n\n    return m;\n  };\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n\n\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? object.clone(this._values) : undefined,\n      index: object.clone(this._index),\n      ptr: object.clone(this._ptr),\n      size: object.clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n\n\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\n  };\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {SparseMatrix} matrix\n   */\n\n\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke map on a Pattern only matrix');\n    } // matrix instance\n\n\n    var me = this; // rows and columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // invoke callback\n\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      return callback(v, [i, j], me);\n    }; // invoke _map\n\n\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n  };\n  /**\n   * Create a new matrix with the results of the callback function executed on the interval\n   * [minRow..maxRow, minColumn..maxColumn].\n   */\n\n\n  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = []; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, matrix._datatype);\n    } // invoke callback\n\n\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y); // check value != 0\n\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v); // index\n\n        index.push(x);\n      }\n    }; // loop columns\n\n\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length); // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = matrix._index[k]; // check i is in range\n\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn);\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        var _values = {};\n\n        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        } // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n\n\n        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n          var value = _i5 in _values ? _values[_i5] : 0;\n          invoke(value, _i5 - minRow, j - minColumn);\n        }\n      }\n    } // store number of values in ptr\n\n\n    ptr.push(values.length); // return sparse matrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n    });\n  }\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   */\n\n\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke forEach on a Pattern only matrix');\n    } // matrix instance\n\n\n    var me = this; // rows and columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = this._index[k]; // value @ k\n\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        } // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n\n\n        for (var _i7 = 0; _i7 < rows; _i7++) {\n          var value = _i7 in values ? values[_i7] : 0;\n          callback(value, [_i7, j], me);\n        }\n      }\n    }\n  };\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n\n\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n\n\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false);\n  };\n\n  function _toArray(values, index, ptr, size, copy) {\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1]; // result\n\n    var a = []; // vars\n\n    var i, j; // initialize array\n\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    } // loop columns\n\n\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // loop k within [k0, k1[\n\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k]; // set value (use one for pattern matrix)\n\n        a[i][j] = values ? copy ? object.clone(values[k]) : values[k] : 1;\n      }\n    }\n\n    return a;\n  }\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof SparseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n\n\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1]; // density\n\n    var density = this.density(); // rows & columns\n\n    var str = 'Sparse Matrix [' + string.format(rows, options) + ' x ' + string.format(columns, options) + '] density: ' + string.format(density, options) + '\\n'; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1]; // loop k within [k0, k1[\n\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k]; // append value\n\n        str += '\\n    (' + string.format(i, options) + ', ' + string.format(j, options) + ') ==> ' + (this._values ? string.format(this._values[k], options) : 'X');\n      }\n    }\n\n    return str;\n  };\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n\n\n  SparseMatrix.prototype.toString = function () {\n    return string.format(this.toArray());\n  };\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n\n\n  SparseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'SparseMatrix',\n      values: this._values,\n      index: this._index,\n      ptr: this._ptr,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof SparseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix vector with the diagonal values.\n   */\n\n\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (type.isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows & columns\n\n    var rows = this._size[0];\n    var columns = this._size[1]; // number diagonal values\n\n    var n = Math.min(rows - kSub, columns - kSuper); // diagonal arrays\n\n    var values = [];\n    var index = [];\n    var ptr = []; // initial ptr value\n\n    ptr[0] = 0; // loop columns\n\n    for (var j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1]; // loop x within [k0, k1[\n\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x]; // check row\n\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]); // store row\n\n          index[values.length - 1] = i - kSub; // exit loop\n\n          break;\n        }\n      }\n    } // close ptr\n\n\n    ptr.push(values.length); // return matrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [n, 1]\n    });\n  };\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof SparseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SparseMatrix\", \"values\": [], \"index\": [], \"ptr\": [], \"size\": []}`,\n   *                       where mathjs is optional\n   * @returns {SparseMatrix}\n   */\n\n\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\n  };\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {Array} size                       The matrix size.\n   * @param {number | Array | Matrix } value   The values for the diagonal.\n   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.\n   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.\n   *\n   * @returns {SparseMatrix}\n   */\n\n\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    } // map size & validate\n\n\n    size = size.map(function (s) {\n      // check it is a big number\n      if (type.isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      } // validate arguments\n\n\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n\n      return s;\n    }); // validate k if any\n\n    if (k) {\n      // convert BigNumber to a number\n      if (type.isBigNumber(k)) {\n        k = k.toNumber();\n      } // is must be an integer\n\n\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    } // equal signature to use\n\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0;\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar; // convert 0 to the same datatype\n\n      zero = typed.convert(0, datatype);\n    }\n\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0; // rows and columns\n\n    var rows = size[0];\n    var columns = size[1]; // number of non-zero items\n\n    var n = Math.min(rows - kSub, columns - kSuper); // value extraction function\n\n    var _value; // check value\n\n\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (type.isMatrix(value)) {\n      // matrix size\n      var ms = value.size(); // validate matrix\n\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      } // define function\n\n\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    } // create arrays\n\n\n    var values = [];\n    var index = [];\n    var ptr = []; // loop items\n\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length); // diagonal index\n\n      var i = j - kSuper; // check we need to set diagonal value\n\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i); // check for zero\n\n\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub); // add value\n\n          values.push(v);\n        }\n      }\n    } // last value should be number of values\n\n\n    ptr.push(values.length); // create SparseMatrix\n\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [rows, columns]\n    });\n  };\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n\n\n  SparseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    } // check dimensions\n\n\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    } // validate index\n\n\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]); // swap rows\n\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); // return current instance\n\n\n    return this;\n  };\n  /**\n   * Loop rows with data in column j.\n   *\n   * @param {number} j            Column\n   * @param {Array} values        Matrix values\n   * @param {Array} index         Matrix row indeces\n   * @param {Array} ptr           Matrix column pointers\n   * @param {Function} callback   Callback function invoked for every row in column j\n   */\n\n\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1]; // loop\n\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\n    }\n  };\n  /**\n   * Swap rows x and y in Sparse Matrix data structures.\n   *\n   * @param {number} x         Matrix row index 1\n   * @param {number} y         Matrix row index 2\n   * @param {number} columns   Number of columns in matrix\n   * @param {Array} values     Matrix values\n   * @param {Array} index      Matrix row indeces\n   * @param {Array} ptr        Matrix column pointers\n   */\n\n\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1]; // find value index @ x\n\n      var kx = _getValueIndex(x, k0, k1, index); // find value index @ x\n\n\n      var ky = _getValueIndex(y, k0, k1, index); // check both rows exist in matrix\n\n\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          var v = values[kx];\n          values[kx] = values[ky];\n          values[ky] = v;\n        } // next column\n\n\n        continue;\n      } // check x row exist & no y row\n\n\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        var vx = values ? values[kx] : undefined; // insert value @ y\n\n        index.splice(ky, 0, y);\n\n        if (values) {\n          values.splice(ky, 0, vx);\n        } // remove value @ x (adjust array index if needed)\n\n\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        } // next column\n\n\n        continue;\n      } // check y row exist & no x row\n\n\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        var vy = values ? values[ky] : undefined; // insert value @ x\n\n        index.splice(kx, 0, x);\n\n        if (values) {\n          values.splice(kx, 0, vy);\n        } // remove value @ y (adjust array index if needed)\n\n\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  }; // register this type in the base class Matrix\n\n\n  type.Matrix._storage.sparse = SparseMatrix;\n  return SparseMatrix;\n}\n\nexports.name = 'SparseMatrix';\nexports.path = 'type';\nexports.factory = factory;\nexports.lazy = false; // no lazy loading, as we alter type.Matrix._storage","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create an index. An Index can store ranges having start, step, and end\n   * for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Syntax:\n   *\n   *     math.index(range1, range2, ...)\n   *\n   * Where each range can be any of:\n   *\n   * - A number\n   * - A string for getting/setting an object property\n   * - An instance of `Range`\n   * - A one-dimensional Array or a Matrix with numbers\n   *\n   * Indexes must be zero-based, integer numbers.\n   *\n   * Examples:\n   *\n   *    const math = require('mathjs')\n   *\n   *    const b = [1, 2, 3, 4, 5]\n   *    math.subset(b, math.index([1, 2, 3]))     // returns [2, 3, 4]\n   *\n   *    const a = math.matrix([[1, 2], [3, 4]])\n   *    a.subset(math.index(0, 1))             // returns 2\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, matrix, number, string, unit\n   *\n   * @param {...*} ranges   Zero or more ranges or numbers.\n   * @return {Index}        Returns the created index\n   */\n  return typed('index', {\n    '...number | string | BigNumber | Range | Array | Matrix': function numberStringBigNumberRangeArrayMatrix(args) {\n      var ranges = args.map(function (arg) {\n        if (type.isBigNumber(arg)) {\n          return arg.toNumber(); // convert BigNumber to Number\n        } else if (Array.isArray(arg) || type.isMatrix(arg)) {\n          return arg.map(function (elem) {\n            // convert BigNumber to Number\n            return type.isBigNumber(elem) ? elem.toNumber() : elem;\n          });\n        } else {\n          return arg;\n        }\n      });\n      var res = new type.Index();\n      type.Index.apply(res, ranges);\n      return res;\n    }\n  });\n}\n\nexports.name = 'index';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a Matrix. The function creates a new `math.type.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   * Supported storage formats are 'dense' and 'sparse'.\n   *\n   * Syntax:\n   *\n   *    math.matrix()                         // creates an empty matrix using default storage format (dense).\n   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).\n   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.\n   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.\n   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.\n   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.\n   *\n   * Examples:\n   *\n   *    let m = math.matrix([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, sparse\n   *\n   * @param {Array | Matrix} [data]    A multi dimensional array\n   * @param {string} [format]          The Matrix storage format\n   *\n   * @return {Matrix} The created matrix\n   */\n  var matrix = typed('matrix', {\n    '': function _() {\n      return _create([]);\n    },\n    'string': function string(format) {\n      return _create([], format);\n    },\n    'string, string': function stringString(format, datatype) {\n      return _create([], format, datatype);\n    },\n    'Array': function Array(data) {\n      return _create(data);\n    },\n    'Matrix': function Matrix(data) {\n      return _create(data, data.storage());\n    },\n    'Array | Matrix, string': _create,\n    'Array | Matrix, string, string': _create\n  });\n  matrix.toTex = {\n    0: '\\\\begin{bmatrix}\\\\end{bmatrix}',\n    1: \"\\\\left(${args[0]}\\\\right)\",\n    2: \"\\\\left(${args[0]}\\\\right)\"\n  };\n  return matrix;\n  /**\n   * Create a new Matrix with given storage format\n   * @param {Array} data\n   * @param {string} [format]\n   * @param {string} [datatype]\n   * @returns {Matrix} Returns a new Matrix\n   * @private\n   */\n\n  function _create(data, format, datatype) {\n    // get storage format constructor\n    var M = type.Matrix.storage(format || 'default'); // create instance\n\n    return new M(data, datatype);\n  }\n}\n\nexports.name = 'matrix';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Create a Sparse Matrix. The function creates a new `math.type.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   *\n   * Syntax:\n   *\n   *    math.sparse()               // creates an empty sparse matrix.\n   *    math.sparse(data)           // creates a sparse matrix with initial data.\n   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.\n   *\n   * Examples:\n   *\n   *    let m = math.sparse([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, matrix\n   *\n   * @param {Array | Matrix} [data]    A two dimensional array\n   *\n   * @return {Matrix} The created matrix\n   */\n\n  var sparse = typed('sparse', {\n    '': function _() {\n      return new SparseMatrix([]);\n    },\n    'string': function string(datatype) {\n      return new SparseMatrix([], datatype);\n    },\n    'Array | Matrix': function ArrayMatrix(data) {\n      return new SparseMatrix(data);\n    },\n    'Array | Matrix, string': function ArrayMatrixString(data, datatype) {\n      return new SparseMatrix(data, datatype);\n    }\n  });\n  sparse.toTex = {\n    0: '\\\\begin{bsparse}\\\\end{bsparse}',\n    1: \"\\\\left(${args[0]}\\\\right)\"\n  };\n  return sparse;\n}\n\nexports.name = 'sparse';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// types\nrequire('./Matrix'), require('./DenseMatrix'), require('./SparseMatrix'), require('./Spa'), require('./FibonacciHeap'), require('./ImmutableDenseMatrix'), require('./MatrixIndex'), require('./Range'), // construction functions\nrequire('./function/index'), require('./function/matrix'), require('./function/sparse'), // util functions\nrequire('./utils/getArrayDataType')];","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  Dij          ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n\n  var algorithm01 = function algorithm01(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // process data types\n\n    var dt = typeof adt === 'string' && adt === bdt ? adt : undefined; // callback function\n\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback; // vars\n\n    var i, j; // result (DenseMatrix)\n\n    var cdata = []; // initialize c\n\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    } // workspace\n\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns in b\n\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // update workspace\n\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // mark i as updated\n\n        w[i] = mark;\n      } // loop rows\n\n\n      for (i = 0; i < rows; i++) {\n        // check row is in workspace\n        if (w[i] === mark) {\n          // c[i][j] was already calculated\n          cdata[i][j] = x[i];\n        } else {\n          // item does not exist in S\n          cdata[i][j] = adata[i][j];\n        }\n      }\n    } // return dense matrix\n\n\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n\n  return algorithm01;\n}\n\nexports.name = 'algorithm01';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n\n  var algorithm02 = function algorithm02(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result (SparseMatrix)\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // loop columns in b\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k]; // update C(i,j)\n\n        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]); // check for nonzero\n\n        if (!eq(cij, zero)) {\n          // push i & v\n          cindex.push(i);\n          cvalues.push(cij);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n\n  return algorithm02;\n}\n\nexports.name = 'algorithm02';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked M*N times.\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(Dij, 0)    ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n\n  var algorithm03 = function algorithm03(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype; // sparse matrix arrays\n\n    var bvalues = sparseMatrix._values;\n    var bindex = sparseMatrix._index;\n    var bptr = sparseMatrix._ptr;\n    var bsize = sparseMatrix._size;\n    var bdt = sparseMatrix._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result (DenseMatrix)\n\n\n    var cdata = []; // initialize dense matrix\n\n    for (var z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = [];\n    } // workspace\n\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns in b\n\n    for (var j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1; // values in column j\n\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k]; // update workspace\n\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        w[i] = mark;\n      } // process workspace\n\n\n      for (var y = 0; y < rows; y++) {\n        // check we have a calculated value for current row\n        if (w[y] === mark) {\n          // use calculated value\n          cdata[y][j] = x[y];\n        } else {\n          // calculate value\n          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);\n        }\n      }\n    } // return dense matrix\n\n\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n\n  return algorithm03;\n}\n\nexports.name = 'algorithm03';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0\n   *          └  B(i,j)       ; B(i,j) !== 0\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n\n  var algorithm04 = function algorithm04(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspace\n\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // vars\n\n    var i, j, k, k0, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop A(:,j)\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // update c\n\n        cindex.push(i); // update workspace\n\n        wa[i] = mark; // check we need to process values\n\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      } // loop B(:,j)\n\n\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // check row exists in A\n\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            var v = cf(xa[i], bvalues[k]); // check for zero\n\n            if (!eq(v, zero)) {\n              // update workspace\n              xa[i] = v;\n            } else {\n              // remove mark (index will be removed later)\n              wa[i] = null;\n            }\n          }\n        } else {\n          // update c\n          cindex.push(i); // update workspace\n\n          wb[i] = mark; // check we need to process values\n\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      } // check we need to process values (non pattern matrix)\n\n\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]; // check workspace has value @ i\n\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i]; // increment pointer\n\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i]; // increment pointer\n\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return c;\n  };\n\n  return algorithm04;\n}\n\nexports.name = 'algorithm04';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n\n  var algorithm05 = function algorithm05(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspaces\n\n    var xa = cvalues ? [] : undefined;\n    var xb = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // vars\n\n    var i, j, k, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop values A(:,j)\n\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k]; // push index\n\n        cindex.push(i); // update workspace\n\n        wa[i] = mark; // check we need to process values\n\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      } // loop values B(:,j)\n\n\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k]; // check row existed in A\n\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i);\n        } // update workspace\n\n\n        wb[i] = mark; // check we need to process values\n\n        if (xb) {\n          xb[i] = bvalues[k];\n        }\n      } // check we need to process values (non pattern matrix)\n\n\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]; // marks\n\n          var wai = wa[i];\n          var wbi = wb[i]; // check Aij or Bij are nonzero\n\n          if (wai === mark || wbi === mark) {\n            // matrix values @ i,j\n            var va = wai === mark ? xa[i] : zero;\n            var vb = wbi === mark ? xb[i] : zero; // Cij\n\n            var vc = cf(va, vb); // check for zero\n\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc); // increment pointer\n\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return c;\n  };\n\n  return algorithm05;\n}\n\nexports.name = 'algorithm05';\nexports.factory = factory;","'use strict';\n\nvar scatter = require('./../../../utils/collection/scatter');\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n\n  var algorithm06 = function algorithm06(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspaces\n\n    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var w = []; // marks indicating value in a given row has been updated\n\n    var u = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n      scatter(a, j, w, x, u, mark, c, cf); // scatter the values of B(:,j) into workspace\n\n      scatter(b, j, w, x, u, mark, c, cf); // check we need to process values (non pattern matrix)\n\n      if (x) {\n        // initialize first index in j\n        var k = cptr[j]; // loop index in j\n\n        while (k < cindex.length) {\n          // row\n          var i = cindex[k]; // check function was invoked on current row (Aij !=0 && Bij != 0)\n\n          if (u[i] === mark) {\n            // value @ i\n            var v = x[i]; // check for zero value\n\n            if (!eq(v, zero)) {\n              // push value\n              cvalues.push(v); // increment pointer\n\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          } else {\n            // remove value @ i, do not increment pointer\n            cindex.splice(k, 1);\n          }\n        }\n      } else {\n        // initialize first index in j\n        var p = cptr[j]; // loop index in j\n\n        while (p < cindex.length) {\n          // row\n          var r = cindex[p]; // check function was invoked on current row (Aij !=0 && Bij != 0)\n\n          if (u[r] !== mark) {\n            // remove value @ i, do not increment pointer\n            cindex.splice(p, 1);\n          } else {\n            // increment pointer\n            p++;\n          }\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return c;\n  };\n\n  return algorithm06;\n}\n\nexports.name = 'algorithm06';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j) = f(Aij, Bij)\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n\n  var algorithm07 = function algorithm07(a, b, callback) {\n    // sparse matrix arrays\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // vars\n\n\n    var i, j; // result arrays\n\n    var cdata = []; // initialize c\n\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    } // matrix\n\n\n    var c = new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspaces\n\n    var xa = [];\n    var xb = []; // marks indicating we have a value in x for a given column\n\n    var wa = [];\n    var wb = []; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // scatter the values of A(:,j) into workspace\n\n      _scatter(a, j, wa, xa, mark); // scatter the values of B(:,j) into workspace\n\n\n      _scatter(b, j, wb, xb, mark); // loop rows\n\n\n      for (i = 0; i < rows; i++) {\n        // matrix values @ i,j\n        var va = wa[i] === mark ? xa[i] : zero;\n        var vb = wb[i] === mark ? xb[i] : zero; // invoke callback\n\n        cdata[i][j] = cf(va, vb);\n      }\n    } // return sparse matrix\n\n\n    return c;\n  };\n\n  function _scatter(m, j, w, x, mark) {\n    // a arrays\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr; // loop values in column j\n\n    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      var i = index[k]; // update workspace\n\n      w[i] = mark;\n      x[i] = values[k];\n    }\n  }\n\n  return algorithm07;\n}\n\nexports.name = 'algorithm07';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n\n  var algorithm08 = function algorithm08(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // sparse matrix cannot be a Pattern matrix\n\n\n    if (!avalues || !bvalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrices');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspace\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // vars\n\n    var k, k0, k1, i; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // columns mark\n\n      var mark = j + 1; // loop values in a\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // mark workspace\n\n        w[i] = mark; // set value\n\n        x[i] = avalues[k]; // add index\n\n        cindex.push(i);\n      } // loop values in b\n\n\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]; // check value exists in workspace\n\n        if (w[i] === mark) {\n          // evaluate callback\n          x[i] = cf(x[i], bvalues[k]);\n        }\n      } // initialize first index in j\n\n\n      k = cptr[j]; // loop index in j\n\n      while (k < cindex.length) {\n        // row\n        i = cindex[k]; // value @ i\n\n        var v = x[i]; // check for zero value\n\n        if (!eq(v, zero)) {\n          // push value\n          cvalues.push(v); // increment pointer\n\n          k++;\n        } else {\n          // remove value @ i, do not increment pointer\n          cindex.splice(k, 1);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return c;\n  };\n\n  return algorithm08;\n}\n\nexports.name = 'algorithm08';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).\n   * Callback function invoked NZA times, number of nonzero elements in A.\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n\n  var algorithm09 = function algorithm09(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var asize = a._size;\n    var adt = a._datatype; // sparse matrix arrays\n\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // check rows & columns\n\n\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = []; // matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspaces\n\n    var x = cvalues ? [] : undefined; // marks indicating we have a value in x for a given column\n\n    var w = []; // vars\n\n    var i, j, k, k0, k1; // loop columns\n\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length; // column mark\n\n      var mark = j + 1; // check we need to process values\n\n      if (x) {\n        // loop B(:,j)\n        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n          // row\n          i = bindex[k]; // update workspace\n\n          w[i] = mark;\n          x[i] = bvalues[k];\n        }\n      } // loop A(:,j)\n\n\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]; // check we need to process values\n\n        if (x) {\n          // b value @ i,j\n          var vb = w[i] === mark ? x[i] : zero; // invoke f\n\n          var vc = cf(avalues[k], vb); // check zero value\n\n          if (!eq(vc, zero)) {\n            // push index\n            cindex.push(i); // push value\n\n            cvalues.push(vc);\n          }\n        } else {\n          // push index\n          cindex.push(i);\n        }\n      }\n    } // update cptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return c;\n  };\n\n  return algorithm09;\n}\n\nexports.name = 'algorithm09';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  b          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n\n  var algorithm10 = function algorithm10(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cdata = []; // matrix\n\n    var c = new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspaces\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k]; // update workspace\n\n        x[r] = avalues[k];\n        w[r] = mark;\n      } // loop rows\n\n\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        } // check sparse matrix has a value @ i,j\n\n\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = b;\n        }\n      }\n    } // return sparse matrix\n\n\n    return c;\n  };\n\n  return algorithm10;\n}\n\nexports.name = 'algorithm10';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var equalScalar = load(require('../../../function/relational/equalScalar'));\n  var SparseMatrix = type.SparseMatrix;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n\n  var algorithm11 = function algorithm11(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // equal signature to use\n\n    var eq = equalScalar; // zero value\n\n    var zero = 0; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // find signature that matches (dt, dt)\n\n      eq = typed.find(equalScalar, [dt, dt]); // convert 0 to the same datatype\n\n      zero = typed.convert(0, dt); // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cvalues = [];\n    var cindex = [];\n    var cptr = []; // matrix\n\n    var c = new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    }); // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k]; // invoke callback\n\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b); // check value is zero\n\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    } // update ptr\n\n\n    cptr[columns] = cindex.length; // return sparse matrix\n\n    return c;\n  };\n\n  return algorithm11;\n}\n\nexports.name = 'algorithm11';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked MxN times.\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(0, b)    ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n\n  var algorithm12 = function algorithm12(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype; // sparse matrix cannot be a Pattern matrix\n\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    } // rows & columns\n\n\n    var rows = asize[0];\n    var columns = asize[1]; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // result arrays\n\n\n    var cdata = []; // matrix\n\n    var c = new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    }); // workspaces\n\n    var x = []; // marks indicating we have a value in x for a given column\n\n    var w = []; // loop columns\n\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1; // values in j\n\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k]; // update workspace\n\n        x[r] = avalues[k];\n        w[r] = mark;\n      } // loop rows\n\n\n      for (var i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = [];\n        } // check sparse matrix has a value @ i,j\n\n\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);\n        }\n      }\n    } // return sparse matrix\n\n\n    return c;\n  };\n\n  return algorithm12;\n}\n\nexports.name = 'algorithm12';\nexports.factory = factory;","'use strict';\n\nvar DimensionError = require('../../../error/DimensionError');\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, Bij..z)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Matrix}   b                 The DenseMatrix instance (B)\n   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658\n   */\n\n  var algorithm13 = function algorithm13(a, b, callback) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // b arrays\n\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype; // c arrays\n\n    var csize = []; // validate dimensions\n\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    } // validate each one of the dimension sizes\n\n\n    for (var s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) {\n        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n      } // update dimension in c\n\n\n      csize[s] = asize[s];\n    } // datatype\n\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt; // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // populate cdata, iterate through dimensions\n\n\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []; // c matrix\n\n    return new DenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  }; // recursive function\n\n\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = []; // check we reach the last level\n\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i]);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);\n      }\n    }\n\n    return cv;\n  }\n\n  return algorithm13;\n}\n\nexports.name = 'algorithm13';\nexports.factory = factory;","'use strict';\n\nvar clone = require('../../../utils/object').clone;\n\nfunction factory(type, config, load, typed) {\n  var DenseMatrix = type.DenseMatrix;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, b)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij..z,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042\n   */\n\n  var algorithm14 = function algorithm14(a, b, callback, inverse) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype; // datatype\n\n    var dt; // callback signature to use\n\n    var cf = callback; // process data types\n\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt; // convert b to the same datatype\n\n      b = typed.convert(b, dt); // callback\n\n      cf = typed.find(callback, [dt, dt]);\n    } // populate cdata, iterate through dimensions\n\n\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []; // c matrix\n\n    return new DenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  }; // recursive function\n\n\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = []; // check we reach the last level\n\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n      }\n    }\n\n    return cv;\n  }\n\n  return algorithm14;\n}\n\nexports.name = 'algorithm14';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var _typeof = load(require('../../../function/utils/typeof'));\n\n  function getArrayDataType(array) {\n    var _type; // to hold type info\n\n\n    var _length = 0; // to hold length value to ensure it has consistent sizes\n\n    for (var i = 0; i < array.length; i++) {\n      var item = array[i];\n      var isArray = Array.isArray(item); // Saving the target matrix row size\n\n      if (i === 0 && isArray) {\n        _length = item.length;\n      } // If the current item is an array but the length does not equal the targetVectorSize\n\n\n      if (isArray && item.length !== _length) {\n        return undefined;\n      }\n\n      var itemType = isArray ? getArrayDataType(item) // recurse into a nested array\n      : _typeof(item);\n\n      if (_type === undefined) {\n        _type = itemType; // first item\n      } else if (_type !== itemType) {\n        return 'mixed';\n      } else {// we're good, everything has the same type so far\n      }\n    }\n\n    return _type;\n  }\n\n  return getArrayDataType;\n}\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param array\n * @return string\n */\n\n\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('./../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a number or convert a string, boolean, or unit to a number.\n   * When value is a matrix, all elements will be converted to number.\n   *\n   * Syntax:\n   *\n   *    math.number(value)\n   *    math.number(unit, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.number(2)                         // returns number 2\n   *    math.number('7.2')                     // returns number 7.2\n   *    math.number(true)                      // returns number 1\n   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]\n   *    math.number(math.unit('52cm'), 'm')    // returns 0.52\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, string, unit\n   *\n   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted\n   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number\n   * @return {number | Array | Matrix} The created number\n   */\n  var number = typed('number', {\n    '': function _() {\n      return 0;\n    },\n    'number': function number(x) {\n      return x;\n    },\n    'string': function string(x) {\n      if (x === 'NaN') return NaN;\n      var num = Number(x);\n\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is no valid number');\n      }\n\n      return num;\n    },\n    'BigNumber': function BigNumber(x) {\n      return x.toNumber();\n    },\n    'Fraction': function Fraction(x) {\n      return x.valueOf();\n    },\n    'Unit': function Unit(x) {\n      throw new Error('Second argument with valueless unit expected');\n    },\n    'null': function _null(x) {\n      return 0;\n    },\n    'Unit, string | Unit': function UnitStringUnit(unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, number);\n    }\n  });\n  number.toTex = {\n    0: \"0\",\n    1: \"\\\\left(${args[0]}\\\\right)\",\n    2: \"\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)\"\n  };\n  return number;\n}\n\nexports.name = 'number';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  var getTypeOf = load(require('../function/utils/typeof'));\n  var validInputTypes = {\n    'string': true,\n    'number': true,\n    'BigNumber': true,\n    'Fraction': true // Load the conversion functions for each output type\n\n  };\n  var validOutputTypes = {\n    'number': load(require('./number')),\n    'BigNumber': load(require('./bignumber/function/bignumber')),\n    'Fraction': load(require('./fraction/function/fraction'))\n    /**\n     * Convert a numeric value to a specific type: number, BigNumber, or Fraction\n     *\n     * @param {string | number | BigNumber | Fraction } value\n     * @param {'number' | 'BigNumber' | 'Fraction'} outputType\n     * @return {number | BigNumber | Fraction} Returns an instance of the\n     *                                         numeric in the requested type\n     */\n\n  };\n\n  var numeric = function numeric(value, outputType) {\n    var inputType = getTypeOf(value);\n\n    if (!(inputType in validInputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '));\n    }\n\n    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n    }\n\n    if (outputType === inputType) {\n      return value;\n    } else {\n      return validOutputTypes[outputType](value);\n    }\n  };\n\n  numeric.toTex = function (node, options) {\n    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.\n    return node.args[0].toTex();\n  };\n\n  return numeric;\n} // FIXME: expose numeric in the math namespace after we've decided on a name and have written proper docs for this function. See https://github.com/josdejong/mathjs/pull/1270\n// exports.name = 'type._numeric'\n\n\nexports.path = 'type';\nexports.name = '_numeric';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * A ResultSet contains a list or results\n   * @class ResultSet\n   * @param {Array} entries\n   * @constructor ResultSet\n   */\n  function ResultSet(entries) {\n    if (!(this instanceof ResultSet)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    this.entries = entries || [];\n  }\n  /**\n   * Attach type information\n   */\n\n\n  ResultSet.prototype.type = 'ResultSet';\n  ResultSet.prototype.isResultSet = true;\n  /**\n   * Returns the array with results hold by this ResultSet\n   * @memberof ResultSet\n   * @returns {Array} entries\n   */\n\n  ResultSet.prototype.valueOf = function () {\n    return this.entries;\n  };\n  /**\n   * Returns the stringified results of the ResultSet\n   * @memberof ResultSet\n   * @returns {string} string\n   */\n\n\n  ResultSet.prototype.toString = function () {\n    return '[' + this.entries.join(', ') + ']';\n  };\n  /**\n   * Get a JSON representation of the ResultSet\n   * @memberof ResultSet\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n   */\n\n\n  ResultSet.prototype.toJSON = function () {\n    return {\n      mathjs: 'ResultSet',\n      entries: this.entries\n    };\n  };\n  /**\n   * Instantiate a ResultSet from a JSON object\n   * @memberof ResultSet\n   * @param {Object} json  A JSON object structured as:\n   *                       `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n   * @return {ResultSet}\n   */\n\n\n  ResultSet.fromJSON = function (json) {\n    return new ResultSet(json.entries);\n  };\n\n  return ResultSet;\n}\n\nexports.name = 'ResultSet';\nexports.path = 'type';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// type\nrequire('./ResultSet')];","'use strict';\n\nvar deepMap = require('./../utils/collection/deepMap');\n\nvar number = require('../utils/number');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a string or convert any object into a string.\n   * Elements of Arrays and Matrices are processed element wise.\n   *\n   * Syntax:\n   *\n   *    math.string(value)\n   *\n   * Examples:\n   *\n   *    math.string(4.2)               // returns string '4.2'\n   *    math.string(math.complex(3, 2) // returns string '3 + 2i'\n   *\n   *    const u = math.unit(5, 'km')\n   *    math.string(u.to('m'))         // returns string '5000 m'\n   *\n   *    math.string([true, false])     // returns ['true', 'false']\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, number, unit\n   *\n   * @param {* | Array | Matrix | null} [value]  A value to convert to a string\n   * @return {string | Array | Matrix} The created string\n   */\n  var string = typed('string', {\n    '': function _() {\n      return '';\n    },\n    'number': number.format,\n    'null': function _null(x) {\n      return 'null';\n    },\n    'boolean': function boolean(x) {\n      return x + '';\n    },\n    'string': function string(x) {\n      return x;\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, string);\n    },\n    'any': function any(x) {\n      return String(x);\n    }\n  });\n  string.toTex = {\n    0: '\\\\mathtt{\"\"}',\n    1: \"\\\\mathrm{string}\\\\left(${args[0]}\\\\right)\"\n  };\n  return string;\n}\n\nexports.name = 'string';\nexports.factory = factory;","'use strict';\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\nvar endsWith = require('../../utils/string').endsWith;\n\nvar clone = require('../../utils/object').clone;\n\nvar constants = require('../../utils/bignumber/constants');\n\nfunction factory(type, config, load, typed, math) {\n  var add = load(require('../../function/arithmetic/addScalar'));\n  var subtract = load(require('../../function/arithmetic/subtract'));\n  var multiply = load(require('../../function/arithmetic/multiplyScalar'));\n  var divide = load(require('../../function/arithmetic/divideScalar'));\n  var pow = load(require('../../function/arithmetic/pow'));\n  var abs = load(require('../../function/arithmetic/abs'));\n  var fix = load(require('../../function/arithmetic/fix'));\n  var round = load(require('../../function/arithmetic/round'));\n  var equal = load(require('../../function/relational/equal'));\n  var isNumeric = load(require('../../function/utils/isNumeric'));\n  var format = load(require('../../function/string/format'));\n  var getTypeOf = load(require('../../function/utils/typeof'));\n  var toNumber = load(require('../../type/number'));\n  var Complex = load(require('../../type/complex/Complex'));\n  /**\n   * A unit can be constructed in the following ways:\n   *\n   *     const a = new Unit(value, name)\n   *     const b = new Unit(null, name)\n   *     const c = Unit.parse(str)\n   *\n   * Example usage:\n   *\n   *     const a = new Unit(5, 'cm')               // 50 mm\n   *     const b = Unit.parse('23 kg')             // 23 kg\n   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m\n   *     const d = new Unit(9.81, \"m/s^2\")         // 9.81 m/s^2\n   *\n   * @class Unit\n   * @constructor Unit\n   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2\n   * @param {string} [name]   A unit name like \"cm\" or \"inch\", or a derived unit of the form: \"u1[^ex1] [u2[^ex2] ...] [/ u3[^ex3] [u4[^ex4]]]\", such as \"kg m^2/s^2\", where each unit appearing after the forward slash is taken to be in the denominator. \"kg m^2 s^-2\" is a synonym and is also acceptable. Any of the units can include a prefix.\n   */\n\n  function Unit(value, name) {\n    if (!(this instanceof Unit)) {\n      throw new Error('Constructor must be called with the new operator');\n    }\n\n    if (!(value === null || value === undefined || isNumeric(value) || type.isComplex(value))) {\n      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');\n    }\n\n    if (name !== undefined && (typeof name !== 'string' || name === '')) {\n      throw new TypeError('Second parameter in Unit constructor must be a string');\n    }\n\n    if (name !== undefined) {\n      var u = Unit.parse(name);\n      this.units = u.units;\n      this.dimensions = u.dimensions;\n    } else {\n      this.units = [{\n        unit: UNIT_NONE,\n        prefix: PREFIXES.NONE,\n        // link to a list with supported prefixes\n        power: 0\n      }];\n      this.dimensions = [];\n\n      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n        this.dimensions[i] = 0;\n      }\n    }\n\n    this.value = value !== undefined && value !== null ? this._normalize(value) : null;\n    this.fixPrefix = false; // if true, function format will not search for the\n    // best prefix but leave it as initially provided.\n    // fixPrefix is set true by the method Unit.to\n    // The justification behind this is that if the constructor is explicitly called,\n    // the caller wishes the units to be returned exactly as he supplied.\n\n    this.skipAutomaticSimplification = true;\n  }\n  /**\n   * Attach type information\n   */\n\n\n  Unit.prototype.type = 'Unit';\n  Unit.prototype.isUnit = true; // private variables and functions for the Unit parser\n\n  var text, index, c;\n\n  function skipWhitespace() {\n    while (c === ' ' || c === '\\t') {\n      next();\n    }\n  }\n\n  function isDigitDot(c) {\n    return c >= '0' && c <= '9' || c === '.';\n  }\n\n  function isDigit(c) {\n    return c >= '0' && c <= '9';\n  }\n\n  function next() {\n    index++;\n    c = text.charAt(index);\n  }\n\n  function revert(oldIndex) {\n    index = oldIndex;\n    c = text.charAt(index);\n  }\n\n  function parseNumber() {\n    var number = '';\n    var oldIndex;\n    oldIndex = index;\n\n    if (c === '+') {\n      next();\n    } else if (c === '-') {\n      number += c;\n      next();\n    }\n\n    if (!isDigitDot(c)) {\n      // a + or - must be followed by a digit\n      revert(oldIndex);\n      return null;\n    } // get number, can have a single dot\n\n\n    if (c === '.') {\n      number += c;\n      next();\n\n      if (!isDigit(c)) {\n        // this is no legal number, it is just a dot\n        revert(oldIndex);\n        return null;\n      }\n    } else {\n      while (isDigit(c)) {\n        number += c;\n        next();\n      }\n\n      if (c === '.') {\n        number += c;\n        next();\n      }\n    }\n\n    while (isDigit(c)) {\n      number += c;\n      next();\n    } // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\n\n\n    if (c === 'E' || c === 'e') {\n      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as \"4exabytes\"\n      var tentativeNumber = '';\n      var tentativeIndex = index;\n      tentativeNumber += c;\n      next();\n\n      if (c === '+' || c === '-') {\n        tentativeNumber += c;\n        next();\n      } // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\n\n\n      if (!isDigit(c)) {\n        // The e or E must belong to something else, so return the number without the e or E.\n        revert(tentativeIndex);\n        return number;\n      } // We can now safely say that this is scientific notation.\n\n\n      number = number + tentativeNumber;\n\n      while (isDigit(c)) {\n        number += c;\n        next();\n      }\n    }\n\n    return number;\n  }\n\n  function parseUnit() {\n    var unitName = ''; // Alphanumeric characters only; matches [a-zA-Z0-9]\n\n    var code = text.charCodeAt(index);\n\n    while (code >= 48 && code <= 57 || code >= 65 && code <= 90 || code >= 97 && code <= 122) {\n      unitName += c;\n      next();\n      code = text.charCodeAt(index);\n    } // Must begin with [a-zA-Z]\n\n\n    code = unitName.charCodeAt(0);\n\n    if (code >= 65 && code <= 90 || code >= 97 && code <= 122) {\n      return unitName || null;\n    } else {\n      return null;\n    }\n  }\n\n  function parseCharacter(toFind) {\n    if (c === toFind) {\n      next();\n      return toFind;\n    } else {\n      return null;\n    }\n  }\n  /**\n   * Parse a string into a unit. The value of the unit is parsed as number,\n   * BigNumber, or Fraction depending on the math.js config setting `number`.\n   *\n   * Throws an exception if the provided string does not contain a valid unit or\n   * cannot be parsed.\n   * @memberof Unit\n   * @param {string} str        A string like \"5.2 inch\", \"4e2 cm/s^2\"\n   * @return {Unit} unit\n   */\n\n\n  Unit.parse = function (str, options) {\n    options = options || {};\n    text = str;\n    index = -1;\n    c = '';\n\n    if (typeof text !== 'string') {\n      throw new TypeError('Invalid argument in Unit.parse, string expected');\n    }\n\n    var unit = new Unit();\n    unit.units = [];\n    var powerMultiplierCurrent = 1;\n    var expectingUnit = false; // A unit should follow this pattern:\n    // [number] ...[ [*/] unit[^number] ]\n    // unit[^number] ... [ [*/] unit[^number] ]\n    // Rules:\n    // number is any floating point number.\n    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!\n    // The string may optionally begin with a number.\n    // Each unit may optionally be followed by ^number.\n    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:\n    //   2m^2kg/s^2\n    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:\n    //   4erg\n\n    next();\n    skipWhitespace(); // Optional number at the start of the string\n\n    var valueStr = parseNumber();\n    var value = null;\n\n    if (valueStr) {\n      if (config.number === 'BigNumber') {\n        value = new type.BigNumber(valueStr);\n      } else if (config.number === 'Fraction') {\n        value = new type.Fraction(valueStr);\n      } else {\n        // number\n        value = parseFloat(valueStr);\n      }\n\n      skipWhitespace(); // Whitespace is not required here\n      // handle multiplication or division right after the value, like '1/s'\n\n      if (parseCharacter('*')) {\n        powerMultiplierCurrent = 1;\n        expectingUnit = true;\n      } else if (parseCharacter('/')) {\n        powerMultiplierCurrent = -1;\n        expectingUnit = true;\n      }\n    } // Stack to keep track of powerMultipliers applied to each parentheses group\n\n\n    var powerMultiplierStack = []; // Running product of all elements in powerMultiplierStack\n\n    var powerMultiplierStackProduct = 1;\n\n    while (true) {\n      skipWhitespace(); // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n      // A '(' will always appear directly before a unit.\n\n      while (c === '(') {\n        powerMultiplierStack.push(powerMultiplierCurrent);\n        powerMultiplierStackProduct *= powerMultiplierCurrent;\n        powerMultiplierCurrent = 1;\n        next();\n        skipWhitespace();\n      } // Is there something here?\n\n\n      var uStr = void 0;\n\n      if (c) {\n        var oldC = c;\n        uStr = parseUnit();\n\n        if (uStr === null) {\n          throw new SyntaxError('Unexpected \"' + oldC + '\" in \"' + text + '\" at index ' + index.toString());\n        }\n      } else {\n        // End of input.\n        break;\n      } // Verify the unit exists and get the prefix (if any)\n\n\n      var res = _findUnit(uStr);\n\n      if (res === null) {\n        // Unit not found.\n        throw new SyntaxError('Unit \"' + uStr + '\" not found.');\n      }\n\n      var power = powerMultiplierCurrent * powerMultiplierStackProduct; // Is there a \"^ number\"?\n\n      skipWhitespace();\n\n      if (parseCharacter('^')) {\n        skipWhitespace();\n        var p = parseNumber();\n\n        if (p === null) {\n          // No valid number found for the power!\n          throw new SyntaxError('In \"' + str + '\", \"^\" must be followed by a floating-point number');\n        }\n\n        power *= p;\n      } // Add the unit to the list\n\n\n      unit.units.push({\n        unit: res.unit,\n        prefix: res.prefix,\n        power: power\n      });\n\n      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;\n      } // Check for and consume closing parentheses, popping from the stack.\n      // A ')' will always follow a unit.\n\n\n      skipWhitespace();\n\n      while (c === ')') {\n        if (powerMultiplierStack.length === 0) {\n          throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString());\n        }\n\n        powerMultiplierStackProduct /= powerMultiplierStack.pop();\n        next();\n        skipWhitespace();\n      } // \"*\" and \"/\" should mean we are expecting something to come next.\n      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.\n\n\n      expectingUnit = false;\n\n      if (parseCharacter('*')) {\n        // explicit multiplication\n        powerMultiplierCurrent = 1;\n        expectingUnit = true;\n      } else if (parseCharacter('/')) {\n        // division\n        powerMultiplierCurrent = -1;\n        expectingUnit = true;\n      } else {\n        // implicit multiplication\n        powerMultiplierCurrent = 1;\n      } // Replace the unit into the auto unit system\n\n\n      if (res.unit.base) {\n        var baseDim = res.unit.base.key;\n        UNIT_SYSTEMS.auto[baseDim] = {\n          unit: res.unit,\n          prefix: res.prefix\n        };\n      }\n    } // Has the string been entirely consumed?\n\n\n    skipWhitespace();\n\n    if (c) {\n      throw new SyntaxError('Could not parse: \"' + str + '\"');\n    } // Is there a trailing slash?\n\n\n    if (expectingUnit) {\n      throw new SyntaxError('Trailing characters: \"' + str + '\"');\n    } // Is the parentheses stack empty?\n\n\n    if (powerMultiplierStack.length !== 0) {\n      throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"');\n    } // Are there any units at all?\n\n\n    if (unit.units.length === 0 && !options.allowNoUnits) {\n      throw new SyntaxError('\"' + str + '\" contains no units');\n    }\n\n    unit.value = value !== undefined ? unit._normalize(value) : null;\n    return unit;\n  };\n  /**\n   * create a copy of this unit\n   * @memberof Unit\n   * @return {Unit} Returns a cloned version of the unit\n   */\n\n\n  Unit.prototype.clone = function () {\n    var unit = new Unit();\n    unit.fixPrefix = this.fixPrefix;\n    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;\n    unit.value = clone(this.value);\n    unit.dimensions = this.dimensions.slice(0);\n    unit.units = [];\n\n    for (var i = 0; i < this.units.length; i++) {\n      unit.units[i] = {};\n\n      for (var p in this.units[i]) {\n        if (this.units[i].hasOwnProperty(p)) {\n          unit.units[i][p] = this.units[i][p];\n        }\n      }\n    }\n\n    return unit;\n  };\n  /**\n   * Return whether the unit is derived (such as m/s, or cm^2, but not N)\n   * @memberof Unit\n   * @return {boolean} True if the unit is derived\n   */\n\n\n  Unit.prototype._isDerived = function () {\n    if (this.units.length === 0) {\n      return false;\n    }\n\n    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;\n  };\n  /**\n   * Normalize a value, based on its currently set unit(s)\n   * @memberof Unit\n   * @param {number | BigNumber | Fraction | boolean} value\n   * @return {number | BigNumber | Fraction | boolean} normalized value\n   * @private\n   */\n\n\n  Unit.prototype._normalize = function (value) {\n    var unitValue, unitOffset, unitPower, unitPrefixValue;\n    var convert;\n\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    } else if (this._isDerived()) {\n      // This is a derived unit, so do not apply offsets.\n      // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n      var res = value;\n      convert = Unit._getNumberConverter(getTypeOf(value)); // convert to Fraction or BigNumber if needed\n\n      for (var i = 0; i < this.units.length; i++) {\n        unitValue = convert(this.units[i].unit.value);\n        unitPrefixValue = convert(this.units[i].prefix.value);\n        unitPower = convert(this.units[i].power);\n        res = multiply(res, pow(multiply(unitValue, unitPrefixValue), unitPower));\n      }\n\n      return res;\n    } else {\n      // This is a single unit of power 1, like kg or degC\n      convert = Unit._getNumberConverter(getTypeOf(value)); // convert to Fraction or BigNumber if needed\n\n      unitValue = convert(this.units[0].unit.value);\n      unitOffset = convert(this.units[0].unit.offset);\n      unitPrefixValue = convert(this.units[0].prefix.value);\n      return multiply(add(value, unitOffset), multiply(unitValue, unitPrefixValue));\n    }\n  };\n  /**\n   * Denormalize a value, based on its currently set unit(s)\n   * @memberof Unit\n   * @param {number} value\n   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)\n   * @return {number} denormalized value\n   * @private\n   */\n\n\n  Unit.prototype._denormalize = function (value, prefixValue) {\n    var unitValue, unitOffset, unitPower, unitPrefixValue;\n    var convert;\n\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    } else if (this._isDerived()) {\n      // This is a derived unit, so do not apply offsets.\n      // For example, with J kg^-1 degC^-1 you would NOT want to apply the offset.\n      // Also, prefixValue is ignored--but we will still use the prefix value stored in each unit, since kg is usually preferable to g unless the user decides otherwise.\n      var res = value;\n      convert = Unit._getNumberConverter(getTypeOf(value)); // convert to Fraction or BigNumber if needed\n\n      for (var i = 0; i < this.units.length; i++) {\n        unitValue = convert(this.units[i].unit.value);\n        unitPrefixValue = convert(this.units[i].prefix.value);\n        unitPower = convert(this.units[i].power);\n        res = divide(res, pow(multiply(unitValue, unitPrefixValue), unitPower));\n      }\n\n      return res;\n    } else {\n      // This is a single unit of power 1, like kg or degC\n      convert = Unit._getNumberConverter(getTypeOf(value)); // convert to Fraction or BigNumber if needed\n\n      unitValue = convert(this.units[0].unit.value);\n      unitPrefixValue = convert(this.units[0].prefix.value);\n      unitOffset = convert(this.units[0].unit.offset);\n\n      if (prefixValue === undefined || prefixValue === null) {\n        return subtract(divide(divide(value, unitValue), unitPrefixValue), unitOffset);\n      } else {\n        return subtract(divide(divide(value, unitValue), prefixValue), unitOffset);\n      }\n    }\n  };\n  /**\n   * Find a unit from a string\n   * @memberof Unit\n   * @param {string} str              A string like 'cm' or 'inch'\n   * @returns {Object | null} result  When found, an object with fields unit and\n   *                                  prefix is returned. Else, null is returned.\n   * @private\n   */\n\n\n  function _findUnit(str) {\n    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.\n    if (UNITS.hasOwnProperty(str)) {\n      var unit = UNITS[str];\n      var prefix = unit.prefixes[''];\n      return {\n        unit: unit,\n        prefix: prefix\n      };\n    }\n\n    for (var name in UNITS) {\n      if (UNITS.hasOwnProperty(name)) {\n        if (endsWith(str, name)) {\n          var _unit = UNITS[name];\n          var prefixLen = str.length - name.length;\n          var prefixName = str.substring(0, prefixLen);\n\n          var _prefix = _unit.prefixes.hasOwnProperty(prefixName) ? _unit.prefixes[prefixName] : undefined;\n\n          if (_prefix !== undefined) {\n            // store unit, prefix, and value\n            return {\n              unit: _unit,\n              prefix: _prefix\n            };\n          }\n        }\n      }\n    }\n\n    return null;\n  }\n  /**\n   * Test if the given expression is a unit.\n   * The unit can have a prefix but cannot have a value.\n   * @memberof Unit\n   * @param {string} name   A string to be tested whether it is a value less unit.\n   *                        The unit can have prefix, like \"cm\"\n   * @return {boolean}      true if the given string is a unit\n   */\n\n\n  Unit.isValuelessUnit = function (name) {\n    return _findUnit(name) !== null;\n  };\n  /**\n   * check if this unit has given base unit\n   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.\n   * @memberof Unit\n   * @param {BASE_UNITS | string | undefined} base\n   */\n\n\n  Unit.prototype.hasBase = function (base) {\n    if (typeof base === 'string') {\n      base = BASE_UNITS[base];\n    }\n\n    if (!base) {\n      return false;\n    } // All dimensions must be the same\n\n\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n  /**\n   * Check if this unit has a base or bases equal to another base or bases\n   * For derived units, the exponent on each base also must match\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {boolean} true if equal base\n   */\n\n\n  Unit.prototype.equalBase = function (other) {\n    // All dimensions must be the same\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n  /**\n   * Check if this unit equals another unit\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {boolean} true if both units are equal\n   */\n\n\n  Unit.prototype.equals = function (other) {\n    return this.equalBase(other) && equal(this.value, other.value);\n  };\n  /**\n   * Multiply this unit with another one\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {Unit} product of this unit and the other unit\n   */\n\n\n  Unit.prototype.multiply = function (other) {\n    var res = this.clone();\n\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);\n    } // Append other's units list onto res\n\n\n    for (var _i = 0; _i < other.units.length; _i++) {\n      // Make a deep copy\n      var inverted = {};\n\n      for (var key in other.units[_i]) {\n        inverted[key] = other.units[_i][key];\n      }\n\n      res.units.push(inverted);\n    } // If at least one operand has a value, then the result should also have a value\n\n\n    if (this.value !== null || other.value !== null) {\n      var valThis = this.value === null ? this._normalize(1) : this.value;\n      var valOther = other.value === null ? other._normalize(1) : other.value;\n      res.value = multiply(valThis, valOther);\n    } else {\n      res.value = null;\n    }\n\n    res.skipAutomaticSimplification = false;\n    return getNumericIfUnitless(res);\n  };\n  /**\n   * Divide this unit by another one\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {Unit} result of dividing this unit by the other unit\n   */\n\n\n  Unit.prototype.divide = function (other) {\n    var res = this.clone();\n\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);\n    } // Invert and append other's units list onto res\n\n\n    for (var _i2 = 0; _i2 < other.units.length; _i2++) {\n      // Make a deep copy\n      var inverted = {};\n\n      for (var key in other.units[_i2]) {\n        inverted[key] = other.units[_i2][key];\n      }\n\n      inverted.power = -inverted.power;\n      res.units.push(inverted);\n    } // If at least one operand has a value, the result should have a value\n\n\n    if (this.value !== null || other.value !== null) {\n      var valThis = this.value === null ? this._normalize(1) : this.value;\n      var valOther = other.value === null ? other._normalize(1) : other.value;\n      res.value = divide(valThis, valOther);\n    } else {\n      res.value = null;\n    }\n\n    res.skipAutomaticSimplification = false;\n    return getNumericIfUnitless(res);\n  };\n  /**\n   * Calculate the power of a unit\n   * @memberof Unit\n   * @param {number | Fraction | BigNumber} p\n   * @returns {Unit}      The result: this^p\n   */\n\n\n  Unit.prototype.pow = function (p) {\n    var res = this.clone();\n\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) * p;\n    } // Adjust the power of each unit in the list\n\n\n    for (var _i3 = 0; _i3 < res.units.length; _i3++) {\n      res.units[_i3].power *= p;\n    }\n\n    if (res.value !== null) {\n      res.value = pow(res.value, p); // only allow numeric output, we don't want to return a Complex number\n      // if (!isNumeric(res.value)) {\n      //  res.value = NaN\n      // }\n      // Update: Complex supported now\n    } else {\n      res.value = null;\n    }\n\n    res.skipAutomaticSimplification = false;\n    return getNumericIfUnitless(res);\n  };\n  /**\n   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise\n   * @param {Unit} unit\n   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise\n   */\n\n\n  function getNumericIfUnitless(unit) {\n    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {\n      return unit.value;\n    } else {\n      return unit;\n    }\n  }\n  /**\n   * Calculate the absolute value of a unit\n   * @memberof Unit\n   * @param {number | Fraction | BigNumber} x\n   * @returns {Unit}      The result: |x|, absolute value of x\n   */\n\n\n  Unit.prototype.abs = function () {\n    // This gives correct, but unexpected, results for units with an offset.\n    // For example, abs(-283.15 degC) = -263.15 degC !!!\n    var ret = this.clone();\n    ret.value = ret.value !== null ? abs(ret.value) : null;\n\n    for (var i in ret.units) {\n      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {\n        ret.units[i].unit = UNITS['W'];\n      }\n    }\n\n    return ret;\n  };\n  /**\n   * Convert the unit to a specific unit name.\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like \"cm\"\n   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.\n   */\n\n\n  Unit.prototype.to = function (valuelessUnit) {\n    var other;\n    var value = this.value === null ? this._normalize(1) : this.value;\n\n    if (typeof valuelessUnit === 'string') {\n      // other = new Unit(null, valuelessUnit)\n      other = Unit.parse(valuelessUnit);\n\n      if (!this.equalBase(other)) {\n        throw new Error(\"Units do not match ('\".concat(other.toString(), \"' != '\").concat(this.toString(), \"')\"));\n      }\n\n      if (other.value !== null) {\n        throw new Error('Cannot convert to a unit with a value');\n      }\n\n      other.value = clone(value);\n      other.fixPrefix = true;\n      other.skipAutomaticSimplification = true;\n      return other;\n    } else if (type.isUnit(valuelessUnit)) {\n      if (!this.equalBase(valuelessUnit)) {\n        throw new Error(\"Units do not match ('\".concat(valuelessUnit.toString(), \"' != '\").concat(this.toString(), \"')\"));\n      }\n\n      if (valuelessUnit.value !== null) {\n        throw new Error('Cannot convert to a unit with a value');\n      }\n\n      other = valuelessUnit.clone();\n      other.value = clone(value);\n      other.fixPrefix = true;\n      other.skipAutomaticSimplification = true;\n      return other;\n    } else {\n      throw new Error('String or Unit expected as parameter');\n    }\n  };\n  /**\n   * Return the value of the unit when represented with given valueless unit\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'\n   * @return {number} Returns the unit value as number.\n   */\n  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric\n\n\n  Unit.prototype.toNumber = function (valuelessUnit) {\n    return toNumber(this.toNumeric(valuelessUnit));\n  };\n  /**\n   * Return the value of the unit in the original numeric type\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'\n   * @return {number | BigNumber | Fraction} Returns the unit value\n   */\n\n\n  Unit.prototype.toNumeric = function (valuelessUnit) {\n    var other;\n\n    if (valuelessUnit) {\n      // Allow getting the numeric value without converting to a different unit\n      other = this.to(valuelessUnit);\n    } else {\n      other = this.clone();\n    }\n\n    if (other._isDerived()) {\n      return other._denormalize(other.value);\n    } else {\n      return other._denormalize(other.value, other.units[0].prefix.value);\n    }\n  };\n  /**\n   * Get a string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.toString = function () {\n    return this.format();\n  };\n  /**\n   * Get a JSON representation of the unit\n   * @memberof Unit\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n   */\n\n\n  Unit.prototype.toJSON = function () {\n    return {\n      mathjs: 'Unit',\n      value: this._denormalize(this.value),\n      unit: this.formatUnits(),\n      fixPrefix: this.fixPrefix\n    };\n  };\n  /**\n   * Instantiate a Unit from a JSON object\n   * @memberof Unit\n   * @param {Object} json  A JSON object structured as:\n   *                       `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n   * @return {Unit}\n   */\n\n\n  Unit.fromJSON = function (json) {\n    var unit = new Unit(json.value, json.unit);\n    unit.fixPrefix = json.fixPrefix || false;\n    return unit;\n  };\n  /**\n   * Returns the string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.valueOf = Unit.prototype.toString;\n  /**\n   * Simplify this Unit's unit list and return a new Unit with the simplified list.\n   * The returned Unit will contain a list of the \"best\" units for formatting.\n   */\n\n  Unit.prototype.simplify = function () {\n    var ret = this.clone();\n    var proposedUnitList = []; // Search for a matching base\n\n    var matchingBase;\n\n    for (var key in currentUnitSystem) {\n      if (ret.hasBase(BASE_UNITS[key])) {\n        matchingBase = key;\n        break;\n      }\n    }\n\n    if (matchingBase === 'NONE') {\n      ret.units = [];\n    } else {\n      var matchingUnit;\n\n      if (matchingBase) {\n        // Does the unit system have a matching unit?\n        if (currentUnitSystem.hasOwnProperty(matchingBase)) {\n          matchingUnit = currentUnitSystem[matchingBase];\n        }\n      }\n\n      if (matchingUnit) {\n        ret.units = [{\n          unit: matchingUnit.unit,\n          prefix: matchingUnit.prefix,\n          power: 1.0\n        }];\n      } else {\n        // Multiple units or units with powers are formatted like this:\n        // 5 (kg m^2) / (s^3 mol)\n        // Build an representation from the base units of the current unit system\n        var missingBaseDim = false;\n\n        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n          var baseDim = BASE_DIMENSIONS[i];\n\n          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n            if (currentUnitSystem.hasOwnProperty(baseDim)) {\n              proposedUnitList.push({\n                unit: currentUnitSystem[baseDim].unit,\n                prefix: currentUnitSystem[baseDim].prefix,\n                power: ret.dimensions[i] || 0\n              });\n            } else {\n              missingBaseDim = true;\n            }\n          }\n        } // Is the proposed unit list \"simpler\" than the existing one?\n\n\n        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {\n          // Replace this unit list with the proposed list\n          ret.units = proposedUnitList;\n        }\n      }\n    }\n\n    return ret;\n  };\n  /**\n   * Returns a new Unit in the SI system with the same value as this one\n   */\n\n\n  Unit.prototype.toSI = function () {\n    var ret = this.clone();\n    var proposedUnitList = []; // Multiple units or units with powers are formatted like this:\n    // 5 (kg m^2) / (s^3 mol)\n    // Build an representation from the base units of the SI unit system\n\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      var baseDim = BASE_DIMENSIONS[i];\n\n      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n        if (UNIT_SYSTEMS['si'].hasOwnProperty(baseDim)) {\n          proposedUnitList.push({\n            unit: UNIT_SYSTEMS['si'][baseDim].unit,\n            prefix: UNIT_SYSTEMS['si'][baseDim].prefix,\n            power: ret.dimensions[i] || 0\n          });\n        } else {\n          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');\n        }\n      }\n    } // Replace this unit list with the proposed list\n\n\n    ret.units = proposedUnitList;\n    ret.fixPrefix = true;\n    ret.skipAutomaticSimplification = true;\n    return ret;\n  };\n  /**\n   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.\n   * @memberof Unit\n   * @return {string}\n   */\n\n\n  Unit.prototype.formatUnits = function () {\n    var strNum = '';\n    var strDen = '';\n    var nNum = 0;\n    var nDen = 0;\n\n    for (var i = 0; i < this.units.length; i++) {\n      if (this.units[i].power > 0) {\n        nNum++;\n        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;\n\n        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {\n          strNum += '^' + this.units[i].power;\n        }\n      } else if (this.units[i].power < 0) {\n        nDen++;\n      }\n    }\n\n    if (nDen > 0) {\n      for (var _i4 = 0; _i4 < this.units.length; _i4++) {\n        if (this.units[_i4].power < 0) {\n          if (nNum > 0) {\n            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n\n            if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {\n              strDen += '^' + -this.units[_i4].power;\n            }\n          } else {\n            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;\n            strDen += '^' + this.units[_i4].power;\n          }\n        }\n      }\n    } // Remove leading \" \"\n\n\n    strNum = strNum.substr(1);\n    strDen = strDen.substr(1); // Add parans for better copy/paste back into the eval, for example, or for better pretty print formatting\n\n    if (nNum > 1 && nDen > 0) {\n      strNum = '(' + strNum + ')';\n    }\n\n    if (nDen > 1 && nNum > 0) {\n      strDen = '(' + strDen + ')';\n    }\n\n    var str = strNum;\n\n    if (nNum > 0 && nDen > 0) {\n      str += ' / ';\n    }\n\n    str += strDen;\n    return str;\n  };\n  /**\n   * Get a string representation of the Unit, with optional formatting options.\n   * @memberof Unit\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string}\n   */\n\n\n  Unit.prototype.format = function (options) {\n    // Simplfy the unit list, unless it is valueless or was created directly in the\n    // constructor or as the result of to or toSI\n    var simp = this.skipAutomaticSimplification || this.value === null ? this.clone() : this.simplify(); // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.\n\n    var isImaginary = false;\n\n    if (typeof simp.value !== 'undefined' && simp.value !== null && type.isComplex(simp.value)) {\n      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute\n      isImaginary = Math.abs(simp.value.re) < 1e-14;\n    }\n\n    for (var i in simp.units) {\n      if (simp.units[i].unit) {\n        if (simp.units[i].unit.name === 'VA' && isImaginary) {\n          simp.units[i].unit = UNITS['VAR'];\n        } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {\n          simp.units[i].unit = UNITS['VA'];\n        }\n      }\n    } // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\n\n\n    if (simp.units.length === 1 && !simp.fixPrefix) {\n      // Units must have integer powers, otherwise the prefix will change the\n      // outputted value by not-an-integer-power-of-ten\n      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {\n        // Apply the best prefix\n        simp.units[0].prefix = simp._bestPrefix();\n      }\n    }\n\n    var value = simp._denormalize(simp.value);\n\n    var str = simp.value !== null ? format(value, options || {}) : '';\n    var unitStr = simp.formatUnits();\n\n    if (simp.value && type.isComplex(simp.value)) {\n      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing\n    }\n\n    if (unitStr.length > 0 && str.length > 0) {\n      str += ' ';\n    }\n\n    str += unitStr;\n    return str;\n  };\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @private\n   */\n\n\n  Unit.prototype._bestPrefix = function () {\n    if (this.units.length !== 1) {\n      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');\n    }\n\n    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {\n      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');\n    } // find the best prefix value (resulting in the value of which\n    // the absolute value of the log10 is closest to zero,\n    // though with a little offset of 1.2 for nicer values: you get a\n    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...\n    // Note: the units value can be any numeric type, but to find the best\n    // prefix it's enough to work with limited precision of a regular number\n    // Update: using mathjs abs since we also allow complex numbers\n\n\n    var absValue = this.value !== null ? abs(this.value) : 0;\n    var absUnitValue = abs(this.units[0].unit.value);\n    var bestPrefix = this.units[0].prefix;\n\n    if (absValue === 0) {\n      return bestPrefix;\n    }\n\n    var power = this.units[0].power;\n    var bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - 1.2;\n    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix\n\n    bestDiff = Math.abs(bestDiff);\n    var prefixes = this.units[0].unit.prefixes;\n\n    for (var p in prefixes) {\n      if (prefixes.hasOwnProperty(p)) {\n        var prefix = prefixes[p];\n\n        if (prefix.scientific) {\n          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);\n\n          if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {\n            // choose the prefix with the smallest diff, or if equal, choose the one\n            // with the shortest name (can happen with SHORTLONG for example)\n            bestPrefix = prefix;\n            bestDiff = diff;\n          }\n        }\n      }\n    }\n\n    return bestPrefix;\n  };\n  /**\n   * Returns an array of units whose sum is equal to this unit\n   * @memberof Unit\n   * @param {Array} [parts] An array of strings or valueless units.\n   *\n   *   Example:\n   *\n   *   const u = new Unit(1, 'm')\n   *   u.splitUnit(['feet', 'inch'])\n   *     [ 3 feet, 3.3700787401575 inch ]\n   *\n   * @return {Array} An array of units.\n   */\n\n\n  Unit.prototype.splitUnit = function (parts) {\n    var x = this.clone();\n    var ret = [];\n\n    for (var i = 0; i < parts.length; i++) {\n      // Convert x to the requested unit\n      x = x.to(parts[i]);\n      if (i === parts.length - 1) break; // Get the numeric value of this unit\n\n      var xNumeric = x.toNumeric(); // Check to see if xNumeric is nearly equal to an integer,\n      // since fix can incorrectly round down if there is round-off error\n\n      var xRounded = round(xNumeric);\n      var xFixed = void 0;\n      var isNearlyEqual = equal(xRounded, xNumeric);\n\n      if (isNearlyEqual) {\n        xFixed = xRounded;\n      } else {\n        xFixed = fix(x.toNumeric());\n      }\n\n      var y = new Unit(xFixed, parts[i].toString());\n      ret.push(y);\n      x = subtract(x, y);\n    } // This little bit fixes a bug where the remainder should be 0 but is a little bit off.\n    // But instead of comparing x, the remainder, with zero--we will compare the sum of\n    // all the parts so far with the original value. If they are nearly equal,\n    // we set the remainder to 0.\n\n\n    var testSum = 0;\n\n    for (var _i5 = 0; _i5 < ret.length; _i5++) {\n      testSum = add(testSum, ret[_i5].value);\n    }\n\n    if (equal(testSum, this.value)) {\n      x.value = 0;\n    }\n\n    ret.push(x);\n    return ret;\n  };\n\n  var PREFIXES = {\n    NONE: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      }\n    },\n    SHORT: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'da': {\n        name: 'da',\n        value: 1e1,\n        scientific: false\n      },\n      'h': {\n        name: 'h',\n        value: 1e2,\n        scientific: false\n      },\n      'k': {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      'M': {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      'G': {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      'T': {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      'P': {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      'E': {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      'Z': {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      'Y': {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      },\n      'd': {\n        name: 'd',\n        value: 1e-1,\n        scientific: false\n      },\n      'c': {\n        name: 'c',\n        value: 1e-2,\n        scientific: false\n      },\n      'm': {\n        name: 'm',\n        value: 1e-3,\n        scientific: true\n      },\n      'u': {\n        name: 'u',\n        value: 1e-6,\n        scientific: true\n      },\n      'n': {\n        name: 'n',\n        value: 1e-9,\n        scientific: true\n      },\n      'p': {\n        name: 'p',\n        value: 1e-12,\n        scientific: true\n      },\n      'f': {\n        name: 'f',\n        value: 1e-15,\n        scientific: true\n      },\n      'a': {\n        name: 'a',\n        value: 1e-18,\n        scientific: true\n      },\n      'z': {\n        name: 'z',\n        value: 1e-21,\n        scientific: true\n      },\n      'y': {\n        name: 'y',\n        value: 1e-24,\n        scientific: true\n      }\n    },\n    LONG: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'deca': {\n        name: 'deca',\n        value: 1e1,\n        scientific: false\n      },\n      'hecto': {\n        name: 'hecto',\n        value: 1e2,\n        scientific: false\n      },\n      'kilo': {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      'mega': {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      'giga': {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      'tera': {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      'peta': {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      'exa': {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      'zetta': {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      'yotta': {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      },\n      'deci': {\n        name: 'deci',\n        value: 1e-1,\n        scientific: false\n      },\n      'centi': {\n        name: 'centi',\n        value: 1e-2,\n        scientific: false\n      },\n      'milli': {\n        name: 'milli',\n        value: 1e-3,\n        scientific: true\n      },\n      'micro': {\n        name: 'micro',\n        value: 1e-6,\n        scientific: true\n      },\n      'nano': {\n        name: 'nano',\n        value: 1e-9,\n        scientific: true\n      },\n      'pico': {\n        name: 'pico',\n        value: 1e-12,\n        scientific: true\n      },\n      'femto': {\n        name: 'femto',\n        value: 1e-15,\n        scientific: true\n      },\n      'atto': {\n        name: 'atto',\n        value: 1e-18,\n        scientific: true\n      },\n      'zepto': {\n        name: 'zepto',\n        value: 1e-21,\n        scientific: true\n      },\n      'yocto': {\n        name: 'yocto',\n        value: 1e-24,\n        scientific: true\n      }\n    },\n    SQUARED: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'da': {\n        name: 'da',\n        value: 1e2,\n        scientific: false\n      },\n      'h': {\n        name: 'h',\n        value: 1e4,\n        scientific: false\n      },\n      'k': {\n        name: 'k',\n        value: 1e6,\n        scientific: true\n      },\n      'M': {\n        name: 'M',\n        value: 1e12,\n        scientific: true\n      },\n      'G': {\n        name: 'G',\n        value: 1e18,\n        scientific: true\n      },\n      'T': {\n        name: 'T',\n        value: 1e24,\n        scientific: true\n      },\n      'P': {\n        name: 'P',\n        value: 1e30,\n        scientific: true\n      },\n      'E': {\n        name: 'E',\n        value: 1e36,\n        scientific: true\n      },\n      'Z': {\n        name: 'Z',\n        value: 1e42,\n        scientific: true\n      },\n      'Y': {\n        name: 'Y',\n        value: 1e48,\n        scientific: true\n      },\n      'd': {\n        name: 'd',\n        value: 1e-2,\n        scientific: false\n      },\n      'c': {\n        name: 'c',\n        value: 1e-4,\n        scientific: false\n      },\n      'm': {\n        name: 'm',\n        value: 1e-6,\n        scientific: true\n      },\n      'u': {\n        name: 'u',\n        value: 1e-12,\n        scientific: true\n      },\n      'n': {\n        name: 'n',\n        value: 1e-18,\n        scientific: true\n      },\n      'p': {\n        name: 'p',\n        value: 1e-24,\n        scientific: true\n      },\n      'f': {\n        name: 'f',\n        value: 1e-30,\n        scientific: true\n      },\n      'a': {\n        name: 'a',\n        value: 1e-36,\n        scientific: true\n      },\n      'z': {\n        name: 'z',\n        value: 1e-42,\n        scientific: true\n      },\n      'y': {\n        name: 'y',\n        value: 1e-48,\n        scientific: true\n      }\n    },\n    CUBIC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'da': {\n        name: 'da',\n        value: 1e3,\n        scientific: false\n      },\n      'h': {\n        name: 'h',\n        value: 1e6,\n        scientific: false\n      },\n      'k': {\n        name: 'k',\n        value: 1e9,\n        scientific: true\n      },\n      'M': {\n        name: 'M',\n        value: 1e18,\n        scientific: true\n      },\n      'G': {\n        name: 'G',\n        value: 1e27,\n        scientific: true\n      },\n      'T': {\n        name: 'T',\n        value: 1e36,\n        scientific: true\n      },\n      'P': {\n        name: 'P',\n        value: 1e45,\n        scientific: true\n      },\n      'E': {\n        name: 'E',\n        value: 1e54,\n        scientific: true\n      },\n      'Z': {\n        name: 'Z',\n        value: 1e63,\n        scientific: true\n      },\n      'Y': {\n        name: 'Y',\n        value: 1e72,\n        scientific: true\n      },\n      'd': {\n        name: 'd',\n        value: 1e-3,\n        scientific: false\n      },\n      'c': {\n        name: 'c',\n        value: 1e-6,\n        scientific: false\n      },\n      'm': {\n        name: 'm',\n        value: 1e-9,\n        scientific: true\n      },\n      'u': {\n        name: 'u',\n        value: 1e-18,\n        scientific: true\n      },\n      'n': {\n        name: 'n',\n        value: 1e-27,\n        scientific: true\n      },\n      'p': {\n        name: 'p',\n        value: 1e-36,\n        scientific: true\n      },\n      'f': {\n        name: 'f',\n        value: 1e-45,\n        scientific: true\n      },\n      'a': {\n        name: 'a',\n        value: 1e-54,\n        scientific: true\n      },\n      'z': {\n        name: 'z',\n        value: 1e-63,\n        scientific: true\n      },\n      'y': {\n        name: 'y',\n        value: 1e-72,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'k': {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      'M': {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      'G': {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      'T': {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      'P': {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      'E': {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      'Z': {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      'Y': {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'Ki': {\n        name: 'Ki',\n        value: 1024,\n        scientific: true\n      },\n      'Mi': {\n        name: 'Mi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      'Gi': {\n        name: 'Gi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      'Ti': {\n        name: 'Ti',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      'Pi': {\n        name: 'Pi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      'Ei': {\n        name: 'Ei',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      'Zi': {\n        name: 'Zi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      'Yi': {\n        name: 'Yi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BINARY_LONG_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'kilo': {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      'mega': {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      'giga': {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      'tera': {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      'peta': {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      'exa': {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      'zetta': {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      'yotta': {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_LONG_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'kibi': {\n        name: 'kibi',\n        value: 1024,\n        scientific: true\n      },\n      'mebi': {\n        name: 'mebi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      'gibi': {\n        name: 'gibi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      'tebi': {\n        name: 'tebi',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      'pebi': {\n        name: 'pebi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      'exi': {\n        name: 'exi',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      'zebi': {\n        name: 'zebi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      'yobi': {\n        name: 'yobi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BTU: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      'MM': {\n        name: 'MM',\n        value: 1e6,\n        scientific: true\n      }\n    }\n  };\n  PREFIXES.SHORTLONG = _extends(PREFIXES.SHORT, PREFIXES.LONG);\n  PREFIXES.BINARY_SHORT = _extends(PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);\n  PREFIXES.BINARY_LONG = _extends(PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);\n  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:\n   * Index  Dimension\n   * -----  ---------\n   *   0    Length\n   *   1    Mass\n   *   2    Time\n   *   3    Current\n   *   4    Temperature\n   *   5    Luminous intensity\n   *   6    Amount of substance\n   *   7    Angle\n   *   8    Bit (digital)\n   * For example, the unit \"298.15 K\" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit \"1 cal / (gm °C)\" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].\n   *\n   */\n\n  var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];\n  var BASE_UNITS = {\n    NONE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]\n    },\n    MASS: {\n      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]\n    },\n    LENGTH: {\n      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]\n    },\n    TIME: {\n      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]\n    },\n    CURRENT: {\n      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]\n    },\n    TEMPERATURE: {\n      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]\n    },\n    LUMINOUS_INTENSITY: {\n      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]\n    },\n    AMOUNT_OF_SUBSTANCE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]\n    },\n    FORCE: {\n      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]\n    },\n    SURFACE: {\n      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]\n    },\n    VOLUME: {\n      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]\n    },\n    ENERGY: {\n      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]\n    },\n    POWER: {\n      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]\n    },\n    PRESSURE: {\n      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CHARGE: {\n      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CAPACITANCE: {\n      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_POTENTIAL: {\n      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_RESISTANCE: {\n      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_INDUCTANCE: {\n      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CONDUCTANCE: {\n      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]\n    },\n    MAGNETIC_FLUX: {\n      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]\n    },\n    MAGNETIC_FLUX_DENSITY: {\n      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]\n    },\n    FREQUENCY: {\n      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]\n    },\n    ANGLE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]\n    },\n    BIT: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]\n    }\n  };\n\n  for (var key in BASE_UNITS) {\n    BASE_UNITS[key].key = key;\n  }\n\n  var BASE_UNIT_NONE = {};\n  var UNIT_NONE = {\n    name: '',\n    base: BASE_UNIT_NONE,\n    value: 1,\n    offset: 0,\n    dimensions: BASE_DIMENSIONS.map(function (x) {\n      return 0;\n    })\n  };\n  var UNITS = {\n    // length\n    meter: {\n      name: 'meter',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    inch: {\n      name: 'inch',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0254,\n      offset: 0\n    },\n    foot: {\n      name: 'foot',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.3048,\n      offset: 0\n    },\n    yard: {\n      name: 'yard',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.9144,\n      offset: 0\n    },\n    mile: {\n      name: 'mile',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1609.344,\n      offset: 0\n    },\n    link: {\n      name: 'link',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.201168,\n      offset: 0\n    },\n    rod: {\n      name: 'rod',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 5.0292,\n      offset: 0\n    },\n    chain: {\n      name: 'chain',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 20.1168,\n      offset: 0\n    },\n    angstrom: {\n      name: 'angstrom',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1e-10,\n      offset: 0\n    },\n    m: {\n      name: 'm',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    'in': {\n      name: 'in',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0254,\n      offset: 0\n    },\n    ft: {\n      name: 'ft',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.3048,\n      offset: 0\n    },\n    yd: {\n      name: 'yd',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.9144,\n      offset: 0\n    },\n    mi: {\n      name: 'mi',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1609.344,\n      offset: 0\n    },\n    li: {\n      name: 'li',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.201168,\n      offset: 0\n    },\n    rd: {\n      name: 'rd',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 5.029210,\n      offset: 0\n    },\n    ch: {\n      name: 'ch',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 20.1168,\n      offset: 0\n    },\n    mil: {\n      name: 'mil',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000254,\n      offset: 0\n    },\n    // 1/1000 inch\n    // Surface\n    m2: {\n      name: 'm2',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.SQUARED,\n      value: 1,\n      offset: 0\n    },\n    sqin: {\n      name: 'sqin',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.00064516,\n      offset: 0\n    },\n    // 645.16 mm2\n    sqft: {\n      name: 'sqft',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.09290304,\n      offset: 0\n    },\n    // 0.09290304 m2\n    sqyd: {\n      name: 'sqyd',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.83612736,\n      offset: 0\n    },\n    // 0.83612736 m2\n    sqmi: {\n      name: 'sqmi',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 2589988.110336,\n      offset: 0\n    },\n    // 2.589988110336 km2\n    sqrd: {\n      name: 'sqrd',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 25.29295,\n      offset: 0\n    },\n    // 25.29295 m2\n    sqch: {\n      name: 'sqch',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 404.6873,\n      offset: 0\n    },\n    // 404.6873 m2\n    sqmil: {\n      name: 'sqmil',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 6.4516e-10,\n      offset: 0\n    },\n    // 6.4516 * 10^-10 m2\n    acre: {\n      name: 'acre',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 4046.86,\n      offset: 0\n    },\n    // 4046.86 m2\n    hectare: {\n      name: 'hectare',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 10000,\n      offset: 0\n    },\n    // 10000 m2\n    // Volume\n    m3: {\n      name: 'm3',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.CUBIC,\n      value: 1,\n      offset: 0\n    },\n    L: {\n      name: 'L',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\n    // litre\n    l: {\n      name: 'l',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\n    // litre\n    litre: {\n      name: 'litre',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.LONG,\n      value: 0.001,\n      offset: 0\n    },\n    cuin: {\n      name: 'cuin',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 1.6387064e-5,\n      offset: 0\n    },\n    // 1.6387064e-5 m3\n    cuft: {\n      name: 'cuft',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.028316846592,\n      offset: 0\n    },\n    // 28.316 846 592 L\n    cuyd: {\n      name: 'cuyd',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.764554857984,\n      offset: 0\n    },\n    // 764.554 857 984 L\n    teaspoon: {\n      name: 'teaspoon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000005,\n      offset: 0\n    },\n    // 5 mL\n    tablespoon: {\n      name: 'tablespoon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000015,\n      offset: 0\n    },\n    // 15 mL\n    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup\n    drop: {\n      name: 'drop',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 5e-8,\n      offset: 0\n    },\n    // 0.05 mL = 5e-8 m3\n    gtt: {\n      name: 'gtt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 5e-8,\n      offset: 0\n    },\n    // 0.05 mL = 5e-8 m3\n    // Liquid volume\n    minim: {\n      name: 'minim',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00000006161152,\n      offset: 0\n    },\n    // 0.06161152 mL\n    fluiddram: {\n      name: 'fluiddram',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000036966911,\n      offset: 0\n    },\n    // 3.696691 mL\n    fluidounce: {\n      name: 'fluidounce',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00002957353,\n      offset: 0\n    },\n    // 29.57353 mL\n    gill: {\n      name: 'gill',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0001182941,\n      offset: 0\n    },\n    // 118.2941 mL\n    cc: {\n      name: 'cc',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 1e-6,\n      offset: 0\n    },\n    // 1e-6 L\n    cup: {\n      name: 'cup',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0002365882,\n      offset: 0\n    },\n    // 236.5882 mL\n    pint: {\n      name: 'pint',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0004731765,\n      offset: 0\n    },\n    // 473.1765 mL\n    quart: {\n      name: 'quart',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0009463529,\n      offset: 0\n    },\n    // 946.3529 mL\n    gallon: {\n      name: 'gallon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.003785412,\n      offset: 0\n    },\n    // 3.785412 L\n    beerbarrel: {\n      name: 'beerbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1173478,\n      offset: 0\n    },\n    // 117.3478 L\n    oilbarrel: {\n      name: 'oilbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1589873,\n      offset: 0\n    },\n    // 158.9873 L\n    hogshead: {\n      name: 'hogshead',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.2384810,\n      offset: 0\n    },\n    // 238.4810 L\n    // {name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute\n    fldr: {\n      name: 'fldr',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000036966911,\n      offset: 0\n    },\n    // 3.696691 mL\n    floz: {\n      name: 'floz',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00002957353,\n      offset: 0\n    },\n    // 29.57353 mL\n    gi: {\n      name: 'gi',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0001182941,\n      offset: 0\n    },\n    // 118.2941 mL\n    cp: {\n      name: 'cp',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0002365882,\n      offset: 0\n    },\n    // 236.5882 mL\n    pt: {\n      name: 'pt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0004731765,\n      offset: 0\n    },\n    // 473.1765 mL\n    qt: {\n      name: 'qt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0009463529,\n      offset: 0\n    },\n    // 946.3529 mL\n    gal: {\n      name: 'gal',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.003785412,\n      offset: 0\n    },\n    // 3.785412 L\n    bbl: {\n      name: 'bbl',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1173478,\n      offset: 0\n    },\n    // 117.3478 L\n    obl: {\n      name: 'obl',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.1589873,\n      offset: 0\n    },\n    // 158.9873 L\n    // {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh?\n    // Mass\n    g: {\n      name: 'g',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\n    gram: {\n      name: 'gram',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.LONG,\n      value: 0.001,\n      offset: 0\n    },\n    ton: {\n      name: 'ton',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 907.18474,\n      offset: 0\n    },\n    tonne: {\n      name: 'tonne',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 1000,\n      offset: 0\n    },\n    grain: {\n      name: 'grain',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 64.79891e-6,\n      offset: 0\n    },\n    dram: {\n      name: 'dram',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 1.7718451953125e-3,\n      offset: 0\n    },\n    ounce: {\n      name: 'ounce',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 28.349523125e-3,\n      offset: 0\n    },\n    poundmass: {\n      name: 'poundmass',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 453.59237e-3,\n      offset: 0\n    },\n    hundredweight: {\n      name: 'hundredweight',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 45.359237,\n      offset: 0\n    },\n    stick: {\n      name: 'stick',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 115e-3,\n      offset: 0\n    },\n    stone: {\n      name: 'stone',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 6.35029318,\n      offset: 0\n    },\n    gr: {\n      name: 'gr',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 64.79891e-6,\n      offset: 0\n    },\n    dr: {\n      name: 'dr',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 1.7718451953125e-3,\n      offset: 0\n    },\n    oz: {\n      name: 'oz',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 28.349523125e-3,\n      offset: 0\n    },\n    lbm: {\n      name: 'lbm',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 453.59237e-3,\n      offset: 0\n    },\n    cwt: {\n      name: 'cwt',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 45.359237,\n      offset: 0\n    },\n    // Time\n    s: {\n      name: 's',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    min: {\n      name: 'min',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 60,\n      offset: 0\n    },\n    h: {\n      name: 'h',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3600,\n      offset: 0\n    },\n    second: {\n      name: 'second',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    sec: {\n      name: 'sec',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    minute: {\n      name: 'minute',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 60,\n      offset: 0\n    },\n    hour: {\n      name: 'hour',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3600,\n      offset: 0\n    },\n    day: {\n      name: 'day',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 86400,\n      offset: 0\n    },\n    week: {\n      name: 'week',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 7 * 86400,\n      offset: 0\n    },\n    month: {\n      name: 'month',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 2629800,\n      // 1/12th of Julian year\n      offset: 0\n    },\n    year: {\n      name: 'year',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600,\n      // Julian year\n      offset: 0\n    },\n    decade: {\n      name: 'decade',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 315576000,\n      // Julian decade\n      offset: 0\n    },\n    century: {\n      name: 'century',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3155760000,\n      // Julian century\n      offset: 0\n    },\n    millennium: {\n      name: 'millennium',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600000,\n      // Julian millennium\n      offset: 0\n    },\n    // Frequency\n    hertz: {\n      name: 'Hertz',\n      base: BASE_UNITS.FREQUENCY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0,\n      reciprocal: true\n    },\n    Hz: {\n      name: 'Hz',\n      base: BASE_UNITS.FREQUENCY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0,\n      reciprocal: true\n    },\n    // Angle\n    rad: {\n      name: 'rad',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    radian: {\n      name: 'radian',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888\n    deg: {\n      name: 'deg',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    degree: {\n      name: 'degree',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399\n    grad: {\n      name: 'grad',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    gradian: {\n      name: 'gradian',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793\n    cycle: {\n      name: 'cycle',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795\n    arcsec: {\n      name: 'arcsec',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477\n    arcmin: {\n      name: 'arcmin',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null,\n      // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // Electric current\n    A: {\n      name: 'A',\n      base: BASE_UNITS.CURRENT,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    ampere: {\n      name: 'ampere',\n      base: BASE_UNITS.CURRENT,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // Temperature\n    // K(C) = °C + 273.15\n    // K(F) = (°F + 459.67) / 1.8\n    // K(R) = °R / 1.8\n    K: {\n      name: 'K',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 0\n    },\n    degC: {\n      name: 'degC',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 273.15\n    },\n    degF: {\n      name: 'degF',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 459.67\n    },\n    degR: {\n      name: 'degR',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 0\n    },\n    kelvin: {\n      name: 'kelvin',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 0\n    },\n    celsius: {\n      name: 'celsius',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 273.15\n    },\n    fahrenheit: {\n      name: 'fahrenheit',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 459.67\n    },\n    rankine: {\n      name: 'rankine',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.NONE,\n      value: 1 / 1.8,\n      offset: 0\n    },\n    // amount of substance\n    mol: {\n      name: 'mol',\n      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    mole: {\n      name: 'mole',\n      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // luminous intensity\n    cd: {\n      name: 'cd',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 0\n    },\n    candela: {\n      name: 'candela',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.NONE,\n      value: 1,\n      offset: 0\n    },\n    // TODO: units STERADIAN\n    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n    // Force\n    N: {\n      name: 'N',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    newton: {\n      name: 'newton',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    dyn: {\n      name: 'dyn',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.SHORT,\n      value: 0.00001,\n      offset: 0\n    },\n    dyne: {\n      name: 'dyne',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 0.00001,\n      offset: 0\n    },\n    lbf: {\n      name: 'lbf',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 4.4482216152605,\n      offset: 0\n    },\n    poundforce: {\n      name: 'poundforce',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 4.4482216152605,\n      offset: 0\n    },\n    kip: {\n      name: 'kip',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 4448.2216,\n      offset: 0\n    },\n    // Energy\n    J: {\n      name: 'J',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    joule: {\n      name: 'joule',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    erg: {\n      name: 'erg',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.NONE,\n      value: 1e-7,\n      offset: 0\n    },\n    Wh: {\n      name: 'Wh',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 3600,\n      offset: 0\n    },\n    BTU: {\n      name: 'BTU',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.BTU,\n      value: 1055.05585262,\n      offset: 0\n    },\n    eV: {\n      name: 'eV',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1.602176565e-19,\n      offset: 0\n    },\n    electronvolt: {\n      name: 'electronvolt',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.LONG,\n      value: 1.602176565e-19,\n      offset: 0\n    },\n    // Power\n    W: {\n      name: 'W',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    watt: {\n      name: 'watt',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    hp: {\n      name: 'hp',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.NONE,\n      value: 745.6998715386,\n      offset: 0\n    },\n    // Electrical power units\n    VAR: {\n      name: 'VAR',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: Complex.I,\n      offset: 0\n    },\n    VA: {\n      name: 'VA',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Pressure\n    Pa: {\n      name: 'Pa',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    psi: {\n      name: 'psi',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 6894.75729276459,\n      offset: 0\n    },\n    atm: {\n      name: 'atm',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 101325,\n      offset: 0\n    },\n    bar: {\n      name: 'bar',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.SHORTLONG,\n      value: 100000,\n      offset: 0\n    },\n    torr: {\n      name: 'torr',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 133.322,\n      offset: 0\n    },\n    mmHg: {\n      name: 'mmHg',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 133.322,\n      offset: 0\n    },\n    mmH2O: {\n      name: 'mmH2O',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 9.80665,\n      offset: 0\n    },\n    cmH2O: {\n      name: 'cmH2O',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 98.0665,\n      offset: 0\n    },\n    // Electric charge\n    coulomb: {\n      name: 'coulomb',\n      base: BASE_UNITS.ELECTRIC_CHARGE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    C: {\n      name: 'C',\n      base: BASE_UNITS.ELECTRIC_CHARGE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric capacitance\n    farad: {\n      name: 'farad',\n      base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    F: {\n      name: 'F',\n      base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric potential\n    volt: {\n      name: 'volt',\n      base: BASE_UNITS.ELECTRIC_POTENTIAL,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    V: {\n      name: 'V',\n      base: BASE_UNITS.ELECTRIC_POTENTIAL,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric resistance\n    ohm: {\n      name: 'ohm',\n      base: BASE_UNITS.ELECTRIC_RESISTANCE,\n      prefixes: PREFIXES.SHORTLONG,\n      // Both Mohm and megaohm are acceptable\n      value: 1,\n      offset: 0\n    },\n\n    /*\n     * Unicode breaks in browsers if charset is not specified\n    Ω: {\n      name: 'Ω',\n      base: BASE_UNITS.ELECTRIC_RESISTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    */\n    // Electric inductance\n    henry: {\n      name: 'henry',\n      base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    H: {\n      name: 'H',\n      base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric conductance\n    siemens: {\n      name: 'siemens',\n      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    S: {\n      name: 'S',\n      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Magnetic flux\n    weber: {\n      name: 'weber',\n      base: BASE_UNITS.MAGNETIC_FLUX,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    Wb: {\n      name: 'Wb',\n      base: BASE_UNITS.MAGNETIC_FLUX,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Magnetic flux density\n    tesla: {\n      name: 'tesla',\n      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    T: {\n      name: 'T',\n      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Binary\n    b: {\n      name: 'b',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_SHORT,\n      value: 1,\n      offset: 0\n    },\n    bits: {\n      name: 'bits',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_LONG,\n      value: 1,\n      offset: 0\n    },\n    B: {\n      name: 'B',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_SHORT,\n      value: 8,\n      offset: 0\n    },\n    bytes: {\n      name: 'bytes',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_LONG,\n      value: 8,\n      offset: 0\n    } // aliases (formerly plurals)\n\n  };\n  var ALIASES = {\n    meters: 'meter',\n    inches: 'inch',\n    feet: 'foot',\n    yards: 'yard',\n    miles: 'mile',\n    links: 'link',\n    rods: 'rod',\n    chains: 'chain',\n    angstroms: 'angstrom',\n    lt: 'l',\n    litres: 'litre',\n    liter: 'litre',\n    liters: 'litre',\n    teaspoons: 'teaspoon',\n    tablespoons: 'tablespoon',\n    minims: 'minim',\n    fluiddrams: 'fluiddram',\n    fluidounces: 'fluidounce',\n    gills: 'gill',\n    cups: 'cup',\n    pints: 'pint',\n    quarts: 'quart',\n    gallons: 'gallon',\n    beerbarrels: 'beerbarrel',\n    oilbarrels: 'oilbarrel',\n    hogsheads: 'hogshead',\n    gtts: 'gtt',\n    grams: 'gram',\n    tons: 'ton',\n    tonnes: 'tonne',\n    grains: 'grain',\n    drams: 'dram',\n    ounces: 'ounce',\n    poundmasses: 'poundmass',\n    hundredweights: 'hundredweight',\n    sticks: 'stick',\n    lb: 'lbm',\n    lbs: 'lbm',\n    kips: 'kip',\n    acres: 'acre',\n    hectares: 'hectare',\n    sqfeet: 'sqft',\n    sqyard: 'sqyd',\n    sqmile: 'sqmi',\n    sqmiles: 'sqmi',\n    mmhg: 'mmHg',\n    mmh2o: 'mmH2O',\n    cmh2o: 'cmH2O',\n    seconds: 'second',\n    secs: 'second',\n    minutes: 'minute',\n    mins: 'minute',\n    hours: 'hour',\n    hr: 'hour',\n    hrs: 'hour',\n    days: 'day',\n    weeks: 'week',\n    months: 'month',\n    years: 'year',\n    decades: 'decade',\n    centuries: 'century',\n    millennia: 'millennium',\n    hertz: 'hertz',\n    radians: 'radian',\n    degrees: 'degree',\n    gradians: 'gradian',\n    cycles: 'cycle',\n    arcsecond: 'arcsec',\n    arcseconds: 'arcsec',\n    arcminute: 'arcmin',\n    arcminutes: 'arcmin',\n    BTUs: 'BTU',\n    watts: 'watt',\n    joules: 'joule',\n    amperes: 'ampere',\n    coulombs: 'coulomb',\n    volts: 'volt',\n    ohms: 'ohm',\n    farads: 'farad',\n    webers: 'weber',\n    teslas: 'tesla',\n    electronvolts: 'electronvolt',\n    moles: 'mole'\n    /**\n     * Calculate the values for the angle units.\n     * Value is calculated as number or BigNumber depending on the configuration\n     * @param {{number: 'number' | 'BigNumber'}} config\n     */\n\n  };\n\n  function calculateAngleValues(config) {\n    if (config.number === 'BigNumber') {\n      var pi = constants.pi(type.BigNumber);\n      UNITS.rad.value = new type.BigNumber(1);\n      UNITS.deg.value = pi.div(180); // 2 * pi / 360\n\n      UNITS.grad.value = pi.div(200); // 2 * pi / 400\n\n      UNITS.cycle.value = pi.times(2); // 2 * pi\n\n      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600\n\n      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60\n    } else {\n      // number\n      UNITS.rad.value = 1;\n      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360\n\n      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400\n\n      UNITS.cycle.value = Math.PI * 2; // 2 * pi\n\n      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600\n\n      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60\n    } // copy to the full names of the angles\n\n\n    UNITS.radian.value = UNITS.rad.value;\n    UNITS.degree.value = UNITS.deg.value;\n    UNITS.gradian.value = UNITS.grad.value;\n  } // apply the angle values now\n\n\n  calculateAngleValues(config); // recalculate the values on change of configuration\n\n  math.on('config', function (curr, prev) {\n    if (curr.number !== prev.number) {\n      calculateAngleValues(curr);\n    }\n  });\n  /**\n   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.\n   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).\n   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.\n   */\n\n  var UNIT_SYSTEMS = {\n    si: {\n      // Base units\n      NONE: {\n        unit: UNIT_NONE,\n        prefix: PREFIXES.NONE['']\n      },\n      LENGTH: {\n        unit: UNITS.m,\n        prefix: PREFIXES.SHORT['']\n      },\n      MASS: {\n        unit: UNITS.g,\n        prefix: PREFIXES.SHORT['k']\n      },\n      TIME: {\n        unit: UNITS.s,\n        prefix: PREFIXES.SHORT['']\n      },\n      CURRENT: {\n        unit: UNITS.A,\n        prefix: PREFIXES.SHORT['']\n      },\n      TEMPERATURE: {\n        unit: UNITS.K,\n        prefix: PREFIXES.SHORT['']\n      },\n      LUMINOUS_INTENSITY: {\n        unit: UNITS.cd,\n        prefix: PREFIXES.SHORT['']\n      },\n      AMOUNT_OF_SUBSTANCE: {\n        unit: UNITS.mol,\n        prefix: PREFIXES.SHORT['']\n      },\n      ANGLE: {\n        unit: UNITS.rad,\n        prefix: PREFIXES.SHORT['']\n      },\n      BIT: {\n        unit: UNITS.bit,\n        prefix: PREFIXES.SHORT['']\n      },\n      // Derived units\n      FORCE: {\n        unit: UNITS.N,\n        prefix: PREFIXES.SHORT['']\n      },\n      ENERGY: {\n        unit: UNITS.J,\n        prefix: PREFIXES.SHORT['']\n      },\n      POWER: {\n        unit: UNITS.W,\n        prefix: PREFIXES.SHORT['']\n      },\n      PRESSURE: {\n        unit: UNITS.Pa,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CHARGE: {\n        unit: UNITS.C,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CAPACITANCE: {\n        unit: UNITS.F,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_POTENTIAL: {\n        unit: UNITS.V,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_RESISTANCE: {\n        unit: UNITS.ohm,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_INDUCTANCE: {\n        unit: UNITS.H,\n        prefix: PREFIXES.SHORT['']\n      },\n      ELECTRIC_CONDUCTANCE: {\n        unit: UNITS.S,\n        prefix: PREFIXES.SHORT['']\n      },\n      MAGNETIC_FLUX: {\n        unit: UNITS.Wb,\n        prefix: PREFIXES.SHORT['']\n      },\n      MAGNETIC_FLUX_DENSITY: {\n        unit: UNITS.T,\n        prefix: PREFIXES.SHORT['']\n      },\n      FREQUENCY: {\n        unit: UNITS.Hz,\n        prefix: PREFIXES.SHORT['']\n      }\n    } // Clone to create the other unit systems\n\n  };\n  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n  UNIT_SYSTEMS.cgs.LENGTH = {\n    unit: UNITS.m,\n    prefix: PREFIXES.SHORT['c']\n  };\n  UNIT_SYSTEMS.cgs.MASS = {\n    unit: UNITS.g,\n    prefix: PREFIXES.SHORT['']\n  };\n  UNIT_SYSTEMS.cgs.FORCE = {\n    unit: UNITS.dyn,\n    prefix: PREFIXES.SHORT['']\n  };\n  UNIT_SYSTEMS.cgs.ENERGY = {\n    unit: UNITS.erg,\n    prefix: PREFIXES.NONE[''] // there are wholly 4 unique cgs systems for electricity and magnetism,\n    // so let's not worry about it unless somebody complains\n\n  };\n  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n  UNIT_SYSTEMS.us.LENGTH = {\n    unit: UNITS.ft,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.MASS = {\n    unit: UNITS.lbm,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.TEMPERATURE = {\n    unit: UNITS.degF,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.FORCE = {\n    unit: UNITS.lbf,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.ENERGY = {\n    unit: UNITS.BTU,\n    prefix: PREFIXES.BTU['']\n  };\n  UNIT_SYSTEMS.us.POWER = {\n    unit: UNITS.hp,\n    prefix: PREFIXES.NONE['']\n  };\n  UNIT_SYSTEMS.us.PRESSURE = {\n    unit: UNITS.psi,\n    prefix: PREFIXES.NONE[''] // Add additional unit systems here.\n    // Choose a unit system to seed the auto unit system.\n\n  };\n  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si)); // Set the current unit system\n\n  var currentUnitSystem = UNIT_SYSTEMS.auto;\n  /**\n   * Set a unit system for formatting derived units.\n   * @param {string} [name] The name of the unit system.\n   */\n\n  Unit.setUnitSystem = function (name) {\n    if (UNIT_SYSTEMS.hasOwnProperty(name)) {\n      currentUnitSystem = UNIT_SYSTEMS[name];\n    } else {\n      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));\n    }\n  };\n  /**\n   * Return the current unit system.\n   * @return {string} The current unit system.\n   */\n\n\n  Unit.getUnitSystem = function () {\n    for (var _key in UNIT_SYSTEMS) {\n      if (UNIT_SYSTEMS[_key] === currentUnitSystem) {\n        return _key;\n      }\n    }\n  };\n  /**\n   * Converters to convert from number to an other numeric type like BigNumber\n   * or Fraction\n   */\n\n\n  Unit.typeConverters = {\n    BigNumber: function BigNumber(x) {\n      return new type.BigNumber(x + ''); // stringify to prevent constructor error\n    },\n    Fraction: function Fraction(x) {\n      return new type.Fraction(x);\n    },\n    Complex: function Complex(x) {\n      return x;\n    },\n    number: function number(x) {\n      return x;\n    }\n    /**\n     * Retrieve the right convertor function corresponding with the type\n     * of provided exampleValue.\n     *\n     * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'\n     *                        In case of an unknown type,\n     * @return {Function}\n     */\n\n  };\n\n  Unit._getNumberConverter = function (type) {\n    if (!Unit.typeConverters[type]) {\n      throw new TypeError('Unsupported type \"' + type + '\"');\n    }\n\n    return Unit.typeConverters[type];\n  }; // Add dimensions to each built-in unit\n\n\n  for (var _key2 in UNITS) {\n    var unit = UNITS[_key2];\n    unit.dimensions = unit.base.dimensions;\n  } // Create aliases\n\n\n  for (var name in ALIASES) {\n    if (ALIASES.hasOwnProperty(name)) {\n      var _unit2 = UNITS[ALIASES[name]];\n      var alias = {};\n\n      for (var _key3 in _unit2) {\n        if (_unit2.hasOwnProperty(_key3)) {\n          alias[_key3] = _unit2[_key3];\n        }\n      }\n\n      alias.name = name;\n      UNITS[name] = alias;\n    }\n  }\n\n  function assertUnitNameIsValid(name) {\n    for (var i = 0; i < name.length; i++) {\n      var _c = name.charAt(i);\n\n      var isValidAlpha = function isValidAlpha(p) {\n        return /^[a-zA-Z]$/.test(p);\n      };\n\n      var _isDigit = function _isDigit(c) {\n        return c >= '0' && c <= '9';\n      };\n\n      if (i === 0 && !isValidAlpha(_c)) {\n        throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"');\n      }\n\n      if (i > 0 && !(isValidAlpha(_c) || _isDigit(_c))) {\n        throw new Error('Invalid unit name (only alphanumeric characters are allowed): \"' + name + '\"');\n      }\n    }\n  }\n  /**\n   * Wrapper around createUnitSingle.\n   * Example:\n   *  createUnit({\n   *    foo: { },\n   *    bar: {\n   *      definition: 'kg/foo',\n   *      aliases: ['ba', 'barr', 'bars'],\n   *      offset: 200\n   *    },\n   *    baz: '4 bar'\n   *  },\n   *  {\n   *    override: true\n   *  })\n   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.\n   * @param {object} options\n   */\n\n\n  Unit.createUnit = function (obj, options) {\n    if (_typeof(obj) !== 'object') {\n      throw new TypeError(\"createUnit expects first parameter to be of type 'Object'\");\n    } // Remove all units and aliases we are overriding\n\n\n    if (options && options.override) {\n      for (var _key4 in obj) {\n        if (obj.hasOwnProperty(_key4)) {\n          Unit.deleteUnit(_key4);\n        }\n\n        if (obj[_key4].aliases) {\n          for (var i = 0; i < obj[_key4].aliases.length; i++) {\n            Unit.deleteUnit(obj[_key4].aliases[i]);\n          }\n        }\n      }\n    } // TODO: traverse multiple times until all units have been added\n\n\n    var lastUnit;\n\n    for (var _key5 in obj) {\n      if (obj.hasOwnProperty(_key5)) {\n        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);\n      }\n    }\n\n    return lastUnit;\n  };\n  /**\n   * Create a user-defined unit and register it with the Unit type.\n   * Example:\n   *  createUnitSingle('knot', '0.514444444 m/s')\n   *  createUnitSingle('acre', new Unit(43560, 'ft^2'))\n   *\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.\n   * @param {Object} options   (optional) An object containing any of the following properties:\n   *     prefixes {string} \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\". The default is \"none\".\n   *     aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']\n   *     offset {Numeric} An offset to apply when converting from the unit. For example, the offset for celsius is 273.15 and the offset for farhenheit is 459.67. Default is 0.\n   *\n   * @return {Unit}\n   */\n\n\n  Unit.createUnitSingle = function (name, obj, options) {\n    if (typeof obj === 'undefined' || obj === null) {\n      obj = {};\n    }\n\n    if (typeof name !== 'string') {\n      throw new TypeError(\"createUnitSingle expects first parameter to be of type 'string'\");\n    } // Check collisions with existing units\n\n\n    if (UNITS.hasOwnProperty(name)) {\n      throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists');\n    } // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.\n\n\n    assertUnitNameIsValid(name);\n    var defUnit = null; // The Unit from which the new unit will be created.\n\n    var aliases = [];\n    var offset = 0;\n    var definition;\n    var prefixes;\n\n    if (obj && obj.type === 'Unit') {\n      defUnit = obj.clone();\n    } else if (typeof obj === 'string') {\n      if (obj !== '') {\n        definition = obj;\n      }\n    } else if (_typeof(obj) === 'object') {\n      definition = obj.definition;\n      prefixes = obj.prefixes;\n      offset = obj.offset;\n\n      if (obj.aliases) {\n        aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array\n      }\n    } else {\n      throw new TypeError('Cannot create unit \"' + name + '\" from \"' + obj.toString() + '\": expecting \"string\" or \"Unit\" or \"Object\"');\n    }\n\n    if (aliases) {\n      for (var i = 0; i < aliases.length; i++) {\n        if (UNITS.hasOwnProperty(aliases[i])) {\n          throw new Error('Cannot create alias \"' + aliases[i] + '\": a unit with that name already exists');\n        }\n      }\n    }\n\n    if (definition && typeof definition === 'string' && !defUnit) {\n      try {\n        defUnit = Unit.parse(definition, {\n          allowNoUnits: true\n        });\n      } catch (ex) {\n        ex.message = 'Could not create unit \"' + name + '\" from \"' + definition + '\": ' + ex.message;\n        throw ex;\n      }\n    } else if (definition && definition.type === 'Unit') {\n      defUnit = definition.clone();\n    }\n\n    aliases = aliases || [];\n    offset = offset || 0;\n\n    if (prefixes && prefixes.toUpperCase) {\n      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;\n    } else {\n      prefixes = PREFIXES.NONE;\n    } // If defUnit is null, it is because the user did not\n    // specify a defintion. So create a new base dimension.\n\n\n    var newUnit = {};\n\n    if (!defUnit) {\n      // Add a new base dimension\n      var baseName = name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n\n      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {\n        throw new Error('Cannot create new base unit \"' + name + '\": a base unit with that name already exists (and cannot be overridden)');\n      }\n\n      BASE_DIMENSIONS.push(baseName); // Push 0 onto existing base units\n\n      for (var b in BASE_UNITS) {\n        if (BASE_UNITS.hasOwnProperty(b)) {\n          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;\n        }\n      } // Add the new base unit\n\n\n      var newBaseUnit = {\n        dimensions: []\n      };\n\n      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {\n        newBaseUnit.dimensions[_i6] = 0;\n      }\n\n      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;\n      newBaseUnit.key = baseName;\n      BASE_UNITS[baseName] = newBaseUnit;\n      newUnit = {\n        name: name,\n        value: 1,\n        dimensions: BASE_UNITS[baseName].dimensions.slice(0),\n        prefixes: prefixes,\n        offset: offset,\n        base: BASE_UNITS[baseName]\n      };\n      currentUnitSystem[baseName] = {\n        unit: newUnit,\n        prefix: PREFIXES.NONE['']\n      };\n    } else {\n      newUnit = {\n        name: name,\n        value: defUnit.value,\n        dimensions: defUnit.dimensions.slice(0),\n        prefixes: prefixes,\n        offset: offset // Create a new base if no matching base exists\n\n      };\n      var anyMatch = false;\n\n      for (var _i7 in BASE_UNITS) {\n        if (BASE_UNITS.hasOwnProperty(_i7)) {\n          var match = true;\n\n          for (var j = 0; j < BASE_DIMENSIONS.length; j++) {\n            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {\n              match = false;\n              break;\n            }\n          }\n\n          if (match) {\n            anyMatch = true;\n            newUnit.base = BASE_UNITS[_i7];\n            break;\n          }\n        }\n      }\n\n      if (!anyMatch) {\n        var _baseName = name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n        // Add the new base unit\n\n\n        var _newBaseUnit = {\n          dimensions: defUnit.dimensions.slice(0)\n        };\n        _newBaseUnit.key = _baseName;\n        BASE_UNITS[_baseName] = _newBaseUnit;\n        currentUnitSystem[_baseName] = {\n          unit: newUnit,\n          prefix: PREFIXES.NONE['']\n        };\n        newUnit.base = BASE_UNITS[_baseName];\n      }\n    }\n\n    Unit.UNITS[name] = newUnit;\n\n    for (var _i8 = 0; _i8 < aliases.length; _i8++) {\n      var aliasName = aliases[_i8];\n      var _alias = {};\n\n      for (var _key6 in newUnit) {\n        if (newUnit.hasOwnProperty(_key6)) {\n          _alias[_key6] = newUnit[_key6];\n        }\n      }\n\n      _alias.name = aliasName;\n      Unit.UNITS[aliasName] = _alias;\n    }\n\n    return new Unit(null, name);\n  };\n\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name];\n  }; // expose arrays with prefixes, dimensions, units, systems\n\n\n  Unit.PREFIXES = PREFIXES;\n  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;\n  Unit.BASE_UNITS = BASE_UNITS;\n  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;\n  Unit.UNITS = UNITS;\n  return Unit;\n}\n\nexports.name = 'Unit';\nexports.path = 'type';\nexports.factory = factory;\nexports.math = true; // request access to the math namespace","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a user-defined unit and register it with the Unit type.\n   *\n   * Syntax:\n   *\n   *     math.createUnit({\n   *       baseUnit1: {\n   *         aliases: [string, ...]\n   *         prefixes: object\n   *       },\n   *       unit2: {\n   *         definition: string,\n   *         aliases: [string, ...]\n   *         prefixes: object,\n   *         offset: number\n   *       },\n   *       unit3: string    // Shortcut\n   *     })\n   *\n   *     // Another shortcut:\n   *     math.createUnit(string, unit : string, [object])\n   *\n   * Examples:\n   *\n   *     math.createUnit('foo')\n   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})\n   *     math.createUnit('mph', '1 mile/hour')\n   *\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.\n   * @param {Object} options   (optional) An object containing any of the following properties:\n   *     - `prefixes {string}` \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\". The default is \"none\".\n   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']\n   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.\n   *\n   * See also:\n   *\n   *     unit\n   *\n   * @return {Unit} The new unit\n   */\n  var createUnit = typed('createUnit', {\n    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.\n    'Object, Object': function ObjectObject(obj, options) {\n      return type.Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    'Object': function Object(obj) {\n      return type.Unit.createUnit(obj, {});\n    },\n    // Shortcut method for creating one unit.\n    'string, Unit | string | Object, Object': function stringUnitStringObjectObject(name, def, options) {\n      var obj = {};\n      obj[name] = def;\n      return type.Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    'string, Unit | string | Object': function stringUnitStringObject(name, def) {\n      var obj = {};\n      obj[name] = def;\n      return type.Unit.createUnit(obj, {});\n    },\n    // Without a definition, creates a base unit.\n    'string': function string(name) {\n      var obj = {};\n      obj[name] = {};\n      return type.Unit.createUnit(obj, {});\n    }\n  });\n  return createUnit;\n}\n\nexports.name = 'createUnit';\nexports.factory = factory;","'use strict';\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Split a unit in an array of units whose sum is equal to the original unit.\n   *\n   * Syntax:\n   *\n   *     splitUnit(unit: Unit, parts: Array.<Unit>)\n   *\n   * Example:\n   *\n   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])\n   *     // [ 3 feet, 3.3700787401575 inch ]\n   *\n   * See also:\n   *\n   *     unit\n   *\n   * @param {Array} [parts] An array of strings or valueless units.\n   * @return {Array} An array of units.\n   */\n  var splitUnit = typed('splitUnit', {\n    'Unit, Array': function UnitArray(unit, parts) {\n      return unit.splitUnit(parts);\n    }\n  });\n  return splitUnit;\n}\n\nexports.name = 'splitUnit';\nexports.factory = factory;","'use strict';\n\nvar deepMap = require('../../../utils/collection/deepMap');\n\nfunction factory(type, config, load, typed) {\n  /**\n   * Create a unit. Depending on the passed arguments, the function\n   * will create and return a new math.type.Unit object.\n   * When a matrix is provided, all elements will be converted to units.\n   *\n   * Syntax:\n   *\n   *     math.unit(unit : string)\n   *     math.unit(value : number, unit : string)\n   *\n   * Examples:\n   *\n   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm\n   *    const b = math.unit('23 kg')    // returns Unit 23 kg\n   *    a.to('m')                       // returns Unit 0.05 m\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, number, string, createUnit\n   *\n   * @param {* | Array | Matrix} args   A number and unit.\n   * @return {Unit | Array | Matrix}    The created unit\n   */\n  var unit = typed('unit', {\n    'Unit': function Unit(x) {\n      return x.clone();\n    },\n    'string': function string(x) {\n      if (type.Unit.isValuelessUnit(x)) {\n        return new type.Unit(null, x); // a pure unit\n      }\n\n      return type.Unit.parse(x, {\n        allowNoUnits: true\n      }); // a unit with value, like '5cm'\n    },\n    'number | BigNumber | Fraction | Complex, string': function numberBigNumberFractionComplexString(value, unit) {\n      return new type.Unit(value, unit);\n    },\n    'Array | Matrix': function ArrayMatrix(x) {\n      return deepMap(x, unit);\n    }\n  });\n  unit.toTex = {\n    1: \"\\\\left(${args[0]}\\\\right)\",\n    2: \"\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)\"\n  };\n  return unit;\n}\n\nexports.name = 'unit';\nexports.factory = factory;","'use strict';\n\nmodule.exports = [// type\nrequire('./Unit'), // construction function\nrequire('./function/unit'), // create new units\nrequire('./function/createUnit'), // split units\nrequire('./function/splitUnit'), // physical constants\nrequire('./physicalConstants')];","'use strict';\n\nvar lazy = require('../../utils/object').lazy;\n\nfunction factory(type, config, load, typed, math) {\n  // helper function to create a unit with a fixed prefix\n  function fixedUnit(str) {\n    var unit = type.Unit.parse(str);\n    unit.fixPrefix = true;\n    return unit;\n  } // Source: https://en.wikipedia.org/wiki/Physical_constant\n  // Universal constants\n\n\n  setLazyConstant(math, 'speedOfLight', function () {\n    return fixedUnit('299792458 m s^-1');\n  });\n  setLazyConstant(math, 'gravitationConstant', function () {\n    return fixedUnit('6.6738480e-11 m^3 kg^-1 s^-2');\n  });\n  setLazyConstant(math, 'planckConstant', function () {\n    return fixedUnit('6.626069311e-34 J s');\n  });\n  setLazyConstant(math, 'reducedPlanckConstant', function () {\n    return fixedUnit('1.05457172647e-34 J s');\n  }); // Electromagnetic constants\n\n  setLazyConstant(math, 'magneticConstant', function () {\n    return fixedUnit('1.2566370614e-6 N A^-2');\n  });\n  setLazyConstant(math, 'electricConstant', function () {\n    return fixedUnit('8.854187817e-12 F m^-1');\n  });\n  setLazyConstant(math, 'vacuumImpedance', function () {\n    return fixedUnit('376.730313461 ohm');\n  });\n  setLazyConstant(math, 'coulomb', function () {\n    return fixedUnit('8.9875517873681764e9 N m^2 C^-2');\n  });\n  setLazyConstant(math, 'elementaryCharge', function () {\n    return fixedUnit('1.60217656535e-19 C');\n  });\n  setLazyConstant(math, 'bohrMagneton', function () {\n    return fixedUnit('9.2740096820e-24 J T^-1');\n  });\n  setLazyConstant(math, 'conductanceQuantum', function () {\n    return fixedUnit('7.748091734625e-5 S');\n  });\n  setLazyConstant(math, 'inverseConductanceQuantum', function () {\n    return fixedUnit('12906.403721742 ohm');\n  });\n  setLazyConstant(math, 'magneticFluxQuantum', function () {\n    return fixedUnit('2.06783375846e-15 Wb');\n  });\n  setLazyConstant(math, 'nuclearMagneton', function () {\n    return fixedUnit('5.0507835311e-27 J T^-1');\n  });\n  setLazyConstant(math, 'klitzing', function () {\n    return fixedUnit('25812.807443484 ohm');\n  }); // setLazyConstant(math, 'josephson',                 function () {return fixedUnit('4.8359787011e-14 Hz V^-1')})  // TODO: support for Hz needed\n  // Atomic and nuclear constants\n\n  setLazyConstant(math, 'bohrRadius', function () {\n    return fixedUnit('5.291772109217e-11 m');\n  });\n  setLazyConstant(math, 'classicalElectronRadius', function () {\n    return fixedUnit('2.817940326727e-15 m');\n  });\n  setLazyConstant(math, 'electronMass', function () {\n    return fixedUnit('9.1093829140e-31 kg');\n  });\n  setLazyConstant(math, 'fermiCoupling', function () {\n    return fixedUnit('1.1663645e-5 GeV^-2');\n  });\n  setLazyConstant(math, 'fineStructure', function () {\n    return 7.297352569824e-3;\n  });\n  setLazyConstant(math, 'hartreeEnergy', function () {\n    return fixedUnit('4.3597443419e-18 J');\n  });\n  setLazyConstant(math, 'protonMass', function () {\n    return fixedUnit('1.67262177774e-27 kg');\n  });\n  setLazyConstant(math, 'deuteronMass', function () {\n    return fixedUnit('3.3435830926e-27 kg');\n  });\n  setLazyConstant(math, 'neutronMass', function () {\n    return fixedUnit('1.6749271613e-27 kg');\n  });\n  setLazyConstant(math, 'quantumOfCirculation', function () {\n    return fixedUnit('3.636947552024e-4 m^2 s^-1');\n  });\n  setLazyConstant(math, 'rydberg', function () {\n    return fixedUnit('10973731.56853955 m^-1');\n  });\n  setLazyConstant(math, 'thomsonCrossSection', function () {\n    return fixedUnit('6.65245873413e-29 m^2');\n  });\n  setLazyConstant(math, 'weakMixingAngle', function () {\n    return 0.222321;\n  });\n  setLazyConstant(math, 'efimovFactor', function () {\n    return 22.7;\n  }); // Physico-chemical constants\n\n  setLazyConstant(math, 'atomicMass', function () {\n    return fixedUnit('1.66053892173e-27 kg');\n  });\n  setLazyConstant(math, 'avogadro', function () {\n    return fixedUnit('6.0221412927e23 mol^-1');\n  });\n  setLazyConstant(math, 'boltzmann', function () {\n    return fixedUnit('1.380648813e-23 J K^-1');\n  });\n  setLazyConstant(math, 'faraday', function () {\n    return fixedUnit('96485.336521 C mol^-1');\n  });\n  setLazyConstant(math, 'firstRadiation', function () {\n    return fixedUnit('3.7417715317e-16 W m^2');\n  }); // setLazyConstant(math, 'spectralRadiance',   function () {return fixedUnit('1.19104286953e-16 W m^2 sr^-1')}) // TODO spectralRadiance\n\n  setLazyConstant(math, 'loschmidt', function () {\n    return fixedUnit('2.686780524e25 m^-3');\n  });\n  setLazyConstant(math, 'gasConstant', function () {\n    return fixedUnit('8.314462175 J K^-1 mol^-1');\n  });\n  setLazyConstant(math, 'molarPlanckConstant', function () {\n    return fixedUnit('3.990312717628e-10 J s mol^-1');\n  });\n  setLazyConstant(math, 'molarVolume', function () {\n    return fixedUnit('2.241396820e-10 m^3 mol^-1');\n  });\n  setLazyConstant(math, 'sackurTetrode', function () {\n    return -1.164870823;\n  });\n  setLazyConstant(math, 'secondRadiation', function () {\n    return fixedUnit('1.438777013e-2 m K');\n  });\n  setLazyConstant(math, 'stefanBoltzmann', function () {\n    return fixedUnit('5.67037321e-8 W m^-2 K^-4');\n  });\n  setLazyConstant(math, 'wienDisplacement', function () {\n    return fixedUnit('2.897772126e-3 m K');\n  }); // Adopted values\n\n  setLazyConstant(math, 'molarMass', function () {\n    return fixedUnit('1e-3 kg mol^-1');\n  });\n  setLazyConstant(math, 'molarMassC12', function () {\n    return fixedUnit('1.2e-2 kg mol^-1');\n  });\n  setLazyConstant(math, 'gravity', function () {\n    return fixedUnit('9.80665 m s^-2');\n  }); // atm is defined in Unit.js\n  // Natural units\n\n  setLazyConstant(math, 'planckLength', function () {\n    return fixedUnit('1.61619997e-35 m');\n  });\n  setLazyConstant(math, 'planckMass', function () {\n    return fixedUnit('2.1765113e-8 kg');\n  });\n  setLazyConstant(math, 'planckTime', function () {\n    return fixedUnit('5.3910632e-44 s');\n  });\n  setLazyConstant(math, 'planckCharge', function () {\n    return fixedUnit('1.87554595641e-18 C');\n  });\n  setLazyConstant(math, 'planckTemperature', function () {\n    return fixedUnit('1.41683385e+32 K');\n  });\n} // create a lazy constant in both math and mathWithTransform\n\n\nfunction setLazyConstant(math, name, resolver) {\n  lazy(math, name, resolver);\n  lazy(math.expression.mathWithTransform, name, resolver);\n}\n\nexports.factory = factory;\nexports.lazy = false; // no lazy loading of constants, the constants themselves are lazy when needed\n\nexports.math = true; // request access to the math namespace","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.size = size;\nexports.validate = validate;\nexports.validateIndex = validateIndex;\nexports.resize = resize;\nexports.reshape = reshape;\nexports.squeeze = squeeze;\nexports.unsqueeze = unsqueeze;\nexports.flatten = flatten;\nexports.map = map;\nexports.forEach = forEach;\nexports.filter = filter;\nexports.filterRegExp = filterRegExp;\nexports.join = join;\nexports.identify = identify;\nexports.generalize = generalize;\n\nvar _number = _interopRequireDefault(require(\"./number\"));\n\nvar _string = _interopRequireDefault(require(\"./string\"));\n\nvar _DimensionError = _interopRequireDefault(require(\"../error/DimensionError\"));\n\nvar _IndexError = _interopRequireDefault(require(\"../error/IndexError\"));\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @Return {Number[]} size\n */\nfunction size(x) {\n  var s = [];\n\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n\n  return s;\n}\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @param {number} dim   Current dimension\n * @throws DimensionError\n * @private\n */\n\n\nfunction _validate(array, size, dim) {\n  var i;\n  var len = array.length;\n\n  if (len !== size[dim]) {\n    throw new _DimensionError.default(len, size[dim]);\n  }\n\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    var dimNext = dim + 1;\n\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n\n      if (!Array.isArray(child)) {\n        throw new _DimensionError.default(size.length - 1, size.length, '<');\n      }\n\n      _validate(array[i], size, dimNext);\n    }\n  } else {\n    // last dimension. none of the childs may be an array\n    for (i = 0; i < len; i++) {\n      if (Array.isArray(array[i])) {\n        throw new _DimensionError.default(size.length + 1, size.length, '>');\n      }\n    }\n  }\n}\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @throws DimensionError\n */\n\n\nfunction validate(array, size) {\n  var isScalar = size.length === 0;\n\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new _DimensionError.default(array.length, 0);\n    }\n  } else {\n    // array\n    _validate(array, size, 0);\n  }\n}\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index    Zero-based index\n * @param {number} [length] Length of the array\n */\n\n\nfunction validateIndex(index, length) {\n  if (!_number.default.isNumber(index) || !_number.default.isInteger(index)) {\n    throw new TypeError('Index must be an integer (value: ' + index + ')');\n  }\n\n  if (index < 0 || typeof length === 'number' && index >= length) {\n    throw new _IndexError.default(index, length);\n  }\n}\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array} array         Array to be resized\n * @param {Array.<number>} size Array with the size of each dimension\n * @param {*} [defaultValue=0]  Value to be filled in in new entries,\n *                              zero by default. Specify for example `null`,\n *                              to clearly see entries that are not explicitly\n *                              set.\n * @return {Array} array         The resized array\n */\n\n\nfunction resize(array, size, defaultValue) {\n  // TODO: add support for scalars, having size=[] ?\n  // check the type of the arguments\n  if (!Array.isArray(array) || !Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  } // check whether size contains positive integers\n\n\n  size.forEach(function (value) {\n    if (!_number.default.isNumber(value) || !_number.default.isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + _string.default.format(size) + ')');\n    }\n  }); // recursively resize the array\n\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n\n  _resize(array, size, 0, _defaultValue);\n\n  return array;\n}\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array         Array to be resized\n * @param {number[]} size       Array with the size of each dimension\n * @param {number} dim          Current dimension\n * @param {*} [defaultValue]    Value to be filled in in new entries,\n *                              undefined by default.\n * @private\n */\n\n\nfunction _resize(array, size, dim, defaultValue) {\n  var i;\n  var elem;\n  var oldLen = array.length;\n  var newLen = size[dim];\n  var minLen = Math.min(oldLen, newLen); // apply new length\n\n  array.length = newLen;\n\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1; // resize existing child arrays\n\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n\n        array[i] = elem;\n      }\n\n      _resize(elem, size, dimNext, defaultValue);\n    } // create new child arrays\n\n\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem; // resize new child array\n\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\n    // remove dimensions of existing values\n    for (i = 0; i < minLen; i++) {\n      while (Array.isArray(array[i])) {\n        array[i] = array[i][0];\n      }\n    } // fill new elements with the default value\n\n\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\n    }\n  }\n}\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {Array.<number>} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n *\n * @throws {DimensionError}       If the product of the new dimension sizes does\n *                                not equal that of the old ones\n */\n\n\nfunction reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var newArray;\n\n  function product(arr) {\n    return arr.reduce(function (prev, curr) {\n      return prev * curr;\n    });\n  }\n\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected');\n  }\n\n  if (sizes.length === 0) {\n    throw new _DimensionError.default(0, product(size(array)), '!=');\n  }\n\n  var totalSize = 1;\n\n  for (var sizeIndex = 0; sizeIndex < sizes.length; sizeIndex++) {\n    totalSize *= sizes[sizeIndex];\n  }\n\n  if (flatArray.length !== totalSize) {\n    throw new _DimensionError.default(product(sizes), product(size(array)), '!=');\n  }\n\n  try {\n    newArray = _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof _DimensionError.default) {\n      throw new _DimensionError.default(product(sizes), product(size(array)), '!=');\n    }\n\n    throw e;\n  }\n\n  return newArray;\n}\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {Array.<number>} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n */\n\n\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2; // for each dimensions starting by the last one and ignoring the first one\n\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = []; // aggregate the elements of the current tmpArray in elements of the requested size\n\n    var length = tmpArray.length / size;\n\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    } // set it as the new tmpArray for the next loop turn or for return\n\n\n    tmpArray = tmpArray2;\n  }\n\n  return tmpArray;\n}\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [arraySize]\n * @returns {Array} returns the array itself\n */\n\n\nfunction squeeze(array, arraySize) {\n  var s = arraySize || size(array); // squeeze outer dimensions\n\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  } // find the first dimension to be squeezed\n\n\n  var dims = s.length;\n\n  while (s[dims - 1] === 1) {\n    dims--;\n  } // squeeze inner dimensions\n\n\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n\n  return array;\n}\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\n\n\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n\n  if (dim < dims) {\n    var next = dim + 1;\n\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _squeeze(array[i], dims, next);\n    }\n  } else {\n    while (Array.isArray(array)) {\n      array = array[0];\n    }\n  }\n\n  return array;\n}\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Paramter `size` will be mutated to match the new, unqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims       Desired number of dimensions of the array\n * @param {number} [outer]    Number of outer dimensions to be added\n * @param {Array} [arraySize] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\n\n\nfunction unsqueeze(array, dims, outer, arraySize) {\n  var s = arraySize || size(array); // unsqueeze outer dimensions\n\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  } // unsqueeze inner dimensions\n\n\n  array = _unsqueeze(array, dims, 0);\n\n  while (s.length < dims) {\n    s.push(1);\n  }\n\n  return array;\n}\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\n\n\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n\n  if (Array.isArray(array)) {\n    var next = dim + 1;\n\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next);\n    }\n  } else {\n    for (var d = dim; d < dims; d++) {\n      array = [array];\n    }\n  }\n\n  return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array   A multi dimensional array\n * @return {Array}        The flattened array (1 dimensional)\n */\n\n\nfunction flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n\n  var flat = [];\n  array.forEach(function callback(value) {\n    if (Array.isArray(value)) {\n      value.forEach(callback); // traverse through sub-arrays recursively\n    } else {\n      flat.push(value);\n    }\n  });\n  return flat;\n}\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\n\n\nfunction map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\n\n\nfunction forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\n\n\nfunction filter(array, callback) {\n  if (size(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n\n  return Array.prototype.filter.call(array, callback);\n}\n/**\n * Filter values in a callback given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\n\n\nfunction filterRegExp(array, regexp) {\n  if (size(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n\n  return Array.prototype.filter.call(array, function (entry) {\n    return regexp.test(entry);\n  });\n}\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\n\n\nfunction join(array, separator) {\n  return Array.prototype.join.call(array, separator);\n}\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a  An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\n\n\nfunction identify(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n\n  if (a.length === 0) {\n    return a;\n  }\n\n  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\n  };\n\n  for (var i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++;\n    } else {\n      count = 0;\n    }\n\n    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n\n  return b;\n}\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a  An array\n * @return {array} An array of values without identifiers\n */\n\n\nfunction generalize(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n\n  if (a.length === 0) {\n    return a;\n  }\n\n  var b = [];\n\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n\n  return b;\n}","'use strict';\n\nvar bitwise = require('./bitwise');\n/**\n * Bitwise and for Bignumbers\n *\n * Special Cases:\n *   N &  n =  N\n *   n &  0 =  0\n *   n & -1 =  n\n *   n &  n =  n\n *   I &  I =  I\n *  -I & -I = -I\n *   I & -I =  0\n *   I &  n =  n\n *   I & -n =  I\n *  -I &  n =  0\n *  -I & -n = -I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` & `y`, is fully precise\n * @private\n */\n\n\nmodule.exports = function bitAnd(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitAnd');\n  }\n\n  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.eq(-1) || x.eq(y)) {\n    return x;\n  }\n\n  if (y.isZero() || x.eq(-1)) {\n    return y;\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      if (x.isNegative() === y.isNegative()) {\n        return x;\n      }\n\n      return new BigNumber(0);\n    }\n\n    if (!x.isFinite()) {\n      if (y.isNegative()) {\n        return x;\n      }\n\n      if (x.isNegative()) {\n        return new BigNumber(0);\n      }\n\n      return y;\n    }\n\n    if (!y.isFinite()) {\n      if (x.isNegative()) {\n        return y;\n      }\n\n      if (y.isNegative()) {\n        return new BigNumber(0);\n      }\n\n      return x;\n    }\n  }\n\n  return bitwise(x, y, function (a, b) {\n    return a & b;\n  });\n};","'use strict';\n/**\n * Bitwise not\n * @param {BigNumber} x\n * @return {BigNumber} Result of ~`x`, fully precise\n *\n */\n\nmodule.exports = function bitNot(x) {\n  if (x.isFinite() && !x.isInteger()) {\n    throw new Error('Integer expected in function bitNot');\n  }\n\n  var BigNumber = x.constructor;\n  var prevPrec = BigNumber.precision;\n  BigNumber.config({\n    precision: 1E9\n  });\n  var result = x.plus(new BigNumber(1));\n  result.s = -result.s || null;\n  BigNumber.config({\n    precision: prevPrec\n  });\n  return result;\n};","'use strict';\n\nvar bitwise = require('./bitwise');\n/**\n * Bitwise OR for BigNumbers\n *\n * Special Cases:\n *   N |  n =  N\n *   n |  0 =  n\n *   n | -1 = -1\n *   n |  n =  n\n *   I |  I =  I\n *  -I | -I = -I\n *   I | -n = -1\n *   I | -I = -1\n *   I |  n =  I\n *  -I |  n = -I\n *  -I | -n = -n\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` | `y`, fully precise\n */\n\n\nmodule.exports = function bitOr(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitOr');\n  }\n\n  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  var negOne = new BigNumber(-1);\n\n  if (x.isZero() || y.eq(negOne) || x.eq(y)) {\n    return y;\n  }\n\n  if (y.isZero() || x.eq(negOne)) {\n    return x;\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !x.isNegative() && y.isNegative() || x.isNegative() && !y.isNegative() && !y.isFinite()) {\n      return negOne;\n    }\n\n    if (x.isNegative() && y.isNegative()) {\n      return x.isFinite() ? x : y;\n    }\n\n    return x.isFinite() ? y : x;\n  }\n\n  return bitwise(x, y, function (a, b) {\n    return a | b;\n  });\n};","'use strict';\n\nvar bitwise = require('./bitwise');\n\nvar bitNot = require('./bitNot');\n/**\n * Bitwise XOR for BigNumbers\n *\n * Special Cases:\n *   N ^  n =  N\n *   n ^  0 =  n\n *   n ^  n =  0\n *   n ^ -1 = ~n\n *   I ^  n =  I\n *   I ^ -n = -I\n *   I ^ -I = -1\n *  -I ^  n = -I\n *  -I ^ -n =  I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` ^ `y`, fully precise\n *\n */\n\n\nmodule.exports = function bitXor(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitXor');\n  }\n\n  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero()) {\n    return y;\n  }\n\n  if (y.isZero()) {\n    return x;\n  }\n\n  if (x.eq(y)) {\n    return new BigNumber(0);\n  }\n\n  var negOne = new BigNumber(-1);\n\n  if (x.eq(negOne)) {\n    return bitNot(y);\n  }\n\n  if (y.eq(negOne)) {\n    return bitNot(x);\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      return negOne;\n    }\n\n    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);\n  }\n\n  return bitwise(x, y, function (a, b) {\n    return a ^ b;\n  });\n};","'use strict';\n\nvar bitNot = require('./bitNot');\n/**\n * Applies bitwise function to numbers\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @param {function (a, b)} func\n * @return {BigNumber}\n */\n\n\nmodule.exports = function bitwise(x, y, func) {\n  var BigNumber = x.constructor;\n  var xBits, yBits;\n  var xSign = +(x.s < 0);\n  var ySign = +(y.s < 0);\n\n  if (xSign) {\n    xBits = decCoefficientToBinaryString(bitNot(x));\n\n    for (var i = 0; i < xBits.length; ++i) {\n      xBits[i] ^= 1;\n    }\n  } else {\n    xBits = decCoefficientToBinaryString(x);\n  }\n\n  if (ySign) {\n    yBits = decCoefficientToBinaryString(bitNot(y));\n\n    for (var _i = 0; _i < yBits.length; ++_i) {\n      yBits[_i] ^= 1;\n    }\n  } else {\n    yBits = decCoefficientToBinaryString(y);\n  }\n\n  var minBits, maxBits, minSign;\n\n  if (xBits.length <= yBits.length) {\n    minBits = xBits;\n    maxBits = yBits;\n    minSign = xSign;\n  } else {\n    minBits = yBits;\n    maxBits = xBits;\n    minSign = ySign;\n  }\n\n  var shortLen = minBits.length;\n  var longLen = maxBits.length;\n  var expFuncVal = func(xSign, ySign) ^ 1;\n  var outVal = new BigNumber(expFuncVal ^ 1);\n  var twoPower = new BigNumber(1);\n  var two = new BigNumber(2);\n  var prevPrec = BigNumber.precision;\n  BigNumber.config({\n    precision: 1E9\n  });\n\n  while (shortLen > 0) {\n    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n\n    twoPower = twoPower.times(two);\n  }\n\n  while (longLen > 0) {\n    if (func(minSign, maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n\n    twoPower = twoPower.times(two);\n  }\n\n  BigNumber.config({\n    precision: prevPrec\n  });\n\n  if (expFuncVal === 0) {\n    outVal.s = -outVal.s;\n  }\n\n  return outVal;\n};\n/* Extracted from decimal.js, and edited to specialize. */\n\n\nfunction decCoefficientToBinaryString(x) {\n  // Convert to string\n  var a = x.d; // array with digits\n\n  var r = a[0] + '';\n\n  for (var i = 1; i < a.length; ++i) {\n    var s = a[i] + '';\n\n    for (var z = 7 - s.length; z--;) {\n      s = '0' + s;\n    }\n\n    r += s;\n  }\n\n  var j = r.length;\n\n  while (r.charAt(j) === '0') {\n    j--;\n  }\n\n  var xe = x.e;\n  var str = r.slice(0, j + 1 || 1);\n  var strL = str.length;\n\n  if (xe > 0) {\n    if (++xe > strL) {\n      // Append zeros.\n      xe -= strL;\n\n      while (xe--) {\n        str += '0';\n      }\n    } else if (xe < strL) {\n      str = str.slice(0, xe) + '.' + str.slice(xe);\n    }\n  } // Convert from base 10 (decimal) to base 2\n\n\n  var arr = [0];\n\n  for (var _i2 = 0; _i2 < str.length;) {\n    var arrL = arr.length;\n\n    while (arrL--) {\n      arr[arrL] *= 10;\n    }\n\n    arr[0] += parseInt(str.charAt(_i2++)); // convert to int\n\n    for (var _j = 0; _j < arr.length; ++_j) {\n      if (arr[_j] > 1) {\n        if (arr[_j + 1] === null || arr[_j + 1] === undefined) {\n          arr[_j + 1] = 0;\n        }\n\n        arr[_j + 1] += arr[_j] >> 1;\n        arr[_j] &= 1;\n      }\n    }\n  }\n\n  return arr.reverse();\n}","'use strict';\n\nvar memoize = require('../function').memoize;\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\n\n\nexports.e = memoize(function (BigNumber) {\n  return new BigNumber(1).exp();\n}, hasher);\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\n\nexports.phi = memoize(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, hasher);\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\n\nexports.pi = memoize(function (BigNumber) {\n  return BigNumber.acos(-1);\n}, hasher);\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\n\nexports.tau = memoize(function (BigNumber) {\n  return exports.pi(BigNumber).times(2);\n}, hasher);\n/**\n * Create a hash for a BigNumber constructor function. The created has is\n * the configured precision\n * @param {Array} args         Supposed to contain a single entry with\n *                             a BigNumber constructor\n * @return {number} precision\n * @private\n */\n\nfunction hasher(args) {\n  return args[0].precision;\n}","'use strict';\n\nvar objectUtils = require('../object');\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lower` and `upper` bounds, and uses\n *                                          exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'\n *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'\n *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\n\n\nexports.format = function (value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  } // handle special cases\n\n\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  } // default values for options\n\n\n  var notation = 'auto';\n  var precision;\n\n  if (options !== undefined) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    } // determine precision from options\n\n\n    if (typeof options === 'number') {\n      precision = options;\n    } else if (options.precision) {\n      precision = options.precision;\n    }\n  } // handle the various notations\n\n\n  switch (notation) {\n    case 'fixed':\n      return exports.toFixed(value, precision);\n\n    case 'exponential':\n      return exports.toExponential(value, precision);\n\n    case 'auto':\n      // TODO: clean up some day. Deprecated since: 2018-01-24\n      // @deprecated upper and lower are replaced with upperExp and lowerExp since v4.0.0\n      if (options && options.exponential && (options.exponential.lower !== undefined || options.exponential.upper !== undefined)) {\n        var fixedOptions = objectUtils.map(options, function (x) {\n          return x;\n        });\n        fixedOptions.exponential = undefined;\n\n        if (options.exponential.lower !== undefined) {\n          fixedOptions.lowerExp = Math.round(Math.log(options.exponential.lower) / Math.LN10);\n        }\n\n        if (options.exponential.upper !== undefined) {\n          fixedOptions.upperExp = Math.round(Math.log(options.exponential.upper) / Math.LN10);\n        }\n\n        console.warn('Deprecation warning: Formatting options exponential.lower and exponential.upper ' + '(minimum and maximum value) ' + 'are replaced with exponential.lowerExp and exponential.upperExp ' + '(minimum and maximum exponent) since version 4.0.0. ' + 'Replace ' + JSON.stringify(options) + ' with ' + JSON.stringify(fixedOptions));\n        return exports.format(value, fixedOptions);\n      } // determine lower and upper bound for exponential notation.\n      // TODO: implement support for upper and lower to be BigNumbers themselves\n\n\n      var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n      var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5; // handle special case zero\n\n      if (value.isZero()) return '0'; // determine whether or not to output exponential notation\n\n      var str;\n      var exp = value.e;\n\n      if (exp >= lowerExp && exp < upperExp) {\n        // normal number notation\n        str = value.toSignificantDigits(precision).toFixed();\n      } else {\n        // exponential notation\n        str = exports.toExponential(value, precision);\n      } // remove trailing zeros after the decimal point\n\n\n      return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", or \"fixed\".');\n  }\n};\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n * @returns {string} str\n */\n\n\nexports.toExponential = function (value, precision) {\n  if (precision !== undefined) {\n    return value.toExponential(precision - 1); // Note the offset of one\n  } else {\n    return value.toExponential();\n  }\n};\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n *                                       decimal point. Undefined by default.\n */\n\n\nexports.toFixed = function (value, precision) {\n  return value.toFixed(precision);\n};","'use strict';\n/**\n * Test whether a value is a BigNumber\n * @param {*} x\n * @return {boolean}\n */\n\nmodule.exports = function isBigNumber(x) {\n  return x && x.constructor.prototype.isBigNumber || false;\n};","'use strict';\n/**\n * Bitwise left shift\n *\n * Special Cases:\n *  n << -n = N\n *  n <<  N = N\n *  N <<  n = N\n *  n <<  0 = n\n *  0 <<  n = 0\n *  I <<  I = N\n *  I <<  n = I\n *  n <<  I = I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` << `y`\n *\n */\n\nmodule.exports = function leftShift(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function leftShift');\n  }\n\n  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n\n  if (!x.isFinite() && !y.isFinite()) {\n    return new BigNumber(NaN);\n  } // Math.pow(2, y) is fully precise for y < 55, and fast\n\n\n  if (y.lt(55)) {\n    return x.times(Math.pow(2, y.toNumber()) + '');\n  }\n\n  return x.times(new BigNumber(2).pow(y));\n};","'use strict';\n/**\n * Compares two BigNumbers.\n * @param {BigNumber} x       First value to compare\n * @param {BigNumber} y       Second value to compare\n * @param {number} [epsilon]  The maximum relative difference between x and y\n *                            If epsilon is undefined or null, the function will\n *                            test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n */\n\nmodule.exports = function nearlyEqual(x, y, epsilon) {\n  // if epsilon is null or undefined, test whether x and y are exactly equal\n  if (epsilon === null || epsilon === undefined) {\n    return x.eq(y);\n  } // use \"==\" operator, handles infinities\n\n\n  if (x.eq(y)) {\n    return true;\n  } // NaN\n\n\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  } // at this point x and y should be finite\n\n\n  if (x.isFinite() && y.isFinite()) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = x.minus(y).abs();\n\n    if (diff.isZero()) {\n      return true;\n    } else {\n      // use relative error\n      var max = x.constructor.max(x.abs(), y.abs());\n      return diff.lte(max.times(epsilon));\n    }\n  } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n  return false;\n};","'use strict';\n/*\n * Special Cases:\n *   n >> -n =  N\n *   n >>  N =  N\n *   N >>  n =  N\n *   I >>  I =  N\n *   n >>  0 =  n\n *   I >>  n =  I\n *  -I >>  n = -I\n *  -I >>  I = -I\n *   n >>  I =  I\n *  -n >>  I = -1\n *   0 >>  n =  0\n *\n * @param {BigNumber} value\n * @param {BigNumber} value\n * @return {BigNumber} Result of `x` >> `y`\n *\n */\n\nmodule.exports = function rightArithShift(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function rightArithShift');\n  }\n\n  var BigNumber = x.constructor;\n\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n\n  if (!y.isFinite()) {\n    if (x.isNegative()) {\n      return new BigNumber(-1);\n    }\n\n    if (!x.isFinite()) {\n      return new BigNumber(NaN);\n    }\n\n    return new BigNumber(0);\n  } // Math.pow(2, y) is fully precise for y < 55, and fast\n\n\n  if (y.lt(55)) {\n    return x.div(Math.pow(2, y.toNumber()) + '').floor();\n  }\n\n  return x.div(new BigNumber(2).pow(y)).floor();\n};","'use strict';\n/**\n * Test whether value is a boolean\n * @param {*} value\n * @return {boolean} isBoolean\n */\n\nexports.isBoolean = function (value) {\n  return typeof value === 'boolean';\n};","'use strict';\n\nvar isCollection = require('./isCollection');\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n *                    collections (Arrays or Matrices). Returns false otherwise.\n */\n\n\nmodule.exports = function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n\n  return false;\n};","'use strict';\n\nvar isMatrix = require('./isMatrix');\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback     The callback method is invoked with one\n *                                parameter: the current element in the array\n */\n\n\nmodule.exports = function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array = array.valueOf();\n  }\n\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\n    }\n  }\n};","'use strict';\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback   The callback is called with two parameters:\n *                              value1 and value2, which contain the current\n *                              element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\n\nmodule.exports = function deepMap(array, callback, skipZeros) {\n  if (array && typeof array.map === 'function') {\n    // TODO: replace array.map with a for loop to improve performance\n    return array.map(function (x) {\n      return deepMap(x, callback, skipZeros);\n    });\n  } else {\n    return callback(array);\n  }\n};","'use strict';\n\nvar isMatrix = require('./isMatrix');\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\n\n\nmodule.exports = function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n};","'use strict';\n/**\n * Test whether a value is a Matrix\n * @param {*} x\n * @returns {boolean} returns true with input is a Matrix\n *                    (like a DenseMatrix or SparseMatrix)\n */\n\nmodule.exports = function isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix || false;\n};","'use strict';\n\nvar arraySize = require('../array').size;\n\nvar isMatrix = require('../collection/isMatrix');\n\nvar IndexError = require('../../error/IndexError');\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\n\n\nmodule.exports = function (mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n\n  if (dim < 0 || dim >= size.length) {\n    // TODO: would be more clear when throwing a DimensionError here\n    throw new IndexError(dim, size.length);\n  }\n\n  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback));\n  } else {\n    return _reduce(mat, dim, callback);\n  }\n};\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n\n      return ret;\n    }\n  } else {\n    ret = [];\n\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n\n    return ret;\n  }\n}\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\n\n\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n\n    ret.push(tmp);\n  }\n\n  return ret;\n}","'use strict';\n\nmodule.exports = function scatter(a, j, w, x, u, mark, c, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr; // c arrays\n\n  var cindex = c._index; // vars\n\n  var k, k0, k1, i; // check we need to process values (pattern matrix)\n\n  if (x) {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k]; // check value exists in current j\n\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark; // add i to pattern of C\n\n        cindex.push(i); // x(i) = A, check we need to call function this time\n\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]); // function was called on current row\n\n          u[i] = mark;\n        } else {\n          // copy value to workspace\n          x[i] = avalues[k];\n        }\n      } else {\n        // i exists in C already\n        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]); // function was called on current row\n\n        u[i] = mark;\n      }\n    }\n  } else {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k]; // check value exists in current j\n\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark; // add i to pattern of C\n\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n};","'use strict';\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\nvar hasOwnProperty = require('./object').hasOwnProperty;\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\n\n\nfunction getSafeProperty(object, prop) {\n  // only allow getting safe properties of a plain object\n  if (isPlainObject(object) && isSafeProperty(object, prop)) {\n    return object[prop];\n  }\n\n  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property');\n  }\n\n  throw new Error('No access to property \"' + prop + '\"');\n}\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\n\n\nfunction setSafeProperty(object, prop, value) {\n  // only allow setting safe properties of a plain object\n  if (isPlainObject(object) && isSafeProperty(object, prop)) {\n    object[prop] = value;\n    return value;\n  }\n\n  throw new Error('No access to property \"' + prop + '\"');\n}\n/**\n * Test whether a property is safe to use for an object.\n * For example .toString and .constructor are not safe\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\n\n\nfunction isSafeProperty(object, prop) {\n  if (!object || _typeof(object) !== 'object') {\n    return false;\n  } // SAFE: whitelisted\n  // e.g length\n\n\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  } // UNSAFE: inherited from Object prototype\n  // e.g constructor\n\n\n  if (prop in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  } // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n\n\n  if (prop in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n\n  return true;\n}\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n */\n// TODO: merge this function into assign.js?\n\n\nfunction validateSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\n}\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\n\n\nfunction isSafeMethod(object, method) {\n  if (!object || typeof object[method] !== 'function') {\n    return false;\n  } // UNSAFE: ghosted\n  // e.g overridden toString\n  // Note that IE10 doesn't support __proto__ and we can't do this check there.\n\n\n  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  } // SAFE: whitelisted\n  // e.g toString\n\n\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  } // UNSAFE: inherited from Object prototype\n  // e.g constructor\n\n\n  if (method in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  } // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n\n\n  if (method in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n\n  return true;\n}\n\nfunction isPlainObject(object) {\n  return _typeof(object) === 'object' && object && object.constructor === Object;\n}\n\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};\nexports.getSafeProperty = getSafeProperty;\nexports.setSafeProperty = setSafeProperty;\nexports.isSafeProperty = isSafeProperty;\nexports.validateSafeMethod = validateSafeMethod;\nexports.isSafeMethod = isSafeMethod;\nexports.isPlainObject = isPlainObject;","'use strict';\n\nvar Emitter = require('tiny-emitter');\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\n\n\nexports.mixin = function (obj) {\n  // create event emitter\n  var emitter = new Emitter(); // bind methods to obj (we don't want to expose the emitter.e Array...)\n\n  obj.on = emitter.on.bind(emitter);\n  obj.off = emitter.off.bind(emitter);\n  obj.once = emitter.once.bind(emitter);\n  obj.emit = emitter.emit.bind(emitter);\n  return obj;\n};","'use strict'; // function utils\n\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn                     The function to be memoized.\n *                                          Must be a pure function.\n * @param {function(args: Array)} [hasher]  A custom hash builder.\n *                                          Is JSON.stringify by default.\n * @return {function}                       Returns the memoized function\n */\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\nexports.memoize = function (fn, hasher) {\n  return function memoize() {\n    if (_typeof(memoize.cache) !== 'object') {\n      memoize.cache = {};\n    }\n\n    var args = [];\n\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n\n    var hash = hasher ? hasher(args) : JSON.stringify(args);\n\n    if (!(hash in memoize.cache)) {\n      memoize.cache[hash] = fn.apply(fn, args);\n    }\n\n    return memoize.cache[hash];\n  };\n};\n/**\n * Find the maximum number of arguments expected by a typed function.\n * @param {function} fn   A typed function\n * @return {number} Returns the maximum number of expected arguments.\n *                  Returns -1 when no signatures where found on the function.\n */\n\n\nexports.maxArgumentCount = function (fn) {\n  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n    var count = (signature.match(/,/g) || []).length + 1;\n    return Math.max(args, count);\n  }, -1);\n};\n/**\n * Call a typed function with the\n * @param {function} fn   A function or typed function\n * @return {number} Returns the maximum number of expected arguments.\n *                  Returns -1 when no signatures where found on the function.\n */\n\n\nexports.callWithRightArgumentCount = function (fn, args, argCount) {\n  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n    var count = (signature.match(/,/g) || []).length + 1;\n    return Math.max(args, count);\n  }, -1);\n};","'use strict';\n\nexports.array = require('./array');\nexports['boolean'] = require('./boolean');\nexports['function'] = require('./function');\nexports.number = require('./number');\nexports.object = require('./object');\nexports.string = require('./string');\nexports.emitter = require('./emitter');","'use strict';\n\nvar escapeLatex = require('escape-latex');\n\nexports.symbols = {\n  // GREEK LETTERS\n  Alpha: 'A',\n  alpha: '\\\\alpha',\n  Beta: 'B',\n  beta: '\\\\beta',\n  Gamma: '\\\\Gamma',\n  gamma: '\\\\gamma',\n  Delta: '\\\\Delta',\n  delta: '\\\\delta',\n  Epsilon: 'E',\n  epsilon: '\\\\epsilon',\n  varepsilon: '\\\\varepsilon',\n  Zeta: 'Z',\n  zeta: '\\\\zeta',\n  Eta: 'H',\n  eta: '\\\\eta',\n  Theta: '\\\\Theta',\n  theta: '\\\\theta',\n  vartheta: '\\\\vartheta',\n  Iota: 'I',\n  iota: '\\\\iota',\n  Kappa: 'K',\n  kappa: '\\\\kappa',\n  varkappa: '\\\\varkappa',\n  Lambda: '\\\\Lambda',\n  lambda: '\\\\lambda',\n  Mu: 'M',\n  mu: '\\\\mu',\n  Nu: 'N',\n  nu: '\\\\nu',\n  Xi: '\\\\Xi',\n  xi: '\\\\xi',\n  Omicron: 'O',\n  omicron: 'o',\n  Pi: '\\\\Pi',\n  pi: '\\\\pi',\n  varpi: '\\\\varpi',\n  Rho: 'P',\n  rho: '\\\\rho',\n  varrho: '\\\\varrho',\n  Sigma: '\\\\Sigma',\n  sigma: '\\\\sigma',\n  varsigma: '\\\\varsigma',\n  Tau: 'T',\n  tau: '\\\\tau',\n  Upsilon: \"\\\\Upsilon\",\n  upsilon: \"\\\\upsilon\",\n  Phi: '\\\\Phi',\n  phi: '\\\\phi',\n  varphi: '\\\\varphi',\n  Chi: 'X',\n  chi: '\\\\chi',\n  Psi: '\\\\Psi',\n  psi: '\\\\psi',\n  Omega: '\\\\Omega',\n  omega: '\\\\omega',\n  // logic\n  'true': '\\\\mathrm{True}',\n  'false': '\\\\mathrm{False}',\n  // other\n  i: 'i',\n  // TODO use \\i ??\n  inf: '\\\\infty',\n  Inf: '\\\\infty',\n  infinity: '\\\\infty',\n  Infinity: '\\\\infty',\n  oo: '\\\\infty',\n  lim: '\\\\lim',\n  'undefined': '\\\\mathbf{?}'\n};\nexports.operators = {\n  'transpose': '^\\\\top',\n  'ctranspose': '^H',\n  'factorial': '!',\n  'pow': '^',\n  'dotPow': '.^\\\\wedge',\n  // TODO find ideal solution\n  'unaryPlus': '+',\n  'unaryMinus': '-',\n  'bitNot': '\\\\~',\n  // TODO find ideal solution\n  'not': '\\\\neg',\n  'multiply': '\\\\cdot',\n  'divide': '\\\\frac',\n  // TODO how to handle that properly?\n  'dotMultiply': '.\\\\cdot',\n  // TODO find ideal solution\n  'dotDivide': '.:',\n  // TODO find ideal solution\n  'mod': '\\\\mod',\n  'add': '+',\n  'subtract': '-',\n  'to': '\\\\rightarrow',\n  'leftShift': '<<',\n  'rightArithShift': '>>',\n  'rightLogShift': '>>>',\n  'equal': '=',\n  'unequal': '\\\\neq',\n  'smaller': '<',\n  'larger': '>',\n  'smallerEq': '\\\\leq',\n  'largerEq': '\\\\geq',\n  'bitAnd': '\\\\&',\n  'bitXor': \"\\\\underline{|}\",\n  'bitOr': '|',\n  'and': '\\\\wedge',\n  'xor': '\\\\veebar',\n  'or': '\\\\vee'\n};\nexports.defaultTemplate = \"\\\\mathrm{${name}}\\\\left(${args}\\\\right)\";\nvar units = {\n  deg: '^\\\\circ'\n};\n\nexports.escape = function (string) {\n  return escapeLatex(string, {\n    'preserveFormatting': true\n  });\n}; // @param {string} name\n// @param {boolean} isUnit\n\n\nexports.toSymbol = function (name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n\n  if (isUnit) {\n    if (units.hasOwnProperty(name)) {\n      return units[name];\n    }\n\n    return '\\\\mathrm{' + exports.escape(name) + '}';\n  }\n\n  if (exports.symbols.hasOwnProperty(name)) {\n    return exports.symbols[name];\n  }\n\n  return exports.escape(name);\n};","'use strict';\n\nvar objectUtils = require('./object');\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Test whether value is a number\n * @param {*} value\n * @return {boolean} isNumber\n */\n\n\nexports.isNumber = function (value) {\n  return typeof value === 'number';\n};\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\n\n\nexports.isInteger = function (value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n\n  return isFinite(value) ? value === Math.round(value) : false; // Note: we use ==, not ===, as we can have Booleans as well\n};\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {*}\n */\n\n\nexports.sign = Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'engineering'    Always use engineering notation.\n *                                          For example '123.4e+0' and '14.0e+6'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lowerExp` and `upperExp` bounds, and\n *                                          uses exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default,\n *                                          not rounding any digits.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12.071, {notation: 'fixed'})                // '12'\n *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'\n *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'\n *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\n\n\nexports.format = function (value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  } // handle special cases\n\n\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  } // default values for options\n\n\n  var notation = 'auto';\n  var precision;\n\n  if (options) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    } // determine precision from options\n\n\n    if (exports.isNumber(options)) {\n      precision = options;\n    } else if (exports.isNumber(options.precision)) {\n      precision = options.precision;\n    }\n  } // handle the various notations\n\n\n  switch (notation) {\n    case 'fixed':\n      return exports.toFixed(value, precision);\n\n    case 'exponential':\n      return exports.toExponential(value, precision);\n\n    case 'engineering':\n      return exports.toEngineering(value, precision);\n\n    case 'auto':\n      // TODO: clean up some day. Deprecated since: 2018-01-24\n      // @deprecated upper and lower are replaced with upperExp and lowerExp since v4.0.0\n      if (options && options.exponential && (options.exponential.lower !== undefined || options.exponential.upper !== undefined)) {\n        var fixedOptions = objectUtils.map(options, function (x) {\n          return x;\n        });\n        fixedOptions.exponential = undefined;\n\n        if (options.exponential.lower !== undefined) {\n          fixedOptions.lowerExp = Math.round(Math.log(options.exponential.lower) / Math.LN10);\n        }\n\n        if (options.exponential.upper !== undefined) {\n          fixedOptions.upperExp = Math.round(Math.log(options.exponential.upper) / Math.LN10);\n        }\n\n        console.warn('Deprecation warning: Formatting options exponential.lower and exponential.upper ' + '(minimum and maximum value) ' + 'are replaced with exponential.lowerExp and exponential.upperExp ' + '(minimum and maximum exponent) since version 4.0.0. ' + 'Replace ' + JSON.stringify(options) + ' with ' + JSON.stringify(fixedOptions));\n        return exports.toPrecision(value, precision, fixedOptions);\n      }\n\n      return exports.toPrecision(value, precision, options && options) // remove trailing zeros after the decimal point\n      .replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", or \"fixed\".');\n  }\n};\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n */\n\n\nexports.splitNumber = function (value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^0*?(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\n  }\n\n  var sign = match[1];\n  var digits = match[2];\n  var exponent = parseFloat(match[4] || '0');\n  var dot = digits.indexOf('.');\n  exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n  .replace(/^0*/, function (zeros) {\n    // remove leading zeros, add their count to the exponent\n    exponent -= zeros.length;\n    return '';\n  }).replace(/0*$/, '') // remove trailing zeros\n  .split('').map(function (d) {\n    return parseInt(d);\n  });\n\n  if (coefficients.length === 0) {\n    coefficients.push(0);\n    exponent++;\n  }\n\n  return {\n    sign: sign,\n    coefficients: coefficients,\n    exponent: exponent\n  };\n};\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\n\n\nexports.toEngineering = function (value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  var rounded = exports.roundDigits(exports.splitNumber(value), precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients; // find nearest lower multiple of 3 for exponent\n\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n  if (exports.isNumber(precision)) {\n    // add zeroes to give correct sig figs\n    if (precision > c.length) c = c.concat(zeros(precision - c.length));\n  } else {\n    // concatenate coefficients with necessary zeros\n    var significandsDiff = e >= 0 ? e : Math.abs(newExp); // add zeros if necessary (for ex: 1e+8)\n\n    if (c.length - 1 < significandsDiff) c = c.concat(zeros(significandsDiff - (c.length - 1)));\n  } // find difference in exponents\n\n\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1; // push decimal index over by expDiff times\n\n  while (--expDiff >= 0) {\n    decimalIdx++;\n  } // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n  // otherwise concat with the rest of the coefficients\n\n\n  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = exports.isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n  return rounded.sign + str;\n};\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined]  Optional number of decimals after the\n *                                        decimal point. null by default.\n */\n\n\nexports.toFixed = function (value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  var splitValue = exports.splitNumber(value);\n  var rounded = typeof precision === 'number' ? exports.roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n  // append zeros if needed\n\n  var pp = p + (precision || 0);\n\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  } // prepend zeros if needed\n\n\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  } // insert a dot if needed\n\n\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n\n  return rounded.sign + c.join('');\n};\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n */\n\n\nexports.toExponential = function (value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  } // round if needed, else create a clone\n\n\n  var split = exports.splitNumber(value);\n  var rounded = precision ? exports.roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent; // append zeros if needed\n\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  } // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n\n\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n};\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n *                                       By default:\n *                                         lowerExp = -3 (incl)\n *                                         upper = +5 (excl)\n * @return {string}\n */\n\n\nexports.toPrecision = function (value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  } // determine lower and upper bound for exponential notation.\n\n\n  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n  var split = exports.splitNumber(value);\n\n  if (split.exponent < lowerExp || split.exponent >= upperExp) {\n    // exponential notation\n    return exports.toExponential(value, precision);\n  } else {\n    var rounded = precision ? exports.roundDigits(split, precision) : split;\n    var c = rounded.coefficients;\n    var e = rounded.exponent; // append trailing zeros\n\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    } // append trailing zeros\n    // TODO: simplify the next statement\n\n\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0))); // prepend zeros\n\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n\n    return rounded.sign + c.join('');\n  }\n};\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split       A value split with .splitNumber(value)\n * @param {number} precision  A positive integer\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n *              with rounded digits\n */\n\n\nexports.roundDigits = function (split, precision) {\n  // create a clone\n  var rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  };\n  var c = rounded.coefficients; // prepend zeros if needed\n\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n\n      while (c[i] === 10) {\n        c.pop();\n\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n\n        i--;\n        c[i]++;\n      }\n    }\n  }\n\n  return rounded;\n};\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\n\n\nfunction zeros(length) {\n  var arr = [];\n\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n\n  return arr;\n}\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n *   2.34 returns 3\n *   0.0034 returns 2\n *   120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits   Number of significant digits\n */\n\n\nexports.digits = function (value) {\n  return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n  .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n  .length;\n};\n/**\n * Minimum number added to one that makes the result different than one\n */\n\n\nexports.DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\n/**\n * Compares two floating point numbers.\n * @param {number} x          First value to compare\n * @param {number} y          Second value to compare\n * @param {number} [epsilon]  The maximum relative difference between x and y\n *                            If epsilon is undefined or null, the function will\n *                            test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n*/\n\nexports.nearlyEqual = function (x, y, epsilon) {\n  // if epsilon is null or undefined, test whether x and y are exactly equal\n  if (epsilon === null || epsilon === undefined) {\n    return x === y;\n  }\n\n  if (x === y) {\n    return true;\n  } // NaN\n\n\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  } // at this point x and y should be finite\n\n\n  if (isFinite(x) && isFinite(y)) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = Math.abs(x - y);\n\n    if (diff < exports.DBL_EPSILON) {\n      return true;\n    } else {\n      // use relative error\n      return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;\n    }\n  } // Infinite and Number or negative Infinite and positive Infinite cases\n\n\n  return false;\n};","'use strict';\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\nvar isBigNumber = require('./bignumber/isBigNumber');\n/**\n * Clone an object\n *\n *     clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\n\n\nexports.clone = function clone(x) {\n  var type = _typeof(x); // immutable primitive types\n\n\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  } // use clone function of the object when available\n\n\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  } // array\n\n\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value);\n    });\n  }\n\n  if (x instanceof Date) return new Date(x.valueOf());\n  if (isBigNumber(x)) return x; // bignumbers are immutable\n\n  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp\n  // object\n\n  return exports.map(x, clone);\n};\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\n\n\nexports.map = function (object, callback) {\n  var clone = {};\n\n  for (var key in object) {\n    if (exports.hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n\n  return clone;\n};\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\n\n\nexports.extend = function (a, b) {\n  for (var prop in b) {\n    if (exports.hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n\n  return a;\n};\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\n\n\nexports.deepExtend = function deepExtend(a, b) {\n  // TODO: add support for Arrays to deepExtend\n  if (Array.isArray(b)) {\n    throw new TypeError('Arrays are not supported by deepExtend');\n  }\n\n  for (var prop in b) {\n    if (exports.hasOwnProperty(b, prop)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n\n        if (a[prop].constructor === Object) {\n          deepExtend(a[prop], b[prop]);\n        } else {\n          a[prop] = b[prop];\n        }\n      } else if (Array.isArray(b[prop])) {\n        throw new TypeError('Arrays are not supported by deepExtend');\n      } else {\n        a[prop] = b[prop];\n      }\n    }\n  }\n\n  return a;\n};\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\n\n\nexports.deepEqual = function deepEqual(a, b) {\n  var prop, i, len;\n\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n\n    if (a.length !== b.length) {\n      return false;\n    }\n\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!exports.deepEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n\n    return true;\n  } else if (a instanceof Object) {\n    if (Array.isArray(b) || !(b instanceof Object)) {\n      return false;\n    }\n\n    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!exports.deepEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!exports.deepEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n\n    return true;\n  } else {\n    return a === b;\n  }\n};\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\n\n\nexports.canDefineProperty = function () {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {}\n      });\n      return true;\n    }\n  } catch (e) {}\n\n  return false;\n};\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n * On older browsers (<IE8), the function will fall back to direct evaluation\n * of the properties value.\n * @param {Object} object   Object where to add the property\n * @param {string} prop     Property name\n * @param {Function} fn     Function returning the property value. Called\n *                          without arguments.\n */\n\n\nexports.lazy = function (object, prop, fn) {\n  if (exports.canDefineProperty()) {\n    var _uninitialized = true;\n\n    var _value;\n\n    Object.defineProperty(object, prop, {\n      get: function get() {\n        if (_uninitialized) {\n          _value = fn();\n          _uninitialized = false;\n        }\n\n        return _value;\n      },\n      set: function set(value) {\n        _value = value;\n        _uninitialized = false;\n      },\n      configurable: true,\n      enumerable: true\n    });\n  } else {\n    // fall back to immediate evaluation\n    object[prop] = fn();\n  }\n};\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string} path   A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\n\n\nexports.traverse = function (object, path) {\n  var obj = object;\n\n  if (path) {\n    var names = path.split('.');\n\n    for (var i = 0; i < names.length; i++) {\n      var name = names[i];\n\n      if (!(name in obj)) {\n        obj[name] = {};\n      }\n\n      obj = obj[name];\n    }\n  }\n\n  return obj;\n};\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\n\n\nexports.hasOwnProperty = function (object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\n};\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)\n * - name: string (optional)\n * - path: string    A dot separated path (optional)\n * - math: boolean   If true (false by default), the math namespace is passed\n *                   as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\n\n\nexports.isFactory = function (object) {\n  return object && typeof object.factory === 'function';\n};","\"use strict\";\n\n// TODO: remove these polyfills as soon as we have a build process that transpiles the code to ES5\n// Polyfill for IE 11 (Number.isFinite is used in `complex.js`)\n// source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isFinite\nNumber.isFinite = Number.isFinite || function (value) {\n  return typeof value === 'number' && isFinite(value);\n}; // Polyfill for IE 11\n// source: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/isNaN\n\n\nNumber.isNaN = Number.isNaN || function (value) {\n  return value !== value; // eslint-disable-line no-self-compare\n};","'use strict';\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\nvar formatNumber = require('./number').format;\n\nvar formatBigNumber = require('./bignumber/formatter').format;\n\nvar isBigNumber = require('./bignumber/isBigNumber');\n/**\n * Test whether value is a string\n * @param {*} value\n * @return {boolean} isString\n */\n\n\nexports.isString = function (value) {\n  return typeof value === 'string';\n};\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\n\n\nexports.endsWith = function (text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n};\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n *   syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n *   function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n *   and the result is returned.\n * - In other cases the function will loop over all object properties and\n *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n *     math.format(2/7)                // '0.2857142857142857'\n *     math.format(math.pi, 3)         // '3.14'\n *     math.format(new Complex(2, 3))  // '2 + 3i'\n *     math.format('hello')            // '\"hello\"'\n *\n * @param {*} value             Value to be stringified\n * @param {Object | number | Function} [options]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @return {string} str\n */\n\n\nexports.format = function (value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options);\n  }\n\n  if (isBigNumber(value)) {\n    return formatBigNumber(value, options);\n  } // note: we use unsafe duck-typing here to check for Fractions, this is\n  // ok here since we're only invoking toString or concatenating its values\n\n\n  if (looksLikeFraction(value)) {\n    if (!options || options.fraction !== 'decimal') {\n      // output as ratio, like '1/3'\n      return value.s * value.n + '/' + value.d;\n    } else {\n      // output as decimal, like '0.(3)'\n      return value.toString();\n    }\n  }\n\n  if (Array.isArray(value)) {\n    return formatArray(value, options);\n  }\n\n  if (exports.isString(value)) {\n    return '\"' + value + '\"';\n  }\n\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\n  }\n\n  if (value && _typeof(value) === 'object') {\n    if (typeof value.format === 'function') {\n      return value.format(options);\n    } else if (value && value.toString() !== {}.toString()) {\n      // this object has a non-native toString method, use that one\n      return value.toString();\n    } else {\n      var entries = [];\n\n      for (var key in value) {\n        if (value.hasOwnProperty(key)) {\n          entries.push('\"' + key + '\": ' + exports.format(value[key], options));\n        }\n      }\n\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n\n  return String(value);\n};\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\n\n\nexports.stringify = function (value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n\n  while (i < text.length) {\n    var c = text.charAt(i);\n\n    if (c === '\\\\') {\n      escaped += c;\n      i++;\n      c = text.charAt(i);\n\n      if (c === '' || '\"\\\\/bfnrtu'.indexOf(c) === -1) {\n        escaped += '\\\\'; // no valid escape character -> escape it\n      }\n\n      escaped += c;\n    } else if (c === '\"') {\n      escaped += '\\\\\"';\n    } else {\n      escaped += c;\n    }\n\n    i++;\n  }\n\n  return '\"' + escaped + '\"';\n};\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\n\n\nexports.escape = function (value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n};\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @returns {string} str\n */\n\n\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n\n      str += formatArray(array[i], options);\n    }\n\n    str += ']';\n    return str;\n  } else {\n    return exports.format(array, options);\n  }\n}\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\n\n\nfunction looksLikeFraction(value) {\n  return value && _typeof(value) === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}","import {Utils, log} from \"sd-utils\";\nimport {DataModel} from \"sd-model\";\nimport {ComputationsManager} from \"./computations-manager\";\nimport {ComputationsManagerConfig} from \"./computations-manager\";\n\n\n\nexport class ComputationsEngineConfig extends ComputationsManagerConfig{\n    logLevel = 'warn';\n    constructor(custom) {\n        super();\n        if (custom) {\n            Utils.deepExtend(this, custom);\n        }\n    }\n}\n\n/**\n * Entry point class for standalone computation workers\n */\nexport class ComputationsEngine extends ComputationsManager{\n\n    global = Utils.getGlobalObject();\n    isWorker = Utils.isWorker();\n\n    constructor(config, data){\n        super(config, data);\n\n        if(this.isWorker) {\n            this.jobsManger.registerJobExecutionListener({\n                beforeJob: (jobExecution)=>{\n                    this.reply('beforeJob', jobExecution.getDTO());\n                },\n\n                afterJob: (jobExecution)=>{\n                    this.reply('afterJob', jobExecution.getDTO());\n                }\n            });\n\n            var instance = this;\n            this.queryableFunctions = {\n                runJob: function(jobName, jobParametersValues, dataDTO){\n                    // console.log(jobName, jobParameters, serializedData);\n                    var data = new DataModel(dataDTO);\n                    instance.runJob(jobName, jobParametersValues, data);\n                },\n                executeJob: function(jobExecutionId){\n                    instance.jobsManger.execute(jobExecutionId).catch(e=>{\n                        instance.reply('jobFatalError', jobExecutionId, Utils.getErrorDTO(e));\n                    })\n                },\n                recompute: function(dataDTO, ruleName, evalCode, evalNumeric){\n                    if(ruleName){\n                        instance.objectiveRulesManager.setCurrentRuleByName(ruleName);\n                    }\n                    var allRules = !ruleName;\n                    var data = new DataModel(dataDTO);\n                    instance._checkValidityAndRecomputeObjective(data, allRules, evalCode, evalNumeric)\n                    this.reply('recomputed', data.getDTO());\n                }\n            };\n\n            global.onmessage = function(oEvent) {\n                if (oEvent.data instanceof Object && oEvent.data.hasOwnProperty('queryMethod') && oEvent.data.hasOwnProperty('queryArguments')) {\n                    instance.queryableFunctions[oEvent.data.queryMethod].apply(self, oEvent.data.queryArguments);\n                } else {\n                    instance.defaultReply(oEvent.data);\n                }\n            };\n        }\n    }\n\n\n\n    setConfig(config) {\n        super.setConfig(config);\n        if(this.config.logLevel){\n            this.setLogLevel(this.config.logLevel);\n        }\n\n        return this;\n    }\n\n    setLogLevel(level){\n        log.setLevel(level)\n    }\n\n    defaultReply(message) {\n        this.reply('test', message);\n    }\n\n    reply() {\n        if (arguments.length < 1) {\n            throw new TypeError('reply - not enough arguments');\n        }\n        this.global.postMessage({\n            'queryMethodListener': arguments[0],\n            'queryMethodArguments': Array.prototype.slice.call(arguments, 1)\n        });\n    }\n}\n\n","import {ExpressionEngine} from \"sd-expression-engine\";\nimport {Utils} from \"sd-utils\";\nimport {ObjectiveRulesManager} from \"./objective/objective-rules-manager\";\nimport {TreeValidator} from \"./validation/tree-validator\";\nimport {OperationsManager} from \"./operations/operations-manager\";\nimport {JobsManager} from \"./jobs/jobs-manager\";\nimport {ExpressionsEvaluator} from \"./expressions-evaluator\";\nimport {JobInstanceManager} from \"./jobs/job-instance-manager\";\nimport {domain as model} from \"sd-model\";\nimport {Policy} from \"./policies/policy\";\nimport {McdmWeightValueValidator} from \"./validation/mcdm-weight-value-validator\";\n\n/** Computation manager configuration object\n * @param custom configuration object to extend\n */\nexport class ComputationsManagerConfig {\n\n    /**\n     * logging level\n     * */\n    logLevel = null;\n\n    /**\n     * default objective rule name\n     * */\n    ruleName = null;\n\n    /**\n     * worker configuration object\n     * */\n    worker = {\n        /**\n         * delegate tree recomputation to worker\n         * */\n        delegateRecomputation: false,\n\n        /**\n         * worker url\n         * */\n        url: null\n    };\n\n    /**\n     * job repository to use, available types: idb, timeout, simple\n    * */\n    jobRepositoryType = 'idb';\n\n    /**\n     * clear repository after init\n     * */\n    clearRepository = false;\n\n    constructor(custom) {\n        if (custom) {\n            Utils.deepExtend(this, custom);\n        }\n    }\n}\n\n/** Computation manager\n* @param {object} config\n* @param {DataModel} data model object\n* */\nexport class ComputationsManager {\n\n    data;\n    expressionEngine;\n    expressionsEvaluator;\n    objectiveRulesManager;\n    operationsManager;\n    jobsManger;\n\n    treeValidator;\n\n    constructor(config, data = null) {\n        this.data = data;\n        this.setConfig(config);\n        this.expressionEngine = new ExpressionEngine();\n        this.expressionsEvaluator = new ExpressionsEvaluator(this.expressionEngine);\n        this.objectiveRulesManager = new ObjectiveRulesManager(this.expressionEngine, this.config.ruleName);\n        this.operationsManager = new OperationsManager(this.data, this.expressionEngine);\n        this.jobsManger = new JobsManager(this.expressionsEvaluator, this.objectiveRulesManager, {\n            workerUrl: this.config.worker.url,\n            repositoryType: this.config.jobRepositoryType,\n            clearRepository: this.config.clearRepository\n        });\n        this.treeValidator = new TreeValidator(this.expressionEngine);\n        this.mcdmWeightValueValidator = new McdmWeightValueValidator();\n    }\n\n    setConfig(config) {\n        this.config = new ComputationsManagerConfig(config);\n        return this;\n    }\n\n    setData(data){\n        this.data = data;\n        this.operationsManager.setData(data);\n    }\n\n\n    /** Alias function for checkValidityAndRecomputeObjective*/\n    recompute(){\n        return this.checkValidityAndRecomputeObjective(...arguments);\n    }\n\n    /**\n     * Checks validity of data model and recomputes objective rules\n     * @returns promise\n     * @param {boolean} allRules - recompute all objective rules\n     * @param {boolean} evalCode - evaluate code\n     * @param {boolean} evalNumeric - evaluate numeric expressions\n     */\n    checkValidityAndRecomputeObjective(allRules, evalCode = false, evalNumeric = true) {\n        return Promise.resolve().then(()=> {\n            if (this.config.worker.delegateRecomputation) {\n                var params = {\n                    evalCode: evalCode,\n                    evalNumeric: evalNumeric\n                };\n                if (!allRules) {\n                    params.ruleName = this.getCurrentRule().name;\n                }\n                return this.runJob(\"recompute\", params, this.data, false).then((jobExecution)=> {\n                    var d = jobExecution.getData();\n                    this.data.updateFrom(d)\n                })\n            }\n            return this._checkValidityAndRecomputeObjective(this.data, allRules, evalCode, evalNumeric);\n        }).then(()=> {\n            this.updateDisplayValues(this.data);\n        })\n\n    }\n\n    _checkValidityAndRecomputeObjective(data, allRules, evalCode = false, evalNumeric = true) {\n\n        this.objectiveRulesManager.updateDefaultCriterion1Weight(data.defaultCriterion1Weight);\n        data.validationResults = [];\n\n        if (evalCode || evalNumeric) {\n            this.expressionsEvaluator.evalExpressions(data, evalCode, evalNumeric);\n        }\n\n        var weightValid = this.mcdmWeightValueValidator.validate(data.defaultCriterion1Weight);\n        var multiCriteria = this.getCurrentRule().multiCriteria;\n\n\n        data.getRoots().forEach(root=> {\n            var vr = this.treeValidator.validate(data.getAllNodesInSubtree(root));\n            data.validationResults.push(vr);\n            if (vr.isValid() && (!multiCriteria || weightValid)) {\n                this.objectiveRulesManager.recomputeTree(root, allRules);\n            }\n        });\n    }\n\n    /**\n     * @returns {ObjectiveRule} current objective rule\n     * */\n    getCurrentRule() {\n        return this.objectiveRulesManager.currentRule;\n    }\n\n    /**\n     * Sets current objective rule\n     * @param {string} ruleName - name of objective rule\n     * */\n    setCurrentRuleByName(ruleName) {\n        this.config.ruleName = ruleName;\n        return this.objectiveRulesManager.setCurrentRuleByName(ruleName)\n    }\n\n    /**\n     *\n     *  @param {string} jobName\n     *  @returns {Job}\n     * */\n    getJobByName(jobName) {\n        return this.jobsManger.getJobByName(jobName);\n    }\n\n    /**\n     * @returns array of operations applicable to the given object (node or edge)\n     * @param object\n     */\n    operationsForObject(object) {\n        return this.operationsManager.operationsForObject(object);\n    }\n\n\n    /**\n     * Checks validity of data model without recomputation and revalidation\n     * @param {DataModel} data to check\n     */\n\n    isValid(data) {\n        var data = data || this.data;\n        return data.validationResults.every(vr=>vr.isValid());\n    }\n    /**\n     * Run job\n     * @param {string} name - job name\n     * @param {object} jobParamsValues - job parameter values object\n     * @param {DataModel} data model\n     * @param {boolean} resolvePromiseAfterJobIsLaunched - immediately resolve promise with still running JobExecution\n     * @returns {Promise} resolving to JobExecution\n     */\n    runJob(name, jobParamsValues, data, resolvePromiseAfterJobIsLaunched = true) {\n        return this.jobsManger.run(name, jobParamsValues, data || this.data, resolvePromiseAfterJobIsLaunched)\n    }\n\n    /**\n     * Run job using JobInstanceManager\n     * @param {string} name - job name\n     * @param {object} jobParamsValues - job parameter values object\n     * @param {JobInstanceManagerConfig} jobInstanceManagerConfig - JobInstanceManager configuration\n     * @returns {Promise} resolving to JobInstanceManager\n     */\n    runJobWithInstanceManager(name, jobParamsValues, jobInstanceManagerConfig) {\n        return this.runJob(name, jobParamsValues).then(je=> {\n            return new JobInstanceManager(this.jobsManger, je, jobInstanceManagerConfig);\n        })\n    }\n\n    getObjectiveRules() {\n        return this.objectiveRulesManager.rules;\n    }\n\n    getObjectiveRuleByName(ruleName){\n        return this.objectiveRulesManager.getObjectiveRuleByName(ruleName)\n    }\n\n    isRuleName(ruleName) {\n        return this.objectiveRulesManager.isRuleName(ruleName)\n    }\n\n\n    flipCriteria(data){\n        data = data || this.data;\n        data.reversePayoffs();\n        let tmp = data.weightLowerBound;\n        data.weightLowerBound = this.flip(data.weightUpperBound);\n        data.weightUpperBound = this.flip(tmp);\n        data.defaultCriterion1Weight = this.flip(data.defaultCriterion1Weight);\n        this.objectiveRulesManager.flipRule();\n        return this.checkValidityAndRecomputeObjective(false);\n    }\n\n    flip(a){\n        if(a == Infinity){\n            return 0;\n        }\n\n        if(a == 0){\n            return Infinity;\n        }\n\n        return this.expressionEngine.serialize(ExpressionEngine.divide(1, a))\n    }\n\n    updateDisplayValues(data, policyToDisplay = null) {\n        data = data || this.data;\n        if (policyToDisplay) {\n            return this.displayPolicy(data, policyToDisplay);\n        }\n\n        data.nodes.forEach(n=> {\n            this.updateNodeDisplayValues(n);\n        });\n        data.edges.forEach(e=> {\n            this.updateEdgeDisplayValues(e);\n        })\n    }\n\n    updateNodeDisplayValues(node) {\n        node.$DISPLAY_VALUE_NAMES.forEach(n=>node.displayValue(n, this.objectiveRulesManager.getNodeDisplayValue(node, n)));\n    }\n\n    updateEdgeDisplayValues(e) {\n        e.$DISPLAY_VALUE_NAMES.forEach(n=>e.displayValue(n, this.objectiveRulesManager.getEdgeDisplayValue(e, n)));\n    }\n\n    displayPolicy(policyToDisplay, data) {\n\n\n        data = data || this.data;\n        data.nodes.forEach(n=> {\n            n.clearDisplayValues();\n        });\n        data.edges.forEach(e=> {\n            e.clearDisplayValues();\n        });\n        data.getRoots().forEach((root)=>this.displayPolicyForNode(root, policyToDisplay));\n    }\n\n    displayPolicyForNode(node, policy) {\n        if (node instanceof model.DecisionNode) {\n            var decision = Policy.getDecision(policy, node);\n            //console.log(decision, node, policy);\n            if (decision) {\n                node.displayValue('optimal', true)\n                var childEdge = node.childEdges[decision.decisionValue];\n                childEdge.displayValue('optimal', true)\n                return this.displayPolicyForNode(childEdge.childNode, policy)\n            }\n            return;\n        } else if(node instanceof model.ChanceNode){\n            node.displayValue('optimal', true);\n            node.childEdges.forEach(e=>{\n                e.displayValue('optimal', true);\n                this.displayPolicyForNode(e.childNode, policy)\n            })\n        }else if(node instanceof model.TerminalNode){\n            node.displayValue('optimal', true);\n        }\n\n\n    }\n}\n","import {ExpressionEngine} from \"sd-expression-engine\";\nexport class ComputationsUtils{\n\n    static sequence(min, max, length) {\n        var extent = ExpressionEngine.subtract(max, min);\n        var result = [min];\n        var steps = length - 1;\n        if(!steps){\n            return result;\n        }\n        var step = ExpressionEngine.divide(extent,length - 1);\n        var curr = min;\n        for (var i = 0; i < length - 2; i++) {\n            curr = ExpressionEngine.add(curr, step);\n            result.push(ExpressionEngine.toFloat(curr));\n        }\n        result.push(max);\n        return result;\n    }\n}\n","import {ExpressionEngine} from \"sd-expression-engine\";\nimport {domain as model} from 'sd-model'\nimport {Utils, log} from 'sd-utils'\n\n/*Evaluates code and expressions in trees*/\nexport class ExpressionsEvaluator {\n    expressionEngine;\n    constructor(expressionEngine){\n        this.expressionEngine = expressionEngine;\n    }\n\n    clear(data){\n        data.nodes.forEach(n=>{\n            n.clearComputedValues();\n        });\n        data.edges.forEach(e=>{\n            e.clearComputedValues();\n        });\n    }\n\n    clearTree(data, root){\n        data.getAllNodesInSubtree(root).forEach(n=>{\n            n.clearComputedValues();\n            n.childEdges.forEach(e=>{\n                e.clearComputedValues();\n            })\n        })\n    }\n\n    evalExpressions(data, evalCode=true, evalNumeric=true, initScopes=false){\n        log.debug('evalExpressions evalCode:'+evalCode+' evalNumeric:'+evalNumeric);\n        if(evalCode){\n            this.evalGlobalCode(data);\n        }\n\n        data.getRoots().forEach(n=>{\n            this.clearTree(data, n);\n            this.evalExpressionsForNode(data, n, evalCode, evalNumeric,initScopes);\n        });\n\n    }\n\n    evalGlobalCode(data){\n        data.clearExpressionScope();\n        data.$codeDirty = false;\n        try{\n            data.$codeError = null;\n            this.expressionEngine.eval(data.code, false, data.expressionScope);\n        }catch (e){\n            data.$codeError = e;\n        }\n    }\n\n    evalPayoff(edge, index = 0) {\n        if (ExpressionEngine.hasAssignmentExpression(edge.payoff[index])) {\n            return null;\n        }\n        return this.expressionEngine.eval(edge.payoff[index], true, edge.parentNode.expressionScope);\n    }\n\n    evalExpressionsForNode(data, node, evalCode=true, evalNumeric=true, initScope=false) {\n        if(!node.expressionScope || initScope || evalCode){\n            this.initScopeForNode(data, node);\n        }\n        if(evalCode){\n            node.$codeDirty = false;\n            if(node.code){\n                try{\n                    node.$codeError = null;\n                    this.expressionEngine.eval(node.code, false, node.expressionScope);\n                }catch (e){\n                    node.$codeError = e;\n                    log.debug(e);\n                }\n            }\n        }\n\n        if(evalNumeric){\n            var scope = node.expressionScope;\n            var probabilitySum=ExpressionEngine.toNumber(0);\n            var hashEdges= [];\n            var invalidProb = false;\n\n            node.childEdges.forEach(e=>{\n                e.payoff.forEach((rawPayoff, payoffIndex)=> {\n                    let path = 'payoff[' + payoffIndex + ']';\n                    if(e.isFieldValid(path, true, false)){\n                        try{\n                            e.computedValue(null, path, this.evalPayoff(e, payoffIndex))\n                        }catch (err){\n                            //   Left empty intentionally\n                        }\n                    }\n                });\n\n\n\n                if(node instanceof model.ChanceNode){\n                    if(ExpressionEngine.isHash(e.probability)){\n                        hashEdges.push(e);\n                        return;\n                    }\n\n                    if(ExpressionEngine.hasAssignmentExpression(e.probability)){ //It should not occur here!\n                        log.warn(\"evalExpressionsForNode hasAssignmentExpression!\", e);\n                        return null;\n                    }\n\n                    if(e.isFieldValid('probability', true, false)){\n                        try{\n                            var prob = this.expressionEngine.eval(e.probability, true, scope);\n                            e.computedValue(null, 'probability', prob);\n                            probabilitySum = ExpressionEngine.add(probabilitySum, prob);\n                        }catch (err){\n                            invalidProb = true;\n                        }\n                    }else{\n                        invalidProb = true;\n                    }\n                }\n\n            });\n\n\n            if(node instanceof model.ChanceNode){\n                var computeHash = hashEdges.length && !invalidProb && (probabilitySum.compare(0) >= 0 && probabilitySum.compare(1) <= 0);\n\n                if(computeHash) {\n                    var hash = ExpressionEngine.divide(ExpressionEngine.subtract(1, probabilitySum), hashEdges.length);\n                    hashEdges.forEach(e=> {\n                        e.computedValue(null, 'probability', hash);\n                    });\n                }\n            }\n\n            node.childEdges.forEach(e=>{\n                this.evalExpressionsForNode(data, e.childNode, evalCode, evalNumeric, initScope);\n            });\n        }\n    }\n\n    initScopeForNode(data, node){\n        var parent = node.$parent;\n        var parentScope = parent?parent.expressionScope : data.expressionScope;\n        node.expressionScope = Utils.cloneDeep(parentScope);\n    }\n}\n","export * from './computations-engine'\nexport * from './computations-manager'\nexport * from './expressions-evaluator'\nexport * from './jobs/index'\n\n","import {Utils} from \"sd-utils\";\nimport {JobParameters} from \"../../engine/job-parameters\";\nimport {JobParameterDefinition, PARAMETER_TYPE} from \"../../engine/job-parameter-definition\";\n\nexport class LeagueTableJobParameters extends JobParameters {\n\n    initDefinitions() {\n        this.definitions.push(new JobParameterDefinition(\"id\", PARAMETER_TYPE.STRING, 1, 1, true));\n        this.definitions.push(new JobParameterDefinition(\"ruleName\", PARAMETER_TYPE.STRING));\n        this.definitions.push(new JobParameterDefinition(\"extendedPolicyDescription\", PARAMETER_TYPE.BOOLEAN));\n        this.definitions.push(new JobParameterDefinition(\"weightLowerBound\", PARAMETER_TYPE.NUMBER_EXPRESSION).set(\"singleValueValidator\", (v, allVals) => {\n            return v >= 0 && v <= JobParameterDefinition.computeNumberExpression(allVals['weightUpperBound'])\n        }));\n        this.definitions.push(new JobParameterDefinition(\"defaultWeight\", PARAMETER_TYPE.NUMBER_EXPRESSION).set(\"singleValueValidator\", (v, allVals) => {\n            return v >= 0 && v >= JobParameterDefinition.computeNumberExpression(allVals['weightLowerBound']) && v <= JobParameterDefinition.computeNumberExpression(allVals['weightUpperBound'])\n        }));\n        this.definitions.push(new JobParameterDefinition(\"weightUpperBound\", PARAMETER_TYPE.NUMBER_EXPRESSION).set(\"singleValueValidator\", (v, allVals) => {\n            return v >= 0 && v >= JobParameterDefinition.computeNumberExpression(allVals['weightLowerBound'])\n        }));\n\n    }\n\n\n    initDefaultValues() {\n        this.values = {\n            id: Utils.guid(),\n            nameOfCriterion1: 'Cost',\n            nameOfCriterion2: 'Effect',\n            extendedPolicyDescription: true,\n            weightLowerBound: 0,\n            defaultWeight: 0,\n            weightUpperBound: Infinity,\n        }\n    }\n}\n","import {SimpleJob} from \"../../engine/simple-job\";\nimport {Policy} from \"../../../policies/policy\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {CalculateStep} from \"./steps/calculate-step\";\nimport {LeagueTableJobParameters} from \"./league-table-job-parameters\";\n\n\nexport class LeagueTableJob extends SimpleJob {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"league-table\", jobRepository, expressionsEvaluator, objectiveRulesManager);\n        this.initSteps();\n    }\n\n    initSteps() {\n        this.calculateStep = new CalculateStep(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager);\n        this.addStep(this.calculateStep);\n    }\n\n    createJobParameters(values) {\n        return new LeagueTableJobParameters(values);\n    }\n\n    getJobDataValidator() {\n        return {\n            validate: (data) => data.getRoots().length === 1\n        }\n    }\n\n    jobResultToCsvRows(jobResult, jobParameters, withHeaders = true) {\n        var result = [];\n        if (withHeaders) {\n            var headers = ['policy_id', 'policy', jobResult.payoffNames[0], jobResult.payoffNames[1], 'dominated_by', 'extended-dominated_by', 'incratio', 'optimal', 'optimal_for_default_weight'];\n            result.push(headers);\n        }\n\n        jobResult.rows.forEach(row => {\n            row.policies.forEach(policy=> {\n                var rowCells = [\n                    row.id,\n                    Policy.toPolicyString(policy, jobParameters.values.extendedPolicyDescription),\n                    row.payoffs[1],\n                    row.payoffs[0],\n                    row.dominatedBy,\n                    row.extendedDominatedBy === null ? null : row.extendedDominatedBy[0] + ', ' + row.extendedDominatedBy[1],\n                    row.incratio,\n                    row.optimal,\n                    row.optimalForDefaultWeight\n                ];\n                result.push(rowCells);\n            })\n        });\n\n        return result;\n    }\n}\n","import {Step} from \"../../../engine/step\";\nimport {JOB_STATUS} from \"../../../engine/job-status\";\nimport {PoliciesCollector} from \"../../../../policies/policies-collector\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {TreeValidator} from \"../../../../validation/tree-validator\";\nimport {Policy} from \"../../../../policies/policy\";\n\nexport class CalculateStep extends Step {\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"calculate_step\", jobRepository);\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n        this.treeValidator = new TreeValidator();\n    }\n\n    doExecute(stepExecution, jobResult) {\n        var data = stepExecution.getData();\n        var params = stepExecution.getJobParameters();\n        var ruleName = params.value(\"ruleName\");\n        this.objectiveRulesManager.setCurrentRuleByName(ruleName);\n        let rule = this.objectiveRulesManager.currentRule;\n        var treeRoot = data.getRoots()[0];\n        var policiesCollector = new PoliciesCollector(treeRoot);\n\n        var policies = policiesCollector.policies;\n\n\n        var payoffCoeffs = this.payoffCoeffs = rule.payoffCoeffs;\n\n        this.expressionsEvaluator.evalExpressions(data);\n        var vr = this.treeValidator.validate(data.getAllNodesInSubtree(treeRoot));\n\n        if (!vr.isValid()) {\n            return stepExecution;\n        }\n\n        var compare = (a, b)=>(-payoffCoeffs[0] *  (b.payoffs[0] - a.payoffs[0])) || (-payoffCoeffs[1] *  (a.payoffs[1] - b.payoffs[1]));\n\n        var rows = policies.map(policy => {\n            this.objectiveRulesManager.recomputeTree(treeRoot, false, policy);\n            return {\n                policies: [policy],\n                payoffs: treeRoot.computedValue(ruleName, 'payoff').slice(),\n                dominatedBy: null,\n                extendedDominatedBy: null,\n                incratio: null,\n                optimal: false,\n                optimalForDefaultWeight: false\n            }\n        }).sort(compare);\n\n        rows = rows.reduce((previousValue, currentValue, index, array)=>{\n            if(!previousValue.length){\n                return [currentValue]\n            }\n\n            let prev = previousValue[previousValue.length-1];\n            if(compare(prev, currentValue) == 0){\n                prev.policies.push(...currentValue.policies);\n                return previousValue\n            }\n            return previousValue.concat(currentValue)\n        }, []);\n\n        rows.sort((a, b)=>(payoffCoeffs[0] *  (a.payoffs[0] - b.payoffs[0])) || (-payoffCoeffs[1] *   (a.payoffs[1] - b.payoffs[1])));\n        rows.forEach((r, i)=> {\n            r.id = i+1;\n        });\n        // rows.sort(compare);\n        rows.sort((a, b)=>(-payoffCoeffs[0] *  (a.payoffs[0] - b.payoffs[0])) || (-payoffCoeffs[1] *   (a.payoffs[1] - b.payoffs[1])));\n\n        let bestCost = -payoffCoeffs[1] * Infinity,\n            bestCostRow = null;\n\n        let cmp= (a, b) => a > b;\n        if(payoffCoeffs[1]<0){\n            cmp= (a, b) => a < b;\n        }\n\n        rows.forEach((r, i)=> {\n            if (cmp(r.payoffs[1], bestCost)) {\n                bestCost = r.payoffs[1];\n                bestCostRow = r;\n            } else if(bestCostRow) {\n                r.dominatedBy = bestCostRow.id;\n            }\n        });\n\n        cmp= (a, b) => a < b;\n        if(payoffCoeffs[0] > 0 && payoffCoeffs[1] < 0){\n            cmp= (a, b) => a < b;\n        }else if(payoffCoeffs[0] < 0 && payoffCoeffs[1] > 0){\n            cmp= (a, b) => a < b;\n        }else if(payoffCoeffs[1]<0){\n            cmp= (a, b) => a > b;\n        }\n\n        let prev2NotDominated = null;\n\n\n        rows.filter(r=>!r.dominatedBy).sort((a, b)=>(  payoffCoeffs[0] * (a.payoffs[0] - b.payoffs[0]))).forEach((r, i, arr)=> {\n            if (!i) {\n                r.incratio = 0;\n                return;\n            }\n\n            let prev = arr[i - 1];\n\n            r.incratio = this.computeICER(r, prev);\n            if (i < 2) {\n                return;\n            }\n\n            if(!prev2NotDominated){\n                prev2NotDominated = arr[i - 2];\n            }\n\n            if(cmp(r.incratio,prev.incratio)){\n                prev.incratio = null;\n                prev.extendedDominatedBy = [prev2NotDominated.id, r.id] ;\n                r.incratio = this.computeICER(r, prev2NotDominated);\n            }else{\n                prev2NotDominated = prev;\n            }\n        });\n\n        let weightLowerBound = params.value(\"weightLowerBound\");\n        let defaultWeight = params.value(\"defaultWeight\");\n        let weightUpperBound = params.value(\"weightUpperBound\");\n\n        //mark optimal for weight in [weightLowerBound, weightUpperBound] and optimal for default Weight\n        let lastLELower = null;\n        let lastLELowerDef = null;\n        rows.slice().filter(r=>!r.dominatedBy && !r.extendedDominatedBy).sort((a, b) => {\n            let sub = a.incratio - b.incratio;\n            return sub ? sub : payoffCoeffs[0] * (a.payoffs[0] - b.payoffs[0])\n        }).forEach((row, i, arr)=>{\n\n            if(row.incratio < weightLowerBound){\n                lastLELower  = row;\n            }\n            if(row.incratio < defaultWeight){\n                lastLELowerDef  = row;\n            }\n\n            row.optimal = row.incratio >= weightLowerBound && row.incratio <= weightUpperBound;\n            row.optimalForDefaultWeight = row.incratio == defaultWeight;\n\n        });\n        if(lastLELower){\n            lastLELower.optimal = true;\n        }\n\n        if(lastLELowerDef){\n            lastLELowerDef.optimalForDefaultWeight = true;\n        }\n\n        rows.forEach(row=>{\n            row.payoffs[0] =  ExpressionEngine.toFloat(row.payoffs[0]);\n            row.payoffs[1] =  ExpressionEngine.toFloat(row.payoffs[1]);\n            row.incratio = row.incratio === null ? null : ExpressionEngine.toFloat(row.incratio);\n        });\n\n        jobResult.data = {\n            payoffNames: data.payoffNames.slice(),\n            payoffCoeffs : payoffCoeffs,\n            rows: rows.sort((a, b)=>(a.id - b.id)),\n            weightLowerBound: ExpressionEngine.toFloat(weightLowerBound),\n            defaultWeight: ExpressionEngine.toFloat(defaultWeight),\n            weightUpperBound: ExpressionEngine.toFloat(weightUpperBound)\n        };\n\n        stepExecution.exitStatus = JOB_STATUS.COMPLETED;\n        return stepExecution;\n    }\n\n    computeICER(r, prev){\n        let d = ExpressionEngine.subtract(r.payoffs[0], prev.payoffs[0]);\n        let n = ExpressionEngine.subtract(r.payoffs[1], prev.payoffs[1]);\n        if (d == 0){\n            if(n<0){\n                return - Infinity;\n            }\n            return Infinity;\n        }\n        return Math.abs(ExpressionEngine.divide(n, d));\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {JobParameters} from \"../../engine/job-parameters\";\nimport {JobParameterDefinition, PARAMETER_TYPE} from \"../../engine/job-parameter-definition\";\nexport class RecomputeJobParameters extends JobParameters {\n\n    initDefinitions() {\n        this.definitions.push(new JobParameterDefinition(\"id\", PARAMETER_TYPE.STRING, 1, 1, true));\n        this.definitions.push(new JobParameterDefinition(\"ruleName\", PARAMETER_TYPE.STRING).set('required', false));\n        this.definitions.push(new JobParameterDefinition(\"evalCode\", PARAMETER_TYPE.BOOLEAN));\n        this.definitions.push(new JobParameterDefinition(\"evalNumeric\", PARAMETER_TYPE.BOOLEAN));\n    }\n\n    initDefaultValues() {\n        this.values = {\n            id: Utils.guid(),\n            ruleName: null, //recompute all rules\n            evalCode: true,\n            evalNumeric: true\n        }\n    }\n}\n","import {SimpleJob} from \"../../engine/simple-job\";\nimport {Step} from \"../../engine/step\";\nimport {JOB_STATUS} from \"../../engine/job-status\";\nimport {TreeValidator} from \"../../../validation/tree-validator\";\nimport {BatchStep} from \"../../engine/batch/batch-step\";\nimport {RecomputeJobParameters} from \"./recompute-job-parameters\";\nimport {Job} from \"../../engine/job\";\n\nexport class RecomputeJob extends Job {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"recompute\", jobRepository);\n        this.isRestartable = false;\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n        this.treeValidator = new TreeValidator();\n    }\n\n    doExecute(execution) {\n        var data = execution.getData();\n        var params = execution.jobParameters;\n        var ruleName = params.value(\"ruleName\");\n        var allRules = !ruleName;\n        if(ruleName){\n            this.objectiveRulesManager.setCurrentRuleByName(ruleName);\n        }\n        this.checkValidityAndRecomputeObjective(data, allRules, params.value(\"evalCode\"), params.value(\"evalNumeric\"))\n        return execution;\n    }\n\n    checkValidityAndRecomputeObjective(data, allRules, evalCode, evalNumeric) {\n        data.validationResults = [];\n\n        if(evalCode||evalNumeric){\n            this.expressionsEvaluator.evalExpressions(data, evalCode, evalNumeric);\n        }\n\n        data.getRoots().forEach(root=> {\n            var vr = this.treeValidator.validate(data.getAllNodesInSubtree(root));\n            data.validationResults.push(vr);\n            if (vr.isValid()) {\n                this.objectiveRulesManager.recomputeTree(root, allRules);\n            }\n        });\n    }\n\n    createJobParameters(values) {\n        return new RecomputeJobParameters(values);\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {JobParameters} from \"../../../engine/job-parameters\";\nimport {JobParameterDefinition, PARAMETER_TYPE} from \"../../../engine/job-parameter-definition\";\nexport class SensitivityAnalysisJobParameters extends JobParameters {\n\n    initDefinitions() {\n        this.definitions.push(new JobParameterDefinition(\"id\", PARAMETER_TYPE.STRING, 1, 1, true));\n        this.definitions.push(new JobParameterDefinition(\"ruleName\", PARAMETER_TYPE.STRING));\n        this.definitions.push(new JobParameterDefinition(\"extendedPolicyDescription\", PARAMETER_TYPE.BOOLEAN));\n        this.definitions.push(new JobParameterDefinition(\"failOnInvalidTree\", PARAMETER_TYPE.BOOLEAN));\n        this.definitions.push(new JobParameterDefinition(\"variables\", [\n                new JobParameterDefinition(\"name\", PARAMETER_TYPE.STRING),\n                new JobParameterDefinition(\"min\", PARAMETER_TYPE.NUMBER),\n                new JobParameterDefinition(\"max\", PARAMETER_TYPE.NUMBER),\n                new JobParameterDefinition(\"length\", PARAMETER_TYPE.INTEGER).set(\"singleValueValidator\", v => v >= 2),\n            ], 1, Infinity, false,\n            v => v[\"min\"] < v[\"max\"],\n            values => Utils.isUnique(values, v=>v[\"name\"]) //Variable names should be unique\n        ))\n    }\n\n    initDefaultValues() {\n        this.values = {\n            id: Utils.guid(),\n            extendedPolicyDescription: true,\n            failOnInvalidTree: true\n        }\n    }\n}\n","import {SimpleJob} from \"../../../engine/simple-job\";\nimport {SensitivityAnalysisJobParameters} from \"./sensitivity-analysis-job-parameters\";\nimport {PrepareVariablesStep} from \"./steps/prepare-variables-step\";\nimport {InitPoliciesStep} from \"./steps/init-policies-step\";\nimport {CalculateStep} from \"./steps/calculate-step\";\nimport {Policy} from \"../../../../policies/policy\";\nimport {Utils} from \"sd-utils\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\n\n\nexport class SensitivityAnalysisJob extends SimpleJob {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager, batchSize=5) {\n        super(\"sensitivity-analysis\", jobRepository, expressionsEvaluator, objectiveRulesManager);\n        this.batchSize = 5;\n        this.initSteps();\n    }\n\n    initSteps(){\n        this.addStep(new PrepareVariablesStep(this.jobRepository, this.expressionsEvaluator.expressionEngine));\n        this.addStep(new InitPoliciesStep(this.jobRepository));\n        this.calculateStep = new CalculateStep(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager, this.batchSize);\n        this.addStep(this.calculateStep);\n    }\n\n    createJobParameters(values) {\n        return new SensitivityAnalysisJobParameters(values);\n    }\n\n    getJobDataValidator() {\n        return {\n            validate: (data) => data.getRoots().length === 1\n        }\n    }\n\n    setBatchSize(batchSize){\n        this.batchSize = batchSize;\n        this.calculateStep.chunkSize = batchSize;\n    }\n\n    jobResultToCsvRows(jobResult, jobParameters, withHeaders=true){\n        var result = [];\n        if(withHeaders){\n            var headers = ['policy_number', 'policy'];\n            jobResult.variableNames.forEach(n=>headers.push(n));\n            headers.push('payoff');\n            result.push(headers);\n        }\n\n        var roundVariables = !!jobParameters.values.roundVariables;\n        if(roundVariables){\n            this.roundVariables(jobResult);\n        }\n\n        jobResult.rows.forEach(row => {\n            var policy = jobResult.policies[row.policyIndex];\n            var rowCells = [row.policyIndex+1, Policy.toPolicyString(policy, jobParameters.values.extendedPolicyDescription)];\n            row.variables.forEach(v=> rowCells.push(v));\n            rowCells.push(row.payoff);\n            result.push(rowCells);\n\n            if(row._variables){ //revert original variables\n                row.variables = row._variables;\n                delete row._variables;\n            }\n        });\n\n        return result;\n    }\n\n    roundVariables(jobResult){\n        var uniqueValues = jobResult.variableNames.map(()=>new Set());\n\n        jobResult.rows.forEach(row => {\n            row._variables = row.variables.slice(); // save original row variables\n            row.variables.forEach((v,i)=> {\n                uniqueValues[i].add(v)\n            });\n        });\n\n        var uniqueValuesNo = uniqueValues.map((s)=>s.size);\n        var maxPrecision = 14;\n        var precision = 2;\n        var notReadyVariablesIndexes = jobResult.variableNames.map((v,i)=>i);\n        while(precision<=maxPrecision && notReadyVariablesIndexes.length){\n            uniqueValues = notReadyVariablesIndexes.map(()=>new Set());\n            jobResult.rows.forEach(row => {\n                notReadyVariablesIndexes.forEach((variableIndex, notReadyIndex)=>{\n\n                    var val = row._variables[variableIndex];\n                    val = Utils.round(val, precision);\n                    uniqueValues[notReadyIndex].add(val);\n\n                    row.variables[variableIndex] = val;\n                })\n            });\n\n            var newReadyIndexes = [];\n            uniqueValues.forEach((uniqueVals, notReadyIndex)=>{\n                var origUniqueCount = uniqueValuesNo[notReadyVariablesIndexes[notReadyIndex]] ;\n                if(origUniqueCount==uniqueVals.size){ //ready in previous iteration\n                    newReadyIndexes.push(notReadyIndex);\n                }\n            });\n            if(newReadyIndexes.length) { //revert values to prev iteration\n                newReadyIndexes.reverse();\n                newReadyIndexes.forEach(notReadyIndex=>{\n                    notReadyVariablesIndexes.splice(notReadyIndex, 1);\n                })\n            }\n            precision++;\n        }\n    }\n\n    /*Should return progress object with fields:\n     * current\n     * total */\n    getProgress(execution){\n\n        if (execution.stepExecutions.length <= 2) {\n            return {\n                total: 1,\n                current: 0\n            };\n        }\n\n        return this.steps[2].getProgress(execution.stepExecutions[2]);\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {BatchStep} from \"../../../../engine/batch/batch-step\";\nimport {TreeValidator} from \"../../../../../validation/tree-validator\";\nimport {Policy} from \"../../../../../policies/policy\";\nimport {JobComputationException} from \"../../../../engine/exceptions/job-computation-exception\";\n\nexport class CalculateStep extends BatchStep {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager, batchSize) {\n        super(\"calculate_step\", jobRepository, batchSize);\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n        this.treeValidator = new TreeValidator();\n    }\n\n    init(stepExecution, jobResult) {\n        var jobExecutionContext = stepExecution.getJobExecutionContext();\n        var params = stepExecution.getJobParameters();\n        var ruleName = params.value(\"ruleName\");\n\n        this.objectiveRulesManager.setCurrentRuleByName(ruleName);\n        var variableValues = jobResult.data.variableValues;\n        var variableNames = params.value(\"variables\").map(v=>v.name);\n        stepExecution.executionContext.put(\"variableNames\", variableNames);\n\n\n        if (!jobResult.data.rows) {\n            jobResult.data.rows = [];\n            jobResult.data.variableNames = variableNames;\n        }\n\n        return variableValues.length;\n    }\n\n\n    readNextChunk(stepExecution, startIndex, chunkSize, jobResult) {\n        var variableValues = jobResult.data.variableValues;\n        return variableValues.slice(startIndex, startIndex + chunkSize);\n    }\n\n\n    processItem(stepExecution, item) {\n        var params = stepExecution.getJobParameters();\n        var ruleName = params.value(\"ruleName\");\n        var failOnInvalidTree = params.value(\"failOnInvalidTree\");\n        var data = stepExecution.getData();\n        var treeRoot = data.getRoots()[0];\n        var variableNames = stepExecution.executionContext.get(\"variableNames\");\n        var policies = stepExecution.getJobExecutionContext().get(\"policies\");\n\n        this.expressionsEvaluator.clear(data);\n        this.expressionsEvaluator.evalGlobalCode(data);\n        variableNames.forEach((variableName, i)=> {\n            data.expressionScope[variableName] = item[i];\n        });\n\n        this.expressionsEvaluator.evalExpressionsForNode(data, treeRoot);\n        var vr = this.treeValidator.validate(data.getAllNodesInSubtree(treeRoot));\n\n        var valid = vr.isValid();\n\n        if(!valid && failOnInvalidTree){\n            let errorData = {\n                variables: {}\n            };\n            variableNames.forEach((variableName, i)=> {\n                errorData.variables[variableName] = item[i];\n            });\n            throw new JobComputationException(\"computations\", errorData)\n        }\n\n        var payoffs = [];\n\n        policies.forEach(policy=> {\n            var payoff = 'n/a';\n            if (valid) {\n                this.objectiveRulesManager.recomputeTree(treeRoot, false, policy);\n                payoff = treeRoot.computedValue(ruleName, 'payoff')[0];\n            }\n            payoffs.push(payoff);\n        });\n\n        return {\n            policies: policies,\n            variables: item,\n            payoffs: payoffs\n        };\n    }\n\n    writeChunk(stepExecution, items, jobResult) {\n        var params = stepExecution.getJobParameters();\n        var extendedPolicyDescription = params.value(\"extendedPolicyDescription\");\n\n        items.forEach(item=> {\n            if (!item) {\n                return;\n            }\n            item.policies.forEach((policy, i)=> {\n                var variables = item.variables.map(v => this.toFloat(v));\n\n                var payoff = item.payoffs[i];\n                var row = {\n                    policyIndex: i,\n                    variables: variables,\n                    payoff: Utils.isString(payoff) ? payoff : this.toFloat(payoff)\n                };\n                jobResult.data.rows.push(row);\n            })\n        })\n    }\n\n    postProcess(stepExecution, jobResult) {\n        delete jobResult.data.variableValues;\n    }\n\n\n    toFloat(v) {\n        return ExpressionEngine.toFloat(v);\n    }\n}\n","import {Step} from \"../../../../engine/step\";\nimport {JOB_STATUS} from \"../../../../engine/job-status\";\nimport {PoliciesCollector} from \"../../../../../policies/policies-collector\";\n\nexport class InitPoliciesStep extends Step {\n    constructor(jobRepository) {\n        super(\"init_policies\", jobRepository);\n    }\n\n    doExecute(stepExecution, jobResult) {\n        var data = stepExecution.getData();\n        var treeRoot = data.getRoots()[0];\n        var policiesCollector = new PoliciesCollector(treeRoot);\n\n        var policies = policiesCollector.policies;\n        stepExecution.getJobExecutionContext().put(\"policies\", policies);\n\n        if(!jobResult.data){\n            jobResult.data={}\n        }\n\n        jobResult.data.policies = policies;\n\n        stepExecution.exitStatus = JOB_STATUS.COMPLETED;\n        return stepExecution;\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {Step} from \"../../../../engine/step\";\nimport {JOB_STATUS} from \"../../../../engine/job-status\";\nimport {ComputationsUtils} from \"../../../../../computations-utils\";\n\nexport class PrepareVariablesStep extends Step {\n    constructor(jobRepository, expressionEngine) {\n        super(\"prepare_variables\", jobRepository);\n        this.expressionEngine = expressionEngine;\n    }\n\n    doExecute(stepExecution, jobResult) {\n        var params = stepExecution.getJobParameters();\n        var variables = params.value(\"variables\");\n\n        var variableValues = [];\n        variables.forEach(v=> {\n            variableValues.push(ComputationsUtils.sequence(v.min, v.max, v.length));\n        });\n        variableValues = Utils.cartesianProductOf(variableValues);\n        jobResult.data={\n            variableValues: variableValues\n        };\n        stepExecution.exitStatus = JOB_STATUS.COMPLETED;\n        return stepExecution;\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {JobParameters} from \"../../../engine/job-parameters\";\nimport {JobParameterDefinition, PARAMETER_TYPE} from \"../../../engine/job-parameter-definition\";\nexport class ProbabilisticSensitivityAnalysisJobParameters extends JobParameters {\n\n    initDefinitions() {\n        this.definitions.push(new JobParameterDefinition(\"id\", PARAMETER_TYPE.STRING, 1, 1, true));\n        this.definitions.push(new JobParameterDefinition(\"ruleName\", PARAMETER_TYPE.STRING));\n        this.definitions.push(new JobParameterDefinition(\"failOnInvalidTree\", PARAMETER_TYPE.BOOLEAN));\n        this.definitions.push(new JobParameterDefinition(\"extendedPolicyDescription\", PARAMETER_TYPE.BOOLEAN));\n        this.definitions.push(new JobParameterDefinition(\"numberOfRuns\", PARAMETER_TYPE.INTEGER).set(\"singleValueValidator\", v => v > 0));\n\n        this.definitions.push(new JobParameterDefinition(\"variables\", [\n                new JobParameterDefinition(\"name\", PARAMETER_TYPE.STRING),\n                new JobParameterDefinition(\"formula\", PARAMETER_TYPE.NUMBER_EXPRESSION)\n            ], 1, Infinity, false,\n            null,\n            values => Utils.isUnique(values, v=>v[\"name\"]) //Variable names should be unique\n        ))\n    }\n\n    initDefaultValues() {\n        this.values = {\n            id: Utils.guid(),\n            extendedPolicyDescription: true,\n            failOnInvalidTree: true\n        }\n    }\n}\n","import {ProbabilisticSensitivityAnalysisJobParameters} from \"./probabilistic-sensitivity-analysis-job-parameters\";\nimport {InitPoliciesStep} from \"../n-way/steps/init-policies-step\";\nimport {SensitivityAnalysisJob} from \"../n-way/sensitivity-analysis-job\";\nimport {ProbCalculateStep} from \"./steps/prob-calculate-step\";\nimport {ComputePolicyStatsStep} from \"./steps/compute-policy-stats-step\";\n\nexport class ProbabilisticSensitivityAnalysisJob extends SensitivityAnalysisJob {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager, batchSize=5) {\n        super(jobRepository, expressionsEvaluator, objectiveRulesManager, batchSize);\n        this.name = \"probabilistic-sensitivity-analysis\";\n    }\n\n    initSteps() {\n        this.addStep(new InitPoliciesStep(this.jobRepository));\n        this.calculateStep = new ProbCalculateStep(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager, this.batchSize);\n        this.addStep(this.calculateStep);\n        this.addStep(new ComputePolicyStatsStep(this.expressionsEvaluator.expressionEngine, this.objectiveRulesManager, this.jobRepository));\n    }\n\n    createJobParameters(values) {\n        return new ProbabilisticSensitivityAnalysisJobParameters(values);\n    }\n\n    /*Should return progress object with fields:\n     * current\n     * total */\n    getProgress(execution) {\n\n        if (execution.stepExecutions.length <= 1) {\n            return {\n                total: 1,\n                current: 0\n            };\n        }\n\n        return this.steps[1].getProgress(execution.stepExecutions[1]);\n    }\n}\n","import {log, Utils} from \"sd-utils\";\nimport {Step} from \"../../../../engine/step\";\nimport {JOB_STATUS} from \"../../../../engine/job-status\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\n\nexport class ComputePolicyStatsStep extends Step {\n    constructor(expressionEngine, objectiveRulesManager, jobRepository) {\n        super(\"compute_policy_stats\", jobRepository);\n        this.expressionEngine = expressionEngine;\n        this.objectiveRulesManager = objectiveRulesManager;\n    }\n\n    doExecute(stepExecution, jobResult) {\n        var params = stepExecution.getJobParameters();\n        var numberOfRuns = params.value(\"numberOfRuns\");\n        var ruleName = params.value(\"ruleName\");\n\n        let rule = this.objectiveRulesManager.ruleByName[ruleName];\n\n\n        var payoffsPerPolicy = jobResult.data.policies.map(()=>[]);\n\n        jobResult.data.rows.forEach(row=> {\n            payoffsPerPolicy[row.policyIndex].push(Utils.isString(row.payoff) ? 0 : row.payoff)\n        });\n\n        log.debug('payoffsPerPolicy', payoffsPerPolicy, jobResult.data.rows.length, rule.maximization);\n\n        jobResult.data.medians = payoffsPerPolicy.map(payoffs=>ExpressionEngine.median(payoffs));\n        jobResult.data.standardDeviations = payoffsPerPolicy.map(payoffs=>ExpressionEngine.std(payoffs));\n\n        if (rule.maximization) {\n            jobResult.data.policyIsBestProbabilities = jobResult.data.policyToHighestPayoffCount.map(v=>ExpressionEngine.toFloat(ExpressionEngine.divide(v, numberOfRuns)));\n        } else {\n            jobResult.data.policyIsBestProbabilities = jobResult.data.policyToLowestPayoffCount.map(v=>ExpressionEngine.toFloat(ExpressionEngine.divide(v, numberOfRuns)));\n        }\n\n        jobResult.data.policyToHighestPayoffCount = jobResult.data.policyToHighestPayoffCount.map(v=>ExpressionEngine.toFloat(v));\n        jobResult.data.policyToLowestPayoffCount = jobResult.data.policyToLowestPayoffCount.map(v=>ExpressionEngine.toFloat(v));\n\n\n        stepExecution.exitStatus = JOB_STATUS.COMPLETED;\n        return stepExecution;\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {CalculateStep} from \"../../n-way/steps/calculate-step\";\nimport {JobComputationException} from \"../../../../engine/exceptions/job-computation-exception\";\n\nexport class ProbCalculateStep extends CalculateStep {\n\n    init(stepExecution, jobResult) {\n        var jobExecutionContext = stepExecution.getJobExecutionContext();\n        var params = stepExecution.getJobParameters();\n        var ruleName = params.value(\"ruleName\");\n\n        this.objectiveRulesManager.setCurrentRuleByName(ruleName);\n        var variableNames = params.value(\"variables\").map(v=>v.name);\n        stepExecution.executionContext.put(\"variableNames\", variableNames);\n\n        if(!jobResult.data.rows){\n            jobResult.data.rows = [];\n            jobResult.data.variableNames = variableNames;\n            jobResult.data.expectedValues = Utils.fill(new Array(jobResult.data.policies.length), 0);\n            jobResult.data.policyToHighestPayoffCount = Utils.fill(new Array(jobResult.data.policies.length), 0);\n            jobResult.data.policyToLowestPayoffCount = Utils.fill(new Array(jobResult.data.policies.length), 0);\n        }\n\n        return params.value(\"numberOfRuns\");\n    }\n\n    readNextChunk(stepExecution, startIndex, chunkSize, jobResult) {\n        var params = stepExecution.getJobParameters();\n        var variables = params.value(\"variables\");\n        var data = stepExecution.getData();\n        var variableValues = [];\n        for(var runIndex=0; runIndex<chunkSize; runIndex++){\n            var singleRunVariableValues = [];\n            var errors = [];\n            variables.forEach(v=> {\n                try{\n                    var evaluated = this.expressionsEvaluator.expressionEngine.eval(v.formula, true, Utils.cloneDeep(data.expressionScope));\n                    singleRunVariableValues.push(ExpressionEngine.toFloat(evaluated));\n                }catch(e){\n                    errors.push({\n                        variable: v,\n                        error: e\n                    });\n                }\n\n            });\n            if(errors.length) {\n                var errorData = {variables: []};\n                errors.forEach(e=>{\n                    errorData.variables[e.variable.name] = e.error.message;\n                });\n                throw new JobComputationException(\"param-computation\", errorData)\n            }\n            variableValues.push(singleRunVariableValues)\n        }\n\n        return variableValues;\n    }\n\n    processItem(stepExecution, item, currentItemCount, jobResult) {\n        var r = super.processItem(stepExecution, item, jobResult);\n\n        var params = stepExecution.getJobParameters();\n        var numberOfRuns = params.value(\"numberOfRuns\");\n        var policies = stepExecution.getJobExecutionContext().get(\"policies\");\n\n        this.updatePolicyStats(r, policies, numberOfRuns, jobResult);\n\n        return r;\n    }\n\n    updatePolicyStats(r, policies, numberOfRuns, jobResult){\n        var highestPayoff = -Infinity;\n        var lowestPayoff = Infinity;\n        var bestPolicyIndexes = [];\n        var worstPolicyIndexes = [];\n\n        var zeroNum = ExpressionEngine.toNumber(0);\n\n        policies.forEach((policy,i)=>{\n            let payoff = r.payoffs[i];\n            if(Utils.isString(payoff)){\n                payoff = zeroNum;\n            }\n            if(payoff < lowestPayoff){\n                lowestPayoff = payoff;\n                worstPolicyIndexes = [i];\n            }else if(payoff.equals(lowestPayoff)){\n                worstPolicyIndexes.push(i)\n            }\n            if(payoff > highestPayoff){\n                highestPayoff = payoff;\n                bestPolicyIndexes = [i]\n            }else if(payoff.equals(highestPayoff)){\n                bestPolicyIndexes.push(i)\n            }\n\n            jobResult.data.expectedValues[i] = ExpressionEngine.add(jobResult.data.expectedValues[i], ExpressionEngine.divide(payoff, numberOfRuns));\n        });\n\n        bestPolicyIndexes.forEach(policyIndex=>{\n            jobResult.data.policyToHighestPayoffCount[policyIndex] = ExpressionEngine.add(jobResult.data.policyToHighestPayoffCount[policyIndex], ExpressionEngine.divide(1, bestPolicyIndexes.length))\n        });\n\n        worstPolicyIndexes.forEach(policyIndex=>{\n            jobResult.data.policyToLowestPayoffCount[policyIndex] = ExpressionEngine.add(jobResult.data.policyToLowestPayoffCount[policyIndex], ExpressionEngine.divide(1, worstPolicyIndexes.length))\n        });\n    }\n\n\n    postProcess(stepExecution, jobResult) {\n        jobResult.data.expectedValues = jobResult.data.expectedValues.map(v=>this.toFloat(v));\n    }\n\n\n    toFloat(v) {\n        return ExpressionEngine.toFloat(v);\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {JobParameters} from \"../../../engine/job-parameters\";\nimport {JobParameterDefinition, PARAMETER_TYPE} from \"../../../engine/job-parameter-definition\";\nexport class SpiderPlotJobParameters extends JobParameters {\n\n    initDefinitions() {\n        this.definitions.push(new JobParameterDefinition(\"id\", PARAMETER_TYPE.STRING, 1, 1, true));\n        this.definitions.push(new JobParameterDefinition(\"ruleName\", PARAMETER_TYPE.STRING));\n        this.definitions.push(new JobParameterDefinition(\"percentageChangeRange\", PARAMETER_TYPE.NUMBER).set(\"singleValueValidator\", v => v > 0 && v <=100));\n        this.definitions.push(new JobParameterDefinition(\"length\", PARAMETER_TYPE.INTEGER).set(\"singleValueValidator\", v => v >= 0));\n        this.definitions.push(new JobParameterDefinition(\"variables\", [\n                new JobParameterDefinition(\"name\", PARAMETER_TYPE.STRING),\n            ], 1, Infinity, false,\n            null,\n            values => Utils.isUnique(values, v=>v[\"name\"]) //Variable names should be unique\n        ));\n        this.definitions.push(new JobParameterDefinition(\"failOnInvalidTree\", PARAMETER_TYPE.BOOLEAN));\n    }\n\n    initDefaultValues() {\n        this.values = {\n            id: Utils.guid(),\n            failOnInvalidTree: true\n        }\n    }\n}\n","import {SimpleJob} from \"../../../engine/simple-job\";\nimport {CalculateStep} from \"./steps/calculate-step\";\nimport {SpiderPlotJobParameters} from \"./spider-plot-job-parameters\";\n\nexport class SpiderPlotJob extends SimpleJob {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"spider-plot\", jobRepository);\n        this.addStep(new CalculateStep(jobRepository, expressionsEvaluator, objectiveRulesManager));\n    }\n\n    createJobParameters(values) {\n        return new SpiderPlotJobParameters(values);\n    }\n\n    getJobDataValidator() {\n        return {\n            validate: (data) => data.getRoots().length === 1\n        }\n    }\n\n\n    /*Should return progress object with fields:\n     * current\n     * total */\n    getProgress(execution){\n        if (execution.stepExecutions.length < 1) {\n            return {\n                total: 1,\n                current: 0\n            };\n        }\n\n        return this.steps[0].getProgress(execution.stepExecutions[0]);\n    }\n\n    jobResultToCsvRows(jobResult, jobParameters, withHeaders=true){\n\n        let result = [];\n        if(withHeaders){\n            result.push(['variable_name', 'policy_no'].concat(jobResult.percentageRangeValues));\n        }\n\n        jobResult.rows.forEach((row, index) => {\n\n            result.push(...row.payoffs.map((payoffs, policyIndex)=>[\n                row.variableName,\n                policyIndex+1,\n                ...payoffs\n            ]));\n\n        });\n\n        return result;\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {JobComputationException} from \"../../../../engine/exceptions/job-computation-exception\";\nimport {BatchStep} from \"../../../../engine/batch/batch-step\";\nimport {TreeValidator} from \"../../../../../validation/tree-validator\";\nimport {Policy} from \"../../../../../policies/policy\";\nimport {PoliciesCollector} from \"../../../../../policies/policies-collector\";\nimport {ComputationsUtils} from \"../../../../../computations-utils\";\n\nexport class CalculateStep extends BatchStep {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"calculate_step\", jobRepository, 1);\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n        this.treeValidator = new TreeValidator();\n    }\n\n    init(stepExecution, jobResult) {\n        let jobExecutionContext = stepExecution.getJobExecutionContext();\n        let params = stepExecution.getJobParameters();\n        let ruleName = params.value(\"ruleName\");\n        let percentageChangeRange = params.value(\"percentageChangeRange\");\n        let length = params.value(\"length\");\n        let variables = params.value(\"variables\");\n\n        this.objectiveRulesManager.setCurrentRuleByName(ruleName);\n        let variableNames = params.value(\"variables\").map(v=>v.name);\n        stepExecution.executionContext.put(\"variableNames\", variableNames);\n        let data = stepExecution.getData();\n\n        let treeRoot = data.getRoots()[0];\n        let payoff = treeRoot.computedValue(ruleName, 'payoff');\n\n        this.expressionsEvaluator.clear(data);\n        this.expressionsEvaluator.evalExpressions(data);\n\n        this.objectiveRulesManager.recomputeTree(treeRoot, false);\n\n        let policiesCollector = new PoliciesCollector(treeRoot, ruleName);\n\n        let defaultValues = {};\n        Utils.forOwn(data.expressionScope, (v,k)=>{\n            defaultValues[k]=this.toFloat(v);\n        });\n\n\n        let percentageRangeValues = ComputationsUtils.sequence(-percentageChangeRange, percentageChangeRange, 2*length+1);\n\n        let variableValues = [];\n\n        variables.forEach(v=> {\n            let defVal = defaultValues[v.name];\n            variableValues.push(percentageRangeValues.map(p=> this.toFloat(ExpressionEngine.add(defVal, ExpressionEngine.multiply(ExpressionEngine.divide(p,100), defVal)))));\n        });\n\n\n        if(!jobResult.data){\n            jobResult.data = {\n                variableNames: variableNames,\n                defaultValues: defaultValues,\n                percentageRangeValues: percentageRangeValues,\n                defaultPayoff: this.toFloat(payoff)[0],\n                policies: policiesCollector.policies,\n                rows: []\n            };\n        }\n\n        stepExecution.getJobExecutionContext().put(\"variableValues\", variableValues);\n        return variableValues.length;\n    }\n\n\n    readNextChunk(stepExecution, startIndex, chunkSize) {\n        let variableValues = stepExecution.getJobExecutionContext().get(\"variableValues\");\n        return variableValues.slice(startIndex, startIndex + chunkSize);\n    }\n\n    processItem(stepExecution, item, itemIndex, jobResult) {\n        let params = stepExecution.getJobParameters();\n        let ruleName = params.value(\"ruleName\");\n        let failOnInvalidTree = params.value(\"failOnInvalidTree\");\n        let data = stepExecution.getData();\n        let treeRoot = data.getRoots()[0];\n        let variableNames = stepExecution.executionContext.get(\"variableNames\");\n        let variableName = variableNames[itemIndex];\n\n\n        let payoffs = jobResult.data.policies.map(policy=>[]);\n\n        this.expressionsEvaluator.clear(data);\n        this.expressionsEvaluator.evalGlobalCode(data);\n\n\n        item.forEach(variableValue=>{\n\n            data.expressionScope[variableName] = variableValue;\n\n            this.expressionsEvaluator.evalExpressionsForNode(data, treeRoot);\n            let vr = this.treeValidator.validate(data.getAllNodesInSubtree(treeRoot));\n            let valid = vr.isValid();\n\n            if(!valid && failOnInvalidTree){\n                let errorData = {\n                    variables: {}\n                };\n                errorData.variables[variableName] = variableValue;\n\n                throw new JobComputationException(\"computations\", errorData)\n            }\n\n            jobResult.data.policies.forEach((policy, policyIndex)=>{\n                this.objectiveRulesManager.recomputeTree(treeRoot, false, policy);\n                let payoff = treeRoot.computedValue(ruleName, 'payoff')[0];\n                payoffs[policyIndex].push(this.toFloat(payoff));\n            });\n\n        });\n\n        return {\n            variableName: variableName,\n            variableIndex: itemIndex,\n            variableValues: item,\n            payoffs: payoffs\n        };\n\n    }\n\n    writeChunk(stepExecution, items, jobResult) {\n        jobResult.data.rows.push(...items);\n    }\n\n\n    toFloat(v){\n        return ExpressionEngine.toFloat(v);\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {JobComputationException} from \"../../../../engine/exceptions/job-computation-exception\";\nimport {BatchStep} from \"../../../../engine/batch/batch-step\";\nimport {TreeValidator} from \"../../../../../validation/tree-validator\";\nimport {Policy} from \"../../../../../policies/policy\";\nimport {PoliciesCollector} from \"../../../../../policies/policies-collector\";\n\nexport class CalculateStep extends BatchStep {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"calculate_step\", jobRepository, 1);\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n        this.treeValidator = new TreeValidator();\n    }\n\n    init(stepExecution, jobResult) {\n        let jobExecutionContext = stepExecution.getJobExecutionContext();\n        let params = stepExecution.getJobParameters();\n        let ruleName = params.value(\"ruleName\");\n\n        this.objectiveRulesManager.setCurrentRuleByName(ruleName);\n        let variableValues = jobExecutionContext.get(\"variableValues\");\n        let variableNames = params.value(\"variables\").map(v=>v.name);\n        stepExecution.executionContext.put(\"variableNames\", variableNames);\n        let data = stepExecution.getData();\n\n        let treeRoot = data.getRoots()[0];\n        let payoff = treeRoot.computedValue(ruleName, 'payoff');\n\n        this.expressionsEvaluator.clear(data);\n        this.expressionsEvaluator.evalExpressions(data);\n\n        this.objectiveRulesManager.recomputeTree(treeRoot, false);\n\n\n\n        let policiesCollector = new PoliciesCollector(treeRoot, ruleName);\n\n        let defaultValues = {};\n        Utils.forOwn(data.expressionScope, (v,k)=>{\n            defaultValues[k]=this.toFloat(v);\n        });\n\n        if(!jobResult.data){\n            jobResult.data = {\n                variableNames: variableNames,\n                defaultValues: defaultValues,\n                variableExtents: variableValues.map(v=>[v[0], v[v.length-1]]),\n                defaultPayoff: this.toFloat(payoff)[0],\n                policies: policiesCollector.policies,\n                rows: []\n            };\n        }\n\n        return variableValues.length;\n    }\n\n\n    readNextChunk(stepExecution, startIndex, chunkSize) {\n        let variableValues = stepExecution.getJobExecutionContext().get(\"variableValues\");\n        return variableValues.slice(startIndex, startIndex + chunkSize);\n    }\n\n    processItem(stepExecution, item, itemIndex, jobResult) {\n        let params = stepExecution.getJobParameters();\n        let ruleName = params.value(\"ruleName\");\n        let failOnInvalidTree = params.value(\"failOnInvalidTree\");\n        let data = stepExecution.getData();\n        let treeRoot = data.getRoots()[0];\n        let variableNames = stepExecution.executionContext.get(\"variableNames\");\n        let variableName = variableNames[itemIndex];\n\n        let extents = jobResult.data.policies.map(policy=>{\n            return {\n                min: Infinity,\n                max: -Infinity\n            }\n        });\n\n        let values = jobResult.data.policies.map(policy=>{\n            return {\n                min: null,\n                max: null\n            }\n        });\n\n        this.expressionsEvaluator.clear(data);\n        this.expressionsEvaluator.evalGlobalCode(data);\n\n\n        item.forEach(variableValue=>{\n\n            data.expressionScope[variableName] = variableValue;\n\n            this.expressionsEvaluator.evalExpressionsForNode(data, treeRoot);\n            let vr = this.treeValidator.validate(data.getAllNodesInSubtree(treeRoot));\n            let valid = vr.isValid();\n\n            if(!valid && failOnInvalidTree){\n                let errorData = {\n                    variables: {}\n                };\n                errorData.variables[variableName] = variableValue;\n\n                throw new JobComputationException(\"computations\", errorData)\n            }\n\n            jobResult.data.policies.forEach((policy, policyIndex)=>{\n                this.objectiveRulesManager.recomputeTree(treeRoot, false, policy);\n                let payoff = treeRoot.computedValue(ruleName, 'payoff')[0];\n\n                if(payoff < extents[policyIndex].min){\n                    extents[policyIndex].min = payoff;\n                    values[policyIndex].min = variableValue\n                }\n\n                if(payoff > extents[policyIndex].max){\n                    extents[policyIndex].max = payoff;\n                    values[policyIndex].max = variableValue\n                }\n            });\n\n        });\n\n        return {\n            variableName: variableName,\n            variableIndex: itemIndex,\n            extents: extents.map(e=>[this.toFloat(e.min), this.toFloat(e.max)]),\n            extentVariableValues: values.map(v=>[this.toFloat(v.min), this.toFloat(v.max)])\n        };\n\n    }\n\n    writeChunk(stepExecution, items, jobResult) {\n        jobResult.data.rows.push(...items);\n    }\n\n    postProcess(stepExecution, jobResult) {\n        jobResult.data.rows.sort((a, b)=>(b.extents[0][1]-b.extents[0][0])-(a.extents[0][1]-a.extents[0][0]))\n\n    }\n\n\n    toFloat(v){\n        return ExpressionEngine.toFloat(v);\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {Step} from \"../../../../engine/step\";\nimport {JOB_STATUS} from \"../../../../engine/job-status\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {ComputationsUtils} from \"../../../../../computations-utils\";\n\nexport class PrepareVariablesStep extends Step {\n    constructor(jobRepository) {\n        super(\"prepare_variables\", jobRepository);\n    }\n\n    doExecute(stepExecution) {\n        var params = stepExecution.getJobParameters();\n        var variables = params.value(\"variables\");\n\n        var variableValues = [];\n        variables.forEach(v=> {\n            variableValues.push(ComputationsUtils.sequence(v.min, v.max, v.length));\n        });\n        stepExecution.getJobExecutionContext().put(\"variableValues\", variableValues);\n\n        stepExecution.exitStatus = JOB_STATUS.COMPLETED;\n        return stepExecution;\n    }\n\n}\n","import {Utils} from \"sd-utils\";\nimport {JobParameters} from \"../../../engine/job-parameters\";\nimport {JobParameterDefinition, PARAMETER_TYPE} from \"../../../engine/job-parameter-definition\";\nexport class TornadoDiagramJobParameters extends JobParameters {\n\n    initDefinitions() {\n        this.definitions.push(new JobParameterDefinition(\"id\", PARAMETER_TYPE.STRING, 1, 1, true));\n        this.definitions.push(new JobParameterDefinition(\"ruleName\", PARAMETER_TYPE.STRING));\n        this.definitions.push(new JobParameterDefinition(\"variables\", [\n                new JobParameterDefinition(\"name\", PARAMETER_TYPE.STRING),\n                new JobParameterDefinition(\"min\", PARAMETER_TYPE.NUMBER),\n                new JobParameterDefinition(\"max\", PARAMETER_TYPE.NUMBER),\n                new JobParameterDefinition(\"length\", PARAMETER_TYPE.INTEGER).set(\"singleValueValidator\", v => v >= 0),\n            ], 1, Infinity, false,\n            v => v[\"min\"] <= v[\"max\"],\n            values => Utils.isUnique(values, v=>v[\"name\"]) //Variable names should be unique\n        ));\n        this.definitions.push(new JobParameterDefinition(\"failOnInvalidTree\", PARAMETER_TYPE.BOOLEAN));\n    }\n\n    initDefaultValues() {\n        this.values = {\n            id: Utils.guid(),\n            failOnInvalidTree: true\n        }\n    }\n}\n","import {SimpleJob} from \"../../../engine/simple-job\";\nimport {PrepareVariablesStep} from \"./steps/prepare-variables-step\";\nimport {CalculateStep} from \"./steps/calculate-step\";\nimport {TornadoDiagramJobParameters} from \"./tornado-diagram-job-parameters\";\n\nexport class TornadoDiagramJob extends SimpleJob {\n\n    constructor(jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(\"tornado-diagram\", jobRepository);\n        this.addStep(new PrepareVariablesStep(jobRepository));\n        this.addStep(new CalculateStep(jobRepository, expressionsEvaluator, objectiveRulesManager));\n    }\n\n    createJobParameters(values) {\n        return new TornadoDiagramJobParameters(values);\n    }\n\n    getJobDataValidator() {\n        return {\n            validate: (data) => data.getRoots().length === 1\n        }\n    }\n\n\n    /*Should return progress object with fields:\n     * current\n     * total */\n    getProgress(execution){\n\n        if (execution.stepExecutions.length <= 1) {\n            return {\n                total: 1,\n                current: 0\n            };\n        }\n\n        return this.steps[1].getProgress(execution.stepExecutions[1]);\n    }\n\n    jobResultToCsvRows(jobResult, jobParameters, withHeaders=true){\n        let result = [];\n        if(withHeaders){\n            result.push(['variable_name', 'default_var_value', \"min_var_value\", \"max_var_value\", 'default_payoff', \"min_payoff\", \"max_payoff\", \"policy_no\"]);\n        }\n\n\n        jobResult.rows.forEach((row, index) => {\n\n            result.push(...row.extents.map((extent, policyIndex)=>[\n                row.variableName,\n                jobResult.defaultValues[row.variableName],\n                row.extentVariableValues[policyIndex][0],\n                row.extentVariableValues[policyIndex][1],\n                jobResult.defaultPayoff,\n                extent[0],\n                extent[1],\n                policyIndex+1\n            ]));\n\n        });\n\n\n        return result;\n    }\n}\n","import {JOB_STATUS} from \"../job-status\";\nimport {log} from 'sd-utils'\nimport {Step} from \"../step\";\nimport {JobInterruptedException} from \"../exceptions/job-interrupted-exception\";\n\n/*job step that process batch of items*/\nexport class BatchStep extends Step {\n\n    chunkSize;\n    static CURRENT_ITEM_COUNT_PROP = 'batch_step_current_item_count';\n    static TOTAL_ITEM_COUNT_PROP = 'batch_step_total_item_count';\n\n    constructor(name, jobRepository, chunkSize) {\n        super(name, jobRepository);\n        this.chunkSize = chunkSize;\n    }\n\n    /**\n     * Extension point for subclasses to perform step initialization. Should return total item count\n     */\n    init(stepExecution, jobResult) {\n        throw \"BatchStep.init function not implemented for step: \" + this.name;\n    }\n\n    /**\n     * Extension point for subclasses to read and return chunk of items to process\n     */\n    readNextChunk(stepExecution, startIndex, chunkSize, jobResult) {\n        throw \"BatchStep.readNextChunk function not implemented for step: \" + this.name;\n    }\n\n    /**\n     * Extension point for subclasses to process single item\n     * Must return processed item which will be passed in a chunk to writeChunk function\n     */\n    processItem(stepExecution, item, currentItemCount, jobResult) {\n        throw \"BatchStep.processItem function not implemented for step: \" + this.name;\n    }\n\n    /**\n     * Extension point for subclasses to write chunk of items. Not required\n     */\n    writeChunk(stepExecution, items, jobResult) {\n    }\n\n    /**\n     * Extension point for subclasses to perform postprocessing after all items have been processed. Not required\n     */\n    postProcess(stepExecution, jobResult) {\n    }\n\n\n    setTotalItemCount(stepExecution, count) {\n        stepExecution.executionContext.put(BatchStep.TOTAL_ITEM_COUNT_PROP, count);\n    }\n\n    getTotalItemCount(stepExecution) {\n        return stepExecution.executionContext.get(BatchStep.TOTAL_ITEM_COUNT_PROP);\n    }\n\n    setCurrentItemCount(stepExecution, count) {\n        stepExecution.executionContext.put(BatchStep.CURRENT_ITEM_COUNT_PROP, count);\n    }\n\n    getCurrentItemCount(stepExecution) {\n        return stepExecution.executionContext.get(BatchStep.CURRENT_ITEM_COUNT_PROP) || 0;\n    }\n\n\n    doExecute(stepExecution, jobResult) {\n        return Promise.resolve().then(()=> {\n            return this.init(stepExecution, jobResult)\n        }).catch(e=> {\n            log.error(\"Failed to initialize batch step: \" + this.name, e);\n            throw e;\n        }).then(totalItemCount=> {\n            return Promise.resolve().then(()=>{\n                this.setCurrentItemCount(stepExecution, this.getCurrentItemCount(stepExecution));\n                this.setTotalItemCount(stepExecution, totalItemCount);\n                return this.handleNextChunk(stepExecution, jobResult)\n            }).catch(e=> {\n                if(!(e instanceof JobInterruptedException)){\n                    log.error(\"Failed to handle batch step: \" + this.name, e);\n                }\n                throw e;\n            })\n        }).then(()=> {\n            return Promise.resolve().then(()=>{\n                return this.postProcess(stepExecution, jobResult)\n            }).catch(e=> {\n                log.error(\"Failed to postProcess batch step: \" + this.name, e);\n                throw e;\n            })\n        }).then(()=> {\n            stepExecution.exitStatus = JOB_STATUS.COMPLETED;\n            return stepExecution;\n        })\n\n    }\n\n    handleNextChunk(stepExecution, jobResult) {\n        var currentItemCount = this.getCurrentItemCount(stepExecution);\n        var totalItemCount = this.getTotalItemCount(stepExecution);\n        var chunkSize = Math.min(this.chunkSize, totalItemCount - currentItemCount);\n        if (currentItemCount >= totalItemCount) {\n            return stepExecution;\n        }\n        return this.checkJobExecutionFlags(stepExecution).then(()=> {\n            // Check if someone is trying to stop us\n            if (stepExecution.terminateOnly) {\n                throw new JobInterruptedException(\"JobExecution interrupted.\");\n            }\n            return stepExecution\n        }).then(()=> {\n            return Promise.resolve().then(()=>{\n                return this.readNextChunk(stepExecution, currentItemCount, chunkSize, jobResult)\n            }).catch(e=> {\n                log.error(\"Failed to read chunk (\" + currentItemCount + \",\" + chunkSize + \") in batch step: \" + this.name, e);\n                throw e;\n            });\n        }).then(chunk=> {\n            return Promise.resolve().then(()=>{\n                return this.processChunk(stepExecution, chunk, currentItemCount, jobResult)\n            }).catch(e=> {\n                log.error(\"Failed to process chunk (\" + currentItemCount + \",\" + chunkSize + \") in batch step: \" + this.name, e);\n                throw e;\n            })\n        }).then(processedChunk=> {\n            return Promise.resolve().then(()=>{\n                return this.writeChunk(stepExecution, processedChunk, jobResult)\n            }).catch(e=> {\n                log.error(\"Failed to write chunk (\" + currentItemCount + \",\" + chunkSize + \") in batch step: \" + this.name, e);\n                throw e;\n            })\n        }).then((res)=> {\n            currentItemCount += chunkSize;\n            this.setCurrentItemCount(stepExecution, currentItemCount);\n            return this.updateJobProgress(stepExecution).then(()=> {\n                return this.handleNextChunk(stepExecution, jobResult);\n            });\n        })\n    }\n\n    processChunk(stepExecution, chunk, currentItemCount, jobResult) { //TODO promisify\n        return chunk.map((item, i)=>this.processItem(stepExecution, item, currentItemCount+i, jobResult));\n    }\n\n    /*Should return progress object with fields:\n     * current\n     * total */\n    getProgress(stepExecution){\n        return {\n            total: this.getTotalItemCount(stepExecution),\n            current: this.getCurrentItemCount(stepExecution)\n        }\n    }\n\n    updateJobProgress(stepExecution) {\n        var progress = this.jobRepository.getJobByName(stepExecution.jobExecution.jobInstance.jobName).getProgress(stepExecution.jobExecution);\n        return this.jobRepository.updateJobExecutionProgress(stepExecution.jobExecution.id, progress);\n    }\n\n    checkJobExecutionFlags(stepExecution){\n        return this.jobRepository.getJobByName(stepExecution.jobExecution.jobInstance.jobName).checkExecutionFlags(stepExecution.jobExecution);\n    }\n}\n","export class ExtendableError {\n    data;\n    constructor(message, data) {\n        this.message = message;\n        this.data = data;\n        this.name = this.constructor.name;\n    }\n}\n","export * from './extendable-error'\nexport * from './job-data-invalid-exception'\nexport * from './job-execution-already-running-exception'\nexport * from './job-instance-already-complete-exception'\nexport * from './job-interrupted-exception'\nexport * from './job-parameters-invalid-exception'\nexport * from './job-restart-exception'\n\n\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobComputationException extends ExtendableError {\n}\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobDataInvalidException extends ExtendableError {\n}\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobExecutionAlreadyRunningException extends ExtendableError {\n}\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobInstanceAlreadyCompleteException extends ExtendableError {\n}\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobInterruptedException extends ExtendableError {\n}\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobParametersInvalidException extends ExtendableError {\n}\n","import {ExtendableError} from \"./extendable-error\";\nexport class JobRestartException extends ExtendableError {\n}\n","import {Utils} from \"sd-utils\";\n\nexport class ExecutionContext {\n\n    dirty = false;\n    context = {};\n\n    constructor(context) {\n        if (context) {\n            this.context = Utils.clone(context)\n        }\n    }\n\n    put(key, value) {\n        var prevValue = this.context[key];\n        if (value != null) {\n            var result = this.context[key] = value;\n            this.dirty = prevValue == null || prevValue != null && prevValue != value;\n        }\n        else {\n            delete this.context[key];\n            this.dirty = prevValue != null;\n        }\n    }\n\n    get(key) {\n        return this.context[key];\n    }\n\n    containsKey(key) {\n        return this.context.hasOwnProperty(key);\n    }\n\n    remove(key) {\n        delete this.context[key];\n    }\n\n    setData(data) { //set data model\n        return this.put(\"data\", data);\n    }\n\n    getData() { // get data model\n        return this.get(\"data\");\n    }\n\n    getDTO() {\n        var dto = Utils.cloneDeep(this);\n        var data = this.getData();\n        if (data) {\n            data = data.getDTO();\n            dto.context[\"data\"] = data;\n        }\n        return dto;\n    }\n\n}\n","import * as exceptions from './exceptions'\n\nexport {exceptions}\nexport * from './execution-context'\nexport * from './job'\nexport * from './job-execution'\nexport * from './job-execution-flag'\nexport * from './job-execution-listener'\nexport * from './job-instance'\nexport * from './job-key-generator'\nexport * from './job-launcher'\nexport * from './job-parameter-definition'\nexport * from './job-parameters'\nexport * from './job-status'\nexport * from './simple-job'\nexport * from './step'\nexport * from './step-execution'\nexport * from './step-execution-listener'\n\n\n\n\n","export const JOB_EXECUTION_FLAG = {\n    STOP: 'STOP'\n};\n","export class JobExecutionListener {\n    /*Called before a job executes*/\n    beforeJob(jobExecution) {\n\n    }\n\n    /*Called after completion of a job. Called after both successful and failed executions*/\n    afterJob(jobExecution) {\n\n    }\n}\n","import {JOB_STATUS} from \"./job-status\";\nimport {StepExecution} from \"./step-execution\";\nimport {Utils} from \"sd-utils\";\nimport {ExecutionContext} from \"./execution-context\";\n\n/*domain object representing the execution of a job.*/\nexport class JobExecution {\n    id;\n    jobInstance;\n    jobParameters;\n    stepExecutions = [];\n    status = JOB_STATUS.STARTING;\n    exitStatus = JOB_STATUS.UNKNOWN;\n    executionContext = new ExecutionContext();\n\n    startTime = null;\n    createTime = new Date();\n    endTime = null;\n    lastUpdated = null;\n\n    failureExceptions = [];\n\n    constructor(jobInstance, jobParameters, id) {\n        if(id===null || id === undefined){\n            this.id = Utils.guid();\n        }else{\n            this.id = id;\n        }\n\n        this.jobInstance = jobInstance;\n        this.jobParameters = jobParameters;\n    }\n\n    /**\n     * Register a step execution with the current job execution.\n     * @param stepName the name of the step the new execution is associated with\n     */\n    createStepExecution(stepName) {\n        var stepExecution = new StepExecution(stepName, this);\n        this.stepExecutions.push(stepExecution);\n        return stepExecution;\n    }\n\n    isRunning() {\n        return !this.endTime;\n    }\n\n    /**\n     * Test if this JobExecution has been signalled to\n     * stop.\n     */\n    isStopping() {\n        return this.status === JOB_STATUS.STOPPING;\n    }\n\n    /**\n     * Signal the JobExecution to stop.\n     */\n    stop() {\n        this.stepExecutions.forEach(se=> {\n            se.terminateOnly = true;\n        });\n        this.status = JOB_STATUS.STOPPING;\n    }\n\n    getData() {\n        return this.executionContext.getData();\n    }\n\n    getDTO(filteredProperties = [], deepClone = true) {\n        var cloneMethod = Utils.cloneDeepWith;\n        if (!deepClone) {\n            cloneMethod = Utils.cloneWith;\n        }\n\n        return Utils.assign({}, cloneMethod(this, (value, key, object, stack)=> {\n            if (filteredProperties.indexOf(key) > -1) {\n                return null;\n            }\n\n            if ([\"jobParameters\", \"executionContext\"].indexOf(key) > -1) {\n                return value.getDTO()\n            }\n            if (value instanceof Error) {\n                return Utils.getErrorDTO(value);\n            }\n\n            if (value instanceof StepExecution) {\n                return value.getDTO([\"jobExecution\"], deepClone)\n            }\n        }))\n    }\n}\n","/* object representing a uniquely identifiable job run. JobInstance can be restarted multiple times in case of execution failure and it's lifecycle ends with first successful execution*/\nexport class JobInstance{\n\n    id;\n    jobName;\n    constructor(id, jobName){\n        this.id = id;\n        this.jobName = jobName;\n    }\n\n}\n","\nexport class JobKeyGenerator {\n    /*Method to generate the unique key used to identify a job instance.*/\n    static generateKey(jobParameters) {\n        var result = \"\";\n        jobParameters.definitions.forEach((d, i)=> {\n            if(d.identifying){\n                result += d.name + \"=\" + jobParameters.values[d.name] + \";\";\n            }\n        });\n        return result;\n    }\n}\n","import {JobRestartException} from \"./exceptions/job-restart-exception\";\nimport {JOB_STATUS} from \"./job-status\";\nimport {Utils, log} from \"sd-utils\";\nimport {JobParametersInvalidException} from \"./exceptions/job-parameters-invalid-exception\";\nimport {JobDataInvalidException} from \"./exceptions/job-data-invalid-exception\";\n\nexport class JobLauncher {\n\n    jobRepository;\n    jobWorker;\n\n    constructor(jobRepository, jobWorker, dataModelSerializer) {\n        this.jobRepository = jobRepository;\n        this.jobWorker = jobWorker;\n        this.dataModelSerializer = dataModelSerializer;\n    }\n\n\n    run(jobOrName, jobParametersValues, data, resolvePromiseAfterJobIsLaunched = true) {\n        var job;\n        var jobParameters;\n\n        return Promise.resolve().then(()=> {\n            if (Utils.isString(jobOrName)) {\n                job = this.jobRepository.getJobByName(jobOrName)\n            } else {\n                job = jobOrName;\n            }\n            if (!job) {\n                throw new JobRestartException(\"No such job: \" + jobOrName);\n            }\n\n            jobParameters = job.createJobParameters(jobParametersValues);\n\n            return this.validate(job, jobParameters, data);\n        }).then(valid=>{\n            return this.jobRepository.createJobExecution(job.name, jobParameters, data).then(jobExecution=>{\n\n\n                if(this.jobWorker){\n                    log.debug(\"Job: [\" + job.name + \"] execution [\"+jobExecution.id+\"] delegated to worker\");\n                    this.jobWorker.executeJob(jobExecution.id);\n                    return jobExecution;\n                }\n\n                var executionPromise = this._execute(job, jobExecution);\n                if(resolvePromiseAfterJobIsLaunched){\n                    return jobExecution;\n                }\n                return executionPromise;\n            })\n        })\n    }\n\n    validate(job, jobParameters, data){\n        return this.jobRepository.getLastJobExecution(job.name, jobParameters).then(lastExecution=>{\n            if (lastExecution != null) {\n                if (!job.isRestartable) {\n                    throw new JobRestartException(\"JobInstance already exists and is not restartable\");\n                }\n\n                lastExecution.stepExecutions.forEach(execution=> {\n                    if (execution.status == JOB_STATUS.UNKNOWN) {\n                        throw new JobRestartException(\"Step [\" + execution.stepName + \"] is of status UNKNOWN\");\n                    }\n                });\n            }\n            if (job.jobParametersValidator && !job.jobParametersValidator.validate(jobParameters)) {\n                throw new JobParametersInvalidException(\"Invalid job parameters in jobLauncher.run for job: \"+job.name)\n            }\n\n            if(job.jobDataValidator && !job.jobDataValidator.validate(data)){\n                throw new JobDataInvalidException(\"Invalid job data in jobLauncher.run for job: \"+job.name)\n            }\n\n            return true;\n        })\n    }\n\n    /**Execute previously created job execution*/\n    execute(jobExecutionOrId){\n\n        return Promise.resolve().then(()=>{\n            if(Utils.isString(jobExecutionOrId)){\n                return this.jobRepository.getJobExecutionById(jobExecutionOrId);\n            }\n            return jobExecutionOrId;\n        }).then(jobExecution=>{\n            if(!jobExecution){\n                throw new JobRestartException(\"JobExecution [\" + jobExecutionOrId + \"] is not found\");\n            }\n\n            if (jobExecution.status !== JOB_STATUS.STARTING) {\n                throw new JobRestartException(\"JobExecution [\" + jobExecution.id + \"] already started\");\n            }\n\n            var jobName = jobExecution.jobInstance.jobName;\n            var job = this.jobRepository.getJobByName(jobName);\n            if(!job){\n                throw new JobRestartException(\"No such job: \" + jobName);\n            }\n\n            return  this._execute(job, jobExecution);\n        })\n    }\n\n    _execute(job, jobExecution){\n        var jobName = job.name;\n        log.info(\"Job: [\" + jobName + \"] launched with the following parameters: [\" + jobExecution.jobParameters + \"]\", jobExecution.getData());\n        return job.execute(jobExecution).then(jobExecution=>{\n            log.info(\"Job: [\" + jobName + \"] completed with the following parameters: [\" + jobExecution.jobParameters + \"] and the following status: [\" + jobExecution.status + \"]\");\n            return jobExecution;\n        }).catch(e =>{\n            log.error(\"Job: [\" + jobName + \"] failed unexpectedly and fatally with the following parameters: [\" + jobExecution.jobParameters + \"]\", e);\n            throw e;\n        })\n    }\n}\n","import {PARAMETER_TYPE} from \"./job-parameter-definition\";\nimport {Utils} from \"sd-utils\";\n\nexport class JobParameters{\n    definitions = [];\n    values={};\n\n    constructor(values){\n        this.initDefinitions();\n        this.initDefaultValues();\n        if (values) {\n            Utils.deepExtend(this.values, values);\n        }\n    }\n\n    initDefinitions(){\n\n    }\n\n    initDefaultValues(){\n\n    }\n\n    validate(){\n        return this.definitions.every((def, i)=>def.validate(this.values[def.name], this.values));\n    }\n\n    getDefinition(path){\n        var defs =this.definitions;\n        let def = null;\n        if(!path.split().every(name=>{\n                def = Utils.find(defs, d=>d.name == name);\n                if(!def){\n                    return false\n                }\n                defs = def.nestedParameters;\n                return true;\n        })){\n            return null;\n        }\n        return def;\n    }\n\n    /*get or set value by path*/\n    value(path, value){\n        if (arguments.length === 1) {\n            let def = this.getDefinition(path);\n            let val = Utils.get(this.values, path, null);\n            if(def){\n                return def.value(val);\n            }\n            return  val;\n        }\n        Utils.set(this.values, path, value);\n        return value;\n    }\n\n    toString(){\n        var result = \"JobParameters[\";\n\n        this.definitions.forEach((d, i)=> {\n\n            var val = this.values[d.name];\n            // if(Utils.isArray(val)){\n            //     var values = val;\n            //\n            //\n            // }\n            // if(PARAMETER_TYPE.COMPOSITE == d.type){\n            //\n            // }\n\n            result += d.name + \"=\"+val + \";\";\n        });\n        result+=\"]\";\n        return result;\n    }\n\n    getDTO(){\n        return {\n            values: this.values\n        }\n    }\n}\n","import {JobRepository} from \"./job-repository\";\nimport {default as idb} from \"idb\";\nimport {Utils} from \"sd-utils\";\nimport {JobExecution} from \"../job-execution\";\nimport {JobInstance} from \"../job-instance\";\nimport {StepExecution} from \"../step-execution\";\nimport {ExecutionContext} from \"../execution-context\";\nimport {DataModel} from \"sd-model\";\nimport {log} from \"sd-utils\";\n\n/* IndexedDB job repository*/\nexport class IdbJobRepository extends JobRepository {\n\n    dbPromise;\n    jobInstanceDao;\n    jobExecutionDao;\n    stepExecutionDao;\n    jobResultDao;\n    jobExecutionProgressDao;\n    jobExecutionFlagDao;\n\n    constructor(expressionsReviver, dbName = 'sd-job-repository', deleteDB = false) {\n        super();\n        this.dbName = dbName;\n        this.expressionsReviver = expressionsReviver;\n        if (deleteDB) {\n            this.deleteDB().then(()=> {\n                this.initDB()\n            }).catch(e=> {\n                log.error(e);\n                this.initDB();\n            })\n        } else {\n            this.initDB()\n        }\n    }\n\n    initDB() {\n        this.dbPromise = idb.open(this.dbName, 2, upgradeDB => {\n            // Note: we don't use 'break' in this switch statement,\n            // the fall-through behaviour is what we want.\n            switch (upgradeDB.oldVersion) {\n                case 0:\n                    upgradeDB.createObjectStore('job-instances');\n                    var jobExecutionsOS = upgradeDB.createObjectStore('job-executions');\n                    jobExecutionsOS.createIndex(\"jobInstanceId\", \"jobInstance.id\", {unique: false});\n                    jobExecutionsOS.createIndex(\"createTime\", \"createTime\", {unique: false});\n                    jobExecutionsOS.createIndex(\"status\", \"status\", {unique: false});\n                    upgradeDB.createObjectStore('job-execution-progress');\n                    upgradeDB.createObjectStore('job-execution-flags');\n                    var stepExecutionsOS = upgradeDB.createObjectStore('step-executions');\n                    stepExecutionsOS.createIndex(\"jobExecutionId\", \"jobExecutionId\", {unique: false});\n\n                    var jobResultOS = upgradeDB.createObjectStore('job-results');\n                    jobResultOS.createIndex(\"jobInstanceId\", \"jobInstance.id\", {unique: true});\n                case 1:\n                    upgradeDB.transaction.objectStore('job-instances').createIndex(\"id\", \"id\", {unique: true});\n            }\n\n        });\n\n        this.jobInstanceDao = new ObjectStoreDao('job-instances', this.dbPromise);\n        this.jobExecutionDao = new ObjectStoreDao('job-executions', this.dbPromise);\n        this.jobExecutionProgressDao = new ObjectStoreDao('job-execution-progress', this.dbPromise);\n        this.jobExecutionFlagDao = new ObjectStoreDao('job-execution-flags', this.dbPromise);\n        this.stepExecutionDao = new ObjectStoreDao('step-executions', this.dbPromise);\n        this.jobResultDao = new ObjectStoreDao('job-results', this.dbPromise);\n    }\n\n    deleteDB() {\n        return Promise.resolve().then(_=>idb.delete(this.dbName));\n    }\n\n\n    removeJobInstance(jobInstance, jobParameters){\n        var key = this.generateJobInstanceKey(jobInstance.jobName, jobParameters);\n        return this.jobInstanceDao.remove(key).then(()=>{\n            this.findJobExecutions(jobInstance, false).then(jobExecutions=>{  //  Not waiting for promise resolves\n                jobExecutions.forEach(this.removeJobExecution, this);\n            });\n\n            this.getJobResultByInstance(jobInstance).then(jobResult=>{\n                return this.removeJobResult(jobResult)\n            })\n        });\n    }\n\n    removeJobExecution(jobExecution){\n        return this.jobExecutionDao.remove(jobExecution.id).then(()=>{\n            return this.findStepExecutions(jobExecution.id, false).then(stepExecutions=>{  // Not waiting for promise resolves\n                stepExecutions.forEach(this.removeStepExecution, this);\n            });\n        });\n    }\n\n    removeStepExecution(stepExecution){\n        return this.stepExecutionDao.remove(stepExecution.id)\n    }\n\n    removeJobResult(jobResult){\n        return this.jobResultDao.remove(jobResult.id);\n    }\n\n\n\n\n    getJobResult(jobResultId) {\n        return this.jobResultDao.get(jobResultId);\n    }\n\n    getJobResultByInstance(jobInstance) {\n        return this.jobResultDao.getByIndex(\"jobInstanceId\", jobInstance.id);\n    }\n\n    saveJobResult(jobResult) {\n        return this.jobResultDao.set(jobResult.id, jobResult).then(r=>jobResult);\n    }\n\n    /*returns promise*/\n    getJobInstance(jobName, jobParameters) {\n        var key = this.generateJobInstanceKey(jobName, jobParameters);\n        return this.jobInstanceDao.get(key).then(dto=>dto ? this.reviveJobInstance(dto) : dto);\n    }\n\n    /*should return promise that resolves to saved instance*/\n    saveJobInstance(jobInstance, jobParameters) {\n        var key = this.generateJobInstanceKey(jobInstance.jobName, jobParameters);\n        return this.jobInstanceDao.set(key, jobInstance).then(r=>jobInstance);\n    }\n\n    /*should return promise that resolves to saved jobExecution*/\n    saveJobExecution(jobExecution) {\n        var dto = jobExecution.getDTO();\n        var stepExecutionsDTOs = dto.stepExecutions;\n        dto.stepExecutions = null;\n        return this.jobExecutionDao.set(jobExecution.id, dto).then(r=>this.saveStepExecutionsDTOS(stepExecutionsDTOs)).then(r=>jobExecution);\n    }\n\n    updateJobExecutionProgress(jobExecutionId, progress) {\n        return this.jobExecutionProgressDao.set(jobExecutionId, progress)\n    }\n\n    getJobExecutionProgress(jobExecutionId) {\n        return this.jobExecutionProgressDao.get(jobExecutionId)\n    }\n\n    saveJobExecutionFlag(jobExecutionId, flag) {\n        return this.jobExecutionFlagDao.set(jobExecutionId, flag)\n    }\n\n    getJobExecutionFlag(jobExecutionId) {\n        return this.jobExecutionFlagDao.get(jobExecutionId)\n    }\n\n    /*should return promise which resolves to saved stepExecution*/\n    saveStepExecution(stepExecution) {\n        var dto = stepExecution.getDTO([\"jobExecution\"]);\n        return this.stepExecutionDao.set(stepExecution.id, dto).then(r=>stepExecution);\n    }\n\n    saveStepExecutionsDTOS(stepExecutions, savedExecutions = []) {\n        if (stepExecutions.length <= savedExecutions.length) {\n            return Promise.resolve(savedExecutions);\n        }\n        var stepExecutionDTO = stepExecutions[savedExecutions.length];\n        return this.stepExecutionDao.set(stepExecutionDTO.id, stepExecutionDTO).then(()=> {\n            savedExecutions.push(stepExecutionDTO);\n            return this.saveStepExecutionsDTOS(stepExecutions, savedExecutions);\n        });\n    }\n\n    getJobExecutionById(id) {\n        return this.jobExecutionDao.get(id).then(dto=> {\n            return this.fetchJobExecutionRelations(dto);\n        });\n    }\n\n    fetchJobExecutionRelations(jobExecutionDTO, revive = true) {\n        if (!jobExecutionDTO) {\n            return Promise.resolve(null)\n        }\n        return this.findStepExecutions(jobExecutionDTO.id, false).then(steps=> {\n            jobExecutionDTO.stepExecutions = steps;\n            if (!revive) {\n                return jobExecutionDTO;\n            }\n            return this.reviveJobExecution(jobExecutionDTO);\n        })\n    }\n\n    fetchJobExecutionsRelations(jobExecutionDtoList, revive = true, fetched = []) {\n        if (jobExecutionDtoList.length <= fetched.length) {\n            return Promise.resolve(fetched);\n        }\n        return this.fetchJobExecutionRelations(jobExecutionDtoList[fetched.length], revive).then((jobExecution)=> {\n            fetched.push(jobExecution);\n\n            return this.fetchJobExecutionsRelations(jobExecutionDtoList, revive, fetched);\n        });\n    }\n\n    findStepExecutions(jobExecutionId, revive = true) {\n        return this.stepExecutionDao.getAllByIndex(\"jobExecutionId\", jobExecutionId).then(dtos=> {\n            if (!revive) {\n                return dtos;\n            }\n            return dtos.map(dto=>this.reviveStepExecution(dto));\n        })\n    }\n\n\n    /*find job executions sorted by createTime, returns promise*/\n    findJobExecutions(jobInstance, fetchRelationsAndRevive = true) {\n        return this.jobExecutionDao.getAllByIndex(\"jobInstanceId\", jobInstance.id).then(values=> {\n            var sorted = values.sort(function (a, b) {\n                return a.createTime.getTime() - b.createTime.getTime()\n            });\n\n            if (!fetchRelationsAndRevive) {\n                return sorted;\n            }\n\n            return this.fetchJobExecutionsRelations(sorted, true)\n        });\n    }\n\n    getLastJobExecutionByInstance(jobInstance) {\n        return this.findJobExecutions(jobInstance, false).then(executions=>this.fetchJobExecutionRelations(executions[executions.length - 1]));\n    }\n\n    getLastStepExecution(jobInstance, stepName) {\n        return this.findJobExecutions(jobInstance).then(jobExecutions=> {\n            var stepExecutions = [];\n            jobExecutions.forEach(jobExecution=>jobExecution.stepExecutions.filter(s=>s.stepName === stepName).forEach((s)=>stepExecutions.push(s)));\n            var latest = null;\n            stepExecutions.forEach(s=> {\n                if (latest == null || latest.startTime.getTime() < s.startTime.getTime()) {\n                    latest = s;\n                }\n            });\n            return latest;\n        })\n    }\n\n    reviveJobInstance(dto) {\n        return new JobInstance(dto.id, dto.jobName);\n    }\n\n    reviveExecutionContext(dto) {\n        var executionContext = new ExecutionContext();\n        executionContext.context = dto.context;\n        var data = executionContext.getData();\n        if (data) {\n            var dataModel = new DataModel();\n            dataModel.loadFromDTO(data, this.expressionsReviver);\n            executionContext.setData(dataModel);\n        }\n        return executionContext\n    }\n\n    reviveJobExecution(dto) {\n\n        var job = this.getJobByName(dto.jobInstance.jobName);\n        var jobInstance = this.reviveJobInstance(dto.jobInstance);\n        var jobParameters = job.createJobParameters(dto.jobParameters.values);\n        var jobExecution = new JobExecution(jobInstance, jobParameters, dto.id);\n        var executionContext = this.reviveExecutionContext(dto.executionContext);\n        return Utils.mergeWith(jobExecution, dto, (objValue, srcValue, key, object, source, stack)=> {\n            if (key === \"jobInstance\") {\n                return jobInstance;\n            }\n            if (key === \"executionContext\") {\n                return executionContext;\n            }\n            if (key === \"jobParameters\") {\n                return jobParameters;\n            }\n            if (key === \"jobExecution\") {\n                return jobExecution;\n            }\n\n            if (key === \"stepExecutions\") {\n                return srcValue.map(stepDTO => this.reviveStepExecution(stepDTO, jobExecution));\n            }\n        })\n    }\n\n    reviveStepExecution(dto, jobExecution) {\n        var stepExecution = new StepExecution(dto.stepName, jobExecution, dto.id);\n        var executionContext = this.reviveExecutionContext(dto.executionContext);\n        return Utils.mergeWith(stepExecution, dto, (objValue, srcValue, key, object, source, stack)=> {\n            if (key === \"jobExecution\") {\n                return jobExecution;\n            }\n            if (key === \"executionContext\") {\n                return executionContext;\n            }\n        })\n    }\n}\n\n\nclass ObjectStoreDao {\n\n    name;\n    dbPromise;\n\n    constructor(name, dbPromise) {\n        this.name = name;\n        this.dbPromise = dbPromise;\n    }\n\n    get(key) {\n        return this.dbPromise.then(db => {\n            return db.transaction(this.name)\n                .objectStore(this.name).get(key);\n        });\n    }\n\n    getAllByIndex(indexName, key) {\n        return this.dbPromise.then(db => {\n            return db.transaction(this.name)\n                .objectStore(this.name).index(indexName).getAll(key)\n        });\n    }\n\n    getByIndex(indexName, key) {\n        return this.dbPromise.then(db => {\n            return db.transaction(this.name)\n                .objectStore(this.name).index(indexName).get(key)\n        });\n    }\n\n    set(key, val) {\n        return this.dbPromise.then(db => {\n            const tx = db.transaction(this.name, 'readwrite');\n            tx.objectStore(this.name).put(val, key);\n            return tx.complete;\n        });\n    }\n\n    remove(key) {\n        return this.dbPromise.then(db => {\n            const tx = db.transaction(this.name, 'readwrite');\n            tx.objectStore(this.name).delete(key);\n            return tx.complete;\n        });\n    }\n\n    clear() {\n        return this.dbPromise.then(db => {\n            const tx = db.transaction(this.name, 'readwrite');\n            tx.objectStore(this.name).clear();\n            return tx.complete;\n        });\n    }\n\n    keys() {\n        return this.dbPromise.then(db => {\n            const tx = db.transaction(this.name);\n            const keys = [];\n            const store = tx.objectStore(this.name);\n\n            // This would be store.getAllKeys(), but it isn't supported by Edge or Safari.\n            // openKeyCursor isn't supported by Safari, so we fall back\n            (store.iterateKeyCursor || store.iterateCursor).call(store, cursor => {\n                if (!cursor) return;\n                keys.push(cursor.key);\n                cursor.continue();\n            });\n\n            return tx.complete.then(() => keys);\n        });\n    }\n}\n","import {JobKeyGenerator} from \"../job-key-generator\";\nimport {JobInstance} from \"../job-instance\";\nimport {Utils} from \"sd-utils\";\nimport {JobExecution} from \"../job-execution\";\nimport {JobExecutionAlreadyRunningException} from \"../exceptions/job-execution-already-running-exception\";\nimport {JOB_STATUS} from \"../job-status\";\nimport {JobInstanceAlreadyCompleteException} from \"../exceptions/job-instance-already-complete-exception\";\nimport {ExecutionContext} from \"../execution-context\";\nimport {StepExecution} from \"../step-execution\";\nimport {DataModel} from \"sd-model\";\nimport {JobResult} from \"../job-result\";\n\nexport class JobRepository {\n\n    jobByName = {};\n\n    registerJob(job) {\n        this.jobByName[job.name] = job;\n    }\n\n    getJobByName(name) {\n        return this.jobByName[name];\n    }\n\n\n    /*returns promise*/\n    getJobInstance(jobName, jobParameters) {\n       throw \"JobRepository getJobInstance function not implemented!\"\n    }\n\n    /*should return promise that resolves to saved instance*/\n    saveJobInstance(key, jobInstance){\n        throw \"JobRepository.saveJobInstance function not implemented!\"\n    }\n\n    getJobExecutionById(id){\n        throw \"JobRepository.getJobExecutionById function not implemented!\"\n    }\n\n    /*should return promise that resolves to saved jobExecution*/\n    saveJobExecution(jobExecution){\n        throw \"JobRepository.saveJobInstance function not implemented!\"\n    }\n\n    updateJobExecutionProgress(jobExecutionId, progress){\n        throw \"JobRepository.saveJobInstance function not implemented!\"\n    }\n\n    getJobExecutionProgress(jobExecutionId){\n        throw \"JobRepository.getJobExecutionProgress function not implemented!\"\n    }\n\n    saveJobExecutionFlag(jobExecutionId, flag){\n        throw \"JobRepository.saveJobExecutionFlag function not implemented!\"\n    }\n\n    getJobExecutionFlag(jobExecutionId){\n        throw \"JobRepository.getJobExecutionFlag function not implemented!\"\n    }\n\n\n    /*should return promise which resolves to saved stepExecution*/\n    saveStepExecution(stepExecution){\n        throw \"JobRepository.saveStepExecution function not implemented!\"\n    }\n\n    /*find job executions sorted by createTime, returns promise*/\n    findJobExecutions(jobInstance) {\n        throw \"JobRepository.findJobExecutions function not implemented!\"\n    }\n\n    getJobResult(jobResultId){\n        throw \"JobRepository.getJobResult function not implemented!\"\n    }\n\n    getJobResultByInstance(jobInstance){\n        throw \"JobRepository.getJobResultByInstance function not implemented!\"\n    }\n\n    saveJobResult(jobResult) {\n        throw \"JobRepository.setJobResult function not implemented!\"\n    }\n\n\n    removeJobInstance(jobInstance, jobParameters){\n        throw \"JobRepository.removeJobInstance function not implemented!\"\n    }\n\n    removeJobExecution(jobExecution){\n        throw \"JobRepository.removeJobExecution function not implemented!\"\n    }\n\n    removeStepExecution(stepExecution){\n        throw \"JobRepository.removeStepExecution function not implemented!\"\n    }\n\n    removeJobResult(jobResult){\n        throw \"JobRepository.removeJobResult function not implemented!\"\n    }\n\n    /*Create a new JobInstance with the name and job parameters provided. return promise*/\n    createJobInstance(jobName, jobParameters) {\n        var jobInstance = new JobInstance(Utils.guid(), jobName);\n        return this.saveJobInstance(jobInstance, jobParameters);\n    }\n\n    /*Check if an instance of this job already exists with the parameters provided.*/\n    isJobInstanceExists(jobName, jobParameters) {\n        return this.getJobInstance(jobName, jobParameters).then(result => !!result).catch(error=>false);\n    }\n\n    generateJobInstanceKey(jobName, jobParameters) {\n        return jobName + \"|\" + JobKeyGenerator.generateKey(jobParameters);\n    }\n\n    /*Create a JobExecution for a given  Job and JobParameters. If matching JobInstance already exists,\n     * the job must be restartable and it's last JobExecution must *not* be\n     * completed. If matching JobInstance does not exist yet it will be  created.*/\n\n    createJobExecution(jobName, jobParameters, data) {\n        return this.getJobInstance(jobName, jobParameters).then(jobInstance=>{\n            if (jobInstance != null) {\n                return this.findJobExecutions(jobInstance).then(executions=>{\n                    executions.forEach(execution=> {\n                        if (execution.isRunning()) {\n                            throw new JobExecutionAlreadyRunningException(\"A job execution for this job is already running: \" + jobInstance.jobName);\n                        }\n                        if (execution.status == JOB_STATUS.COMPLETED || execution.status == JOB_STATUS.ABANDONED) {\n                            throw new JobInstanceAlreadyCompleteException(\n                                \"A job instance already exists and is complete for parameters=\" + jobParameters\n                                + \".  If you want to run this job again, change the parameters.\");\n                        }\n                    });\n\n                    var executionContext = executions[executions.length - 1].executionContext;\n\n                    return [jobInstance, executionContext];\n                })\n            }\n\n            // no job found, create one\n            jobInstance = this.createJobInstance(jobName, jobParameters);\n            var executionContext = new ExecutionContext();\n            var dataModel = new DataModel();\n            dataModel._setNewState(data.createStateSnapshot());\n            executionContext.setData(dataModel);\n            return Promise.all([jobInstance, executionContext]);\n        }).then(instanceAndExecutionContext=>{\n            var jobExecution = new JobExecution(instanceAndExecutionContext[0], jobParameters);\n            jobExecution.executionContext = instanceAndExecutionContext[1];\n            jobExecution.lastUpdated = new Date();\n            return this.saveJobExecution(jobExecution);\n        }).catch(e=>{\n            throw e;\n        })\n    }\n\n    getLastJobExecution(jobName, jobParameters) {\n        return this.getJobInstance(jobName, jobParameters).then((jobInstance)=>{\n            if(!jobInstance){\n                return null;\n            }\n            return this.getLastJobExecutionByInstance(jobInstance);\n        })\n    }\n\n    getLastJobExecutionByInstance(jobInstance){\n        return this.findJobExecutions(jobInstance).then(executions=>executions[executions.length -1]);\n    }\n\n    getLastStepExecution(jobInstance, stepName) {\n        return this.findJobExecutions(jobInstance).then(jobExecutions=>{\n            var stepExecutions=[];\n            jobExecutions.forEach(jobExecution=>jobExecution.stepExecutions.filter(s=>s.stepName === stepName).forEach((s)=>stepExecutions.push(s)));\n            var latest = null;\n            stepExecutions.forEach(s=>{\n                if (latest == null || latest.startTime.getTime() < s.startTime.getTime()) {\n                    latest = s;\n                }\n            });\n            return latest;\n        })\n    }\n\n    addStepExecution(stepExecution) {\n        stepExecution.lastUpdated = new Date();\n        return this.saveStepExecution(stepExecution);\n    }\n\n    update(o){\n        o.lastUpdated = new Date();\n\n        if(o instanceof JobExecution){\n            return this.saveJobExecution(o);\n        }\n\n        if(o instanceof StepExecution){\n            return this.saveStepExecution(o);\n        }\n\n        throw \"Object not updatable: \"+o\n    }\n\n    remove(o){\n\n        if(o instanceof JobExecution){\n            return this.removeJobExecution(o);\n        }\n\n        if(o instanceof StepExecution){\n            return this.removeStepExecution(o);\n        }\n\n        if(o instanceof JobResult){\n            return this.removeJobResult();\n        }\n\n        return Promise.reject(\"Object not removable: \"+o);\n    }\n\n\n    reviveJobInstance(dto) {\n        return dto;\n    }\n\n    reviveExecutionContext(dto) {\n        return dto;\n    }\n\n    reviveJobExecution(dto) {\n        return dto;\n    }\n\n    reviveStepExecution(dto, jobExecution) {\n        return dto;\n    }\n}\n","import {JobRepository} from \"./job-repository\";\nimport {Utils} from \"sd-utils\";\n\nexport class SimpleJobRepository extends JobRepository{\n    jobInstancesByKey = {};\n    jobExecutions = [];\n    stepExecutions = [];\n    executionProgress = {};\n    executionFlags = {};\n    jobResults = [];\n\n    removeJobInstance(jobInstance){\n        Utils.forOwn(this.jobInstancesByKey,  (ji, key)=>{\n            if(ji===jobInstance){\n                delete this.jobInstancesByKey[key]\n            }\n        });\n\n        this.jobExecutions.filter(jobExecution=>jobExecution.jobInstance.id == jobInstance.id).reverse().forEach(this.removeJobExecution, this);\n        this.jobResults.filter(jobResult=>jobResult.jobInstance.id == jobInstance.id).reverse().forEach(this.removeJobResult, this);\n\n        return Promise.resolve();\n    }\n\n    removeJobExecution(jobExecution){\n        let index = this.jobExecutions.indexOf(jobExecution);\n        if(index>-1) {\n            this.jobExecutions.splice(index, 1)\n        }\n\n        this.stepExecutions.filter(stepExecution=>stepExecution.jobExecution.id === jobExecution.id).reverse().forEach(this.removeStepExecution, this);\n        return Promise.resolve();\n    }\n\n    removeStepExecution(stepExecution){\n        let index = this.stepExecutions.indexOf(stepExecution);\n        if(index>-1) {\n            this.stepExecutions.splice(index, 1)\n        }\n        return Promise.resolve();\n    }\n\n    removeJobResult(jobResult){\n        let index = this.jobResults.indexOf(jobResult);\n        if(index>-1) {\n            this.jobResults.splice(index, 1)\n        }\n        return Promise.resolve();\n    }\n\n\n    /*returns promise*/\n    getJobInstance(jobName, jobParameters) {\n        var key = this.generateJobInstanceKey(jobName, jobParameters);\n        return Promise.resolve(this.jobInstancesByKey[key]);\n    }\n\n    /*should return promise that resolves to saved instance*/\n    saveJobInstance(jobInstance, jobParameters){\n        var key = this.generateJobInstanceKey(jobInstance.jobName, jobParameters);\n        this.jobInstancesByKey[key] = jobInstance;\n        return Promise.resolve(jobInstance)\n    }\n\n    getJobResult(jobResultId){\n        return Promise.resolve(Utils.find(this.jobResults, r=>r.id===jobResultId))\n    }\n\n    getJobResultByInstance(jobInstance){\n        return Promise.resolve(Utils.find(this.jobResults, r=>r.jobInstance.id===jobInstance.id))\n    }\n\n    saveJobResult(jobResult) {\n        this.jobResults.push(jobResult);\n        return Promise.resolve(jobResult);\n    }\n\n    getJobExecutionById(id){\n        return Promise.resolve(Utils.find(this.jobExecutions, ex=>ex.id===id))\n    }\n\n    /*should return promise that resolves to saved jobExecution*/\n    saveJobExecution(jobExecution){\n        this.jobExecutions.push(jobExecution);\n        return Promise.resolve(jobExecution);\n    }\n\n    updateJobExecutionProgress(jobExecutionId, progress){\n        this.executionProgress[jobExecutionId] = progress;\n        return Promise.resolve(progress)\n    }\n\n    getJobExecutionProgress(jobExecutionId){\n        return Promise.resolve(this.executionProgress[jobExecutionId])\n    }\n\n    saveJobExecutionFlag(jobExecutionId, flag){\n        this.executionFlags[jobExecutionId] = flag;\n        return Promise.resolve(flag)\n    }\n\n    getJobExecutionFlag(jobExecutionId){\n        return Promise.resolve(this.executionFlags[jobExecutionId])\n    }\n\n    /*should return promise which resolves to saved stepExecution*/\n    saveStepExecution(stepExecution){\n        this.stepExecutions.push(stepExecution);\n        return Promise.resolve(stepExecution);\n    }\n\n    /*find job executions sorted by createTime, returns promise*/\n    findJobExecutions(jobInstance) {\n        return Promise.resolve(this.jobExecutions.filter(e=>e.jobInstance.id == jobInstance.id).sort(function (a, b) {\n            return a.createTime.getTime() - b.createTime.getTime()\n        }));\n    }\n\n\n}\n","import {JobRepository} from \"./job-repository\";\nimport {Utils} from \"sd-utils\";\nimport {SimpleJobRepository} from \"./simple-job-repository\";\n\n\n\nexport class TimeoutJobRepository extends SimpleJobRepository{\n\n    createTimeoutPromise(valueToResolve, delay=1){\n        return new Promise(resolve=>{\n            setTimeout(function(){\n                resolve(valueToResolve);\n            }, delay)\n        });\n    }\n\n    /*returns promise*/\n    getJobInstance(jobName, jobParameters) {\n        var key = this.generateJobInstanceKey(jobName, jobParameters);\n        return this.createTimeoutPromise(this.jobInstancesByKey[key]);\n    }\n\n    /*should return promise that resolves to saved instance*/\n    saveJobInstance(jobInstance, jobParameters){\n        var key = this.generateJobInstanceKey(jobInstance.jobName, jobParameters);\n        this.jobInstancesByKey[key] = jobInstance;\n        return this.createTimeoutPromise(jobInstance);\n    }\n\n    getJobResult(jobResultId){\n        return this.createTimeoutPromise(Utils.find(this.jobResults, r=>r.id===jobResultId));\n    }\n\n    getJobResultByInstance(jobInstance){\n        return this.createTimeoutPromise(Utils.find(this.jobResults, r=>r.jobInstance.id===jobInstance.id));\n    }\n\n    saveJobResult(jobResult) {\n        this.jobResults.push(jobResult);\n        return this.createTimeoutPromise(jobResult);\n    }\n\n    getJobExecutionById(id){\n        return this.createTimeoutPromise(Utils.find(this.jobExecutions, ex=>ex.id===id));\n    }\n\n    /*should return promise that resolves to saved jobExecution*/\n    saveJobExecution(jobExecution){\n        this.jobExecutions.push(jobExecution);\n        return this.createTimeoutPromise(jobExecution);\n    }\n\n    updateJobExecutionProgress(jobExecutionId, progress){\n        this.executionProgress[jobExecutionId] = progress;\n        return this.createTimeoutPromise(progress);\n    }\n\n    getJobExecutionProgress(jobExecutionId){\n        return this.createTimeoutPromise(this.executionProgress[jobExecutionId]);\n    }\n\n    saveJobExecutionFlag(jobExecutionId, flag){\n        this.executionFlags[jobExecutionId] = flag;\n        return this.createTimeoutPromise(flag);\n    }\n\n    getJobExecutionFlag(jobExecutionId){\n        return this.createTimeoutPromise(this.executionFlags[jobExecutionId]);\n    }\n\n    /*should return promise which resolves to saved stepExecution*/\n    saveStepExecution(stepExecution){\n        this.stepExecutions.push(stepExecution);\n        return this.createTimeoutPromise(stepExecution);\n    }\n\n    /*find job executions sorted by createTime, returns promise*/\n    findJobExecutions(jobInstance) {\n        return this.createTimeoutPromise(this.jobExecutions.filter(e=>e.jobInstance.id == jobInstance.id).sort(function (a, b) {\n            return a.createTime.getTime() - b.createTime.getTime()\n        }));\n    }\n\n    remove(object){ //TODO\n\n    }\n}\n","import {JOB_STATUS} from \"./job-status\";\nimport {StepExecution} from \"./step-execution\";\nimport {Utils} from \"sd-utils\";\nimport {ExecutionContext} from \"./execution-context\";\n\n/*domain object representing the result of a job instance.*/\nexport class JobResult {\n    id;\n    jobInstance;\n    lastUpdated = null;\n\n    data;\n\n    constructor(jobInstance, id) {\n        if(id===null || id === undefined){\n            this.id = Utils.guid();\n        }else{\n            this.id = id;\n        }\n\n        this.jobInstance = jobInstance;\n    }\n}\n","export const JOB_STATUS = {\n    COMPLETED: 'COMPLETED',\n    STARTING: 'STARTING',\n    STARTED: 'STARTED',\n    STOPPING: 'STOPPING',\n    STOPPED: 'STOPPED',\n    FAILED: 'FAILED',\n    UNKNOWN: 'UNKNOWN',\n    ABANDONED: 'ABANDONED',\n    EXECUTING: 'EXECUTING' //for exit status only\n};\n","import {log} from 'sd-utils'\nimport {JOB_STATUS} from \"./job-status\";\nimport {JobInterruptedException} from \"./exceptions/job-interrupted-exception\";\nimport {JobParametersInvalidException} from \"./exceptions/job-parameters-invalid-exception\";\nimport {JobDataInvalidException} from \"./exceptions/job-data-invalid-exception\";\nimport {JOB_EXECUTION_FLAG} from \"./job-execution-flag\";\nimport {JobResult} from \"./job-result\";\n\n/**\n * Base class for jobs\n * A Job is an entity that encapsulates an entire job process ( an abstraction representing the configuration of a job)\n * */\n\nexport class Job {\n\n    id;\n    name;\n    steps = [];\n\n    isRestartable=true;\n    executionListeners = [];\n    jobParametersValidator;\n\n    jobRepository;\n\n    constructor(name, jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        this.name = name;\n        this.jobParametersValidator = this.getJobParametersValidator();\n        this.jobDataValidator = this.getJobDataValidator();\n        this.jobRepository = jobRepository;\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n    }\n\n    setJobRepository(jobRepository) {\n        this.jobRepository = jobRepository;\n    }\n\n    execute(execution) {\n        log.debug(\"Job execution starting: \", execution);\n        var jobResult;\n        return this.checkExecutionFlags(execution).then(execution=>{\n\n            if (execution.status === JOB_STATUS.STOPPING) {\n                // The job was already stopped\n                execution.status = JOB_STATUS.STOPPED;\n                execution.exitStatus = JOB_STATUS.COMPLETED;\n                log.debug(\"Job execution was stopped: \" + execution);\n                return execution;\n            }\n\n            if (this.jobParametersValidator && !this.jobParametersValidator.validate(execution.jobParameters)) {\n                throw new JobParametersInvalidException(\"Invalid job parameters in job execute\")\n            }\n\n            if(this.jobDataValidator && !this.jobDataValidator.validate(execution.getData())){\n                throw new JobDataInvalidException(\"Invalid job data in job execute\")\n            }\n\n\n            execution.startTime = new Date();\n            return Promise.all([this.updateStatus(execution, JOB_STATUS.STARTED), this.getResult(execution), this.updateProgress(execution)]).then(res=>{\n                execution=res[0];\n                jobResult = res[1];\n                if(!jobResult) {\n                    jobResult = new JobResult(execution.jobInstance)\n                }\n                this.executionListeners.forEach(listener=>listener.beforeJob(execution));\n\n                return this.doExecute(execution, jobResult);\n            });\n\n        }).then(execution=>{\n            log.debug(\"Job execution complete: \",execution);\n            return execution\n        }).catch(e=>{\n            if (e instanceof JobInterruptedException) {\n                log.info(\"Encountered interruption executing job\", e);\n                execution.status = JOB_STATUS.STOPPED;\n                execution.exitStatus = JOB_STATUS.STOPPED;\n            } else {\n                log.error(\"Encountered fatal error executing job\", e);\n                execution.status = JOB_STATUS.FAILED;\n                execution.exitStatus = JOB_STATUS.FAILED;\n            }\n            execution.failureExceptions.push(e);\n            return execution;\n        }).then(execution=>{\n            if(jobResult){\n                return this.jobRepository.saveJobResult(jobResult).then(()=>execution)\n            }\n            return execution\n        }).catch(e=>{\n            log.error(\"Encountered fatal error saving job results\", e);\n            if(e){\n                execution.failureExceptions.push(e);\n            }\n            execution.status = JOB_STATUS.FAILED;\n            execution.exitStatus = JOB_STATUS.FAILED;\n            return execution;\n        }).then(execution=>{\n            execution.endTime = new Date();\n            return Promise.all([this.jobRepository.update(execution), this.updateProgress(execution)]).then(res=>res[0])\n        }).then(execution=>{\n            try {\n                this.executionListeners.forEach(listener=>listener.afterJob(execution));\n            } catch (e) {\n                log.error(\"Exception encountered in afterStep callback\", e);\n            }\n            return execution;\n        })\n    }\n\n\n    updateStatus(jobExecution, status) {\n        jobExecution.status=status;\n        return this.jobRepository.update(jobExecution)\n    }\n\n    updateProgress(jobExecution){\n        return this.jobRepository.updateJobExecutionProgress(jobExecution.id, this.getProgress(jobExecution));\n    }\n\n    /* Extension point for subclasses allowing them to concentrate on processing logic and ignore listeners, returns promise*/\n    doExecute(execution, jobResult) {\n        throw 'doExecute function not implemented for job: ' + this.name\n    }\n\n    getJobParametersValidator() {\n        return {\n            validate: (params) => params.validate()\n        }\n    }\n\n    getJobDataValidator() {\n        return {\n            validate: (data) => true\n        }\n    }\n\n    addStep(step){\n        this.steps.push(step);\n    }\n\n\n    createJobParameters(values){\n        throw 'createJobParameters function not implemented for job: ' + this.name\n    }\n\n    /*Should return progress object with fields:\n    * current\n    * total */\n    getProgress(execution){\n        return {\n            total: 1,\n            current: execution.status === JOB_STATUS.COMPLETED ? 1 : 0\n        }\n    }\n\n    registerExecutionListener(listener){\n        this.executionListeners.push(listener);\n    }\n\n    checkExecutionFlags(execution){\n        return this.jobRepository.getJobExecutionFlag(execution.id).then(flag=>{\n            if(JOB_EXECUTION_FLAG.STOP === flag){\n                execution.stop();\n            }\n            return execution\n        })\n    }\n\n    getResult(execution) {\n        return this.jobRepository.getJobResultByInstance(execution.jobInstance);\n    }\n\n    jobResultToCsvRows(jobResult, jobParameters){\n        throw 'jobResultToCsvRows function not implemented for job: ' + this.name\n    }\n}\n","import {log} from 'sd-utils'\nimport {JOB_STATUS} from \"./job-status\";\nimport {Job} from \"./job\";\nimport {Utils} from \"sd-utils\";\nimport {ExecutionContext} from \"./execution-context\";\nimport {Step} from \"./step\";\nimport {JobInterruptedException} from \"./exceptions/job-interrupted-exception\";\nimport {JobRestartException} from \"./exceptions/job-restart-exception\";\nimport {JOB_EXECUTION_FLAG} from \"./job-execution-flag\";\n\n/* Simple Job that sequentially executes a job by iterating through its list of steps.  Any Step that fails will fail the job.  The job is\n considered complete when all steps have been executed.*/\n\nexport class SimpleJob extends Job {\n\n    constructor(name, jobRepository, expressionsEvaluator, objectiveRulesManager) {\n        super(name, jobRepository, expressionsEvaluator, objectiveRulesManager)\n    }\n\n    getStep(stepName) {\n        return Utils.find(this.steps, s=>s.name == stepName);\n    }\n\n    doExecute(execution, jobResult) {\n\n        return this.handleNextStep(execution, jobResult).then(lastExecutedStepExecution=>{\n            if (lastExecutedStepExecution != null) {\n                log.debug(\"Updating JobExecution status: \", lastExecutedStepExecution);\n                execution.status = lastExecutedStepExecution.status;\n                execution.exitStatus = lastExecutedStepExecution.exitStatus;\n                execution.failureExceptions.push(...lastExecutedStepExecution.failureExceptions)\n            }\n            return execution;\n        });\n    }\n\n    handleNextStep(jobExecution, jobResult, prevStep=null, prevStepExecution=null){\n        var stepIndex = 0;\n        if(prevStep){\n            stepIndex = this.steps.indexOf(prevStep)+1;\n        }\n        if(stepIndex>=this.steps.length){\n            return Promise.resolve(prevStepExecution)\n        }\n        var step = this.steps[stepIndex];\n        return this.handleStep(step, jobExecution, jobResult).then(stepExecution=>{\n            if(stepExecution.status !== JOB_STATUS.COMPLETED){ // Terminate the job if a step fails\n                return stepExecution;\n            }\n            return this.handleNextStep(jobExecution, jobResult, step, stepExecution);\n        })\n    }\n\n    handleStep(step, jobExecution, jobResult) {\n        var jobInstance = jobExecution.jobInstance;\n        return this.checkExecutionFlags(jobExecution).then(jobExecution=>{\n            if (jobExecution.isStopping()) {\n                throw new JobInterruptedException(\"JobExecution interrupted.\");\n            }\n            return this.jobRepository.getLastStepExecution(jobInstance, step.name)\n\n        }).then(lastStepExecution=>{\n            if (this.stepExecutionPartOfExistingJobExecution(jobExecution, lastStepExecution)) {\n                // If the last execution of this step was in the same job, it's probably intentional so we want to run it again.\n                log.info(\"Duplicate step detected in execution of job. step: \" + step.name + \" jobName: \", jobInstance.jobName);\n                lastStepExecution = null;\n            }\n\n            var currentStepExecution = lastStepExecution;\n\n            if (!this.shouldStart(currentStepExecution, jobExecution, step)) {\n                return currentStepExecution;\n            }\n\n            currentStepExecution = jobExecution.createStepExecution(step.name);\n\n            var isCompleted = lastStepExecution != null && lastStepExecution.status === JOB_STATUS.COMPLETED;\n            var isRestart = lastStepExecution != null && !isCompleted;\n            var skipExecution = isCompleted && step.skipOnRestartIfCompleted;\n\n            if (isRestart) {\n                currentStepExecution.executionContext = lastStepExecution.executionContext;\n                if (lastStepExecution.executionContext.containsKey(\"executed\")) {\n                    currentStepExecution.executionContext.remove(\"executed\");\n                }\n            }\n            else {\n\n                currentStepExecution.executionContext = new ExecutionContext();\n            }\n            if(skipExecution){\n                currentStepExecution.exitStatus = JOB_STATUS.COMPLETED;\n                currentStepExecution.status = JOB_STATUS.COMPLETED;\n                currentStepExecution.executionContext.put(\"skipped\", true);\n            }\n\n            return this.jobRepository.addStepExecution(currentStepExecution).then((_currentStepExecution)=>{\n                currentStepExecution=_currentStepExecution;\n                if(skipExecution){\n                    log.info(\"Skipping completed step execution: [\" + step.name + \"]\");\n                    return currentStepExecution;\n                }\n                log.info(\"Executing step: [\" + step.name + \"]\");\n                return step.execute(currentStepExecution, jobResult)\n            }).then(()=>{\n                currentStepExecution.executionContext.put(\"executed\", true);\n                return currentStepExecution;\n            }).catch (e => {\n                jobExecution.status = JOB_STATUS.FAILED;\n                return this.jobRepository.update(jobExecution).then(jobExecution=>{throw e})\n            });\n\n        }).then((currentStepExecution)=>{\n            if (currentStepExecution.status == JOB_STATUS.STOPPING\n                || currentStepExecution.status == JOB_STATUS.STOPPED) {\n                // Ensure that the job gets the message that it is stopping\n                jobExecution.status = JOB_STATUS.STOPPING;\n                // throw new Error(\"Job interrupted by step execution\");\n            }\n            return this.updateProgress(jobExecution).then(()=>currentStepExecution);\n        })\n\n    }\n\n    stepExecutionPartOfExistingJobExecution(jobExecution, stepExecution) {\n        return stepExecution != null && stepExecution.jobExecution.id == jobExecution.id\n    }\n\n    shouldStart(lastStepExecution, execution, step) {\n        var stepStatus;\n        if (lastStepExecution == null) {\n            stepStatus = JOB_STATUS.STARTING;\n        }\n        else {\n            stepStatus = lastStepExecution.status;\n        }\n\n        if (stepStatus == JOB_STATUS.UNKNOWN) {\n            throw new JobRestartException(\"Cannot restart step from UNKNOWN status\")\n        }\n\n        return stepStatus != JOB_STATUS.COMPLETED || step.isRestartable;\n    }\n\n    getProgress(execution){\n        var completedSteps = execution.stepExecutions.length;\n        let progress = {\n            total: this.steps.length,\n            current: completedSteps\n        };\n        if(!completedSteps){\n            return progress\n        }\n        if(JOB_STATUS.COMPLETED !== execution.stepExecutions[execution.stepExecutions.length-1].status){\n            progress.current--;\n        }\n\n        return progress;\n    }\n\n    addStep(){\n        if(arguments.length===1){\n            return super.addStep(arguments[0])\n        }\n        var step = new Step(arguments[0], this.jobRepository);\n        step.doExecute = arguments[1];\n        return super.addStep(step);\n    }\n\n}\n","export class StepExecutionListener {\n    /*Called before a step executes*/\n    beforeStep(jobExecution) {\n\n    }\n\n    /*Called after completion of a step. Called after both successful and failed executions*/\n    afterStep(jobExecution) {\n\n    }\n}\n","import {Utils} from \"sd-utils\";\nimport {ExecutionContext} from \"./execution-context\";\nimport {JOB_STATUS} from \"./job-status\";\nimport {JobExecution} from \"./job-execution\";\n\n/*\n representation of the execution of a step\n */\nexport class StepExecution {\n    id;\n    stepName;\n    jobExecution;\n\n    status = JOB_STATUS.STARTING;\n    exitStatus = JOB_STATUS.EXECUTING;\n    executionContext = new ExecutionContext(); //execution context for single step level,\n\n    startTime = new Date();\n    endTime = null;\n    lastUpdated = null;\n\n    terminateOnly = false; //flag to indicate that an execution should halt\n    failureExceptions = [];\n\n    constructor(stepName, jobExecution, id) {\n        if(id===null || id === undefined){\n            this.id = Utils.guid();\n        }else{\n            this.id = id;\n        }\n\n        this.stepName = stepName;\n        this.jobExecution = jobExecution;\n        this.jobExecutionId = jobExecution.id;\n    }\n\n    getJobParameters(){\n        return this.jobExecution.jobParameters;\n    }\n\n    getJobExecutionContext(){\n        return this.jobExecution.executionContext;\n    }\n\n    getData(){\n        return this.jobExecution.getData();\n    }\n\n    getDTO(filteredProperties=[], deepClone = true){\n\n        var cloneMethod = Utils.cloneDeepWith;\n        if(!deepClone) {\n            cloneMethod = Utils.cloneWith;\n        }\n\n        return Utils.assign({}, cloneMethod(this, (value, key, object, stack)=> {\n            if(filteredProperties.indexOf(key)>-1){\n                return null;\n            }\n            if([\"executionContext\"].indexOf(key)>-1){\n                return value.getDTO()\n            }\n            if(value instanceof Error){\n                return Utils.getErrorDTO(value);\n            }\n\n            if (value instanceof JobExecution) {\n                return value.getDTO([\"stepExecutions\"], deepClone)\n            }\n        }))\n    }\n}\n","import {JOB_STATUS} from \"./job-status\";\nimport {log} from 'sd-utils'\n\nimport {JobInterruptedException} from \"./exceptions/job-interrupted-exception\";\n/*domain object representing the configuration of a job step*/\nexport class Step {\n\n    id;\n    name;\n    isRestartable = true;\n    skipOnRestartIfCompleted=true;\n    steps = [];\n    executionListeners = [];\n\n    jobRepository;\n\n    constructor(name, jobRepository) {\n        this.name = name;\n        this.jobRepository = jobRepository;\n    }\n\n    setJobRepository(jobRepository) {\n        this.jobRepository = jobRepository;\n    }\n\n    /*Process the step and assign progress and status meta information to the StepExecution provided*/\n    execute(stepExecution, jobResult) {\n        log.debug(\"Executing step: name=\" + this.name);\n        stepExecution.startTime = new Date();\n        stepExecution.status = JOB_STATUS.STARTED;\n        var exitStatus;\n        return this.jobRepository.update(stepExecution).then(stepExecution=>{\n            exitStatus = JOB_STATUS.EXECUTING;\n\n            this.executionListeners.forEach(listener=>listener.beforeStep(stepExecution));\n            this.open(stepExecution.executionContext);\n\n            return this.doExecute(stepExecution, jobResult)\n        }).then(_stepExecution=>{\n            stepExecution = _stepExecution;\n            exitStatus = stepExecution.exitStatus;\n\n            // Check if someone is trying to stop us\n            if (stepExecution.terminateOnly) {\n                throw new JobInterruptedException(\"JobExecution interrupted.\");\n            }\n            // Need to upgrade here not set, in case the execution was stopped\n            stepExecution.status = JOB_STATUS.COMPLETED;\n            log.debug(\"Step execution success: name=\" + this.name);\n            return stepExecution\n        }).catch(e=>{\n            stepExecution.status = this.determineJobStatus(e);\n            exitStatus = stepExecution.status;\n            stepExecution.failureExceptions.push(e);\n\n            if (stepExecution.status == JOB_STATUS.STOPPED) {\n                log.info(\"Encountered interruption executing step: \" + this.name + \" in job: \" + stepExecution.jobExecution.jobInstance.jobName, e);\n            }\n            else {\n                log.error(\"Encountered an error executing step: \" + this.name + \" in job: \" + stepExecution.jobExecution.jobInstance.jobName, e);\n            }\n            return stepExecution;\n        }).then(stepExecution=>{\n            try {\n                stepExecution.exitStatus = exitStatus;\n                this.executionListeners.forEach(listener=>listener.afterStep(stepExecution));\n            }\n            catch (e) {\n                log.error(\"Exception in afterStep callback in step \" + this.name + \" in job: \" + stepExecution.jobExecution.jobInstance.jobName, e);\n            }\n\n            stepExecution.endTime = new Date();\n            stepExecution.exitStatus = exitStatus;\n\n\n            return this.jobRepository.update(stepExecution)\n        }).then(stepExecution=>{\n            try {\n                this.close(stepExecution.executionContext);\n            }\n            catch (e) {\n                log.error(\"Exception while closing step execution resources in step: \" + this.name + \" in job: \" + stepExecution.jobExecution.jobInstance.jobName, e);\n                stepExecution.failureExceptions.push(e);\n            }\n\n            try {\n                this.close(stepExecution.executionContext);\n            }\n            catch (e) {\n                log.error(\"Exception while closing step execution resources in step: \" + this.name + \" in job: \" + stepExecution.jobExecution.jobInstance.jobName, e);\n                stepExecution.failureExceptions.push(e);\n            }\n\n            // doExecutionRelease();\n\n            log.debug(\"Step execution complete: \" + stepExecution.id);\n            return stepExecution;\n        });\n\n    }\n\n    determineJobStatus(e) {\n        if (e instanceof JobInterruptedException) {\n            return JOB_STATUS.STOPPED;\n        }\n        else {\n            return JOB_STATUS.FAILED;\n        }\n    }\n\n    /**\n     * Extension point for subclasses to execute business logic. Subclasses should set the exitStatus on the\n     * StepExecution before returning. Must return stepExecution\n     */\n    doExecute(stepExecution, jobResult) {\n    }\n\n    /**\n     * Extension point for subclasses to provide callbacks to their collaborators at the beginning of a step, to open or\n     * acquire resources. Does nothing by default.\n     */\n    open(executionContext) {\n    }\n\n    /**\n     * Extension point for subclasses to provide callbacks to their collaborators at the end of a step (right at the end\n     * of the finally block), to close or release resources. Does nothing by default.\n     */\n    close(executionContext) {\n    }\n\n\n    /*Should return progress object with fields:\n     * current\n     * total */\n    getProgress(stepExecution){\n        return {\n            total: 1,\n            current: stepExecution.status === JOB_STATUS.COMPLETED ? 1 : 0\n        }\n    }\n}\n","import * as engine from './engine/index'\n\nexport {engine}\nexport * from './jobs-manager'\nexport * from './job-worker'\n\n\n\n","import {JobExecutionListener} from \"./engine/job-execution-listener\";\nimport {JOB_STATUS} from \"./engine/job-status\";\nimport {JobInstance} from \"./engine/job-instance\";\nimport {Utils, log} from \"sd-utils\";\n\n\nexport class JobInstanceManagerConfig {\n    onJobStarted = () => {};\n    onJobCompleted = result => {};\n    onJobFailed = errors => {};\n    onJobStopped = () => {};\n    onJobTerminated = () => {};\n    onProgress = (progress) => {};\n    callbacksThisArg;\n    updateInterval = 100;\n\n    constructor(custom) {\n        if (custom) {\n            Utils.deepExtend(this, custom);\n        }\n    }\n}\n\n/*convenience class for managing and tracking job instance progress*/\nexport class JobInstanceManager extends JobExecutionListener {\n\n    jobsManger;\n    jobInstance;\n    config;\n\n    lastJobExecution;\n    lastUpdateTime;\n    progress = null;\n\n    constructor(jobsManger, jobInstanceOrExecution, config) {\n        super();\n        this.config = new JobInstanceManagerConfig(config);\n        this.jobsManger = jobsManger;\n        if (jobInstanceOrExecution instanceof JobInstance) {\n            this.jobInstance = jobInstanceOrExecution;\n            this.getLastJobExecution().then(je=> {\n                this.checkProgress();\n            })\n        } else {\n            this.lastJobExecution = jobInstanceOrExecution;\n            this.jobInstance = this.lastJobExecution.jobInstance;\n            this.checkProgress();\n        }\n        if (this.lastJobExecution && !this.lastJobExecution.isRunning()) {\n            this.afterJob(this.lastJobExecution);\n            return;\n        }\n        jobsManger.registerJobExecutionListener(this);\n    }\n\n    checkProgress() {\n\n        var self = this;\n        if (this.terminated || !this.lastJobExecution.isRunning() || this.getProgressPercents(this.progress) === 100) {\n            return;\n        }\n        this.jobsManger.getProgress(this.lastJobExecution).then(progress=> {\n            this.lastUpdateTime = new Date();\n            if (progress) {\n                this.progress = progress;\n                this.config.onProgress.call(this.config.callbacksThisArg || this, progress);\n            }\n\n            setTimeout(function () {\n                self.checkProgress();\n            }, this.config.updateInterval)\n        })\n    }\n\n    beforeJob(jobExecution) {\n        if (jobExecution.jobInstance.id !== this.jobInstance.id) {\n            return;\n        }\n\n        this.lastJobExecution = jobExecution;\n        this.config.onJobStarted.call(this.config.callbacksThisArg || this);\n    }\n\n    getProgressPercents(progress) {\n        if (!progress) {\n            return 0;\n        }\n        return progress.current * 100 / progress.total;\n    }\n\n    getProgressFromExecution(jobExecution) {\n        var job = this.jobsManger.getJobByName(jobExecution.jobInstance.jobName);\n        return job.getProgress(jobExecution);\n    }\n\n    afterJob(jobExecution) {\n        if (jobExecution.jobInstance.id !== this.jobInstance.id) {\n            return;\n        }\n        this.lastJobExecution = jobExecution;\n        if (JOB_STATUS.COMPLETED === jobExecution.status) {\n            this.jobsManger.deregisterJobExecutionListener(this);\n            this.progress = this.getProgressFromExecution(jobExecution);\n            this.config.onProgress.call(this.config.callbacksThisArg || this, this.progress);\n            this.jobsManger.getResult(jobExecution.jobInstance).then(result=> {\n                this.config.onJobCompleted.call(this.config.callbacksThisArg || this, result.data);\n            }).catch(e=> {\n                log.error(e);\n            })\n\n\n        } else if (JOB_STATUS.FAILED === jobExecution.status) {\n            this.config.onJobFailed.call(this.config.callbacksThisArg || this, jobExecution.failureExceptions);\n\n        } else if (JOB_STATUS.STOPPED === jobExecution.status) {\n            this.config.onJobStopped.call(this.config.callbacksThisArg || this);\n        }\n    }\n\n    getLastJobExecution(forceUpdate = false) {\n        if (!this.lastJobExecution || forceUpdate) {\n            return this.jobsManger.jobRepository.getLastJobExecutionByInstance(this.jobInstance).then(je=> {\n                this.lastJobExecution = je;\n                return je;\n            });\n        }\n        return Promise.resolve(this.lastJobExecution);\n    }\n\n    stop() {\n        return this.getLastJobExecution().then(()=> {\n            return this.jobsManger.stop(this.lastJobExecution)\n        })\n    }\n\n    resume() {\n        return this.getLastJobExecution().then(()=> {\n            return this.jobsManger.run(this.jobInstance.jobName, this.lastJobExecution.jobParameters.values, this.lastJobExecution.getData()).then(je=> {\n                this.lastJobExecution = je;\n                this.checkProgress();\n                return true;\n            }).catch(e=> {\n                log.error(e);\n                return false;\n            })\n        })\n    }\n\n    terminate() {\n        return this.getLastJobExecution().then(()=> {\n            return this.jobsManger.terminate(this.jobInstance).then(()=> {\n                this.terminated = true;\n                this.config.onJobTerminated.call(this.config.callbacksThisArg || this, this.lastJobExecution);\n                this.jobsManger.deregisterJobExecutionListener(this);\n\n                return this.lastJobExecution;\n            })\n        }).catch(e=> {\n            log.error(e);\n            return false;\n        })\n    }\n\n}\n","export class JobWorker{\n\n    worker;\n    listeners = {};\n    defaultListener;\n\n    constructor(url, defaultListener, onError){\n        var instance = this;\n        this.worker = new Worker(url);\n        this.defaultListener = defaultListener || function() {};\n        if (onError) {this.worker.onerror = onError;}\n\n        this.worker.onmessage = function(event) {\n            if (event.data instanceof Object &&\n                event.data.hasOwnProperty('queryMethodListener') && event.data.hasOwnProperty('queryMethodArguments')) {\n                var listener = instance.listeners[event.data.queryMethodListener];\n                var args = event.data.queryMethodArguments;\n                if(listener.deserializer){\n                    args = listener.deserializer(args);\n                }\n                listener.fn.apply(listener.thisArg, args);\n            } else {\n                this.defaultListener.call(instance, event.data);\n            }\n        }\n\n    }\n\n    sendQuery() {\n        if (arguments.length < 1) {\n            throw new TypeError('JobWorker.sendQuery takes at least one argument');\n        }\n        this.worker.postMessage({\n            'queryMethod': arguments[0],\n            'queryArguments': Array.prototype.slice.call(arguments, 1)\n        });\n    }\n\n    runJob(jobName, jobParametersValues, dataDTO){\n        this.sendQuery('runJob', jobName, jobParametersValues, dataDTO)\n    }\n\n    executeJob(jobExecutionId){\n        this.sendQuery('executeJob', jobExecutionId)\n    }\n\n    recompute(dataDTO, ruleNames, evalCode, evalNumeric){\n        this.sendQuery('recompute', dataDTO, ruleNames, evalCode, evalNumeric)\n    }\n\n    postMessage(message) {\n        this.worker.postMessage(message);\n    }\n\n    terminate() {\n        this.worker.terminate();\n    }\n\n    addListener(name, listener, thisArg, deserializer) {\n        this.listeners[name] = {\n            fn: listener,\n            thisArg: thisArg || this,\n            deserializer: deserializer\n        };\n    }\n\n    removeListener(name) {\n        delete this.listeners[name];\n    }\n}\n","import {Utils, log} from \"sd-utils\";\nimport {SensitivityAnalysisJob} from \"./configurations/sensitivity-analysis/n-way/sensitivity-analysis-job\";\nimport {JobLauncher} from \"./engine/job-launcher\";\nimport {JobWorker} from \"./job-worker\";\nimport {JobExecutionListener} from \"./engine/job-execution-listener\";\nimport {JobParameters} from \"./engine/job-parameters\";\nimport {IdbJobRepository} from \"./engine/job-repository/idb-job-repository\";\nimport {JOB_EXECUTION_FLAG} from \"./engine/job-execution-flag\";\nimport {RecomputeJob} from \"./configurations/recompute/recompute-job\";\nimport {ProbabilisticSensitivityAnalysisJob} from \"./configurations/sensitivity-analysis/probabilistic/probabilistic-sensitivity-analysis-job\";\nimport {TimeoutJobRepository} from \"./engine/job-repository/timeout-job-repository\";\nimport {TornadoDiagramJob} from \"./configurations/sensitivity-analysis/tornado-diagram/tornado-diagram-job\";\nimport {JOB_STATUS} from \"./engine/job-status\";\nimport {SimpleJobRepository} from \"./engine/job-repository/simple-job-repository\";\nimport {LeagueTableJob} from \"./configurations/league-table/league-table-job\";\nimport {SpiderPlotJob} from \"./configurations/sensitivity-analysis/spider-plot/spider-plot-job\";\n\n\nexport class JobsManagerConfig {\n\n    workerUrl = null;\n    repositoryType = 'idb';\n    clearRepository = false;\n\n    constructor(custom) {\n        if (custom) {\n            Utils.deepExtend(this, custom);\n        }\n    }\n}\n\nexport class JobsManager extends JobExecutionListener {\n\n\n    useWorker;\n    expressionsEvaluator;\n    objectiveRulesManager;\n    jobWorker;\n\n    jobRepository;\n    jobLauncher;\n\n    jobExecutionListeners = [];\n\n    afterJobExecutionPromiseResolves = {};\n    jobInstancesToTerminate = {};\n\n    constructor(expressionsEvaluator, objectiveRulesManager, config) {\n        super();\n        this.setConfig(config);\n        this.expressionEngine = expressionsEvaluator.expressionEngine;\n        this.expressionsEvaluator = expressionsEvaluator;\n        this.objectiveRulesManager = objectiveRulesManager;\n\n\n        this.useWorker = !!this.config.workerUrl;\n        if (this.useWorker) {\n            this.initWorker(this.config.workerUrl);\n        }\n\n        this.initRepository();\n\n        this.registerJobs();\n\n\n\n        this.jobLauncher = new JobLauncher(this.jobRepository, this.jobWorker, (data)=>this.serializeData(data));\n    }\n\n    setConfig(config) {\n        this.config = new JobsManagerConfig(config);\n        return this;\n    }\n\n    initRepository() {\n        switch (this.config.repositoryType){\n            case 'idb':\n                this.jobRepository = new IdbJobRepository(this.expressionEngine.getJsonReviver(), 'sd-job-repository', this.config.clearRepository);\n                break;\n            case 'timeout':\n                this.jobRepository = new TimeoutJobRepository(this.expressionEngine.getJsonReviver());\n                break;\n            case 'simple':\n                this.jobRepository = new SimpleJobRepository(this.expressionEngine.getJsonReviver());\n                break;\n            default:\n                log.error('JobsManager configuration error! Unknown repository type: '+this.config.repositoryType+'. Using default: idb');\n                this.config.repositoryType = 'idb';\n                this.initRepository()\n        }\n    }\n\n    serializeData(data) {\n        return data.serialize(true, false, false, this.expressionEngine.getJsonReplacer());\n    }\n\n    getProgress(jobExecutionOrId) {\n        var id = jobExecutionOrId;\n        if (!Utils.isString(jobExecutionOrId)) {\n            id = jobExecutionOrId.id\n        }\n        return this.jobRepository.getJobExecutionProgress(id);\n    }\n\n    getResult(jobInstance) {\n        return this.jobRepository.getJobResultByInstance(jobInstance);\n    }\n\n    run(jobName, jobParametersValues, data, resolvePromiseAfterJobIsLaunched = true) {\n        return this.jobLauncher.run(jobName, jobParametersValues, data, resolvePromiseAfterJobIsLaunched).then(jobExecution=> {\n            if (resolvePromiseAfterJobIsLaunched || !jobExecution.isRunning()) {\n                return jobExecution;\n            }\n            //job was delegated to worker and is still running\n\n            return new Promise((resolve, reject)=> {\n                this.afterJobExecutionPromiseResolves[jobExecution.id] = resolve;\n            });\n        });\n    }\n\n    execute(jobExecutionOrId) {\n        return this.jobLauncher.execute(jobExecutionOrId);\n    }\n\n    stop(jobExecutionOrId) {\n        var id = jobExecutionOrId;\n        if (!Utils.isString(jobExecutionOrId)) {\n            id = jobExecutionOrId.id\n        }\n\n        return this.jobRepository.getJobExecutionById(id).then(jobExecution=> {\n            if (!jobExecution) {\n                log.error(\"Job Execution not found: \" + jobExecutionOrId);\n                return null;\n            }\n            if (!jobExecution.isRunning()) {\n                log.warn(\"Job Execution not running, status: \" + jobExecution.status + \", endTime: \" + jobExecution.endTime);\n                return jobExecution;\n            }\n\n            return this.jobRepository.saveJobExecutionFlag(jobExecution.id, JOB_EXECUTION_FLAG.STOP).then(()=>jobExecution);\n        });\n    }\n\n    /*stop job execution if running and delete job instance from repository*/\n    terminate(jobInstance) {\n        return this.jobRepository.getLastJobExecutionByInstance(jobInstance).then(jobExecution=> {\n            if (jobExecution) {\n                if(jobExecution.isRunning()){\n                    return this.jobRepository.saveJobExecutionFlag(jobExecution.id, JOB_EXECUTION_FLAG.STOP).then(()=>jobExecution);\n                }else{\n                    return this.jobRepository.removeJobInstance(jobInstance, jobExecution.jobParameters);\n                }\n            }\n        }).then(()=>{\n            this.jobInstancesToTerminate[jobInstance.id]=jobInstance;\n        })\n    }\n\n    getJobByName(jobName) {\n        return this.jobRepository.getJobByName(jobName);\n    }\n\n\n    createJobParameters(jobName, jobParametersValues) {\n        var job = this.jobRepository.getJobByName(jobName);\n        return job.createJobParameters(jobParametersValues);\n    }\n\n\n    /*Returns a promise*/\n    getLastJobExecution(jobName, jobParameters) {\n        if (this.useWorker) {\n            return this.jobWorker;\n        }\n        if (!(jobParameters instanceof JobParameters)) {\n            jobParameters = this.createJobParameters(jobParameters)\n        }\n        return this.jobRepository.getLastJobExecution(jobName, jobParameters);\n    }\n\n    initWorker(workerUrl) {\n        this.jobWorker = new JobWorker(workerUrl, ()=>{\n            log.error('error in worker', arguments);\n        });\n        var argsDeserializer = (args)=> {\n            return [this.jobRepository.reviveJobExecution(args[0])]\n        };\n\n        this.jobWorker.addListener(\"beforeJob\", this.beforeJob, this, argsDeserializer);\n        this.jobWorker.addListener(\"afterJob\", this.afterJob, this, argsDeserializer);\n        this.jobWorker.addListener(\"jobFatalError\", this.onJobFatalError, this);\n    }\n\n    registerJobs() {\n\n        let sensitivityAnalysisJob = new SensitivityAnalysisJob(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager);\n        let probabilisticSensitivityAnalysisJob = new ProbabilisticSensitivityAnalysisJob(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager);\n        if(!Utils.isWorker()){\n            sensitivityAnalysisJob.setBatchSize(1);\n            probabilisticSensitivityAnalysisJob.setBatchSize(1);\n        }\n\n        this.registerJob(sensitivityAnalysisJob);\n        this.registerJob(new TornadoDiagramJob(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager));\n        this.registerJob(probabilisticSensitivityAnalysisJob);\n        this.registerJob(new RecomputeJob(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager));\n        this.registerJob(new LeagueTableJob(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager));\n        this.registerJob(new SpiderPlotJob(this.jobRepository, this.expressionsEvaluator, this.objectiveRulesManager));\n    }\n\n    registerJob(job) {\n        this.jobRepository.registerJob(job);\n        job.registerExecutionListener(this)\n    }\n\n    registerJobExecutionListener(listener) {\n        this.jobExecutionListeners.push(listener);\n    }\n\n    deregisterJobExecutionListener(listener) {\n        var index = this.jobExecutionListeners.indexOf(listener);\n        if (index > -1) {\n            this.jobExecutionListeners.splice(index, 1)\n        }\n    }\n\n    beforeJob(jobExecution) {\n        log.debug(\"beforeJob\", this.useWorker, jobExecution);\n        this.jobExecutionListeners.forEach(l=>l.beforeJob(jobExecution));\n    }\n\n    afterJob(jobExecution) {\n        log.debug(\"afterJob\", this.useWorker, jobExecution);\n        this.jobExecutionListeners.forEach(l=>l.afterJob(jobExecution));\n        var promiseResolve = this.afterJobExecutionPromiseResolves[jobExecution.id];\n        if (promiseResolve) {\n            promiseResolve(jobExecution)\n        }\n\n        if(this.jobInstancesToTerminate[jobExecution.jobInstance.id]){\n            this.jobRepository.removeJobInstance(jobExecution.jobInstance, jobExecution.jobParameters);\n        }\n    }\n\n    onJobFatalError(jobExecutionId, error){\n        var promiseResolve = this.afterJobExecutionPromiseResolves[jobExecutionId];\n        if (promiseResolve) {\n            this.jobRepository.getJobExecutionById(jobExecutionId).then(jobExecution=>{\n                jobExecution.status = JOB_STATUS.FAILED;\n                if(error){\n                    jobExecution.failureExceptions.push(error);\n                }\n\n                return this.jobRepository.saveJobExecution(jobExecution).then(()=>{\n                    promiseResolve(jobExecution);\n                })\n            }).catch(e=>{\n                log.error(e);\n            })\n\n        }\n        log.debug('onJobFatalError', jobExecutionId, error);\n    }\n\n\n}\n","import {\n    ExpectedValueMaximizationRule,\n    ExpectedValueMinimizationRule,\n    MaxiMinRule,\n    MaxiMaxRule,\n    MiniMinRule,\n    MiniMaxRule\n} from \"./rules\";\nimport {log} from \"sd-utils\";\nimport * as model from \"sd-model\";\nimport {MinMaxRule} from \"./rules/min-max-rule\";\nimport {MaxMinRule} from \"./rules/max-min-rule\";\nimport {MinMinRule} from \"./rules/min-min-rule\";\nimport {MaxMaxRule} from \"./rules/max-max-rule\";\n\nexport class ObjectiveRulesManager{\n\n    expressionEngine;\n    currentRule;\n    ruleByName = {};\n    rules = [];\n\n\n    flipPair = {};\n    payoffIndex = 0;\n\n    constructor(expressionEngine, currentRuleName) {\n        this.expressionEngine = expressionEngine;\n        this.addRule(new ExpectedValueMaximizationRule(expressionEngine));\n        this.addRule(new ExpectedValueMinimizationRule(expressionEngine));\n        this.addRule(new MaxiMinRule(expressionEngine));\n        this.addRule(new MaxiMaxRule(expressionEngine));\n        this.addRule(new MiniMinRule(expressionEngine));\n        this.addRule(new MiniMaxRule(expressionEngine));\n\n        let minMax = new MinMaxRule(expressionEngine);\n        this.addRule(minMax);\n        let maxMin = new MaxMinRule(expressionEngine);\n        this.addRule(maxMin);\n        this.addFlipPair(minMax, maxMin);\n\n        let minMin = new MinMinRule(expressionEngine);\n        this.addRule(minMin);\n        let maxMax = new MaxMaxRule(expressionEngine);\n        this.addRule(maxMax);\n\n\n        if (currentRuleName) {\n            this.currentRule = this.ruleByName[currentRuleName];\n        } else {\n            this.currentRule = this.rules[0];\n        }\n\n    }\n\n\n    setPayoffIndex(payoffIndex){\n        this.payoffIndex = payoffIndex || 0;\n    }\n\n    addRule(rule){\n        this.ruleByName[rule.name]=rule;\n        this.rules.push(rule);\n    }\n\n    isRuleName(ruleName){\n         return !!this.ruleByName[ruleName]\n    }\n\n    setCurrentRuleByName(ruleName){\n        this.currentRule = this.ruleByName[ruleName];\n    }\n\n    getObjectiveRuleByName(ruleName){\n        return this.ruleByName[ruleName];\n    }\n\n    flipRule(){\n        var flipped = this.flipPair[this.currentRule.name];\n        if(flipped){\n            this.currentRule = flipped;\n        }\n    }\n\n    updateDefaultCriterion1Weight(defaultCriterion1Weight){\n        this.rules.filter(r=>r.multiCriteria).forEach(r=>r.setDefaultCriterion1Weight(defaultCriterion1Weight));\n    }\n\n    recompute(dataModel, allRules, decisionPolicy=null){\n\n        var startTime = new Date().getTime();\n        log.trace('recomputing rules, all: '+allRules);\n\n        dataModel.getRoots().forEach(n=>{\n            this.recomputeTree(n, allRules, decisionPolicy);\n        });\n\n        var time  = (new Date().getTime() - startTime/1000);\n        log.trace('recomputation took '+time+'s');\n\n        return this;\n    }\n\n    recomputeTree(root, allRules, decisionPolicy=null){\n        log.trace('recomputing rules for tree ...', root);\n\n        var startTime = new Date().getTime();\n\n        var rules  = [this.currentRule];\n        if(allRules){\n            rules = this.rules;\n        }\n\n        rules.forEach(rule=> {\n            rule.setPayoffIndex(this.payoffIndex);\n            rule.setDecisionPolicy(decisionPolicy);\n            rule.computePayoff(root);\n            rule.computeOptimal(root);\n            rule.clearDecisionPolicy();\n        });\n\n        var time  = (new Date().getTime() - startTime)/1000;\n        log.trace('recomputation took '+time+'s');\n\n        return this;\n    }\n\n\n    getNodeDisplayValue(node, name) {\n        return node.computedValue(this.currentRule.name, name)\n\n    }\n\n    getEdgeDisplayValue(e, name){\n        if(name==='probability'){\n            if(e.parentNode instanceof model.domain.DecisionNode){\n                return e.computedValue(this.currentRule.name, 'probability');\n            }\n            if(e.parentNode instanceof model.domain.ChanceNode){\n                return e.computedBaseProbability();\n            }\n            return null;\n        }\n        if(name==='payoff'){\n            if(this.currentRule.multiCriteria){\n                return e.computedValue(null, 'payoff');\n            }else{\n                return e.computedValue(null, 'payoff[' +this.payoffIndex + ']');\n            }\n\n        }\n        if(name==='optimal'){\n            return e.computedValue(this.currentRule.name, 'optimal')\n        }\n    }\n\n    addFlipPair(rule1, rule2) {\n        this.flipPair[rule1.name] = rule2;\n        this.flipPair[rule2.name] = rule1;\n    }\n\n\n}\n","import {domain as model} from 'sd-model'\nimport {ObjectiveRule} from './objective-rule'\nimport {Utils} from 'sd-utils'\n\n/*expected value maximization rule*/\nexport class ExpectedValueMaximizationRule extends ObjectiveRule{\n\n    static NAME = 'expected-value-maximization';\n\n    constructor(expressionEngine){\n        super(ExpectedValueMaximizationRule.NAME, true, expressionEngine);\n    }\n\n    //  payoff - parent edge payoff\n    computeOptimal(node, payoff=0, probabilityToEnter=1){\n        this.cValue(node, 'optimal', true);\n        if(node instanceof model.TerminalNode){\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        node.childEdges.forEach(e=>{\n            if ( this.subtract(this.computedPayoff(node),payoff).equals(this.computedPayoff(e.childNode)) || !(node instanceof model.DecisionNode) ) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.basePayoff(e), this.multiply(probabilityToEnter, this.cValue(e,'probability')));\n            }else{\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n\n}\n","import {domain as model} from 'sd-model'\nimport {ObjectiveRule} from './objective-rule'\nimport {Utils} from \"sd-utils\";\n\n/*expected value minimization rule*/\nexport class ExpectedValueMinimizationRule extends ObjectiveRule{\n\n    static NAME = 'expected-value-minimization';\n\n    constructor(expressionEngine){\n        super(ExpectedValueMinimizationRule.NAME, false, expressionEngine);\n    }\n\n    //  payoff - parent edge payoff\n    computeOptimal(node, payoff=0, probabilityToEnter=1){\n        this.cValue(node, 'optimal', true);\n        if(node instanceof model.TerminalNode){\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        node.childEdges.forEach(e=>{\n            if ( this.subtract(this.computedPayoff(node),payoff).equals(this.computedPayoff(e.childNode)) || !(node instanceof model.DecisionNode) ) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.basePayoff(e), this.multiply(probabilityToEnter, this.cValue(e,'probability')));\n            }else{\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n\n}\n","export * from './objective-rule'\nexport * from './expected-value-maximization-rule'\nexport * from './expected-value-minimization-rule'\nexport * from './maxi-max-rule'\nexport * from './maxi-min-rule'\nexport * from './mini-max-rule'\nexport * from './mini-min-rule'\n\n\n","import {MultiCriteriaRule} from \"./multi-criteria-rule\";\n\n\nexport class MaxMaxRule extends MultiCriteriaRule{\n\n    static NAME = 'max-max';\n\n    constructor(expressionEngine){\n        super(MaxMaxRule.NAME, [1, 1], expressionEngine);\n    }\n}\n","import {MultiCriteriaRule} from \"./multi-criteria-rule\";\n\n\nexport class MaxMinRule extends MultiCriteriaRule{\n\n    static NAME = 'max-min';\n\n    constructor(expressionEngine){\n        super(MaxMinRule.NAME, [1, -1], expressionEngine);\n    }\n}\n","import {domain as model} from 'sd-model'\nimport {ObjectiveRule} from './objective-rule'\nimport {Utils} from \"sd-utils\";\n\n/*maxi-max rule*/\nexport class MaxiMaxRule extends ObjectiveRule{\n\n    static NAME = 'maxi-max';\n\n    constructor(expressionEngine){\n        super(MaxiMaxRule.NAME, true, expressionEngine);\n    }\n\n\n    modifyChanceProbability(edges, bestChildPayoff, bestCount, worstChildPayoff, worstCount){\n        edges.forEach(e=>{\n            this.clearComputedValues(e);\n            this.cValue(e, 'probability', this.computedPayoff(e.childNode)<bestChildPayoff ? 0.0 : (1.0/bestCount));\n        });\n    }\n\n    //  payoff - parent edge payoff\n    computeOptimal(node, payoff = 0, probabilityToEnter = 1) {\n        this.cValue(node, 'optimal', true);\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        var optimalEdge = null;\n        if (node instanceof model.ChanceNode) {\n            optimalEdge = Utils.maxBy(node.childEdges, e=>this.computedPayoff(e.childNode));\n        }\n\n        node.childEdges.forEach(e=> {\n            var isOptimal = false;\n            if (optimalEdge) {\n                isOptimal = this.computedPayoff(optimalEdge.childNode).equals(this.computedPayoff(e.childNode));\n            } else isOptimal = !!(this.subtract(this.computedPayoff(node), payoff).equals(this.computedPayoff(e.childNode)) || !(node instanceof model.DecisionNode));\n\n            if (isOptimal) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.basePayoff(e), this.multiply(probabilityToEnter, this.cValue(e, 'probability')));\n            } else {\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n\n}\n","import {domain as model} from 'sd-model'\nimport {ObjectiveRule} from './objective-rule'\nimport {Utils} from \"sd-utils\";\n\n/*maxi-min rule*/\nexport class MaxiMinRule extends ObjectiveRule{\n\n    static NAME = 'maxi-min';\n\n    constructor(expressionEngine){\n        super(MaxiMinRule.NAME, true, expressionEngine);\n    }\n\n    modifyChanceProbability(edges, bestChildPayoff, bestCount, worstChildPayoff, worstCount){\n        edges.forEach(e=>{\n            this.clearComputedValues(e);\n            this.cValue(e, 'probability', this.computedPayoff(e.childNode)>worstChildPayoff ? 0.0 : (1.0/worstCount));\n        });\n    }\n\n    //  payoff - parent edge payoff\n    computeOptimal(node, payoff = 0, probabilityToEnter = 1) {\n        this.cValue(node, 'optimal', true);\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        var optimalEdge = null;\n        if (node instanceof model.ChanceNode) {\n            optimalEdge = Utils.minBy(node.childEdges, e=>this.computedPayoff(e.childNode));\n        }\n\n        node.childEdges.forEach(e=> {\n            var isOptimal = false;\n            if (optimalEdge) {\n                isOptimal = this.computedPayoff(optimalEdge.childNode).equals(this.computedPayoff(e.childNode));\n            } else isOptimal = !!(this.subtract(this.computedPayoff(node), payoff).equals(this.computedPayoff(e.childNode)) || !(node instanceof model.DecisionNode));\n\n            if (isOptimal) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.basePayoff(e), this.multiply(probabilityToEnter, this.cValue(e, 'probability')));\n            } else {\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n\n}\n","import {MultiCriteriaRule} from \"./multi-criteria-rule\";\n\n\nexport class MinMaxRule extends MultiCriteriaRule{\n\n    static NAME = 'min-max';\n\n    constructor(expressionEngine){\n        super(MinMaxRule.NAME, [-1, 1], expressionEngine);\n    }\n}\n","import {MultiCriteriaRule} from \"./multi-criteria-rule\";\n\n\nexport class MinMinRule extends MultiCriteriaRule{\n\n    static NAME = 'min-min';\n\n    constructor(expressionEngine){\n        super(MinMinRule.NAME, [-1, -1], expressionEngine);\n    }\n}\n","import {domain as model} from 'sd-model'\nimport {ObjectiveRule} from './objective-rule'\nimport {Utils} from \"sd-utils\";\n\n/*mini-max rule*/\nexport class MiniMaxRule extends ObjectiveRule{\n\n    static NAME = 'mini-max';\n\n    constructor(expressionEngine){\n        super(MiniMaxRule.NAME, false, expressionEngine);\n    }\n\n    modifyChanceProbability(edges, bestChildPayoff, bestCount, worstChildPayoff, worstCount){\n        edges.forEach(e=>{\n            this.clearComputedValues(e);\n            this.cValue(e, 'probability', this.computedPayoff(e.childNode)<bestChildPayoff ? 0.0 : (1.0/bestCount));\n        });\n    }\n\n    //  payoff - parent edge payoff\n    computeOptimal(node, payoff = 0, probabilityToEnter = 1) {\n        this.cValue(node, 'optimal', true);\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        var optimalEdge = null;\n        if (node instanceof model.ChanceNode) {\n            optimalEdge = Utils.maxBy(node.childEdges, e=>this.computedPayoff(e.childNode));\n        }\n\n        node.childEdges.forEach(e=> {\n            var isOptimal = false;\n            if (optimalEdge) {\n                isOptimal = this.computedPayoff(optimalEdge.childNode).equals(this.computedPayoff(e.childNode));\n            } else isOptimal = !!(this.subtract(this.computedPayoff(node), payoff).equals(this.computedPayoff(e.childNode)) || !(node instanceof model.DecisionNode));\n\n            if (isOptimal) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.basePayoff(e), this.multiply(probabilityToEnter, this.cValue(e, 'probability')));\n            } else {\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n}\n","import {domain as model} from 'sd-model'\nimport {ObjectiveRule} from './objective-rule'\nimport {Utils} from \"sd-utils\";\n\n/*mini-min rule*/\nexport class MiniMinRule extends ObjectiveRule{\n\n    static NAME = 'mini-min';\n\n    constructor(expressionEngine){\n        super(MiniMinRule.NAME, false, expressionEngine);\n    }\n\n    modifyChanceProbability(edges, bestChildPayoff, bestCount, worstChildPayoff, worstCount){\n        edges.forEach(e=>{\n            this.clearComputedValues(e);\n            this.cValue(e, 'probability', this.computedPayoff(e.childNode)>worstChildPayoff ? 0.0 : (1.0/worstCount));\n        });\n    }\n\n    //  payoff - parent edge payoff\n    computeOptimal(node, payoff = 0, probabilityToEnter = 1) {\n        this.cValue(node, 'optimal', true);\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        var optimalEdge = null;\n        if (node instanceof model.ChanceNode) {\n            optimalEdge = Utils.minBy(node.childEdges, e=>this.computedPayoff(e.childNode));\n        }\n\n        node.childEdges.forEach(e=> {\n            var isOptimal = false;\n            if (optimalEdge) {\n                isOptimal = this.computedPayoff(optimalEdge.childNode).equals(this.computedPayoff(e.childNode));\n            } else isOptimal = !!(this.subtract(this.computedPayoff(node), payoff).equals(this.computedPayoff(e.childNode)) || !(node instanceof model.DecisionNode));\n\n            if (isOptimal) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.basePayoff(e), this.multiply(probabilityToEnter, this.cValue(e, 'probability')));\n            } else {\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n\n}\n","import {domain as model} from \"sd-model\";\nimport {ObjectiveRule} from \"./objective-rule\";\nimport {Policy} from \"../../policies/policy\";\n\n\nexport class MultiCriteriaRule extends ObjectiveRule {\n\n    criterion1Weight = 1;\n    payoffCoeffs = [1, -1];\n\n    constructor(name, payoffCoeffs, expressionEngine) {\n        super(name, true, expressionEngine, true);\n        this.payoffCoeffs = payoffCoeffs;\n\n    }\n\n    setDefaultCriterion1Weight(criterion1Weight) {\n        this.criterion1Weight = criterion1Weight;\n    }\n\n    // payoff - parent edge payoff, aggregatedPayoff - aggregated payoff along path\n    computePayoff(node, payoff = [0, 0], aggregatedPayoff = [0, 0]) {\n        var childrenPayoff = [0, 0];\n        if (node.childEdges.length) {\n            if (node instanceof model.DecisionNode) {\n\n                var selectedIndexes = [];\n                var bestChild = -Infinity;\n\n                node.childEdges.forEach((e, i)=> {\n                    let basePayoffs = [this.basePayoff(e, 0), this.basePayoff(e, 1)];\n                    var childPayoff = this.computePayoff(e.childNode, basePayoffs, [this.add(basePayoffs[0], aggregatedPayoff[0]), this.add(basePayoffs[1], aggregatedPayoff[1])]);\n                    var childCombinedPayoff = this.cValue(e.childNode, 'combinedPayoff');\n                    if (childCombinedPayoff > bestChild) {\n                        bestChild = childCombinedPayoff;\n                        selectedIndexes = [i];\n                    } else if (bestChild.equals(childCombinedPayoff)) {\n                        selectedIndexes.push(i);\n                    }\n                });\n\n                if (this.decisionPolicy) {\n                    selectedIndexes = [];\n                    var decision = Policy.getDecision(this.decisionPolicy, node);\n                    if (decision) {\n                        selectedIndexes = [decision.decisionValue];\n                    }\n\n                }\n\n                node.childEdges.forEach((e, i)=> {\n                    this.clearComputedValues(e);\n                    this.cValue(e, 'probability', selectedIndexes.indexOf(i) < 0 ? 0.0 : 1.0);\n                });\n            } else {\n                node.childEdges.forEach(e=> {\n                    let basePayoffs = [this.basePayoff(e, 0), this.basePayoff(e, 1)];\n                    this.computePayoff(e.childNode, basePayoffs, [this.add(basePayoffs[0], aggregatedPayoff[0]), this.add(basePayoffs[1], aggregatedPayoff[1])]);\n                    this.clearComputedValues(e);\n                    this.cValue(e, 'probability', this.baseProbability(e));\n                });\n            }\n\n            var sumweight = 0;\n            node.childEdges.forEach(e=> {\n                sumweight = this.add(sumweight, this.cValue(e, 'probability'));\n            });\n\n            if (sumweight > 0) {\n                node.childEdges.forEach(e=> {\n                    childrenPayoff.forEach((p, i)=> {\n                        let ep = this.cValue(e.childNode, 'payoff[' + i + ']');\n                        childrenPayoff[i] = this.add(p, this.multiply(this.cValue(e, 'probability'), ep).div(sumweight))\n                    });\n                });\n            }\n\n\n        }\n        payoff.forEach((p, i)=> {\n            payoff[i] = this.add(p, childrenPayoff[i]);\n        });\n\n        this.clearComputedValues(node);\n\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'aggregatedPayoff', aggregatedPayoff);\n            this.cValue(node, 'probabilityToEnter', 0); //initial value\n        } else {\n            this.cValue(node, 'childrenPayoff', childrenPayoff);\n        }\n\n        this.cValue(node, 'combinedPayoff', this.computeCombinedPayoff(payoff));\n\n        return this.cValue(node, 'payoff', payoff);\n    }\n\n    computeCombinedPayoff(payoff){\n        // [criterion 1 coeff]*[criterion 1]*[weight]+[criterion 2 coeff]*[criterion 2]\n        if (this.criterion1Weight === Infinity) {\n            return this.multiply(this.payoffCoeffs[0], payoff[0]);\n        }\n        return this.add(this.multiply(this.payoffCoeffs[0], this.multiply(this.criterion1Weight, payoff[0])), this.multiply(this.payoffCoeffs[1], payoff[1]));\n    }\n\n    //  combinedPayoff - parent edge combinedPayoff\n    computeOptimal(node, combinedPayoff = 0, probabilityToEnter = 1) {\n        this.cValue(node, 'optimal', true);\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'probabilityToEnter', probabilityToEnter);\n        }\n\n        node.childEdges.forEach(e=> {\n            if (this.subtract(this.cValue(node, 'combinedPayoff'), combinedPayoff).equals(this.cValue(e.childNode, 'combinedPayoff')) || !(node instanceof model.DecisionNode)) {\n                this.cValue(e, 'optimal', true);\n                this.computeOptimal(e.childNode, this.computeCombinedPayoff([this.basePayoff(e, 0), this.basePayoff(e, 1)]), this.multiply(probabilityToEnter, this.cValue(e, 'probability')));\n            } else {\n                this.cValue(e, 'optimal', false);\n            }\n        })\n    }\n}\n","import {ExpressionEngine} from \"sd-expression-engine\";\nimport {domain as model} from \"sd-model\";\nimport {Policy} from \"../../policies/policy\";\n\n/*Base class for objective rules*/\nexport class ObjectiveRule {\n    name;\n    expressionEngine;\n\n    decisionPolicy;\n    maximization;\n\n    payoffIndex = 0;\n    multiCriteria = false;\n\n    constructor(name, maximization, expressionEngine, multiCriteria=false) {\n        this.name = name;\n        this.maximization = maximization;\n        this.expressionEngine = expressionEngine;\n        this.multiCriteria = multiCriteria;\n    }\n\n    setDecisionPolicy(decisionPolicy) {\n        this.decisionPolicy = decisionPolicy;\n    }\n\n    setPayoffIndex(payoffIndex) {\n        this.payoffIndex = payoffIndex;\n    }\n\n    clearDecisionPolicy() {\n        this.decisionPolicy = null;\n    }\n\n    // should return array of selected children indexes\n    makeDecision(decisionNode, childrenPayoffs) {\n        var best;\n        if (this.maximization) {\n            best = this.max(...childrenPayoffs);\n        } else {\n            best = this.min(...childrenPayoffs);\n        }\n        var selectedIndexes = [];\n        childrenPayoffs.forEach((p, i)=> {\n            if (ExpressionEngine.compare(best, p) == 0) {\n                selectedIndexes.push(i);\n            }\n        });\n        return selectedIndexes;\n    }\n\n    _makeDecision(decisionNode, childrenPayoffs) {\n        if (this.decisionPolicy) {\n            var decision = Policy.getDecision(this.decisionPolicy, decisionNode);\n            if (decision) {\n                return [decision.decisionValue];\n            }\n            return [];\n        }\n        return this.makeDecision(decisionNode, childrenPayoffs);\n    }\n\n    // extension point for changing computed probability of edges in a chance node\n    modifyChanceProbability(edges, bestChildPayoff, bestCount, worstChildPayoff, worstCount) {\n\n    }\n\n    // payoff - parent edge payoff, aggregatedPayoff - aggregated payoff along path\n    computePayoff(node, payoff = 0, aggregatedPayoff = 0) {\n        var childrenPayoff = 0;\n        if (node.childEdges.length) {\n            if (node instanceof model.DecisionNode) {\n\n                var selectedIndexes = this._makeDecision(node, node.childEdges.map(e=>this.computePayoff(e.childNode, this.basePayoff(e), this.add(this.basePayoff(e), aggregatedPayoff))));\n                node.childEdges.forEach((e, i)=> {\n                    this.clearComputedValues(e);\n                    this.cValue(e, 'probability', selectedIndexes.indexOf(i) < 0 ? 0.0 : 1.0);\n                });\n\n            } else {\n                var bestChild = -Infinity;\n                var bestCount = 1;\n                var worstChild = Infinity;\n                var worstCount = 1;\n\n                node.childEdges.forEach(e=> {\n                    var childPayoff = this.computePayoff(e.childNode, this.basePayoff(e), this.add(this.basePayoff(e), aggregatedPayoff));\n                    if (childPayoff < worstChild) {\n                        worstChild = childPayoff;\n                        worstCount = 1;\n                    } else if (childPayoff.equals(worstChild)) {\n                        worstCount++\n                    }\n                    if (childPayoff > bestChild) {\n                        bestChild = childPayoff;\n                        bestCount = 1;\n                    } else if (childPayoff.equals(bestChild)) {\n                        bestCount++\n                    }\n\n                    this.clearComputedValues(e);\n                    this.cValue(e, 'probability', this.baseProbability(e));\n                });\n                this.modifyChanceProbability(node.childEdges, bestChild, bestCount, worstChild, worstCount);\n            }\n\n            var sumweight = 0;\n            node.childEdges.forEach(e=> {\n                sumweight = this.add(sumweight, this.cValue(e, 'probability'));\n            });\n\n            // console.log(payoff,node.childEdges,'sumweight',sumweight);\n            if (sumweight > 0) {\n                node.childEdges.forEach(e=> {\n                    childrenPayoff = this.add(childrenPayoff, this.multiply(this.cValue(e, 'probability'), this.computedPayoff(e.childNode)).div(sumweight));\n                });\n            }\n\n\n        }\n\n        payoff = this.add(payoff, childrenPayoff);\n        this.clearComputedValues(node);\n\n        if (node instanceof model.TerminalNode) {\n            this.cValue(node, 'aggregatedPayoff'+ '[' + this.payoffIndex + ']', aggregatedPayoff);\n            this.cValue(node, 'probabilityToEnter', 0); //initial value\n        } else {\n            this.cValue(node, 'childrenPayoff' + '[' + this.payoffIndex + ']', childrenPayoff);\n        }\n\n        return this.computedPayoff(node, payoff);\n    }\n\n    // koloruje optymalne ścieżki\n    computeOptimal(node) {\n        throw 'computeOptimal function not implemented for rule: ' + this.name\n    }\n\n    /* get or set computed payoff*/\n    computedPayoff(node, value){\n        return this.cValue(node, 'payoff[' + this.payoffIndex + ']', value)\n    }\n\n    /*Get or set object's computed value for current rule*/\n    cValue(object, fieldPath, value) {\n        // if(fieldPath.trim() === 'payoff'){\n        //     fieldPath += '[' + this.payoffIndex + ']';\n        // }\n\n        return object.computedValue(this.name, fieldPath, value);\n    }\n\n    baseProbability(edge) {\n        return edge.computedBaseProbability();\n    }\n\n    basePayoff(edge, payoffIndex) {\n        return edge.computedBasePayoff(undefined, payoffIndex || this.payoffIndex);\n    }\n\n    clearComputedValues(object) {\n        object.clearComputedValues(this.name);\n    }\n\n    add(a, b) {\n        return ExpressionEngine.add(a, b)\n    }\n\n    subtract(a, b) {\n        return ExpressionEngine.subtract(a, b)\n    }\n\n    divide(a, b) {\n        return ExpressionEngine.divide(a, b)\n    }\n\n    multiply(a, b) {\n        return ExpressionEngine.multiply(a, b)\n    }\n\n    max() {\n        return ExpressionEngine.max(...arguments)\n    }\n\n    min() {\n        return ExpressionEngine.min(...arguments)\n    }\n\n}\n","import {domain as model} from 'sd-model'\nimport {ExpressionEngine} from 'sd-expression-engine'\nimport {log} from 'sd-utils'\nimport {Operation} from \"./operation\";\nimport {TreeValidator} from \"../validation/tree-validator\";\n\n/*Subtree flipping operation*/\nexport class FlipSubtree extends Operation{\n\n    static $NAME = 'flipSubtree';\n    data;\n    expressionEngine;\n\n    constructor(data, expressionEngine) {\n        super(FlipSubtree.$NAME);\n        this.data = data;\n        this.expressionEngine = expressionEngine;\n        this.treeValidator = new TreeValidator(expressionEngine);\n    }\n\n    isApplicable(object){\n        return object instanceof model.ChanceNode\n    }\n\n    canPerform(node) {\n        if (!this.isApplicable(node)) {\n            return false;\n        }\n\n        if (!this.treeValidator.validate(this.data.getAllNodesInSubtree(node)).isValid()) { //check if the whole subtree is proper\n            return false;\n        }\n\n        if (node.childEdges.length < 1) {\n            return false;\n        }\n\n\n        var grandchildrenNumber = null;\n        var grandchildrenEdgeLabels = [];\n        var childrenEdgeLabelsSet = new Set();\n        var grandchildrenEdgeLabelsSet;\n        if (!node.childEdges.every(e=> {\n\n                var child = e.childNode;\n                if (!(child instanceof model.ChanceNode)) {\n                    return false;\n                }\n\n                if (childrenEdgeLabelsSet.has(e.name.trim())) { // edge labels should be unique\n                    return false;\n                }\n                childrenEdgeLabelsSet.add(e.name.trim());\n\n                if (grandchildrenNumber === null) {\n                    grandchildrenNumber = child.childEdges.length;\n                    if (grandchildrenNumber < 1) {\n                        return false;\n                    }\n                    child.childEdges.forEach(ge=> {\n                        grandchildrenEdgeLabels.push(ge.name.trim());\n                    });\n\n                    grandchildrenEdgeLabelsSet = new Set(grandchildrenEdgeLabels);\n\n                    if (grandchildrenEdgeLabelsSet.size !== grandchildrenEdgeLabels.length) { //grandchildren edge labels should be unique\n                        return false;\n                    }\n\n                    return true;\n                }\n\n                if (child.childEdges.length != grandchildrenNumber) {\n                    return false;\n                }\n\n                if (!child.childEdges.every((ge, i)=>grandchildrenEdgeLabels[i] === ge.name.trim())) {\n                    return false;\n                }\n\n                return true;\n\n            })) {\n\n            return false;\n        }\n\n        return true;\n    }\n\n    perform(root) {\n\n        var rootClone = this.data.cloneSubtree(root, true);\n        var oldChildrenNumber = root.childEdges.length;\n        var oldGrandChildrenNumber = root.childEdges[0].childNode.childEdges.length;\n\n        var childrenNumber = oldGrandChildrenNumber;\n        var grandChildrenNumber = oldChildrenNumber;\n\n        var callbacksDisabled = this.data.callbacksDisabled;\n        this.data.callbacksDisabled = true;\n\n\n        var childX = root.childEdges[0].childNode.location.x;\n        var topY = root.childEdges[0].childNode.childEdges[0].childNode.location.y;\n        var bottomY = root.childEdges[oldChildrenNumber - 1].childNode.childEdges[oldGrandChildrenNumber - 1].childNode.location.y;\n\n        var extentY = bottomY - topY;\n        var stepY = extentY / (childrenNumber + 1);\n\n        root.childEdges.slice().forEach(e=> this.data.removeNode(e.childNode));\n\n\n        for (var i = 0; i < childrenNumber; i++) {\n            var child = new model.ChanceNode(new model.Point(childX, topY + (i + 1) * stepY));\n            var edge = this.data.addNode(child, root);\n            edge.name = rootClone.childEdges[0].childNode.childEdges[i].name;\n\n            edge.probability = 0;\n\n            for (var j = 0; j < grandChildrenNumber; j++) {\n                var grandChild = rootClone.childEdges[j].childNode.childEdges[i].childNode;\n\n\n                var grandChildEdge = this.data.attachSubtree(grandChild, child);\n                grandChildEdge.name = rootClone.childEdges[j].name;\n                grandChildEdge.payoff = [\n                    ExpressionEngine.add(rootClone.childEdges[j].computedBasePayoff(undefined, 0), rootClone.childEdges[j].childNode.childEdges[i].computedBasePayoff(undefined, 0)),\n                    ExpressionEngine.add(rootClone.childEdges[j].computedBasePayoff(undefined, 1), rootClone.childEdges[j].childNode.childEdges[i].computedBasePayoff(undefined, 1)),\n                ];\n\n                grandChildEdge.probability = ExpressionEngine.multiply(rootClone.childEdges[j].computedBaseProbability(), rootClone.childEdges[j].childNode.childEdges[i].computedBaseProbability());\n                edge.probability = ExpressionEngine.add(edge.probability, grandChildEdge.probability);\n            }\n\n            var divideGrandChildEdgeProbability = p => ExpressionEngine.divide(p, edge.probability);\n            if (edge.probability.equals(0)) {\n                var prob = ExpressionEngine.divide(1, grandChildrenNumber);\n                divideGrandChildEdgeProbability = p => prob;\n            }\n\n            var probabilitySum = 0.0;\n            child.childEdges.forEach(grandChildEdge=> {\n                grandChildEdge.probability = divideGrandChildEdgeProbability(grandChildEdge.probability);\n                probabilitySum = ExpressionEngine.add(probabilitySum, grandChildEdge.probability);\n                grandChildEdge.probability = this.expressionEngine.serialize(grandChildEdge.probability)\n            });\n\n            this._normalizeProbabilitiesAfterFlip(child.childEdges, probabilitySum);\n            edge.probability = this.expressionEngine.serialize(edge.probability)\n        }\n        this._normalizeProbabilitiesAfterFlip(root.childEdges);\n\n\n        this.data.callbacksDisabled = callbacksDisabled;\n        this.data._fireNodeAddedCallback();\n    }\n\n    _normalizeProbabilitiesAfterFlip(childEdges, probabilitySum){\n        if(!probabilitySum){\n            probabilitySum = 0.0;\n            childEdges.forEach(e=> {\n                probabilitySum = ExpressionEngine.add(probabilitySum, e.probability);\n            });\n        }\n        if (!probabilitySum.equals(1)) {\n            log.info('Sum of the probabilities in child nodes is not equal to 1 : ', probabilitySum);\n            var newProbabilitySum = 0.0;\n            var cf = 1000000000000; //10^12\n            var prec = 12;\n            childEdges.forEach(e=> {\n                e.probability = parseInt(ExpressionEngine.round(e.probability, prec) * cf);\n                newProbabilitySum = newProbabilitySum + e.probability;\n            });\n            var rest = cf - newProbabilitySum;\n            log.info('Normalizing with rounding to precision: ' + prec, rest);\n            childEdges[0].probability = ExpressionEngine.add(rest, childEdges[0].probability);\n            newProbabilitySum = 0.0;\n            childEdges.forEach(e=> {\n                e.probability = this.expressionEngine.serialize(ExpressionEngine.divide(parseInt(e.probability), cf))\n            })\n        }\n    }\n}\n","\n/*Base class for complex operations on tree structure*/\nexport class Operation{\n\n    name;\n\n    constructor(name){\n        this.name = name;\n    }\n\n    //check if operation is potentially applicable for object\n    isApplicable(){\n        throw 'isApplicable function not implemented for operation: '+this.name\n    }\n\n    //check if can perform operation for applicable object\n    canPerform(object){\n        throw 'canPerform function not implemented for operation: '+this.name\n    }\n\n    perform(object){\n        throw 'perform function not implemented for operation: '+this.name\n    }\n\n\n}\n","import {FlipSubtree} from \"./flip-subtree\";\n\n\nexport class OperationsManager {\n\n    operations = [];\n    operationByName = {};\n\n    constructor(data, expressionEngine){\n        this.data = data;\n        this.expressionEngine = expressionEngine;\n        this.registerOperation(new FlipSubtree(data, expressionEngine));\n    }\n\n    registerOperation(operation){\n        this.operations.push(operation);\n        this.operationByName[operation.name] = operation;\n    }\n\n\n    getOperationByName(name){\n        return this.operationByName[name];\n    }\n\n    operationsForObject(object){\n        return this.operations.filter(op=>op.isApplicable(object))\n    }\n\n    setData(data){\n        this.data = data;\n        this.operations.forEach(o => o.data = data)\n    }\n}\n","\nexport class Decision{\n    node;\n    decisionValue; //index of  selected edge\n    children = [];\n    key;\n\n    constructor(node, decisionValue) {\n        this.node = node;\n        this.decisionValue = decisionValue;\n        this.key = Decision.generateKey(this);\n    }\n\n    static generateKey(decision, keyProperty='$id'){\n        var e = decision.node.childEdges[decision.decisionValue];\n        var key = decision.node[keyProperty]+\":\"+(e[keyProperty]? e[keyProperty] : decision.decisionValue+1);\n        return key.replace(/\\n/g, ' ');\n    }\n\n    addDecision(node, decisionValue){\n        var decision = new Decision(node, decisionValue);\n        this.children.push(decision);\n        this.key = Decision.generateKey(this);\n        return decision;\n    }\n\n    getDecision(decisionNode){\n        return Decision.getDecision(this, decisionNode)\n    }\n\n    static getDecision(decision, decisionNode){\n        if(decision.node===decisionNode || decision.node.$id === decisionNode.$id){\n            return decision;\n        }\n        for(var i=0; i<decision.children.length; i++){\n            var d = Decision.getDecision(decision.children[i], decisionNode);\n            if(d){\n                return d;\n            }\n        }\n    }\n\n    static toDecisionString(decision, extended=false, keyProperty='name', indent = ''){\n\n        var res = Decision.generateKey(decision, keyProperty);\n        var childrenRes = \"\";\n\n        decision.children.forEach(d=>{\n            if(childrenRes){\n                if(extended){\n                    childrenRes += '\\n'+indent;\n                }else{\n                    childrenRes += \", \"\n                }\n\n            }\n            childrenRes += Decision.toDecisionString(d,extended,keyProperty, indent+'\\t')\n        });\n        if(decision.children.length){\n            if(extended){\n                childrenRes =  '\\n'+indent +childrenRes;\n            }else{\n                childrenRes = \" - (\" + childrenRes + \")\";\n            }\n\n\n\n        }\n\n        return res+childrenRes;\n    }\n\n    toDecisionString(indent=false){\n        return Decision.toDecisionString(this, indent)\n    }\n}\n","import {Policy} from \"./policy\";\nimport {domain as model} from 'sd-model'\nimport {Utils} from 'sd-utils'\nimport {Decision} from \"./decision\";\n\nexport class PoliciesCollector{\n    policies = [];\n    ruleName=false;\n\n    constructor(root, optimalForRuleName){\n        this.ruleName = optimalForRuleName;\n        this.collect(root).forEach((decisions,i)=>{\n            this.policies.push(new Policy(\"#\"+(i+1), decisions));\n        });\n        if(this.policies.length===1){\n            this.policies[0].id = \"default\"\n        }\n    }\n\n    collect(root){\n        var nodeQueue = [root];\n        var node;\n        var decisionNodes = [];\n        while(nodeQueue.length){\n            node = nodeQueue.shift();\n\n            if(this.ruleName && !node.computedValue(this.ruleName, 'optimal')){\n                continue;\n            }\n\n            if(node instanceof model.DecisionNode){\n                decisionNodes.push(node);\n                continue;\n            }\n\n            node.childEdges.forEach((edge, i)=>{\n                nodeQueue.push(edge.childNode)\n            })\n        }\n\n        return Utils.cartesianProductOf(decisionNodes.map((decisionNode)=>{\n            var decisions= [];\n            decisionNode.childEdges.forEach((edge, i)=>{\n\n                if(this.ruleName && !edge.computedValue(this.ruleName, 'optimal')){\n                    return;\n                }\n\n                var childDecisions = this.collect(edge.childNode); //all possible child decisions (cartesian)\n                childDecisions.forEach(cd=>{\n                    var decision = new Decision(decisionNode, i);\n                    decisions.push(decision);\n                    decision.children = cd;\n                })\n\n            });\n            return decisions;\n        }));\n    }\n\n}\n","import {ExpressionEngine} from 'sd-expression-engine'\nimport {Utils} from \"sd-utils\";\n\n/*Computed base value validator*/\nexport class PayoffValueValidator{\n    expressionEngine;\n    constructor(expressionEngine){\n        this.expressionEngine=expressionEngine;\n    }\n\n    validate(value){\n\n\n        if(value===null || value === undefined){\n            return false;\n        }\n\n        value = ExpressionEngine.toNumber(value);\n        var maxSafeInteger = Number.MAX_SAFE_INTEGER || 9007199254740991; // Number.MAX_SAFE_INTEGER in undefined in IE\n        return ExpressionEngine.compare(value, -maxSafeInteger) >= 0 && ExpressionEngine.compare(value, maxSafeInteger) <= 0;\n    }\n\n}\n","import {ExpressionEngine} from 'sd-expression-engine'\nimport {Utils} from \"sd-utils\";\n\n/*Computed base value validator*/\nexport class ProbabilityValueValidator{\n    expressionEngine;\n    constructor(expressionEngine){\n        this.expressionEngine=expressionEngine;\n    }\n\n    validate(value, edge){\n        if(value===null || value === undefined){\n            return false;\n        }\n\n        var value = ExpressionEngine.toNumber(value);\n        return value.compare(0) >= 0 && value.compare(1) <= 0;\n    }\n\n}\n","import {domain as model, ValidationResult} from \"sd-model\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\nimport {ProbabilityValueValidator} from \"./probability-value-validator\";\nimport {PayoffValueValidator} from \"./payoff-value-validator\";\n\nexport class TreeValidator {\n\n    expressionEngine;\n\n    constructor(expressionEngine) {\n        this.expressionEngine = expressionEngine;\n        this.probabilityValueValidator = new ProbabilityValueValidator(expressionEngine);\n        this.payoffValueValidator = new PayoffValueValidator(expressionEngine);\n    }\n\n    validate(nodes) {\n\n        var validationResult = new ValidationResult();\n\n        nodes.forEach(n=> {\n            this.validateNode(n, validationResult);\n        });\n\n        return validationResult;\n    }\n\n    validateNode(node, validationResult = new ValidationResult()) {\n\n        if (node instanceof model.TerminalNode) {\n            return;\n        }\n        if (!node.childEdges.length) {\n            validationResult.addError('incompletePath', node)\n        }\n\n        var probabilitySum = ExpressionEngine.toNumber(0);\n        var withHash = false;\n        node.childEdges.forEach((e, i)=> {\n            e.setValueValidity('probability', true);\n\n            if (node instanceof model.ChanceNode) {\n                var probability = e.computedBaseProbability();\n                if (!this.probabilityValueValidator.validate(probability)) {\n                    if (!ExpressionEngine.isHash(e.probability)) {\n                        validationResult.addError({name: 'invalidProbability', data: {'number': i + 1}}, node);\n                        e.setValueValidity('probability', false);\n                    }\n\n                } else {\n                    probabilitySum = ExpressionEngine.add(probabilitySum, probability);\n                }\n            }\n\n            e.payoff.forEach((rawPayoff, payoffIndex)=> {\n                var path = 'payoff[' + payoffIndex + ']';\n                e.setValueValidity(path, true);\n                var payoff = e.computedBasePayoff(undefined, payoffIndex);\n                if (!this.payoffValueValidator.validate(payoff)) {\n                    validationResult.addError({name: 'invalidPayoff', data: {'number': i + 1}}, node);\n                    e.setValueValidity(path, false);\n                }\n            })\n\n\n        });\n        if (node instanceof model.ChanceNode) {\n            if (isNaN(probabilitySum) || !probabilitySum.equals(1)) {\n                validationResult.addError('probabilityDoNotSumUpTo1', node);\n            }\n        }\n\n\n        return validationResult;\n    }\n}\n","import {Utils, log} from \"sd-utils\";\nimport * as math from \"./mathjs\";\nimport * as sdRandom from \"sd-random\";\n\n//Import random functions from sd-random to math.js\nsdRandom.functionNameList.forEach(fnName=>{\n    let importFn = {};\n    importFn[fnName] = sdRandom[fnName];\n    try{\n        math.import(importFn);\n    }catch (e){\n        log.error(e)\n    }\n});\n\n\nexport class ExpressionEngine {\n\n    static staticParser = math.parser();\n\n    constructor() {\n        this.parser = math.parser();\n\n    }\n\n    setScope(scope) {\n        this.parser.scope = scope;\n    }\n\n    eval(expr, asNumber = true, scope) {\n        return ExpressionEngine.doEval(expr, asNumber, scope, this.parser);\n    }\n\n    static eval(expr, asNumber = true, scope) {\n        return ExpressionEngine.doEval(expr, asNumber, scope, ExpressionEngine.staticParser);\n    }\n\n    static doEval(expr, asNumber, scope, parser){\n        log.trace('eval: ' + expr);\n        expr += \"\";\n        expr = expr.trim();\n        if (asNumber) {\n            try {\n                return ExpressionEngine.toNumber(expr);\n            } catch (e) {\n                //   Left empty intentionally\n            }\n        }\n\n        let prevScope = parser.scope;\n\n        parser.scope = scope || {};\n\n        let ev = parser.eval(expr + \"\");\n        parser.scope = prevScope;\n        if (!asNumber) {\n            return ev;\n        }\n        return ExpressionEngine.toNumber(ev);\n    }\n\n    static isHash(expr) {\n        return expr && Utils.isString(expr) && expr.trim() === '#'\n    }\n\n    static hasAssignmentExpression(expr) {\n        return Utils.isString(expr) && expr.indexOf('=') !== -1\n    }\n\n    static add(a, b) {\n        return math.add(ExpressionEngine.toNumber(a), ExpressionEngine.toNumber(b));\n    }\n\n    static subtract(a, b) {\n        return math.subtract(ExpressionEngine.toNumber(a), ExpressionEngine.toNumber(b));\n    }\n\n    static divide(a, b) {\n        return math.divide(ExpressionEngine.toNumber(a), ExpressionEngine.toNumber(b));\n    }\n\n    static multiply(a, b) {\n        return math.multiply(ExpressionEngine.toNumber(a), ExpressionEngine.toNumber(b));\n    }\n\n    static round(a, places) {\n        return ExpressionEngine.toNumber(a).round(places)\n    }\n\n    static toNumber(a) {\n        let parsed = parseFloat(a);\n        if(parsed === Infinity || parsed === -Infinity) {\n            return parsed;\n        }\n\n        return math.fraction(a);\n    }\n\n    static max() {\n        return math.max(...arguments);\n    }\n\n    static min() {\n        return math.min(...arguments);\n    }\n\n    static mad() {\n        return math.mad(...arguments);\n    }\n\n    static mean() {\n        return math.mean(...arguments);\n    }\n\n    static median() {\n        return math.median(...arguments);\n    }\n\n    static std() {\n        return math.std(...arguments);\n    }\n\n\n    static compare(a, b) {\n        a = ExpressionEngine.toNumber(a);\n        b = ExpressionEngine.toNumber(b);\n        if(a != b ){\n            if(a == -Infinity){\n                return -1\n            }\n            if(a == Infinity){\n                return 1\n            }\n            if(b == -Infinity){\n                return 1\n            }\n            if(b == Infinity){\n                return -1\n            }\n        }else{\n            return 0;\n        }\n\n        return math.compare(a, b)\n    }\n\n\n    validate(expr, scope, compileOnly = true) {\n        if (!scope) {\n            scope = this.parser.scope;\n        }\n        return ExpressionEngine.validate(expr, scope, compileOnly);\n    }\n\n    static validate(expr, scope, compileOnly = true){\n        if (expr === null || expr === undefined) {\n            return false;\n        }\n\n        try {\n            expr += \"\";\n            expr = expr.trim();\n            var c = math.compile(expr);\n\n            if (compileOnly) {\n                return true;\n            }\n\n            var e = c.eval(scope);\n            return Utils.isNumeric(e);\n        } catch (e) {\n            return false;\n        }\n    }\n\n    static isExpressionObject(v) {\n        return v && !!v.mathjs;\n    }\n\n    serialize(v) {\n        return ExpressionEngine.toNumber(v).toFraction(true);\n    }\n\n    getJsonReviver() {\n        return math.json.reviver;\n    }\n\n    getJsonReplacer() {\n        var self = this;\n        return function (k, v) {\n            if (v !== null && v !== undefined && ExpressionEngine.isExpressionObject(v)) {\n                try {\n                    return self.serialize(v);\n                } catch (e) {\n                    return v;\n                }\n            }\n            return v;\n        }\n    }\n\n    static toFloat(number){\n        return math.number(number);\n    }\n\n    static format(val) {\n        return math.format(val);\n    }\n\n    static randomMenuList = sdRandom.menuList.slice();\n}\n","export * from './expression-engine'\n","var core = require('mathjs/core');\n\n// Create a new, empty math.js instance\n// It will only contain methods `import` and `config`\nvar math = core.create();\nmath.config({\n    number: 'number'\n});\n// load the data types you need.\n// To load all data types:\n//\n    math.import(require('mathjs/lib/type'));\n//\n// math.import(require('mathjs/lib/type/fraction'));\n\n// Load the functions you need.\n//\n// To load all functions:\n//\n//     math.import(require('mathjs/lib/function'));\n//\n// To load all functions of a specific category:\n//\n// math.import(require('mathjs/lib/function/arithmetic'));\n// math.import(require('mathjs/lib/function/relational'));\n// math.import(require('mathjs/lib/function/probability'));\nmath.import(require('mathjs/lib/function'));\n//\n// math.import(require('mathjs/lib/function/arithmetic/add'));\n// math.import(require('mathjs/lib/function/arithmetic/subtract'));\n// math.import(require('mathjs/lib/function/arithmetic/multiply'));\n// math.import(require('mathjs/lib/function/arithmetic/divide'));\n// math.import(require('mathjs/lib/function/utils/format'));\n\n// Expressions:\nmath.import(require('mathjs/lib/expression'));\nmath.import(require('mathjs/lib/json'));\n// math.import(require('mathjs/lib/utils/string'));\n\nmodule.exports = math;\n","import {Utils, log} from \"sd-utils\";\nimport * as domain from \"./domain\";\nimport {ValidationResult} from \"./validation-result\";\n\n/*\n * Data model manager\n * */\nexport class DataModel {\n\n    nodes = [];\n    edges = [];\n\n    texts = []; //floating texts\n    payoffNames = [];\n    defaultCriterion1Weight = 1;\n    weightLowerBound = 0;\n    weightUpperBound = Infinity;\n\n\n    expressionScope = {}; //global expression scope\n    code = \"\";//global expression code\n    $codeError = null; //code evaluation errors\n    $codeDirty = false; // is code changed without reevaluation?\n    $version=1;\n\n    validationResults = [];\n\n    // undo / redo\n    maxStackSize = 5;\n    undoStack = [];\n    redoStack = [];\n    undoRedoStateChangedCallback = null;\n    nodeAddedCallback = null;\n    nodeRemovedCallback = null;\n\n    textAddedCallback = null;\n    textRemovedCallback = null;\n\n    callbacksDisabled = false;\n\n    constructor(data) {\n        if(data){\n            this.load(data);\n        }\n    }\n\n    getJsonReplacer(filterLocation=false, filterComputed=false, replacer, filterPrivate =true){\n        return function (k, v) {\n\n            if ((filterPrivate && Utils.startsWith(k, '$')) || k == 'parentNode') {\n                return undefined;\n            }\n            if (filterLocation && k == 'location') {\n                return undefined;\n            }\n            if (filterComputed && k == 'computed') {\n                return undefined;\n            }\n\n            if (replacer){\n                return replacer(k, v);\n            }\n\n            return v;\n        }\n    }\n\n    removeDistributions() {\n        this.nodes.forEach(node => {\n            delete node.distribution;\n        })\n        this.edges.forEach(edge => {\n            delete edge.distribution;\n        })\n    }\n\n\n    serialize(stringify=true, filterLocation=false, filterComputed=false, replacer, filterPrivate =true){\n        this.removeDistributions()\n        var data =  {\n            code: this.code,\n            expressionScope: this.expressionScope,\n            trees: this.getRoots(),\n            texts: this.texts,\n            payoffNames: this.payoffNames.slice(),\n            defaultCriterion1Weight: this.defaultCriterion1Weight,\n            weightLowerBound: this.weightLowerBound,\n            weightUpperBound: this.weightUpperBound\n        };\n\n        if(!stringify){\n            return data;\n        }\n\n        return Utils.stringify(data, this.getJsonReplacer(filterLocation, filterComputed, replacer, filterPrivate), []);\n    }\n\n\n    /*Loads serialized data*/\n    load(data) {\n        //roots, texts, code, expressionScope\n        var callbacksDisabled = this.callbacksDisabled;\n        this.callbacksDisabled = true;\n\n        this.clear();\n\n\n        data.trees.forEach(nodeData=> {\n            var node = this.createNodeFromData(nodeData);\n        });\n\n        if (data.texts) {\n            data.texts.forEach(textData=> {\n                var location = new domain.Point(textData.location.x, textData.location.y);\n                var text = new domain.Text(location, textData.value);\n                this.texts.push(text);\n            })\n        }\n\n        this.clearExpressionScope();\n        this.code = data.code || '';\n\n        if (data.expressionScope) {\n            Utils.extend(this.expressionScope, data.expressionScope);\n        }\n\n        if (data.payoffNames !== undefined && data.payoffNames !== null) {\n            this.payoffNames = data.payoffNames;\n        }\n\n        if (data.defaultCriterion1Weight !== undefined && data.defaultCriterion1Weight !== null) {\n            this.defaultCriterion1Weight = data.defaultCriterion1Weight;\n        }\n\n        if (data.weightLowerBound !== undefined && data.weightLowerBound !== null) {\n            this.weightLowerBound = data.weightLowerBound;\n        }\n\n        if (data.weightUpperBound !== undefined && data.weightUpperBound !== null) {\n            this.weightUpperBound = data.weightUpperBound;\n        }\n\n\n        this.callbacksDisabled = callbacksDisabled;\n    }\n\n    getDTO(filterLocation=false, filterComputed=false, filterPrivate =false){\n        var dto = {\n            serializedData: this.serialize(true, filterLocation, filterComputed, null, filterPrivate),\n            $codeError: this.$codeError,\n            $codeDirty: this.$codeDirty,\n            validationResults: this.validationResults.slice()\n\n        };\n        return dto\n    }\n\n    loadFromDTO(dto, dataReviver){\n        this.load(JSON.parse(dto.serializedData, dataReviver));\n        this.$codeError = dto.$codeError;\n        this.$codeDirty = dto.$codeDirty;\n        this.validationResults.length=0;\n        dto.validationResults.forEach(v=>{\n            this.validationResults.push(ValidationResult.createFromDTO(v))\n        })\n    }\n\n    /*This method updates only computation results/validation*/\n    updateFrom(dataModel){\n        if(this.$version>dataModel.$version){\n            log.warn(\"DataModel.updateFrom: version of current model greater than update\")\n            return;\n        }\n        var byId = {}\n        dataModel.nodes.forEach(n=>{\n            byId[n.$id] = n;\n        });\n        this.nodes.forEach((n,i)=>{\n            if(byId[n.$id]){\n                n.loadComputedValues(byId[n.$id].computed);\n            }\n        });\n        dataModel.edges.forEach(e=>{\n            byId[e.$id] = e;\n        });\n        this.edges.forEach((e,i)=>{\n            if(byId[e.$id]){\n                e.loadComputedValues(byId[e.$id].computed);\n            }\n        });\n        this.expressionScope = dataModel.expressionScope;\n        this.$codeError = dataModel.$codeError;\n        this.$codeDirty = dataModel.$codeDirty;\n        this.validationResults  = dataModel.validationResults;\n    }\n\n    getGlobalVariableNames(filterFunction = true){\n        var res = [];\n        Utils.forOwn(this.expressionScope, (value, key)=>{\n            if(filterFunction && Utils.isFunction(value)){\n                return;\n            }\n            res.push(key);\n        });\n        return res;\n    }\n\n    /*create node from serialized data*/\n    createNodeFromData(data, parent) {\n        var node, location;\n\n        if(data.location){\n            location = new domain.Point(data.location.x, data.location.y);\n        }else{\n            location = new domain.Point(0,0);\n        }\n\n        if (domain.DecisionNode.$TYPE == data.type) {\n            node = new domain.DecisionNode(location, data.milestone);\n        } else if (domain.ChanceNode.$TYPE == data.type) {\n            node = new domain.ChanceNode(location, data.milestone);\n        } else if (domain.TerminalNode.$TYPE == data.type) {\n            node = new domain.TerminalNode(location, data.milestone);\n        }\n        if(data.$id){\n            node.$id = data.$id;\n        }\n        if(data.$fieldStatus){\n            node.$fieldStatus = data.$fieldStatus;\n        }\n        node.name = data.name;\n\n        if(data.code){\n            node.code = data.code;\n        }\n        if (data.expressionScope) {\n            node.expressionScope = data.expressionScope\n        }\n        if(data.computed){\n            node.loadComputedValues(data.computed);\n        }\n\n        node.folded = !!data.folded;\n\n        var edgeOrNode = this.addNode(node, parent);\n        data.childEdges.forEach(ed=> {\n            var edge = this.createNodeFromData(ed.childNode, node);\n            if(Utils.isArray(ed.payoff)){\n                edge.payoff = ed.payoff;\n            }else{\n                edge.payoff = [ed.payoff, 0];\n            }\n\n            edge.probability = ed.probability;\n            edge.name = ed.name;\n            if(ed.computed){\n                edge.loadComputedValues(ed.computed);\n            }\n            if(ed.$id){\n                edge.$id = ed.$id;\n            }\n            if(ed.$fieldStatus){\n                edge.$fieldStatus = ed.$fieldStatus;\n            }\n        });\n\n        return edgeOrNode;\n    }\n\n    /*returns node or edge from parent to this node*/\n    addNode(node, parent) {\n        var self = this;\n        self.nodes.push(node);\n        if (parent) {\n            var edge = self._addChild(parent, node);\n            this._fireNodeAddedCallback(node);\n            return edge;\n        }\n\n        this._fireNodeAddedCallback(node);\n        return node;\n    }\n\n    /*injects given node into given edge*/\n    injectNode(node, edge) {\n        var parent = edge.parentNode;\n        var child = edge.childNode;\n        this.nodes.push(node);\n        node.$parent = parent;\n        edge.childNode = node;\n        this._addChild(node, child);\n        this._fireNodeAddedCallback(node);\n    }\n\n    _addChild(parent, child) {\n        var self = this;\n        var edge = new domain.Edge(parent, child);\n        self._setEdgeInitialProbability(edge);\n        self.edges.push(edge);\n\n        parent.childEdges.push(edge);\n        child.$parent = parent;\n        return edge;\n    }\n\n    _setEdgeInitialProbability(edge) {\n        if (edge.parentNode instanceof domain.ChanceNode) {\n            edge.probability = '#';\n        } else {\n            edge.probability = undefined;\n        }\n\n    }\n\n    /*removes given node and its subtree*/\n    removeNode(node, $l = 0) {\n\n        var self = this;\n        node.childEdges.forEach(e=>self.removeNode(e.childNode, $l + 1));\n\n        self._removeNode(node);\n        var parent = node.$parent;\n        if (parent) {\n            var parentEdge = Utils.find(parent.childEdges, (e, i)=> e.childNode === node);\n            if ($l == 0) {\n                self.removeEdge(parentEdge);\n            } else {\n                self._removeEdge(parentEdge);\n            }\n        }\n        this._fireNodeRemovedCallback(node);\n    }\n\n    /*removes given nodes and their subtrees*/\n    removeNodes(nodes) {\n\n        var roots = this.findSubtreeRoots(nodes);\n        roots.forEach(n=>this.removeNode(n, 0), this);\n    }\n\n    convertNode(node, typeToConvertTo){\n        var newNode;\n        if(!node.childEdges.length && node.$parent){\n            newNode = this.createNodeByType(typeToConvertTo, node.location);\n        }else{\n            if(node instanceof domain.DecisionNode && typeToConvertTo==domain.ChanceNode.$TYPE){\n                newNode = this.createNodeByType(typeToConvertTo, node.location);\n            }else if(typeToConvertTo==domain.DecisionNode.$TYPE){\n                newNode = this.createNodeByType(typeToConvertTo, node.location);\n            }\n        }\n\n        if(newNode){\n            newNode.name=node.name;\n            this.replaceNode(newNode, node);\n            newNode.childEdges.forEach(e=>this._setEdgeInitialProbability(e));\n            this._fireNodeAddedCallback(newNode);\n        }\n\n    }\n\n    createNodeByType(type, location){\n        if(type==domain.DecisionNode.$TYPE){\n            return new domain.DecisionNode(location)\n        }else if(type==domain.ChanceNode.$TYPE){\n            return new domain.ChanceNode(location)\n        }else if(type==domain.TerminalNode.$TYPE){\n            return new domain.TerminalNode(location)\n        }\n    }\n\n    replaceNode(newNode, oldNode){\n        var parent = oldNode.$parent;\n        newNode.$parent = parent;\n\n        if(parent){\n            var parentEdge = Utils.find(newNode.$parent.childEdges, e=>e.childNode===oldNode);\n            parentEdge.childNode = newNode;\n        }\n        newNode.milestone = oldNode.milestone;\n        newNode.childEdges = oldNode.childEdges;\n        newNode.childEdges.forEach(e=>{\n            e.parentNode=newNode\n            e.childNode.$parent=newNode\n        });\n\n        var index = this.nodes.indexOf(oldNode);\n        if(~index){\n            this.nodes[index]=newNode;\n        }\n    }\n\n    getRoots() {\n        return this.nodes.filter(n=>!n.$parent);\n    }\n\n    findSubtreeRoots(nodes) {\n        return nodes.filter(n=>!n.$parent || nodes.indexOf(n.$parent) === -1);\n    }\n\n    /*creates detached clone of given node*/\n    cloneSubtree(nodeToCopy, cloneComputedValues) {\n        var self = this;\n        var clone = this.cloneNode(nodeToCopy);\n        delete clone.charts;\n        \n\n        nodeToCopy.childEdges.forEach(e=> {\n            var childClone = self.cloneSubtree(e.childNode, cloneComputedValues);\n            childClone.$parent = clone;\n            var edge = Utils.clone(e);\n            edge.$id = Utils.guid();\n            edge.parentNode = clone;\n            edge.childNode = childClone;\n            edge.payoff = Utils.cloneDeep(e.payoff);\n            edge.computed = {};\n            if (cloneComputedValues) {\n                edge.computed = Utils.cloneDeep(e.computed);\n                childClone.computed = Utils.cloneDeep(e.childNode.computed)\n            }\n            clone.childEdges.push(edge);\n        });\n        if (cloneComputedValues) {\n            clone.computed = Utils.cloneDeep(nodeToCopy.computed)\n        }\n        return clone;\n    }\n\n    /*attaches detached subtree to given parent*/\n    attachSubtree(nodeToAttach, parent) {\n        var self = this;\n        var nodeOrEdge = self.addNode(nodeToAttach, parent);\n\n        nodeToAttach.expressionScope = null;\n\n        var childEdges = self.getAllDescendantEdges(nodeToAttach);\n        childEdges.forEach(e=> {\n            self.edges.push(e);\n            self.nodes.push(e.childNode);\n            e.childNode.expressionScope = null;\n        });\n\n        return nodeOrEdge;\n    }\n\n    cloneNodes(nodes) {\n        var roots = []\n        //TODO\n    }\n\n    /*shallow clone without parent and children*/\n    cloneNode(node) {\n        var clone = Utils.clone(node)\n        clone.$id = Utils.guid();\n        clone.location = Utils.clone(node.location);\n        clone.computed = Utils.clone(node.computed);\n        clone.$parent = null;\n        clone.childEdges = [];\n        return clone;\n    }\n\n    findNodeById(id) {\n        return Utils.find(this.nodes, n=>n.$id == id);\n    }\n\n    findEdgeById(id) {\n        return Utils.find(this.edges, e=>e.$id == id);\n    }\n\n    findById(id) {\n        var node = this.findNodeById(id);\n        if (node) {\n            return node;\n        }\n        return this.findEdgeById(id);\n    }\n\n    _removeNode(node) {// simply removes node from node list\n        var index = this.nodes.indexOf(node);\n        if (index > -1) {\n            this.nodes.splice(index, 1);\n        }\n    }\n\n    removeEdge(edge) {\n        var index = edge.parentNode.childEdges.indexOf(edge);\n        if (index > -1) {\n            edge.parentNode.childEdges.splice(index, 1);\n        }\n        this._removeEdge(edge);\n    }\n\n    _removeEdge(edge) { //removes edge from edge list without removing connected nodes\n        var index = this.edges.indexOf(edge);\n        if (index > -1) {\n            this.edges.splice(index, 1);\n        }\n    }\n\n    _removeNodes(nodesToRemove) {\n        this.nodes = this.nodes.filter(n=>nodesToRemove.indexOf(n) === -1);\n    }\n\n    _removeEdges(edgesToRemove) {\n        this.edges = this.edges.filter(e=>edgesToRemove.indexOf(e) === -1);\n    }\n\n    getAllDescendantEdges(node) {\n        var self = this;\n        var result = [];\n\n        node.childEdges.forEach(e=> {\n            result.push(e);\n            if (e.childNode) {\n                result.push(...self.getAllDescendantEdges(e.childNode));\n            }\n        });\n\n        return result;\n    }\n\n    getAllDescendantNodes(node) {\n        var self = this;\n        var result = [];\n\n        node.childEdges.forEach(e=> {\n            if (e.childNode) {\n                result.push(e.childNode);\n                result.push(...self.getAllDescendantNodes(e.childNode));\n            }\n        });\n\n        return result;\n    }\n\n    getAllNodesInSubtree(node) {\n        var descendants = this.getAllDescendantNodes(node);\n        descendants.unshift(node);\n        return descendants;\n    }\n\n    isUndoAvailable() {\n        return !!this.undoStack.length\n    }\n\n    isRedoAvailable() {\n        return !!this.redoStack.length\n    }\n\n    createStateSnapshot(revertConf){\n        return {\n            revertConf: revertConf,\n            nodes: Utils.cloneDeep(this.nodes),\n            edges: Utils.cloneDeep(this.edges),\n            texts: Utils.cloneDeep(this.texts),\n            payoffNames: Utils.cloneDeep(this.payoffNames),\n            defaultCriterion1Weight: Utils.cloneDeep(this.defaultCriterion1Weight),\n            weightLowerBound: Utils.cloneDeep(this.weightLowerBound),\n            weightUpperBound: Utils.cloneDeep(this.weightUpperBound),\n            expressionScope: Utils.cloneDeep(this.expressionScope),\n            code: this.code,\n            $codeError: this.$codeError\n        }\n    }\n\n\n    saveStateFromSnapshot(state){\n        this.redoStack.length = 0;\n\n        this._pushToStack(this.undoStack, state);\n\n        this._fireUndoRedoCallback();\n\n        return this;\n    }\n\n    saveState(revertConf) {\n        this.saveStateFromSnapshot(this.createStateSnapshot(revertConf));\n        return this;\n    }\n\n    undo() {\n        var self = this;\n        var newState = this.undoStack.pop();\n        if (!newState) {\n            return;\n        }\n\n        this._pushToStack(this.redoStack, {\n            revertConf: newState.revertConf,\n            nodes: self.nodes,\n            edges: self.edges,\n            texts: self.texts,\n            payoffNames: self.payoffNames,\n            defaultCriterion1Weight: self.defaultCriterion1Weight,\n            weightLowerBound: self.weightLowerBound,\n            weightUpperBound: self.weightUpperBound,\n            expressionScope: self.expressionScope,\n            code: self.code,\n            $codeError: self.$codeError\n\n        });\n\n        this._setNewState(newState);\n\n        this._fireUndoRedoCallback();\n\n        return this;\n    }\n\n    redo() {\n        var self = this;\n        var newState = this.redoStack.pop();\n        if (!newState) {\n            return;\n        }\n\n        this._pushToStack(this.undoStack, {\n            revertConf: newState.revertConf,\n            nodes: self.nodes,\n            edges: self.edges,\n            texts: self.texts,\n            payoffNames: self.payoffNames,\n            defaultCriterion1Weight: self.defaultCriterion1Weight,\n            weightLowerBound: self.weightLowerBound,\n            weightUpperBound: self.weightUpperBound,\n            expressionScope: self.expressionScope,\n            code: self.code,\n            $codeError: self.$codeError\n        });\n\n        this._setNewState(newState, true);\n\n        this._fireUndoRedoCallback();\n\n        return this;\n    }\n\n    clear() {\n        this.nodes.length = 0;\n        this.edges.length = 0;\n        this.undoStack.length = 0;\n        this.redoStack.length = 0;\n        this.texts.length = 0;\n        this.clearExpressionScope();\n        this.code = '';\n        this.$codeError = null;\n        this.$codeDirty = false;\n\n        this.payoffNames = [];\n        this.defaultCriterion1Weight = 1;\n        this.weightLowerBound = 0;\n        this.weightUpperBound = Infinity;\n    }\n\n    clearComputedValues(){\n        this.nodes.forEach(n=>n.clearComputedValues());\n        this.edges.forEach(e=>e.clearComputedValues());\n    }\n\n    addText(text) {\n        this.texts.push(text);\n\n        this._fireTextAddedCallback(text);\n    }\n\n    removeTexts(texts) {\n        texts.forEach(t=>this.removeText(t));\n    }\n\n    removeText(text) {\n        var index = this.texts.indexOf(text);\n        if (index > -1) {\n            this.texts.splice(index, 1);\n            this._fireTextRemovedCallback(text);\n        }\n    }\n\n    clearExpressionScope() {\n        Utils.forOwn(this.expressionScope, (value, key)=> {\n            delete this.expressionScope[key];\n        });\n    }\n\n    reversePayoffs(){\n        this.payoffNames.reverse();\n        this.edges.forEach(e=>e.payoff.reverse())\n    }\n\n    _setNewState(newState, redo) {\n        var nodeById = Utils.getObjectByIdMap(newState.nodes);\n        var edgeById = Utils.getObjectByIdMap(newState.edges);\n        this.nodes = newState.nodes;\n        this.edges = newState.edges;\n        this.texts = newState.texts;\n        this.payoffNames = newState.payoffNames;\n        this.defaultCriterion1Weight = newState.defaultCriterion1Weight;\n        this.weightLowerBound = newState.weightLowerBound;\n        this.weightUpperBound = newState.weightUpperBound;\n        this.expressionScope = newState.expressionScope;\n        this.code = newState.code;\n        this.$codeError  = newState.$codeError\n\n        this.nodes.forEach(n=> {\n            for (var i = 0; i < n.childEdges.length; i++) {\n                var edge = edgeById[n.childEdges[i].$id];\n                n.childEdges[i] = edge;\n                edge.parentNode = n;\n                edge.childNode = nodeById[edge.childNode.$id];\n            }\n\n        });\n\n        if (newState.revertConf) {\n            if (!redo && newState.revertConf.onUndo) {\n                newState.revertConf.onUndo(newState.revertConf.data);\n            }\n            if (redo && newState.revertConf.onRedo) {\n                newState.revertConf.onRedo(newState.revertConf.data);\n            }\n\n\n        }\n        this.revertConf = newState.revertConf;\n    }\n\n\n    _pushToStack(stack, obj) {\n        if (stack.length >= this.maxStackSize) {\n            stack.shift();\n        }\n        stack.push(obj);\n    }\n\n    _fireUndoRedoCallback() {\n        if (!this.callbacksDisabled && this.undoRedoStateChangedCallback) {\n            this.undoRedoStateChangedCallback();\n        }\n    }\n\n    _fireNodeAddedCallback(node) {\n        if (!this.callbacksDisabled && this.nodeAddedCallback) {\n            this.nodeAddedCallback(node);\n        }\n    }\n\n    _fireNodeRemovedCallback(node) {\n        if (!this.callbacksDisabled && this.nodeRemovedCallback) {\n            this.nodeRemovedCallback(node);\n        }\n    }\n\n    _fireTextAddedCallback(text) {\n        if (!this.callbacksDisabled && this.textAddedCallback) {\n            this.textAddedCallback(text);\n        }\n    }\n\n    _fireTextRemovedCallback(text) {\n        if (!this.callbacksDisabled && this.textRemovedCallback) {\n            this.textRemovedCallback(text);\n        }\n    }\n}\n","import {ObjectWithComputedValues} from \"./object-with-computed-values\";\n\nexport class Edge extends ObjectWithComputedValues {\n    parentNode;\n    childNode;\n\n    name = '';\n    probability = undefined;\n    payoff = [0, 0];\n\n    $DISPLAY_VALUE_NAMES = ['probability', 'payoff', 'optimal'];\n\n    constructor(parentNode, childNode, name, payoff, probability,) {\n        super();\n        this.parentNode = parentNode;\n        this.childNode = childNode;\n\n        if (name !== undefined) {\n            this.name = name;\n        }\n        if (probability !== undefined) {\n            this.probability = probability;\n        }\n        if (payoff !== undefined) {\n            this.payoff = payoff\n        }\n\n    }\n\n    setName(name) {\n        this.name = name;\n        return this;\n    }\n\n    setProbability(probability) {\n        this.probability = probability;\n        return this;\n    }\n\n    setPayoff(payoff, index = 0) {\n        this.payoff[index] = payoff;\n        return this;\n    }\n\n    computedBaseProbability(val) {\n        return this.computedValue(null, 'probability', val);\n    }\n\n    computedBasePayoff(val, index = 0) {\n        return this.computedValue(null, 'payoff[' + index + ']', val);\n    }\n\n    displayProbability(val) {\n        return this.displayValue('probability', val);\n    }\n\n    displayPayoff(val, index = 0) {\n        return this.displayValue('payoff[' + index + ']', val);\n    }\n}\n","export * from './node/node'\nexport * from './node/decision-node'\nexport * from './node/chance-node'\nexport * from './node/terminal-node'\nexport * from './edge'\nexport * from './point'\nexport * from './text'\n","import {Node} from './node'\n\nexport class ChanceNode extends Node{\n\n    static $TYPE = 'chance';\n\n    constructor(location, milestone=undefined){\n        super(ChanceNode.$TYPE, location, milestone);\n    }\n}\n","import {Node} from './node'\n\nexport class DecisionNode extends Node{\n\n    static $TYPE = 'decision';\n\n    constructor(location, milestone=undefined){\n        super(DecisionNode.$TYPE, location, milestone);\n    }\n}\n","import {Point} from '../point'\nimport {ObjectWithComputedValues} from '../object-with-computed-values'\n\nexport class Node extends ObjectWithComputedValues{\n\n    type;\n    childEdges=[];\n    name='';\n\n    location; //Point\n    milestone;\n\n    code='';\n    $codeDirty = false; // is code changed without reevaluation?\n    $codeError = null; //code evaluation errors\n\n    expressionScope=null;\n\n    folded = false; // is node folded along with its subtree\n\n    $DISPLAY_VALUE_NAMES = ['childrenPayoff', 'aggregatedPayoff', 'probabilityToEnter', 'optimal']\n\n    constructor(type, location, milestone){\n        super();\n        this.location=location;\n        if(!location){\n            this.location = new Point(0,0);\n        }\n        this.type=type;\n        this.milestone=milestone;\n    }\n\n    setName(name){\n        this.name = name;\n        return this;\n    }\n\n    moveTo(x,y, withChildren){ //move to new location\n        if(withChildren){\n            var dx = x-this.location.x;\n            var dy = y-this.location.y;\n            this.childEdges.forEach(e=>e.childNode.move(dx, dy, true))\n        }\n\n        this.location.moveTo(x,y);\n        return this;\n    }\n\n    move(dx, dy, withChildren){ //move by vector\n        if(withChildren){\n            this.childEdges.forEach(e=>e.childNode.move(dx, dy, true))\n        }\n        this.location.move(dx, dy);\n        return this;\n    }\n\n    setMilestone(milestone) {\n        this.milestone = milestone;\n    }\n\n    getMilestone() {\n        return this.milestone;\n    }\n}\n","import {Node} from './node'\n\nexport class TerminalNode extends Node{\n\n    static $TYPE = 'terminal';\n\n    constructor(location, milestone=undefined){\n        super(TerminalNode.$TYPE, location, milestone);\n    }\n}\n","import {Utils} from 'sd-utils'\n\nimport {ObjectWithIdAndEditableFields} from \"./object-with-id-and-editable-fields\";\n\nexport class ObjectWithComputedValues extends ObjectWithIdAndEditableFields{\n\n    computed={}; //computed values\n\n    /*get or set computed value*/\n    computedValue(ruleName, fieldPath, value){\n        var path = 'computed.';\n        if(ruleName){\n            path+=ruleName+'.';\n        }\n        path+=fieldPath;\n        if(value===undefined){\n            return  Utils.get(this, path, null);\n        }\n        Utils.set(this, path, value);\n        return value;\n    }\n\n    clearComputedValues(ruleName){\n        if(ruleName==undefined){\n            this.computed={};\n            return;\n        }\n        if(Utils.isArray(ruleName)){\n            ruleName.forEach(n=>{\n                this.computed[n]={};\n            });\n            return;\n        }\n        this.computed[ruleName]={};\n    }\n\n    clearDisplayValues(){\n        this.computed['$displayValues']={};\n    }\n\n    displayValue(fieldPath, value){\n        return this.computedValue(null, '$displayValues.'+fieldPath, value);\n    }\n\n    loadComputedValues(computed){\n        this.computed = Utils.cloneDeep(computed);\n    }\n}\n","import {Utils} from 'sd-utils'\n\nexport class ObjectWithIdAndEditableFields {\n\n    $id = Utils.guid(); //internal id\n    $fieldStatus={};\n\n    getFieldStatus(fieldPath){\n        if(!Utils.get(this.$fieldStatus, fieldPath, null)){\n            Utils.set(this.$fieldStatus, fieldPath, {\n                valid: {\n                    syntax: true,\n                    value: true\n                }\n            });\n        }\n        return Utils.get(this.$fieldStatus, fieldPath);\n    }\n\n    setSyntaxValidity(fieldPath, valid){\n        var fieldStatus = this.getFieldStatus(fieldPath);\n        fieldStatus.valid.syntax = valid;\n    }\n\n    setValueValidity(fieldPath, valid){\n        var fieldStatus = this.getFieldStatus(fieldPath);\n        fieldStatus.valid.value = valid;\n    }\n\n    isFieldValid(fieldPath, syntax=true, value=true){\n        var fieldStatus = this.getFieldStatus(fieldPath);\n        if(syntax && value) {\n            return fieldStatus.valid.syntax && fieldStatus.valid.value;\n        }\n        if(syntax) {\n            return fieldStatus.valid.syntax\n        }\n        return fieldStatus.valid.value;\n    }\n\n\n}\n","export class Point {\n    x;\n    y;\n    constructor(x,y){\n        if(x instanceof Point){\n            y=x.y;\n            x=x.x\n        }else if(Array.isArray(x)){\n            y=x[1];\n            x=x[0];\n        }\n        this.x=x;\n        this.y=y;\n    }\n\n    moveTo(x,y){\n        if(Array.isArray(x)){\n            y=x[1];\n            x=x[0];\n        }\n        this.x=x;\n        this.y=y;\n        return this;\n    }\n\n    move(dx,dy){ //move by vector\n        if(Array.isArray(dx)){\n            dy=dx[1];\n            dx=dx[0];\n        }\n        this.x+=dx;\n        this.y+=dy;\n        return this;\n    }\n\n}\n","import {Point} from \"./point\";\nimport {Utils} from \"sd-utils\";\nimport {ObjectWithIdAndEditableFields} from \"./object-with-id-and-editable-fields\";\n\nexport class Text extends ObjectWithIdAndEditableFields{\n\n    value='';\n    location; //Point\n\n    constructor(location, value){\n        super();\n        this.location=location;\n        if(!location){\n            this.location = new Point(0,0);\n        }\n\n        if(value) {\n            this.value = value;\n        }\n    }\n\n    moveTo(x,y){ //move to new location\n        this.location.moveTo(x,y);\n        return this;\n    }\n\n    move(dx, dy){ //move by vector\n        this.location.move(dx, dy);\n        return this;\n    }\n}\n","import * as domain from './domain'\nexport {domain}\nexport * from './data-model'\nexport * from './validation-result'\n","import {Utils} from \"sd-utils\";\n\nexport class ValidationResult{\n\n\n    errors = {};\n    warnings = {};\n    objectIdToError={};\n\n    addError(error, obj){\n        if(Utils.isString(error)){\n            error = {name: error};\n        }\n        var name = error.name;\n        var errorsByName = this.errors[name];\n        if(!errorsByName){\n            errorsByName=[];\n            this.errors[name]=errorsByName;\n        }\n        var objE = this.objectIdToError[obj.$id];\n        if(!objE){\n            objE=[];\n            this.objectIdToError[obj.$id]= objE;\n        }\n        errorsByName.push(obj);\n        objE.push(error);\n    }\n\n    addWarning(name, obj){\n        var e = this.warnings[name];\n        if(!e){\n            e=[];\n            this.warnings[name]=e;\n        }\n        e.push(obj)\n    }\n\n    isValid(){\n        return Object.getOwnPropertyNames(this.errors).length === 0\n    }\n\n    static createFromDTO(dto){\n        var v = new ValidationResult();\n        v.errors = dto.errors;\n        v.warnings = dto.warnings;\n        v.objectIdToError = dto.objectIdToError;\n        return v;\n    }\n}\n","export const menuList = [\"Uniform(0.0,1.0)\", \"Exponential(1.0)\",\n                         \"Normal(0.0,1.0)\", \"Pareto(1.0,1.0)\",\n                         \"Weibull(1.0,1.0)\", \"Triangular(0.0,1.0,0.5)\",\n                         \"Trapezoidal(0.0,1.0,0.25,0.75)\",\n                         \"LogNormal(0.0,1.0)\", \"Gamma(1.0,1.0)\",\n                         \"Loglogistic(1.0,0.5)\",\"Erlang(4,0.5)\",\n                         \"Bernoulli(0.5)\",\"Binomial(2,0.5)\",\n                         \"Geometric(0.5)\", \"Poisson(2.0)\"];\n\nexport const functionNameList = [\"Uniform\", \"Exponential\",\n                                 \"Normal\", \"Pareto\",\n                                 \"Weibull\", \"Triangular\",\n                                 \"Trapezoidal\",\n                                 \"LogNormal\", \"Gamma\",\n                                 \"Loglogistic\",\"Erlang\",\n                                 \"Bernoulli\",\"Binomial\",\n                                 \"Geometric\", \"Poisson\"];\n\n\nexport const random = Math.random;\n\n/**\n * Uniform distribution implementation.\n * More details at A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 452\n * @param a lower bound\n * @param b upper bound, b >= a\n * @returns Uniform distributed random value\n */\nexport function Uniform(a, b) {\n    if (a == null) a = 0.0;\n    if (b == null) b = 1.0;\n\tif (b < a) return NaN;\n    return a + (b - a)*Math.random();\n}\n\n/**\n * Exponential distribution mplementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 452 \n * @param beta shape parameter, beta > 0,  lambda = 1/beta. For exponential distribution beta is equal to the mean.\n * @returns Exponentially distributed random value\n */\nexport function Exponential(beta) {\n\tif (beta==null) beta == 1;\n\tif (beta<=0) return NaN;\t\n    return -beta * Math.log(Math.random());\n}\n\n/**\n * Normal distribution implementation based on Box and Muller (1958) algorithm\n * Please note that in order to not to store state in this library we use only odd values\n * For discussion see A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 457\n * @param mean mean value\n * @param std standard deviation, std>=0\n * @returns Normally distributed random value\n */\nexport function Normal(mean, std) {\n    if (mean == null) mean = 0.0;\n    if (std == null) std = 1.0;\n    if (std < 0) return NaN;\n\n    let n = Math.sqrt(-2.0 * Math.log(Math.random())) * Math.cos(2.0 * Math.PI * Math.random());\n    return n * std + mean;\n}\n/**\n * Pareto distribution implementation based on \n * https://en.wikipedia.org/wiki/Pareto_distribution#Random_sample_generation\n * \n * @param alpha shape parameter, alpha > 0\n * @param minimum scale parameter, minimum > 0\n * @returns\n */\nexport function Pareto(alpha, minimum) {\n\tif (alpha == null) alpha = 1.0;\n\tif (minimum == null) minimum = 1.0;\n\tif (alpha <= 0 || minimum <= 0) return NaN;\n    return minimum / Math.pow(Math.random(), 1.0 / alpha);\n}\n\n\n/**\n * Log-logistic distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 460\n * @param alpha shape parameter, alpha > 0\n * @param beta scale parameter, beta > 0\n * @returns Log-logistic distributed random value\n */\nexport function Loglogistic(alpha, beta) {\n\tif (alpha == null) alpha = 1.0;\n\tif (beta == null) beta = 1.0;\n\tif (beta <= 0 || alpha <= 0) return NaN;\n\tvar u = Math.random();\n\treturn beta * Math.pow(u/(1-u), 1/alpha);\t\n}\n\n\n/**\n * Weibull distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 456\n * @param alpha shape parameter, alpha > 0\n * @param beta scale parameter, beta > 0\n * @returns Weibull distributed random value\n */\nexport function Weibull(alpha, beta) {\n\tif (alpha == null) alpha = 1.0;\n\tif (beta == null) beta = 1.0;\n\tif (beta <= 0 || alpha <= 0) return NaN;\t\n    return beta * Math.pow(-Math.log(1.0 - Math.random()), 1.0 / alpha);\n}\n\n\n/**\n * Erlang distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 453\n * @param k shape parameter, k = 1,2,3,...\n * @param beta scale parameter, beta > 0, beta = 1/lambda. For Erlang distribution beta is equal to the mean value.\n * @returns Erlang distributed random value\n */\nexport function Erlang(k, beta) {\n\tif (k == null) k = 1;\n\tif (beta == null) beta = 1.0;\n\tvar m = k | 0;\n\tif (beta <= 0 || m <= 0) return NaN;\n\tvar mult = 1.0;\n\tfor (var i=0;i<m;i++) {\n\t\tmult *= Math.random();\n\t}\n    return -beta/m*Math.log(mult);\n}\n\n\n/**\n * Triangular distribution implementation\n * @param a left side\n * @param b right side, b >= a\n * @param m triangle peak (mode), a <= m <= b\n * @returns Triangular distributed random value\n */\nexport function Triangular(a, b, m) {\n    if (a == null) a = 0.0;\n    if (b == null) b = 1.0;\n    if (m == null) m = 0.5;\n    if (a>b || m < a || m > b) return NaN;\n\tif (a==b) return a;\n    var c = (m - a) / (b - a);\n    var p = Math.random();\n    if (p <= c) {\n        return a + Math.sqrt(p * (b - a) * (m - a));\n    } else {\n        return b - Math.sqrt((1 - p) * (b - a) * (b - m));\n    }\n}\n\n\n/**\n * Trapezoidal distribution implementation\n * @param a left side\n * @param b right side, b >= a\n * @param c left trapezoid peak (mode)\n * @param d right trapezoid peak (mode), a <= c <= d <= b\n * @returns Trapezoidal distributed random value\n */\nexport function Trapezoidal(a, b, c, d) {\n    if (a == null) a = 0.0;\n    if (b == null) b = 1.0;\n    if (c == null) c = 0.25;\n    if (d == null) d = 0.75;\n    if (a > b || c < a || c > d || d > b) return NaN;\n\tif (a==b) return a;\n    var p1 = (c - a) / ( (b - a)+(d - c));\n    var p2 = (b - d) / ( (b - a)+(d - c));\n    var p = Math.random();\n    \n    if (p <= p1) {\n        return a + Math.sqrt(p * ((b - a)+(d - c)) * (c - a) );\n    } else if (p > 1-p2) {\n        return b - Math.sqrt((1 - p) * ((b - a)+(d - c)) * (b - d));\n    } else {\n    \treturn c + (d-c)*(p-p1)/(1.0 - p1 - p2);\n    }\n}\n\n/**\n * Lognormal distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 458\n * @param mean mean value\n * @param std standard deviation\n * @returns Lognormally distributed random value\n */\nexport function LogNormal(mean, std) {\n    if (mean == null) mean = 0.0;\n    if (std == null) std = 1.0;\n    if (std < 0) return NaN;\n    return Math.exp(Normal(mean, std))\n}\n\n\n\n/**\n * Bernoulli distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 464\n * @param p probability of 1\n * @returns Bernoulli distributed random value (zero or one)\n */\nexport function Bernoulli(p) {\n\tif (p==null) p = 0.5;\n\tif (p<0.0 | p > 1.0) return NaN;\n    if (Math.random()<=p)\n    \treturn 1;\n    else \n    \treturn 0;\n}\n\n\n/**\n * Binomial distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 469\n * @param n number of trials\n * @param p success probability in each trial\n * @returns Binomial distributed random value (0,1,...,n)\n */\nexport function Binomial(n,p) {\n\tif (n==null) n = 1;\n\tif (p==null) p = 0.5;\t\n\tvar t = n | 0;\n\tif ( p < 0.0 | p > 1.0 | t <= 0) return NaN;\n\tvar sum = 0;\n\tfor (var i=0;i<t;i++) {\n\t\tsum += Bernoulli(p);\n\t}\n    return sum;\n}\n\n/**\n * Geometric distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 469\n * @param p success probability \n * @returns Geometric distributed random value \n */\nexport function Geometric(p) {\n\tif (p==null) p = 0.5;\t\n\tif ( p <= 0.0 | p >= 1.0 ) return NaN;\t\n    return Math.floor(Math.log(Math.random())/Math.log(1-p) ) | 0;\n}\n\n/**\n * Poisson distribution implementation based on A.Law \"Simulation Modelling and Analysis\", 5e, Mc Graw-Hill, 2015, p. 470\n * @param lambda mean value \n * @returns Poisson distributed random value \n */\nexport function Poisson(lambda) {\n\tif (lambda==null) lambda = 1.0;\t\n\tif ( lambda <= 0.0 ) return NaN;\t\n\tvar a = Math.exp(-lambda);\n\tvar b = 1.0;\n\tvar i = 0;\t\n\twhile (true) {\n\t\tvar u = Math.random();\n\t\tb *= u;\n\t\tif (b < a) return i;\n\t\ti += 1;\n\t}\n}\n\n/**\n * Gamma distribution implementation.\n * This code has been copied from\n * https://github.com/btelles/simjs-updated/\n * simjs-updated is licensed under MIT Open Source License termns \n * @param alpha shape parameter\n * @param beta rate parameter \n * @returns Gamma distributed random value.\n */\nexport function Gamma(alpha, beta) {\n\tif (alpha == null) alpha = 1.0;\n\tif (beta == null) beta = 1.0;\n    if (alpha > 1.0) {\n        let ainv = Math.sqrt(2.0 * alpha - 1.0),\n            bbb = alpha - Math.log(4.0),\n            ccc = alpha + ainv;\n\n        while (true) {  // eslint-disable-line no-constant-condition\n            let u1 = random();\n\n            if ((u1 < 1e-7) || (u > 0.9999999)) {\n                continue;\n            }\n            let u2 = 1.0 - random(),\n                v = Math.log(u1 / (1.0 - u1)) / ainv,\n                x = alpha * Math.exp(v),\n                z = u1 * u1 * u2,\n                r = bbb + ccc * v - x;\n            if ((r + Math.log(4.5) - 3.5 * z >= 0.0) || (r >= Math.log(z))) {\n                return x * beta;\n            }\n        }\n    } else if (alpha == 1.0) {\n        let u = random();\n        while (u <= 1e-7) {\n            u = random();\n        }\n        return -Math.log(u) * beta;\n    } else {\n        let x;\n        while (true) {\n            let u = random(),\n                b = (Math.E + alpha) / Math.E,\n                p = b * u;\n            if (p <= 1.0) {\n                x = Math.pow(p, 1.0 / alpha);\n            } else {\n                x = -Math.log((b - p) / alpha);\n            }\n            const u1 = random();\n\n            if (p > 1.0) {\n                if (u1 <= Math.pow(x, (alpha - 1.0))) {\n                    break;\n                }\n            } else if (u1 <= Math.exp(-x)) {\n                break;\n            }\n        }\n        return x * beta;\n    }\n}\n","import * as _ from \"lodash\";\n\nexport class Utils {\n    static SQRT_2 = 1.41421356237;\n    // usage example deepExtend({}, objA, objB); => should work similar to $.extend(true, {}, objA, objB);\n    static deepExtend(out) {\n\n        var utils = this;\n        var emptyOut = {};\n\n\n        if (!out && arguments.length > 1 && Array.isArray(arguments[1])) {\n            out = [];\n        }\n        out = out || {};\n\n        for (var i = 1; i < arguments.length; i++) {\n            var source = arguments[i];\n            if (!source)\n                continue;\n\n            for (var key in source) {\n                if (!source.hasOwnProperty(key)) {\n                    continue;\n                }\n                var isArray = Array.isArray(out[key]);\n                var isObject = utils.isObject(out[key]);\n                var srcObj = utils.isObject(source[key]);\n\n                if (isObject && !isArray && srcObj) {\n                    utils.deepExtend(out[key], source[key]);\n                } else {\n                    out[key] = source[key];\n                }\n            }\n        }\n\n        return out;\n    };\n\n    static extend (a, b) {\n        var n;\n        if (!a) {\n            a = {};\n        }\n        for (n in b) {\n            a[n] = b[n];\n        }\n        return a;\n    };\n\n    static mergeDeep(target, source) {\n        let output = Object.assign({}, target);\n        if (Utils.isObjectNotArray(target) && Utils.isObjectNotArray(source)) {\n            Object.keys(source).forEach(key => {\n                if (Utils.isObjectNotArray(source[key])) {\n                    if (!(key in target))\n                        Object.assign(output, {[key]: source[key]});\n                    else\n                        output[key] = Utils.mergeDeep(target[key], source[key]);\n                } else {\n                    Object.assign(output, {[key]: source[key]});\n                }\n            });\n        }\n        return output;\n    }\n\n    static getVariablesAsList(scope){\n        var result = [];\n        _.forOwn(scope, function(value, key) {\n            if(Utils.isFunction(value)){\n                return;\n                // value = value.syntax;\n            }\n            result.push({\n                key: key,\n                value: value\n            })\n\n        });\n\n        return result;\n    }\n\n    static cross(a, b) {\n        var c = [], n = a.length, m = b.length, i, j;\n        for (i = -1; ++i < n;) for (j = -1; ++j < m;) c.push({x: a[i], i: i, y: b[j], j: j});\n        return c;\n    };\n\n    static isObjectNotArray(item) {\n        return (item && typeof item === 'object' && !Array.isArray(item) && item !== null);\n    };\n\n    static isArray(item) {\n        return Array.isArray(item);\n    };\n\n    static isObject(a) {\n        return a !== null && typeof a === 'object';\n    };\n\n    static isNumber(a) {\n        return !isNaN(a) && typeof a === 'number';\n    };\n\n    static  isNumeric(n) {\n        return !isNaN(parseFloat(n)) && isFinite(n);\n    }\n\n    static isInt(n){\n        return Utils.isNumber(n) && n % 1 === 0;\n    }\n\n    static isFunction(a) {\n        return typeof a === 'function';\n    };\n\n    static isDate(a) {\n        return Object.prototype.toString.call(a) === '[object Date]'\n    }\n\n    static isString(a) {\n        return typeof a === 'string' || a instanceof String\n    }\n\n    static guid() {\n        function s4() {\n            return Math.floor((1 + Math.random()) * 0x10000)\n                .toString(16)\n                .substring(1);\n        }\n\n        return s4() + s4() + '-' + s4() + '-' + s4() + '-' +\n            s4() + '-' + s4() + s4() + s4();\n    }\n\n\n    static capitalizeFirstLetter(string) {\n        return string.charAt(0).toUpperCase() + string.slice(1);\n    }\n\n    static getObjectByIdMap(objectList, mappingFn, idPropertyName='$id') {\n        var objectById = {};\n        if (!objectList) {\n            return objectById;\n        }\n        objectList.forEach(function (obj) {\n            var val = obj;\n            if (mappingFn) {\n                val = mappingFn(obj);\n            }\n            objectById[obj[idPropertyName]] = val;\n        });\n        return objectById;\n    };\n\n\n    static timers = {};\n    static waitForFinalEvent(callback, uniqueId, ms=50) {\n        if (!uniqueId) {\n            uniqueId = \"Don't call this twice without a uniqueId\";\n        }\n        if (Utils.timers[uniqueId]) {\n            clearTimeout (Utils.timers[uniqueId]);\n        }\n        Utils.timers[uniqueId] = setTimeout(callback, ms);\n\n        return () => clearTimeout (Utils.timers[uniqueId]);\n    };\n\n    /**\n     * detect IE\n     * returns version of IE or false, if browser is not Internet Explorer\n     */\n    static detectIE() {\n        var ua = window.navigator.userAgent;\n        var msie = ua.indexOf('MSIE ');\n        if (msie > 0) {\n            // IE 10 or older => return version number\n            return parseInt(ua.substring(msie + 5, ua.indexOf('.', msie)), 10);\n        }\n\n        var trident = ua.indexOf('Trident/');\n        if (trident > 0) {\n            // IE 11 => return version number\n            var rv = ua.indexOf('rv:');\n            return parseInt(ua.substring(rv + 3, ua.indexOf('.', rv)), 10);\n        }\n\n        // other browser\n        return false;\n    }\n\n    static detectEdge(){\n        var ua = window.navigator.userAgent;\n        var edge = ua.indexOf('Edge/');\n        if (edge > 0) {\n            // Edge (IE 12+) => return version number\n            return parseInt(ua.substring(edge + 5, ua.indexOf('.', edge)), 10);\n        }\n        return false;\n    }\n\n    static stripNumberToPrec(num, prec=12){\n        return parseFloat(parseFloat(num).toPrecision(prec));\n    }\n\n    static getGlobalObject(){\n        return (function () {\n            if (typeof self !== 'undefined') { return self; }\n            if (typeof window !== 'undefined') { return window; }\n            if (typeof global !== 'undefined') { return global; }\n\n            // When running tests none of the above have been defined\n            return {};\n        })();\n    }\n\n    static isWorker(){\n        var global = Utils.getGlobalObject();\n        return !global.document && !!global.postMessage;\n    }\n\n    static stringify(obj, replacer, filteredPrefixes = ['$']){\n        var cache = [];\n        return JSON.stringify(obj, function (k, v) {\n            if(v === Infinity){\n                return \"Infinity\"\n            }\n            if(v === -Infinity){\n                return \"-Infinity\"\n            }\n\n            if(filteredPrefixes){\n                if(filteredPrefixes.some(prefix=>_.startsWith(k, prefix))){\n                    return undefined;\n                }\n            }\n\n            if (typeof v === 'object' && v !== null) {\n                if (cache.indexOf(v) !== -1) {\n                    // Circular reference found, discard key\n                    return;\n                }\n                cache.push(v);\n            }\n\n            if(replacer){\n                if(!Utils.isArray(replacer)){\n                    return replacer(k, v);\n                }\n\n                replacer.forEach(r=>{\n                    v = r(k,v);\n                })\n\n            }\n            return v;\n\n        }, 2);\n\n    }\n\n    static  compareVersionNumbers(v1, v2) {\n        var v1parts = v1.split('.');\n        var v2parts = v2.split('.');\n\n        function validateParts(parts) {\n            for (var i = 0; i < parts.length; ++i) {\n                if (!Utils.isPositiveInteger(parts[i])) {\n                    return false;\n                }\n            }\n            return true;\n        }\n\n        if (!validateParts(v1parts) || !validateParts(v2parts)) {\n            return NaN;\n        }\n\n        for (var i = 0; i < v1parts.length; ++i) {\n            if (v2parts.length === i) {\n                return 1;\n            }\n\n            if (v1parts[i] === v2parts[i]) {\n                continue;\n            }\n            if (v1parts[i] > v2parts[i]) {\n                return 1;\n            }\n            return -1;\n        }\n\n        if (v1parts.length != v2parts.length) {\n            return -1;\n        }\n\n        return 0;\n    }\n\n    static isPositiveInteger(x) {\n        return /^\\d+$/.test(x);\n    }\n\n    static versionRegexp = /^([0-9]+)\\.([0-9]+)\\.([0-9]+)$/;\n\n    static isValidVersionString(ver) {\n        if (!Utils.isString(ver)) {\n            return false;\n        }\n        return Utils.versionRegexp.test(ver)\n    }\n\n    static makeIterator(array) {\n        var nextIndex = 0;\n\n        return {\n            next: function() {\n                return nextIndex < array.length ?\n                {value: array[nextIndex++], done: false} :\n                {done: true};\n            }\n        };\n    }\n\n    static isUnique(array, accesor){\n        return array.length === new Set(array.map(accesor)).size;\n    }\n\n    static getErrorDTO(e){\n        if(!e) {\n            return e;\n        }\n        return {\n            name: e.constructor.name,\n            message: e.message,\n            data: e.data\n        }\n    }\n\n    static cartesianProductOf(arrays) {\n        return Utils.reduce(arrays, function (a, b) {\n            return Utils.flatten(Utils.map(a, function (x) {\n                return Utils.map(b, function (y) {\n                    return x.concat([y]);\n                });\n            }), true);\n        }, [[]]);\n    };\n\n    static indexesOf(array, value){\n        return array.reduce((a, e, i) => (e === value) ? a.concat(i) : a, [])\n    }\n\n    //////////////////// Wrapped lodash methods:\n\n    static startsWith(){\n        return _.startsWith.apply(_, arguments)\n    }\n\n    static isBoolean(){\n        return _.isBoolean.apply(_, arguments)\n    }\n\n    static find(){\n        return _.find.apply(_, arguments)\n    }\n\n    static fill(){\n        return _.fill.apply(_, arguments)\n    }\n\n    static assign(){\n        return _.assign.apply(_, arguments)\n    }\n\n    static cloneDeep(){\n        return _.cloneDeep.apply(_, arguments)\n    }\n\n    static clone(){\n        return _.clone.apply(_, arguments)\n    }\n\n    static cloneDeepWith(){\n        return _.cloneDeepWith.apply(_, arguments)\n    }\n\n    static cloneWith(){\n        return _.cloneWith.apply(_, arguments)\n    }\n\n    static mergeWith(){\n        return _.mergeWith.apply(_, arguments)\n    }\n\n    static forOwn(){\n        return _.forOwn.apply(_, arguments)\n    }\n\n    static get(){\n        return _.get.apply(_, arguments)\n    }\n\n    static set(){\n        return _.set.apply(_, arguments)\n    }\n\n    static reduce(){\n        return _.reduce.apply(_, arguments)\n    }\n\n    static flatten(){\n        return _.flatten.apply(_, arguments)\n    }\n\n    static map(){\n        return _.map.apply(_, arguments)\n    }\n\n\n    static maxBy(){\n        return _.maxBy.apply(_, arguments)\n    }\n\n    static minBy(){\n        return _.minBy.apply(_, arguments)\n    }\n\n    static debounce(){\n        return _.debounce.apply(_, arguments)\n    }\n\n    static template(){\n        return _.template.apply(_, arguments)\n    }\n\n    static round(){\n        return _.round.apply(_, arguments)\n    }\n\n    static sortBy(){\n        return _.sortBy.apply(_, arguments)\n    }\n\n}\n","'use strict';\r\n\r\nvar width = 256;// each RC4 output is 0 <= x < 256\r\nvar chunks = 6;// at least six RC4 outputs for each double\r\nvar digits = 52;// there are 52 significant digits in a double\r\nvar pool = [];// pool: entropy pool starts empty\r\nvar GLOBAL = typeof global === 'undefined' ? window : global;\r\n\r\n//\r\n// The following constants are related to IEEE 754 limits.\r\n//\r\nvar startdenom = Math.pow(width, chunks),\r\n    significance = Math.pow(2, digits),\r\n    overflow = significance * 2,\r\n    mask = width - 1;\r\n\r\n\r\nvar oldRandom = Math.random;\r\n\r\n//\r\n// seedrandom()\r\n// This is the seedrandom function described above.\r\n//\r\nmodule.exports = function(seed, options) {\r\n  if (options && options.global === true) {\r\n    options.global = false;\r\n    Math.random = module.exports(seed, options);\r\n    options.global = true;\r\n    return Math.random;\r\n  }\r\n  var use_entropy = (options && options.entropy) || false;\r\n  var key = [];\r\n\r\n  // Flatten the seed string or build one from local entropy if needed.\r\n  var shortseed = mixkey(flatten(\r\n    use_entropy ? [seed, tostring(pool)] :\r\n    0 in arguments ? seed : autoseed(), 3), key);\r\n\r\n  // Use the seed to initialize an ARC4 generator.\r\n  var arc4 = new ARC4(key);\r\n\r\n  // Mix the randomness into accumulated entropy.\r\n  mixkey(tostring(arc4.S), pool);\r\n\r\n  // Override Math.random\r\n\r\n  // This function returns a random double in [0, 1) that contains\r\n  // randomness in every bit of the mantissa of the IEEE 754 value.\r\n\r\n  return function() {         // Closure to return a random double:\r\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\r\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\r\n        x = 0;                          //   and no 'extra last byte'.\r\n    while (n < significance) {          // Fill up all significant digits by\r\n      n = (n + x) * width;              //   shifting numerator and\r\n      d *= width;                       //   denominator and generating a\r\n      x = arc4.g(1);                    //   new least-significant-byte.\r\n    }\r\n    while (n >= overflow) {             // To avoid rounding up, before adding\r\n      n /= 2;                           //   last byte, shift everything\r\n      d /= 2;                           //   right using integer Math until\r\n      x >>>= 1;                         //   we have exactly the desired bits.\r\n    }\r\n    return (n + x) / d;                 // Form the number within [0, 1).\r\n  };\r\n};\r\n\r\nmodule.exports.resetGlobal = function () {\r\n  Math.random = oldRandom;\r\n};\r\n\r\n//\r\n// ARC4\r\n//\r\n// An ARC4 implementation.  The constructor takes a key in the form of\r\n// an array of at most (width) integers that should be 0 <= x < (width).\r\n//\r\n// The g(count) method returns a pseudorandom integer that concatenates\r\n// the next (count) outputs from ARC4.  Its return value is a number x\r\n// that is in the range 0 <= x < (width ^ count).\r\n//\r\n/** @constructor */\r\nfunction ARC4(key) {\r\n  var t, keylen = key.length,\r\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\r\n\r\n  // The empty key [] is treated as [0].\r\n  if (!keylen) { key = [keylen++]; }\r\n\r\n  // Set up S using the standard key scheduling algorithm.\r\n  while (i < width) {\r\n    s[i] = i++;\r\n  }\r\n  for (i = 0; i < width; i++) {\r\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\r\n    s[j] = t;\r\n  }\r\n\r\n  // The \"g\" method returns the next (count) outputs as one number.\r\n  (me.g = function(count) {\r\n    // Using instance members instead of closure state nearly doubles speed.\r\n    var t, r = 0,\r\n        i = me.i, j = me.j, s = me.S;\r\n    while (count--) {\r\n      t = s[i = mask & (i + 1)];\r\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\r\n    }\r\n    me.i = i; me.j = j;\r\n    return r;\r\n    // For robust unpredictability discard an initial batch of values.\r\n    // See http://www.rsa.com/rsalabs/node.asp?id=2009\r\n  })(width);\r\n}\r\n\r\n//\r\n// flatten()\r\n// Converts an object tree to nested arrays of strings.\r\n//\r\nfunction flatten(obj, depth) {\r\n  var result = [], typ = (typeof obj)[0], prop;\r\n  if (depth && typ == 'o') {\r\n    for (prop in obj) {\r\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\r\n    }\r\n  }\r\n  return (result.length ? result : typ == 's' ? obj : obj + '\\0');\r\n}\r\n\r\n//\r\n// mixkey()\r\n// Mixes a string seed into a key that is an array of integers, and\r\n// returns a shortened string seed that is equivalent to the result key.\r\n//\r\nfunction mixkey(seed, key) {\r\n  var stringseed = seed + '', smear, j = 0;\r\n  while (j < stringseed.length) {\r\n    key[mask & j] =\r\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\r\n  }\r\n  return tostring(key);\r\n}\r\n\r\n//\r\n// autoseed()\r\n// Returns an object for autoseeding, using window.crypto if available.\r\n//\r\n/** @param {Uint8Array=} seed */\r\nfunction autoseed(seed) {\r\n  try {\r\n    GLOBAL.crypto.getRandomValues(seed = new Uint8Array(width));\r\n    return tostring(seed);\r\n  } catch (e) {\r\n    return [+new Date, GLOBAL, GLOBAL.navigator && GLOBAL.navigator.plugins,\r\n            GLOBAL.screen, tostring(pool)];\r\n  }\r\n}\r\n\r\n//\r\n// tostring()\r\n// Converts an array of charcodes to a string\r\n//\r\nfunction tostring(a) {\r\n  return String.fromCharCode.apply(0, a);\r\n}\r\n\r\n//\r\n// When seedrandom.js is loaded, we immediately mix a few bits\r\n// from the built-in RNG into the entropy pool.  Because we do\r\n// not want to intefere with determinstic PRNG state later,\r\n// seedrandom will not call Math.random on its own again after\r\n// initialization.\r\n//\r\nmixkey(Math.random(), pool);\r\n","function E () {\n  // Keep this empty so it's easier to inherit from\n  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n  on: function (name, callback, ctx) {\n    var e = this.e || (this.e = {});\n\n    (e[name] || (e[name] = [])).push({\n      fn: callback,\n      ctx: ctx\n    });\n\n    return this;\n  },\n\n  once: function (name, callback, ctx) {\n    var self = this;\n    function listener () {\n      self.off(name, listener);\n      callback.apply(ctx, arguments);\n    };\n\n    listener._ = callback\n    return this.on(name, listener, ctx);\n  },\n\n  emit: function (name) {\n    var data = [].slice.call(arguments, 1);\n    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n    var i = 0;\n    var len = evtArr.length;\n\n    for (i; i < len; i++) {\n      evtArr[i].fn.apply(evtArr[i].ctx, data);\n    }\n\n    return this;\n  },\n\n  off: function (name, callback) {\n    var e = this.e || (this.e = {});\n    var evts = e[name];\n    var liveEvents = [];\n\n    if (evts && callback) {\n      for (var i = 0, len = evts.length; i < len; i++) {\n        if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n          liveEvents.push(evts[i]);\n      }\n    }\n\n    // Remove event from queue to prevent memory leak\n    // Suggested by https://github.com/lazd\n    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n    (liveEvents.length)\n      ? e[name] = liveEvents\n      : delete e[name];\n\n    return this;\n  }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n","/**\n * typed-function\n *\n * Type checking for JavaScript functions\n *\n * https://github.com/josdejong/typed-function\n */\n'use strict';\n\n(function (root, factory) {\n  if (typeof define === 'function' && define.amd) {\n    // AMD. Register as an anonymous module.\n    define([], factory);\n  } else if (typeof exports === 'object') {\n    // OldNode. Does not work with strict CommonJS, but\n    // only CommonJS-like environments that support module.exports,\n    // like OldNode.\n    module.exports = factory();\n  } else {\n    // Browser globals (root is window)\n    root.typed = factory();\n  }\n}(this, function () {\n\n  function ok () {\n    return true;\n  }\n\n  function notOk () {\n    return false;\n  }\n\n  function undef () {\n    return undefined;\n  }\n\n  /**\n   * @typedef {{\n   *   params: Param[],\n   *   fn: function\n   * }} Signature\n   *\n   * @typedef {{\n   *   types: Type[],\n   *   restParam: boolean\n   * }} Param\n   *\n   * @typedef {{\n   *   name: string,\n   *   typeIndex: number,\n   *   test: function,\n   *   conversion?: ConversionDef,\n   *   conversionIndex: number,\n   * }} Type\n   *\n   * @typedef {{\n   *   from: string,\n   *   to: string,\n   *   convert: function (*) : *\n   * }} ConversionDef\n   *\n   * @typedef {{\n   *   name: string,\n   *   test: function(*) : boolean\n   * }} TypeDef\n   */\n\n  // create a new instance of typed-function\n  function create () {\n    // data type tests\n    var _types = [\n      { name: 'number',    test: function (x) { return typeof x === 'number' } },\n      { name: 'string',    test: function (x) { return typeof x === 'string' } },\n      { name: 'boolean',   test: function (x) { return typeof x === 'boolean' } },\n      { name: 'Function',  test: function (x) { return typeof x === 'function'} },\n      { name: 'Array',     test: Array.isArray },\n      { name: 'Date',      test: function (x) { return x instanceof Date } },\n      { name: 'RegExp',    test: function (x) { return x instanceof RegExp } },\n      { name: 'Object',    test: function (x) {\n        return typeof x === 'object' && x.constructor === Object\n      }},\n      { name: 'null',      test: function (x) { return x === null } },\n      { name: 'undefined', test: function (x) { return x === undefined } }\n    ];\n\n    var anyType = {\n      name: 'any',\n      test: ok\n    }\n\n    // types which need to be ignored\n    var _ignore = [];\n\n    // type conversions\n    var _conversions = [];\n\n    // This is a temporary object, will be replaced with a typed function at the end\n    var typed = {\n      types: _types,\n      conversions: _conversions,\n      ignore: _ignore\n    };\n\n    /**\n     * Find the test function for a type\n     * @param {String} typeName\n     * @return {TypeDef} Returns the type definition when found,\n     *                    Throws a TypeError otherwise\n     */\n    function findTypeByName (typeName) {\n      var entry = findInArray(typed.types, function (entry) {\n        return entry.name === typeName;\n      });\n\n      if (entry) {\n        return entry;\n      }\n\n      if (typeName === 'any') { // special baked-in case 'any'\n        return anyType;\n      }\n\n      var hint = findInArray(typed.types, function (entry) {\n        return entry.name.toLowerCase() === typeName.toLowerCase();\n      });\n\n      throw new TypeError('Unknown type \"' + typeName + '\"' +\n          (hint ? ('. Did you mean \"' + hint.name + '\"?') : ''));\n    }\n\n    /**\n     * Find the index of a type definition. Handles special case 'any'\n     * @param {TypeDef} type\n     * @return {number}\n     */\n    function findTypeIndex(type) {\n      if (type === anyType) {\n        return 999;\n      }\n\n      return typed.types.indexOf(type);\n    }\n\n    /**\n     * Find a type that matches a value.\n     * @param {*} value\n     * @return {string} Returns the name of the first type for which\n     *                  the type test matches the value.\n     */\n    function findTypeName(value) {\n      var entry = findInArray(typed.types, function (entry) {\n        return entry.test(value);\n      });\n\n      if (entry) {\n        return entry.name;\n      }\n\n      throw new TypeError('Value has unknown type. Value: ' + value);\n    }\n\n    /**\n     * Find a specific signature from a (composed) typed function, for example:\n     *\n     *   typed.find(fn, ['number', 'string'])\n     *   typed.find(fn, 'number, string')\n     *\n     * Function find only only works for exact matches.\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature   Signature to be found, can be\n     *                                        an array or a comma separated string.\n     * @return {Function}                     Returns the matching signature, or\n     *                                        throws an error when no signature\n     *                                        is found.\n     */\n    function find (fn, signature) {\n      if (!fn.signatures) {\n        throw new TypeError('Function is no typed-function');\n      }\n\n      // normalize input\n      var arr;\n      if (typeof signature === 'string') {\n        arr = signature.split(',');\n        for (var i = 0; i < arr.length; i++) {\n          arr[i] = arr[i].trim();\n        }\n      }\n      else if (Array.isArray(signature)) {\n        arr = signature;\n      }\n      else {\n        throw new TypeError('String array or a comma separated string expected');\n      }\n\n      var str = arr.join(',');\n\n      // find an exact match\n      var match = fn.signatures[str];\n      if (match) {\n        return match;\n      }\n\n      // TODO: extend find to match non-exact signatures\n\n      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + arr.join(', ') + '))');\n    }\n\n    /**\n     * Convert a given value to another data type.\n     * @param {*} value\n     * @param {string} type\n     */\n    function convert (value, type) {\n      var from = findTypeName(value);\n\n      // check conversion is needed\n      if (type === from) {\n        return value;\n      }\n\n      for (var i = 0; i < typed.conversions.length; i++) {\n        var conversion = typed.conversions[i];\n        if (conversion.from === from && conversion.to === type) {\n          return conversion.convert(value);\n        }\n      }\n\n      throw new Error('Cannot convert from ' + from + ' to ' + type);\n    }\n    \n    /**\n     * Stringify parameters in a normalized way\n     * @param {Param[]} params\n     * @return {string}\n     */\n    function stringifyParams (params) {\n      return params\n          .map(function (param) {\n            var typeNames = param.types.map(getTypeName);\n\n            return (param.restParam ? '...' : '') + typeNames.join('|');\n          })\n          .join(',');\n    }\n\n    /**\n     * Parse a parameter, like \"...number | boolean\"\n     * @param {string} param\n     * @param {ConversionDef[]} conversions\n     * @return {Param} param\n     */\n    function parseParam (param, conversions) {\n      var restParam = param.indexOf('...') === 0;\n      var types = (!restParam)\n          ? param\n          : (param.length > 3)\n              ? param.slice(3)\n              : 'any';\n\n      var typeNames = types.split('|').map(trim)\n          .filter(notEmpty)\n          .filter(notIgnore);\n\n      var matchingConversions = filterConversions(conversions, typeNames);\n\n      var exactTypes = typeNames.map(function (typeName) {\n        var type = findTypeByName(typeName);\n\n        return {\n          name: typeName,\n          typeIndex: findTypeIndex(type),\n          test: type.test,\n          conversion: null,\n          conversionIndex: -1\n        };\n      });\n\n      var convertibleTypes = matchingConversions.map(function (conversion) {\n        var type = findTypeByName(conversion.from);\n\n        return {\n          name: conversion.from,\n          typeIndex: findTypeIndex(type),\n          test: type.test,\n          conversion: conversion,\n          conversionIndex: conversions.indexOf(conversion)\n        };\n      });\n\n      return {\n        types: exactTypes.concat(convertibleTypes),\n        restParam: restParam\n      };\n    }\n\n    /**\n     * Parse a signature with comma separated parameters,\n     * like \"number | boolean, ...string\"\n     * @param {string} signature\n     * @param {function} fn\n     * @param {ConversionDef[]} conversions\n     * @return {Signature | null} signature\n     */\n    function parseSignature (signature, fn, conversions) {\n      var params = [];\n\n      if (signature.trim() !== '') {\n        params = signature\n            .split(',')\n            .map(trim)\n            .map(function (param, index, array) {\n              var parsedParam = parseParam(param, conversions);\n\n              if (parsedParam.restParam && (index !== array.length - 1)) {\n                throw new SyntaxError('Unexpected rest parameter \"' + param + '\": ' +\n                    'only allowed for the last parameter');\n              }\n\n              return parsedParam;\n          });\n      }\n\n      if (params.some(isInvalidParam)) {\n        // invalid signature: at least one parameter has no types\n        // (they may have been filtered)\n        return null;\n      }\n\n      return {\n        params: params,\n        fn: fn\n      };\n    }\n\n    /**\n     * Test whether a set of params contains a restParam\n     * @param {Param[]} params\n     * @return {boolean} Returns true when the last parameter is a restParam\n     */\n    function hasRestParam(params) {\n      var param = last(params)\n      return param ? param.restParam : false;\n    }\n\n    /**\n     * Test whether a parameter contains conversions\n     * @param {Param} param\n     * @return {boolean} Returns true when at least one of the parameters\n     *                   contains a conversion.\n     */\n    function hasConversions(param) {\n      return param.types.some(function (type) {\n        return type.conversion != null;\n      });\n    }\n\n    /**\n     * Create a type test for a single parameter, which can have one or multiple\n     * types.\n     * @param {Param} param\n     * @return {function(x: *) : boolean} Returns a test function\n     */\n    function compileTest(param) {\n      if (!param || param.types.length === 0) {\n        // nothing to do\n        return ok;\n      }\n      else if (param.types.length === 1) {\n        return findTypeByName(param.types[0].name).test;\n      }\n      else if (param.types.length === 2) {\n        var test0 = findTypeByName(param.types[0].name).test;\n        var test1 = findTypeByName(param.types[1].name).test;\n        return function or(x) {\n          return test0(x) || test1(x);\n        }\n      }\n      else { // param.types.length > 2\n        var tests = param.types.map(function (type) {\n          return findTypeByName(type.name).test;\n        })\n        return function or(x) {\n          for (var i = 0; i < tests.length; i++) {\n            if (tests[i](x)) {\n              return true;\n            }\n          }\n          return false;\n        }\n      }\n    }\n\n    /**\n     * Create a test for all parameters of a signature\n     * @param {Param[]} params\n     * @return {function(args: Array<*>) : boolean}\n     */\n    function compileTests(params) {\n      var tests, test0, test1;\n\n      if (hasRestParam(params)) {\n        // variable arguments like '...number'\n        tests = initial(params).map(compileTest);\n        var varIndex = tests.length;\n        var lastTest = compileTest(last(params));\n        var testRestParam = function (args) {\n          for (var i = varIndex; i < args.length; i++) {\n            if (!lastTest(args[i])) {\n              return false;\n            }\n          }\n          return true;\n        }\n\n        return function testArgs(args) {\n          for (var i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n          return testRestParam(args) && (args.length >= varIndex + 1);\n        };\n      }\n      else {\n        // no variable arguments\n        if (params.length === 0) {\n          return function testArgs(args) {\n            return args.length === 0;\n          };\n        }\n        else if (params.length === 1) {\n          test0 = compileTest(params[0]);\n          return function testArgs(args) {\n            return test0(args[0]) && args.length === 1;\n          };\n        }\n        else if (params.length === 2) {\n          test0 = compileTest(params[0]);\n          test1 = compileTest(params[1]);\n          return function testArgs(args) {\n            return test0(args[0]) && test1(args[1]) && args.length === 2;\n          };\n        }\n        else { // arguments.length > 2\n          tests = params.map(compileTest);\n          return function testArgs(args) {\n            for (var i = 0; i < tests.length; i++) {\n              if (!tests[i](args[i])) {\n                return false;\n              }\n            }\n            return args.length === tests.length;\n          };\n        }\n      }\n    }\n\n    /**\n     * Find the parameter at a specific index of a signature.\n     * Handles rest parameters.\n     * @param {Signature} signature\n     * @param {number} index\n     * @return {Param | null} Returns the matching parameter when found,\n     *                        null otherwise.\n     */\n    function getParamAtIndex(signature, index) {\n      return index < signature.params.length\n          ? signature.params[index]\n          : hasRestParam(signature.params)\n              ? last(signature.params)\n              : null\n    }\n\n    /**\n     * Get all type names of a parameter\n     * @param {Signature} signature\n     * @param {number} index\n     * @param {boolean} excludeConversions\n     * @return {string[]} Returns an array with type names\n     */\n    function getExpectedTypeNames (signature, index, excludeConversions) {\n      var param = getParamAtIndex(signature, index);\n      var types = param\n          ? excludeConversions\n                  ? param.types.filter(isExactType)\n                  : param.types\n          : [];\n\n      return types.map(getTypeName);\n    }\n\n    /**\n     * Returns the name of a type\n     * @param {Type} type\n     * @return {string} Returns the type name\n     */\n    function getTypeName(type) {\n      return type.name;\n    }\n\n    /**\n     * Test whether a type is an exact type or conversion\n     * @param {Type} type\n     * @return {boolean} Returns true when\n     */\n    function isExactType(type) {\n      return type.conversion === null || type.conversion === undefined;\n    }\n\n    /**\n     * Helper function for creating error messages: create an array with\n     * all available types on a specific argument index.\n     * @param {Signature[]} signatures\n     * @param {number} index\n     * @return {string[]} Returns an array with available types\n     */\n    function mergeExpectedParams(signatures, index) {\n      var typeNames = uniq(flatMap(signatures, function (signature) {\n        return getExpectedTypeNames(signature, index, false);\n      }));\n\n      return (typeNames.indexOf('any') !== -1) ? ['any'] : typeNames;\n    }\n\n    /**\n     * Create\n     * @param {string} name             The name of the function\n     * @param {array.<*>} args          The actual arguments passed to the function\n     * @param {Signature[]} signatures  A list with available signatures\n     * @return {TypeError} Returns a type error with additional data\n     *                     attached to it in the property `data`\n     */\n    function createError(name, args, signatures) {\n      var err, expected;\n      var _name = name || 'unnamed';\n\n      // test for wrong type at some index\n      var matchingSignatures = signatures;\n      var index;\n      for (index = 0; index < args.length; index++) {\n        var nextMatchingDefs = matchingSignatures.filter(function (signature) {\n          var test = compileTest(getParamAtIndex(signature, index));\n          return (index < signature.params.length || hasRestParam(signature.params)) &&\n              test(args[index]);\n        });\n\n        if (nextMatchingDefs.length === 0) {\n          // no matching signatures anymore, throw error \"wrong type\"\n          expected = mergeExpectedParams(matchingSignatures, index);\n          if (expected.length > 0) {\n            var actualType = findTypeName(args[index]);\n\n            err = new TypeError('Unexpected type of argument in function ' + _name +\n                ' (expected: ' + expected.join(' or ') +\n                ', actual: ' + actualType + ', index: ' + index + ')');\n            err.data = {\n              category: 'wrongType',\n              fn: _name,\n              index: index,\n              actual: actualType,\n              expected: expected\n            }\n            return err;\n          }\n        }\n        else {\n          matchingSignatures = nextMatchingDefs;\n        }\n      }\n\n      // test for too few arguments\n      var lengths = matchingSignatures.map(function (signature) {\n        return hasRestParam(signature.params) ? Infinity : signature.params.length;\n      });\n      if (args.length < Math.min.apply(null, lengths)) {\n        expected = mergeExpectedParams(matchingSignatures, index);\n        err = new TypeError('Too few arguments in function ' + _name +\n            ' (expected: ' + expected.join(' or ') +\n            ', index: ' + args.length + ')');\n        err.data = {\n          category: 'tooFewArgs',\n          fn: _name,\n          index: args.length,\n          expected: expected\n        }\n        return err;\n      }\n\n      // test for too many arguments\n      var maxLength = Math.max.apply(null, lengths);\n      if (args.length > maxLength) {\n        err = new TypeError('Too many arguments in function ' + _name +\n            ' (expected: ' + maxLength + ', actual: ' + args.length + ')');\n        err.data = {\n          category: 'tooManyArgs',\n          fn: _name,\n          index: args.length,\n          expectedLength: maxLength\n        }\n        return err;\n      }\n\n      err = new TypeError('Arguments of type \"' + args.join(', ') +\n          '\" do not match any of the defined signatures of function ' + _name + '.');\n      err.data = {\n        category: 'mismatch',\n        actual: args.map(findTypeName)\n      }\n      return err;\n    }\n\n    /**\n     * Find the lowest index of all exact types of a parameter (no conversions)\n     * @param {Param} param\n     * @return {number} Returns the index of the lowest type in typed.types\n     */\n    function getLowestTypeIndex (param) {\n      var min = 999;\n\n      for (var i = 0; i < param.types.length; i++) {\n        if (isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].typeIndex);\n        }\n      }\n\n      return min;\n    }\n\n    /**\n     * Find the lowest index of the conversion of all types of the parameter\n     * having a conversion\n     * @param {Param} param\n     * @return {number} Returns the lowest index of the conversions of this type\n     */\n    function getLowestConversionIndex (param) {\n      var min = 999;\n\n      for (var i = 0; i < param.types.length; i++) {\n        if (!isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].conversionIndex);\n        }\n      }\n\n      return min;\n    }\n\n    /**\n     * Compare two params\n     * @param {Param} param1\n     * @param {Param} param2\n     * @return {number} returns a negative number when param1 must get a lower\n     *                  index than param2, a positive number when the opposite,\n     *                  or zero when both are equal\n     */\n    function compareParams (param1, param2) {\n      var c;\n\n      // compare having a rest parameter or not\n      c = param1.restParam - param2.restParam;\n      if (c !== 0) {\n        return c;\n      }\n\n      // compare having conversions or not\n      c = hasConversions(param1) - hasConversions(param2);\n      if (c !== 0) {\n        return c;\n      }\n\n      // compare the index of the types\n      c = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n      if (c !== 0) {\n        return c;\n      }\n\n      // compare the index of any conversion\n      return getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n    }\n\n    /**\n     * Compare two signatures\n     * @param {Signature} signature1\n     * @param {Signature} signature2\n     * @return {number} returns a negative number when param1 must get a lower\n     *                  index than param2, a positive number when the opposite,\n     *                  or zero when both are equal\n     */\n    function compareSignatures (signature1, signature2) {\n      var len = Math.min(signature1.params.length, signature2.params.length);\n      var i;\n      var c;\n\n      // compare whether the params have conversions at all or not\n      c = signature1.params.some(hasConversions) - signature2.params.some(hasConversions)\n      if (c !== 0) {\n        return c;\n      }\n\n      // next compare whether the params have conversions one by one\n      for (i = 0; i < len; i++) {\n        c = hasConversions(signature1.params[i]) - hasConversions(signature2.params[i]);\n        if (c !== 0) {\n          return c;\n        }\n      }\n\n      // compare the types of the params one by one\n      for (i = 0; i < len; i++) {\n        c = compareParams(signature1.params[i], signature2.params[i]);\n        if (c !== 0) {\n          return c;\n        }\n      }\n\n      // compare the number of params\n      return signature1.params.length - signature2.params.length;\n    }\n\n    /**\n     * Get params containing all types that can be converted to the defined types.\n     *\n     * @param {ConversionDef[]} conversions\n     * @param {string[]} typeNames\n     * @return {ConversionDef[]} Returns the conversions that are available\n     *                        for every type (if any)\n     */\n    function filterConversions(conversions, typeNames) {\n      var matches = {};\n\n      conversions.forEach(function (conversion) {\n        if (typeNames.indexOf(conversion.from) === -1 &&\n            typeNames.indexOf(conversion.to) !== -1 &&\n            !matches[conversion.from]) {\n          matches[conversion.from] = conversion;\n        }\n      });\n\n      return Object.keys(matches).map(function (from) {\n        return matches[from];\n      });\n    }\n\n    /**\n     * Preprocess arguments before calling the original function:\n     * - if needed convert the parameters\n     * - in case of rest parameters, move the rest parameters into an Array\n     * @param {Param[]} params\n     * @param {function} fn\n     * @return {function} Returns a wrapped function\n     */\n    function compileArgsPreprocessing(params, fn) {\n      var fnConvert = fn;\n\n      // TODO: can we make this wrapper function smarter/simpler?\n\n      if (params.some(hasConversions)) {\n        var restParam = hasRestParam(params);\n        var compiledConversions = params.map(compileArgConversion)\n\n        fnConvert = function convertArgs() {\n          var args = [];\n          var last = restParam ? arguments.length - 1 : arguments.length;\n          for (var i = 0; i < last; i++) {\n            args[i] = compiledConversions[i](arguments[i]);\n          }\n          if (restParam) {\n            args[last] = arguments[last].map(compiledConversions[last]);\n          }\n\n          return fn.apply(null, args);\n        }\n      }\n\n      var fnPreprocess = fnConvert;\n      if (hasRestParam(params)) {\n        var offset = params.length - 1;\n\n        fnPreprocess = function preprocessRestParams () {\n          return fnConvert.apply(null,\n              slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n        }\n      }\n\n      return fnPreprocess;\n    }\n\n    /**\n     * Compile conversion for a parameter to the right type\n     * @param {Param} param\n     * @return {function} Returns the wrapped function that will convert arguments\n     *\n     */\n    function compileArgConversion(param) {\n      var test0, test1, conversion0, conversion1;\n      var tests = [];\n      var conversions = [];\n\n      param.types.forEach(function (type) {\n        if (type.conversion) {\n          tests.push(findTypeByName(type.conversion.from).test);\n          conversions.push(type.conversion.convert);\n        }\n      });\n\n      // create optimized conversion functions depending on the number of conversions\n      switch (conversions.length) {\n        case 0:\n          return function convertArg(arg) {\n            return arg;\n          }\n\n        case 1:\n          test0 = tests[0]\n          conversion0 = conversions[0];\n          return function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg)\n            }\n            return arg;\n          }\n\n        case 2:\n          test0 = tests[0]\n          test1 = tests[1]\n          conversion0 = conversions[0];\n          conversion1 = conversions[1];\n          return function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg)\n            }\n            if (test1(arg)) {\n              return conversion1(arg)\n            }\n            return arg;\n          }\n\n        default:\n          return function convertArg(arg) {\n            for (var i = 0; i < conversions.length; i++) {\n              if (tests[i](arg)) {\n                return conversions[i](arg);\n              }\n            }\n            return arg;\n          }\n      }\n    }\n\n    /**\n     * Convert an array with signatures into a map with signatures,\n     * where signatures with union types are split into separate signatures\n     *\n     * Throws an error when there are conflicting types\n     *\n     * @param {Signature[]} signatures\n     * @return {Object.<string, function>}  Returns a map with signatures\n     *                                      as key and the original function\n     *                                      of this signature as value.\n     */\n    function createSignaturesMap(signatures) {\n      var signaturesMap = {};\n      signatures.forEach(function (signature) {\n        if (!signature.params.some(hasConversions)) {\n          splitParams(signature.params, true).forEach(function (params) {\n            signaturesMap[stringifyParams(params)] = signature.fn;\n          });\n        }\n      });\n\n      return signaturesMap;\n    }\n\n    /**\n     * Split params with union types in to separate params.\n     *\n     * For example:\n     *\n     *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n     *     // returns:\n     *     // [\n     *     //   ['Array', 'string'],\n     *     //   ['Array', 'RegExp'],\n     *     //   ['Object', 'string'],\n     *     //   ['Object', 'RegExp']\n     *     // ]\n     *\n     * @param {Param[]} params\n     * @param {boolean} ignoreConversionTypes\n     * @return {Param[]}\n     */\n    function splitParams(params, ignoreConversionTypes) {\n      function _splitParams(params, index, types) {\n        if (index < params.length) {\n          var param = params[index]\n          var filteredTypes = ignoreConversionTypes\n              ? param.types.filter(isExactType)\n              : param.types;\n          var typeGroups\n\n          if (param.restParam) {\n            // split the types of a rest parameter in two:\n            // one with only exact types, and one with exact types and conversions\n            var exactTypes = filteredTypes.filter(isExactType)\n            typeGroups = exactTypes.length < filteredTypes.length\n                ? [exactTypes, filteredTypes]\n                : [filteredTypes]\n\n          }\n          else {\n            // split all the types of a regular parameter into one type per group\n            typeGroups = filteredTypes.map(function (type) {\n              return [type]\n            })\n          }\n\n          // recurse over the groups with types\n          return flatMap(typeGroups, function (typeGroup) {\n            return _splitParams(params, index + 1, types.concat([typeGroup]));\n          });\n\n        }\n        else {\n          // we've reached the end of the parameters. Now build a new Param\n          var splittedParams = types.map(function (type, typeIndex) {\n            return {\n              types: type,\n              restParam: (typeIndex === params.length - 1) && hasRestParam(params)\n            }\n          });\n\n          return [splittedParams];\n        }\n      }\n\n      return _splitParams(params, 0, []);\n    }\n\n    /**\n     * Test whether two signatures have a conflicting signature\n     * @param {Signature} signature1\n     * @param {Signature} signature2\n     * @return {boolean} Returns true when the signatures conflict, false otherwise.\n     */\n    function hasConflictingParams(signature1, signature2) {\n      var ii = Math.max(signature1.params.length, signature2.params.length);\n\n      for (var i = 0; i < ii; i++) {\n        var typesNames1 = getExpectedTypeNames(signature1, i, true);\n        var typesNames2 = getExpectedTypeNames(signature2, i, true);\n\n        if (!hasOverlap(typesNames1, typesNames2)) {\n          return false;\n        }\n      }\n\n      var len1 = signature1.params.length;\n      var len2 = signature2.params.length;\n      var restParam1 = hasRestParam(signature1.params);\n      var restParam2 = hasRestParam(signature2.params);\n\n      return restParam1\n          ? restParam2 ? (len1 === len2) : (len2 >= len1)\n          : restParam2 ? (len1 >= len2)  : (len1 === len2)\n    }\n\n    /**\n     * Create a typed function\n     * @param {String} name               The name for the typed function\n     * @param {Object.<string, function>} signaturesMap\n     *                                    An object with one or\n     *                                    multiple signatures as key, and the\n     *                                    function corresponding to the\n     *                                    signature as value.\n     * @return {function}  Returns the created typed function.\n     */\n    function createTypedFunction(name, signaturesMap) {\n      if (Object.keys(signaturesMap).length === 0) {\n        throw new SyntaxError('No signatures provided');\n      }\n\n      // parse the signatures, and check for conflicts\n      var parsedSignatures = [];\n      Object.keys(signaturesMap)\n          .map(function (signature) {\n            return parseSignature(signature, signaturesMap[signature], typed.conversions);\n          })\n          .filter(notNull)\n          .forEach(function (parsedSignature) {\n            // check whether this parameter conflicts with already parsed signatures\n            var conflictingSignature = findInArray(parsedSignatures, function (s) {\n              return hasConflictingParams(s, parsedSignature)\n            });\n            if (conflictingSignature) {\n              throw new TypeError('Conflicting signatures \"' +\n                  stringifyParams(conflictingSignature.params) + '\" and \"' +\n                  stringifyParams(parsedSignature.params) + '\".');\n            }\n\n            parsedSignatures.push(parsedSignature);\n          });\n\n      // split and filter the types of the signatures, and then order them\n      var signatures = flatMap(parsedSignatures, function (parsedSignature) {\n        var params = parsedSignature ? splitParams(parsedSignature.params, false) : []\n\n        return params.map(function (params) {\n          return {\n            params: params,\n            fn: parsedSignature.fn\n          };\n        });\n      }).filter(notNull);\n\n      signatures.sort(compareSignatures);\n\n      // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n      var ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n      var ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n      var ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n      var ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n      var ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n      var ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n      var allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n      // compile the tests\n      var tests = signatures.map(function (signature) {\n        return compileTests(signature.params);\n      });\n\n      var test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n      var test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n      var test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n      var test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n      var test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n      var test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n\n      var test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n      var test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n      var test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n      var test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n      var test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n      var test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n      // compile the functions\n      var fns = signatures.map(function(signature) {\n        return compileArgsPreprocessing(signature.params, signature.fn)\n      });\n\n      var fn0 = ok0 ? fns[0] : undef;\n      var fn1 = ok1 ? fns[1] : undef;\n      var fn2 = ok2 ? fns[2] : undef;\n      var fn3 = ok3 ? fns[3] : undef;\n      var fn4 = ok4 ? fns[4] : undef;\n      var fn5 = ok5 ? fns[5] : undef;\n\n      var len0 = ok0 ? signatures[0].params.length : -1;\n      var len1 = ok1 ? signatures[1].params.length : -1;\n      var len2 = ok2 ? signatures[2].params.length : -1;\n      var len3 = ok3 ? signatures[3].params.length : -1;\n      var len4 = ok4 ? signatures[4].params.length : -1;\n      var len5 = ok5 ? signatures[5].params.length : -1;\n\n      // simple and generic, but also slow\n      var iStart = allOk ? 6 : 0;\n      var iEnd = signatures.length;\n      var generic = function generic() {\n        'use strict';\n\n        for (var i = iStart; i < iEnd; i++) {\n          if (tests[i](arguments)) {\n            return fns[i].apply(null, arguments);\n          }\n        }\n\n        throw createError(name, arguments, signatures);\n      }\n\n      // create the typed function\n      // fast, specialized version. Falls back to the slower, generic one if needed\n      var fn = function fn(arg0, arg1) {\n        'use strict';\n\n        if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(null, arguments); }\n        if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(null, arguments); }\n        if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(null, arguments); }\n        if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(null, arguments); }\n        if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(null, arguments); }\n        if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(null, arguments); }\n\n        return generic.apply(null, arguments);\n      }\n\n      // attach name the typed function\n      try {\n        Object.defineProperty(fn, 'name', {value: name});\n      }\n      catch (err) {\n        // old browsers do not support Object.defineProperty and some don't support setting the name property\n        // the function name is not essential for the functioning, it's mostly useful for debugging,\n        // so it's fine to have unnamed functions.\n      }\n\n      // attach signatures to the function\n      fn.signatures = createSignaturesMap(signatures);\n\n      return fn;\n    }\n\n    /**\n     * Test whether a type should be NOT be ignored\n     * @param {string} typeName\n     * @return {boolean}\n     */\n    function notIgnore(typeName) {\n      return typed.ignore.indexOf(typeName) === -1;\n    }\n\n    /**\n     * trim a string\n     * @param {string} str\n     * @return {string}\n     */\n    function trim(str) {\n      return str.trim();\n    }\n\n    /**\n     * Test whether a string is not empty\n     * @param {string} str\n     * @return {boolean}\n     */\n    function notEmpty(str) {\n      return !!str;\n    }\n\n    /**\n     * test whether a value is not strict equal to null\n     * @param {*} value\n     * @return {boolean}\n     */\n    function notNull(value) {\n      return value !== null;\n    }\n\n    /**\n     * Test whether a parameter has no types defined\n     * @param {Param} param\n     * @return {boolean}\n     */\n    function isInvalidParam (param) {\n      return param.types.length === 0;\n    }\n\n    /**\n     * Return all but the last items of an array\n     * @param {Array} arr\n     * @return {Array}\n     */\n    function initial(arr) {\n      return arr.slice(0, arr.length - 1);\n    }\n\n    /**\n     * return the last item of an array\n     * @param {Array} arr\n     * @return {*}\n     */\n    function last(arr) {\n      return arr[arr.length - 1];\n    }\n\n    /**\n     * Slice an array or function Arguments\n     * @param {Array | Arguments | IArguments} arr\n     * @param {number} start\n     * @param {number} [end]\n     * @return {Array}\n     */\n    function slice(arr, start, end) {\n      return Array.prototype.slice.call(arr, start, end);\n    }\n\n    /**\n     * Test whether an array contains some item\n     * @param {Array} array\n     * @param {*} item\n     * @return {boolean} Returns true if array contains item, false if not.\n     */\n    function contains(array, item) {\n      return array.indexOf(item) !== -1;\n    }\n\n    /**\n     * Test whether two arrays have overlapping items\n     * @param {Array} array1\n     * @param {Array} array2\n     * @return {boolean} Returns true when at least one item exists in both arrays\n     */\n    function hasOverlap(array1, array2) {\n      for (var i = 0; i < array1.length; i++) {\n        if (contains(array2, array1[i])) {\n          return true;\n        }\n      }\n\n      return false;\n    }\n\n    /**\n     * Return the first item from an array for which test(arr[i]) returns true\n     * @param {Array} arr\n     * @param {function} test\n     * @return {* | undefined} Returns the first matching item\n     *                         or undefined when there is no match\n     */\n    function findInArray(arr, test) {\n      for (var i = 0; i < arr.length; i++) {\n        if (test(arr[i])) {\n          return arr[i];\n        }\n      }\n      return undefined;\n    }\n\n    /**\n     * Filter unique items of an array with strings\n     * @param {string[]} arr\n     * @return {string[]}\n     */\n    function uniq(arr) {\n      var entries = {}\n      for (var i = 0; i < arr.length; i++) {\n        entries[arr[i]] = true;\n      }\n      return Object.keys(entries);\n    }\n\n    /**\n     * Flat map the result invoking a callback for every item in an array.\n     * https://gist.github.com/samgiles/762ee337dff48623e729\n     * @param {Array} arr\n     * @param {function} callback\n     * @return {Array}\n     */\n    function flatMap(arr, callback) {\n      return Array.prototype.concat.apply([], arr.map(callback));\n    }\n\n    /**\n     * Retrieve the function name from a set of typed functions,\n     * and check whether the name of all functions match (if given)\n     * @param {function[]} fns\n     */\n    function getName (fns) {\n      var name = '';\n\n      for (var i = 0; i < fns.length; i++) {\n        var fn = fns[i];\n\n        // check whether the names are the same when defined\n        if ((typeof fn.signatures === 'object' || typeof fn.signature === 'string') && fn.name !== '') {\n          if (name === '') {\n            name = fn.name;\n          }\n          else if (name !== fn.name) {\n            var err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')');\n            err.data = {\n              actual: fn.name,\n              expected: name\n            };\n            throw err;\n          }\n        }\n      }\n\n      return name;\n    }\n\n    // extract and merge all signatures of a list with typed functions\n    function extractSignatures(fns) {\n      var err;\n      var signaturesMap = {};\n\n      function validateUnique(_signature, _fn) {\n        if (signaturesMap.hasOwnProperty(_signature) && _fn !== signaturesMap[_signature]) {\n          err = new Error('Signature \"' + _signature + '\" is defined twice');\n          err.data = {signature: _signature};\n          throw err;\n          // else: both signatures point to the same function, that's fine\n        }\n      }\n\n      for (var i = 0; i < fns.length; i++) {\n        var fn = fns[i];\n\n        // test whether this is a typed-function\n        if (typeof fn.signatures === 'object') {\n          // merge the signatures\n          for (var signature in fn.signatures) {\n            if (fn.signatures.hasOwnProperty(signature)) {\n              validateUnique(signature, fn.signatures[signature]);\n              signaturesMap[signature] = fn.signatures[signature];\n            }\n          }\n        }\n        else if (typeof fn.signature === 'string') {\n          validateUnique(fn.signature, fn);\n          signaturesMap[fn.signature] = fn;\n        }\n        else {\n          err = new TypeError('Function is no typed-function (index: ' + i + ')');\n          err.data = {index: i};\n          throw err;\n        }\n      }\n\n      return signaturesMap;\n    }\n\n    typed = createTypedFunction('typed', {\n      'string, Object': createTypedFunction,\n      'Object': function (signaturesMap) {\n        // find existing name\n        var fns = [];\n        for (var signature in signaturesMap) {\n          if (signaturesMap.hasOwnProperty(signature)) {\n            fns.push(signaturesMap[signature]);\n          }\n        }\n        var name = getName(fns);\n        return createTypedFunction(name, signaturesMap);\n      },\n      '...Function': function (fns) {\n        return createTypedFunction(getName(fns), extractSignatures(fns));\n      },\n      'string, ...Function': function (name, fns) {\n        return createTypedFunction(name, extractSignatures(fns));\n      }\n    });\n\n    typed.create = create;\n    typed.types = _types;\n    typed.conversions = _conversions;\n    typed.ignore = _ignore;\n    typed.convert = convert;\n    typed.find = find;\n\n    /**\n     * add a type\n     * @param {{name: string, test: function}} type\n     * @param {boolean} [beforeObjectTest=true]\n     *                          If true, the new test will be inserted before\n     *                          the test with name 'Object' (if any), since\n     *                          tests for Object match Array and classes too.\n     */\n    typed.addType = function (type, beforeObjectTest) {\n      if (!type || typeof type.name !== 'string' || typeof type.test !== 'function') {\n        throw new TypeError('Object with properties {name: string, test: function} expected');\n      }\n\n      if (beforeObjectTest !== false) {\n        for (var i = 0; i < typed.types.length; i++) {\n          if (typed.types[i].name === 'Object') {\n            typed.types.splice(i, 0, type);\n            return\n          }\n        }\n      }\n\n      typed.types.push(type);\n    };\n\n    // add a conversion\n    typed.addConversion = function (conversion) {\n      if (!conversion\n          || typeof conversion.from !== 'string'\n          || typeof conversion.to !== 'string'\n          || typeof conversion.convert !== 'function') {\n        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n      }\n\n      typed.conversions.push(conversion);\n    };\n\n    return typed;\n  }\n\n  return create();\n}));","import {Utils} from \"sd-utils\";\nimport {ExpressionEngine} from \"sd-expression-engine\";\n\nexport const PARAMETER_TYPE = {\n    STRING: 'STRING',\n    DATE: 'DATE',\n    INTEGER: 'INTEGER',\n    NUMBER: 'FLOAT',\n    BOOLEAN: 'BOOLEAN',\n    NUMBER_EXPRESSION: 'NUMBER_EXPRESSION',\n    COMPOSITE: 'COMPOSITE' //composite parameter with nested subparameters\n};\n\nexport class JobParameterDefinition {\n    name;\n    type;\n    nestedParameters = [];\n    minOccurs;\n    maxOccurs;\n    required = true;\n\n    identifying;\n    validator;\n    singleValueValidator;\n\n    constructor(name, typeOrNestedParametersDefinitions, minOccurs = 1, maxOccurs = 1, identifying = false, singleValueValidator = null, validator = null) {\n        this.name = name;\n        if (Utils.isArray(typeOrNestedParametersDefinitions)) {\n            this.type = PARAMETER_TYPE.COMPOSITE;\n            this.nestedParameters = typeOrNestedParametersDefinitions;\n        } else {\n            this.type = typeOrNestedParametersDefinitions;\n        }\n        this.validator = validator;\n        this.singleValueValidator = singleValueValidator;\n        this.identifying = identifying;\n        this.minOccurs = minOccurs;\n        this.maxOccurs = maxOccurs;\n    }\n\n    set(key, val) {\n        this[key] = val;\n        return this;\n    }\n\n    validate(value, allValues) {\n        var isArray = Utils.isArray(value);\n\n        if (this.maxOccurs > 1 && !isArray) {\n            return false;\n        }\n\n        if (!isArray) {\n            return this.validateSingleValue(value, allValues)\n        }\n\n        if (value.length < this.minOccurs || value.length > this.maxOccurs) {\n            return false;\n        }\n\n        if (!value.every(v=>this.validateSingleValue(v, value))) {\n            return false;\n        }\n\n        if (this.validator) {\n            return this.validator(value, allValues);\n        }\n\n        return true;\n    }\n\n    static computeNumberExpression(val){\n        let parsed = parseFloat(val);\n        if(parsed === Infinity || parsed === -Infinity) {\n            return parsed;\n        }\n\n        if(!ExpressionEngine.validate(val, {}, false)){\n            return null\n        }\n\n        return ExpressionEngine.eval(val, true)\n    }\n\n    // allValues - all values on the same level\n    validateSingleValue(value, allValues) {\n\n        if ((!value && value !== 0 && value !== false) && this.minOccurs > 0) {\n            return !this.required\n        }\n\n        if (PARAMETER_TYPE.STRING === this.type && !Utils.isString(value)) {\n            return false;\n        }\n        if (PARAMETER_TYPE.DATE === this.type && !Utils.isDate(value)) {\n            return false;\n        }\n        if (PARAMETER_TYPE.INTEGER === this.type && !Utils.isInt(value)) {\n            return false;\n        }\n        if (PARAMETER_TYPE.NUMBER === this.type && !Utils.isNumber(value)) {\n            return false;\n        }\n\n        if (PARAMETER_TYPE.BOOLEAN === this.type && !Utils.isBoolean(value)) {\n            return false;\n        }\n\n\n        if (PARAMETER_TYPE.NUMBER_EXPRESSION === this.type) {\n            value = JobParameterDefinition.computeNumberExpression(value);\n            if(value === null){\n                return false\n            }\n        }\n\n        if (PARAMETER_TYPE.COMPOSITE === this.type) {\n            if (!Utils.isObject(value)) {\n                return false;\n            }\n            if (!this.nestedParameters.every((nestedDef, i)=>nestedDef.validate(value[nestedDef.name]))) {\n                return false;\n            }\n        }\n\n        if (this.singleValueValidator) {\n            return this.singleValueValidator(value, allValues);\n        }\n\n        return true;\n    }\n\n    value(value){\n        if(PARAMETER_TYPE.NUMBER_EXPRESSION === this.type) {\n            return JobParameterDefinition.computeNumberExpression(value);\n        }\n\n        return value;\n    }\n}\n","import {Decision} from \"./decision\";\n\nexport class Policy{\n    id;\n    decisions = [];\n\n    constructor(id, decisions){\n        this.id = id;\n        this.decisions = decisions || [];\n        this.key = Policy.generateKey(this);\n    }\n\n    addDecision(node, decisionValue){\n        var decision = new Decision(node, decisionValue);\n        this.decisions .push(decision);\n        this.key = Policy.generateKey(this);\n        return decision;\n    }\n\n    static generateKey(policy){\n        var key = \"\";\n        policy.decisions.forEach(d=>key+=(key? \"&\": \"\")+d.key);\n        return key;\n    }\n\n    equals(policy, ignoreId=true){\n        if(this.key != policy.key){\n            return false;\n        }\n\n        return ignoreId || this.id === policy.id;\n    }\n\n    getDecision(decisionNode){\n        return Policy.getDecision(this, decisionNode);\n    }\n\n    static getDecision(policy, decisionNode){\n        for(var i=0; i<policy.decisions.length; i++){\n            var decision = Decision.getDecision(policy.decisions[i], decisionNode);\n            if(decision){\n                return decision;\n            }\n        }\n        return null;\n    }\n\n    static toPolicyString(policy, extended=false, prependId=false){\n\n        var res = \"\";\n        policy.decisions.forEach(d=>{\n            if(res){\n                if(extended){\n                    res += \"\\n\"\n                }else{\n                    res += \", \"\n                }\n\n\n            }\n            res += Decision.toDecisionString(d, extended, 'name', '\\t');\n        });\n        if(prependId && policy.id!==undefined){\n            return policy.id+\" \"+res;\n        }\n        return res;\n    }\n\n\n    toPolicyString(indent=false){\n        return Policy.toPolicyString(this, indent)\n    }\n\n\n}\n","import {ExpressionEngine} from 'sd-expression-engine'\nimport {Utils} from \"sd-utils\";\n\n\nexport class McdmWeightValueValidator{\n\n    additionalValidator = null;\n\n    constructor(additionalValidator){\n        this.additionalValidator = additionalValidator;\n    }\n\n    validate(value){\n        if(value===null || value === undefined){\n            return false;\n        }\n\n        let parsed = parseFloat(value);\n        if(parsed !== Infinity && !ExpressionEngine.validate(value, {}, false)){\n            return false\n        }\n\n        value = ExpressionEngine.toNumber(value);\n        var maxSafeInteger = Number.MAX_SAFE_INTEGER || 9007199254740991; // Number.MAX_SAFE_INTEGER is undefined in IE\n        if(ExpressionEngine.compare(value, 0) < 0 || (value !== Infinity && ExpressionEngine.compare(value, maxSafeInteger)> 0)){\n            return false;\n        }\n\n        if(this.additionalValidator) {\n            return this.additionalValidator(ExpressionEngine.toNumber(value))\n        }\n\n        return true;\n    }\n\n}\n","export {default as log} from 'loglevel';\nexport * from './src/utils';\n"]}